1 | /*! |
---|

2 | \file max.cpp |
---|

3 | \author Ha NGUYEN |
---|

4 | \since 27 June 2016 |
---|

5 | \date 27 June 2016 |
---|

6 | |
---|

7 | \brief max reduction |
---|

8 | */ |
---|

9 | #include "max_reduction.hpp" |
---|

10 | #include "utils.hpp" |
---|

11 | |
---|

12 | namespace xios { |
---|

13 | |
---|

14 | CMaxReductionAlgorithm::CMaxReductionAlgorithm() |
---|

15 | : CReductionAlgorithm() |
---|

16 | { |
---|

17 | } |
---|

18 | |
---|

19 | CReductionAlgorithm* CMaxReductionAlgorithm::create() |
---|

20 | { |
---|

21 | return (new CMaxReductionAlgorithm()); |
---|

22 | } |
---|

23 | |
---|

24 | bool CMaxReductionAlgorithm::registerTrans() |
---|

25 | { |
---|

26 | return registerOperation(TRANS_REDUCE_MAX, CMaxReductionAlgorithm::create); |
---|

27 | } |
---|

28 | |
---|

29 | void CMaxReductionAlgorithm::apply(const std::vector<std::pair<int,double> >& localIndex, |
---|

30 | const double* dataInput, |
---|

31 | CArray<double,1>& dataOut, |
---|

32 | std::vector<bool>& flagInitial, |
---|

33 | const double& defaultValue) |
---|

34 | { |
---|

35 | bool hasMissingValue = NumTraits<double>::isnan(defaultValue); |
---|

36 | |
---|

37 | if (hasMissingValue) |
---|

38 | { |
---|

39 | int nbLocalIndex = localIndex.size(); |
---|

40 | int currentlocalIndex = 0; |
---|

41 | dataOut=std::numeric_limits<double>::quiet_NaN(); |
---|

42 | for (int idx = 0; idx < nbLocalIndex; ++idx) |
---|

43 | { |
---|

44 | currentlocalIndex = localIndex[idx].first; |
---|

45 | if (!NumTraits<double>::isnan(*(dataInput + idx))) |
---|

46 | { |
---|

47 | if (flagInitial[currentlocalIndex]) |
---|

48 | { |
---|

49 | dataOut(currentlocalIndex) = *(dataInput + idx); |
---|

50 | flagInitial[currentlocalIndex] = false; |
---|

51 | } |
---|

52 | else |
---|

53 | { |
---|

54 | dataOut(currentlocalIndex) = std::max(*(dataInput + idx), dataOut(currentlocalIndex)); |
---|

55 | } |
---|

56 | } |
---|

57 | } |
---|

58 | } |
---|

59 | else |
---|

60 | { |
---|

61 | int nbLocalIndex = localIndex.size(); |
---|

62 | int currentlocalIndex = 0; |
---|

63 | for (int idx = 0; idx < nbLocalIndex; ++idx) |
---|

64 | { |
---|

65 | currentlocalIndex = localIndex[idx].first; |
---|

66 | if (flagInitial[currentlocalIndex]) |
---|

67 | { |
---|

68 | dataOut(currentlocalIndex) = *(dataInput + idx); |
---|

69 | flagInitial[currentlocalIndex] = false; |
---|

70 | } |
---|

71 | else |
---|

72 | { |
---|

73 | dataOut(currentlocalIndex) = std::max(*(dataInput + idx), dataOut(currentlocalIndex)); |
---|

74 | } |
---|

75 | } |
---|

76 | } |
---|

77 | } |
---|

78 | |
---|

79 | } |
---|