To remotely access the CS Lab computers (cslab1, cslab2, etc.), you must use an SSH client. OpenSSH is part of (Mac) OS X, most modern Linux distributions and *BSD operating systems (e.g. Ubuntu, Fedora, FreeBSD, etc.). Windows does not include an SSH client as part of the operating system, so you may need to download and install one.
TODO: Add list of Windows SSH clients.
If you already have Homebrew, just open a terminal and type
$ brew install clozure-cl
As Swift 1.0 did not include support for exceptions, a common error handling pattern was to use a Result enum that either took on a value on success, or an error on failure. In a way, this was superior to using exceptions, since being a instantiable type, Results could be passed around freely, enabling asynchronous code to use the same error handling mechanisim as synchronous code. Using Swift's robust support for custom operators, this also enabled Railway Oriented Programming for more functional oriented programers.
Swift 2.0 introduces throwable errors, which are similar to exceptions. However, like exceptions, thrown errors
| -- Content negotiation for nginx using the lua module | |
| -- Version 0.2 | |
| -- ©2013 Omar Stefan Evans | |
| -- Based on the content negotiation script for Lighttpd written by Michael Gorven | |
| -- (http://michael.gorven.za.net/blog/2009/04/13/content-negotiation-lighttpd-lua) | |
| -- It is licensed under a BSD license. | |
| -- 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 |
| //Omar Evans | |
| //TicTacToe Version 2 | |
| #include <iostream> | |
| #include <iomanip> | |
| #include <cstdlib> | |
| #include <ctime> | |
| #ifdef WIN32 | |
| #include <windows.h> | |
| #define clear() system("cls") | |
| #else |
| #include <iostream> | |
| #include <vector> | |
| #include <random> | |
| using namespace std; | |
| /* Returns whether a list is sorted */ | |
| bool isSorted(vector<int> & list); | |
| /* Sorts a list using the standard merge sort algorithm everyone learns in school (requires O(nlog(n)) space) */ |
| #include <stdio.h> | |
| int main() { | |
| char myLovelyString[] = "You're lovely...too"; | |
| puts(myLovelyString); | |
| return 0; | |
| } |
| /** | |
| * ©2014 Omar Stefan Evans. | |
| * | |
| * 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: | |
| * |
| CXX = g++ | |
| CXXFLAGS = -Wall | |
| DOCUMENTATION = | |
| BUILD_SYSTEM_FILES = Makefile | |
| DATA_FILES = | |
| SOURCE_FILES = main1.cpp main2.cpp ClassA.h ClassA.cpp ClassB.h ClassB.cpp |