jaseemabid

A bunch of good git tutorials

Intro to git

• Simplest intro to git by github and codeschool - Try Git

• PeepCode Git Internals PDF

• [Intro to github]

jaseemabid

/** PRODUCER - CONSUMER PROBLEM **/

#include <stdio.h>
#include <sys/types.h>
#include <sys/ipc.h>
#include <sys/sem.h>
#include <pthread.h>
#include <stdlib.h>

#define BUFSIZE 10

jaseemabid

Setup with Emacs Development environment with EDTS, Flycheck and use-package

This tutorial assumes a reasonably new version of Emacs (24.4+)

EDTS

Erlang Development Tool Suite aims to provide common IDE like functionality.

Use-package

jaseemabid

What I Wish I'd Known About Equity Before Joining A Unicorn

Disclaimer: This piece is written anonymously. The names of a few particular companies are mentioned, but as common examples only.

This is a short write-up on things that I wish I'd known and considered before joining a private company (aka startup, aka unicorn in some cases). I'm not trying to make the case that you should never join a private company, but the power imbalance between founder and employee is extreme, and that potential candidates would

jaseemabid

Git for dummies

As the source code is handled by the version control system Git, it's useful to know some features used.

Submodules

The repository uses submodules, which normally are handled directly by the Makefile, but sometimes you want to be able to work with them manually.

jaseemabid

# /etc/NetworkManager/conf.d/30-randomize-mac-address.conf

# REQUIRES NETWORK MANAGER >= 1.4.1 (Ubuntu Zesty and above)

# Thanks to https://blogs.gnome.org/thaller/2016/08/26/mac-address-spoofing-in-networkmanager-1-4-0/

# This randomize your MAC address for *new* connections

# Be sure to change your existing (saved) connections in
# /etc/NetworkManager/system-connections/*

jaseemabid

/**
 * Object descriptor
**/

var a = {
  prop1 : 14
}

var descriptorObj1 = Object.getOwnPropertyDescriptor(a, 'prop1');

jaseemabid

//! Leveshtein distance
//!
//! Leveshtein distance considers the 3 possibilities strings can differ -
//! addition, subtraction and deletion at each state of iteration and tries all
//! the cases to find the minimum distance.

use std::{collections::HashMap, convert::TryInto};

pub fn levenshtein(a: &str, b: &str) -> i32 {
    cached(a, b, &mut HashMap::new())

jaseemabid

Version 1.7.1 x86_64
Compiled with:
- Cabal-2.2.0.1
- Glob-0.9.2
- HUnit-1.6.0.0
- QuickCheck-2.11.3
- StateVar-1.1.1.0
- aeson-1.2.4.0
- aeson-compat-0.3.7.1
- annotated-wl-pprint-0.7.0

jaseemabid

Safe

A safe storage for your personal data like photos, documents and notes for life. Privacy and safety over anything else.

What would it be?

1. A dead simple folder you can drag and drop files into and forget about. As simple as dropbox but something you can trust.