test: removed old group

pull/14/head
RuiAlonso 4 years ago
parent 85cbe42958
commit 3a092f8a1c

@ -11,149 +11,148 @@ class Binomial {
} }
void main() { void main() {
group('Maths', () { group('calculateArc', () {
group('calculateArc', () { test('returns by default 100 points as indicated by precision', () {
test('returns by default 100 points as indicated by precision', () { final points = calculateArc(
final points = calculateArc( center: Vector2.zero(),
center: Vector2.zero(), radius: 100,
radius: 100, angle: 90,
angle: 90, );
); expect(points.length, 100);
expect(points.length, 100);
});
test('returns as many points as indicated by precision', () {
final points = calculateArc(
center: Vector2.zero(),
radius: 100,
angle: 90,
precision: 50,
);
expect(points.length, 50);
});
}); });
group('calculateBezierCurve', () { test('returns as many points as indicated by precision', () {
test('fails if step not in range', () { final points = calculateArc(
expect( center: Vector2.zero(),
() => calculateBezierCurve( radius: 100,
controlPoints: [ angle: 90,
Vector2(0, 0), precision: 50,
Vector2(10, 10), );
], expect(points.length, 50);
step: 2, });
), });
throwsAssertionError,
);
});
test('fails if not enough control points', () {
expect(
() => calculateBezierCurve(controlPoints: [Vector2.zero()]),
throwsAssertionError,
);
expect(
() => calculateBezierCurve(controlPoints: []),
throwsAssertionError,
);
});
test('returns by default 1000 points as indicated by step', () { group('calculateBezierCurve', () {
final points = calculateBezierCurve( test('fails if step not in range', () {
expect(
() => calculateBezierCurve(
controlPoints: [ controlPoints: [
Vector2(0, 0), Vector2(0, 0),
Vector2(10, 10), Vector2(10, 10),
], ],
); step: 2,
expect(points.length, 1000); ),
}); throwsAssertionError,
);
});
test('returns as many points as indicated by step', () { test('fails if not enough control points', () {
final points = calculateBezierCurve( expect(
controlPoints: [ () => calculateBezierCurve(controlPoints: [Vector2.zero()]),
Vector2(0, 0), throwsAssertionError,
Vector2(10, 10), );
], expect(
step: 0.01, () => calculateBezierCurve(controlPoints: []),
); throwsAssertionError,
expect(points.length, 100); );
});
}); });
group('binomial', () { test('returns by default 1000 points as indicated by step', () {
test('fails if k is negative', () { final points = calculateBezierCurve(
expect(() => binomial(1, -1), throwsAssertionError); controlPoints: [
}); Vector2(0, 0),
Vector2(10, 10),
],
);
expect(points.length, 1000);
});
test('fails if n is negative', () { test('returns as many points as indicated by step', () {
expect(() => binomial(-1, 1), throwsAssertionError); final points = calculateBezierCurve(
}); controlPoints: [
Vector2(0, 0),
Vector2(10, 10),
],
step: 0.01,
);
expect(points.length, 100);
});
});
test('fails if n < k', () { group('binomial', () {
expect(() => binomial(1, 2), throwsAssertionError); test('fails if k is negative', () {
}); expect(() => binomial(1, -1), throwsAssertionError);
});
test('for a specific input gives a correct value', () { test('fails if n is negative', () {
final binomialInputsToExpected = { expect(() => binomial(-1, 1), throwsAssertionError);
Binomial(n: 0, k: 0): 1, });
Binomial(n: 1, k: 0): 1,
Binomial(n: 1, k: 1): 1, test('fails if n < k', () {
Binomial(n: 2, k: 0): 1, expect(() => binomial(1, 2), throwsAssertionError);
Binomial(n: 2, k: 1): 2,
Binomial(n: 2, k: 2): 1,
Binomial(n: 3, k: 0): 1,
Binomial(n: 3, k: 1): 3,
Binomial(n: 3, k: 2): 3,
Binomial(n: 3, k: 3): 1,
Binomial(n: 4, k: 0): 1,
Binomial(n: 4, k: 1): 4,
Binomial(n: 4, k: 2): 6,
Binomial(n: 4, k: 3): 4,
Binomial(n: 4, k: 4): 1,
Binomial(n: 5, k: 0): 1,
Binomial(n: 5, k: 1): 5,
Binomial(n: 5, k: 2): 10,
Binomial(n: 5, k: 3): 10,
Binomial(n: 5, k: 4): 5,
Binomial(n: 5, k: 5): 1,
Binomial(n: 6, k: 0): 1,
Binomial(n: 6, k: 1): 6,
Binomial(n: 6, k: 2): 15,
Binomial(n: 6, k: 3): 20,
Binomial(n: 6, k: 4): 15,
Binomial(n: 6, k: 5): 6,
Binomial(n: 6, k: 6): 1,
};
binomialInputsToExpected.forEach((input, value) {
expect(binomial(input.n, input.k), value);
});
});
}); });
group('factorial', () { test('for a specific input gives a correct value', () {
test('fails if negative number', () { final binomialInputsToExpected = {
expect(() => factorial(-1), throwsAssertionError); Binomial(n: 0, k: 0): 1,
Binomial(n: 1, k: 0): 1,
Binomial(n: 1, k: 1): 1,
Binomial(n: 2, k: 0): 1,
Binomial(n: 2, k: 1): 2,
Binomial(n: 2, k: 2): 1,
Binomial(n: 3, k: 0): 1,
Binomial(n: 3, k: 1): 3,
Binomial(n: 3, k: 2): 3,
Binomial(n: 3, k: 3): 1,
Binomial(n: 4, k: 0): 1,
Binomial(n: 4, k: 1): 4,
Binomial(n: 4, k: 2): 6,
Binomial(n: 4, k: 3): 4,
Binomial(n: 4, k: 4): 1,
Binomial(n: 5, k: 0): 1,
Binomial(n: 5, k: 1): 5,
Binomial(n: 5, k: 2): 10,
Binomial(n: 5, k: 3): 10,
Binomial(n: 5, k: 4): 5,
Binomial(n: 5, k: 5): 1,
Binomial(n: 6, k: 0): 1,
Binomial(n: 6, k: 1): 6,
Binomial(n: 6, k: 2): 15,
Binomial(n: 6, k: 3): 20,
Binomial(n: 6, k: 4): 15,
Binomial(n: 6, k: 5): 6,
Binomial(n: 6, k: 6): 1,
};
binomialInputsToExpected.forEach((input, value) {
expect(binomial(input.n, input.k), value);
}); });
});
});
group('factorial', () {
test('fails if negative number', () {
expect(() => factorial(-1), throwsAssertionError);
});
test('for a specific input gives a correct value', () { test('for a specific input gives a correct value', () {
final factorialInputsToExpected = { final factorialInputsToExpected = {
0: 1, 0: 1,
1: 1, 1: 1,
2: 2, 2: 2,
3: 6, 3: 6,
4: 24, 4: 24,
5: 120, 5: 120,
6: 720, 6: 720,
7: 5040, 7: 5040,
8: 40320, 8: 40320,
9: 362880, 9: 362880,
10: 3628800, 10: 3628800,
11: 39916800, 11: 39916800,
12: 479001600, 12: 479001600,
13: 6227020800, 13: 6227020800,
}; };
factorialInputsToExpected.forEach((input, expected) { factorialInputsToExpected.forEach((input, expected) {
expect(factorial(input), expected); expect(factorial(input), expected);
});
}); });
}); });
}); });

Loading…
Cancel
Save