vector
Factor handbook » The language » Collections » Vectors

Next:

vector? ( object -- ? )

Vocabulary
vectors

Class description
The class of resizable vectors. See Vector syntax for syntax and Vectors for general information.

Definition

USING: arrays sequences.private ;

IN: vectors

TUPLE: vector
    { underlying array initial: { } }
    { length array-capacity initial: 0 } ;

Methods

USING: assocs kernel stack-checker.visitor vectors ;

M: vector #>r, [ [ f f ] dip ] [ swap zip ] 2bi #shuffle, ;


USING: compiler.tree kernel stack-checker.visitor vectors ;

M: vector #alien-assembly, #alien-assembly boa node, ;


USING: compiler.tree kernel stack-checker.visitor vectors ;

M: vector #alien-callback, #alien-callback boa node, ;


USING: compiler.tree kernel stack-checker.visitor vectors ;

M: vector #alien-indirect, #alien-indirect boa node, ;


USING: compiler.tree kernel stack-checker.visitor vectors ;

M: vector #alien-invoke, #alien-invoke boa node, ;


USING: compiler.tree stack-checker.visitor vectors ;

M: vector #call, <#call> node, ;


USING: compiler.tree stack-checker.visitor vectors ;

M: vector #call-recursive, <#call-recursive> node, ;


USING: compiler.tree stack-checker.visitor vectors ;

M: vector #copy, <#copy> node, ;


USING: compiler.tree stack-checker.visitor vectors ;

M: vector #declare, <#declare> node, ;


USING: compiler.tree stack-checker.visitor vectors ;

M: vector #dispatch, <#dispatch> node, ;


USING: compiler.tree stack-checker.visitor vectors ;

M: vector #drop, <#drop> node, ;


USING: compiler.tree stack-checker.visitor vectors ;

M: vector #enter-recursive, <#enter-recursive> node, ;


USING: compiler.tree stack-checker.visitor vectors ;

M: vector #if, <#if> node, ;


USING: compiler.tree stack-checker.visitor vectors ;

M: vector #introduce, <#introduce> node, ;


USING: compiler.tree stack-checker.visitor vectors ;

M: vector #phi, <#phi> node, ;


USING: compiler.tree stack-checker.visitor vectors ;

M: vector #push, <#push> node, ;


USING: assocs kernel stack-checker.visitor vectors ;

M: vector #r>,
    [ swap [ f swap ] dip f ] [ swap zip ] 2bi #shuffle, ;


USING: compiler.tree stack-checker.visitor vectors ;

M: vector #recursive, <#recursive> node, ;


USING: compiler.tree stack-checker.visitor vectors ;

M: vector #return, <#return> node, ;


USING: compiler.tree stack-checker.visitor vectors ;

M: vector #return-recursive, <#return-recursive> node, ;


USING: compiler.tree stack-checker.visitor vectors ;

M: vector #shuffle, <#shuffle> node, ;


USING: compiler.tree kernel stack-checker.visitor vectors ;

M: vector #terminate, #terminate boa node, ;


USING: prettyprint.custom vectors ;

M: vector >pprint-sequence ;


USING: python sequences vectors ;

M: vector >py [ >py ] map vector>py-list ;


USING: kernel stack-checker.visitor vectors ;

M: vector child-visitor V{ } clone ;


USING: kernel sequences vectors ;

M: vector equal? over vector? [ sequence= ] [ 2drop f ] if ;


USING: math.order sorting.quick vectors ;

M: vector inv-sort! [ <=> ] inv-sort-with! ;


USING: arrays kernel sequences vectors ;

M: vector like
    drop dup vector?
    [ dup array? [ dup length vector boa ] [ >vector ] if ]
    unless ; inline


USING: binary-search kernel math.order vectors ;

M: vector natural-search [ <=> ] with search ;


USING: arrays kernel math sequences vectors ;

M: vector new-sequence
    drop [ f <array> ] [ integer>fixnum ] bi vector boa ; inline


USING: math.combinatorics.private vectors ;

M: vector nths-unsafe (nths-unsafe) ;


USING: prettyprint.custom vectors ;

M: vector pprint* pprint-object ;


USING: kernel prettyprint.custom vectors ;

M: vector pprint-delims drop \ V{ \ } ;


USING: kernel prettyprint.custom vectors ;

M: vector pprint-narrow? drop t ;


USING: math.order sorting.quick vectors ;

M: vector sort! [ <=> ] sort-with! ;