generate functionFri, 21 Jul 2023
add 2
function add2(a) {
return a + 2
}
add(1)
Javascript
View
fabi.s
All generations.
generate functionThu, 20 Jul 2023
add 2
function add_two(a) {
return a + 2;
}
add_two(1)
Javascript
Viewgenerate functionSat, 05 Nov 2022
get date
func getDate() -> String {
let date = Date()
let calendar = Calendar.current
let year = calendar.component(.year, from: date)
let month = calendar.component(.month, from: date)
let day = calendar.component(.day, from: date)
return "\(month)/\(day)/\(year)"
}
getDate()
Swift
Viewgenerate functionSat, 05 Nov 2022
add two numbers
int add(int a, int b) {
return a + b;
}
add(1, 2);
C
Viewgenerate functionTue, 06 Jun 2023
js that adds a spinning h1 in light pruple with a long text
function addHeader(text) {
const header = document.createElement('h1');
header.style.color = 'lightpruple';
header.style.animation = 'spin 1s infinite linear';
header.innerHTML = text;
document.body.appendChild(header);
}
Javascript
Viewgenerate functionFri, 25 Nov 2022
quicksort
def quicksort(arr):
if len(arr) <= 1:
return arr
pivot = arr[len(arr) // 2]
left = [x for x in arr if x < pivot]
middle = [x for x in arr if x == pivot]
right = [x for x in arr if x > pivot]
return quicksort(left) + middle + quicksort(right)
print(quicksort([3,6,8,10,1,2,1]))
Python
ViewlinuxFri, 25 Nov 2022
move all images from my downloads folder to my desktop, if a file is bigger than 10mb delete it
for i in ~/Downloads/*.png; do mv $i ~/Desktop/; done
find ~/Downloads/ -size +10M -delete
generate functionSat, 05 Nov 2022
add two numbers
def add(a, b):
return a + b
add(1, 2)
Python
ViewdocstringFri, 25 Nov 2022
def quicksort(arr): if len(arr) <= 1: return arr pivot = arr[len(arr) // 2] left = [x for x in arr if x < pivot] middle = [x for x in arr if x == pivot] right = [x for x in arr if x > pivot] return quicksort(left) + middle + quicksort(right)
def quicksort(arr):
"""Returns the sorted array."""
if len(arr) <= 1:
return arr
pivot = arr[len(arr) // 2]
left = [x for x in arr if x < pivot]
middle = [x for x in arr if x == pivot]
right = [x for x in arr if x > pivot]
return quicksort(left) + middle + quicksort(right)
linuxFri, 25 Nov 2022
move all images from the download folder into a new folder called pictures on my desktop
mv ~/Downloads/*.jpg ~/Desktop/pictures
generate functionSat, 05 Nov 2022
add two numbers
function add(a,b){
return a + b
}
add(1,2)
TypeScript
Viewgenerate functionSat, 05 Nov 2022
add two numbers
public static int add(int a, int b) {
return a + b;
}
add(1, 2);
Java
Viewgenerate functionSat, 05 Nov 2022
nodejs async main function
async function main() {
const add = (a, b) => a + b
return add(1, 2)
}
main().then(console.log)
Javascript
ViewlinuxFri, 25 Nov 2022
remove all files from ym download folder that are bigger than 10mb
find ~/Downloads/ -size +10M -delete
generate functionSat, 05 Nov 2022
add two numbers
fn add(a: i32, b: i32) -> i32 {
a + b
}
add(1, 2)
Rust
Viewgenerate functionThu, 03 Aug 2023
add 2
function add(a, b){
return a + b;
}
add(1, 2)
Javascript
ViewlinuxFri, 25 Nov 2022
move all mp3 files from my download folder into my music folder, excluse files that have a shorter duration than 1 minute
bash
for i in ~/Downloads/*.mp3; do
dur=$(ffmpeg -i "$i" 2>&1 | grep "Duration"| cut -d ' ' -f 4 | sed s/,//)
hour=$(echo $dur | cut -d ':' -f 1)
min=$(echo $dur | cut -d ':' -f 2)
sec=$(echo $dur | cut -d ':' -f 3)
if ((min>0)) || ((hour>0)); then
cp "$i" ~/Music/
fi
done
linuxFri, 25 Nov 2022
move all mp3 files from my download folder into my music folder, excluse files that have a shorter duration than 1 minute
find /home/abdelrahman/Downloads/ -name '*.mp3' -exec ffprobe -i {} -show_entries format=duration -v quiet -of csv="p=0" > /tmp/test.txt \; -exec bash -c 'if [ $(cat /tmp/test.txt) > 60 ]; then echo $(cat /tmp/test.txt) && mv {} /home/abdelrahman/Music/; fi' \;
docstringFri, 25 Nov 2022
def quicksort(arr): if len(arr) <= 1: return arr pivot = arr[len(arr) // 2] left = [x for x in arr if x < pivot] middle = [x for x in arr if x == pivot] right = [x for x in arr if x > pivot] return quicksort(left) + middle + quicksort(right)
def quicksort(arr):
"""
Sorts an array with quicksort algorithm.
"""
if len(arr) <= 1:
return arr
pivot = arr[len(arr) // 2]
left = [x for x in arr if x < pivot]
middle = [x for x in arr if x == pivot]
right = [x for x in arr if x > pivot]
return quicksort(left) + middle + quicksort(right)
generate functionSat, 05 Nov 2022
add two numbers
func add(a: Int, b: Int) -> Int {
return a + b
}
add(a: 1, b: 2)
Swift
Viewgenerate functionTue, 16 Jan 2024
bubblesort
bubblesort(lst):
for i in range(len(lst) - 1):
for j in range(len(lst) - i - 1):
if lst[j] > lst[j + 1]:
lst[j], lst[j + 1] = lst[j + 1], lst[j]
def main():
lst = [random.randint(0, 100
Go
ViewgitSat, 05 Nov 2022
revert commit
git revert HEAD
generate functionThu, 20 Jul 2023
add 2
function add(a, b) {
return a + b
}
add(1,2)
Javascript
Viewcode to explanationThu, 20 Jul 2023
const techFromSlug = context.query.tecchunks = [] while len(text) > 500: last_period_index = text[:500].rfind('.') if last_period_index == -1: last_period_index = 500 chunks.append(text[:last_period_index]) text = text[last_period_index+1:] chunks.append(text)h.slice(-1)[0];
** Blog post data here **
---
`
const createPost = ({ posts, postsDirectory }) => {
return new Promise((resolve, reject) => {
const slug = nanoid()
// create post
const post = {
id: slug,
content,
title,
date,
tags
}
// write post to posts directory
fs.writeFile(
path.join(postsDirectory, `${slug}.json`),
JSON.stringify(post, null, 2),
error => {
if (error) {
reject(error)
} else {
// add post to posts array
posts.push(post)
// write updated posts array to db.json
fs.writeFile(
path.join(dataDirectory, 'db.json'),
JSON.stringify({ posts }, null, 2),
error => {
if (error) {
reject(error)
} else {
resolve(post)
}
}
generate functionFri, 04 Nov 2022
console log hello
public void Main()
{
Console.WriteLine("Hello");
}
C#
Viewgenerate functionThu, 20 Jul 2023
add 2
function add(a, b) {
return a + b
}
add(1, 2)
Javascript
Viewcode to explanationMon, 10 Jul 2023
const techFromSlug = context.query.tecchunks = [] while len(text) > 500: last_period_index = text[:500].rfind('.') if last_period_index == -1: last_period_index = 500 chunks.append(text[:last_period_index]) text = text[last_period_index+1:] chunks.append(text)h.slice(-1)[0];
keeps the last object in the array `chunks`
### if you want to add a new article
- create a folder with the name of the article in the directory `techarticles`
- add an index.mdx with the content of the article
### if you want to add a new tutorial
- create a folder with the name of the tutorial in the directory `techtutorials`
- add an index.mdx with the content of the tutorial
## contact
You have a question, would like to comment on something or just want to say hi?
Visit [my twitter](https://twitter.com/paul_lilljedahl)
generate functionSat, 05 Nov 2022
add two numbers
func add(a, b int) int {
return a + b
}
add(1, 2)
Go
ViewlinuxFri, 25 Nov 2022
move all images from my downloads folder to my desktop, if a file is bigger than 10mb delete it
for file in ~/downloads; do
if [[ file -ge 10mb ]]; then
mv "$file" ~/desktop
rm "$file"
fi
done
linuxFri, 04 Nov 2022
create a new folder
mkdir test
linuxFri, 25 Nov 2022
move all files from current directory into my music folder, exclude all files with the name michael jackson in it
mv * ~/Music/ -not -name '*michael*' -not -name '*jackson*'
generate functionSat, 05 Nov 2022
nodejs async main function
function async_main() {
var args = process.argv.slice(2);
let [file_name, ...file_paths] = args;
fs.readFile(file_name, (err, data) => {
if (err) throw err;
let new_data = data.toString();
for (let fp of file_paths) {
console.log(new_data.replace("world", fp));
}
})
}
Javascript
Viewgenerate functionMon, 10 Jul 2023
js that adds a spinning h1 in light pruple with a long text
function addSpinningHeader(){
let header = document.createElement("h1")
header.innerText = "I'm a spinning header"
header.style.color = "purple"
header.style.animation = "spin infinite 2s linear"
document.body.append(header)
}
Javascript
Viewgenerate functionSat, 05 Nov 2022
nodejs async main function
export async function main(event, context) {
// ...
}
Javascript
Viewgenerate functionSat, 05 Nov 2022
get 5 random objs from array
function rand(arr) {
return arr[Math.floor(Math.random() * arr.length)];
}
rand([1,2,3,4,5])
Javascript
Viewgenerate functionSat, 05 Nov 2022
add two numbers
def add(a:Int, b:Int):Int = {
a + b
}
add(1, 2)
Scala
Viewgenerate functionSat, 05 Nov 2022
add two numbers
function add(a, b) {
return a + b
}
add(1, 2)
Javascript
Viewgenerate functionThu, 03 Nov 2022
get date for now like this format: 2021-02-01
import datetime
def get_date():
now = datetime.datetime.now()
return now.strftime("%Y-%m-%d")
get_date()
Python
Viewgenerate functionSat, 05 Nov 2022
nodejs async main function
async function main() {
return "Hello World!"
}
Javascript
ViewregexFri, 25 Nov 2022
check string for valid email
^[\w\-\.\+]+\@[a-zA-Z0-9\.\-]+\.[a-zA-z0-9]{2,4}$
generate functionSat, 05 Nov 2022
get random obj from array
function getRandomItem(arr) {
let length = arr.length;
const randomIndex = Math.floor(Math.random() * length);
return arr[randomIndex];
}
Javascript
Viewfix invalid codeThu, 20 Jul 2023
hi
def add(a, b):
return a + b
generate functionSat, 05 Nov 2022
add two numbers
function add($a, $b) {
return $a + $b;
}
add(1, 2);
PHP
Viewgenerate functionThu, 20 Jul 2023
add 2
function add(a, b){
return a + b
}
add(1, 2)
Javascript
Viewgenerate functionSat, 05 Nov 2022
get 5 random objs from array
func randomObjs(objs []interface{}) []interface{} {
n := 5
if n > len(objs) {
n = len(objs)
}
newObjs := make([]interface{}, n)
for i := 0; i < n; i++ {
rand.Seed(time.Now().UnixNano())
newObjs[i] = objs[rand.Intn(len(objs))]
}
return newObjs
}
Go
ViewlinuxFri, 25 Nov 2022
move all mp3 files from current directory to my music folder, exclude files that have michael jackson in the name
mv *.mp3 ~/Music/
code to explanationFri, 25 Nov 2022
def bubbleSort(arr): n = len(arr) swapped = False for i in range(n-1): for j in range(0, n-i-1): if arr[j] > arr[j + 1]: swapped = True arr[j], arr[j + 1] = arr[j + 1], arr[j] if not swapped: return arr = [64, 34, 25, 12, 22, 11, 90] bubbleSort(arr)
Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.
generate functionSat, 05 Nov 2022
add two numbers
int add(int a, int b){
return a+b;
}
int main(){
int a = 1;
int b = 2;
add(a, b);
}
C++
View
