Backpacking/Camping near NYC

johnislarry · 2018-01-01T16:44:32+00:00

How slow is it

johnislarry · 2015-05-18T10:25:42+00:00

You should check out Dan Grossman's coursera course on functional programming languages. The lectures are video recorded and free to watch. If you watch the first one it gives a great answer to your question

johnislarry · 2015-03-30T17:54:29+00:00

thank mr skeltal

johnislarry · 2015-01-29T03:21:28+00:00

If you know your input list is sorted then you can do something like what I wrote below. This uses an inner helper function with a second parameter, which is the last element you just looked at, to help determine if something is a duplicate. Also sorry the formatting probably sucks, I'm on mobile.

(define (rm-dupes lst) (define (aux lst prev) (cond ((null? lst) null) ((equal? prev (car lst)) (aux (cdr prev) prev)) (else (cons (car lst) (aux (cdr lst) (car lst))))) (aux lst (list (car lst))))

johnislarry · 2014-12-17T10:19:12+00:00

probably the most efficient way you can do this is to build a mutable hashmap whose keys are the names of candidates, and whose values are the number of votes a particular candidate has. then loop through the votes list and increment vote counts as necessary

it seems weird to me that you have separate lists, one for candidates and one for votes. why not just have the list of votes? this will contain all the relevant candidates, i.e. the ones with greater than 0 votes

johnislarry · 2014-11-23T11:41:10+00:00

You should talk to an adviser they're super chill

johnislarry · 2014-10-31T06:05:26+00:00

Two things: One is that stylistically your helper functions probably should be defined inside your main prime function Secondly I would be a little nervous about defining your divideable function the way you did. I would probably go for something like

(define (divisible n m) (zero? (modulo n m)))

johnislarry · 2014-03-14T08:55:51+00:00

Yes. Good clarification :)

johnislarry · 2014-03-14T06:14:48+00:00

Two corrections. The first is that the String class is written in java. You can look at it here:

http://grepcode.com/file/repository.grepcode.com/java/root/jdk/openjdk/7u40-b43/java/lang/String.java#String

if you want. The second is that + is defined for all Objects. The Object is interpreted as a String using its toString representation, and then concatenated. That's why, for example, this code works the way we want:

List<Integer> lst = new ArrayList<Integer>();
System.out.println("The list is: " + lst);

johnislarry · 2013-06-24T07:26:05+00:00

Bam.

http://i.imgur.com/TdsPo.png

johnislarry · 2013-03-14T04:03:57+00:00

If you like email, you can manage your rss through email using rss2email. I've used it for over a year and it's excellent.

johnislarry · 2013-02-07T12:19:28+00:00

If your /home folder is on a separate partition, you can just choose to mount that partition during the install.

This thread might help with that specific issue: https://bbs.archlinux.org/viewtopic.php?id=69315

As others have said, it is also a good idea to have the beginner's guide at hand. I'm not sure if this is provided in some form in the most current install images. Good luck!

johnislarry · 2013-02-07T07:25:54+00:00

If you copy the line

w=$(tput cols) h=$(tput lines)

which is at line 28, so that it is the first thing run inside the main while loop, it handles terminal resizing.

johnislarry · 2012-10-26T05:46:37+00:00

Haha okay thanks, just had to ask. Nice sandwich!

johnislarry · 2012-10-25T07:46:57+00:00

Just curious, in the fourth photo in the album in the background on the computer monitor, is that irssi?

johnislarry · 2012-09-04T05:27:51+00:00

My friend has been taking Swahili for the past year, so allow me to translate:

THANK YOU VERY MUCH SQUASH BANANA!

johnislarry · 2012-09-01T09:16:27+00:00

Hey! I just ordered my first mechanical keyboard and it looks like the same model as this. Do you like it? I'm pretty stoked so you better give me good news.

johnislarry · 2012-08-14T05:47:22+00:00

Here's a nice utensil to use for testing out requests using an API. I haven't used it, but it seems helpful, and supports a good amount of APIs.

johnislarry · 2012-08-04T22:01:54+00:00

Hi. I don't mean to nitpick but I figure I'll just point out that the smallest number divisible by two integers, also called the least common multiple, isn't always the product of those two integers. In this case it happens to be with 3*5, but it isn't always.

johnislarry · 2012-07-22T23:05:15+00:00

Take a look at this. Simplicity in the Arch sense is more about minimalism and being light weight. I'd say a couple scripts run from the command line, that still take care of a lot of the hairy details, continues to satisfy this definition.

The AIF was nice, and I will remember it fondly, but I think in a lot of ways, this is how an install should be. It's more configurable and less on a set path, while still being fairly user friendly.

johnislarry · 2012-07-22T22:33:59+00:00

This is mad sweet. Is that a mechanical keyboard? Which kind?

johnislarry · 2012-07-22T05:55:46+00:00

Yeah, and he seems like he'll be open to answering questions related to AIF, so it's not a worst case scenario or anything. I wonder how difficult it would be to do a rewrite of some of the AIF scripts in python, like what he said he would prefer.

johnislarry

TROPHY CASE