Skip to content

Instantly share code, notes, and snippets.

View imphasing's full-sized avatar

I'm phasing imphasing

  • Flower Mound, TX
View GitHub Profile
diff --git a/mcs/class/corlib/System/Console.cs b/mcs/class/corlib/System/Console.cs
index ea9365e..65b56ca 100644
--- a/mcs/class/corlib/System/Console.cs
+++ b/mcs/class/corlib/System/Console.cs
@@ -44,11 +44,26 @@ namespace System
#if !NET_2_1
private class WindowsConsole
{
+ public static bool ctrlHandlerHooked = false;
+ private delegate bool WindowsCancelHandler (int keyCode);
make[3]: Entering directory `/cygdrive/c/mono/mono-src/mono/profiler'
CC proflog.lo
proflog.c:17:18: zlib.h: No such file or directory
proflog.c:226: error: parse error before "gzFile"
proflog.c:226: warning: no semicolon at end of struct or union
proflog.c:230: error: parse error before '}' token
proflog.c:235:1: warning: "TLS_INIT" redefined
In file included from proflog.c:26:
utils.c:63:1: warning: this is the location of the previous definition
proflog.c: In function `dump_header':
namespace Schemin.AST
{
public interface IScheminType
{
}
}
namespace Schemin.AST
(define bubblesort (lambda (l) (define swap-pass (lambda (l) (if (eq? (length l) 1) l (let ((fst (car l))(snd (cadr l))(rest (cddr l))) (if (> fst snd) (cons snd (swap-pass (cons fst rest))) (cons fst (swap-pass (cons snd rest))))))))(let for ((val l) (times (length l))) (if (> times 1) (for (swap-pass val) (- times 1)) (swap-pass val)))))
(define insertion-sort (lambda (lst) (define insert (lambda (x lst) (if (null? lst) (list x) (let ((y (car lst)) (ys (cdr lst))) (if (<= x y) (cons x lst) (cons y (insert x ys))))))) (if (null? lst) (quote ()) (insert (car lst) (insertion-sort (cdr lst))))))
(define foldl (lambda (func accum lst) (if (null? lst) accum (foldl func (func accum (car lst)) (cdr lst)))))
(define append (lambda (list1 list2) (if (null? list1) list2 (cons (car list1) (append (cdr list1) list2)))))
(define filter (lambda (f ls) (foldl (lambda (e r) (if (f e) (append r (list e)) r)) (quote ()) ls)))
# I'm thinking this will never work, since filter can return an empty list, which will be compared with <.. unless scheme is supposed to be able to compare numbers against empties?
(filter (lambda (e) (< e 0)) (quote (-9 0 2 -2 6 4 -3 -99 201 16 -12)))
schemin> (define x (quote (3 2 1)))
()
schemin> x
(3 2 1 )
schemin> (append (quote (4 5)) x)
(4 5 3 2 1 )
schemin> x
(3 2 1 )
schemin>
(define (nqueens n)
(define (dec-to n)
(let loop ((i n) (l '()))
(if (= i 0) l (loop (- i 1) (cons i l)))))
(define (try x y z)
(if (null? x)
(if (null? y)
1
0)
(define thread-queue '())
(define halt #f)
(define (void) (if #f #t))
(define (current-continuation)
(call/cc
(define-rewriter or-mine
(lambda (expr)
(let ((a (cadr expr))
(b (caddr expr)))
`(let ((temp ,a))
(if temp
temp
,b)))))
/*
* Copyright (c) 2011 Alex Fort
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright