src/common/bytes.ts · UyCode/魔方栈

代码拉取完成,页面将自动刷新

richgiteeai

Watch

不关注关注所有动态仅关注版本发行动态关注但不提醒动态

1 Star 0 Fork 386

UyCode/魔方栈

forked from 华哲辰/魔方栈

代码 Issues 0 Pull Requests 0 Wiki 统计流水线

服务

加入 Gitee

与超过 1400万开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)

免费加入

已有帐号? 立即登录

文件

master

分支 (1)

标签 (1)

管理

master

v1.0

克隆/下载

HTTPS SSH SVN SVN+SSH 下载ZIP

提示

下载代码请复制以下命令到终端执行

为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置

git config --global user.name userName 
git config --global user.email userEmail

初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置

1 生成 RSA 密钥

2 获取 RSA 公钥内容,并配置到 SSH公钥中

在 Gitee 上使用 SVN,请访问使用指南

使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议配置并使用私人令牌替代登录密码进行克隆、推送等操作

Username for 'https://gitee.com': userName

Password for 'https://userName@gitee.com': # 私人令牌

分支 1

标签 1

cuber

src

common

bytes.ts

bytes.ts 1.64 KB

export default class ByteArray {
 static SIZE = 4096;
 static CHAR_MAP = ((): string[] => {
 const map = [];
 for (let i = 0; i < 256; i++) {
 map[i] = String.fromCharCode(i);
 }
 return map;
 })();

pages: Uint8Array[] = [];
 cursor = 0;
 constructor() {
 this.newPage();
 }

newPage(): void {
 this.pages.push(new Uint8Array(ByteArray.SIZE));
 this.cursor = 0;
 }

get length(): number {
 return (this.pages.length - 1) * ByteArray.SIZE + this.cursor;
 }

getData(): Uint8Array {
 const length = this.length;
 const data = new Uint8Array(length);
 let index = 0;
 for (let p = 0; p < this.pages.length; p++) {
 for (let i = 0; i < ByteArray.SIZE; i++) {
 data[index++] = this.pages[p][i];
 if (index == data.length) {
 break;
 }
 }
 }
 return data;
 }

writeByte(value: number): void {
 if (this.cursor >= ByteArray.SIZE) {
 this.newPage();
 }
 this.pages[this.pages.length - 1][this.cursor++] = value;
 }

writeShort(value: number): void {
 this.writeByte(value & 0xff);
 this.writeByte((value >> 8) & 0xff);
 }

writeLong(value: number): void {
 this.writeByte(value & 0xff);
 this.writeByte((value >> 8) & 0xff);
 this.writeByte((value >> 16) & 0xff);
 this.writeByte((value >> 24) & 0xff);
 }

writeBytes(array: Uint8Array, length: number | null = null): void {
 for (let i = 0; i < (length == null ? array.length : length); i++) {
 this.writeByte(array[i]);
 }
 }

writeString(value: string): void {
 for (let l = value.length, i = 0; i < l; i++) {
 this.writeByte(value.charCodeAt(i));
 }
 }
}

一键复制编辑原始数据按行查看历史

huazhechen 提交于 2020年04月21日 22:15 +08:00 . fix eslint

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

export default class ByteArray {
 static SIZE = 4096;
 static CHAR_MAP = ((): string[] => {
 const map = [];
 for (let i = 0; i < 256; i++) {
 map[i] = String.fromCharCode(i);
 }
 return map;
 })();

 pages: Uint8Array[] = [];
 cursor = 0;
 constructor() {
 this.newPage();
 }

 newPage(): void {
 this.pages.push(new Uint8Array(ByteArray.SIZE));
 this.cursor = 0;
 }

 get length(): number {
 return (this.pages.length - 1) * ByteArray.SIZE + this.cursor;
 }

 getData(): Uint8Array {
 const length = this.length;
 const data = new Uint8Array(length);
 let index = 0;
 for (let p = 0; p < this.pages.length; p++) {
 for (let i = 0; i < ByteArray.SIZE; i++) {
 data[index++] = this.pages[p][i];
 if (index == data.length) {
 break;
 }
 }
 }
 return data;
 }

 writeByte(value: number): void {
 if (this.cursor >= ByteArray.SIZE) {
 this.newPage();
 }
 this.pages[this.pages.length - 1][this.cursor++] = value;
 }

 writeShort(value: number): void {
 this.writeByte(value & 0xff);
 this.writeByte((value >> 8) & 0xff);
 }

 writeLong(value: number): void {
 this.writeByte(value & 0xff);
 this.writeByte((value >> 8) & 0xff);
 this.writeByte((value >> 16) & 0xff);
 this.writeByte((value >> 24) & 0xff);
 }

 writeBytes(array: Uint8Array, length: number | null = null): void {
 for (let i = 0; i < (length == null ? array.length : length); i++) {
 this.writeByte(array[i]);
 }
 }

 writeString(value: string): void {
 for (let l = value.length, i = 0; i < l; i++) {
 this.writeByte(value.charCodeAt(i));
 }
 }
}