harold | Compares frontend project bundles | Build Tool library

I use an online music player called "Netease Cloud Music", and I have multiple playlists in my account, they hold thousands of tracks and are very poorly organized and categorized and held duplicate entries, so I want to export them into an SQL table to organize them.

I have found a way to view the playlists without using the client software, that is, clicking the share button on top of the playlist page and then click "copy link".

But opening the link in any browser other than the client, the playlist will be limited to 1000 tracks.

But I have found a way to overcome it, I installed Tampermonkey and then installed this script.

Now I can view full playlists in a browser.

This is a sample playlist.

The playlists look like this:

The first column holds the songtitle, the second column holds the duration, the third column holds the artist, and the last column holds the album.

The text in the first, third and fourth columns are hyperlinks to the song, artist and album pages respectively.

I don't know a thing about html but I managed to get its data structure.

The thing we need is the table located at xpath //table/tbody, each row is a childnode of the table named tr(xpath //table/tbody/tr).

this is a sample row:

...

I am trying to learn Common Lisp with the book Common Lisp: A gentle introduction to Symbolic Computation. In addition, I am using SBCL, Emacs, and Slime.

In the middle of chapter 8, the author presents recursion on trees. He showcases this concept with a function on trees that inserts the symbol 'q in all non-list elements of the tree:

I did the same in my environment:

...

I need to convert a double array in c# to an IntPtr to properly send it to my c DLL. I have successfully been able to convert from IntPtr to double[,] using the method from this answer. Ive also found another answer that is close to what I need but deals with 1D arrays.

Im missing something in my logic and get the error code after a crash: Managed ' has exited with code -1073740940 (0xc0000374).

This is what I have so far

...

I wanted to group number of ids that are of length of 4, 5, 6 bytes based on the year.

ID year name location geo new_loc addr 1 addr 2 addr 3 addr 4 12345 2019 bob UK UK-4 basic dat1 dat11 dat13 dat123 19804 2004 sam US US-1 advanced dat2 dat21 dat23 dat233 19 2000 lister EU EU basic dat3 dat31 dat33 dat333 190838 2004 harold US US-3 basic dat4 dat41 dat53 dat533 11804 2019 beanie SK UK-2 advanced NULL NULL NULL NULL

Output

ID year name location new location num_of_ids_each_year 12345 2019 bob UK basic 2 11804 2019 beanie SK advanced 2 19804 2004 sam US advanced 2 190838 2004 harold US basic 2

What I tried:

...

Hello I need help with this program I have been doing, this is a program which will ask the user trivia questions and then count the users IQ, I managed to make the program ask the user the questions and then add a 1 to the list that is named 'IQ' when the user answers the question correctly, I then had the computer count how many ones there are in the list to check the score that the user got.

I then the next day tried to make it so that the program would make you input the answer again if you didn't input one of the specified answers and output a message asking to input your answer again.

I am fairly new to programming so any help or criticism would be appreciated.

...

I have a dataset for credit card transaction.

I split this dataset by group using below code

...

I'm writing a program that will simulate a randomized race between runners who are climbing up a mountain where dwarf orcs (dorcs) are coming down the mountain to attack the runners. It begins with two runners named harold and timmy at the bottom of the mountain. The runners make their way up the mountain in randomized moves where they may make progress forward up the mountain, or they may slide back down the mountain. Dorcs are randomly generated, and they inflict damage on a runner if they collide. The simulation ends when one of the runners reaches the top of the mountain, or when both runners are dead.

I'm struggling with a part where I have to implement the actual race loop. Once the race is initialized, the race loop will iterate until the race is over. This happens when either a winner has been declared, or when all runners are dead.

Every iteration of the race loop will do the following:

with 30% probability, dynamically allocate a new dorc as an EntityType structure, and initialize it as follows:

(a) a dorc’s avatar is always “d”

(b) each dorc begins the race at the top of the mountain, which is at row 2

(c) with equal probability, the dorc may be placed either in the same column as timmy, or in the same column as the harold, or in the column exactly half-way between the two

(d) add the new dorc to the race’s array of dorcs

(e) using the pthread_create() function, create a thread for the new dorc, and save the thread pointer in the dorc’s entity structure; the function that each dorc thread will execute is the void* goDorc(void*) function that you will implement in a later step; the parameter to the goDorc() function will be the EntityType pointer that corresponds to that dorc

I guess I'm confused with the logic of how to approach this. I decided to make a function called isOver() to indicate if the race is over, and then a separate function called addDorc() to initialize the Dorc elements and do all the requirements above.

In isOver(), I attempt to add a dorc object to the dorcs array by doing addDorc(race); with every iteration of the race loop/if the race hasn't ended or no one died. But I keep getting the error:

...

Normally I would use a CSS page, but i don't think i can do that with canvas :(

...

I'm relatively new to python, and am a bit confused with finding an int max/min value with a sublist. Example below

Firstly, the data set im using is a list with lists as elements. It looks like - [[John, Smith, 15], [Yu, Harold, 16]] etc.. Im having trouble getting just the INT as the max or min value from the list. I have tried the following

...