Kazuhiro HISHINUMA kazh98

## keybase.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                kazh98
                / keybase.md
            
            
              Created
              September 18, 2017 01:40
            
          
    Keybase proof

I hereby claim:

I am kazh98 on github.
I am kazh98 (https://keybase.io/kazh98) on keybase.
I have a public key ASAV9NQS5znDJZ-wXfMT6cfgElG3Wcce0mx20TJuBgAVwAo

To claim this, I am signing this object:

  
## vectorInC.c
#include <stdio.h>
#include <stdlib.h>

typedef struct {
  size_t bufsiz;
  size_t length;
  int d[0];
} intary;

static intary* mkintary(void) {

## nd_lambda.rkt
#lang racket

(define *ambitions* '())

(define (nd-choice n)
  (let/cc return
    (for ((i (in-range n)))
      (let/cc cont
        (set! *ambitions* (cons cont *ambitions*))
        (return i))

## lispmeetup9.rkt
#lang racket
(require srfi/26)

(define *test-data* (port->string (current-input-port)))

(define lis (string-split *test-data*))
(define lis-l (map string-downcase lis))

(let ((table (make-hash)))
  (for-each

## sample.cpp
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <list>
using namespace std;

int
main (
  int   argc,
  char *argv[ ]

## biwascheme-min.js
/*
 * BiwaScheme 0.6.2.dev - R6RS Scheme in JavaScript
 *
 * Copyright (c) 2007-2012 Yutaka HARA (http://www.biwascheme.org/)
 * Licensed under the MIT license.
 */function puts(e,t){Console.puts(e,t)}function p(){Console.p.apply(this,arguments)}var BiwaScheme=BiwaScheme||{};BiwaScheme.Version="0.6.2.dev",BiwaScheme.GitCommit="cfa25606908bbc4fe35a2f465ff72fe372520509",function(e,t){function n(e){return B.isWindow(e)?e:e.nodeType===9?e.defaultView||e.parentWindow:!1}function r(e){if(!mn[e]){var t=D.body,n=B("<"+e+">").appendTo(t),r=n.css("display");n.remove();if(r==="none"||r===""){gn||(gn=D.createElement("iframe"),gn.frameBorder=gn.width=gn.height=0),t.appendChild(gn);if(!yn||!gn.createElement)yn=(gn.contentWindow||gn.contentDocument).document,yn.write((D.compatMode==="CSS1Compat"?"<!doctype html>":"")+"<html><body>"),yn.close();n=yn.createElement(e),yn.body.appendChild(n),r=B.css(n,"display"),t.removeChild(gn)}mn[e]=r}return mn[e]}function i(e,t){var n={};return B.each(Sn.concat.apply([],Sn.slice(0,t)),funct

## lispmeetup8.scm
(format #t "~D~%"
  (apply +
    (map (lambda (e) (x->number ((#/^[^\s]+\s+[^\s]+\s+[^\s]+\s+[^\s]+\s+([0-9]+)/ e) 1)))
      (filter (lambda (e) (odd? (x->number ((#/([0-9]+)/ e) 1))))
        (cdr (port->string-list (standard-input-port)))))))

## solver.scm
#!/usr/bin/env gosh
(use srfi-27)
(use gauche.uvector)
(use gauche.collection)

(define v f64vector)
(define <v> <f64vector>)
(define v-ref f64vector-ref)
(define v-map (pa$ map-to <v>))

## casl2.scm
;;; CASL2 Simulator implemented in Scheme/Gauche (incomplete)
;;;
;;; Copyright(C) 2013 Kazh. All Rights Reserved.

(use srfi-1)

(define keyword->symbol
  (compose string->symbol keyword->string))


## koropicot.scm
;;; ぼくはごしゅじんしゃまのしもべなのです
;;;  - Author: 2013 Kazh.

(use srfi-1)
(use srfi-4)

(define (port->bfcode port)
  (filter
    (pa$ char-set-contains? #[><+\-.,\[\]])
    (string->list (port->string port))))
	#include <stdio.h>
	#include <stdlib.h>

	typedef struct {
	size_t bufsiz;
	size_t length;
	int d[0];
	} intary;

	static intary* mkintary(void) {
	#lang racket

	(define ambitions '())

	(define (nd-choice n)
	(let/cc return
	(for ((i (in-range n)))
	(let/cc cont
	(set! ambitions (cons cont ambitions))
	(return i))
	#lang racket
	(require srfi/26)

	(define test-data (port->string (current-input-port)))

	(define lis (string-split test-data))
	(define lis-l (map string-downcase lis))

	(let ((table (make-hash)))
	(for-each
	#include <cstdio>
	#include <cstdlib>
	#include <ctime>
	#include <list>
	using namespace std;

	int
	main (
	int argc,
	char *argv[ ]
	/*
	* BiwaScheme 0.6.2.dev - R6RS Scheme in JavaScript
	*
	* Copyright (c) 2007-2012 Yutaka HARA (http://www.biwascheme.org/)
	* Licensed under the MIT license.
	*/function puts(e,t){Console.puts(e,t)}function p(){Console.p.apply(this,arguments)}var BiwaScheme=BiwaScheme\|\|{};BiwaScheme.Version="0.6.2.dev",BiwaScheme.GitCommit="cfa25606908bbc4fe35a2f465ff72fe372520509",function(e,t){function n(e){return B.isWindow(e)?e:e.nodeType===9?e.defaultView\|\|e.parentWindow:!1}function r(e){if(!mn[e]){var t=D.body,n=B("<"+e+">").appendTo(t),r=n.css("display");n.remove();if(r==="none"\|\|r===""){gn\|\|(gn=D.createElement("iframe"),gn.frameBorder=gn.width=gn.height=0),t.appendChild(gn);if(!yn\|\|!gn.createElement)yn=(gn.contentWindow\|\|gn.contentDocument).document,yn.write((D.compatMode==="CSS1Compat"?"<!doctype html>":"")+"<html><body>"),yn.close();n=yn.createElement(e),yn.body.appendChild(n),r=B.css(n,"display"),t.removeChild(gn)}mn[e]=r}return mn[e]}function i(e,t){var n={};return B.each(Sn.concat.apply([],Sn.slice(0,t)),funct
	(format #t "~D~%"
	(apply +
	(map (lambda (e) (x->number ((#/^[^\s]+\s+[^\s]+\s+[^\s]+\s+[^\s]+\s+([0-9]+)/ e) 1)))
	(filter (lambda (e) (odd? (x->number ((#/([0-9]+)/ e) 1))))
	(cdr (port->string-list (standard-input-port)))))))
	#!/usr/bin/env gosh
	(use srfi-27)
	(use gauche.uvector)
	(use gauche.collection)

	(define v f64vector)
	(define <v> <f64vector>)
	(define v-ref f64vector-ref)
	(define v-map (pa$ map-to <v>))
	;;; CASL2 Simulator implemented in Scheme/Gauche (incomplete)
	;;;
	;;; Copyright(C) 2013 Kazh. All Rights Reserved.

	(use srfi-1)

	(define keyword->symbol
	(compose string->symbol keyword->string))
	;;; ぼくはごしゅじんしゃまのしもべなのです
	;;; - Author: 2013 Kazh.

	(use srfi-1)
	(use srfi-4)

	(define (port->bfcode port)
	(filter
	(pa$ char-set-contains? #[><+\-.,\[\]])
	(string->list (port->string port))))