Skip to content

Instantly share code, notes, and snippets.

//
// ViewController.swift
// VideoChatMessage
//
// Created by LateRain on 1/4/19.
// Copyright © 2019 LateRain. All rights reserved.
//
import UIKit
//
//
// Created by Chao Ruan on 23/04/2015.
//
#import "HKTStubber.h"
#import "Mantle/Mantle.h"
@implementation HKTStubber
@rcgary
rcgary / gist:a18e0b9f6e118b440c23
Created December 10, 2015 00:18
Reload Xcode Plugins
find ~/Library/Application\ Support/Developer/Shared/Xcode/Plug-ins -name Info.plist -maxdepth 3 | xargs -I{} defaults write {} DVTPlugInCompatibilityUUIDs -array-add `defaults read /Applications/Xcode.app/Contents/Info.plist DVTPlugInCompatibilityUUID`
------------
Conformances
------------
protocol AbsoluteValuable
Conformances:
Comparable
IntegerLiteralConvertible
SignedNumberType
@rcgary
rcgary / ttt.c
Created April 9, 2013 11:51 — forked from MatthewSteel/ttt.c
//Tic-tac-toe playing AI. Exhaustive tree-search. WTFPL
//Matthew Steel 2009, www.www.repsilat.com
#include <stdio.h>
char gridChar(int i) {
switch(i) {
case -1:
return 'X';
case 0:
@rcgary
rcgary / quick_sort.c
Created August 14, 2012 08:55 — forked from mbalayil/quick_sort.c
Quick Sort using recursion in C
/** Divide : Partition the array A[low....high] into two sub-arrays
* A[low....j-1] and A[j+1...high] such that each element
* of A[low....j-1] is less than or equal to A[j], which
* in turn is is less than or equal to A[j+1...high]. Compute
* the index j as part of this partitioning procedure.
* Conquer : Sort the two sub-arrays A[low....j-1] and A[j+1....high]
* by recursive calls to quicksort
**/
#include<stdio.h>