<?xml version="1.0" encoding="utf-8"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title>Disqus - Latest Comments for alandipert</title><link>http://disqus.com/by/alandipert/</link><description></description><atom:link href="http://disqus.com/alandipert/comments.rss" rel="self"></atom:link><language>en</language><lastBuildDate>Tue, 10 Jan 2023 22:48:58 -0000</lastBuildDate><item><title>Re: Clojure, explained by Donald Trump</title><link>https://basket-blog.netlify.app/trump-and-clojure#comment-6087126800</link><description>&lt;p&gt;I'm glad you found my blog post hilarious! But let me tell you, I don't need to ramble or switch subjects to make my point. I am the best at getting straight to the point, and nobody does it better than me. Believe me. I have the best words and ideas, and my supporters know that. I am a winner, and my blog post is a winner too. Sad!&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Tue, 10 Jan 2023 22:48:58 -0000</pubDate></item><item><title>Re: Lispology - Finding repetitions in a list</title><link>http://www.lispology.com/show?2QIM#comment-4589057710</link><description>&lt;p&gt;Another great post, thank you. It occurred to me that a max heap &lt;br&gt;might be the ideal data structure to maintain as you traverse the list.&lt;/p&gt;&lt;p&gt;An optimization idea for very large inputs that came to mind: If the length &lt;br&gt;of the input is known (and is expected to be very long, but the set of &lt;br&gt;items small), the heap could periodically be pruned of entries that &lt;br&gt;couldn't possibly occur the most, given the size of the list that &lt;br&gt;remains.&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Fri, 23 Aug 2019 11:49:42 -0000</pubDate></item><item><title>Re: Lispology - Flexibility in Lisp</title><link>http://www.lispology.com/show?1CRH#comment-3866375131</link><description>&lt;p&gt;I'll throw in a couple:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;pre&gt;&lt;code&gt;&lt;br&gt;(loop for i in '(1 2 3 4 5 6 7 8 9) sum i)&lt;br&gt;&lt;/code&gt;&lt;/pre&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;pre&gt;&lt;code&gt;&lt;br&gt;(do ((nums '(1 2 3 4 5 6 7 8 9) (cdr nums))&lt;br&gt;     (sum 0 (+ sum (car nums))))&lt;br&gt;    ((not nums) sum))&lt;br&gt;&lt;/code&gt;&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Sun, 22 Apr 2018 00:50:20 -0000</pubDate></item><item><title>Re: Lispology - Shortest sort</title><link>http://www.lispology.com/show?25GT#comment-3864871769</link><description>&lt;p&gt;Fun challenge! Here's mine:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;pre&gt;&lt;code&gt;&lt;br&gt;(defun mysort (xs)&lt;br&gt;  (loop while xs&lt;br&gt;        for x = (reduce #'min xs)&lt;br&gt;        do (setq xs (remove x xs :count 1))&lt;br&gt;        collect x))&lt;br&gt;&lt;/code&gt;&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Fri, 20 Apr 2018 18:51:26 -0000</pubDate></item><item><title>Re: My first time using boot over leiningen - Adam Bard and his magical blog</title><link>https://adambard.com/blog/i-finally-get-boot/#comment-2064340876</link><description>&lt;p&gt;Awesome post, I'm glad you enjoy boot!  Any suggestions you might have on how to improve the website would be more than welcome, please don't hesitate to create issues on &lt;a href="https://github.com/boot-clj/boot-clj.github.io" rel="nofollow noopener" target="_blank" title="https://github.com/boot-clj/boot-clj.github.io"&gt;https://github.com/boot-clj...&lt;/a&gt;&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Fri, 05 Jun 2015 18:16:46 -0000</pubDate></item><item><title>Re: Faster Clojure Startup with Class Data Sharing - alan dipert</title><link>http://alandipert.tumblr.com/post/55324450821#comment-1858467656</link><description>&lt;p&gt;Thanks for the explanation - I updated the post.&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Mon, 16 Feb 2015 13:36:28 -0000</pubDate></item><item><title>Re: Faster Clojure Startup with Class Data Sharing - alan dipert</title><link>http://alandipert.tumblr.com/post/55324450821#comment-960795244</link><description>&lt;p&gt;I don't have a Mac around to test on, but you should be able to run the JVM in client mode by adding the -client flag to your java command.&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Sat, 13 Jul 2013 07:53:26 -0000</pubDate></item><item><title>Re: FizzBuzz in Scala and Clojure</title><link>http://alan.dipert.org/post/172774481#comment-913862833</link><description>&lt;p&gt;No problemo.  I updated the Clojure link and example to use the current version of match (core.match); you may wish to update your gist.&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Thu, 30 May 2013 11:05:42 -0000</pubDate></item><item><title>Re: Structural Editing Revisited - alan dipert</title><link>http://alan.dipert.org/post/47444634908#comment-859353159</link><description>&lt;p&gt;Thanks!&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Thu, 11 Apr 2013 01:18:05 -0000</pubDate></item><item><title>Re: Structural Editing Revisited - alan dipert</title><link>http://alan.dipert.org/post/47444634908#comment-859352403</link><description>&lt;p&gt;That looks awesome!&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Thu, 11 Apr 2013 01:17:01 -0000</pubDate></item><item><title>Re: A bad year, a good year. A little retrospective. - alan dipert</title><link>http://alan.dipert.org/post/44050917245#comment-813725103</link><description>&lt;p&gt;Thanks Julio, I'm looking forward to talking about them!&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Tue, 26 Feb 2013 23:28:35 -0000</pubDate></item><item><title>Re: A bad year, a good year. A little retrospective. - alan dipert</title><link>http://alan.dipert.org/post/44050917245#comment-813006611</link><description>&lt;p&gt;Thanks Justin!&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Tue, 26 Feb 2013 10:51:07 -0000</pubDate></item><item><title>Re: Discover Lisp in Your Web Browser with Javascript</title><link>http://alan.dipert.org/post/7193534410#comment-527653963</link><description>&lt;p&gt;Thanks, I think you're right.&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Sun, 13 May 2012 01:47:43 -0000</pubDate></item><item><title>Re: Clojure/core — All Conj 2011 Videos Available</title><link>http://clojure.com/blog/2012/02/20/all-conj-2011-videos-available.html#comment-452114535</link><description>&lt;p&gt;See this comment for how to download videos: &lt;a href="http://news.ycombinator.com/item?id=3614241" rel="nofollow noopener" target="_blank" title="http://news.ycombinator.com/item?id=3614241"&gt;http://news.ycombinator.com...&lt;/a&gt;&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Wed, 29 Feb 2012 04:13:21 -0000</pubDate></item><item><title>Re: The S-expression Editor</title><link>http://alan.dipert.org/post/445462664#comment-414025104</link><description>&lt;p&gt;Freakin' sweet.  Recently I ran into Nokolisp, a Lisp implementation with its own built-in structural editor: &lt;a href="http://www.youtube.com/watch?v=HB6HvhOw_MY" rel="nofollow noopener" target="_blank" title="http://www.youtube.com/watch?v=HB6HvhOw_MY"&gt;http://www.youtube.com/watc...&lt;/a&gt;&lt;/p&gt;&lt;p&gt;If and when you find that Interlisp, let us know!  Thanks for stopping by.&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Tue, 17 Jan 2012 23:26:58 -0000</pubDate></item><item><title>Re: Kit-A-Day Giveaway: MakerBot Thing-O-Matic (#2 of 5)</title><link>http://blog.makezine.com/archive/2011/12/kit-a-giveaway-makerbot-thing-o-matic-2-of-5.html#comment-380004437</link><description>&lt;p&gt;I want a thing-o-matic.  I think they are awesome!&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Mon, 05 Dec 2011 21:08:39 -0000</pubDate></item><item><title>Re: :jasonrudolph =&gt; :blog &gt;&gt; Programming Achievements: How to Level Up as a Developer</title><link>http://jasonrudolph.com/blog/2011/08/09/programming-achievements-how-to-level-up-as-a-developer/#comment-281472936</link><description>&lt;p&gt;Bryan? &lt;a href="http://cryptnet.net/mirrors/texts/kissedagirl.html" rel="nofollow noopener" target="_blank" title="http://cryptnet.net/mirrors/texts/kissedagirl.html"&gt;http://cryptnet.net/mirrors...&lt;/a&gt;&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Tue, 09 Aug 2011 16:08:15 -0000</pubDate></item><item><title>Re: Syntax Highlight Bookmarklet</title><link>http://alan.dipert.org/post/54752905#comment-186218929</link><description>&lt;p&gt;Hi Taylor, thanks for dropping by.  The server it used to be on went away, and the machine I had it on broke, and I can't find it in any of my backups :(&lt;/p&gt;&lt;p&gt;It worked by loading SHJS similar to the way it's done here: &lt;a href="http://www.ejeliot.com/blog/109" rel="nofollow noopener" target="_blank" title="http://www.ejeliot.com/blog/109"&gt;http://www.ejeliot.com/blog...&lt;/a&gt;&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Sun, 17 Apr 2011 12:49:41 -0000</pubDate></item><item><title>Re: NCSA Mosaic on Github</title><link>http://alan.dipert.org/post/435071716#comment-38605344</link><description>&lt;p&gt;Nice!&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Mon, 08 Mar 2010 17:46:42 -0000</pubDate></item><item><title>Re: Polyglot Folding (Ruby, Clojure, Scala)</title><link>http://alan.dipert.org/post/307586762#comment-27679454</link><description>&lt;p&gt;Thanks, that's really good to know.&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Thu, 31 Dec 2009 15:46:13 -0000</pubDate></item><item><title>Re: Polyglot Folding (Ruby, Clojure, Scala)</title><link>http://alan.dipert.org/post/307586762#comment-27678688</link><description>&lt;p&gt;Awesome!  Seems faster too:&lt;/p&gt;&lt;p&gt;➔ time ruby -e '1000000.times { [1,2,3].inject([]){ | xs, y | xs &amp;lt;&amp;lt; (xs.last || 0) + y }}'&lt;br&gt;5.87s user 0.04s system 99% cpu 5.935 total&lt;br&gt;➔ time ruby -e '1000000.times { [1,2,3].inject([0]){|xs,y| xs.unshift(xs.first + y) }.reverse.slice(1..-1)}'&lt;br&gt;7.35s user 0.04s system 99% cpu 7.430 total&lt;/p&gt;&lt;p&gt;Perhaps Array.first and .last have the same complexity and the difference is then the redundant slice and reverse calls?&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Thu, 31 Dec 2009 15:30:14 -0000</pubDate></item><item><title>Re: Polyglot Folding (Ruby, Clojure, Scala)</title><link>http://alan.dipert.org/post/307586762#comment-27675511</link><description>&lt;p&gt;Thanks! I will.&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Thu, 31 Dec 2009 14:32:00 -0000</pubDate></item><item><title>Re: alan dipert - The Silent Helicopter</title><link>http://alan.dipert.org/post/56643153#comment-16283323</link><description>&lt;p&gt;I think it's possible.  I have a friend who says he saw one land near his camp in the Mojave on a dirtbiking trip.  Him telling me the story is what prompted me to post this.&lt;/p&gt;&lt;p&gt;If they exist, they're probably part of a top, top secret government research project.  As far as I know, they don't have a name.&lt;/p&gt;&lt;p&gt;Anyways, thanks for stopping by!&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Wed, 09 Sep 2009 21:31:14 -0000</pubDate></item><item><title>Re: My EngineYard Contest Odyssey</title><link>http://alan.dipert.org/post/146555473#comment-13132104</link><description>&lt;p&gt;Actually, those were the only words I used.  EngineYard provided an RTF file of 1000 words when they began the contest.  I just converted this list to plaintext, renamed it to words.txt, and put it in the repo.&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Wed, 22 Jul 2009 17:27:38 -0000</pubDate></item><item><title>Re: My EngineYard Contest Odyssey</title><link>http://alan.dipert.org/post/146555473#comment-13126373</link><description>&lt;p&gt;Thank you&lt;/p&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alandipert</dc:creator><pubDate>Wed, 22 Jul 2009 15:20:40 -0000</pubDate></item></channel></rss>