assemblyscript/std/assembly/staticarray.ts at threadsafe · deep-stack/assemblyscript · GitHub

History

246 lines (225 loc) · 9.43 KB

Raw

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

/// <reference path="./rt/index.d.ts" />

import { BLOCK, BLOCK_MAXSIZE, BLOCK_OVERHEAD } from "./rt/common";

import { idof } from "./builtins";

import { Array } from "./array";

import { E_INDEXOUTOFRANGE, E_INVALIDLENGTH, E_HOLEYARRAY } from "./util/error";

import { joinBooleanArray, joinIntegerArray, joinFloatArray, joinStringArray, joinReferenceArray } from "./util/string";

@final

export class StaticArray<T> {

[key: number]: T;

// Note that the interface of StaticArray instances must be a semantically

// compatible subset of Array<T> in order for syntax highlighting to work

// properly, for instance when creating static arrays from array literals.

// The additionally provided static methods take care of dealing with static

// arrays exclusively, without having to convert to Array<T> first.

static fromArray<T>(source: Array<T>): StaticArray<T> {

var length = source.length;

var outSize = <usize>length << alignof<T>();

var out = __alloc(outSize, idof<StaticArray<T>>());

if (isManaged<T>()) {

let sourcePtr = source.dataStart;

for (let i = 0; i < length; ++i) {

let off = <usize>i << alignof<T>();

store<usize>(out + off, __retain(load<usize>(sourcePtr + off)));

}

} else {

memory.copy(out, source.dataStart, outSize);

}

return changetype<StaticArray<T>>(out);

}

static concat<T>(source: StaticArray<T>, other: StaticArray<T>): StaticArray<T> {

var sourceLen = source.length;

var otherLen = select(0, other.length, other === null);

var outLen = sourceLen + otherLen;

if (<u32>outLen > <u32>BLOCK_MAXSIZE >>> alignof<T>()) throw new Error(E_INVALIDLENGTH);

var out = changetype<StaticArray<T>>(__alloc(<usize>outLen << alignof<T>(), idof<StaticArray<T>>())); // retains

var outStart = changetype<usize>(out);

var sourceSize = <usize>sourceLen << alignof<T>();

if (isManaged<T>()) {

for (let offset: usize = 0; offset < sourceSize; offset += sizeof<T>()) {

let ref = load<usize>(changetype<usize>(source) + offset);

store<usize>(outStart + offset, __retain(ref));

}

outStart += sourceSize;

let otherSize = <usize>otherLen << alignof<T>();

for (let offset: usize = 0; offset < otherSize; offset += sizeof<T>()) {

let ref = load<usize>(changetype<usize>(other) + offset);

store<usize>(outStart + offset, __retain(ref));

}

} else {

memory.copy(outStart, changetype<usize>(source), sourceSize);

memory.copy(outStart + sourceSize, changetype<usize>(other), <usize>otherLen << alignof<T>());

}

return out;

}

static slice<T>(source: StaticArray<T>, start: i32 = 0, end: i32 = i32.MAX_VALUE): StaticArray<T> {

var length = source.length;

start = start < 0 ? max(start + length, 0) : min(start, length);

end = end < 0 ? max(end + length, 0) : min(end , length);

length = max(end - start, 0);

var sliceSize = <usize>length << alignof<T>();

var slice = changetype<StaticArray<T>>(__alloc(sliceSize, idof<StaticArray<T>>())); // retains

var sourcePtr = changetype<usize>(source) + (<usize>start << alignof<T>());

if (isManaged<T>()) {

let off: usize = 0;

while (off < sliceSize) {

let ref = load<usize>(sourcePtr + off);

store<usize>(changetype<usize>(slice) + off, __retain(ref));

off += sizeof<usize>();

}

} else {

memory.copy(changetype<usize>(slice), sourcePtr, sliceSize);

}

return slice;

}

constructor(length: i32) {

if (<u32>length > <u32>BLOCK_MAXSIZE >>> alignof<T>()) throw new RangeError(E_INVALIDLENGTH);

var outSize = <usize>length << alignof<T>();

var out = __alloc(outSize, idof<StaticArray<T>>());

memory.fill(out, 0, outSize);

return changetype<StaticArray<T>>(out); // retains

}

get length(): i32 {

return changetype<BLOCK>(changetype<usize>(this) - BLOCK_OVERHEAD).rtSize >>> alignof<T>();

}

@operator("[]") private __get(index: i32): T {

if (<u32>index >= <u32>this.length) throw new RangeError(E_INDEXOUTOFRANGE);

var value = this.__uget(index);

if (isReference<T>()) {

if (!isNullable<T>()) {

if (!changetype<usize>(value)) throw new Error(E_HOLEYARRAY);

}

return value;

}

@unsafe @operator("{}") private __uget(index: i32): T {

return load<T>(changetype<usize>(this) + (<usize>index << alignof<T>()));

}

@operator("[]=") private __set(index: i32, value: T): void {

if (<u32>index >= <u32>this.length) throw new RangeError(E_INDEXOUTOFRANGE);

this.__uset(index, value);

}

@unsafe @operator("{}=") private __uset(index: i32, value: T): void {

if (isManaged<T>()) {

let offset = changetype<usize>(this) + (<usize>index << alignof<T>());

let oldRef = load<usize>(offset);

if (changetype<usize>(value) != oldRef) {

store<usize>(offset, __retain(changetype<usize>(value)));

__release(changetype<usize>(oldRef));

}

} else {

store<T>(changetype<usize>(this) + (<usize>index << alignof<T>()), value);

}

includes(value: T, fromIndex: i32 = 0): bool {

if (isFloat<T>()) {

let length = this.length;

if (length == 0 || fromIndex >= length) return false;

if (fromIndex < 0) fromIndex = max(length + fromIndex, 0);

while (fromIndex < length) {

let elem = load<T>(changetype<usize>(this) + (<usize>fromIndex << alignof<T>()));

// @ts-ignore

if (elem == value || isNaN(elem) & isNaN(value)) return true;

++fromIndex;

}

return false;

} else {

return this.indexOf(value, fromIndex) >= 0;

}

indexOf(value: T, fromIndex: i32 = 0): i32 {

var length = this.length;

if (length == 0 || fromIndex >= length) return -1;

if (fromIndex < 0) fromIndex = max(length + fromIndex, 0);

while (fromIndex < length) {

if (load<T>(changetype<usize>(this) + (<usize>fromIndex << alignof<T>())) == value) return fromIndex;

++fromIndex;

}

return -1;

}

lastIndexOf(value: T, fromIndex: i32 = this.length): i32 {

var length = this.length;

if (length == 0) return -1;

if (fromIndex < 0) fromIndex = length + fromIndex;

else if (fromIndex >= length) fromIndex = length - 1;

while (fromIndex >= 0) {

if (load<T>(changetype<usize>(this) + (<usize>fromIndex << alignof<T>())) == value) return fromIndex;

--fromIndex;

}

return -1;

}

concat(other: Array<T>): Array<T> {

var thisLen = this.length;

var otherLen = select(0, other.length, other === null);

var outLen = thisLen + otherLen;

if (<u32>outLen > <u32>BLOCK_MAXSIZE >>> alignof<T>()) throw new Error(E_INVALIDLENGTH);

var out = changetype<Array<T>>(__allocArray(outLen, alignof<T>(), idof<Array<T>>())); // retains

var outStart = out.dataStart;

var thisSize = <usize>thisLen << alignof<T>();

if (isManaged<T>()) {

let thisStart = changetype<usize>(this);

for (let offset: usize = 0; offset < thisSize; offset += sizeof<T>()) {

let ref = load<usize>(thisStart + offset);

store<usize>(outStart + offset, __retain(ref));

}

outStart += thisSize;

let otherStart = other.dataStart;

let otherSize = <usize>otherLen << alignof<T>();

for (let offset: usize = 0; offset < otherSize; offset += sizeof<T>()) {

let ref = load<usize>(otherStart + offset);

store<usize>(outStart + offset, __retain(ref));

}

} else {

memory.copy(outStart, changetype<usize>(this), thisSize);

memory.copy(outStart + thisSize, other.dataStart, <usize>otherLen << alignof<T>());

}

return out;

}

slice(start: i32 = 0, end: i32 = i32.MAX_VALUE): Array<T> {

var length = this.length;

start = start < 0 ? max(start + length, 0) : min(start, length);

end = end < 0 ? max(end + length, 0) : min(end , length);

length = max(end - start, 0);

var slice = changetype<Array<T>>(__allocArray(length, alignof<T>(), idof<Array<T>>())); // retains

var sliceBase = slice.dataStart;

var thisBase = changetype<usize>(this) + (<usize>start << alignof<T>());

if (isManaged<T>()) {

let off = <usize>0;

let end = <usize>length << alignof<usize>();

while (off < end) {

let ref = load<usize>(thisBase + off);

store<usize>(sliceBase + off, __retain(ref));

off += sizeof<usize>();

}

} else {

memory.copy(sliceBase, thisBase, length << alignof<T>());

}

return slice;

}

join(separator: string = ","): string {

if (isBoolean<T>()) return joinBooleanArray(changetype<usize>(this), this.length, separator);

if (isInteger<T>()) return joinIntegerArray<T>(changetype<usize>(this), this.length, separator);

if (isFloat<T>()) return joinFloatArray<T>(changetype<usize>(this), this.length, separator);

if (ASC_SHRINK_LEVEL < 1) {

if (isString<T>()) return joinStringArray(changetype<usize>(this), this.length, separator);

}

if (isReference<T>()) return joinReferenceArray<T>(changetype<usize>(this), this.length, separator);

ERROR("unspported element type");

return <string>unreachable();

}

toString(): string {

return this.join();

}

// RT integration

@unsafe private __visit_impl(cookie: u32): void {

if (isManaged<T>()) {

let cur = changetype<usize>(this);

let end = cur + changetype<BLOCK>(changetype<usize>(this) - BLOCK_OVERHEAD).rtSize;

while (cur < end) {

let val = load<usize>(cur);

if (val) __visit(val, cookie);

cur += sizeof<usize>();

}

assemblyscript/std/assembly/staticarray.ts at threadsafe · deep-stack/assemblyscript · GitHub

Uh oh!

Expand file tree

Breadcrumbs

staticarray.ts

Latest commit

History

Breadcrumbs

staticarray.ts

File metadata and controls