当前位置:网站首页>Classification, understanding and application of common methods of JS array
Classification, understanding and application of common methods of JS array
2022-07-06 12:13:00 【Aboci Bang】
var arr = [‘a’,‘b’,‘c’,‘d’,‘e’];
Stack method push
arr.push(‘f’,‘e’); // Add one or more elements... To the end of the array Return array length ! It's going to change the array
Stack method pop
arr.pop(); // Array length minus one , Delete and return the last array element ! It's going to change the array
Queue method shift
arr.shift(); // Array length minus one , Delete and return the first array element ! It's going to change the array
Queue method unshift
arr.unshift(‘f’,‘e’); // Add one or more elements to the beginning of the array Return array length ! It's going to change the array
Sorting method reverse
arr.reverse(); // Used to reverse and return the original array It's going to change the array
Sorting method sort
arr.sort() // Sort by the character encoding order of the array elements ‘a’.charCodeAt() //97
Parameter is a function Default ascending sort ! It's going to change the array
Function return value and 0 Compare :
Return value greater than 0 a Will move to b Behind ; Equal to zero position unchanged ; Less than 0 a Move to b In front of
// Ascending
arr.sort(function(a,b){
return a - b;
});
arr.sort((a,b)=>{
return a - b;
});
// Descending
arr.sort(function(a,b){
return b - a;
});
arr.sort((a,b)=>{
return b - a;
});
Iterative method forEach
// Traverse every element of the array value: Current element value index: Current element subscript array: Current array No return value It doesn't change the original array
arr.forEach(function(value,index,array){
});
Iterative method every
Once the result is false Just go back to false Otherwise return to true Be similar to &&
// It can be used to judge null value
Iterative method some
Once the result is false Just go back to false Otherwise return to true Be similar to ||
// It can be used to judge whether the element exists
Iterative method map
The return values of all results form a new array It doesn't change the original array
Iterative method filter
Used to filter out the result as false Array elements of The remaining elements form a new array It doesn't change the original array
To find the way indexOf lastIndexOf
indexOf
Find the specified position of the element in the array according to the element value Return position subscript If no element is specified, return -1
Parameters 1 : The element to look for
Parameters 2 : Where to start looking for ---- 1: From the subscript for 1 Start to look back -1: Start from the position of the penultimate element and look back Be careful : There is no implicit type conversion when looking for elements It is === Compare
lastIndexOf
And indexOf The search order is reverse The others are the same
Reduction method reduce reduceRight
reduce
The first parameter Is the function The second parameter is When splicing The character added before the final return value Plus can be understood as Splicing and operation
prev( The return value of the last call , Or initial value )
now( Elements currently being processed in the array )
index ( The index of the current element in the array )
arr ( call reduce Array of )
It can be used to calculate the sum of array elements Element splicing and so on ...
reduceRight
reduceRight And reduce Execute in reverse order The others are the same
Other methods join
arr.join(‘-’); // according to join Parameter to splice array elements // ‘a-b-c-d-e’
Other methods concat
arr.concat([1,2]); // Do array splicing It doesn't change the original array !
arr.concat([1,2],[3,4]); // Multiple array splices are separated by commas
concat There is also an important role : Do deep copy
Other methods slice
arr.slice(0,2);// Extract the array element at the specified position Return a new array It doesn't change the original array
arr.slice(-1);// Extract the penultimate element ‘ as well as ’ All subsequent elements .
Parameters 1: Start extracting subscripts ( The extraction includes the current subscript element )
Parameters 2: End extracted subscript ( Subscript elements that do not include the end position )
Other methods splice
arr.splice(0,2);// Delete the original array element It's going to change the array Returns an array of deleted array elements .
arr.splice(0,0);// insert data Put the second parameter length : Set to 0
Parameters 1: The subscript of the element to be deleted ( Delete including the current subscript element )
Parameters 2: Length to delete
Parameters 3: Add a new array or a single value to the original array after deletion
toString
arr.toString(); // ‘a,b,c,d,e’ Array has null and undefined Will turn into ‘’,
toLocaleString
arr.toLocaleString(); // ‘a,b,c,d,e’ Array has null and undefined Will turn into ‘’,
var a = 1;
a.toLocaleString(‘zh’,{style:‘percent’}) // 100%
var a = 10000000;
a.toLocaleString(); //‘10,000,000’ Add a comma to every three numbers
valueOf
var arr1 = arr.valueOf(); // Returns the array itself Is a shallow copy
边栏推荐
猜你喜欢
[esp32 learning-1] construction of Arduino esp32 development environment
Symbolic representation of functions in deep learning papers
ES6 grammar summary -- Part 2 (advanced part es6~es11)
机器学习--线性回归(sklearn)
物联网系统框架学习
高通&MTK&麒麟 手机平台USB3.0方案对比
程序员老鸟都会搞错的问题 C语言基础 指针和数组
Kaggle competition two Sigma connect: rental listing inquiries (xgboost)
arduino JSON数据信息解析
ESP8266使用arduino连接阿里云物联网
随机推荐
物联网系统框架学习
Detailed explanation of 5g working principle (explanation & illustration)
冒泡排序【C语言】
荣耀Magic 3Pro 充电架构分析
E-commerce data analysis -- User Behavior Analysis
Working principle of genius telephone watch Z3
Who says that PT online schema change does not lock the table, or deadlock
RT-Thread的main线程“卡死”的一种可能原因及解决方案
高通&MTK&麒麟 手機平臺USB3.0方案對比
Bubble sort [C language]
GCC compilation options
js题目:输入数组,最大的与第一个元素交换,最小的与最后一个元素交换,输出数组。
The dolphin scheduler remotely executes shell scripts through the expect command
几个关于指针的声明【C语言】
js 变量作用域和函数的学习笔记
嵌入式启动流程
Inline detailed explanation [C language]
Kconfig Kbuild
优先级反转与死锁
Cannot change version of project facet Dynamic Web Module to 2.3.