okkez weblog

deb http://pkg-voip.buildserver.net/debian etch main

$ sudo aptitude update

W: GPG error: http://pkg-voip.buildserver.net etch Release: 公開鍵を利用できないため、以下の署名は検証できま せんでした: NO_PUBKEY 2A5E3A5A52ABFCB1
W: これらの問題を解決するためには apt-get update を実行する必要があるかもしれません

# gpg --keyserver wwwkeys.eu.pgp.net --recv-keys 2A5E3A5A52ABFCB1
# gpg --armor --export 2A5E3A5A52ABFCB1 | apt-key add -

$ sudo aptitude update
$ sudo aptitude install wengophone

$ lsusb |grep Logitech
Bus 001 Device 004: ID 046d:08d9 Logitech, Inc.

$ sudo aptitude install spca5xx-source
$ sudo module-assistant prepare
$ sudo module-assistant auto-install spca5xx

-module(convert).
-compile(export_all).
-import(lib_misc,[p/1]).

old_roman_unit(1000) -> "M";
old_roman_unit( 500) -> "D";
old_roman_unit( 100) -> "C";
old_roman_unit(  50) -> "L";
old_roman_unit(  10) -> "X";
old_roman_unit(   5) -> "V";
old_roman_unit(   1) -> "I".

i2r(Num) ->
    lists:flatten(i2r(Num, [1000, 500, 100, 50, 10, 5, 1])).
i2r(_,[]) ->
    [];
i2r(Num, [H|T]) ->
    lists:duplicate(Num div H, old_roman_unit(H)) ++ i2r(Num rem H, T).

  $ runghc convert.hs 10  #=> X
  $ runghc convert.hs 999 #=> DCCCCLXXXXVIIII

import System
import Numeric

main = do cs <- getArgs
          let [(n,_)] = readDec $ head cs
          putStrLn $ i2r n

old_roman_unit :: Int -> Char
old_roman_unit n
    | n == 1000 = 'M'
    | n ==  500 = 'D'
    | n ==  100 = 'C'
    | n ==   50 = 'L'
    | n ==   10 = 'X'
    | n ==    5 = 'V'
    | n ==    1 = 'I'
    | otherwise = 'Q'

i2r :: Int -> String
i2r n = i2r2 n [1000, 500, 100, 50, 10, 5, 1]
i2r2 :: Int -> [Int] -> String
i2r2 _ [] = []
i2r2 n (u:us) =
    replicate (n `div` u) (old_roman_unit u) ++ i2r2 (n `mod` u) us

main = putStrLn $ unlines $ map i2r [1..4999]

old_roman_unit :: Int -> Char
old_roman_unit n
    | n == 1000 = 'M'
    | n ==  500 = 'D'
    | n ==  100 = 'C'
    | n ==   50 = 'L'
    | n ==   10 = 'X'
    | n ==    5 = 'V'
    | n ==    1 = 'I'
    | otherwise = 'Q' -- 本当は例外？を投げたい気がする

i2r :: Int -> String
i2r n = i2r2 n [1000, 500, 100, 50, 10, 5, 1] []
i2r2 :: Int -> [Int] -> String -> String
i2r2 _ [] str = str
i2r2 n (u:us) str =
    i2r2 (n `mod` u) us (str ++ replicate (n `div` u) (old_roman_unit u))

r2i(Str) ->
    [H|T] = [1000, 500, 100, 50, 10, 5, 1],
    {Matched, Unmatched} = 
    lists:partition(fun(X) ->
                [X] =:= old_roman_unit(H) end, Str),
    check(Str, Matched),
    lists:sum(lists:map(fun({Num, L}) ->
              Num * length(L) end,
              r2i(T, Unmatched, [{H, Matched}]))).
r2i([], _, L) ->
    L;
r2i([H|T], Str, L) ->
    {Matched, Unmatched} =
    lists:partition(fun(X) ->
                [X] =:= old_roman_unit(H) end, Str),
    check(Str, Matched),
    r2i(T, Unmatched, [{H, Matched}|L]).

check(Orig, L) ->
    if length(Orig) < length(L) ->
        false;
       true ->
        case lists:all(fun({X,Y}) -> X =:= Y end,
               lists:zip(lists:sublist(Orig,1,length(L)),L)) of
        true -> true;
        false -> throw('ArgumentError')
        end
    end.

-module(math).
-export([i2r/1,to_s/2]).
-import(lib_misc,[p/1]).

old_roman_unit(N) when N =:= 1000 -> "M";
old_roman_unit(N) when N =:= 500  -> "D";
old_roman_unit(N) when N =:= 100  -> "C";
old_roman_unit(N) when N =:= 50   -> "L";
old_roman_unit(N) when N =:= 10   -> "X";
old_roman_unit(N) when N =:= 5    -> "V";
old_roman_unit(N) when N =:= 1    -> "I".

i2r(Num) ->
    [H|T] = [1000, 500, 100, 50, 10, 5, 1],
    {Div, Mod} = {Num div H, Num rem H},
    lists:flatten(i2r(Mod, T, to_s(old_roman_unit(H),Div))).
i2r(_,[],Str) ->
    Str;
i2r(Num, [H|T], Str) ->
    {Div, Mod} = {Num div H, Num rem H},
    if
    Div > 0 ->
        i2r(Mod, T, Str ++ to_s(old_roman_unit(H), Div));
    true ->
        i2r(Mod, T, Str)
    end.



to_s(C, Num) ->
    if Num > 0 ->
        lists:map(fun(_) -> C end,lists:seq(1,Num));
       true ->
        []
    end.

-module(lib_misc).
-export([p/1]).

p(X) ->
    io:format("~p~n",[X]),
    X.

to_s(C, Num) ->
    if Num > 0 ->
        lib_misc:p(lists:map(fun(_) -> C end,lists:seq(1,Num)));
       true ->
        []
    end.