tag:blogger.com,1999:blog-12304607330590939712012-02-16T00:38:12.766-08:00A web log about stuff I've worked on. Mostly about programming in Haskell and things I've discovered along the way.dufflebunkhttp://www.blogger.com/profile/16745901322657722222noreply@blogger.comBlogger81100tag:blogger.com,1999:blog-1230460733059093971.post-28863918702818131522010-02-15T17:35:00.000-08:002010-02-15T17:47:19.156-08:00

At work I deal with geospatial data a lot. One of the formats I often work with lot is called RMX. It's a text based format for describing geometry and attribution on geometry. If I want to do any complicated work with RMX using Haskell I need to parse it in Haskell. I've chosen to use Parsec as the parser to learn a bit more about using parser combinators, and I've chosen to parse RMX because it

dufflebunkhttp://www.blogger.com/profile/16745901322657722222noreply@blogger.com0tag:blogger.com,1999:blog-1230460733059093971.post-59159696460630025722009-08-08T16:04:00.000-07:002009-08-08T23:10:43.293-07:00

Getting GHC 6.10.4 working on RHEL4 is a bit of a task. Certainly RH provides no RPM for such an old version of their OS and the Linux binary provided by the GHC team doesn't work on such an old libc. So I had to build it. Unfortunately, trying to build it from scratch (boot strapping) resulted in an error that I needed a newer version of gnu make. It needs gmake 3.81, and RH4 has gmake 3.80.

dufflebunkhttp://www.blogger.com/profile/16745901322657722222noreply@blogger.com0tag:blogger.com,1999:blog-1230460733059093971.post-26349426842130220722009-06-28T15:31:00.000-07:002009-06-28T16:17:09.381-07:00

Continuing from the previous post, I added table inserts. In addition, I started adding some decorators to help avoid repeating code. Since there was some refactoring, many functions changed a lot.Here's the top chunk:(ns db-edit (:require [clojure.contrib.sql :as sql]) (:use clojure.contrib.json.write) (:use compojure)); Information about the SQLite database(def db-params {:classname "

dufflebunkhttp://www.blogger.com/profile/16745901322657722222noreply@blogger.com0tag:blogger.com,1999:blog-1230460733059093971.post-75270275544296735502009-06-22T21:39:00.000-07:002009-06-28T16:12:48.593-07:00

Continuing with learning Clojure and Compojure better, I decided I'd wade through some basic DB access. Eric Lavigne has a great post with all the basics. I decided to write a small web app that allows a database to be viewer and (eventually) modified. Again, fairly simple so I don't confuse myself. The full clj file is include at the bottom of the post. The app starts with some basic definitions

dufflebunkhttp://www.blogger.com/profile/16745901322657722222noreply@blogger.com0tag:blogger.com,1999:blog-1230460733059093971.post-63031192134025855852009-06-09T08:16:00.000-07:002009-06-09T08:43:43.564-07:00

Compojure turned out to be relatively simple for making a basic URL driven calculator. Go to a URL like http://localhost:8080/add/4/5 and you get a page that simply says, "9". The Compojure documentation isn't complete yet (the site is quite upfront about that, and honesty is always nice), but along with examples online, there's probably enough to make a real web app. The full code is at the end

dufflebunkhttp://www.blogger.com/profile/16745901322657722222noreply@blogger.com1tag:blogger.com,1999:blog-1230460733059093971.post-35089776004333077322009-06-08T22:08:00.000-07:002009-06-16T20:35:15.449-07:00

A while back I tried out Clojure. It was my first real foray into the land of Lisp like languages, other than copying, pasting, and slightly modifying elisp chunks for Emacs which doesn't really count. It was very... interesting. I was writing a small IM bot to try it out, but couldn't find any reliable Java libraries for protocols other than XMPP. Nevertheless, I did get a basic bot working with

dufflebunkhttp://www.blogger.com/profile/16745901322657722222noreply@blogger.com1tag:blogger.com,1999:blog-1230460733059093971.post-70299506035364051122008-06-07T22:18:00.000-07:002008-06-10T19:18:16.425-07:00

I've been trying to write an efficient prime number generator. So far the best I've been able to do is about 2.3 seconds for the prime numbers less than one million. Using a normal sieve, it is possible for a C++ program to generate the primes in less than 0.05 seconds. So my goal is to get it to 0.5 seconds without having to resort to funky unsafe operations or basically writing the C solution

dufflebunkhttp://www.blogger.com/profile/16745901322657722222noreply@blogger.com0tag:blogger.com,1999:blog-1230460733059093971.post-18313914806079790562008-05-02T00:16:00.000-07:002008-05-02T21:35:32.020-07:00

I'm messing around learning to make foreign function interfaces in Haskell. It was sufficiently annoying that I decided to actually document what I did. I picked something, anything. It didn't have to be useful, and I would certainly not implement it in a sane way. The point is to get a chance to try various aspects of the Haskell FFI. I settled just boolean operator evaluation. And not even any

dufflebunkhttp://www.blogger.com/profile/16745901322657722222noreply@blogger.com2