We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Set
Map
Array
Hashtbl
Stack
Queue
List
int
int -> 'a
('a -> 'b)
'a list
('a -> 'b -> 'a) -> 'a -> 'b list
('a -> 'b -> 'b) -> 'a list -> 'b
'a array
'a
('a -> 'b -> 'a) -> 'a -> 'b array
('a -> 'b -> 'b) -> 'a array -> 'b
('a, 'b) t
('a -> 'b -> 'c)
('a -> 'b -> 'c -> 'c) -> ('a, 'b) t -> 'c
elt
(elt -> 'a)
t
(elt -> 'a -> 'a) -> t -> 'a
key
(key -> 'a -> 'b)
(key -> 'a -> 'b -> 'b) -> 'a t -> 'b
The text was updated successfully, but these errors were encountered:
No branches or pull requests
결론
Set
,Map
) Imperative는 컨테이너 타입부터 받는다 (Array
,Hashtbl
)Stack
,Queue
는 Persistent랑 비슷하다. 😰List
int
) -> 초기화 함수 (int -> 'a
)('a -> 'b)
->'a list
, fold의 경우 순서에 따라('a -> 'b -> 'a) -> 'a -> 'b list
(left) 또는('a -> 'b -> 'b) -> 'a list -> 'b
(right)Array
'a array
부터 받음int
) -> 초기값'a
('a -> 'b)
->'a array
, fold의 경우 순서에 따라('a -> 'b -> 'a) -> 'a -> 'b array
(left) 또는('a -> 'b -> 'b) -> 'a array -> 'b
(right)Hashtbl
('a, 'b) t
부터 받고 이후'a
를 받음int
)('a -> 'b -> 'c)
, fold는('a -> 'b -> 'c -> 'c) -> ('a, 'b) t -> 'c
Stack
'a
부터Queue
'a
부터Set
elt
부터(elt -> 'a)
->t
, fold는 항상 increasing order로(elt -> 'a -> 'a) -> t -> 'a
Map
key
부터 받고 필요하다면 이후에'a
(key -> 'a -> 'b)
, fold는 항상 increasing order로(key -> 'a -> 'b -> 'b) -> 'a t -> 'b
The text was updated successfully, but these errors were encountered: