John Gruber posted his title case script the other day which prompted a request from Dan Benjamin to convert it into Ruby. This is my quick and dirty attempt.
If only I was such a highly skilled regexp ninja as Gruber is!.
So today I launched a little command line application for compressing CSS files.
Today I thought I would have a play at implementing a binary tree in ruby and see if I could dig up any things I had not used before.
While at university I had the pleasure of studying bioinformatics. Bioinformatics is all about using the processing power of computers to lean about and infer data from DNA and protein sequences.
For example if you want to find the common parts of a DNA sequence from 500 different sequences and each sequence is 50000 bases long it will take some time to compare them all and you are bound to make some mistakes.
This is where bioinformatics comes in and uses tried and tested computer science principles to make these large tasks easier, more accurate and faster. One example is the Needleman-Wunsch algorithm which is used to score a string of bases against another.
One thing that programming students often have to implement is a program to tell whether or not a string is a palindrome. In this post I flex my dusty Java and demonstrate a simple palindrome detector.
The other day I was trying to code a back end to a simple web form. I wanted the data entered into the form to be emailed back to me. Here I describe two very simple methods to send an email from both PHP and Ruby code.
StaticMatic is a small framework for producing static web sites. It is built on top of a number of Ruby gems such as Haml and makes it possible to create totally static sites using Ruby.
I have spent a bit of time playing with StaticMatic and thought I would share some of the things I have learnt just in case anyone else has the same questions as I did.
© Moose56 blog. Powered by WordPress using a edited version of a reworked version of the DePo Clean Theme