amdis-core merge requestshttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests2020-12-29T16:38:40Zhttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/263Return vector by reference and typo corrections2020-12-29T16:38:40ZPraetorius, SimonReturn vector by reference and typo correctionshttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/262Test more grids in gradient test2021-01-11T16:19:29ZPraetorius, SimonTest more grids in gradient testhttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/261Make the backend solver directly accessible in ProblemStat2020-12-29T15:04:15ZPraetorius, SimonMake the backend solver directly accessible in ProblemStathttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/260Simplify linear algebra backend LinearSolver2020-12-29T13:25:19ZPraetorius, SimonSimplify linear algebra backend LinearSolverhttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/259fix problems after merge2020-12-26T17:06:32ZPraetorius, Simonfix problems after mergehttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/258WIP: Add utility eliminateRows2021-07-18T20:10:02ZPraetorius, SimonWIP: Add utility eliminateRowshttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/257WIP: Add check whether preconditioners and solvers can be used with the given...2021-07-18T20:08:40ZPraetorius, SimonWIP: Add check whether preconditioners and solvers can be used with the given matrix/vector typehttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/256Test all backends in gitlabci2020-12-22T16:25:17ZPraetorius, SimonTest all backends in gitlabciCloses #16Closes #16https://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/255Move all recursive algorithms to algorithm subdirectory2020-12-22T16:24:44ZPraetorius, SimonMove all recursive algorithms to algorithm subdirectoryhttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/254change version number to 0.32020-12-08T22:19:50ZPraetorius, Simonchange version number to 0.3https://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/253Correct naming of operator in addOperator() function of LinearForm and BiLine...2020-11-30T15:05:06ZPraetorius, SimonCorrect naming of operator in addOperator() function of LinearForm and BiLinearFormhttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/252Add enumerate algorithm and remove exclusive_scan2020-11-30T20:54:32ZPraetorius, SimonAdd enumerate algorithm and remove exclusive_scanhttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/251Cleanup the treepath functions and concepts2020-11-30T14:49:15ZPraetorius, SimonCleanup the treepath functions and conceptshttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/250Put TreeContainer in a separate namespace TypeTree and rename makeTreeContain...2020-11-29T13:18:10ZPraetorius, SimonPut TreeContainer in a separate namespace TypeTree and rename makeTreeContainer into treeContainerhttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/249WIP: typetree cleanup2020-11-29T22:36:14ZPraetorius, SimonWIP: typetree cleanuphttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/248Allow std containers as coefficients in DiscreteFunction and allow DefaultGlo...2020-11-30T14:35:09ZPraetorius, SimonAllow std containers as coefficients in DiscreteFunction and allow DefaultGlobalBasishttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/247WIP: Replace for_each_node loops by tuple expansion2021-07-18T10:25:16ZPraetorius, SimonWIP: Replace for_each_node loops by tuple expansion(This is just an experiment)(This is just an experiment)https://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/246WIP: Add new detection function isValid2020-11-21T23:19:55ZPraetorius, SimonWIP: Add new detection function isValidhttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/245Rename for_each_node into Traversal::forEachNode2020-11-28T18:45:37ZPraetorius, SimonRename for_each_node into Traversal::forEachNode### Summary
- Introduce new namespace `Traversal`
- rename `for_each_node` into `Traversal::forEachNode`
- rename `for_each_leaf_node` into `Traversal::forEachLeafNode`
- replace `Hybrid::forEach` loop by if-constexpr switch### Summary
- Introduce new namespace `Traversal`
- rename `for_each_node` into `Traversal::forEachNode`
- rename `for_each_leaf_node` into `Traversal::forEachLeafNode`
- replace `Hybrid::forEach` loop by if-constexpr switchhttps://gitlab.math.tu-dresden.de/amdis/amdis-core/-/merge_requests/244Enforce style convention to apply and forEach functions and add recursive imp...2020-11-24T15:10:44ZPraetorius, SimonEnforce style convention to apply and forEach functions and add recursive implementations### Summary
Put all the utilities for container operations into the `Ranges` namespace:
- `Ranges::apply`
- `Ranges::applyIndices`
- `Ranges::forEach`
- `Ranges::forIndices`
Add the new namespace `Recursive` for recursive application of...### Summary
Put all the utilities for container operations into the `Ranges` namespace:
- `Ranges::apply`
- `Ranges::applyIndices`
- `Ranges::forEach`
- `Ranges::forIndices`
Add the new namespace `Recursive` for recursive application of functions to containers:
- `Recursive::apply`
- `Recursive::forEach`