JavaScript provides primitive types and means of processing those. However, those are not enough. Real data must somehow come into the program and data must somehow leave the program, for it to become useful to us. In this talk, we will see how two abstractions are essential for data flow and to build up other abstractions, such as Iterator, Iterable, Observable, Scheduling, and others. Talk

Getter as abstractions:

const ten = ;

// Abstractions
// Laziness
const getTen = () => { console.log("hi"); // hook for side effects // Implementation flexibility
return + ;
// return 2 * 5;
// return 10
}

Benefits:

  • First of all: 'getTen' if you don't call the function, the calcuation inside the fucntion never run.
  • You can do any side effects inside function.
  • Implmentation flexibility, you can do different ways to aecieve the same effects.

Think about this code:

function add(getX, getY) {
const x = getX();
const y = getY();
return x + y;
}

'getX' and 'getY' are abstract. What we are doing now is adding two abstract number in concrete world. What if we add in abstract world?

function add(getX, getY) {
return () => { // put code into a get getter function
const x = getX();
const y = getY();
return x + y;
}
}

Now the function are complete lazy, lazyniess is a good thing, when you have some lzay you use getter can make things concrete.

function add(getX, getY) {
return () => {
const x = getX();
const y = getY();
return x + y;
}
} const getTen = () => ;
const getY = Math.random; const getSum = add(getTen, getY); // so far no calcuation happens

Lazy initialization and lazy iteration:

let i = ;
const array = [,,,];
function getArrayItem() {
// lazy iteration
return array[i++];
} console.log(getArrayItem());
console.log(getArrayItem());
console.log(getArrayItem());
console.log(getArrayItem());
console.log(getArrayItem()); // undefined

This is a concrete example, we call the fucntion mutiplue time and loop though the array.

And we also see that after call result as 'undefined', if we want to loop the array again from zero idnex, we have to do:

let i = ;
const array = [,,,];
function getArrayItem() {
// lazy iteration
return array[i++];
} console.log(getArrayItem());
console.log(getArrayItem());
console.log(getArrayItem());
console.log(getArrayItem()); i = ;
console.log(getArrayItem());
console.log(getArrayItem());
console.log(getArrayItem());
console.log(getArrayItem());

We call

i = ;

Of course this is not good at all, we leak the information.

The way to improve it is by using getter & lazyniess:

function getGetArrayItem() {
// lazy initialization
let i = ;
const array = [,,,];
return function() {
// lazy iteration
return array[i++];
}
} let getArrayItem = getGetArrayItem(); console.log(getArrayItem());
console.log(getArrayItem());
console.log(getArrayItem());
console.log(getArrayItem()); getArrayItem = getGetArrayItem(); console.log(getArrayItem());
console.log(getArrayItem());
console.log(getArrayItem());
console.log(getArrayItem());

getter-getter: Abstract List:

Think about the following example:

function range(left, right) {

  return () => {
// lazy initialization
let x = left;
return () => {
// lazy iteration
if (x > right) {
return undefined;
}
return x++;
}
}
} const getGet = range( , );
const get = getGet(); console.log(get()); //
console.log(get());
console.log(get());
console.log(get());
console.log(get()); //
console.log(get()); // undefined
console.log(get());
console.log(get());

It prints out the range of nuber, which we defined, we can notice after the right limit of the number, it just print out undefined.

One way to solve the undefined problem is using for loop:

function range(left, right) {

  return () => {
// lazy initialization
let x = left;
return () => {
// lazy iteration
if (x > right) {
return undefined;
}
return x++;
}
}
} const getGet = range( , ); for(let get = getGet(), x = get(); x !== undefined; x = get()) {
console.log(x) // 10 ... 14
}

The good thing about this code is that no matter how large the range it is, the menory size is always 1. Every time you call the fucntion, it pull one value from the abstract getter function every time. It makes CPU and memory efficient.


Completion markers:

function range(left, right) {

  return () => {
// lazy initialization
let x = left;
return () => {
// lazy iteration
if (x > right) {
return {done: true};
}
return {done: false, value: x++};
}
}
} const getGet = range(, ); for(let get = getGet(), res = get(); !res.done; res = get()) {
console.log(res.value) // 10 ... 14
}

We added {done: true | false} as a complete marker.


Convert to Symbol.iterator:

function range(left, right) {

  return {
[Symbol.iterator]: () => {
// lazy initialization
let x = left;
return {
next: () => {
// lazy iteration
if (x > right) {
return {done: true};
}
return {done: false, value: x++};
}
}
}
}
}

Javascript notice that when you are using [Symbol.iterator] and have  'next' inside, then it provides you a nice syntax to loop over the iterator and get the value of out it.

for(let x of range(, )) {
console.log(x) // 10 ... 14
}

We might have done this:

function range(left, right) {

  return {
[Symbol.iterator]: () => {
// lazy initialization
let x = left;
return {
next: () => {
// lazy iteration
if (x > right) {
return {done: true};
}
return {done: false, value: x++};
}
}
}
}
} for(let x of range(,)) {
if(x % === ) {
console.log(x)
}
}

We using 'if' inside 'for' loop, well it is nothing wrong, but we can do better. Because range() is abstract function, we don't need to pull all the value done to the concrete world to do the filtering, we can also do the filtering in abstract function.

