MihailJP

--- gitup.py.orig       2023-08-19 22:19:24.904702800 +0900
+++ gitup.py    2024-06-08 23:33:47.171299400 +0900
@@ -33,6 +33,7 @@
 import colorama
 from git import Repo, GitCmdObjectDB
 from termcolor import colored
+from git.exc import NoSuchPathError

 # PyGitUp libs
 from PyGitUp.utils import execute, uniq, find

MihailJP

\ This implements Euclidean algorithm in Forth
: gcd ( X Y )
	2dup <= if swap ( Y X ) then
	( X Y )
	begin
		tuck ( Y X Y )
		mod ( Y Z )
		dup ( Y Z Z )
	0= until ( Y Z )
	( Y 0 )

MihailJP

#include <stdexcept>

template<typename T> T modulo(T dividend, T divisor) {
    if (divisor == static_cast<T>(0)) // division by zero is not allowed
        throw std::domain_error("division by zero");
    if (dividend < static_cast<T>(0)) // dividend is negative
        return -((-dividend) % (-divisor));
    else // dividend is non-negative
        return dividend % divisor;
}

MihailJP

%define     groovy_root_dir /usr/share

Name:           groovy
Version:        2.2.2
Release:        1%{?dist}
License:        See: http://groovy.codehaus.org/license.html
BuildRoot:      %{_tmppath}/%{name}-%{version}-build
Group:          Development/Languages/Groovy
Summary:        Contains the base system for executing groovy scripts.
Source:         http://dist.codehaus.org/groovy/distributions/groovy-binary-%{version}.zip

MihailJP

function gcd(a, b)
    local x = a; local y = b
    repeat
        if x > y then
            x = math.fmod(x, y)
        else
            y = math.fmod(y, x)
        end
    until x == 0 or y == 0
    return x + y

MihailJP

#!/bin/bash

# Script to control the fan speed automatically

setFanSpeed() {
	eval "nvidia-settings -a GPUFanControlState=1 -a [fan:0]/GPUCurrentFanSpeed=$1 > /dev/null"
}

cleanup() {
	eval "nvidia-settings -a GPUFanControlState=0"

MihailJP

-- Functions for statistics

import Data.List

-- Averages
average p = (sum p) / (fromIntegral $ length p) -- arithmetic mean
geomean p = (product p) ** (1.0 / (fromIntegral $ length p)) -- geometric mean
harmean p = (fromIntegral $ length p) / (sum $ map (\x -> 1.0 / x) p) -- harmonic mean
rms     p = sqrt $ average $ map (\x -> x * x) p -- quadratic mean (RMS)

MihailJP

#include <time.h>
signed long getTZ ()
{
    struct tm* timeStruct;
    time_t timeValBase = 86400; /* I know an implementation in which time_t is unsigned */
    time_t timeVal;

    timeStruct = gmtime(&timeValBase); /* parse as the universal time */
    timeVal = mktime(tp); /* intentionally treat as the local time in order to find the time zone */

MihailJP

<NotepadPlus>
    <UserLang name="Scala" ext="scala" udlVersion="2.0">
        <Settings>
            <Global caseIgnored="no" allowFoldOfComments="no" forceLineCommentsAtBOL="no" foldCompact="no" />
            <Prefix Keywords1="no" Keywords2="no" Keywords3="yes" Keywords4="no" Keywords5="no" Keywords6="no" Keywords7="no" Keywords8="no" />
        </Settings>
        <KeywordLists>
            <Keywords name="Comments" id="0">00// 01 02 03/* 04*/</Keywords>
            <Keywords name="Numbers, additional" id="1"></Keywords>
            <Keywords name="Numbers, prefixes" id="2">0x</Keywords>

MihailJP

#pragma once

#include <stdexcept>

// Calculate GCD (for reduction)
template<typename T> T gcd(T x, T y) {
	// Euclidean algorithm
	T val1 = (x < y) ? y : x, val2 = (x < y) ? x : y;
	T* m = &val1; T* n = &val2; T* tmpptr = nullptr;
	while (true) {