How to use the reverse function from ramda

main.js

GitHub: hakantunc/hyp-down

76
77
78
79
80
81
82
83
84
85
  console.log(`status:${data.status}`, data);
}
var images
  = R.compose(
      R.join('\n'),
      R.reverse(),
      R.map(o => `![](${o.link})`),
      R.filter(e => dateInBetween(new Date(e.datetime*1000), beg, end))
    )(data.data);
console.log(images);

0

6

0

compose.js

GitHub: jolson88/damu

33
34
35
36
37
38
39
40
41
                } else {
                    return run(ctx, fn);
                }
            },
            initialContext,
            R.reverse(args)
        );
    };
};

0

1

0

tests.js

GitHub: YWTechIT/functional-programming-in-javascript

129
130
131
132
133
134
135
136
137
138
let students = ['Rosser', 'Turing', 'Kleene', 'Church'];
let grades = [80, 100, 90, 99];

const first = R.head;
const getName = R.pluck(0);
const reverse = R.reverse;
const sortByGrade = R.sortBy(R.prop(1));
const combine = R.zip;
let result = R.compose(first, getName, reverse, sortByGrade, combine);
assert.equal(result(students, grades), 'Turing');

0

0

1

bankFacts.js

GitHub: qaverill/q-core

88
89
90
91
92
93
94
95
96
97
});
function importBankFacts() {
  return new Promise((resolve) => {
    importExistingBankFacts().then((existingTransactions) => {
      importNewBankFacts().then((newTransactions) => {
        const allFacts = R.reverse(R.sortBy(
          R.prop('timestamp'),
          R.unionWith(R.eqBy(R.prop('id')), existingTransactions, newTransactions),
        ));
        exportBankFacts(allFacts);

0

0

0

cyclejs-audio-driver.js

GitHub: jemmyw/cyclejs-audio-driver

3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
* @sig String -> String
* @param {Array|String} list
* @return {Array|String}
* @example
*
*      R.reverse([1, 2, 3]);  //=> [3, 2, 1]
*      R.reverse([1, 2]);     //=> [2, 1]
*      R.reverse([1]);        //=> [1]
*      R.reverse([]);         //=> []
*

0

0

0

+ 143 other calls in file

8.2.js

GitHub: cberube/AoC-2022

40
41
42
43
44
45
46
47
48
const columnData = R.splitAt(y, getColumn(x))

// We want to look FROM the tree TOWARDS the edge, but the
// left and above arrays will be orders FROM the edge TOWARDS
// the tree, so we reverse them
const left = R.reverse(rowData[0])
const above = R.reverse(columnData[0])
const right = R.tail(rowData[1])
const below = R.tail(columnData[1])

0

0

0

day21.js

GitHub: jcla1/AdventOfCode

46
47
48
49
50
51
52
53
54
55
if (p2Score >= 21) return [0, 1];

return R.reduce(R.zipWith(R.add), [0, 0],
    R.map((t) => {
      const pos = (p1 + t) % 10;
      return R.reverse(
          quantumGame(
              [p2, pos],
              [p2Score, p1Score + (pos === 0 ? 10 : pos)]));
    }, possibleSeqs));

0

0

0

+ 6 other calls in file

BaseQuery.js

GitHub: 22317a57/cube-js-legacy

541
542
543
544
545
546
547
548
549
550
  return granularityA;
}
if (granularityA === granularityB) {
  return granularityA;
}
const aHierarchy = R.reverse(this.granularityParentHierarchy(granularityA));
const bHierarchy = R.reverse(this.granularityParentHierarchy(granularityB));
let lastIndex = Math.max(
  aHierarchy.findIndex((g, i) => g !== bHierarchy[i]),
  bHierarchy.findIndex((g, i) => g !== aHierarchy[i])

0

0

0

5.2.js

GitHub: cberube/AoC-2022

39
40
41
42
43
44
45
46
47
48
        if (item.length == 0) return
        workingStacks[idx].push(item)
      },
    )
  }),
  R.reverse
)(stacks)

// Now let's clean up the instructions list
// - Trim any blank lines

0

0

0