Creates a virtual NIC, acquires an IP address from the DHCP, sets up the Squid Proxy for outgoing connection, and checks conectivity's to TARGET websites, if connection to the TARGET is lost, Repeat!
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 <cmath> | |
#include <assert.h> | |
#include <core/TestPattern.h> | |
TestPattern::TestPattern() | |
:w(0) | |
,h(0) | |
,frame_num(0) | |
,duration(0) |
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
# the following code will create a file containing random integers (2**30 ~ 1 Gigabyte) | |
$ openssl rand -out data -base64 $((2**30 * 3/4)) | |
# you can also use dd in linux: | |
$ dd if=/dev/urandom of=data bs=64M count=16 | |
# in mac os x (lower case m) |
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
churn number and file name | |
git log --all -M -C --name-only | grep -E '^(app|lib)/' | sort | uniq -c | sort | awk 'BEGIN {print "count,file"} {print $1 "," $2}' | |
churn number and file name w/ limiting to last n commits | |
git log --all -n 5000 -M -C --name-only | grep -E '^spec/models' | sort | uniq -c | sort | awk 'BEGIN {print "count,file"} {print $1 "," $2}' | |
graph of churn number and frequency | |
git log --all -M -C --name-only | grep -E '^(app|lib)/' | sort | uniq -c | sort | awk '{print $1}' | uniq -c | sort | awk 'BEGIN { print "frequency,churn_count"} { print $1,$2}' | |
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
#import <stdio.h> | |
// xcrun clang -g -Wall -Werror -fprofile-instr-generate -fcoverage-mapping -o testprof testprof.m | |
// ./testprof | |
// xcrun llvm-profdata merge -o testprof.profdata default.profraw | |
// xcrun llvm-cov show ./testprof -instr-profile=testprof.profdata testprof.m | |
static int DoSomething (int value) { | |
if (value == 55) { |
The purpose of this document is to make recommendations on how to browse in a privacy and security conscious manner. This information is compiled from a number of sources, which are referenced throughout the document, as well as my own experiences with the described technologies.
I welcome contributions and comments on the information contained. Please see the How to Contribute section for information on contributing your own knowledge.
As configured in my dotfiles.
start new:
tmux
start new with session name:
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
Sub DontIndent() | |
With ActivePresentation | |
With .Slides(1).Shapes("Rec1").TextFrame2 | |
.TextRange.ParagraphFormat.LeftIndent = 0 | |
End With | |
End With | |
End Sub |
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
Sub Titre() | |
On Error Resume Next | |
With ActivePresentation | |
For i = 1 To .Slides.Count | |
With .Slides(i).Shapes("Slide Number Placeholder 5").TextFrame2 | |
.TextRange.Font.Name = "IPT Lotus" | |
.TextRange.Font.Size = 18 | |
.TextRange.Font.Bold = msoTrue | |
End With | |
Next i: |