utf8-parser.js ➔ unpack - Code Metrics - Inspection of "Zero dependencies" - rochars/byte-data - Measure and Improve Code Quality continuously with Scrutinizer

Passed

Branch — allin (30a887)

by Rafael S.

created 2020-01-28 18:06 UTC

utf8-parser.js ➔ unpack F

↳ Parent: lib/utf8-parser.js

Complexity

Conditions

Size

Total Lines	61
Code Lines	43

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
cc	14
eloc	43
dl	0
loc	61
rs	3.6
c	0
b	0
f	0

How to fix Long Method Complexity

/*
 * Copyright (c) 2018 Rafael da Silva Rocha.
 *
 * Permission is hereby granted, free of charge, to any person obtaining
 * a copy of this software and associated documentation files (the
 * "Software"), to deal in the Software without restriction, including
 * without limitation the rights to use, copy, modify, merge, publish,
 * distribute, sublicense, and/or sell copies of the Software, and to
 * permit persons to whom the Software is furnished to do so, subject to
 * the following conditions:
 *
 * The above copyright notice and this permission notice shall be
 * included in all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 *
 */

/**
 * @fileoverview Functions to serialize and deserialize UTF-8 strings.
 * @see https://github.com/rochars/byte-data
 * @see https://encoding.spec.whatwg.org/#the-encoding
 * @see https://encoding.spec.whatwg.org/#utf-8-encoder
 */

/**
 * Read a string of UTF-8 characters from a byte buffer.
 * Invalid characters are replaced with 'REPLACEMENT CHARACTER' (U+FFFD).
 * @see https://encoding.spec.whatwg.org/#the-encoding
 * @see https://stackoverflow.com/a/34926911
 * @param {!Uint8Array|!Array<number>} buffer A byte buffer.
 * @param {number=} start The buffer index to start reading.
 * @param {?number=} end The buffer index to stop reading.
 *   Assumes the buffer length if undefined.
 * @return {string}
 */
export function unpack(buffer, start=0, end=buffer.length) {
  /** @type {string} */
  let str = '';
  for(let index = start; index < end;) {
    /** @type {number} */
    let lowerBoundary = 0x80;
    /** @type {number} */
    let upperBoundary = 0xBF;
    /** @type {boolean} */
    let replace = false;
    /** @type {number} */
    let charCode = buffer[index++];
    if (charCode >= 0x00 && charCode <= 0x7F) {
      str += String.fromCharCode(charCode);
    } else {
      /** @type {number} */
      let count = 0;
      if (charCode >= 0xC2 && charCode <= 0xDF) {
        count = 1;
      } else if (charCode >= 0xE0 && charCode <= 0xEF ) {
        count = 2;
        if (buffer[index] === 0xE0) {
          lowerBoundary = 0xA0;
        }
        if (buffer[index] === 0xED) {
          upperBoundary = 0x9F;
        }
      } else if (charCode >= 0xF0 && charCode <= 0xF4 ) {
        count = 3;
        if (buffer[index] === 0xF0) {
          lowerBoundary = 0x90;
        }
        if (buffer[index] === 0xF4) {
          upperBoundary = 0x8F;
        }
      } else {
        replace = true;
      }
      charCode = charCode & (1 << (8 - count - 1)) - 1;
      for (let i = 0; i < count; i++) {
        if (buffer[index] < lowerBoundary || buffer[index] > upperBoundary) {
          replace = true;
        }
        charCode = (charCode << 6) | (buffer[index] & 0x3f);
        index++;
      }
      if (replace) {
        str += String.fromCharCode(0xFFFD);
      } 
      else if (charCode <= 0xffff) {
        str += String.fromCharCode(charCode);
      } else {
        charCode -= 0x10000;
        str += String.fromCharCode(
          ((charCode >> 10) & 0x3ff) + 0xd800,
          (charCode & 0x3ff) + 0xdc00);
      }
    }
  }
  return str;
}

/**
 * Write a string of UTF-8 characters to a byte buffer.
 * @see https://encoding.spec.whatwg.org/#utf-8-encoder
 * @param {string} str The string to pack.
 * @param {!Uint8Array|!Array<number>} buffer The buffer to pack the string to.
 * @param {number=} index The buffer index to start writing.
 * @return {number} The next index to write in the buffer.
 */
export function pack(str, buffer, index=0) {
  for (let i = 0, len = str.length; i < len; i++) {
    /** @type {number} */
    let codePoint = str.codePointAt(i);
    if (codePoint < 128) {
      buffer[index] = codePoint;
      index++;
    } else {
      /** @type {number} */
      let count = 0;
      /** @type {number} */
      let offset = 0;
      if (codePoint <= 0x07FF) {
        count = 1;
        offset = 0xC0;
      } else if(codePoint <= 0xFFFF) {
        count = 2;
        offset = 0xE0;
      } else if(codePoint <= 0x10FFFF) {
        count = 3;
        offset = 0xF0;
        i++;

      }
      buffer[index] = (codePoint >> (6 * count)) + offset;
      index++;
      while (count > 0) {
        buffer[index] = 0x80 | (codePoint >> (6 * (count - 1)) & 0x3F);
        index++;
        count--;
      }
    }
  }
  return index;
}


