kifu-for-js
- json-kifu-format
- shogi.js
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
interface Eq<T> { | |
equals(t: T): boolean; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Pillow==3.3.1 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
module Works.TestParsec where | |
import Text.Parsec hiding (optional) | |
import Text.Parsec.String | |
import Control.Applicative (optional) | |
data Command = Command | |
{ address :: Maybe Address | |
, cmdName :: Char |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
ed :: [String] -> IO () | |
ed args = if null args | |
then do | |
x <- fromMaybe "" <$> runInputT defaultSettings (getInputLine "") | |
ed' (setCmd x) [] [] 1 True | |
else do | |
x <- createBuffer (head args) | |
y <- fromMaybe "" <$> runInputT defaultSettings (getInputLine "") | |
ed' (setCmd y) (head args) x 1 True |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import Control.Applicative | |
import qualified Text.Parsec as P | |
import Text.Parsec.String | |
data Command = Command | |
{ addr :: Maybe Addr | |
, cmdName :: Char | |
, param :: Maybe String | |
} deriving (Show, Eq) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{-# LANGUAGE ImplicitPrelude #-} | |
module Control.Concurrent.Async.Extra where | |
import Control.Concurrent.Async | |
import Control.Monad.Trans.Except | |
import Data.Foldable | |
concurrentlyExcept :: IO (Except e a) -> IO (Except e b) -> IO (Except e (a, b)) | |
concurrentlyExcept actA actB = do |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{-# LANGUAGE PolyKinds #-} | |
{-# LANGUAGE DataKinds #-} | |
{-# LANGUAGE TypeFamilies #-} | |
{-# LANGUAGE TypeOperators #-} | |
{-# LANGUAGE GADTs #-} | |
{-# LANGUAGE ConstraintKinds #-} | |
{-# LANGUAGE UndecidableInstances #-} | |
module Data.DeferIsPrime where |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Require Import Arith. | |
Fixpoint sum (n: nat) {struct n}: nat := | |
match n with | |
| O => O | |
| S p => S p + sum p | |
end. | |
Lemma sum_Sn: forall n, sum (S n) = S n + sum n. | |
Proof. |
OlderNewer