| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
HAHP.Algorithm
- simpleAHP :: AHPDataSet -> (AHPDataSet, [TreeError], [AlternativesError])
- initAHP :: AHPTree -> AHPTree
- rankAlternatives :: AHPDataSet -> AHPDataSet
- sortOn' :: Ord b => (a -> b) -> [a] -> [a]
Documentation
simpleAHP :: AHPDataSet -> (AHPDataSet, [TreeError], [AlternativesError]) Source
This function is a quick way to rank a set of alternatives with AHP algorithm. This function call everithing required to configure an execute AHP process. If something goes wrong, an error is raised.
Part 1 = static part
Part 2 = dynamic part
sortOn' :: Ord b => (a -> b) -> [a] -> [a] Source
Sort a list by comparing the results of a key function applied to each
element. sortOn f is equivalent to sortBy . comparing f, but has the
performance advantage of only evaluating f once for each element in the
input list. This is called the decorate-sort-undecorate paradigm, or
Schwartzian transform.
see https://hackage.haskell.org/package/base-4.8.1.0/docs/src/Data.OldList.html#sortOn
TODO : Remote this function and use default haskell sortOn. Note: Compilation issues on mac. sortOn is not provided.
Since: 4.8.0.0