The enumerate function in Javascript

  • 时间:2020-09-16 12:48:17
  • 分类:网络文摘
  • 阅读:152 次

In Python, the enumerate function is an iterator that returns/yield each time a tuple that contains an index (starting from 0 and incrementing) and the element in the list.

In Javascript, we can implement the enumerate function using the iterator and the yield keyword (the asteroid star immediate after function keyword indicates that the function should return an iterator via the yield keyword).

1
2
3
4
5
function *enumerate(array) {
   for (let i = 0; i < array.length; i += 1) {
      yield [i, array[i]];
   }
}
function *enumerate(array) {
   for (let i = 0; i < array.length; i += 1) {
      yield [i, array[i]];
   }
}

Since Javascript does not have a Tuple-type, but we can use array anyway. We can use the defined enumerate function like below:

1
2
3
4
const list = ['a', 'b', 'c'];
for (let x of enumerate(list)) {
   console.log(x);
}
const list = ['a', 'b', 'c'];
for (let x of enumerate(list)) {
   console.log(x);
}

That should output the following:

1
2
3
[0, 'a']
[1, 'b']
[2, 'c']
[0, 'a']
[1, 'b']
[2, 'c']

As you can see, the incrementing index is coupled with the element in the original list/array.

Also, we can use the iterator.next() function until iterator.done is true.

1
2
3
4
5
6
let it = enumerate(['a', 'b', 'c', 'd'])
let result = it.next();
while (!result.done) {
    console.log(result.value)
    result = it.next();
}
let it = enumerate(['a', 'b', 'c', 'd'])
let result = it.next();
while (!result.done) {
    console.log(result.value)
    result = it.next();
}

This should print the following:

1
2
3
4
[ 0, 'a' ]
[ 1, 'b' ]
[ 2, 'c' ]
[ 3, 'd' ]
[ 0, 'a' ]
[ 1, 'b' ]
[ 2, 'c' ]
[ 3, 'd' ]

–EOF (The Ultimate Computing & Technology Blog) —

推荐阅读:
Work More Blogging Jobs, Earn More with Bloggerjobs.biz  Unusually Useful Social Media Stats for Bloggers  Become an Exceptional Writer with Udemy’s “Writing with Flair” C  Seven Ways Of Avoiding Summer Brain Drain At Work  How to Prevent Commiting to master/develop branch by Accidents u  How to Construct Binary Search Tree from Preorder Traversal? (C+  How to Compute the Number of Pawns-Captures for Rook in Chess?  Build Your First Node.JS Unikernel with OPS  The Intersection Algorithm of Two Arrays using Hash Maps in C++/  What Businesses Would Be Like if Web Hosting Didn’t Exist? 
评论列表
添加评论