martinpinto

var walked = [];

var searchHaystack = function(haystack, needle, path, exactEquals) {

  //dumb truthiness handling
  exactEquals = exactEquals ? true : false;

  if(typeof haystack != "object") {
    console.warn("non-object haystack at " + path.join("."));
    return [false, null];

martinpinto

People

:bowtie:	😄 :smile:	😆 :laughing:
😊 :blush:	😃 :smiley:	☺️ :relaxed:
😏 :smirk:	😍 :heart_eyes:	😘 :kissing_heart:
😚 :kissing_closed_eyes:	😳 :flushed:	😌 :relieved:
😆 :satisfied:	😁 :grin:	😉 :wink:
😜 :stuck_out_tongue_winking_eye:	😝 :stuck_out_tongue_closed_eyes:	😀 :grinning:
😗 :kissing:	😙 :kissing_smiling_eyes:	😛 :stuck_out_tongue:

martinpinto

• Install
• Shell exports
• Directory explanations
• Automatic Imports
• Private repo access
• Guard (automatic go run)
• Godo
• Spurious
• AWS SDK with Go (inc. some old possibly broken examples)
• Build and Compilation

martinpinto

import React, { Component } from 'react';
import './App.css';
import ReactTable from './react-sample-table';

class App extends Component {
  render() {
    return (
      <div className="main main-raised">
        <div className="container">
          <ReactTable />

martinpinto

use std::mem;
fn main() {

}

fn cityhash32(mut s: &[u8], len: usize) -> u32 { // mut s: &[u8]
  if len <= 24 {
  	return if len <= 12 {
        if len <= 4 {
          hash32Len0to4(s, len)

martinpinto

function swap(arr, a, b) {
  var tmp = arr[a];
  arr[a] = arr[b];
  arr[b] = tmp;
}

function sort(arr) {
  var i = 0;
  var isSorting = false;
  while (i < arr.length) {

martinpinto

/* iterative fibonacci sequence O(n) */
function fibo(n) {
    var fiboArr = [0, 1];
    for (var i = 1; i < n; i++) {
        fiboArr.push(fiboArr[i - 1] + fiboArr[i]);
    }
    return fiboArr;
}

function fiboSum(n) {

martinpinto

/* iterative fibonacci sequence O(n) */
            function fibo(n) {
				var fiboArr = [0, 1];
                for (var i = 1; i < n; i++) {
				    fiboArr.push(fiboArr[i - 1] + fiboArr[i]);
                }
                return fiboArr;
            }
			
			function fiboSum(n) {

martinpinto

function multiples() {
    var sum = 0;
    for (var i = 0; i < 1000; i++) {
        if (i % 3 == 0 || i % 5 == 0)
            sum += i;
    }
    return sum;
}