Created
January 3, 2023 20:14
-
-
Save theAlgorithmist/ab68f4ef3a8772d8a850d24cca4eab93 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import { BasicMathType } from "./basic-math-type"; | |
// Fraction Type | |
export interface FractionType extends BasicMathType | |
{ | |
// is this a mixed number? | |
get mixed(): boolean | |
// designate this as a mixed number | |
set mixed(pIsMixed: boolean); | |
// access the whole part of a mixed number | |
get whole(): number; | |
// assign the whole number | |
set whole(value: number); | |
// access the raw numerator value without taking into account mixed numbers | |
get numerator(): number; | |
// assign the numerator | |
set numerator(value: number); | |
// access the computed numerator with whole part represented in the numerator | |
get computedNumerator(): number; | |
// access the denominator | |
get denominator(): number; | |
// assign the denominator | |
set denominator(value: number); | |
// access the unknown part | |
get unknownPart(): string; | |
// assign the unknown part of the fraction | |
set unknownPart(part: string); | |
// is the fraction currently in reduced form? | |
get reduced(): boolean; | |
// assign or mark future updates to be in reduced form or not | |
set reduced(value: boolean); | |
// clear or reset the fraction to 0 0/1 and mixed = false, reduced = false | |
clear(): void; | |
// preferred method to assign a completely new fraction | |
setFraction(whole: number, numerator: number, denominator: number):void; | |
// convert the internal fraction representation to reduced form and simulateously indicate that future changes should | |
// be converted to reduced form | |
reduce():void; | |
// least common denominator of the current and another fraction | |
leastCommonDenominator(fraction: FractionType): number; | |
// greatest common divisor of the current and another fraction | |
greatestCommonDivisor(fraction: FractionType): number; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment