saurbhc

from __future__ import annotations

import requests
import datetime

def main() -> int:
    headers = {
        'User-Agent': 'Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:129.0) Gecko/20100101 Firefox/129.0',
        'Accept': 'application/json, text/plain, */*',
        'Content-Type': 'application/json',

saurbhc

#!/usr/bin/env bash

set -euxo pipefail

python -c 'import pkgutil;print([x[1] for x in list(pkgutil.iter_modules())])'

saurbhc

gg -> takes you to the top of the file
G   -> takes you to the bottom of the file 
{    -> goes down (skip) down a block of code
}    -> goes up (skip) down a block of code 

(Number) (command) -> will do that command that many times.
Example 50 } -> will take you down 50 blocks.
Example 50 { -> will take you up 50 blocks.
:(line-number) go to a specific line
Example :30 -> will take you to 30th line

saurbhc

git commit --date="1 day ago" -m "I commited yesterday, I swear"

saurbhc

# wget https://raw.githubusercontent.com/{org}/{repo}/{branch}/{filepath.../...}

# Example: (as different filename .gitignore)
wget https://raw.githubusercontent.com/github/gitignore/main/Python.gitignore -O .gitignore

saurbhc

echo "curl -s https://api.github.com/octocat" >> ~/.bash_profile

saurbhc

#!/bin/bash

MAC_copy(){
    cat | pbcopy
}

MAC_paste(){
    pbpaste
}

saurbhc

k_in_knn_value, number_of_vectors, from_vector, to_vector, euclidean_distance_df = get_input()

knn_obj = KNearestNeighborsAlgorithm(_k_in_knn_value=k_in_knn_value, _euclidean_distance_df=euclidean_distance_df)
knn_distance = knn_obj.execute()

print(f"""
>> {k_in_knn_value}-Nearest-Neighbours are: {knn_distance.head(k_in_knn_value).Label.tolist()}
>> Most Common Label is: {most_common(knn_distance.head(k_in_knn_value).Label.tolist())}
""")

saurbhc

def compute_euclidean_distance(self):
    return math.sqrt(
        sum(
            [(i - j) ** 2 for i, j in zip(self.from_vector_list, self.to_vector_list)]
        )
    )