iframe-proxy | Sunbelt Computer Software

History

234 lines (200 loc) · 5.5 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

import { Collection, KeyedCollection, SetCollection } from './Collection';

import { emptyMap } from './Map';

import { sortFactory } from './Operations';

import { OrderedSet } from './OrderedSet';

import { DELETE } from './TrieUtils';

import { asImmutable } from './methods/asImmutable';

import { asMutable } from './methods/asMutable';

import { withMutations } from './methods/withMutations';

import { isOrdered } from './predicates/isOrdered';

import { IS_SET_SYMBOL, isSet } from './predicates/isSet';

import assertNotInfinite from './utils/assertNotInfinite';

export class Set extends SetCollection {

// @pragma Construction

constructor(value) {

// eslint-disable-next-line no-constructor-return

return value === undefined || value === null

? emptySet()

: isSet(value) && !isOrdered(value)

? value

: emptySet().withMutations((set) => {

const iter = SetCollection(value);

assertNotInfinite(iter.size);

iter.forEach((v) => set.add(v));

});

}

static of(/*...values*/) {

return this(arguments);

}

static fromKeys(value) {

return this(KeyedCollection(value).keySeq());

}

static intersect(sets) {

sets = Collection(sets).toArray();

return sets.length

? SetPrototype.intersect.apply(Set(sets.pop()), sets)

: emptySet();

}

static union(sets) {

sets = Collection(sets).toArray();

return sets.length

? SetPrototype.union.apply(Set(sets.pop()), sets)

: emptySet();

}

toString() {

return this.__toString('Set {', '}');

}

// @pragma Access

has(value) {

return this._map.has(value);

}

// @pragma Modification

add(value) {

return updateSet(this, this._map.set(value, value));

}

remove(value) {

return updateSet(this, this._map.remove(value));

}

clear() {

return updateSet(this, this._map.clear());

}

// @pragma Composition

map(mapper, context) {

// keep track if the set is altered by the map function

let didChanges = false;

const newMap = updateSet(

this,

this._map.mapEntries(([, v]) => {

const mapped = mapper.call(context, v, v, this);

if (mapped !== v) {

didChanges = true;

}

return [mapped, mapped];

}, context)

);

return didChanges ? newMap : this;

}

union(...iters) {

iters = iters.filter((x) => x.size !== 0);

if (iters.length === 0) {

return this;

}

if (this.size === 0 && !this.__ownerID && iters.length === 1) {

return this.constructor(iters[0]);

}

return this.withMutations((set) => {

for (let ii = 0; ii < iters.length; ii++) {

if (typeof iters[ii] === 'string') {

set.add(iters[ii]);

} else {

SetCollection(iters[ii]).forEach((value) => set.add(value));

}

});

}

intersect(...iters) {

if (iters.length === 0) {

return this;

}

iters = iters.map((iter) => SetCollection(iter));

const toRemove = [];

this.forEach((value) => {

if (!iters.every((iter) => iter.includes(value))) {

toRemove.push(value);

}

});

return this.withMutations((set) => {

toRemove.forEach((value) => {

set.remove(value);

});

}

subtract(...iters) {

if (iters.length === 0) {

return this;

}

iters = iters.map((iter) => SetCollection(iter));

const toRemove = [];

this.forEach((value) => {

if (iters.some((iter) => iter.includes(value))) {

toRemove.push(value);

}

});

return this.withMutations((set) => {

toRemove.forEach((value) => {

set.remove(value);

});

}

sort(comparator) {

// Late binding

return OrderedSet(sortFactory(this, comparator));

}

sortBy(mapper, comparator) {

// Late binding

return OrderedSet(sortFactory(this, comparator, mapper));

}

wasAltered() {

return this._map.wasAltered();

}

__iterate(fn, reverse) {

return this._map.__iterate((k) => fn(k, k, this), reverse);

}

__iterator(type, reverse) {

return this._map.__iterator(type, reverse);

}

__ensureOwner(ownerID) {

if (ownerID === this.__ownerID) {

return this;

}

const newMap = this._map.__ensureOwner(ownerID);

if (!ownerID) {

if (this.size === 0) {

return this.__empty();

}

this.__ownerID = ownerID;

this._map = newMap;

return this;

}

return this.__make(newMap, ownerID);

}

Set.isSet = isSet;

const SetPrototype = Set.prototype;

SetPrototype[IS_SET_SYMBOL] = true;

SetPrototype[DELETE] = SetPrototype.remove;

SetPrototype.merge = SetPrototype.concat = SetPrototype.union;

SetPrototype.withMutations = withMutations;

SetPrototype.asImmutable = asImmutable;

SetPrototype['@@transducer/init'] = SetPrototype.asMutable = asMutable;

SetPrototype['@@transducer/step'] = function (result, arr) {

return result.add(arr);

};

SetPrototype['@@transducer/result'] = function (obj) {

return obj.asImmutable();

};

SetPrototype.__empty = emptySet;

SetPrototype.__make = makeSet;

function updateSet(set, newMap) {

if (set.__ownerID) {

set.size = newMap.size;

set._map = newMap;

return set;

}

return newMap === set._map

? set

: newMap.size === 0

? set.__empty()

: set.__make(newMap);

}

function makeSet(map, ownerID) {

const set = Object.create(SetPrototype);

set.size = map ? map.size : 0;

set._map = map;

set.__ownerID = ownerID;

return set;

}

let EMPTY_SET;

function emptySet() {

return EMPTY_SET || (EMPTY_SET = makeSet(emptyMap()));

}

Sunbelt Computer Software

PL/B Language Development and Support

Navigation Menu

Uh oh!

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

Uh oh!

FilesExpand file tree

Set.js

Latest commit

History

Set.js

File metadata and controls