zoukankan      html  css  js  c++  java
  • [Ramda] R.project -- Select a Subset of Properties from a Collection of Objects in Ramda

    In this lesson we'll take an array of objects and map it to a new array where each object is a subset of the original. We'll look at multiple ways to accomplish this, refactoring our code into a simple and easy to read function using Ramda's mappick and project functions.

    Lets say we have an array of objects, we want to only pick the 'name' and 'price' props from each object:

    const products = [
      {name: 'Jeans', price:80, category: 'clothes'},
      {name: 'Hoodie', price:60, category: 'clothes'},
      {name: 'Jacket', price:120, category: 'clothes'},
      {name: 'Cards', price: 35, category: 'games'},
      {name: 'iPhone', price: 649, category: 'electronics'},
      {name: 'Sauce Pan', price: 100, category: 'housewares'}
      ]
    
    const result = products.map(p => ({name: p.name, price: p.price}))
    
    console.log(result);

    It works but as we can image that if we need to pick 10 props or even more, then it would be a problem, the code would be hard to read.

    We can improve this by using Ramda's pick method:

    const result = products.map(p => R.pick(['name', 'price'], p))

    Then we can utilize Ramda automaticlly curry function to improve the code:

    const result = products.map(R.pick(['name', 'price']))

    Then we can extract the bussniess logic into a sprate function to make it resuable:

    const getNameAndPrice = R.map(R.pick(['name', 'price']));
    const result = getNameAndPrice(products);

    Since it is a common pattern that "map to each object in array and pick certain props will it",  we can use "R.project":

    const getNameAndPrice = R.project(['name', 'price']);
    const result = getNameAndPrice(products);
  • 相关阅读:
    码农的半衰期只有15年?
    微软面试100题2010年版全部答案集锦(转自July)
    大量url,如何去重
    后缀树求最长子字符串
    转 STL hash_map & map
    有n 个长为m+1 的字符串,求前后m个字符匹配所能形成的最长字符串链:利用弗洛伊德算法求最长路径
    获取本机地址信息,遇到小问题...有待解决
    HDOJ 1006
    归并排序
    插入排序的简单实现
  • 原文地址:https://www.cnblogs.com/Answer1215/p/6297152.html
Copyright © 2011-2022 走看看