The following document contains the listing of user tags found in the code. Below is the summary of the occurrences per tag.
| Tag Class | Total number of occurrences | Tag strings used by tag class |
|---|---|---|
| Code Work | 47 | FIXME, TODO, @todo |
Each tag is detailed below:
Number of occurrences found in the code: 47
| org.thegalactic.context.Context | Line |
|---|---|
| Use parameterized Node | 383 |
| Enforce test | 831 |
| org.thegalactic.context.constraint.numerical.NumericalStorage | Line |
| Is it the meet operation? | 244 |
| org.thegalactic.context.io.ContextSerializerSLF | Line |
| use StreamTokenizer | 121 |
| org.thegalactic.dgraph.ConcreteDGraph | Line |
| use a TreeSet for edges with a specific comparator for predecessors | 75 |
| use iterator pattern (some changes in ArrowRelation.java and Lattice.java) | 200 |
| use iterator pattern (some changes in ArrowRelation.java and Lattice.java) | 218 |
| see getNode | 237 |
| maybe use try { return this.nodes.subSet(search, true, search, true).first(); } catch (NoSuchElementException e) { return null; } | 258 |
| this method is not efficient. Do we remove it or add an index on DGraph using content field? Verify where it is called for migrating it if necessary. | 278 |
| implement a SubGraph class? | 554 |
| implement a SubGraph class? | 584 |
| Do we change that to iterators? Change to private and add a method that return an iterator | 830 |
| org.thegalactic.dgraph.DAGraph | Line |
| Do we forbid to add an edge that breaks acyclic property by verifying that the destination node has no successors? May be a DAGraph could contain a ConcreteDGraph and export only interesting method by proxy | 45 |
| org.thegalactic.dgraph.DGraph | Line |
| Do use N insteand of Node and E instead of Edge by defining DGraph<N extends Comparable<N>, E> | 22 |
| org.thegalactic.lattice.ArrowRelation | Line |
| Avoid using for (Object edge : this.getEdges()). Use for (Edge edge : this.getEdges()) | 158 |
| org.thegalactic.lattice.BijectiveComponents | Line |
| do we use getLattice or getReducedLattice ? | 337 |
| do we use getLattice or getReducedLattice ? | 362 |
| do we use getLattice or getReducedLattice ? | 375 |
| do we use getLattice or getReducedLattice ? | 401 |
| org.thegalactic.lattice.BijectiveComponentsTest | Line |
| make the test Windows compliant | 91 |
| org.thegalactic.lattice.ClosureSystem | Line |
| getPredecessorNodes must return an iterator | 293 |
| org.thegalactic.lattice.ClosureSystemTest | Line |
| There's something wrong with that test : diagramLattice is always empty ... See ConceptLattice tests | 74 |
| There's something wrong with that test : diagramLattice is always almost empty ... See ConceptLattice tests | 88 |
| org.thegalactic.lattice.Concept | Line |
| Should not inherit from Node since content is not used. Maybe by using interface. | 42 |
| org.thegalactic.lattice.ConceptLattice | Line |
| Comment the return | 293 |
| Comment the return | 309 |
| Comment the return: conception | 321 |
| Comment the return | 341 |
| Comment the return | 408 |
| Comment the return | 426 |
| Comment the return | 445 |
| Comment the return | 469 |
| Comment the return | 498 |
| Comment the return | 548 |
| Change comment | 576 |
| use Node<Concept> | 779 |
| org.thegalactic.lattice.ConceptLatticeTest | Line |
| Avoid using Object when a Node is required | 33 |
| Avoid casting to Node | 35 |
| org.thegalactic.lattice.Lattice | Line |
| remove useless comments: Karell | 69 |
| this.minorants should return an iterator | 324 |
| minorants should return an iterator | 327 |
| this.majorants should return an iterator | 352 |
| this.majorants should return an iterator | 355 |
| org.thegalactic.rule.AssociationRule | Line |
| do we use composition over inheritance? | 26 |
| org.thegalactic.util.ComparableSet | Line |
| Check if this class is correctly used (performance). Overload modification method to compute the hashCode only once. | 36 |
| Is this correct? (see test) | 109 |