FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
clojure/src/jvm/clojure/lang/LazilyPersistentVector.java at master · clojure/clojure · GitHub
clojure
/
clojure
Public
Notifications
You must be signed in to change notification settings
Fork
1.5k
Star
11k
Code
Actions
Projects
Security and quality
1
Insights
Additional navigation options
Code
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
clojure
/
src
/
jvm
/
clojure
/
lang
/
LazilyPersistentVector.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
51 lines (42 loc) · 1.57 KB
Breadcrumbs
clojure
/
src
/
jvm
/
clojure
/
lang
/
LazilyPersistentVector.java
Copy path
File metadata and controls
51 lines (42 loc) · 1.57 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
/**
* Copyright (c) Rich Hickey. All rights reserved.
* The use and distribution terms for this software are covered by the
* Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
* which can be found in the file epl-v10.html at the root of this distribution.
* By using this software in any fashion, you are agreeing to be bound by
* the terms of this license.
* You must not remove this notice, or any other, from this software.
**/
/* rich May 14, 2008 */
package
clojure
.
lang
;
import
java
.
util
.
Collection
;
import
java
.
util
.
RandomAccess
;
public
class
LazilyPersistentVector
{
static
public
IPersistentVector
createOwning
(
Object
...
items
){
// if(items.length <= Tuple.MAX_SIZE)
// return Tuple.createFromArray(items);
// else
if
(
items
.
length
<=
32
)
return
new
PersistentVector
(
items
.
length
,
5
,
PersistentVector
.
EMPTY_NODE
,
items
);
return
PersistentVector
.
create
(
items
);
}
static
int
fcount
(
Object
c
){
if
(
c
instanceof
Counted
)
return
((
Counted
)
c
).
count
();
return
((
Collection
)
c
).
size
();
}
static
public
IPersistentVector
create
(
Object
obj
){
// if((obj instanceof Counted || obj instanceof RandomAccess)
// && fcount(obj) <= Tuple.MAX_SIZE)
// return Tuple.createFromColl(obj);
// else
if
(
obj
instanceof
IReduceInit
)
return
PersistentVector
.
create
((
IReduceInit
)
obj
);
else
if
(
obj
instanceof
ISeq
)
return
PersistentVector
.
create
(
RT
.
seq
(
obj
));
else
if
(
obj
instanceof
Iterable
)
return
PersistentVector
.
create
((
Iterable
)
obj
);
else
return
createOwning
(
RT
.
toArray
(
obj
));
}
}
Back
|
FazBrowse Home
|
New Git URL