Skip to content

Instantly share code, notes, and snippets.

View joshbedo's full-sized avatar
🤙

Josh Bedo joshbedo

🤙
View GitHub Profile
respond-below($width)
media = 'all and (max-width: %s)' % $width
@media media
{block}
respond-above($width)
media = 'all and (min-width: %s)' % $width
@media media
{block}
SearchField = React.createClass
mixins: [
InputMixin
InputValueMixin
]
...
....
....
define ['react'
'dom'
'underscore'
'ui/forms/text_field'
'ui/forms/field_set'
'ui/forms/textarea'
'ui/forms/select'
'ui/workflows/intro'
'ui/workflows/workflow_forms/fields'
'actions/workflow_templates'], (React
define ['react'
'dom'
'underscore'
'actions/workflow_templates'
'ui/workflows/workflow_forms/field'
'ui/common/sortable_table'
'ui/forms/select'], (
React
D
_
@joshbedo
joshbedo / tabs
Created March 6, 2015 15:21
tabs
import React from 'react';
const D = React.DOM
var Tabs = React.createClass({
displayName: 'Tabs',
propTypes: {
tabActive: React.PropTypes.number,
onMount: React.PropTypes.func,
onBeforeChange: React.PropTypes.func,
onAfterChange: React.PropTypes.func,
@joshbedo
joshbedo / gist:64dc4f60d1d97ba6c332
Created March 20, 2015 15:30
long-polling React
@ProgressBar = ProgressBar({ pending: file_export.completed_items, total: file_export.total_items })
if @inProgress(file_export)
do poll = () =>
setTimeout (=>
debugger
$.ajax(
url: '/api/v1/file_exports.json',
success: (data) =>
@ProgressBar.setState({ pending: data.completed_items })
if @state.isReady
D.ul { className: 'list-table-body clearfix'}, [
[
_.map(exportResults, (file_export, index) =>
D.ul { className: 'list-table-row with-action' }, [
D.li { className: 'filename' }, file_export.file_name
D.li { className: 'export-progress' }, [
@streamProgressBar(file_export)
]
if @inProgress(file_export)
@joshbedo
joshbedo / gist:5ae51fff0b9377090a26
Created July 9, 2015 13:42
3 Sum problem - Given N integers how many triples sum to exactly zero
var numbers = [20,-20, 0, 50, -50, 0];
var len = numbers.length;
var count = 0;
var threeSum = function() {
for(var i = 0;i < len; i++) {
for(var j = i + 1;j < len; j++) {
for(var k = j + 1;k < len; k++) {
if (numbers[i] + numbers[j] + numbers[k] == 0) {
var list = [1,4,8,10,23,26,55,77,88];
var binarySearch = function(key) {
var low = 0;
var high = list.length - 1;
while(low <= high) {
var mid = Math.floor(low + (high - low) / 2);
if (key < list[mid]) {
@joshbedo
joshbedo / gist:743f090f6b939725572b
Last active August 29, 2015 14:24
Queues (FIFO) and Stacks (LIFO)
class Node {
constructor(data) {
this.data = data;
this.previous = null;
}
}
class Stack {
constructor() {
this.top = null;