GeezerVison is showing github.com — buffer/test/from-string.js at master · ExplodingCabbage/buffer

Expand file tree

from-string.js

Copy path

More file actions

Latest commit

History

131 lines (106 loc) · 3.18 KB

from-string.js

Copy path

File metadata and controls

131 lines (106 loc) · 3.18 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

const B = require('../').Buffer

const test = require('tape')

test('detect utf16 surrogate pairs', function (t) {

const text = '\uD83D\uDE38' + '\uD83D\uDCAD' + '\uD83D\uDC4D'

const buf = new B(text)

t.equal(text, buf.toString())

t.end()

})

test('detect utf16 surrogate pairs over U+20000 until U+10FFFF', function (t) {

const text = '\uD842\uDFB7' + '\uD93D\uDCAD' + '\uDBFF\uDFFF'

const buf = new B(text)

t.equal(text, buf.toString())

t.end()

})

test('replace orphaned utf16 surrogate lead code point', function (t) {

const text = '\uD83D\uDE38' + '\uD83D' + '\uD83D\uDC4D'

const buf = new B(text)

t.deepEqual(buf, new B([0xf0, 0x9f, 0x98, 0xb8, 0xef, 0xbf, 0xbd, 0xf0, 0x9f, 0x91, 0x8d]))

t.end()

})

test('replace orphaned utf16 surrogate trail code point', function (t) {

const text = '\uD83D\uDE38' + '\uDCAD' + '\uD83D\uDC4D'

const buf = new B(text)

t.deepEqual(buf, new B([0xf0, 0x9f, 0x98, 0xb8, 0xef, 0xbf, 0xbd, 0xf0, 0x9f, 0x91, 0x8d]))

t.end()

})

test('do not write partial utf16 code units', function (t) {

const f = new B([0, 0, 0, 0, 0])

t.equal(f.length, 5)

const size = f.write('あいうえお', 'utf16le')

t.equal(size, 4)

t.deepEqual(f, new B([0x42, 0x30, 0x44, 0x30, 0x00]))

t.end()

})

test('handle partial utf16 code points when encoding to utf8 the way node does', function (t) {

const text = '\uD83D\uDE38' + '\uD83D\uDC4D'

let buf = new B(8)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0xf0, 0x9f, 0x98, 0xb8, 0xf0, 0x9f, 0x91, 0x8d]))

buf = new B(7)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0xf0, 0x9f, 0x98, 0xb8, 0x00, 0x00, 0x00]))

buf = new B(6)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0xf0, 0x9f, 0x98, 0xb8, 0x00, 0x00]))

buf = new B(5)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0xf0, 0x9f, 0x98, 0xb8, 0x00]))

buf = new B(4)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0xf0, 0x9f, 0x98, 0xb8]))

buf = new B(3)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0x00, 0x00, 0x00]))

buf = new B(2)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0x00, 0x00]))

buf = new B(1)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0x00]))

t.end()

})

test('handle invalid utf16 code points when encoding to utf8 the way node does', function (t) {

const text = 'a' + '\uDE38\uD83D' + 'b'

let buf = new B(8)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0x61, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0x62]))

buf = new B(7)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0x61, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd]))

buf = new B(6)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0x61, 0xef, 0xbf, 0xbd, 0x00, 0x00]))

buf = new B(5)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0x61, 0xef, 0xbf, 0xbd, 0x00]))

buf = new B(4)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0x61, 0xef, 0xbf, 0xbd]))

buf = new B(3)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0x61, 0x00, 0x00]))

buf = new B(2)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0x61, 0x00]))

buf = new B(1)

buf.fill(0)

buf.write(text)

t.deepEqual(buf, new B([0x61]))

t.end()

})