const filter = pred => iterations => {
let z = [];
for (let x of iterations) {
if(pred(x)) z.push(x);
}
return z;
}; function range(left, right) { return {
[Symbol.iterator]: () => {
// lazy initialization
let x = left;
return {
next: () => {
// lazy iteration
if (x > right) {
return {done: true};
}
return {done: false, value: x++};
}
}
}
}
} for(let x of filter(x => x % === )(range(,))) {
console.log(x)
}

Setter-setter abstraction:

You can think of "setter-setter" is callback:

const setSetTen = (setTen) => {
setTen()
} setSetTen(console.log) //

The benifits of doing setter-setter is

  • Async
  • Inversion of control
const setSetTen = (setTen) => {
setTimeout(() => {
//Async
setTen()
}, ) } setSetTen(console.log) //

Setter-setter to Observable:

[Javascript] Getter and Setter Abstractions的更多相关文章

  1. JavaScript getter and setter All In One

    JavaScript getter and setter All In One getter & setter JavaScript Object Accessors JavaScript A ...

  2. JavaScript getter和setter

    对象的属性是由属性名name,值key,和其他特性(可读写性 writable,可枚举性enumerable,可配置性configurable)组成的.从ES5开发,提供了getter和setter ...

  3. javascript的getter和setter(转)

    显然这是一个无关IE(高级IE除外)的话题,尽管如此,有兴趣的同学还是一起来认识一下ECMAScript5标准中getter和setter的实现.在一个对象中,操作其中的属性或方法,通常运用最多的就是 ...

  4. JavaScript中闭包实现的私有属性的getter()和setter()方法

    注意: 以下的输出都在浏览器的控制台中 <!DOCTYPE html> <html> <head> <meta charset="utf-8&quo ...

  5. javascript中的function命名空間與模擬getter、setter

    function的命名空間 在javascript中,function也可以擁有自己的命名空間例如以下這段程式碼: 12345678 function () { return 'I am A';} A ...

  6. javascript权威指南笔记--javascript语言核心(五)--getter和setter属性

    getter和setter属性: var p = { x:1.0, y:1.0, get r(){ return Math.sqrt(this.x*this.x + this.y * this.y); ...

  7. javascript中的getter和setter

    在ECMAScript 5中,属性值可以用一个或两个方法代替,这两个方法就是getter和setter var man = { name : 'lidg', weibo : '@lidg', get ...

  8. 基于 getter 和 setter 撸一个简易的MVVM

    Angular 和 Vue 在对Angular的学习中,了解到AngularJS 的两个主要缺点: 对于每一次界面时间,Ajax 或者 timeout,都会进行一个脏检查,而每一次脏检查又会在内部循环 ...

  9. js中的访问器属性中的getter和setter函数实现数据双向绑定

    嗯,之前在读js红宝书的时候,在对象那一章有介绍属性类型.第一种数据类型指的是数据属性,第二种是访问器属性.在初识vue的时候,其双向数据绑定也是基于访问器属性中的getter和setter函数原理来 ...

随机推荐

  1. git拉取远端改变,但是不覆盖本地的修改

    1.git stash 2.git  fetch weixin-old-remote 3.git rebase weixin-old-remote/main151028_wxpay_main15100 ...

  2. PCB MS SQL跨库执行SQL 获取返回值

    一.SQL跨库执行SQL 获取返回值 ) DECLARE @sql nvarchar(MAX) DECLARE @layer INT SET @Dblink = 'P2.fp_db.dbo.' sel ...

  3. bzoj3297[USACO2011 Open]forgot(dp + string)

    3297: [USACO2011 Open]forgot Time Limit: 10 Sec  Memory Limit: 128 MBSubmit: 137  Solved: 94[Submit] ...

  4. JS——事件详情(鼠标事件:clientX、clientY的用法)

    鼠标位置 >可视区位置:clientX.clientY 跟着鼠标移动的div案例 代码如下图:   这个案例,运用到前一篇文章中的event事件来处理.获取div的left和top值,当鼠标移动 ...

  5. 模拟Queue(wait/notify)

    BlockingQueue:顾名思义,首先它是一个队列,并且支持阻塞的机制,阻塞的放入和得到数据.我们要实现LinkedBlockingQueue下面的两个方法put和take. put(anObje ...

  6. A - Next Round

    Problem description "Contestant who earns a score equal to or greater than the k-th place finis ...

  7. 软件架构自学笔记——常见的软件架构(https://jiajunhuang.com/articles/2018_09_16-common_software_archtecture_pattern.md.html)

    分层模式 这种模式主要是将设计分层,每一层为其上层提供服务.例如:web开发中我们常常将某些常用的RESTful接口抽象出一个service层. 客户端-服务端模式 客户端和服务端分离,从而解耦.通过 ...

  8. ajax 三级联动写法

    主页面代码 <!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF ...

  9. Boost-QT兼容问题:#define FUSION_HASH #

    使用原始的MSVC10+QT48很长时间,需要把PCL升级到新的版本,不再使用自行编译的PCL1.7.2版本. 在使用MSVC2012的时候,使用MSVC12-的PCL1.8.0版本,出现了一个不大不 ...

  10. veket智能机器人

    官方网站:http://www.lucky8k.com/forum.php veket儿童操作系统 希望工具超过小puppy linux系统 一个还在发展中的linux系统: Slax Linux : ...