Index: src/examples/searchsort.c
===================================================================
--- src/examples/searchsort.c	(revision ea29e73385e68371089e727d9823856fe184d80e)
+++ 	(revision )
@@ -1,102 +1,0 @@
-//                               -*- Mode: C -*- 
-// 
-// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
-//
-// The contents of this file are covered under the licence agreement in the
-// file "LICENCE" distributed with Cforall.
-// 
-// searchsort.c -- 
-// 
-// Author           : Peter A. Buhr
-// Created On       : Thu Feb  4 18:17:50 2016
-// Last Modified By : Peter A. Buhr
-// Last Modified On : Tue Mar 22 22:16:46 2016
-// Update Count     : 55
-// 
-
-#include <fstream>
-#include <stdlib>										// bsearch, qsort
-
-int main( void ) {
-	const unsigned int size = 10;
-	int iarr[size];
-
-	for ( unsigned int i = 0; i < size; i += 1 ) {
-		iarr[i] = size - i;
-		sout | iarr[i] | ", ";
-	} // for
-	sout | endl;
-	qsort( iarr, size );
-	for ( unsigned int i = 0; i < size; i += 1 ) {
-		sout | iarr[i] | ", ";
-	} // for
-	sout | endl;
-	for ( unsigned int i = 0; i < size; i += 1 ) {
-		int *v = bsearch( size - i, iarr, size );
-		sout | *v | ", ";
-	} // for
-	sout | endl | endl;
-
-	// descending sort/search by changing < to >
-	for ( unsigned int i = 0; i < size; i += 1 ) {
-		iarr[i] = i + 1;
-		sout | iarr[i] | ", ";
-	} // for
-	sout | endl;
-	{
-		int ?<?( int x, int y ) { return x > y; }
-		qsort( iarr, size );
-		for ( unsigned int i = 0; i < size; i += 1 ) {
-			sout | iarr[i] | ", ";
-		} // for
-		sout | endl;
-		for ( unsigned int i = 0; i < size; i += 1 ) {
-			int *v = bsearch( size - i, iarr, size );
-			sout | *v | ", ";
-		} // for
-	}
-	sout | endl | endl;
-
-	double darr[size];
-	for ( unsigned int i = 0; i < size; i += 1 ) {
-		darr[i] = size - i + 0.5;
-		sout | darr[i] | ", ";
-	} // for
-	sout | endl;
-	qsort( darr, size );
-	for ( unsigned int i = 0; i < size; i += 1 ) {
-		sout | darr[i] | ", ";
-	} // for
-	sout | endl;
-	for ( unsigned int i = 0; i < size; i += 1 ) {
-		double *v = bsearch( size - i + 0.5, darr, size );
-		sout | *v | ", ";
-	} // for
-	sout | endl | endl;
-
-	struct S { int i, j; } sarr[size];
-	int ?<?( S t1, S t2 ) { return t1.i < t2.i && t1.j < t2.j; }
-	ofstream * ?|?( ofstream * os, S v ) { return os | v.i | ' ' | v.j; }
-	for ( unsigned int i = 0; i < size; i += 1 ) {
-		sarr[i].i = size - i;
-		sarr[i].j = size - i + 1;
-		sout | sarr[i] | ", ";
-	} // for
-	sout | endl;
-	qsort( sarr, size );
-	for ( unsigned int i = 0; i < size; i += 1 ) {
-		sout | sarr[i] | ", ";
-	} // for
-	sout | endl;
-	for ( unsigned int i = 0; i < size; i += 1 ) {
-		S temp = { size - i, size - i + 1 };
-		S *v = bsearch( temp, sarr, size );
-		sout | *v | ", ";
-	} // for
-	sout | endl | endl;
-} // main
-
-// Local Variables: //
-// tab-width: 4 //
-// compile-command: "cfa searchsort.c" //
-// End: //