Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Resolves #12 Update test cases to use Same method #14

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Resolves #12 Update test cases to use Same method #14

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
60 changes: 30 additions & 30 deletions tests/helper.test.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,35 +3,35 @@ const sgf = require('..')

t.test('parseDates', t => {
t.test('should parse comma-separated dates', t => {
t.deepEqual(sgf.parseDates('1996-12-27,1997-01-03'), [
t.same(sgf.parseDates('1996-12-27,1997-01-03'), [
[1996, 12, 27],
[1997, 1, 3]
])

t.end()
})
t.test('should be able to handle empty strings', t => {
t.deepEqual(sgf.parseDates(''), [])
t.same(sgf.parseDates(''), [])

t.end()
})
t.test('should handle short-hand notation', t => {
t.deepEqual(sgf.parseDates('1996-05,06'), [
t.same(sgf.parseDates('1996-05,06'), [
[1996, 5],
[1996, 6]
])
t.deepEqual(sgf.parseDates('1996-05,06-01'), [
t.same(sgf.parseDates('1996-05,06-01'), [
[1996, 5],
[1996, 6, 1]
])
t.deepEqual(sgf.parseDates('1996-05,1997'), [[1996, 5], [1997]])
t.deepEqual(sgf.parseDates('1996-05-06,07,08'), [
t.same(sgf.parseDates('1996-05,1997'), [[1996, 5], [1997]])
t.same(sgf.parseDates('1996-05-06,07,08'), [
[1996, 5, 6],
[1996, 5, 7],
[1996, 5, 8]
])
t.deepEqual(sgf.parseDates('1996,1997'), [[1996], [1997]])
t.deepEqual(sgf.parseDates('1996-12-27,28,1997-01-03,04'), [
t.same(sgf.parseDates('1996,1997'), [[1996], [1997]])
t.same(sgf.parseDates('1996-12-27,28,1997-01-03,04'), [
[1996, 12, 27],
[1996, 12, 28],
[1997, 1, 3],
Expand Down Expand Up @@ -88,7 +88,7 @@ t.test('stringifyDates', t => {
t.end()
})
t.test('should be inverse to parseDates', t => {
t.deepEqual(
t.same(
sgf.parseDates(
sgf.stringifyDates([
[1996, 5],
Expand All @@ -100,7 +100,7 @@ t.test('stringifyDates', t => {
[1996, 6]
]
)
t.deepEqual(
t.same(
sgf.parseDates(
sgf.stringifyDates([
[1996, 5, 6],
Expand All @@ -114,11 +114,11 @@ t.test('stringifyDates', t => {
[1996, 5, 8]
]
)
t.deepEqual(sgf.parseDates(sgf.stringifyDates([[1996], [1997]])), [
t.same(sgf.parseDates(sgf.stringifyDates([[1996], [1997]])), [
[1996],
[1997]
])
t.deepEqual(
t.same(
sgf.parseDates(
sgf.stringifyDates([
[1996, 12, 27],
Expand Down Expand Up @@ -154,19 +154,19 @@ t.test('stringifyDates', t => {

t.test('parseVertex', t => {
t.test('should return [-1, -1] when passing string with length > 2', t => {
t.deepEqual(sgf.parseVertex(''), [-1, -1])
t.deepEqual(sgf.parseVertex('d'), [-1, -1])
t.deepEqual(sgf.parseVertex('blah'), [-1, -1])
t.same(sgf.parseVertex(''), [-1, -1])
t.same(sgf.parseVertex('d'), [-1, -1])
t.same(sgf.parseVertex('blah'), [-1, -1])

t.end()
})
t.test('should work', t => {
t.deepEqual(sgf.parseVertex('bb'), [1, 1])
t.deepEqual(sgf.parseVertex('jj'), [9, 9])
t.deepEqual(sgf.parseVertex('jf'), [9, 5])
t.deepEqual(sgf.parseVertex('fa'), [5, 0])
t.deepEqual(sgf.parseVertex('fA'), [5, 26])
t.deepEqual(sgf.parseVertex('AB'), [26, 27])
t.same(sgf.parseVertex('bb'), [1, 1])
t.same(sgf.parseVertex('jj'), [9, 9])
t.same(sgf.parseVertex('jf'), [9, 5])
t.same(sgf.parseVertex('fa'), [5, 0])
t.same(sgf.parseVertex('fA'), [5, 26])
t.same(sgf.parseVertex('AB'), [26, 27])

t.end()
})
Expand All @@ -179,7 +179,7 @@ t.test('parseVertex', t => {
[0, 0]
]
tests.forEach(test =>
t.deepEqual(sgf.parseVertex(sgf.stringifyVertex(test)), test)
t.same(sgf.parseVertex(sgf.stringifyVertex(test)), test)
)

t.end()
Expand Down Expand Up @@ -227,27 +227,27 @@ t.test('stringifyVertex', t => {

t.test('parseCompressedVertices', t => {
t.test('should handle points normally', t => {
t.deepEqual(sgf.parseCompressedVertices('ce'), [sgf.parseVertex('ce')])
t.deepEqual(sgf.parseCompressedVertices('aa'), [sgf.parseVertex('aa')])
t.deepEqual(sgf.parseCompressedVertices('Az'), [sgf.parseVertex('Az')])
t.same(sgf.parseCompressedVertices('ce'), [sgf.parseVertex('ce')])
t.same(sgf.parseCompressedVertices('aa'), [sgf.parseVertex('aa')])
t.same(sgf.parseCompressedVertices('Az'), [sgf.parseVertex('Az')])

t.end()
})
t.test('should handle one point compressions', t => {
t.deepEqual(sgf.parseCompressedVertices('ce:ce'), [sgf.parseVertex('ce')])
t.deepEqual(sgf.parseCompressedVertices('aa:aa'), [sgf.parseVertex('aa')])
t.deepEqual(sgf.parseCompressedVertices('Az:Az'), [sgf.parseVertex('Az')])
t.same(sgf.parseCompressedVertices('ce:ce'), [sgf.parseVertex('ce')])
t.same(sgf.parseCompressedVertices('aa:aa'), [sgf.parseVertex('aa')])
t.same(sgf.parseCompressedVertices('Az:Az'), [sgf.parseVertex('Az')])

t.end()
})
t.test('should handle compressions', t => {
t.deepEqual(sgf.parseCompressedVertices('aa:bb'), [
t.same(sgf.parseCompressedVertices('aa:bb'), [
[0, 0],
[0, 1],
[1, 0],
[1, 1]
])
t.deepEqual(sgf.parseCompressedVertices('bb:aa'), [
t.same(sgf.parseCompressedVertices('bb:aa'), [
[0, 0],
[0, 1],
[1, 0],
Expand Down
18 changes: 9 additions & 9 deletions tests/parse.test.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -17,7 +17,7 @@ function getJSON(tree) {
}

t.test('should parse multiple nodes', t => {
t.deepEqual(
t.same(
getJSON(sgf.parse('(;B[aa]SZ[19];AB[cc][dd:ee])')[0]),
getJSON({
data: {B: ['aa'], SZ: ['19']},
Expand All @@ -34,7 +34,7 @@ t.test('should parse multiple nodes', t => {
})

t.test('should not omit CA property', t => {
t.deepEqual(
t.same(
getJSON(sgf.parse('(;B[aa]CA[UTF-8])', {encoding: 'ISO-8859-1'})[0]),
getJSON({
data: {B: ['aa'], CA: ['UTF-8']},
Expand All @@ -46,7 +46,7 @@ t.test('should not omit CA property', t => {
})

t.test('should parse variations', t => {
t.deepEqual(
t.same(
getJSON(sgf.parse('(;B[hh](;W[ii])(;W[hi]C[h]))')[0]),
getJSON({
data: {B: ['hh']},
Expand Down Expand Up @@ -75,7 +75,7 @@ t.test('should emit onNodeCreated correctly', t => {
}
})

t.deepEqual(nodes, [
t.same(nodes, [
{
children: [],
data: {B: ['hh']},
Expand Down Expand Up @@ -106,7 +106,7 @@ t.test('should emit onNodeCreated correctly', t => {
})

t.test('should convert lower case properties', t => {
t.deepEqual(
t.same(
getJSON(
sgf.parse('(;CoPyright[hello](;White[ii])(;White[hi]Comment[h]))')[0]
),
Expand Down Expand Up @@ -139,7 +139,7 @@ t.test('should be able to parse nodes outside a game', t => {
let trees1 = sgf.parse(';B[hh];W[ii]')
let trees2 = sgf.parse('(;B[hh];W[ii])')

t.deepEqual(trees1, trees2)
t.same(trees1, trees2)
t.end()
})

Expand All @@ -148,13 +148,13 @@ t.test('should be able to correctly parse a game that misses initial ;', t => {
let trees2 = sgf.parse('(B[hh];W[ii])')
let trees3 = sgf.parse('(;B[hh];W[ii])')

t.deepEqual(trees1, trees3)
t.deepEqual(trees2, trees3)
t.same(trees1, trees3)
t.same(trees2, trees3)
t.end()
})

t.test('should ignore empty variations', t => {
t.deepEqual(
t.same(
getJSON(sgf.parse('(;B[hh]()(;W[ii])()(;W[hi]C[h]))')[0]),
getJSON({
data: {B: ['hh']},
Expand Down
12 changes: 6 additions & 6 deletions tests/tokenize.test.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,7 @@ t.test('should track source position correctly', t => {
let contents = '(;B[aa]SZ[19]\n;AB[cc]\n[dd:ee])'
let len = contents.length - 1

t.deepEqual(tokenize(contents), [
t.same(tokenize(contents), [
{
type: 'parenthesis',
value: '(',
Expand Down Expand Up @@ -89,7 +89,7 @@ t.test('should take escaping values into account', t => {
let contents = '(;C[hello\\]world];C[hello\\\\];C[hello])'
let len = contents.length - 1

t.deepEqual(tokenize(contents), [
t.same(tokenize(contents), [
{
type: 'parenthesis',
value: '(',
Expand Down Expand Up @@ -169,7 +169,7 @@ t.test('should take escaping values into account', t => {
contents = '(;C[\\];B[aa];W[bb])'
len = contents.length - 1

t.deepEqual(tokenize(contents), [
t.same(tokenize(contents), [
{
type: 'parenthesis',
value: '(',
Expand Down Expand Up @@ -229,7 +229,7 @@ t.test('should allow lower case properties', t => {
let contents = '(;CoPyright[blah])'
let len = contents.length - 1

t.deepEqual(tokenize(contents), [
t.same(tokenize(contents), [
{
type: 'parenthesis',
value: '(',
Expand Down Expand Up @@ -272,7 +272,7 @@ t.test('should take new lines inside token values into account', t => {
let contents = '(;C[bl\nah])'
let len = contents.length - 1

t.deepEqual(tokenize(contents), [
t.same(tokenize(contents), [
{
type: 'parenthesis',
value: '(',
Expand Down Expand Up @@ -308,7 +308,7 @@ t.test('should return invalid tokens', t => {
let contents = '(;C[hi]%[invalid])'
let len = contents.length - 1

t.deepEqual(tokenize(contents), [
t.same(tokenize(contents), [
{
type: 'parenthesis',
value: '(',
Expand Down