zoukankan      html  css  js  c++  java
  • [Functional Programming] Daggy

    const daggy = require('daggy');
    const {tagged, taggedSum} = daggy;
    
    
    const Coord = daggy.tagged('Coord', ['x', 'y', 'z'])
    const Line = daggy.tagged('Line', ['from', 'to'])
    
    Coord.prototype.translate = function(x, y, z) {
        return Coord(
            this.x + x,
            this.y + y,
            this.z + z
        )
    }
    const origin = Coord(1,2,3)
    console.log(origin); // { x: 1, y: 2, z: 3 }
    const myLine = Line(
        origin,
        origin.translate(2,4,6)
    );
    console.log(myLine) // { from: { x: 1, y: 2, z: 3 }, to: { x: 3, y: 6, z: 9 } }
    
    
    const Shape = taggedSum('Shape', {
        Square: ['topleft', 'bottomright'],
        Circle: ['centre', 'radius']
    })
    
    Shape.prototype.translate = function(x, y, z) {
        return this.cata({
            Square: (topleft, bottomright) => Shape.Square(
                topleft.translate(x, y, z),
                bottomright.translate(x, y, z)
            ),
            Circle: (centre, radius) => Shape.Circle(
                centre.translate(x, y, z),
                radius
            )
        })
    }
    
    console.log(Shape.Square(Coord(2, 2, 0), Coord(3, 3, 0))
        .translate(3, 3, 3))
    // Square(Coord(5, 5, 3), Coord(6, 6, 3))
    
    console.log(Shape.Circle(Coord(1, 2, 3), 8)
        .translate(6, 5, 4))
    // Circle(Coord(7, 7, 7), 8)

    All the tagged function really does is give us a function to fill the given named properties on an object.

    taggedSum is a combination of multi Typed class.

  • 相关阅读:
    判断有向无环图(DAG)
    单向连通图 Going from u to v or from v to u? poj2762
    百度地图的实时路况 2016 计蒜之道 复赛
    快速模取幂
    fibonacci数列(二)_矩阵快速幂
    数与矩阵快速幂基本知识
    Brute-force Algorithm_矩阵快速幂&&欧拉公式*****
    Nearest number
    Zipper_DP
    Jumping Cows_贪心
  • 原文地址:https://www.cnblogs.com/Answer1215/p/10712944.html
Copyright © 2011-2022 走看看