Copy
1f0314a4-8aab-4e0f-926f-2f00a8e93e02.png
Issue #190 - January 18, 2019

Anybody has any suggestion for how to buy a parked website? I'm interesting in purchasing humanreadable.com but I can't seem to find the owner. Site says its parked with VentralIP Australia but I need to do a WHOIS to find owner. WHOIS says Synergy. But then Synergy says it's owned by VentralIP? Not sure what's happening. Also tried DomainAgents.com with no success. Any other ideas? Thanks in advance.

-pek

Articles

Fancy Tree Traversals

(Jan 02) #algorithms

Most of you should be familiar with trees. They are used everywhere. A simple traversal algorithm involves stacks, whether directly or indirectly via recursion. And typically the complexity of traversal is tied to the tree's size. But what if the data structure is designed to make traversing fast? In this article by Davis Ross Silverman we look at two such examples: Threaded and Link Inversion.

How Azure SQL DB Hyperscale Works

(Jan 02) #databases

One way of scaling your database is to separate your SQL Server from its storage and transaction system. That way, even if the server fails for one reason or another, the intent to write to the database is still in the transaction log, which is carried out by the separate system while the failed server is spun up again. This is in essence what Microsoft's Azure SQL DB Hyperscale does and Brent Ozar goes into a lot more details.

Using TypeScript transforms to enrich runtime code

(Jan 02) #typescript

Babel has enabled a plethora of new JavaScript languages (dialects?) by opening the JS parser. Up until now, Typescript was not one of them, so developers had to choose either Babel and supported languages, or TypeScript. This changed recently by the introduction of TypeScript Transforms. In this article Florian Rappl goes through the motivations behind this feature, how it works and what it does.



Programming language of the day: F*. "F* (pronounced F star) is a general-purpose functional programming language with effects aimed at program verification. It puts together the automation of an SMT-backed deductive verification tool with the expressive power of a proof assistant based on dependent types. After verification, F* programs can be extracted to efficient OCaml, F#, or C code. This enables verifying the functional correctness and security of realistic applications. The main ongoing use case of F* is building a verified, drop-in replacement for the whole HTTPS stack in Project Everest."


And that's it for today! Discuss this issue at our subreddit r/morningcupofcoding.

Did you like what you read? Let us know by clicking one of the links below.

Liked - Disliked

I hope you enjoyed reading the latest issue of Morning Cup of Coding. If you did, consider supporting it by becoming a patron (Patreon), buying me a coffee (PayPal), donating anonymously (coinbase), or purchasing an MCC mug (RedBubble); it helps me keep this going.

Cheers,
Pek

Copyright © 2019 Human Readable Publications, All rights reserved.


Want to change how you receive these emails?
You can update your preferences or unsubscribe from this list.