js函数式编程
定义
函数式编程(Functional Programming,后面简称FP),维基百科的定义是:
是一种编程范型,它将电脑运算视为数学上的函数计算,并且避免使用程序状态以及易变对象。函数编程语言最重要的基础是λ演算(lambda calculus)。而且λ演算的函数可以接受函数当作输入(引数)和输出(传出值)。比起命令式编程,函数式编程更加强调程序执行的结果而非执行的过程,倡导利用若干简单的执行单元让计算结果不断渐进,逐层推导复杂的运算,而不是设计一个复杂的执行过程。
我来尝试理解下这个定义,好像就是说,在敲代码的时候,我要把过程逻辑写成函数,定义好输入参数,只关心它的输出结果。而且可以把函数作为输入输出。感觉好像平常写js时,就是这样的嘛!
特性
网上FP的定义与特性琳琅满目。各种百科、博客、一些老师的网站上都有大同小异的介绍。为了方便阅读,我列下几个好像比较重要的特性,并附上我的第一眼理解。
函数是一等公民。就是说函数可以跟其他变量一样,可以作为其他函数的输入输出。喔,回调函数就是典型应用。
不可变量。就是说,不能用var跟let咯。按这要求,我似乎有点难写代码。
纯函数。就是没有副作用的函数。这个好理解,就是不修改函数外部的变量。
引用透明。这个也好理解,就是说同样的输入,必定是同样的输出。函数内部不依赖外部状态,如一些全局变量。
惰性计算。大意就是:一个表达式绑定的变量,不是声明的时候就计算出来,而是真正用到它的时候才去计算。
filter的使用
var animals = [
{name:'Fluffykins',species:'rabbit'},
{name:'Caro',species:'dog'},
{name:'Hamilton',species:'dog'},
{name:'Harold',species:'fish'},
{name:'Ursula',species:'cat'},
{name:'Jimmy',species:'fish'}
]
//第一种做法
var dogs = []
for (var i = 0; i < animals.length; i++){
if(animals[i].species === 'dog'){
dog.push(animals[i])
}
}
//第二种做法
var dogs = animals.filter(function(animal){
return animal.species === 'dog'
})
//优化
let isDog = unction(animal){
return animal.species === 'dog'
}
var dogs = animals.filter(isDog)map的使用
var animals = [
{name:'Fluffykins',species:'rabbit'},
{name:'Caro',species:'dog'},
{name:'Hamilton',species:'dog'},
{name:'Harold',species:'fish'},
{name:'Ursula',species:'cat'},
{name:'Jimmy',species:'fish'}
]
//第一种做法
var names = []
for ( var i = 0 ; i < animals.length; i++){
names.push(animals[i].name)
}
//第二种做法
var names = animals.map(function(animal){
return animal.name
})
//优化
var names = animals.map((animal) => animal.name)
reduce
var orders = [
{amount:250},
{amount:400},
{amount:100},
{amount:325}
]
//第一种做法
var totalAmount = 0
for ( var i = 0; i < orders.length; i++){
totalAmount = orders[i].amount
}
//第二种做法
var totalAmount = orders.reduce(function(sum,order){
return sum + order.amount
},0)
//优化
var totalAmount = orders.reduce((sum,order) => sum + order.amount
},0)curry
let dragon = (name,size,element) =>
`${name} is a ${size} dragon that breathes ${element} !`
console.log(dragon('fluffykins','tiny','lightling'))
//curry
let dragon =
name =>
size =>
element =>
`${name} is a ${size} dragon that breathes ${element} !`
console.log(dragon('fluffykins')('tiny')('lightling'))
//还可以
let dragon =
name =>
size =>
element =>
`${name} is a ${size} dragon that breathes ${element} !`
let fluffykinDragon = dragon('fluffykins')
console.log(fluffykinDragon('tiny')('lightling'))
//甚至是这样
let dragon =
name =>
size =>
element =>
`${name} is a ${size} dragon that breathes ${element} !`
let fluffykinDragon = dragon('fluffykins')
let tinyDragon = fluffykinDragon('tiny')
console.log(tinyDragon('lightling'))
//使用lodash
import _ from 'lodash'
let dragon =(name,size,element) => (
`${name} is a ${size} dragon that breathes ${element} !`
)
dragon = _.curry(dragon)
let fluffykinDragon = dragon('fluffykins')
let tinyDragon = fluffykinDragon('tiny')
console.log(tinyDragon('lightling'))
let dragons = [
{name:'fluffykins',element:'lightning'},
{name:'nomi',element:'lightning'},
{name:'karo',element:'fire'},
{name:'doomer',element:'timewrap'},
]
let hasElement = (element,obj) => obj.element === element
let lightingDragons = dragons.filter(x => hasElement('lightning',x)
console.log(lightingDragons)
//使用loadash_curry改造
import _ from 'lodash'
let hasElement = _.curry(element,obj) => obj.element === element
let lightingDragons = dragons.filter(hasElement('lightning'))
console.log(lightingDragons)
递归
let categories = [
{
id:'animals',
'parent':null
},
{
id:'mammals',
'parent':'animals'
},
{
id:'cats',
'parent':'mammals'
},
{
id:'dogs',
'parent':'mammals'
},
{
id:'chihuahua',
'parent':'dogs'
},
{
id:'labrador',
'parent':'dogs'
},
{
id:'persian',
'parent':'cats'
},
{
id:'siamese',
'parent':'cats'
}
]
let makeTree = (categories,parent) => {
let node = {
}
categories.filter(c => c.parent === parent)
.forEach(c =>
node[c.id] = makeTree(categories,c.id))
return node
}
console.log(
JSON.stringify(
makeTree(categories,null)
,null
,2
)
)本文内容仅供个人学习/研究/参考使用,不构成任何决策建议或专业指导。分享/转载时请标明原文来源,同时请勿将内容用于商业售卖、虚假宣传等非学习用途哦~感谢您的理解与支持!