Posted
by incrediman
on Stack Overflow
See other posts from Stack Overflow
or by incrediman
Published on 2010-06-01T17:41:53Z
Indexed on
2010/06/01
17:43 UTC
Read the original article
Hit count: 287
How can I use arrays in scheme?
In particular, I'm attempting to implement a recursive fibonacci procedure using memoization. Do arrays even exist in scheme?
If not, how can I implement memoization?
© Stack Overflow or respective owner
as seen on Stack Overflow
- Search for 'Stack Overflow'
The following is 2 different definitions of the problem:
How can I process 2 arrays so that I can keep the data of duplicate array[key] values.
I have arrays A and B.
I want to create array C with the children that their id/key values exist in both A and B arrays.
Thank you
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
input
23 3 4 4 42 n 23 0 9 9 n n n 3 9 9 x
//according to input,i should create int pointer arrays. pointer arrays
// starting from 1 (that is initial arrays is arrays[1].when program sees n ,it
// must be jumb to arrays 2
// the first int input 23 is num_arrays which used…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
input
23 3 4 4 42 n 23 0 9 9 n n n 3 9 9 x
//according to input,i should create int pointer arrays. pointer arrays
// starting from 1 (that is initial arrays is arrays[1].when program sees n ,it
// must be jumb to arrays 2
// the first int input 23 is num_arrays which…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
input
23 3 4 4 42 n 23 0 9 9 n n n 3 9 9 x
//according to input,i should create int pointer arrays. pointer arrays
// starting from 1 (that is initial arrays is arrays[1].when program sees n ,it
// must be jumb to arrays 2
// the first int input 23 is num_arrays which used…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm going through a Fortran code, and one bit has me a little puzzled.
There is a subroutine, say
SUBROUTINE SSUB(X,...)
REAL*8 X(0:N1,1:N2,0:N3-1),...
...
RETURN
END
Which is called in another subroutine by:
CALL SSUB(W(0,1,0,1),...)
where W is a 'working array'. It appears that a specific…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I had a pretty simple requirement in my Scheme program to execute more
than one statement, in the true condition of a 'if'. . So I write my
code, something like this:
(if (= 1 1)
((expression1) (expression2)) ; these 2 expressions are to be
executed when the condition is true
(expression3)…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
(define (read-all-input)
(local ((define line (bytes->list (read-bytes 4))))
(if (eof-object? line)
empty
(cons line (read-all-input)))))
(void (read-all-input))
The above code fails because bytes-list expects an argument of type byte string, but is given #
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Does R6RS or Chez Scheme v7.9.4 have a library function to check if a list contains duplicate elements?
Alternatively, do either have any built in functionality for sets (which dis-allow duplicate elements)? So far, I've only been able to find an example here.
The problem with that is that it doesn't…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Isn't it possible to treat functions in Scheme as any other list?
Basically, what I want do to is something like this:
(define (foo) "hello")
(cdr foo) ; or similar, should return the list ((foo) "hello")
I've found a similar discussion about this, and I feel a bit disappointed if this is not…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi,
I'm a beginning student in CS, and my classes are mostly in Java. I'm currently going through "Little Schemer" as a self study, and in the process of finding out how to do that I have found numerous references to "implementations" of Scheme. My question is, what are implementations?
Are they…
>>> More
