File size: 22,251 Bytes
5fae594 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 |
describe('jsonPath', function(){
describe('compiles valid syntax while rejecting invalid', function() {
it("compiles a basic pattern without throwing", function(){
expect(compiling('!')).not.toThrow();
});
describe("syntactically invalid patterns", function() {
it("fail on single invalid token", function(){
expect(compiling('/')).toThrow();
});
it("fail on invalid pattern with some valid tokens", function(){
expect(compiling('foo/')).toThrow();
});
it("fail on unclosed duck clause", function(){
expect(compiling('{foo')).toThrow();
});
it("fail on token with capture alone", function(){
expect(compiling('foo$')).toThrow();
});
});
});
describe('patterns match correct paths', function() {
describe('when pattern has only bang', function() {
it("should match root", function(){
expect('!').toMatchPath([]);
});
it("should miss non-root", function(){
expect('!').not.toMatchPath(['a']);
expect('!').not.toMatchPath(['a', 'b']);
});
});
it('should match * universally', function() {
expect('*').toMatchPath( [] );
expect('*').toMatchPath( ['a'] );
expect('*').toMatchPath( ['a', 2] );
expect('*').toMatchPath( ['a','b'] );
});
it('should match empty pattern universally', function() {
expect('').toMatchPath( [] );
expect('').toMatchPath( ['a'] );
expect('').toMatchPath( ['a', 2] );
expect('').toMatchPath( ['a','b'] );
});
it('should match !.* against any top-level path node', function() {
expect('!.*').toMatchPath( ['foo'])
expect('!.*').toMatchPath( ['bar'])
expect('!.*').not.toMatchPath( [])
expect('!.*').not.toMatchPath( ['foo', 'bar'])
});
it('should match !..* against anything but the root', function() {
expect('!..*').not.toMatchPath( [] );
expect('!..*').toMatchPath( ['a'] );
expect('!..*').toMatchPath( ['a','b'] );
});
it('should match *..* against anything except the root since it requires a decendant ' +
'which the root will never satisfy because it cannot have an ancestor', function() {
expect('*..*').not.toMatchPath( [] );
expect('*..*').toMatchPath( ['a'] );
expect('*..*').toMatchPath( ['a','b'] );
});
it('should match !.foo against foo node at first level only', function(){
expect('!.foo').toMatchPath( ['foo'] );
expect('!.foo').not.toMatchPath( [] );
expect('!.foo').not.toMatchPath( ['foo', 'bar']);
expect('!.foo').not.toMatchPath( ['bar'] );
});
it('should match !.foo.bar against paths with foo as first node and bar as second', function() {
expect('!.a.b').toMatchPath( ['a', 'b'])
expect('!.a.b').not.toMatchPath( [])
expect('!.a.b').not.toMatchPath( ['a'])
});
it('should match !..foo against any path ending in foo', function(){
expect('!..foo').not.toMatchPath( []);
expect('!..foo').toMatchPath( ['foo']);
expect('!..foo').toMatchPath( ['a', 'foo']);
expect('!..foo').not.toMatchPath( ['a', 'foo', 'a']);
expect('!..foo').toMatchPath( ['a', 'foo', 'foo']);
expect('!..foo').toMatchPath( ['a', 'a', 'foo']);
expect('!..foo').not.toMatchPath( ['a', 'a', 'foot']);
expect('!..foo').not.toMatchPath( ['a', 'foo', 'foo', 'a']);
});
it('should match ..foo like !..foo', function() {
expect('..foo').not.toMatchPath( []);
expect('..foo').toMatchPath( ['foo']);
expect('..foo').toMatchPath( ['a', 'foo']);
expect('..foo').not.toMatchPath( ['a', 'foo', 'a']);
expect('..foo').toMatchPath( ['a', 'foo', 'foo']);
expect('..foo').toMatchPath( ['a', 'a', 'foo']);
expect('..foo').not.toMatchPath( ['a', 'a', 'foot']);
expect('..foo').not.toMatchPath( ['a', 'foo', 'foo', 'a']);
});
it('should match foo like !..foo or ..foo', function() {
expect('foo').not.toMatchPath( []);
expect('foo').toMatchPath( ['foo']);
expect('foo').toMatchPath( ['a', 'foo']);
expect('foo').not.toMatchPath( ['a', 'foo', 'a']);
expect('foo').toMatchPath( ['a', 'foo', 'foo']);
expect('foo').toMatchPath( ['a', 'a', 'foo']);
expect('foo').not.toMatchPath( ['a', 'a', 'foot']);
expect('foo').not.toMatchPath( ['a', 'foo', 'foo', 'a']);
});
it('is not fooled by substrings in path nodes', function(){
expect('!.foo').not.toMatchPath( ['foot'])
});
it('matches !..foo.bar against bars which are direct children of a foo anywhere in the document', function() {
expect('!..foo.bar').not.toMatchPath( []);
expect('!..foo.bar').not.toMatchPath( ['foo']);
expect('!..foo.bar').not.toMatchPath( ['a', 'foo']);
expect('!..foo.bar').toMatchPath( ['a', 'foo', 'bar']);
expect('!..foo.bar').not.toMatchPath( ['a', 'foo', 'foo']);
expect('!..foo.bar').toMatchPath( ['a', 'a', 'a', 'foo', 'bar']);
expect('!..foo.bar').not.toMatchPath( ['a', 'a', 'a', 'foo', 'bar', 'a']);
});
it('matches foo.bar like !..foo.bar', function() {
expect('foo.bar').not.toMatchPath( [])
expect('foo.bar').not.toMatchPath( ['foo'])
expect('foo.bar').not.toMatchPath( ['a', 'foo'])
expect('foo.bar').toMatchPath( ['a', 'foo', 'bar'])
expect('foo.bar').not.toMatchPath( ['a', 'foo', 'foo'])
expect('foo.bar').toMatchPath( ['a', 'a', 'a', 'foo', 'bar'])
expect('foo.bar').not.toMatchPath( ['a', 'a', 'a', 'foo', 'bar', 'a'])
});
it('matches !..foo.*.bar only if there is an intermediate node between foo and bar', function(){
expect('!..foo.*.bar').not.toMatchPath( [])
expect('!..foo.*.bar').not.toMatchPath( ['foo'])
expect('!..foo.*.bar').not.toMatchPath( ['a', 'foo'])
expect('!..foo.*.bar').not.toMatchPath( ['a', 'foo', 'bar'])
expect('!..foo.*.bar').toMatchPath( ['a', 'foo', 'a', 'bar'])
expect('!..foo.*.bar').not.toMatchPath( ['a', 'foo', 'foo'])
expect('!..foo.*.bar').not.toMatchPath( ['a', 'a', 'a', 'foo', 'bar'])
expect('!..foo.*.bar').toMatchPath( ['a', 'a', 'a', 'foo', 'a', 'bar'])
expect('!..foo.*.bar').not.toMatchPath( ['a', 'a', 'a', 'foo', 'bar', 'a'])
expect('!..foo.*.bar').not.toMatchPath( ['a', 'a', 'a', 'foo', 'a', 'bar', 'a'])
});
describe('with numeric path nodes in the pattern', function() {
it('should be able to handle numeric nodes in object notation', function(){
expect('!.a.2').toMatchPath( ['a', 2])
expect('!.a.2').toMatchPath( ['a', '2'])
expect('!.a.2').not.toMatchPath( [])
expect('!.a.2').not.toMatchPath( ['a'])
});
it('should be able to handle numberic nodes in array notation', function(){
expect('!.a[2]').toMatchPath( ['a', 2])
expect('!.a[2]').toMatchPath( ['a', '2'])
expect('!.a[2]').not.toMatchPath( [])
expect('!.a[2]').not.toMatchPath( ['a'])
});
});
describe('with array notation', function() {
it('should handle adjacent array notations', function(){
expect('!["a"][2]').toMatchPath( ['a', 2])
expect('!["a"][2]').toMatchPath( ['a', '2'])
expect('!["a"][2]').not.toMatchPath( [])
expect('!["a"][2]').not.toMatchPath( ['a'])
});
it('should allow to specify child of root', function(){
expect('![2]').toMatchPath( [2])
expect('![2]').toMatchPath( ['2'])
expect('![2]').not.toMatchPath( [])
expect('![2]').not.toMatchPath( ['a'])
});
it('should be allowed to contain a star', function(){
expect('![*]').toMatchPath( [2])
expect('![*]').toMatchPath( ['2'])
expect('![*]').toMatchPath( ['a'])
expect('![*]').not.toMatchPath( [])
});
});
describe('composition of several tokens into complex patterns', function() {
it('should be able to handle more than one double dot', function() {
expect('!..foods..fr')
.toMatchPath( ['foods', 2, 'name', 'fr']);
});
it('should be able to match ..* or ..[*] as if it were * because .. matches zero nodes', function(){
expect('!..*.bar')
.toMatchPath(['anything', 'bar']);
expect('!..[*].bar')
.toMatchPath(['anything', 'bar']);
});
});
describe('using css4-style syntax', function() {
it('returns deepest node when no css4-style syntax is used', function(){
expect( matchOf( 'l2.*' ).against(
ascentFrom({ l1: {l2: {l3:'leaf'}}})
)).toSpecifyNode('leaf');
});
it('returns correct named node', function(){
expect( matchOf( '$l2.*' ).against(
ascentFrom({ l1: {l2: {l3:'leaf'}}})
)).toSpecifyNode({l3:'leaf'});
});
it('returns correct node when css4-style pattern is followed by double dot', function() {
expect( matchOf( '!..$foo..bar' ).against(
ascentFrom({ l1: {foo: {l3: {bar: 'leaf'}}}})
)).toSpecifyNode({l3: {bar: 'leaf'}});
});
it('can match children of root while capturing the root', function() {
expect( matchOf( '$!.*' ).against(
ascentFrom({ l1: 'leaf' })
)).toSpecifyNode({ l1: 'leaf' });
});
it('returns captured node with array notation', function() {
expect( matchOf( '$["l1"].l2' ).against(
ascentFrom({ l1: {l2:'leaf'} })
)).toSpecifyNode({ l2: 'leaf' });
});
it('returns captured node with array numbered notation', function() {
expect( matchOf( '$["2"].l2' ).against(
ascentFrom({ '2': {l2:'leaf'} })
)).toSpecifyNode({ l2: 'leaf' });
});
it('returns captured node with star notation', function() {
expect( matchOf( '!..$*.l3' ).against(
ascentFrom({ l1: {l2:{l3:'leaf'}} })
)).toSpecifyNode({ l3: 'leaf' });
});
it('returns captured node with array star notation', function(){
expect( matchOf( '!..$[*].l3' ).against(
ascentFrom({ l1: {l2:{l3:'leaf'}} })
)).toSpecifyNode({ l3: 'leaf' });
});
});
describe('with duck matching', function() {
it('can do basic ducking', function(){
var rootJson = {
people:{
jack:{
name: 'Jack'
, email: '[email protected]'
}
}
};
expect( matchOf( '{name email}' ).against(
asAscent(
[ 'people', 'jack' ],
[rootJson, rootJson.people, rootJson.people.jack ]
)
)).toSpecifyNode({name: 'Jack', email: '[email protected]'});
});
it('can duck on two levels of a path', function(){
var rootJson = {
people:{
jack:{
name: 'Jack'
, email: '[email protected]'
}
}
};
expect( matchOf( '{people}.{jack}.{name email}' ).against(
asAscent(
[ 'people', 'jack' ],
[rootJson, rootJson.people, rootJson.people.jack ]
)
)).toSpecifyNode({name: 'Jack', email: '[email protected]'});
});
it('fails if one duck is unsatisfied', function(){
var rootJson = {
people:{
jack:{
name: 'Jack'
, email: '[email protected]'
}
}
};
expect( matchOf( '{people}.{alberto}.{name email}' ).against(
asAscent(
[ 'people', 'jack' ],
[rootJson, rootJson.people, rootJson.people.jack ]
)
)).not.toSpecifyNode({name: 'Jack', email: '[email protected]'});
});
it('can construct the root duck type', function(){
var rootJson = {
people:{
jack:{
name: 'Jack'
, email: '[email protected]'
}
}
};
expect( matchOf( '{}' ).against(
asAscent(
[ 'people', 'jack' ],
[rootJson, rootJson.people, rootJson.people.jack ]
)
)).toSpecifyNode({name: 'Jack', email: '[email protected]'});
});
it('does not match if not all fields are there', function(){
var rootJson = {
people:{
jack:{
// no name here!
email: '[email protected]'
}
}
};
expect( matchOf( '{name email}' ).against(
asAscent(
[ 'people', 'jack' ],
[rootJson, rootJson.people, rootJson.people.jack ]
)
)).not.toSpecifyNode({name: 'Jack', email: '[email protected]'});
});
it('fails if something upstream fails', function(){
var rootJson = {
women:{
betty:{
name:'Betty'
, email: '[email protected]'
}
},
men:{
// we don't have no menz!
}
};
expect( matchOf( 'men.{name email}' ).against(
asAscent(
[ 'women', 'betty' ],
[rootJson, rootJson.women, rootJson.women.betty ]
)
)).not.toSpecifyNode({name: 'Jack', email: '[email protected]'});
});
it('does not crash given ascent starting from non-objects', function(){
var rootJson = [ 1, 2, 3 ];
expect( function(){ matchOf( '{spin taste}' ).against(
asAscent(
[ '0' ],
[rootJson, rootJson[0] ]
)
)}).not.toThrow();
});
it('does not match when given non-object', function(){
var rootJson = [ 1, 2, 3 ];
expect( matchOf( '{spin taste}' ).against(
asAscent(
[ '0' ],
[rootJson, rootJson[0] ]
)
)).toBeFalsy();
});
});
});
beforeEach(function(){
this.addMatchers({
toSpecifyNode: function( expectedNode ){
function jsonSame(a,b) {
return JSON.stringify(a) == JSON.stringify(b);
}
var match = this.actual;
var notClause = this.isNot? ' any node except ' : 'node';
this.message = function () {
return "Expected " + notClause + ' ' + JSON.stringify(expectedNode) + " but got " +
(match.node? JSON.stringify(match.node) : 'no match');
}
return jsonSame( expectedNode, match.node );
}
, toMatchPath:function( pathStack ) {
var pattern = this.actual;
try{
return !!matchOf(pattern).against(asAscent(pathStack));
} catch( e ) {
this.message = function(){
return 'Error thrown running pattern "' + pattern +
'" against path [' + pathStack.join(',') + ']' + "\n" + (e.stack || e.message)
};
return false;
}
}
});
});
function compiling(pattern) {
return function(){
jsonPathCompiler(pattern);
}
}
function matchOf(pattern) {
var compiledPattern = jsonPathCompiler(pattern);
return {
against:function(ascent) {
return compiledPattern(ascent);
}
};
}
// for the given pattern, return an array of empty objects of the one greater length to
// stand in for the nodestack in the cases where we only care about match or not match.
// one greater because the root node doesnt have a name
function fakeNodeStack(path){
var rtn = path.map(function(){return {}});
rtn.unshift({iAm:'root'});
return rtn;
}
function asAscent(pathStack, nodeStack){
// first, make a defensive copy of the vars so that we can mutate them at will:
pathStack = pathStack && JSON.parse(JSON.stringify(pathStack));
nodeStack = nodeStack && JSON.parse(JSON.stringify(nodeStack));
// change the two parameters into the test from arrays (which are easy to write as in-line js) to
// lists (which is what the code under test needs)
nodeStack = nodeStack || fakeNodeStack(pathStack);
pathStack.unshift(ROOT_PATH);
// NB: can't use the more functional Array.prototype.reduce here, IE8 doesn't have it and might not
// be polyfilled
var ascent = emptyList;
for (var i = 0; i < pathStack.length; i++) {
var mapping = {key: pathStack[i], node:nodeStack[i]};
ascent = cons( mapping, ascent );
}
return ascent;
}
});
|