Rag0n

public final class LinkedList<T> {
    public final class Node<T> {
        public private(set) var value: T
        public var next: Node?

        public init(value: T) {
            self.value = value
        }
    }

Rag0n

Videos

• Introduction to Functional Programming Johannes Weiß - http://kcy.me/1ngiv
• ReactiveCocoa at MobiDevDay Andrew Sardone - http://kcy.me/1nhl3
• The Future Of ReactiveCocoa Justin Spahr-Summers - http://kcy.me/1nhs7
• Enemy of the State Justin Spahr-Summers - http://kcy.me/1njzs
• WWDC 2014 Session 229 - Advanced iOS Application Architecture and Patterns Andy Matuschak - http://kcy.me/1pyva
• Functioning as a Functionalist Andy Matuschak - http://kcy.me/22o45
• Controlling Complexity in Swift Andy Matuschak - http://kcy.me/23sc9
• Functional and reactive programming with Swift Ash Furrow -

Rag0n

tmux shortcuts & cheatsheet

start new:

tmux

start new with session name:

tmux new -s myname

Rag0n

//
//  main.c
//  connected components
//
//  Created by Александр on 08.05.2557 BE.
//  Copyright (c) 2557 Alexander Guschin. All rights reserved.
//


#include <stdio.h>

Rag0n

//
//  main.c
//  acyclic test
//
//  Created by Александр on 08.05.2557 BE.
//  Copyright (c) 2557 Alexander Guschin. All rights reserved.
//


#include <stdio.h>

Rag0n

#include<iostream>
#include<algorithm>
using namespace std;
 
#include<string.h>
#include<math.h> 
 
#define inf 0x7fffffff
 
int arr[200000];

Rag0n

#include <stdio.h>
#include <string.h>
#include <stdlib.h>


struct node
{
    int data;
    struct node* next;
};

Rag0n

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

int heap[1000000];
int size = 0;


int StrCompare(char *Str1,char *Str2)
{

Rag0n

// c = t%(m+1)
// T - итоговая сумма, M - макс допустимое значение контрольной суммы
#include <stdio.h>
#define MAX 256
#define POLYNOMIAL 0x81  

FILE *file;


unsigned char crc8(unsigned int len)

Rag0n

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
// #include <stdbool.h> // bool
#define BLOCKSIZE 5000
#define MAX_TREE_HT 100
// Преобразование Барроуза-Уиллера
// int f = 53; // колво символов в алфавите mtf

struct CharAndFreq