makoru-hikage

#!/usr/bin/python

def is_leap_year (n):
    if n % 100 == 0:
        dividedBy100 = n / 100
        if dividedBy100 % 4 == 0:
            return True
    else:
        return n % 4 == 0

makoru-hikage

#!/usr/bin/python

def fibonacci (t):
    if t <= 1:
        return t
    return (fibonacci(t - 1) + fibonacci(t - 2))

def fibonacci_set(t):
    if t == 0:
        return [0]

makoru-hikage

// https://developer.mozilla.org/en-US/docs/Web/API/MediaQueryList
type mediaQueryList = {
  matches: bool,
  domString: string
}

// https://developer.mozilla.org/en-US/docs/Web/API/Window/matchMedia
@val @scope("window")
external matchMedia: string => mediaQueryList = "matchMedia"

makoru-hikage

const fs = require('fs');

const rawData = fs.readFileSync('bsconfig.json')
var bsconfig = JSON.parse(rawData)

var choice = process.argv[1]

// There's a chance this code is run like this: 'node <this script>'
if (process.argv[0] !== __filename){
  choice = process.argv[2]

makoru-hikage

Architecture

This is a web app run by NodeJS, written in Javascript, and made using fastify web microframework.

The architecture of this source code is loosely based on Explicit Architecture which is based on Domain-Driven Design (DDD) and Hexagonal Architecture. Take note that business logic is strictly separated from infrastructure logic. The app is a monolith designed to be broken down into microservices in the near future. This app is divided into services which is contained inside the "services" folder of this app. Each service has its own folder and an index.js file in their folder. Since fastify-cli is used, each service can be run independent of each other with their own ENV files.

A service here represents a Bounded Context in DDD.

Folder Structure

The folder structure of a _se

makoru-hikage

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

#define ARRAY_LENGTH 6

/* Assuming arrays start at zero*/
int find_opposite(int n, int count){
  /* If arrays start at one, one can use (count+1) - n */
  return count - n;

makoru-hikage

#!/bin/bash/python
#
# Requires Python 3 and above 
#
# Example
#
# R A D A R
# 1 2 3 4 5
#
# H A N N A H

makoru-hikage

"""
## Derived from here:
## https://math.stackexchange.com/questions/1694311/is-sigma-sigma-a-mathematical-way-of-doing-a-for-loop/1694322
## (c) CC-BY-SA 3.0
"""

## Definition
def sum_notation(i=0, end=1, f= lambda x : x):
  return f(i) + sum_notation(i+1, end, f) if (i <= end) else 0

makoru-hikage

def is_prime(x):
  divisor = 1
  while divisor < x:
    if divisor > 1 and (x % count) == 0:
      return False
    divisor += 1
  return True

makoru-hikage

<?php

public function getChecklist($request, $response, $urlParams){

		$input = $request->getQueryParams();
		$input['student_number'] = $urlParams['student_number'];

		$output = (new MultipleReadModule ($input))
			->setRepository(new CentralRepository)
			->setModelService('DeltaX\Aegis\ModelServices\GradesRegistry\StudentChecklist')