pkulev

class A(object):
    def foo(self):
        print(1)

class B(object):
    def foo(self):
        print(2)
        
class C(A, B):
    @staticmethod

pkulev

#include <stdio.h>

typedef struct Point {
    int x;
    int y;
} Point;

Point *create_point(int x, int y, Point *point)
{
//point = struct Point;

pkulev

#! /usr/bin/env python

import os
import sys
 
usage = "USAGE: {0} path".format(sys.argv[0])

if len(sys.argv) != 2:
    print usage
    sys.exit(1)

pkulev

>>> def myreduce(func, list, initial):
...     def inner(inner_list, acc):
...             if not inner_list: return acc
...             else: return inner(inner_list[1:], func(acc, inner_list[0]))
...     return inner(initial + list, 0)
... 

pkulev

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

int pow2(int val)
{
    return val * val;
}

int* map(int (*func)(int), int *arr, int len)
{   int *res = malloc(sizeof(int) * len);

pkulev

   local FillRecord in
	  fun {FillRecord Features Values Rec}
		 case Features
		 of H|T then
			case Values.1
			of Lab|Feat|Val then
			   {FillRecord T Values.2
				{AdjoinAt Rec H
				 {Transform Lab|Feat|Val}}}
			[] Val then

pkulev

declare
fun {Map F L}
   case L of nil then nil
   [] H|T then {F H} | {Map F T}
   end
end

{Browse {Map fun {$ X} X*X end [1 2 3 4]}}

pkulev

% if head is nil then answer
% if head is integer then append it to answer and flatten tail
% if head is list then flatten head and then flatten tail

declare
fun {FlattenList L}
   local FlatLoop in
	  fun {FlatLoop L1 Acc}
		 case L1
		 of nil then Acc

pkulev

fun {Prefix L1 L2}
  case L1
  of H|T then
    if H == L2.1 then {Prefix T L2.2}
    else false end
  [] nil then true
  end
end

fun {FindString L1 L2}

pkulev

#!/usr/bin/env python

from __future__ import print_function

import curses
import functools
import sys


class Settings(object):