On Wed, Jun 28, 2017 at 3:33 AM, wrote:
> Thanks guys the tips made me have the idea that I can just write the check
> for the second list instead of '(true).
>
> Here is my solution:
>
> #lang racket
>
>
> (define (test1 word book book2)
>
> (cond ((null? book) '(false))
>
> ((
No apology needed. The pop-up menu is a great feature. Thank you very much.
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to racket-users+unsubscr...@googlegroup
Apologies.
> On Jun 28, 2017, at 8:59 PM, Glenn Hoetker wrote:
>
> Thanks for the quick comment. Unless I'm missing something (quite
> possible...nay, likely), the triangle in the upper left launches a File Open
> dialog at the requested location. That's cool and useful, but a bit
> differ
Thanks for the quick comment. Unless I'm missing something (quite
possible...nay, likely), the triangle in the upper left launches a File Open
dialog at the requested location. That's cool and useful, but a bit different.
The use case I had in mind was wanting access to the folder *in the Finder
It might also be a good move to read this:
http://www.catb.org/esr/faqs/smart-questions.html#intro
On Wed, Jun 28, 2017 at 12:21 PM, Glenn Hoetker wrote:
> If order doesn't matter and it would be okay for duplicates *within* a
> list to be deleted, you might make use of
>
> * Lists can be conver
Did you try the down triangle next to the name of the file in the top-left
corner?
> On Jun 28, 2017, at 5:42 PM, Glenn Hoetker wrote:
>
> I hope this isn't painfully obvious to everyone but me, but I'd found it
> really frustrating until I found a solution. So, I thought I'd share. (If
>
I hope this isn't painfully obvious to everyone but me, but I'd found it really
frustrating until I found a solution. So, I thought I'd share. (If that's not
appropriate traffic for the mailing list, I'd appreciate a more veteran hand
letting me know. I'm still observing the norms.)
Issue: Whil
If order doesn't matter and it would be okay for duplicates *within* a list to
be deleted, you might make use of
* Lists can be converted to sets, via list->set and back again
* There are many set methods to yield unions, intersections and differences
between sets. See https://docs.racket-lang.o
Consider using the following function
https://docs.racket-lang.org/reference/pairs.html?q=memq#%28def._%28%28lib._racket%2Fprivate%2Fbase..rkt%29._memq%29%29
It's helpful to sketch out the general steps you'd need to be able to carry out
the procedure to solve the problem.
My quick sketch would
To me a binary tree can be defined like this.
;; A BinaryTree is either
;; - false OR
;; - (BinaryTree Anything BinaryTree BinaryTree)
I built a data structure which looked like a tree, but I think it's
different. What should this be called? I called it a blob since I didn't
know what it wa
Hello, how can I search diffrences in two lists.
Lets say (diffrences list1 list2)
(diffrences '(1 5 4 2) '(3 5 2 7 9)
would give back (1 4) since they are the elements of list1 which
arent found in list2
I just have no idea how to make this.
Thanks guys the tips made me have the idea that I can just write the check for
the second list instead of '(true).
Here is my solution:
#lang racket
(define (test1 word book book2)
(cond ((null? book) '(false))
((equal? word (first book)) (cond ((null? book2) '(false))
12 matches
Mail list logo
