terracotta VS javascript-algorithms

One can also do raster calculus between two or more COGs with Terracotta: https://github.com/DHI-GRAS/terracotta/issues/221

I am currently working on setting up a web app using leaflet that can display .tif images along with some polygons and add some filters in the web app to better interact with the data. In the process of implementing this, I came to know that I need to use a tile server because I have large amounts of data and the tile server can help to serve the tiles on the web app. Based on my research, I guess these two are the main tools as of now: 1. Geoserver and 2. Terracotta. I am confused between the two. Can anyone suggest which one would be better for my use case and the pros and cons of both if possible? In case there's a different one that's better than the two mentioned above, it would be great if you can share the tool and your experience. Would be helpful.

Terracotta: Serverless GeoTiff Tile Server\ (12 comments)

I'm reminded of the time when some kid wrote a script to crawl GitHub and create issues[1] about using inclusive language... except it was really dumb, for example: https://github.com/trekhleb/javascript-algorithms/pull/875/f...

[1] E.g.: https://github.com/EbookFoundation/free-programming-books/pu...

Try codewars or leetcode Or you can use this repo for ds practice https://github.com/trekhleb/javascript-algorithms

This one is pretty popular too.

for algos - not sure how much you'll need to do for a jr position but familiarity with some of the beginner stuff here couldn't hurt: https://github.com/trekhleb/javascript-algorithms

Traditionally, a linked list allows you to insert before/after a node. i.e. addBefore(node,value) (see [2] ) He doesn't implement addBefore & addAfter.

Instead, he provides a whole bunch of non-canonical helpers like reverse(), toArray(), deleteTail() etc - these are typical LC-Easy problems that don't belong inside the data structure.

My own introduction to these things was a C course called "Data Structures in C" in the traditional CS curriculum, and yes, you would have to malloc a new node, get back a pointer with a memory address, & the process of pointing the next pointer of the current node to this new node so that the memory address of the next value was explicitly "linked" to the current value and hence linked list etc...I guess much of that terminology is lost on the new generation in the absence of pointers & memory addresses.

The canonical exercise in those days was - Show that a linked list does not store objects in contiguous memory, unlike an array. So to solve this, you would traverse the list from the head node & print the actual addresses of the memory locations along the way, proving that the vals aren't stored contiguously. I wonder what that exercise would mean in JS land.

That said, yeah its a good starting point & I applaud the effort.

[1]https://github.com/trekhleb/javascript-algorithms/blob/maste...