Code: Select all
(collect (n (sequence 1 10))
    (* n 2))
; => (2 4 6 8 10 12 14 16 18 20)
Code: Select all
(collect (n (sequence 1 10))
    (* n 2))
; => (2 4 6 8 10 12 14 16 18 20)
Code: Select all
(map (fn (n) (* n 2)) (sequence 1 10))
;-> (2 4 6 8 10 12 14 16 18 20)
Code: Select all
(map << (sequence 1 10))Code: Select all
int main
{
    int seq[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
    int result[10];
    int i;
    for (i = 0; i < 10; i++)
    {
        result[i] = seq[i] * 2;
    }
    return 0;
}I think I see what you mean!Jeff wrote:Code: Select all
int main { int seq[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; int result[10]; int i; for (i = 0; i < 10; i++) { result[i] = seq[i] * 2; } return 0; }
Code: Select all
> (rest (filter (lambda (x) (= (% x 2)0)) (sort (unique (rand 21 210)))))
(2 4 6 8 10 12 14 16 18 20)Code: Select all
> (map eval (transpose (append (transpose (dup (list (sym (char 42)) 2) 10)) (list (rest (index string? (explode "C++  sucks!")))))))
(2 4 6 8 10 12 14 16 18 20)Code: Select all
void double_list_elements(int seq[], int seq_length, int result[])
{
    int i;
    for (i = 0; i < seq_length; i++)
    {
        result[i] = seq[i] * 2;
    }
}Code: Select all
(import "double_elements.so "double_list_elements")
(set 'seq (sequence 1 10))
(set 'set2 '(array 10 (sequence 1 10))
(double_list_elements seq (length seq) seq2))