Skip to content
View zenobiopereira's full-sized avatar
🎧
🎧
  • Natal/RN - Brasil

Block or report zenobiopereira

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse

Pinned Loading

  1. LCTS LCTS Public

    Naive implementation of Lambda Calculus on TypeScript type level.

    TypeScript 1

  2. Type for an abstract function *get*. Type for an abstract function *get*.
    1
    // For the given type, it will return the union of all possible paths recursively or not.
    2
    
                  
    3
    // Tested in https://www.typescriptlang.org/play
    4
    // TS version - 3.7.5
    5
    
                  
  3. Playing with the case where you have... Playing with the case where you have an object of type T and an object of type O where the object being validated must have at least a single property of the O type which validates it.
    1
    // ------------------------------------------cut------------------------------------------------------
    2
    type TObj = { id?: number, id2?: number };
    3
    
                  
    4
    type Path<T> = PathTree<T>[keyof PathTree<T>];
    5
    
                  
  4. Playing with template types... Playing with template types...
    1
    // Utils
    2
    type Assert<A, B extends A> = any;
    3
    
                  
    4
    type Repeat<S extends string, NumberList> = NumberList extends [
    5
      infer _,