I got around to implementing my Code dup finder, and its on the web at this address. If you are young and trendy, then you can grab if using darcs with a darcs get. It only works for finding repeated lines of code, and misses empty lines. Some of the more advanced ideas haven't been implemented, but it does work.
I also wrote a little SAT solver. Its very much a exponial thing, but it does work for small instances. it employs a really simple huristic of spotting which varible appears the most, and assuming it is true or false. I'm planning on improving the huristic by making it ignore conjucts that have already been satisfied, and by mking the huristic guess if a varible should be true or false.
The other thing I'm thinking about is how to generate instances of SAT automaticly. I have a instance genenator already, but it needs some work to make harder instances.
posted at: 18:28 | path: /computing | permanent link to this entry