How to use the tail function from ramda

removeChannelForwards.js

GitHub: thedevs-network/the-guard-bot

17
18
19
20
21
22
23
24
25
26
27
28
29
);
const fromAdmin = R.pathEq([ 'from', 'status' ], 'admin');


const inGroup = ctx => ctx.chat?.type.endsWith('group');


const capturingGroups = R.tail;


const toUsername = R.compose(
	capturingGroups,
	R.match(/^(?:@|(?:https?:\/\/)?(?:t\.me|telegram\.(?:me|dog))\/)(\w+)/i),

162

430

0

index.js

GitHub: pounce-lang/js-core

3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
'uncons': {
    dt: '[[[A+]][Af [Ar]] bind]',
    compose: function (s) {
        var arr = toArrOrNull(s === null || s === void 0 ? void 0 : s.pop());
        if (arr) {
            s.push(r.head(arr), r.tail(arr));
        }
        return [s];
    }
},

0

5

2

+ 4 other calls in file

main01.js

GitHub: martinezq/adventOfCode2022

17
18
19
20
21
22
23
24
25
26
    .map(R.dropLast(1))
    .map(R.dropWhile(x => R.trim(x).length < 1))
    .map(R.reverse)
    .map(R.map(y => y.split('')[1]));

const moves = R.tail(sections[1]).map(x => {
    return U.parse(x, /move (\d+) from (\d+) to (\d+)/, ['num', 'from', 'to']);
});

return {

0

0

0

+ 3 other calls in file

cyclejs-audio-driver.js

GitHub: jemmyw/cyclejs-audio-driver

4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
* @param {*} list
* @return {*}
* @see R.head, R.init, R.last
* @example
*
*      R.tail([1, 2, 3]);  //=> [2, 3]
*      R.tail([1, 2]);     //=> [2]
*      R.tail([1]);        //=> []
*      R.tail([]);         //=> []
*

0

0

0

+ 161 other calls in file

8.2.js

GitHub: cberube/AoC-2022

43
44
45
46
47
48
49
50
51
52
// 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])

const canSee = x => x < currentHeight

const visibleCount = [ left, right, above, below ]

0

0

0

build

GitHub: desenmeng/ramda

202
203
204
205
206
207
208
209
210
211
    if (R.isEmpty(ins)) {
      return outs;
    } else if (R.all(R.contains(_, outs), graph[R.head(ins)])) {
      return recur(R.tail(ins), R.append(R.head(ins), outs));
    } else {
      return recur(R.append(R.head(ins), R.tail(ins)), outs);
    }
  };
  return recur(R.sortBy(R.identity, R.keys(graph)), []);
};

0

0

0

puzzle.js

GitHub: holden-caulfield/adventofcode2020

49
50
51
52
53
54
55
56
57
58
  (memo, value) => [
    ...R.takeLast(2, memo),
    { value, combinations: combinationsFor(value, memo) }
  ],
  [{ value: 0, combinations: 1 }],
  R.tail(sortedAdapters)
)


console.log(`Total possible arrangements: ${R.last(combinations).combinations}`)

0

0

0

app.js

GitHub: SlimTim10/genetic-algorithm

120
121
122
123
124
125
126
127
128
129
130
// 
// [Chromosome] -> (Chromosome, [Chromosome])
const rouletteSelect = (target, population) => {
  const fitnesses = R.map(R.curry(fitness)(target), population)
  const totalFitness = R.sum(fitnesses)
  const cumulFitnesses = R.tail(R.scan(R.add, 0, fitnesses))


  const r = Math.random() * totalFitness
  const [xs, ys] = R.splitWhen(
    ([_, cf]) => cf >= r,

0

0

0

+ 5 other calls in file

11.2.js

GitHub: cberube/AoC-2022

16
17
18
19
20
21
22
23
24
25
26
)


const leastCommonMultiple = (values) => {
  const allEqual = ar => R.all(
    R.equals(R.head(ar)),
    R.tail(ar)
  )
  
  const firstValues = [...values]
  while (!allEqual(values)) {

0

0

0

main01_v2.js

GitHub: martinezq/adventOfCode2022

25
26
27
28
29
30
31
32
33
34
        output: []
    } 
} else {
    return {
        cmd: R.head(c),
        output: R.tail(c).map(x => x.split(' ')).map(x => ({
            name: x[1],
            type: x[0] === 'dir' ? 'dir' : 'file',
            size: x[0] === 'dir' ? undefined : Number(x[0])
        }))

0

0

0

Form.js

GitHub: dvaditya/Autologyx

36
37
38
39
40
41
42
43
44
45
const dispatch = useDispatch();
const getCurrentForm = (responseData, path) => {
  if (path.length <= 1) {
    return responseData?.form;
  } else {
    /*const nextPath = R.tail(path)
    const nextLevel = R.find(R.propEq('moduleName', R.head(nextPath)), responseData.subfolders)
    return getCurrentForm(nextLevel, nextPath)*/
    const fullPath = R.intersperse('subfolders', R.tail(path));
    const form = R.path(['subfolders', ...fullPath, 'form'], responseData);

0

0

0

coin-selection.js

GitHub: topcoder1208/My-Wallet-V4

19
20
21
22
23
24
25
26
27
28
let _findTarget = seed => {
  let acc = seed[0];
  let newCoin = head(seed[2]);
  if (isNil(newCoin) || acc > target + seed[1]) { return false; }
  let partialFee = seed[1] + Coin.inputBytes(newCoin) * feePerByte;
  let restCoins = tail(seed[2]);
  let nextAcc = acc + newCoin.value;
  return acc > target + partialFee ? false : [[nextAcc, partialFee, newCoin], [nextAcc, partialFee, restCoins]];
};
let partialFee = transactionBytes([], targets) * feePerByte;

0

0

0