buyMax -> maximize
This commit is contained in:
parent
712fcf7eb0
commit
4fb2d90dbb
1 changed files with 5 additions and 5 deletions
|
@ -45,7 +45,7 @@ export interface RepeatableOptions {
|
|||
style?: Computable<StyleValue>;
|
||||
mark?: Computable<boolean | string>;
|
||||
small?: Computable<boolean>;
|
||||
buyMax?: Computable<boolean>;
|
||||
maximize?: Computable<boolean>;
|
||||
display?: Computable<RepeatableDisplay>;
|
||||
onPurchase?: VoidFunction;
|
||||
}
|
||||
|
@ -72,7 +72,7 @@ export type Repeatable<T extends RepeatableOptions> = Replace<
|
|||
style: GetComputableType<T["style"]>;
|
||||
mark: GetComputableType<T["mark"]>;
|
||||
small: GetComputableType<T["small"]>;
|
||||
buyMax: GetComputableType<T["buyMax"]>;
|
||||
maximize: GetComputableType<T["maximize"]>;
|
||||
display: Ref<CoercableComponent>;
|
||||
}
|
||||
>;
|
||||
|
@ -149,7 +149,7 @@ export function createRepeatable<T extends RepeatableOptions>(
|
|||
}
|
||||
payRequirements(
|
||||
repeatable.requirements,
|
||||
unref(genericRepeatable.buyMax)
|
||||
unref(genericRepeatable.maximize)
|
||||
? maxRequirementsMet(genericRepeatable.requirements)
|
||||
: 1
|
||||
);
|
||||
|
@ -203,7 +203,7 @@ export function createRepeatable<T extends RepeatableOptions>(
|
|||
<br />
|
||||
{displayRequirements(
|
||||
genericRepeatable.requirements,
|
||||
unref(genericRepeatable.buyMax)
|
||||
unref(genericRepeatable.maximize)
|
||||
? maxRequirementsMet(genericRepeatable.requirements)
|
||||
: 1
|
||||
)}
|
||||
|
@ -222,7 +222,7 @@ export function createRepeatable<T extends RepeatableOptions>(
|
|||
processComputable(repeatable as T, "style");
|
||||
processComputable(repeatable as T, "mark");
|
||||
processComputable(repeatable as T, "small");
|
||||
processComputable(repeatable as T, "buyMax");
|
||||
processComputable(repeatable as T, "maximize");
|
||||
|
||||
repeatable[GatherProps] = function (this: GenericRepeatable) {
|
||||
const { display, visibility, style, classes, onClick, canClick, small, mark, id } =
|
||||
|
|
Loading…
Reference in a new issue