AllConvert ToolsSplit ToolsMerge ToolsMeme ToolsResize ToolsCrop ToolsCompress ToolsEncodeDecodeWord Count ToolsCut ToolsTrim Tools
Welcome to the FoNC wiki. FoNC (aka Idst, Jolt, COLA, the SODA languages, etc.) is an ongoing project to create a programming language substrate and springboard for investigating new computing paradigms. Everything in it is late-bound, the intention being that any paradigm (existing or yet to be invented, formal complexity notwithstanding) be easily and efficiently mapped to it and made available
In this article, which is based on Chapter 1 of the book, Programming in Scala, you'll get an overview of the Scala language and insights into its design. The name Scala stands for âscalable language.â The language is so named because it was designed to grow with the demands of its users. You can apply Scala to a wide range of programming tasks, from writing small scripts to building large systems
(ã¡ãã£ã¨ã ã追è¨ãã¾ããããã®ä»1/25ã®ããããè¦ã¦ã¿ã¦ãã ããã) "Can programming be reinvented?"ã¨ããã¿ã¤ãã«ã§ã®çºè¡¨ãæ±å·¥å¤§ã¨æ±å¤§ã§ä¼¼ããããªçºè¡¨ãããã®ã ããã¹ãã¼ãªã¼ã©ã¤ã³ãæ¯è¼çæ°ãããããå ã«ãã£ãæ±å·¥å¤§ã§ã®çºè¡¨ã«ã¯åçç¹ãããããããããããæ±å¤§ã§ã®çºè¡¨ã«çããããå½¢ã«ãªã£ãã®ã¯å¦ããªãããããããªãã以ä¸ã¯ãããªãåç¾æ§ã®ä½ãã¡ã¢ã詳細ã¯ããã«èãã¦ãã ããããç§ãã¯ãã¡ããAlan Kayãæãã¾ãã è¿æã®äººãããããªãã§æ°ããã³ã³ãã¥ã¼ã¿ã®ã»ããWindowsã®èµ·åãMS Wordã®èµ·åãé ãã®?ããã大ãããã£ã¹ã¯ãã¤ãã¦ããã¯ããªã®ã«ããªã使ãã容éãå°ãªããªãã®?ãããã¢ãããã¼ããããããä½ã§åèµ·åããªãã¦ã¯ãããªãã®ï¼ãã¨ãã質åããããããªããªãè¯ã質åã§ããã ç§èªèº«ããã³ã³ãã¥ã¼ã¿ã«é¢ããçåããããããªããã³ã³
ITã¢ã¼ããã¯ãèª2008å¹´Vol.17ææ°å· http://www.itarchitect.jp/mag/ 㯠ãã¯ã©ã¦ãã»ã³ã³ãã¥ã¼ãã£ã³ã°ãã¨ã¨ãã«ãITã¢ã¼ããã¯ãå¿ èªï¼ãã¸ãã¹ã»ã»ã³ã¹ãé¤ãããã®20åã ãç¹éãã¦ããã®ã§ãã²åèã«ãã¦æ¬²ãããããããã¢ã³ã±ã¼ãã«çããã®ã ããè¤æ°äººã®ã¢ã³ã±ã¼ãã®éè¨ã ããããããªãã¨ã¯ãããããããææ¡ãã10åã®ãã¡ã®2åããåæ ãããªãã£ãï¼2ï¼ã¢ã¸ã¥ã¼ã«åã¯ããã¶ã¤ã³ã»ã«ã¼ã«ãã«ã«ã¹ãã¦ããã®ã§3ååæ ã¨ãããããï¼ãããã§ãã£ãããªã®ã§ãããã«ããã10åã®ãªã¹ãã¨ç°¡åãªç´¹ä»ãæ²è¼ãããã¨ã«ããã ä¸è¬çãªãããããã¸ãã¹æ¸ã¯æ¢ãã¦å¤ããçç³»ã¨ããè¦ç¹ã»æ ¹æºçãªæ´å¯ã¨ããè¦ç¹ãæã¡åºãã¦ããã¾ããä»ã®æ¹ãé¸ãã°ãªããããªããããã¨ã³ã¸ãã¢ã«ã¨ã£ã¦åãä»ãããããããéè¦ãªããã¸ãã¹æ¸ããé¸æããã¦ããã ãã¾ãããã©ãããã½ããã¦ã§ã¢ã¨
æè¿ãããã¼ããéã¨ã¯ãã£ããä½ãªã®ãï¼ã¨ãããã¨ããããã«æ°ã«ãªã ããããæ¬ãæ¼ã£ã¦ããããã£ããèªãã ã®ã§èªåç¨ã®ã¡ã¢ã ã¯ã¬ã¸ããã«ã¼ãã£ã¦1958å¹´ã®å®é¨ã§å§ã¾ã£ãçµæ§æ°ããåå¨ãªãã§ããã æè¿ã®ã財å¸æºå¸¯ãªã©ã®ããããé»åããã¼ã¨ã®éããããããã®ä»çµã¿ãæ´å²çãªçµç·¯ãè¦ãã¨ãããããã¾ãããé¢ç½ãã 森å åï¼ã貨幣ã®ç¤¾ä¼å¦ãçµæ¸ç¤¾ä¼å¦ã¸ã®æå¾ ãæ±ä¿¡å 2007 âã¯ã¬ã¸ããã«ã¼ãã®èªç ã¯ã¬ã¸ããã«ã¼ãã¯ãåã¯ã¬ã¸ããä¼ç¤¾ã®ä¼å¡ã«ãªããã¨ã§ããã®ã«ã¼ãã®ä¿¡ç¨ãé ¼ãã«ãå 延ã°ãæãã®æ±ºæ¸æ©è½ã使ç¨ãããã¨ãã§ããä»çµã¿ã§ãããé»åããã¼ãé»å財å¸ãªã©ç¾éåæ§ã®æ±ºæ¸æ©è½ããã¤ãã®ã¨ã¯ç°ãªããã®ã§ããã æ´å²çã«ã¯ã1958å¹´ãã³ã¯ãªãã¢ã¡ãªã«ãã«ãªãã©ã«ãã¢å·ãã¬ãºãã®äººã ã«çªç¶6ä¸æã®ã¯ã¬ã¸ããã«ã¼ããéãä»ãããã®ä»çµã¿ãæ ¹ä»ããããã¨ããã®ãå§ã¾ãããã以éãç¡å·®å¥ã«ã«ã¼ã
ã¡ãã¨ã¦ã¡ãã ãã6æã§ãããæ¢ é¨å ¥ãã§ãããScalaã®å£ç¯ã§ããã ã¨ãããã¨ã§ãScalaåå¼·ä¼ãmixiã®Scalaã³ãã¥ã¨ã®ååä¼ç»ã¨ãã¦è¡ãã¾ãã Scalaã«é¢å¿ã®ããæ¹ã§ããã°ãã©ãªãã§ããèªç±ã«åå ã§ãã¾ãã ====== æ¥æï¼ 2008 6/13(é)19ï¼00-21ï¼00ãã®å¾æè¦ªä¼ å ´æï¼ æ°å®¿ä¸äºãã«34é è±èµãã¬ã¼ãã³ã°ã«ã¼ã ï¼50人ãããã¯å容å¯ï¼ åå ç¡æï¼æ親ä¼ã¯å²ãåï¼ ãã¼ã(äºå®) ï¼ï¼ç¥å´ããï¼Scalaã使ã£ãSwingãã¼ã¹ããã°ã©ã ã®ç´¹ä»ã¨ã㢠æå¹å¨ä½ã®Scalarã§ããç¥å´ããããUMLã¢ããªã³ã°ãã¼ã«ã§ä½æããè¦ä»¶å®ç¾©ãæ¤è¨¼ãããã¼ã«ãScalaã§ä½æãã¾ãããSwingããã®ã¾ã¾Scalaãã使ã£ã¦ãã¾ãã®ã§Scalaã®Javaã¨ã®è¦ªåæ§ã®é«ãã®ç´¹ä»ã¨DBã¢ã¯ã»ã¹ãªã©ããã°ã©ã ä¸ã§ã®Scalaãªãã§ã¯ã®ãã¯ããã¯ããç´¹ä»ãã¾ãã
åç §ééæ§ã¨é 延è©ä¾¡ ç´ç²é 延é¢æ°åè¨èªã«å ¥åºåãå°å ¥ããå ´åã«ã¯ã åç §ééæ§ãé 延è©ä¾¡ã¨ã©ãæãåããã¤ãããã ãåé¡ã«ãªãã åç §ééæ§(Referential Transparency) ãåç §ééæ§ãã®æ£ç¢ºãªå®ç¾©ã¯ç¥ããªãã ããã©ãã ããã ãçãããã®ãå¥ã®çãããã®ã«ç½®ãæãããã¦ã ç½®ãæãã¦ã®å ¨ä½ã®çµæãå¤ãããªãã ã¨ããæ§è³ªããåç §ééæ§ãã¨å¼ã¶ã (ãä»£å ¥å¯è½æ§ã®åçãã¨ã©ãéãã®ãã¯ãããå¤ããªã) ãªãã§ãã®æ§è³ªãåç §ééæ§ã¨å¼ã¶ã®ããæ£ç¢ºãªæã¯å¤ããªããã©ã ãã¶ã次ã®ãããªäºãå ã«ãªã£ã¦ããã®ã§ã¯ãã¨äºæ³ãã¦ãã (以ä¸ãã°ãããæ¬é¡(å ¥åºåã®è©±)ã¨ã¯é¢ä¿ãªã)ã ã¯ã¯ã¤ã³ã¯ãæ示ã¨æ§ç¸ã(ãè«çç観ç¹ãããã«åé²)ã§ã ã ããã次ã®ãããªäºãæ¸ãã¦ããã åå(ã¨ãé ã¨ã)ãåã«å¯¾è±¡ãæ示ãããã®ã¨ãã¦ç¾ãã¦ããå ´åã ãç´ç²ã«æ示ç(purely r
ä¸åç¹ãªãã¬ã¼ã¿Y éä¹é¢æ°ã¯ã (define fact (lambda (n) (if (= n 0) 1 (* n (fact (- n 1)))))) ã®ããã«ãå帰çã«å®ç¾©ã§ããã å帰çå®ç¾©ãè¡ãªãå ´åã¯defineãletrecã使ããã©ã 代ããã«letã使ãã¨å帰çå®ç¾©ã¯ã§ããªãã defineãletrecãã©ããã¦ã使ããããªããªããå¤å°å·¥å¤«ãããã ä¾ãã°ãfactã®å¼æ°ãå¢ããã¨ããæ¹æ³ãããã (let ((fact (lambda (self n) (if (= n 0) 1 (* n (self self (- n 1))))))) (fact fact 10)) â 3628800 (ä¸ç¥) ä¸åç¹ãªãã¬ã¼ã¿Yã使ãã¨æ¬¡ã®ããã«æ¸ããã (let* ((Y (lambda (g) ((lambda (s) (g (lambda (x) ((s s) x))
ãã®æ¬ãè²·ã£ãã®ã¯ãã©ã¸ãª(ã»ãã§ããªãNPR)ã§åå¹´ã«ä¸åº¦ã®é§ä½ã®ããã«èªããã¦ããããã ãã ããå®éã«æãã ã£ãã®ã¯è©ä¾¡ã®ã»ãã ã£ããSupercapitalismã¯ãããã¦è¡æã§çµé¨è±å¯ãªãªãã©ã«ã«ãã£ã¦æ¸ããããã¤ã«ãã°ãããèä½ã ããè æãå¿ èªè³æã®æåã®ä¸åã«é¸ãã ã ãã®æ¬ã®ãããããã示ããã³ããæãããªãããªãã©ã«ã§ããèè ããæ³äººæå¾ç¨ã®å»æ¢ã主張ã(ãããã«æ ªä¸»ãæ¯æãã¹ãã§ãã)ãä¼æ¥ã¯å¾æ¥å¡ã«å¥åº·æå½ãä¸ããã¹ãã§ã¯ãªã(ç¨å¶ä¸ã®åªéã¯å½ã®çµæ¸ã«ã¨ã£ã¦å¤§ããªæªã¿ã§ãããå½æ°ä¿å¥å¶åº¦ã1400åãã«è¿ãã®æ¯åºãè¦ããªããéå¹ççã§å¹æãèãåå ã¨ãªã£ã¦ãã)ã¨è«ãã¦ãããã¨ã ãã©ã¡ãã®ææ¡ãçã«ããªã£ã¦ãããèè Reichããã æ¢åã®ä¸»å¼µãç¹°ãè¿ãã¦ããã®ã§ã¯ãªãèãã¦ãããã¨ãåãã¦ãããããã¦ãã¼ã¯ã¬ã¼ã®ææã§ãããã¯ãªã³ãã³æ¿æ¨©ã§å´åé·å®ãåããèè ã®ããã«çµ
å æ¥ãErlangåæ£ã·ã¹ãã åå¼·ä¼ã§ãæè¿ç§ã追ã£ã¦ãã CouchDB ã¨ãããªã¼ãã³ã½ã¼ã¹ã®ããã¥ã¡ã³ãæååæ£ãã¼ã¿ãã¼ã¹ã«ã¤ãã¦ç´¹ä»ãã¦ãã¾ãããçºè¡¨è³æãããã¦ããã¾ãã ããã¥ã¡ã³ãæåãã¼ã¿ãã¼ã¹ CouchDB(PDF) åæ£ã·ã¹ãã ã§ããã Erlang ã¨ãããããã£ã½ãåå¼·ä¼ã§ãããã30人ã®åå è ãä¸ç¬ã§éã¾ããé常ã«ç±ãä¼ã§ãããç§ãèªåã®å¥½ããªè©±ã好ããªããã«è©±ãã¦ãã¾ããåå è ã®ã¿ãªããã¯ãã³å¼ãã ã£ãããããã¾ãã⦠ããã ãã§ã¯ä½ãªã®ã§ãã¤ãã§ã«æå ã® Fedora7 on coLinux ã« CouchDB ã® trunk ãå ¥ããã¨ãã®æé ã¨ãç°¡å㪠couchdb ã®ä½¿ãæ¹ããç´¹ä»ãã¦ããã¾ãã åºæ¬çã«ã¯ãªãã£ã·ã£ã«wikiã«ããã¨ãããyum ã§ã¢ã¸ã¥ã¼ã«ãå ¥ãã¦ããã°åé¡ããã¾ãããç´ ã® coLinux ããã®å ´åã以ä¸ã®ã¢ã¸ã¥ã¼ã«ãå¿ è¦ã§ã
An example of a binary hash tree. Hashes 0-0 and 0-1 are the hash values of data blocks L1 and L2, respectively, and hash 0 is the hash of the concatenation of hashes 0-0 and 0-1. In cryptography and computer science, a hash tree or Merkle tree is a tree in which every "leaf" node is labelled with the cryptographic hash of a data block, and every node that is not a leaf (called a branch, inner nod
Chordã§ã¯ãã³ã³ãã³ãã®ããã·ã¥å¤ãæ±ããé¢æ°ã«SHA-1ãæ¡ç¨ããã®ãä¸è¬çã§ããããããã¯ã¼ã¯ã«åå ãããã¼ãã¯ãSHA-1ã®ããã·ã¥å¤ã®å¤åãæºããä¸æãªãå²ãå½ã¦ãããã ããã§ãã¨ããé¢æ°ãå®ç¾©ããããã®é¢æ°ã¯ãããã·ã¥å¤ãä¸ããããã¨ããå¤ãå¢å ãããæ¹åã§æ¬¡ã«åå¨ãã¦ãããã¼ãã®ãè¿ãããªããã¨ã¯æ¥ç¶ããã¦ããã¨èããã ãããã¯ã¼ã¯ã§æ å ±ãå ±æããéã«ã¯ãå ±æãããæ å ±ã®ããã·ã¥å¤ãã¨ãã¦ãæºãããæã¤ãã¼ãããå®éã«æ å ±ãä¿æãã¦ãããã¼ãã®ä½ç½®ã示ãIPã¢ãã¬ã¹çã®æ å ±ãä¿æããã ã¾ãããããã¯ã¼ã¯ã«åå ãããã¼ãã¯ãèªèº«ã®ãã¨ããå ´åã , ãã ã ã®ããã¤ãã¼ãã®IPã¢ãã¬ã¹ãã«ã¼ãã£ã³ã°ãã¼ãã«ã¨ãã¦ä¿æããã å ±æããã¦ããæ å ±ãæ¤ç´¢ããéã«ã¯ãæ¤ç´¢ãããæ å ±ã®ããã·ã¥å¤ãã¨ããã¨ããã¨ãã¦ãå²ãå½ã¦ããã¦ãããã¼ããåãã¼ãã®ã«ã¼ãã£ã³ã°ãã¼ãã«ãå©ç¨ã
A vector clock is a data structure used for determining the partial ordering of events in a distributed system and detecting causality violations. Just as in Lamport timestamps, inter-process messages contain the state of the sending process's logical clock. A vector clock of a system of N processes is an array/vector of N logical clocks, one clock per process; a local "largest possible values" co
ConsistentHashing - ã³ã³ã·ã¹ãã³ãã»ããã·ã¥æ³ ç®æ¬¡ ãã®ææ¸ã«ã¤ã㦠ã³ã³ã·ã¹ãã³ãã»ããã·ã¥æ³ å®ä¾ å®è£ ç¨é ã³ã³ã·ã¹ãã³ãã»ããã·ã¥æ³ ãã®ææ¸ã«ã¤ã㦠"Tom White's Blog: Consistent Hashing" ã®æ¥æ¬èªè¨³ã§ã. http://weblogs.java.net/blog/tomwhite/archive/2007/11/consistent_hash.html æ¨æ²æè¿: 誤訳, ã¿ã¤ã, 訳èªã®ä¸çµ±ä¸, ãã®ã»ã... åæã®ã©ã¤ã»ã³ã¹: http://creativecommons.org/licenses/by-nc-sa/2.0/ ç§ã¯ä»ã¾ã§ã«ä½åº¦ãã³ã³ã·ã¹ãã³ãã»ããã·ã¥æ³ã«ã¨ãããã ãã¨ãããã ãã®ã¢ã¤ãã¢ããããããè«æ ( David Karger ãã«ãã Consistent Hashing and R
_ Erlang åæ£ã·ã¹ãã åå¼·ä¼ çµããã¾ãã [erlang][kai][dynamo] ããããã®ãåå ãããã¨ããããã¾ããï¼ãé°æ§ã§ï¼çæ³ã®ãã¡ã«çµã ããã¨ãã§ãã¾ããï¼ å®¶ãé ãã¦æ©ã帰ããªããã°ãªããªãã£ãã®ã§ï¼æ親ä¼ã®ã¨ãã«å ¨å¡ã«æ¨ æ¶ã§ããªãã£ãã®ãå¿æ®ãã§ãï¼ï¼ lyokato ããã«ã¯ä¼å ´ã®æé ããå ¥å®¤ç®¡çã¾ã§ãã£ã¦ããã ãã¾ããï¼ã¾ ãï¼hamano ããã«ã¯æ親ä¼ã®æºåããééã¾ã§ãã¦ããã ãã¾ããï¼æ¬å½ ã«ãããã¨ããããã¾ããï¼ Erlang åæ£ã·ã¹ãã ã¨ãããã¼ã¯ã¼ãã«ï¼ããã ãã®äººãèå³ãæã£ã¦ ããã¨ãããã¨ãããã£ã¦é©ãã¾ããï¼ããããªè§åº¦ãã Erlang ãåæ£ ã·ã¹ãã ãè¦ããã¨ãã§ãã¦ï¼é¢ç½ãã£ãã§ãï¼ å人çã«ã¯ï¼CouchDB ã®å®æ度ãã¤ãã¤ã (ã§ã¯ãªãï¼ã¾ã çºå±éä¸æ®µé ã¨ã®ææã yohei ããããåãã¾ãã) ã¨ããã®ã
ãªãªã¼ã¹ãé害æ å ±ãªã©ã®ãµã¼ãã¹ã®ãç¥ãã
ææ°ã®äººæ°ã¨ã³ããªã¼ã®é ä¿¡
j次ã®ããã¯ãã¼ã¯
kåã®ããã¯ãã¼ã¯
lãã¨ã§èªã
eã³ã¡ã³ãä¸è¦§ãéã
oãã¼ã¸ãéã
{{#tags}}- {{label}}
{{/tags}}