nagat01 / blur_blender_image.py

Last active August 29, 2015 14:22

	# The MIT License (MIT)
	#
	# Copyright (c) 2015 nagat01
	#
	# Permission is hereby granted, free of charge, to any person obtaining a copy
	# of this software and associated documentation files (the "Software"), to deal
	# in the Software without restriction, including without limitation the rights
	# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
	# copies of the Software, and to permit persons to whom the Software is
	# furnished to do so, subject to the following conditions:

nagat01 / itsukaze_tags_ref.md

Last active August 29, 2015 14:20

初期化

以下のように記述すると、メッセージウィンドウ、キャラクター、フォント、マクロなどが初期化されます

; init
@call storage=library/main.ks
@init_indent
@init_blur_bg
@init_eye_close

@init_font_family

nagat01 / knapsack.fs

Last active August 29, 2015 14:18

	open System
	open System.Collections.Generic

	let solve precision goods wmax =
	let indices =
	goods
	\|> List.zip [0..goods.Length - 1]
	\|> List.sortBy (fun(_, (w,v)) -> - v / w)
	\|> List.map fst
	let ws, vs = goods \|> Array.ofList \|> Array.unzip

nagat01 / itsukaze_20150325.ks

Last active August 29, 2015 14:17

	;;;; library ;;;;
	@iscript
	f.kag = window.TYRANO.kag

	f.replace = function (arr, v, d) {
	arr.forEach(function(x) { if(x === v) d = x })
	return d }

	f.extract = function(mp, arr, d) {
	for(var x in mp) d = f.replace(arr, x, d)

nagat01 / sieve_intmap.hs

Created February 22, 2015 05:41

	{-# LANGUAGE ScopedTypeVariables #-}
	import qualified Data.IntSet as Set
	import Data.List(foldl')


	sieve n = step [2] (Set.fromList [3, 5 .. n])
	where
	step ps cs =
	case Set.minView cs of
	Just (p, cs) ->

nagat01 / conjugated of pure imaginary quaternion.fs

Last active August 29, 2015 14:15

	open System.Collections.Generic

	type Variable = A \| B \| C \| D \| E \| F \| G
	type Quaternion = W \| X \| Y \| Z
	type Term = Quaternion * Variable list * float
	type Number = Term list

	let normalize (n:Number) =
	let n = n \|> List.map (fun (q, vs, m) -> (q, List.sort vs, m))
	let d = Dictionary()

nagat01 / euler problem5.html

Created February 6, 2015 22:18

nagat01 / euler problem5.fs

Last active August 29, 2015 14:14

	open System

	let problem5 x =
	let primes = ResizeArray()
	for i in 2 .. x do
	if primes \|> Seq.forall(fun p -> i % p <> 0) then
	primes.Add i
	primes
	\|> Seq.map(fun p -> int(Math.Pow(float p, floor(Math.Log(float x, float p)))))
	\|> Seq.reduce (*)

nagat01 / entrance_exam.fs

Last active August 29, 2015 14:14

	open MathNet.Numerics

	type BigRational with
	member __.s =
	let n, d = __.Numerator, __.Denominator
	sprintf "%Aと%A/%A" (n / d) (n % d) d

	type Human = Y \| M
	type Point = A \| B \| C \| D

nagat01 / probability.fs

Last active August 29, 2015 14:12

nagato nagat01