Meta tags:
description=;

Headings (most frequently used words):

where, the, any, key, aok, categorically, fun, ris, how, to, run, bar, surfing, with, clojure, about, lazy, dfs, bfs,

Text of the page (most frequently used words):
the (30), and (15), that (9), with (8), for (7), from (6), 2020 (6), you (6), vertex (5), about (5), are (5), would (5), what (5), how (5), reachable (4), any (4), have (4), where (4), lazy (4), sequences (4), bfs (3), all (3), like (3), dfs (3), #clojure (3), not (3), here (3), some (3), code (3), was (3), been (3), something (3), using (2), given (2), graph (2), edges (2), breadth (2), first (2), tree (2), root (2), vertices (2), path (2), may (2), finding (2), used (2), things (2), run (2), structure (2), which (2), will (2), times (2), entirely (2), one (2), such (2), this (2), can (2), write (2), need (2), being (2), fit (2), working (2), bit (2), july (2), topics (2), look (2), remember (2), want (2), surf (2), those (2), bar (2), order (2), miller (2), lite (2), there (2), bartender (2), mistake (2), 2021 (2), our (2), december (2), essence (2), function (2), maybe (2), key (2), made, theme, tale, hugo, 2026, distinguished, explores, discover, every, computes, distance, smallest, number, each, produces, contains, corresponds, shortest, useful, cycles, often, step, process, topological, sorts, demonstrated, below, strongly, connected, components, generally, learn, unlike, ordinarily, seeded, single, iterate, over, discovered, finished, parenthesis, intervals, either, disjoint, contained, within, other, most, sequence, functions, map, range, filter, others, return, methods, take, advantage, normally, reach, loops, benefits, typically, associated, only, calculating, when, ever, able, represent, infinite, memory, after, them, add, attempt, out, into, mostly, help, future, practice, writing, coding, examples, largely, focused, computations, they, perform, friendly, naming, expect, real, think, algo, book, psudo, also, fair, game, musings, random, xavier, honored, present, north, due, covid, ended, virtual, conference, but, blast, nonetheless, organizers, did, fantastic, job, pulling, together, talk, centered, around, application, spare, time, call, deepswell, allows, better, visualize, forecast, local, area, basic, idea, continually, monitor, record, forecasts, provided, noaa, well, video, snippets, cams, surfing, september, market, makers, work, incomplete, draft, imagine, man, looks, beer, notices, strange, written, next, wants, two, prices, asks, kind, special, perhaps, menu, answers, costs, april, playing, lot, risk, family, recently, got, wondering, chances, success, per, battle, internet, says, following, might, generate, these, results, own, simulated, dice, throws, battles, because, toy, problems, quite, math, let, use, kona, precise, allow, terse, almost, point, having, executable, formulae, define, problem, ris, answer, someone, asked, talking, programming, does, compound, operation, name, bill, parameters, output, side, effects, subprogram, even, just, dictionary, has, always, unsettling, grounding, definition, categorically, fun, january, 2023, helping, advent, elves, kdb, aok, 2025,

Text of the page (random words):
where s the any key where s the any key about december 19 2025 aok helping the advent of code elves with kdb january 1 2023 categorically fun how would you answer if someone asked in essence what is a function we re talking programming here how does something like a compound operation that can be given a name fit the bill maybe something about parameters or output or side effects or maybe how it s a subprogram or even just a dictionary it has always been a bit unsettling for me not to have some grounding definition of what a function is in it s essence december 5 2021 ris k i have been playing a lot of risk with my family recently and got to wondering what the chances of success are per battle the internet says the following what might it look like to generate these results on our own using simulated dice throws and battles because this is one of those toy problems that is quite math y let s use k or kona to be precise it will allow us to be terse almost to the point of having executable formulae that define our problem april 10 2021 how to run a bar how market makers work incomplete draft imagine a man in a bar he looks up to order a beer and notices something strange written next to the miller lite he wants to order there are two prices 3 00 and 3 10 he asks the bartender if there some kind of special or perhaps a mistake on the menu no mistake the bartender answers if you want a miller lite it costs 3 september 26 2020 surfing with clojure i was honored to present at clojure north 2020 due to covid 19 it ended up being a virtual conference but was a blast nonetheless as the organizers did a fantastic job pulling it all together the talk was centered around an application that i have been working on in my spare time which i call deepswell that allows me to better visualize the surf forecast for my local area the basic idea is to continually monitor and record the forecasts provided by noaa as well as video snippets from the surf cams for those times july 3 2020 about here an attempt to write out some of the topics i look into mostly to help future me remember and to practice writing as such any coding examples are largely focused on the computations they perform and not friendly naming as you would expect in real code think an algo book s psudo code also fair game here would be musings about random topics and things i want to remember me hi i m xavier july 3 2020 lazy most sequence functions in clojure such as map range filter and others return lazy sequences this can be used to write methods that take advantage of lazy sequences where you would normally reach for loops the benefits typically associated with lazy sequences are only calculating what you need when you need it if ever being able to represent infinite sequences that would not fit in memory after working with them a bit i d add may 8 2020 dfs useful for finding cycles and is often used as step in the process for things like topological sorts as demonstrated below and finding strongly connected components dfs is generally run to learn about a graph s structure and unlike bfs which is ordinarily seeded with a single root vertex dfs will iterate over all vertices the discovered and finished times have a parenthesis structure where the intervals d u f u and d v f v are either entirely disjoint or one is entirely contained within the other may 3 2020 bfs given a graph g v e and a distinguished vertex s bfs explores the edges of g to discover every vertex that is reachable from s it computes the distance smallest number of edges from s to each reachable vertex it produces an breadth first tree with root s that contains all reachable vertices for any vertex v reachable from s the path in the breadth first tree from v to s corresponds to a shortest path from v to s in g 1 2026 made with hugo using the tale theme