issues
search
OLGKAD
/
sef18group15-coverage
Algorithms and Data Structures implemented in Java
Apache License 2.0
0
stars
0
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
(ISSUE:#34) Added tests to the equals method and constructors using s…
#49
pwnttm
closed
6 years ago
0
added else statments for adhocs check
#48
fkam
closed
6 years ago
0
tests [#44]: Added a clear method call before adding new elements
#47
Lucasljungberg
closed
6 years ago
0
Intervallad
#46
fkam
closed
6 years ago
0
tests [#44]: Added a clear method call before adding any elements
#45
Lucasljungberg
closed
6 years ago
0
Add the clearing tests for HashMap
#44
Lucasljungberg
opened
6 years ago
0
(ISSUE:#34 added tests to the equals method and the constructors usin…
#43
pwnttm
closed
6 years ago
0
New b tree restored
#42
Lucasljungberg
closed
6 years ago
0
Revert "feat [#12] adhoc created BTree::nodeValidate"
#41
Lucasljungberg
closed
6 years ago
0
feat[#12] added adhoc for IntervalTree::query
#40
fkam
closed
6 years ago
0
tests [#34]: Added tests for clear functions in HashMap
#39
Lucasljungberg
closed
6 years ago
0
feat [#12] adhoc created BTree::nodeValidate
#38
fkam
closed
6 years ago
0
refactor [#27]: Rangemaximumdata combined refactor
#37
Lucasljungberg
closed
6 years ago
0
tests [#35]: Added test cases for previously untaken branches
#36
sareng
closed
6 years ago
0
Tests: SegmentTree.Data.RangeMinimumData::combine
#35
sareng
opened
6 years ago
0
Tests: Increase branch coverage for functions
#34
Lucasljungberg
opened
6 years ago
0
Segment tree covering
#33
sareng
closed
6 years ago
0
#10 ad hoc tests for branch covering of splay in splayTree
#32
sareng
closed
6 years ago
0
refactor [#27]: Refactored BTree::combines to reduce complexity and c…
#31
Lucasljungberg
closed
6 years ago
1
Replace node with node
#30
pwnttm
closed
6 years ago
0
Test segment tree bit int long
#29
pwnttm
closed
6 years ago
0
B-tree coverage tool
#28
fkam
closed
6 years ago
1
refactor functions to reduce complexity
#27
OLGKAD
opened
6 years ago
0
Rangemaximumdata further combine tests
#26
pwnttm
closed
6 years ago
0
(DOC:#11)Added adhoc testCoverage functions to both getDFS and replac…
#25
pwnttm
closed
6 years ago
0
test [#34]: Segment tree minimum test case
#24
fkam
closed
6 years ago
0
test [#17]: Added test case for BTree
#23
fkam
closed
6 years ago
0
tests [#21]: Added test cases for previously untaken branches
#22
Lucasljungberg
closed
6 years ago
0
Tests: SegmentTree.Data.RangeMaximumData::combine
#21
Lucasljungberg
opened
6 years ago
0
feat [#9]: Added adhoc branch coverage tool for BTree::combined()
#20
Lucasljungberg
closed
6 years ago
0
feat [#9]: Fixed ad-hoc branch coverage for RangeMaximumData::combined
#19
Lucasljungberg
closed
6 years ago
0
tests [#9]: Added test for RangeMaximumData::combined
#18
Lucasljungberg
closed
6 years ago
0
Tests: BTree<T::validateNode
#17
OLGKAD
opened
6 years ago
0
Tests: SplayTree<T::splay()
#16
OLGKAD
opened
6 years ago
1
Tests: BinarySearchTree<T::getDFS
#15
OLGKAD
opened
6 years ago
0
Tests: BTree<T::combined()
#14
OLGKAD
opened
6 years ago
1
tests: BinaryHeapArray::heapDown()
#13
OLGKAD
opened
6 years ago
2
Branch coverage for IntervalTree<O::Interval<O>::query and BTree<T::validateNode
#12
OLGKAD
opened
6 years ago
0
Branch coverage for BinarySearchTree<T::getDFS and BinarySearchTree<T::replaceNodeWithNode
#11
OLGKAD
opened
6 years ago
1
Branch coverage for SplayTree<T::splay and SegmentTree<D::Data::RangeMinimumData<N::combined
#10
OLGKAD
opened
6 years ago
0
Branch coverage for BTree<T::combined and SegmentTree<D::Data::RangeMaximumData<N::combined
#9
OLGKAD
opened
6 years ago
0
Branch coverage: heapDown() and SegmentTree<D::FlatSegmentTree<D::NonOverlappingSegment<D::query
#8
OLGKAD
opened
6 years ago
3
Added clover for coverage checking
#7
Lucasljungberg
closed
6 years ago
0
compute CC of BTree<T::combined
#6
OLGKAD
closed
6 years ago
0
compute CC of BTree<T::combined() and document the purpose of each branch (in comments)
#5
OLGKAD
opened
6 years ago
1
compute CC of BTree<T::validateNode and document the purpose of each branch (in comments)
#4
OLGKAD
opened
6 years ago
1
compute CC of SplayTree<T::splay() and document the purpose of each branch (in comments)
#3
OLGKAD
opened
6 years ago
1
compute CC of BinarySearchTree<T::getDFS and document the purpose of each branch (in comments)
#2
OLGKAD
opened
6 years ago
1
compute CC of BinaryHeapArray::heapDown() and document the purpose of each branch (in comments)
#1
OLGKAD
closed
6 years ago
3