Rosetta Code
Rosetta Code is a programming chrestomathy site. The idea is to present solutions to the same task in as many different languages as possible, to demonstrate how languages are similar and different, and to aid a person with a grounding in one approach to a problem in learning another. Rosetta Code currently has 1,350 tasks, 405 draft tasks, and is aware of 996 languages, though we do not (and cann
LZW compression - Rosetta Code
package LZW is MAX_CODE : constant := 4095; type Codes is new Natural range 0 .. MAX_CODE; type Compressed_Data is array (Positive range <>) of Codes; function Compress (Cleartext : in String) return Compressed_Data; function Decompress (Data : in Compressed_Data) return String; end LZW; with Ada.Containers.Ordered_Maps; with Ada.Strings.Unbounded; package body LZW is package UStrings renames Ada.
Y combinator - Rosetta Code
Y combinator You are encouraged to solve this task according to the task description, using any language you may know. In strict functional programming and the lambda calculus, functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
