/**

* 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));

}

}