1			/*
2			* Copyright (c) 2018 Rafael da Silva Rocha.
3			*
4			* Permission is hereby granted, free of charge, to any person obtaining
5			* a copy of this software and associated documentation files (the
6			* "Software"), to deal in the Software without restriction, including
7			* without limitation the rights to use, copy, modify, merge, publish,
8			* distribute, sublicense, and/or sell copies of the Software, and to
9			* permit persons to whom the Software is furnished to do so, subject to
10			* the following conditions:
11			*
12			* The above copyright notice and this permission notice shall be
13			* included in all copies or substantial portions of the Software.
14			*
15			* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
16			* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
17			* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
18			* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
19			* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
20			* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
21			* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
22			*
23			*/
24
25			/**
26			* @fileoverview Functions to serialize and deserialize UTF-8 strings.
27			* @see https://github.com/rochars/byte-data
28			* @see https://encoding.spec.whatwg.org/#the-encoding
29			* @see https://encoding.spec.whatwg.org/#utf-8-encoder
30			*/
31
32			/**
33			* Read a string of UTF-8 characters from a byte buffer.
34			* Invalid characters are replaced with 'REPLACEMENT CHARACTER' (U+FFFD).
35			* @see https://encoding.spec.whatwg.org/#the-encoding
36			* @see https://stackoverflow.com/a/34926911
37			* @param {!Uint8Array\|!Array<number>} buffer A byte buffer.
38			* @param {number=} start The buffer index to start reading.
39			* @param {?number=} end The buffer index to stop reading.
40			* Assumes the buffer length if undefined.
41			* @return {string}
42			*/
43			export function unpack(buffer, start=0, end=buffer.length) {
44			/** @type {string} */
45			let str = '';
46			for(let index = start; index < end;) {
47			/** @type {number} */
48			let lowerBoundary = 0x80;
49			/** @type {number} */
50			let upperBoundary = 0xBF;
51			/** @type {boolean} */
52			let replace = false;
53			/** @type {number} */
54			let charCode = buffer[index++];
55			if (charCode >= 0x00 && charCode <= 0x7F) {
56			str += String.fromCharCode(charCode);
57			} else {
58			/** @type {number} */
59			let count = 0;
60			if (charCode >= 0xC2 && charCode <= 0xDF) {
61			count = 1;
62			} else if (charCode >= 0xE0 && charCode <= 0xEF ) {
63			count = 2;
64			if (buffer[index] === 0xE0) {
65			lowerBoundary = 0xA0;
66			}
67			if (buffer[index] === 0xED) {
68			upperBoundary = 0x9F;
69			}
70			} else if (charCode >= 0xF0 && charCode <= 0xF4 ) {
71			count = 3;
72			if (buffer[index] === 0xF0) {
73			lowerBoundary = 0x90;
74			}
75			if (buffer[index] === 0xF4) {
76			upperBoundary = 0x8F;
77			}
78			} else {
79			replace = true;
80			}
81			charCode = charCode & (1 << (8 - count - 1)) - 1;
82			for (let i = 0; i < count; i++) {
83			if (buffer[index] < lowerBoundary \|\| buffer[index] > upperBoundary) {
84			replace = true;
85			}
86			charCode = (charCode << 6) \| (buffer[index] & 0x3f);
87			index++;
88			}
89			if (replace) {
90			str += String.fromCharCode(0xFFFD);
91			}
92			else if (charCode <= 0xffff) {
93			str += String.fromCharCode(charCode);
94			} else {
95			charCode -= 0x10000;
96			str += String.fromCharCode(
97			((charCode >> 10) & 0x3ff) + 0xd800,
98			(charCode & 0x3ff) + 0xdc00);
99			}
100			}
101			}
102			return str;
103			}
104
105			/**
106			* Write a string of UTF-8 characters to a byte buffer.
107			* @see https://encoding.spec.whatwg.org/#utf-8-encoder
108			* @param {string} str The string to pack.
109			* @param {!Uint8Array\|!Array<number>} buffer The buffer to pack the string to.
110			* @param {number=} index The buffer index to start writing.
111			* @return {number} The next index to write in the buffer.
112			*/
113			export function pack(str, buffer, index=0) {
114			for (let i = 0, len = str.length; i < len; i++) {
115			/** @type {number} */
116			let codePoint = str.codePointAt(i);
117			if (codePoint < 128) {
118			buffer[index] = codePoint;
119			index++;
120			} else {
121			/** @type {number} */
122			let count = 0;
123			/** @type {number} */
124			let offset = 0;
125			if (codePoint <= 0x07FF) {
126			count = 1;
127			offset = 0xC0;
128			} else if(codePoint <= 0xFFFF) {
129			count = 2;
130			offset = 0xE0;
131			} else if(codePoint <= 0x10FFFF) {
132			count = 3;
133			offset = 0xF0;
134			i++;
			0 ignored issues – show Complexity Coding Style introduced 2018-07-15 05:37 UTC by Report Bug Copy Issue Report You seem to be assigning a new value to the loop variable `i` here. Please check if this was indeed your intention. Even if it was, consider using another kind of loop instead. Loading history...
135			}
136			buffer[index] = (codePoint >> (6 * count)) + offset;
137			index++;
138			while (count > 0) {
139			buffer[index] = 0x80 \| (codePoint >> (6 * (count - 1)) & 0x3F);
140			index++;
141			count--;
142			}
143			}
144			}
145			return index;
146			}
147

rochars / byte-data

Branch — allin (30a887)

utf8-parser.js ➔ unpack F

Complexity

Size

Duplication

Importance

How to fix Long Method Complexity

Long Method

Complexity

Duplication Side-by-Side

Filter issues like