| /^(#?([a-f\d]{3,4}|[a-f\d]{6}|[a-f\d]{8})|rgb\((0|255|25[0-4]|2[0-4]\d|1\d\d|0?\d?\d),(0|255|25[0-4]|2[0-4]\d|1\d\d|0?\d?\d),(0|255|25[0-4]|2[0-4]\d|1\d\d|0?\d?\d)\)|rgba\((0|255|25[0-4]|2[0-4]\d|1\d\d|0?\d?\d),(0|255|25[0-4]|2[0-4]\d|1\d\d|0?\d?\d),(0|255|25[0-4]|2[0-4]\d|1\d\d|0?\d?\d),(0|0?\.\d|1(\.0)?)\)|hsl\((0|360|35\d|3[0-4]\d|[12]\d\d|0?\d?\d),(0|100|\d{1,2})%,(0|100|\d{1,2})%\)|hsla\((0|360|35\d|3[0-4]\d|[12]\d\d|0?\d?\d),(0|100|\d{1,2})%,(0|100|\d{1,2})%,(0?\.\d|1(\.0)?)\))$/ |
State machines are everywhere in interactive systems, but they're rarely defined clearly and explicitly. Given some big blob of code including implicit state machines, which transitions are possible and under what conditions? What effects take place on what transitions?
There are existing design patterns for state machines, but all the patterns I've seen complect side effects with the structure of the state machine itself. Instances of these patterns are difficult to test without mocking, and they end up with more dependencies. Worse, the classic patterns compose poorly: hierarchical state machines are typically not straightforward extensions. The functional programming world has solutions, but they don't transpose neatly enough to be broadly usable in mainstream languages.
Here I present a composable pattern for pure state machiness with effects,
| type FilterOperator = 'AND' | 'OR'; | |
| type FiltersBy<T> = { | |
| [K in keyof T]?: (value: T[K]) => boolean; | |
| }; | |
| /** | |
| * Factory function that creates a specialized function to filter | |
| * arrays, by validating all filters (AND operator), | |
| * or validating just one of the filters (OR operator). | |
| * @param operator Method to validate all filters: AND, OR |
| /* Implementation of lodash.get function */ | |
| function getProp( object, keys, defaultVal ){ | |
| keys = Array.isArray( keys )? keys : keys.split('.'); | |
| object = object[keys[0]]; | |
| if( object && keys.length>1 ){ | |
| return getProp( object, keys.slice(1) ); | |
| } | |
| return object === undefined? defaultVal : object; | |
| } |
| // Because we're using an ORM (Objection), it's a pain to add a tsvector when inserting, | |
| // since tsvectors and FTS aren't supported by Objection. Instead, I've added a hook that | |
| // fires on insert which auto-generates the tsvector field for each newly inserted entry. | |
| // This is an example knex migration file for said behavior. | |
| const addUserIndex = ` | |
| ALTER TABLE public.user ADD "document" tsvector; | |
| CREATE FUNCTION my_trigger_function() | |
| RETURNS trigger AS $$ |
This fork of JamieMason's implementation changes the key parameter to be an array of keys instead of just a single key. This makes it possible to group by multiple properties instead of just one.
const groupBy = keys => array =>
array.reduce((objectsByKeyValue, obj) => {
const value = keys.map(key => obj[key]).join('-');
| /** | |
| * Creates a flatten object from an any level nested object. | |
| * | |
| * @example | |
| * | |
| * Create following object: | |
| * | |
| * { | |
| * 'address.city.name': 'São Paulo', | |
| * 'address.state.name': 'SP', |
| /** | |
| * Challenge: given a list of icon names, find icons that exist in sizes 16x16px *and* 24x24px. | |
| * This is an AND relationship, not an OR relationship. | |
| * | |
| * The solution should be: '16-hamburger' | '16-warning' | '24-hamburger' | '24-warning'. | |
| */ | |
| type IconName = | |
| | '16-hamburger' // 👈🏻 | |
| | '16-warning' // 👈🏻 | |
| | '16-foo' |