Changes between Version 63 and Version 64 of IR2


Ignore:
Timestamp:
05/02/21 16:59:38 (5 years ago)
Author:
siegel
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • IR2

    v63 v64  
    278278<T> $int $seq_length( $seq<T> a ); // length of a
    279279<T> T $seq_get( $seq<T> a, $int i ); // get element i of a
     280<T> $seq<T> $seq_set( $seq<T> a, $int i, T x ); // seq obtained by replacing element i of a with x
    280281<T> $seq<T> $seq_subseq( $seq<T> a, $int start, $int stop ); // subsequence from start to stop-1
    281282<T> $seq<T> $seq_add( $seq<T> a, T e ); // sequence obtained by adding element e to the end of a
     
    283284<T> $seq<T> $seq_remove( $seq<T> a, $int i ); // sequence obtained by removing element at position i from a
    284285<T> $seq<T> $seq_insert( $seq<T> a, $int i, T x ); // sequence obtained by inserting element x at position i in a
     286
    285287}}}
    286288
    287289=== `set.cvh` ===
    288290
    289 * add an element to a set
    290 * test if an element is in a set
    291 * union
    292 * intersection
    293 * difference
    294 
     291{{{
     292<T> $int $set_size( $set<T> s ); // number of elements in s
     293<T> $seq<T> $set_seq( $set<T> s ); // elements of s arranged in a sequence
     294<T> $bool $set_contains( $set<T> s, T x ); // does s contain x as member?
     295<T> $bool $set_containsAll( $set<T> s1, $set<T> s2 ); // is s2 a subset of s1?
     296<T> $set<T> $set_add( $set<T> s, T x ); // result of adding x to s
     297<T> $set<T> $set_union( $set<T> s1, $set<T> s2 ); // union of s1 and s2
     298<T> $set<T> $set_intersection( $set<T> s1, $set<T> s2 ); // intersection of s1 and s2
     299<T> $set<T> $set_difference( $set<T> s1, $set<T> s2 ); // elements of s1 not in s2
     300
     301}}}
    295302
    296303=== `map.cvh` ===
     304
     305{{{
     306
     307}}}
     308
    297309
    298310=== `rel.cvh` ===