- Press n or j to go to the next uncovered block, b, p or k for the previous block. -
- -| 1 -2 -3 -4 -5 -6 -7 -8 -9 -10 -11 -12 -13 -14 -15 -16 -17 -18 -19 | -1x -1x - - - - - - - - - - - - - - - - | "use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.isCoordinateSet = isCoordinateSet;
-function isCoordinateSet(relation) {
- if (relation.size === 0) {
- return false; // Empty set, can't determine
- }
- const firstItem = relation.values().next().value;
- return Array.isArray(firstItem) && firstItem.length === 2;
-}
-function checkRelationType(relation) {
- if (isCoordinateSet(relation)) {
- return "JackscriptSet of Coordinates";
- }
- else {
- return "JackscriptSet of T";
- }
-}
-//# sourceMappingURL=coordinate.js.map |
- Press n or j to go to the next uncovered block, b, p or k for the previous block. -
- -| 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 -72 -73 -74 -75 -76 -77 -78 -79 -80 -81 -82 -83 -84 -85 -86 -87 -88 -89 -90 -91 -92 -93 -94 -95 -96 -97 -98 -99 -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 | - -1x -1x -1x - - - - -1x - - - - - -1x - - -96x -96x - - - - - -20x -36x - -20x - - - - - -2x -2x -4x - -2x - - - - - -19x - - - - - - - - - - - - -22x - - -21x - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -3x -3x -18x -7x - - -3x - - -2x -2x -6x - -2x - - - - - - - - - - - - - - - - - -4x -17x -2x - - -2x - - - -4x -15x -3x - - -1x - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -1x -1x - | "use strict";
-var _a;
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.JackscriptSet = exports.isValidSet = void 0;
-const coordinate_1 = require("./coordinate");
-// interface JackscriptSet<T extends Set<T>>{};
-// function that checks is a set is a valid set or not:
-// refactoring: I dont think i need to check if there is a valid set or not if i force user to
-// have a Set as a param
-const isValidSet = (theset) => {
- if (theset instanceof Set === false) {
- throw "Parementers must both be of instance: Set";
- }
- return true;
-};
-exports.isValidSet = isValidSet;
-class JackscriptSet {
- constructor(values) {
- this[_a] = 'JackscriptSet';
- this.internalSet = new Set(values !== null && values !== void 0 ? values : []);
- }
- internalset() {
- return this.internalSet;
- }
- add(...value) {
- value.forEach((value) => {
- this.internalSet.add(value);
- });
- return this;
- }
- clear() {
- this.internalSet.clear();
- }
- delete(...value) {
- let exists = false;
- value.forEach((value) => {
- exists = this.internalSet.delete(value);
- });
- return exists;
- }
- forEach(callbackfn, thisArg) {
- this.internalSet.forEach(callbackfn, thisArg);
- }
- has(value) {
- return this.internalSet.has(value);
- }
- // hasNew
- hasNew(set) {
- return (0, coordinate_1.isCoordinateSet)(set) ? true : false;
- // if(isCoordinateSet(set)){
- // return true;
- // }else{
- // return false;
- // }
- // return true;
- }
- get size() {
- return this.internalSet.size;
- }
- [Symbol.iterator]() {
- return this.internalSet[Symbol.iterator]();
- }
- entries() {
- return this.internalSet.entries();
- }
- keys() {
- return this.internalSet.keys();
- }
- values() {
- return this.internalSet.values();
- }
- /*Start of the additional methods*/
- createCartesian(newSet) {
- // if the new set is empty, then return this set:
- if (newSet.size == 0) {
- return this;
- }
- // create a set of coordinates and a tuple:
- let resultSet = new JackscriptSet();
- let mytuple;
- this.forEach((i) => {
- newSet.forEach((j) => {
- mytuple = [i, j];
- resultSet.add(mytuple);
- });
- });
- return resultSet;
- }
- print() {
- for (let item of this.internalSet) {
- console.log(item);
- }
- }
- static intersect(set1, set2) {
- const result = new JackscriptSet();
- for (let item of set1) {
- if (set2.has(item)) {
- result.add(item);
- }
- }
- return result;
- }
- static union(set1, set2) {
- const result = new JackscriptSet(set1);
- for (let item of set2) {
- result.add(item);
- }
- return result;
- }
- static domain(theset) {
- let result = new Set();
- for (let item of theset.internalSet) {
- result.add(item[0]);
- }
- return result;
- }
- static range(theset) {
- let result = new Set();
- for (let item of theset.internalSet) {
- result.add(item[1]);
- }
- return result;
- }
- // isSubsetOf:
- isSubsetOf(theSet) {
- for (let item of this.internalSet) {
- if (theSet.internalSet.has(item) === false) {
- return false;
- }
- }
- return true;
- }
- // isSupersetOf():
- isSupersetOf(theSet) {
- for (let item of theSet.internalSet) {
- if (this.internalSet.has(item) === false) {
- return false;
- }
- }
- return true;
- }
- isReflexive(theSet) {
- let testCoordinate;
- let it = theSet.internalSet.values();
- var first = it.next();
- for (let elem of this.internalSet) {
- testCoordinate = [elem, elem];
- if (!theSet.has(testCoordinate)) {
- console.log("i have found a mismatch");
- console.log("elem: ", testCoordinate, " and theSet.Internalset is : ", theSet.internalSet);
- console.log("The type of the testCoordinate is : " + typeof testCoordinate + " and the type of the internals set element is : " + typeof first);
- //console.log(testCoordinate === theSet.internalSet[0])
- return false;
- }
- }
- return true;
- }
- isIrreflexive(theSet) {
- let testCoordinate;
- for (let elem of this.internalSet) {
- testCoordinate = [elem, elem];
- if (theSet.has(testCoordinate)) {
- return false;
- }
- }
- return true;
- }
- isSymmetric(theSet) {
- return true;
- }
- isAntisymmetric(theSet) {
- return true;
- }
- isTransitive(theSet) {
- return true;
- }
-}
-exports.JackscriptSet = JackscriptSet;
-_a = Symbol.toStringTag;
-//# sourceMappingURL=functions.js.map |
- Press n or j to go to the next uncovered block, b, p or k for the previous block. -
- -- Press n or j to go to the next uncovered block, b, p or k for the previous block. -
- -| 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 -72 -73 -74 -75 -76 -77 -78 -79 -80 -81 -82 -83 -84 -85 -86 -87 -88 -89 -90 -91 -92 -93 -94 -95 -96 -97 -98 -99 -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 | - - - - - - - - - -1x - - - - - - - - - - -96x - - - - - - - - -20x -36x - -20x - - - - - - - -2x -2x -4x - -2x - - - - - - - -19x - - - - - - - - - - - - - - - - -22x - - - -21x - - - - - - - - - - - - - - -96x - - - - - - - - - - - - - - - - - - - - - - - - - - - -3x -3x -18x -7x - - -3x - - - -2x -2x -6x - -2x - - - - - - - - - - - - - - - - - - - - -4x -17x -2x - - -2x - - - -4x -15x -3x - - -1x - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -1x | import {Coordinate, Relation} from './coordinate.js';
-import { isCoordinateSet, checkRelationType } from './coordinate';
-
-// interface JackscriptSet<T extends Set<T>>{};
-
-// function that checks is a set is a valid set or not:
-
-// refactoring: I dont think i need to check if there is a valid set or not if i force user to
-// have a Set as a param
-
-const isValidSet = <T>(theset:Set<T>): boolean =>{
- Iif(theset instanceof Set === false){
- throw "Parementers must both be of instance: Set";
- }
- return true;
-}
-
-class JackscriptSet<T> implements Set<T> {
- private internalSet: Set<T>;
-
- constructor(values?: Iterable<T> | null) {
- this.internalSet = new Set(values ?? []);
- }
-
- internalset(): any{
- return this.internalSet;
- }
-
- add(...value: T[]): this {
-
- value.forEach((value: T)=>{
- this.internalSet.add(value);
- })
- return this;
- }
-
- clear(): void {
- this.internalSet.clear();
- }
-
- delete(...value: T[]): boolean {
- let exists: boolean = false;
- value.forEach((value: T)=>{
- exists = this.internalSet.delete(value);
- })
- return exists;
- }
-
- forEach(callbackfn: (value: T, value2: T, set: Set<T>) => void, thisArg?: any): void {
- this.internalSet.forEach(callbackfn, thisArg);
- }
-
- has(value: T ): boolean {
- return this.internalSet.has(value);
- }
-
- // // hasNew
- // hasNew(set: Relation<T, any>): boolean{
-
- // // lets first convert the internal set to a Relation:
-
-
-
- // if(isCoordinateSet(set) && isCoordinateSet(this.internalSet.values())){
- // let val = set.values();
- // }
-
- // }
-
- get size(): number {
- return this.internalSet.size;
- }
-
- [Symbol.iterator](): IterableIterator<T> {
- return this.internalSet[Symbol.iterator]();
- }
-
- entries(): IterableIterator<[T, T]> {
- return this.internalSet.entries();
- }
-
- keys(): IterableIterator<T> {
- return this.internalSet.keys();
- }
-
- values(): IterableIterator<T> {
- return this.internalSet.values();
- }
-
- [Symbol.toStringTag]: string = 'JackscriptSet';
-
- /*Start of the additional methods*/
- createCartesian<V>(newSet: Set<V>): Relation<T,V> {
- // if the new set is empty, then return this set:
- Iif(newSet.size == 0){
- return this;
- }
- // create a set of coordinates and a tuple:
- let resultSet = new JackscriptSet<Coordinate<T, V>>();
- let mytuple : [T, V];
-
- this.forEach((i: T) => {
- newSet.forEach((j: V) => {
- mytuple = [ i, j ];
- resultSet.add(mytuple);
- });
- });
- return resultSet;
- }
-
- print(): void{
- for(let item of this.internalSet){
- console.log(item);
- }
- }
-
- static intersect<T>(set1: Set<T>, set2: Set<T>): JackscriptSet<T> {
- const result = new JackscriptSet<T>();
- for(let item of set1){
- if (set2.has(item)) {
- result.add(item);
- }
- }
- return result;
- }
-
- static union<T>(set1: Set<T>, set2: Set<T>): JackscriptSet<T> {
- const result = new JackscriptSet<T>(set1);
- for(let item of set2){
- result.add(item);
- }
- return result;
- }
-
- static domain<T, V>(theset:Relation<T, V>): Set<T>{
- let result = new Set<T>();
- for(let item of theset.internalSet){
- result.add(item[0]);
- }
- return result;
- }
-
- static range<T, V>(theset:Relation<T, V>): Set<T>{
- let result = new Set<T>();
- for(let item of theset.internalSet){
- result.add(item[1]);
- }
- return result;
- }
-
- // isSubsetOf:
- isSubsetOf(theSet: JackscriptSet<T>): Boolean{
- for (let item of this.internalSet) {
- if(theSet.internalSet.has(item) === false){
- return false;
- }
- }
- return true;
- }
- // isSupersetOf():
- isSupersetOf(theSet: JackscriptSet<T>): Boolean{
- for (let item of theSet.internalSet) {
- if(this.internalSet.has(item) === false){
- return false;
- }
- }
- return true;
- }
-
- isReflexive(theSet: JackscriptSet<Coordinate<T, any>>) : Boolean {
- let testCoordinate: Coordinate<T,T>;
-
- let it = theSet.internalSet.values();
- var first = it.next();
-
- for(let elem of this.internalSet){
- testCoordinate = [elem, elem];
-
- Iif(!theSet.has(testCoordinate)){
- console.log("i have found a mismatch");
- console.log("elem: ", testCoordinate, " and theSet.Internalset is : ", theSet.internalSet);
- console.log("The type of the testCoordinate is : "+typeof testCoordinate+ " and the type of the internals set element is : "+ typeof first);
- //console.log(testCoordinate === theSet.internalSet[0])
-
- return false;
- }
- }
- return true;
- }
-
- isIrreflexive(theSet: JackscriptSet<Coordinate<T, any>>) : Boolean {
- let testCoordinate: Coordinate<T,T>;
-
- for(let elem of this.internalSet){
- testCoordinate = [elem, elem];
-
- Iif(theSet.has(testCoordinate)){
- return false;
- }
- }
- return true;
- }
-
- isSymmetric(theSet: JackscriptSet<T>) : Boolean {
- return true;
- }
-
- isAntisymmetric(theSet: JackscriptSet<T>) : Boolean {
- return true;
- }
-
- isTransitive(theSet: JackscriptSet<T>) : Boolean {
- return true;
- }
-}
-
-export { isValidSet, JackscriptSet} |
- Press n or j to go to the next uncovered block, b, p or k for the previous block. -
- -| File | -- | Statements | -- | Branches | -- | Functions | -- | Lines | -- |
|---|---|---|---|---|---|---|---|---|---|
| functions.ts | -
-
- |
- 42.3% | -33/78 | -63.63% | -7/11 | -40% | -12/30 | -40.78% | -31/76 | -