Skip to content

λ°°μ—΄

iforget edited this page May 1, 2020 · 1 revision

기초

μ •μ˜ : μˆœμ„œκ°€ μžˆλŠ” 데이터 μ§‘ν•©

  • 0으둜 μ‹œμž‘ν•˜λŠ” μˆ«μžν˜• 인덱슀 μ‚¬μš©
  • λ°°μ—΄μ˜ μš”μ†Œκ°€ 같은 νƒ€μž…μΌ ν•„μš”κ°€ μ—†μŒ
  • 데이터 갯수λ₯Ό λ‚˜νƒ€λ‚΄λŠ” length ν”„λ‘œνΌν‹°
  • [ ]λ‚˜ Array μƒμ„±μžλ‘œ 생성 (Array μƒμ„±μžλ‘œ μ‚¬μš©ν•˜λŠ” 것 μ§€μ–‘)
// λ°°μ—΄ λ¦¬ν„°λŸ΄
const arr1 = [1, 2, 3];
  
const arr2 = new Array(); //λΉˆλ°°μ—΄
const arr3 = new Array(1, 2, 3); //[1, 2, 3]
const arr4 = new Array(2); //길이가 2인 λ°°μ—΄
const arr4 = new Array('2'); //['2']

λ©”μ„œλ“œ

  • λ©”μ„œλ“œ 쀑 μΌλΆ€λŠ” λ°°μ—΄μžμ²΄λ₯Ό μˆ˜μ •, μΌλΆ€λŠ” μƒˆ 배열을 λ°˜ν™˜ν•˜κΈ° λ•Œλ¬Έμ— μ£Όμ˜κ°€ ν•„μš”
ν•˜κ³  싢은 일 λ©”μ„œλ“œ μˆ˜μ • or 사본
λ°°μ—΄ μ•ˆμ—μ„œ μš”μ†Œλ₯Ό ꡐ체할 λ•Œ copyWithin λ°°μ—΄ μˆ˜μ •
λ°°μ—΄ 일뢀가 ν•„μš”ν• λ•Œ slice 사본 λ°˜ν™˜
배열을 λ°˜λŒ€λ‘œ μ •λ ¬ν•  λ•Œ reverse λ°°μ—΄ μˆ˜μ •
배열을 μ •λ ¬ν•  λ•Œ sort λ°°μ—΄ μˆ˜μ •
배열을 μ±„μšΈ λ•Œ fill λ°°μ—΄ μˆ˜μ •
μŠ€νƒμ²˜λŸΌ μ‚¬μš© push(바뀐 길이 λ°˜ν™˜), pop λ°°μ—΄ μˆ˜μ •
μ—¬λŸ¬ μš”μ†Œλ₯Ό λ°°μ—΄ λ§ˆμ§€λ§‰μ— μΆ”κ°€ concat 사본 λ°˜ν™˜
μž„μ˜μ˜ μœ„μΉ˜μ— μš”μ†Œλ₯Ό μΆ”κ°€ν•˜κ±°λ‚˜ 제거 splice λ°°μ—΄ μˆ˜μ •
큐처럼 μ‚¬μš© unshift(), shift λ°°μ—΄ μˆ˜μ •

ES6 New Feature

Array.from(iterable, mapFunction, this)

let str = "0123";
let obj = {number: 1};
 
let arr = Array.from(str, function (value) {
    return parseInt(value) + this.number;
}, obj);
 
console.log(arr); //[ 1, 2, 3, 4 ]

Array.of(values...)

  • μœ ν˜•μ— 상관없이 κ°€λ³€μΈμžλ₯Ό λ°›μ•„ κ·Έ μš”μ†Œλ“€λ‘œ 배열을 λ§Œλ“¬
const arr1 = new Array(2); //길이가 2인 λ°°μ—΄
const arr2 = Array.of(2); //[2]
const arr3 = Array.of(2, 3, 4); //[2, 3, 4]

fill()

const arr = new Array(5);
arr.fill(1); //[ 1, 1, 1, 1, 1 ]
arr.fill('a', 1); //[ 1, 'a', 'a', 'a', 'a' ]
arr.fill('b', 2, 4); //[ 1, 'a', 'b', 'b', 'a' ]

find()

  • λ°°μ—΄μ—μ„œ 쑰건에 λ§žλŠ” μš”μ†Œλ₯Ό μ°Ύμ„λ•Œ μ‚¬μš©
const arr = [
    {id:5, name:'Judith'},
    {id:7, name:'Francis'}
];
 
arr.find(o => o.id ==5); //{ id: 5, name: 'Judith' }
arr.find(o => o.id ==2); //undefined

Clone this wiki locally