You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Идея - валидировать данные, задавая путь к значению и проверющий предикат.
Проблема в том, что не понятно какой формат должен иметь отчет об ошибках.
Допустим, ошиибка в множестве, или в ключе мапы. Как указать путь к ошибочному значению?
Что потом с этим путем делать?
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Implement an efficient datastructure that allows FAST access to the nth datom of a datomic index.
This allows getting the "most recent post", "most popular post" etc.
;; API: to implement:
(nth-datoms db :avet:post/date2284) ;; == (drop 2284 (d/datoms ...))
(rdatoms db :avet:post/date50) ;; 50 last datoms of the index
(rdatoms-skip db :avet:post/date15050) ;; skip 150 datoms, get 50.
Visualizing the Iris with Principal Component Analysis
This post will teach you how to visualize higher dimensional datasets in lower dimensions using Principal Component Analysis. And guess what?! Its all in Clojure! I was inspired to write this because I was curious how
Principal Component Analysis worked, and there aren't a lot of data analysis resources out there for
Clojure.
Now that blog post was very informative on how to do Principal Component Analysis
(will be referring to this as PCA as well) in Clojure. However, when I decided to use it on a larger dataset I got an out of memory exception because the pca function incanter provides requires a matrix as input. The input matrix requires a lot of memory if the dataset is rather large. So I decided to write my own implementation which could calculate the covariance matrix with an input as a lazyseq. That way my input could be as big as I wanted. And learning
Quick and dirty code splitting with React Router v4
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Generate Firebase JWTs in Clojure (with buddy-sign)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Building an Agile, Maintainable Architecture with GraphQL
Building a Maintainable, Agile Architecture for Realtime, Transactional Apps
A maintainable application architecture requires that the UI only contain the rendering logic and execute queries and mutations against the underlying data model on the server. A maintainable architecture must not contain any logic for composing "app state" on the client as that would necessarily embed business logic in the client. App state should be persisted to the database and the client projection of it should be composed in the mid tier, and refreshed as mutations occur on the server (and after network interruption) for a highly interactive, realtime UX.
With GraphQL we are able to define an easy-to-change application-level data schema on the server that captures the types and relationships in our data, and wiring it to data sources via resolvers that leverage our db's own query language (or data-oriented, uniform service APIs) to resolve client-specified "queries" and "mutations" against the schema.