@effect/schema
Advanced tools
Comparing version
@@ -1159,3 +1159,3 @@ "use strict"; | ||
if (Either.isRight(eu)) { | ||
return Either.right(eu.right); | ||
return eu; | ||
} else { | ||
@@ -1175,3 +1175,3 @@ es.push([stepKey++, eu.left]); | ||
if (Either.isRight(t)) { | ||
state.finalResult = Either.right(t.right); | ||
state.finalResult = t; | ||
} else { | ||
@@ -1178,0 +1178,0 @@ state.es.push([nk, t.left]); |
@@ -912,3 +912,3 @@ /** | ||
readonly annotations: Annotations; | ||
static make: (candidates: ReadonlyArray<AST>, annotations?: Annotations) => AST; | ||
static make: (types: ReadonlyArray<AST>, annotations?: Annotations) => AST; | ||
/** | ||
@@ -915,0 +915,0 @@ * @since 0.67.0 |
@@ -1178,3 +1178,2 @@ /** | ||
export const isTypeLiteral = /*#__PURE__*/createASTGuard("TypeLiteral"); | ||
const removeNevers = candidates => candidates.filter(ast => !(ast === neverKeyword)); | ||
const sortCandidates = /*#__PURE__*/Arr.sort( /*#__PURE__*/Order.mapInput(Number.Order, ast => { | ||
@@ -1303,27 +1302,9 @@ switch (ast._tag) { | ||
annotations; | ||
static make = (candidates, annotations) => { | ||
const types = []; | ||
const memo = new Set(); | ||
for (let i = 0; i < candidates.length; i++) { | ||
const ast = candidates[i]; | ||
if (ast === neverKeyword || memo.has(ast)) { | ||
continue; | ||
} | ||
memo.add(ast); | ||
types.push(ast); | ||
} | ||
return Union.union(types, annotations); | ||
static make = (types, annotations) => { | ||
return isMembers(types) ? new Union(types, annotations) : types.length === 1 ? types[0] : neverKeyword; | ||
}; | ||
/** @internal */ | ||
static members = (candidates, annotations) => { | ||
return Union.union(removeNevers(candidates), annotations); | ||
}; | ||
/** @internal */ | ||
static unify = (candidates, annotations) => { | ||
return Union.union(unify(flatten(candidates)), annotations); | ||
return Union.make(unify(flatten(candidates)), annotations); | ||
}; | ||
/** @internal */ | ||
static union = (types, annotations) => { | ||
return isMembers(types) ? new Union(types, annotations) : types.length === 1 ? types[0] : neverKeyword; | ||
}; | ||
/** | ||
@@ -1330,0 +1311,0 @@ * @since 0.67.0 |
@@ -1125,3 +1125,3 @@ /** | ||
if (Either.isRight(eu)) { | ||
return Either.right(eu.right); | ||
return eu; | ||
} else { | ||
@@ -1141,3 +1141,3 @@ es.push([stepKey++, eu.left]); | ||
if (Either.isRight(t)) { | ||
state.finalResult = Either.right(t.right); | ||
state.finalResult = t; | ||
} else { | ||
@@ -1144,0 +1144,0 @@ state.es.push([nk, t.left]); |
{ | ||
"name": "@effect/schema", | ||
"version": "0.72.4", | ||
"version": "0.73.0", | ||
"description": "Modeling the schema of data structures as first-class values", | ||
@@ -16,3 +16,3 @@ "license": "MIT", | ||
"peerDependencies": { | ||
"effect": "^3.7.3" | ||
"effect": "^3.8.0" | ||
}, | ||
@@ -19,0 +19,0 @@ "publishConfig": { |
@@ -1447,3 +1447,3 @@ /** | ||
if (Either.isRight(eu)) { | ||
return Either.right(eu.right) | ||
return eu | ||
} else { | ||
@@ -1465,3 +1465,3 @@ es.push([stepKey++, eu.left]) | ||
if (Either.isRight(t)) { | ||
state.finalResult = Either.right(t.right) | ||
state.finalResult = t | ||
} else { | ||
@@ -1468,0 +1468,0 @@ state.es.push([nk, t.left]) |
Sorry, the diff of this file is too big to display
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is too big to display
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is too big to display
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is too big to display
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is too big to display
Sorry, the diff of this file is too big to display
2289859
-0.14%42621
-0.12%