this is my first "serious" software project. I wanted to build a scaping-API for the website 1001tracklists.com.
I realized that by writing classes for Tracklist and Track objects and some helpful functions:
The full code can be found here: Github
Here's a readme with some basic examples: Gith...
I have implemented SegmentBisect for 1D segments. Given a list of 1D segments, it constructs a data-structure that defines the excluded regions on the x-axis.
I have some difficulty to extend/use SegmentBisect to create a class that can fast find if a rectangle in the x-y space intersects an ap...
I am passing single image to redis server and once the process gets over immediately the image should be removed from the queue. Here base64_decode_image is a function to decode the bytes, tesseract is a function, and so on.
My code
db = redis.StrictRedis(host=settings.REDIS_HOST,
port=sett...
Following the method suggested here, I've written a Python script that generates random points along the perimeter of an ellipse. I wanted to compare the "naive" method (which fails to produce an even distribution) with the correct method, which works like this:
Numerically compute P, the perim...
I worte this code for finding, substituting and executing values in dictionary, much like $() bash operator works.
I used nested functions for this, forming hierarchy and encapsulating their names.
But now I'm concern, that this may be an overhead in reading ease and unit tesing now
sucks, becau...
I am fairly new to Golang and I was creating an API to fetch commits from any Github repository using their API. I was then creating a frequency count, based on the date and then sending it to the frontend.
Currently, I only work in one main.go and I am not very aware of the programming pracice...
I'm new to web development, and currently learning the basics of HTML and CSS. Many web pages follow the structural pattern of header, main, and footer; so I figured it'd be a good idea to try and implement this structure to see how things are carved.
This is my attempt:
body {
display: f...
I tried my hands on Rock-Paper-Scissors. But the twist is that the game has a brain that aims to learns your behaviour.
The brain is a simple counter that updates the player's current choice based on players previous choices. The level determines the number of previous choices cpu will remember....
Is there a way I could simplify this with Sass or JS? It works, but it's not what I'd call 'DRY' code. I've tried a Sass for loop but can't get it to work.
h1 {
margin-top: 10px;
opacity: 1;
color: black;
font-size: 55px;
-webkit-background-clip: text;
text-shadow: 1px 1px 5px rg...
I want to implement in openMP a loop that terminates when a certain condition holds. In serial code the function body would simply be
for(; begin < end; ++begin)
if(pred(begin))
return true;
return false;
The openMP version may differ in two respects: (1) concurrent function calls ...
def checkPeq[A,B](list1: List[(A, List[B])])( P: (A,B) => Boolean): List[Boolean] = {
def helper[A,B](list2: List[(A, List[B])], list3: List[B], acc1: Boolean, acc2: List[Boolean])(leq:(A,B) => Boolean): List[Boolean] = {
list2 match {
case h1::t1 => {
list3 match...
> def dog(x):
> for 'dog' in x.lower().split():
> return 'true'
Why does this not work? I created a function. and for every letter of dog it should return true.
There are two ways of generating random numbers. What is the difference between two, and best use cases?
import random
t = random.SystemRandom()
print(t.randint(0, 10e4)
import secrets
k = secrets.SystemRandom()
print(k.randint(0, 10e4)
I'm currently trying to learn how to use await/async functions. Could anyone offer any thoughts on how to improve this function which uses await inside a for loop?
I think the task would run in parallel if I could figure out how to write each row asynchronously, but haven't been able to make it ...
I have a long string S. There are also given an empty string P and Q. Only two operations can be done on the given string S :
1. Remove the first letter from S and append it to P.
2. Remove the last element from P and append it to Q.
we have to make Q to be the lexicographically smallest possibl...
I wrote a simple transpiler (that may be a bit of a stretch) in perl to cut down on some boiler plate code.
I'm very new to perl, this being maybe my third ever project in it. My main question would be to ask for feedback on my regular expressions and making it more open to expansion (adding erro...
I want to input a name in a string and afterwards define it
This is the code I started:
a = input('')
a1 = ['......', '...', .....]
b = [' ']
c = " ".join(a.split())
for word in b:
d = c.replace(word, '_'[b.index(word)])
I would like that this code will generate a piece of code in another ...
Bitbucket link to repo
Tutorial I have been following
I decided to make a raycaster app and try to understand how it really works. So far so good, I have it up and running. If you download the source and execute make, it should pop out a test.exe. I am developing on Ubunutu using Windows Subsys...
I was told that it is bad horrible practice to have nested if statements like this, but I thought about it, and I am not sure how to simplify it in a way that will work.
if (!ConfigFile) {
if (CheckDir(GameDir, (void*)GetHomeDirectory)) {
ConfigFile = fopen(ConfigPath, "w");
} el...
Given a CSS file the script generates an HTML preview of all the CSS definitions by recursively drilling down the chain of nested classes, ids and tag names. Rules with position: absolute|fixed|sticky are wrapped into iframe elements in order to avoid overlap.
The output goes to stdout since I ...
I have the below implementation of the BFS algorithm, in which I've used OrderedDict instead of a list or set to preserve the order of visited vertices. Is this an efficient implementation and any suggestions for improvements?
import collections
def bfs_iterative(graph, vertex):
visited = c...
In working on this answer it occurred to me that it might be interesting to further expand the idea.
The game
This is an extremely simple (and boring!) text-based game that creates a few monsters which attack the player and which the player can attack. The goal is for player to defeats all of ...
