midori cleoold

## day of week (arithmetic).rkt
;; given a date after Gregorian calendar being effective
;; returns the day of the week
;; input format: yyyymmdd

;; date->day-of-week: Nat -> Sym

(define (date->day-of-week date)
  (cond [(= (w date) 0) 'Sunday]
        [(= (w date) 1) 'Monday]
        [(= (w date) 2) 'Tuesday]

## fibonacci.rkt
;; Fibonacci with offsets and weights
;; F(0) = A
;; F(1) = B
;; F(n) = xF(n-2) + yF(n-1)

(define (weighted-fibonacci n A B x y)
  (cond
    [(= n 0) A]
    [(= n 1) B]
    [else

## sum of polynomial.rkt
;; computes the result of a given polymonial using Horner's method

;; a Poly (polynomial) is one of
;; * (cons Num null)
;; * (cons Num poly)

;; format of the polynomial
;; (list a-0 a-1 a-2 ... a-n) corresponds to
;; (a-0)+(a-1)x^1+(a-2)x^2+...+(a-n)x^n

## racket-learner1.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                cleoold
                / racket-learner1.md
            
            
              Last active
              December 16, 2018 03:25
            
          
    Created notes for Racket

I recently created a note that has some useful functions written in Racket language. They will sometimes be useful to
me and, I think, some others.
Please refer to https://github.com/cleoold/rktbsl

  
## folder_size.py
import os
def getFolderSize(folder):
    totalSize = 0
    for eachfile in os.listdir(folder):
        currPos = os.path.join(folder, eachfile)
        if os.path.isfile(currPos):
            totalSize += os.path.getsize(currPos)
        else:
            totalSize += getFolderSize(currPos)
    return totalSize

## permutation.py
# getting all permutations of N items in lst in python with eval
# iterable Int -> [(...) (...) ...]
def permute(lst, N):
    if N == 0 or N > len(lst):
        return []
    elif N < 0:
        raise ValueError('Second argument must be non-negative.')
    item = tuple(('i' + str(d) for d in range(N))) # tuple
    itemStr = '(' + ','.join(item) + ')' # str
    forSentence = ' '.join(' for ' + i + ' in _lst ' for i in item).replace('_lst', str(list(lst))) # str

## .cshrc
alias ls ls -GF

setenv	EDITOR	nano
setenv	PAGER	less

set prompt='\n%? %{\033[38;5;25m%}[%w %D %T]%{\033[0m%} %{\033[38;5;22m%}%n@%m %{\033[38;5;75m%}%~ >%{\033[0m%} '

## pipe.c
/**
 * write string into pipe, read after
 */
#include <assert.h>
#include <unistd.h>
#include <stdio.h>
#include <strings.h>

#define SIZE 99

## index.html
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <meta http-equiv="X-UA-Compatible" content="ie=edge">
    <title>Clock</title>
</head>

<body>

## stringutil.cpp
#include <string>
#include <vector>
#include <iostream>
#include <cassert>


/** splits str into vector of substrings, str is not changed */
std::vector<std::string> StringSplit(std::string str, const std::string delim)
{
    std::vector<std::string> res;
	;; given a date after Gregorian calendar being effective
	;; returns the day of the week
	;; input format: yyyymmdd

	;; date->day-of-week: Nat -> Sym

	(define (date->day-of-week date)
	(cond [(= (w date) 0) 'Sunday]
	[(= (w date) 1) 'Monday]
	[(= (w date) 2) 'Tuesday]
	;; Fibonacci with offsets and weights
	;; F(0) = A
	;; F(1) = B
	;; F(n) = xF(n-2) + yF(n-1)

	(define (weighted-fibonacci n A B x y)
	(cond
	[(= n 0) A]
	[(= n 1) B]
	[else
	;; computes the result of a given polymonial using Horner's method

	;; a Poly (polynomial) is one of
	;; * (cons Num null)
	;; * (cons Num poly)

	;; format of the polynomial
	;; (list a-0 a-1 a-2 ... a-n) corresponds to
	;; (a-0)+(a-1)x^1+(a-2)x^2+...+(a-n)x^n
	import os
	def getFolderSize(folder):
	totalSize = 0
	for eachfile in os.listdir(folder):
	currPos = os.path.join(folder, eachfile)
	if os.path.isfile(currPos):
	totalSize += os.path.getsize(currPos)
	else:
	totalSize += getFolderSize(currPos)
	return totalSize
	# getting all permutations of N items in lst in python with eval
	# iterable Int -> [(...) (...) ...]
	def permute(lst, N):
	if N == 0 or N > len(lst):
	return []
	elif N < 0:
	raise ValueError('Second argument must be non-negative.')
	item = tuple(('i' + str(d) for d in range(N))) # tuple
	itemStr = '(' + ','.join(item) + ')' # str
	forSentence = ' '.join(' for ' + i + ' in _lst ' for i in item).replace('_lst', str(list(lst))) # str
	alias ls ls -GF

	setenv EDITOR nano
	setenv PAGER less

	set prompt='\n%? %{\033[38;5;25m%}[%w %D %T]%{\033[0m%} %{\033[38;5;22m%}%n@%m %{\033[38;5;75m%}%~ >%{\033[0m%} '
	/**
	* write string into pipe, read after
	*/
	#include <assert.h>
	#include <unistd.h>
	#include <stdio.h>
	#include <strings.h>

	#define SIZE 99
	<html lang="en">

	<head>
	<meta charset="UTF-8">
	<meta name="viewport" content="width=device-width, initial-scale=1.0">
	<meta http-equiv="X-UA-Compatible" content="ie=edge">
	<title>Clock</title>
	</head>

	<body>
	#include <string>
	#include <vector>
	#include <iostream>
	#include <cassert>


	/** splits str into vector of substrings, str is not changed */
	std::vector<std::string> StringSplit(std::string str, const std::string delim)
	{
	std::vector<std::string> res;