Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re: Rosetta PGA-TRAM

by citromatik (Curate)
on Jun 13, 2009 at 13:19 UTC ( #771231=note: print w/ replies, xml ) Need Help??


in reply to Rosetta PGA-TRAM

In OCaml

let explode str = let rec aux pos acc = if pos < 0 then acc else aux (pred pos) (str.[pos] :: acc) in aux ((String.length str)-1) [] let d2a = function | 'M' -> 1000 | 'D' -> 500 | 'C' -> 100 | 'L' -> 50 | 'X' -> 10 | 'V' -> 5 | 'I' -> 1 | _ -> failwith "Incorrect character" let r2d str = List.fold_left (fun acc x -> let x' = d2a x in acc + x' - acc mod +x' * 2) 0 (explode (String.uppercase str));;
  • explode just converts a string into a list of its characters. The future standard library for OCaml, named Batteries included will include such a function by default.
  • The functional nature of OCaml allows a natural implementation of the algorithm

citromatik


Comment on Re: Rosetta PGA-TRAM
Select or Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://771231]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (13)
As of 2015-07-28 09:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (254 votes), past polls