Joe Crick joe-crick
joe-crick
/ default.css
Created
September 25, 2018 08:19
This file contains hidden or 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
| :root { | |
| /* COLORS */ | |
| /* Alerts */ | |
| --alert-red: maroon; | |
| --warning-yellow: darkyellow; | |
| --success-green: green; | |
| --error-red: red; |
This file contains hidden or 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
| { | |
| "locale":"de", | |
| "messages":{ | |
| "common":{ | |
| "more":"{count} weitere anzeigen", | |
| "confirmButton":"Bestätigen", | |
| "genericError":"Ein Fehler ist aufgetreten. Bitte versuchen Sie es erneut.", | |
| "proceed":"Weiter", | |
| "cancel":"Abbrechen", | |
| "save":"Speichern", |
joe-crick
/ cljs-get-books.cljs
Last active
September 7, 2018 12:44
This file contains hidden or 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
| ;; with parens | |
| (defn symmetrize-body-parts | |
| "Expects a seq of maps that have a :name and :size" | |
| [asym-body-parts] | |
| (loop [remaining-asym-parts asym-body-parts | |
| final-body-parts []] | |
| (if (empty? remaining-asym-parts) | |
| final-body-parts | |
| (let [[part & remaining] remaining-asym-parts] | |
| (recur remaining |
This file contains hidden or 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
| #include<stdio.h> | |
| int a = 256;int main(){for(char b[a+a+a], | |
| *c=b ,*d=b+ a ,*e=b+a+a,*f,*g=fgets(e,(b[ | |
| a]=b [a+a] =a- a,a) , stdin);c[0]=a-a,f=c | |
| ,c=d ,d=e ,e=f, f= g,g =0,g = fgets(e,a+a | |
| -a+ a -a+a -a+ a- +a,stdin ),f +a-a ; pu\ | |
| tchar(+10)) { for( int h= 1,i=1,j, k=0 ,l | |
| =e[0]==32,m,n=0,o=c [ 0]== 32, p, q=0;d[q | |
| ];j=k,k=l,m=n,n=o,p=(j)+(k* 2 )+(l =(i = | |
| e[ q]&&i ) &&e[q +1 ]== 32,l*4)+(m* 8 )+( |
joe-crick
/ update-extended-example.js
Last active
June 16, 2018 05:48
This file contains hidden or 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
| const getContactById = contactId => fetch(`https://jsonplaceholder.typicode.com/contacts/${contact.id}`); | |
| const setContactData = (data, state) => { | |
| data.fullName = `${data.firstName} ${data.lastName}` | |
| return { | |
| currentContact: data, | |
| actionSuccess: true, | |
| masterContactAlert: data.contactId === state.masterContact.id | |
| } | |
| }; |
joe-crick
/ async-update-parameter-example.js
Created
June 16, 2018 05:39
This file contains hidden or 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
| // ****** Action ******** | |
| import { asyncUpdate } from "reduxigen"; | |
| export const getContacts = asyncUpdate( | |
| "contacts", | |
| (orgId, costCenter) => fetch(`https://jsonplaceholder.typicode.com/users?orgId=${orgId}&cc=${costCenter}`), | |
| contacts => ({ | |
| contacts | |
| }) | |
| ); |
joe-crick
/ trie-array-contrast.csv
Last active
April 17, 2018 06:53
This file contains hidden or 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
| Operation | TrieSearch | Array | |
|---|---|---|---|
| Initialization | Must be configured for searching specific data. | Does not have to be configured for search. | |
| Searching | Exposes a get method. | You must write a filter for each type of query. |
joe-crick
/ segment-tree-vs-array-code.js
Created
April 12, 2018 09:39
This file contains hidden or 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
| // Segment Tree | |
| getSmallestBidFromRange() { | |
| const start = parseInt(this.start); | |
| const end = parseInt(this.end); | |
| this.smallestValue = this.segmentTree.rangeMinQuery(start, end); | |
| } | |
| // Array | |
| getSmallestBidFromRange() { | |
| const start = parseInt(this.start); |
joe-crick
/ segment-tree-tree-based.js
Created
April 12, 2018 08:45
This file contains hidden or 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
| mounted() { | |
| this.segmentTree = new SegmentTree(this.items, true, "bid"); | |
| }, | |
| methods: { | |
| getSmallestBidFromRange() { | |
| const start = parseInt(this.start); | |
| const end = parseInt(this.end); | |
| this.smallestValue = this.segmentTree.rangeMinQuery(start, end); | |
| }, | |
| getSumFromRange() { |
joe-crick
/ segment-tree-array-based.js
Last active
April 12, 2018 08:47
This file contains hidden or 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
| methods: { | |
| getSmallestBidFromRange() { | |
| const start = parseInt(this.start); | |
| const end = parseInt(this.end); | |
| this.smallestValue = this.items | |
| .filter(bidsInRange(start, end)) | |
| .reduce((cur, prev) => { | |
| if (prev) { | |
| return cur; | |
| } else { |
NewerOlder