bexp

//Dispatcher.java
/**
 * Policy on when async requests are executed.
 *
 * <p>Each dispatcher uses an {@link ExecutorService} to run calls internally. If you supply your
 * own executor, it should be able to run {@linkplain #getMaxRequests the configured maximum} number
 * of calls concurrently.
 */
public final class Dispatcher {
  private int maxRequests = 64;

bexp

 private final OkHttpClient client;

  public ConfigureTimeouts() throws Exception {
    client = new OkHttpClient.Builder()
        .connectTimeout(10, TimeUnit.SECONDS)
        .writeTimeout(10, TimeUnit.SECONDS)
        .readTimeout(30, TimeUnit.SECONDS)
        .build();
  }

bexp

http lib	connect timeout (ms)	read timeout	write timeout	concurrency
OkHttp, retrofit, picasso	10,000	10,000	10,000	64 total, 5 per host
Volley	2,500	2,500	2,500	4
HttpUrlConnection	up to few minutes	up to few minutes	n/a	5

bexp

https://coderwall.com/p/7smjkq/multiple-ssh-keys-for-different-accounts-on-github-or-gitlab

chmod 400 chmod 400 ~/.ssh/id_rsa_dev
ssh gitlab.packetzoom.net -v

bexp

update apps SET no_nw_timeout = 5 where id = '49e68ee79f254ae49b344873be35668d';
mysql -h rds1.packetzoom.net --ssl-ca=~/rds-combined-ca-bundle.pem -u pz_user --password=this

bexp

int longest_substring(const string& str1, const string& str2) {
    
    int n = str1.length();
    int m = str2.length();
    
    int suffix[n + 1][m + 1] = {};
    
    int result = 0;
    
    

bexp

Latency Comparison Numbers
--------------------------
L1 cache reference                           0.5 ns
Branch mispredict                            5   ns
L2 cache reference                           7   ns                      14x L1 cache
Mutex lock/unlock                           25   ns
Main memory reference                      100   ns                      20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy             3,000   ns        3 us
Send 1K bytes over 1 Gbps network       10,000   ns       10 us
Read 4K randomly from SSD*             150,000   ns      150 us          ~1GB/sec SSD

bexp

#include <iostream>
#include <vector>
using namespace std;


// Max Heap impl
struct PriorityQueue {
  
private:  
  vector<int> A;

bexp

#include <iostream>
using namespace std;

typedef struct node {
  int data;
  
  node() : data(0), left(NULL), right(NULL) {}
  
  node(int d) {
    data = d;

bexp

#include <iostream>
#include <list>
#include <stdlib.h>
#include <climits>
#include <bits/stdc++.h>

using namespace std;


class graph {