FilesExpand file tree

 useCheckCache

/

esnext.array.d.ts

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

203 lines (175 loc) · 6.89 KB

 useCheckCache

/

esnext.array.d.ts

Copy path

Top

File metadata and controls

• Code
• Blame

203 lines (175 loc) · 6.89 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

interface ReadonlyArray<T> {

/**

* Calls a defined callback function on each element of an array. Then, flattens the result into

* a new array.

* This is identical to a map followed by a flatten of depth 1.

*

* @param callback A function that accepts up to three arguments. The flatMap method calls the

* callback function one time for each element in the array.

* @param thisArg An object to which the this keyword can refer in the callback function. If

* thisArg is omitted, undefined is used as the this value.

*/

flatMap<U, This = undefined> (

callback: (this: This, value: T, index: number, array: T[]) => U|U[],

thisArg?: This

): U[]

/**

* Returns a new array with all sub-array elements concatenated into it recursively up to the

* specified depth.

*

* @param depth The maximum recursion depth

*/

flatten<U>(this:

ReadonlyArray<U[][][][]> |

ReadonlyArray<ReadonlyArray<U[][][]>> |

ReadonlyArray<ReadonlyArray<U[][]>[]> |

ReadonlyArray<ReadonlyArray<U[]>[][]> |

ReadonlyArray<ReadonlyArray<U>[][][]> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<U[][]>>> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<U>[][]>> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>[][]> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<U>[]>[]> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<U[]>>[]> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<U[]>[]>> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U[]>>>> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U>[]>>> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>[]>> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>>[]> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>>>>,

depth: 4): U[];

/**

* Returns a new array with all sub-array elements concatenated into it recursively up to the

* specified depth.

*

* @param depth The maximum recursion depth

*/

flatten<U>(this:

ReadonlyArray<U[][][]> |

ReadonlyArray<ReadonlyArray<U>[][]> |

ReadonlyArray<ReadonlyArray<U[]>[]> |

ReadonlyArray<ReadonlyArray<U[][]>> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<U[]>>> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<U>[]>> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>[]> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>>>,

depth: 3): U[];

/**

* Returns a new array with all sub-array elements concatenated into it recursively up to the

* specified depth.

*

* @param depth The maximum recursion depth

*/

flatten<U>(this:

ReadonlyArray<U[][]> |

ReadonlyArray<ReadonlyArray<U[]>> |

ReadonlyArray<ReadonlyArray<U>[]> |

ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>>,

depth: 2): U[];

/**

* Returns a new array with all sub-array elements concatenated into it recursively up to the

* specified depth.

*

* @param depth The maximum recursion depth

*/

flatten<U>(this:

ReadonlyArray<U[]> |

ReadonlyArray<ReadonlyArray<U>>,

depth?: 1

): U[];

/**

* Returns a new array with all sub-array elements concatenated into it recursively up to the

* specified depth.

*

* @param depth The maximum recursion depth

*/

flatten<U>(this:

ReadonlyArray<U>,

depth: 0

): U[];

/**

* Returns a new array with all sub-array elements concatenated into it recursively up to the

* specified depth. If no depth is provided, flatten method defaults to the depth of 1.

*

* @param depth The maximum recursion depth

*/

flatten<U>(depth?: number): any[];

}

interface Array<T> {

/**

* Calls a defined callback function on each element of an array. Then, flattens the result into

* a new array.

* This is identical to a map followed by a flatten of depth 1.

*

* @param callback A function that accepts up to three arguments. The flatMap method calls the

* callback function one time for each element in the array.

* @param thisArg An object to which the this keyword can refer in the callback function. If

* thisArg is omitted, undefined is used as the this value.

*/

flatMap<U, This = undefined> (

callback: (this: This, value: T, index: number, array: T[]) => U|U[],

thisArg?: This

): U[]

/**

* Returns a new array with all sub-array elements concatenated into it recursively up to the

* specified depth.

*

* @param depth The maximum recursion depth

*/

flatten<U>(this: U[][][][][][][][], depth: 7): U[];

/**

* Returns a new array with all sub-array elements concatenated into it recursively up to the

* specified depth.

*

* @param depth The maximum recursion depth

*/

flatten<U>(this: U[][][][][][][], depth: 6): U[];

/**

* Returns a new array with all sub-array elements concatenated into it recursively up to the

* specified depth.

*

* @param depth The maximum recursion depth

*/

flatten<U>(this: U[][][][][][], depth: 5): U[];

/**

* Returns a new array with all sub-array elements concatenated into it recursively up to the

* specified depth.

*

* @param depth The maximum recursion depth

*/

flatten<U>(this: U[][][][][], depth: 4): U[];

/**

* Returns a new array with all sub-array elements concatenated into it recursively up to the

* specified depth.

*

* @param depth The maximum recursion depth

*/

flatten<U>(this: U[][][][], depth: 3): U[];

/**

* Returns a new array with all sub-array elements concatenated into it recursively up to the

* specified depth.

*

* @param depth The maximum recursion depth

*/

flatten<U>(this: U[][][], depth: 2): U[];

/**

* Returns a new array with all sub-array elements concatenated into it recursively up to the

* specified depth.

*

* @param depth The maximum recursion depth

*/

flatten<U>(this: U[][], depth?: 1): U[];

/**

* Returns a new array with all sub-array elements concatenated into it recursively up to the

* specified depth.

*

* @param depth The maximum recursion depth

*/

flatten<U>(this: U[], depth: 0): U[];

/**

* Returns a new array with all sub-array elements concatenated into it recursively up to the

* specified depth. If no depth is provided, flatten method defaults to the depth of 1.

*

* @param depth The maximum recursion depth

*/

flatten<U>(depth?: number): any[];

}