aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/node/sortresult.cpp
Commit message (Collapse)AuthorAgeFilesLines
* Fix regressionRenaud G2022-01-221-5/+4
|
* dice: remove debug outputRenaud G2021-04-271-1/+1
|
* Compile on Qt5.15Renaud G2021-01-241-1/+1
|
* fix compilationRenaud G2020-11-061-1/+1
|
* coding style on sort result node.Renaud G2020-06-121-59/+55
|
* Change website addressRenaud G2020-04-121-1/+1
|
* Remove warnings.Renaud G2020-01-291-1/+1
|
* Fix issue on priorityRenaud G2019-02-131-3/+2
|
* clang formatRenaud G2019-02-121-88/+80
|
* clazy warningsRenaud G2019-01-051-1/+2
|
* WIPRenaud G2018-12-151-3/+20
|
* remove useless commitRenaud G2017-11-251-4/+4
|
* update diceparserRenaud G2017-11-121-4/+4
|\
* | -replace NULL to nullptr.Renaud G2017-11-111-6/+6
| |
| * -c++11 update about for and nullptr.Renaud G2017-10-291-10/+7
|/
* -fix crash memory in sort result.Renaud G2017-01-281-2/+6
| | | | | TODO: Optimization about the copy of die. Perhaps using reference will be better.
* -Add API for copying a branch of execution node.Renaud G2016-11-281-1/+11
| | | | -Allow to use if node several times.
* update dice system.Renaud G2016-07-101-1/+1
|
* change contact link.Renaud G2016-04-031-1/+1
|
* Merge branch 'rangeInList'Renaud G2015-10-111-2/+10
|\ | | | | | | | | | | | | | | | | | | | | resolved conflicts and merge rangeInList in master. Conflicts: HelpMe.md diceparser.cpp parsingtoolbox.cpp result/result.cpp result/stringresult.h
* | fix cppcheck issueRenaud G2015-08-281-6/+1
| |
| * add bool parameter to toString() function in node.Renaud G2015-08-201-4/+8
| |
| * start fixing dot tree generationRenaud G2015-08-201-1/+5
|/
* improve output for dot systemRenaud G2015-05-051-1/+1
|
* add comments and gpl header to those files for better documentation in doxygenRenaud G2015-04-301-1/+22
|
* Dot tree now also displays the result tree. (must be improved).Renaud G2015-04-251-1/+2
|
* add better error management (not finished yet)Renaud G2015-03-311-3/+0
| | | | | add check for endless loop in validator (not finished yet) Better helpMe
* -store pointeur to previous node.Renaud G2015-03-031-1/+1
|
* Add error management. Protect sort node after scalar result node.Renaud G2014-11-091-7/+6
|
* Update sortresult.cppobiwankennedy2014-01-301-0/+11
| | | getPriority
* fix some issue with parentheses management.Renaud G2014-01-251-1/+1
|
* Update sortresult.cppobiwankennedy2014-01-211-1/+5
| | | toString
* Update sortresult.cppobiwankennedy2014-01-141-1/+2
| | | Adding previous result API.
* Update sortresult.cppobiwankennedy2014-01-091-20/+33
| | | dichotomy sorting
* Update sortresult.cppobiwankennedy2014-01-081-14/+40
| | | manual sort because of die*.
* Update sortresult.cppobiwankennedy2014-01-071-15/+32
| | | add diceresult
* Add new management of result.Renaud G2014-01-051-2/+2
| | | | It may require to make several
* -Adding range, booleancondition and countexecutenode.Renaud G2014-01-041-0/+37