Try implement recursive type fellow your way, but not work

[millsp]

Try implement recursive type fellow your way, but not work

[millsp]

The condition of your type is non-terminating in some cases. In cases where the length of the tuple is unknown and equals number most probably. This tutorial is for learning purposes, please use Iteration (same as Iterator from the tutorial) Good luck! Le mer. 10 juil. 2019 à 04:47, 林集团 <[email protected]> a écrit :

…

Your GetByPath seems to reference itself. Yes, but I think I just follow you. Consider bellow code you write in Ramda: type Last<T extends any[]> = { 0: Last<Tail<T>>; 1: Head<T>; }[ HasTail<T> extends true ? 0 : 1 ]; The Last also reference itself, but it will well. So, what I missing? — You are receiving this because you were assigned. Reply to this email directly, view it on GitHub <#17>, or mute the thread <https://github.com/notifications/unsubscribe-auth/AEMMUDP65MK4A2DKMHHBUK3P6VESLANCNFSM4H7CCCIQ> .

[millsp]

@jituanlin, please go read my implementation of path in Object/Path.ts. Your GetByPath seems to reference itself. These problems are quite common and this is why I brought Iteration types out, to move over arrays with Next and Prev.

This is what Path uses internally:

import {Object} from 'ts-toolbelt'

declare const f: <
  P extends readonly string[],
  O extends object
>(
  p: P,
  o: O
) => Object.Path<O, T.Writable<P>>; // the lib only accepts writable arrays

const v = f(['a', 'b', 'c'] as const, {a: {b: {c: 1}}});

Note that without the as const TS would narrow ['a', 'b', 'c'] to string[] and this would not work.

[jituanlin]

Your GetByPath seems to reference itself.

Yes, but I think I just follow you.
Consider bellow code you write in Ramda:

    type Last<T extends any[]> = {
        0: Last<Tail<T>>;
        1: Head<T>;
    }[
        HasTail<T> extends true
        ? 0
        : 1
    ];

The Last also reference itself, but it will well.
So, what I missing?