DanKWiki

Web Services Notes

Daniel Kirkdorffer — Mon, 06 Jun 2022 01:33:33 -0400

Web Services Notes

General Documentation

The Java Web Services Tutorial (Java Web Services Developer Pack (JWSDP) 2.0) - February, 2006
Classification of HTTP APIs

REST

HTTP

Hypertext Transfer Protocol -- HTTP/1.1

Methods

Idempotent - no matter how many times you apply the operation, the result is always the same.
Safe - the operation does not change the state of the resource representation.

GET - Idempotent, safe
PUT (Update) - Idempotent
POST (Create) - Not idempotent, not safe
DELETE - Idempotent

Resources

Architectural Styles and the Design of Network-based Software Architectures - Roy T. Fielding's dissertation.
InfoQ: A Brief Introduction to REST
An Introduction to REST (Video)
InfoQ: How to GET a Cup of Coffee - A case study
REST in Practice (Book)

JAX-RS & Jersey

JAX-RS: Java™ API for RESTful Web Services (v1.1) - September, 2009
Jersey - JAX-RS (JSR 311) Reference Implementation

RESTEasy

RESTEasy - A JBoss framework for writing RESTful web services
RESTEasy JAX-RS Documentation
Develop Restful application with RESTeasy (Tutorial)

AtomPub

The Atom Publishing Protocol (RFC 5023)
AtomServer - A generic data store implemented as a RESTful web service.
Apache Abdera - A functionally-complete, high-performance implementation of the IETF Atom Syndication Format (RFC 4287) and Atom Publishing Protocol (RFC 5023) specifications.
atomojo - An Atom Publishing Protocol Client & Server
“Getting to know the Atom Publishing Protocol” developerWorks Article:

SOA / ESB

Patterns and Best Practices for Enterprise Integration
Top Open Source ESB Projects
Best-of-Breed ESBs
InfoQ: Does My Bus Look Big in This? - SOA without ESB presentation by Martin Fowler and Jim Webber

Java Notes - [Questions and Topics]

Daniel Kirkdorffer — Mon, 06 Jun 2022 00:34:31 -0400

Java Notes

General Documentation

The Java Tutorials
Collected Java Practices - Concise presentations of Java practices, tasks, and designs, illustrated with syntax-highlighted code examples.
Java2s.com - Programming tutorials and source code examples
Java's new math, Part 2: Floating-point numbers
Java Performance Tuning Tips November 2008
Essential Java resources: A comprehensive listing of must-have books, sites, blogs, events, and more
Everything about Java 8

JPA

Has JPA Killed the DAO?

Hibernate

Hibernate Performance and Scalability Out of the Box (Webcast recording)

Ant Tools

Apache Ant User Manual

Build Visualization

These all use Graphviz to render graphics from generated .dot files.

Design Patterns

The Net Objectives Design Patterns Repository

Questions and Topics

Q. Is Java Pass by Value or Pass by Reference? (See also: http://www.youtube.com/watch?v=dk3Iiqof6jA)

With primitives it is simple pass by value.  
Objects references are passed by value.

Q. Composition vs. Aggregation

Aggregation is a specialization of association, specifying a whole-part relationship between two objects. Composition is a stronger form of
aggregation where the whole and parts have coincident lifetimes, and it is very common for the whole to manage the lifecycle of its parts.

Q. What's the difference between using synchronized on a method or in a block?

The main difference is that if you use a synchronized block you may lock on an object other than "this" which is a more flexible approach.

Q. Threads

Q. What is the Java volatile keyword?

Essentially, volatile is used to indicate that a variable's value will be modified by different threads.
Declaring a volatile Java variable means:
- The value of this variable will never be cached thread-locally: all reads and writes will go straight to "main memory";
- Access to the variable acts as though it is enclosed in a synchronized block, synchronized on itself.

Q. When would you use non-public modifiers on a class?

To make an inner class private.

Q. Set vs. List vs. Map

A Set is a collection that has no duplicate elements.
A List is a collection that has an order associated with its elements.
A Map is a way of storing key/value pairs. A Map is similar to two-column table.

Q. What are the benefits of immutable objects? (From Brian Goetz: To mutate or not to mutate?)

Immutable classes, when used properly, can greatly simplify programming. They can only be in one state, so as long as they are properly 
constructed, they can never get into an inconsistent state. You can freely share and cache references to immutable objects without having 
to copy or clone them; you can cache their fields or the results of their methods without worrying about the values becoming stale or 
inconsistent with the rest of the object's state. Immutable classes generally make the best map keys. And they are inherently thread-safe, 
so you don't have to synchronize access to them across threads.

Q. How do you make a class immutable? (See also...)

> Ensure the class cannot be overridden - make the class final, or use static factories and keep constructors private.
> Make the fields private and final.
> Force callers to construct an object completely in a single step, instead of using a no-argument constructor combined with subsequent calls to setXXX methods (that is, avoid the Java Beans convention).
> Do not provide any methods which can change the state of the object in any way - not just setXXX methods, but any method which can change state.
> If the class has any mutable object fields, then they must be defensively copied when passed between the class and its caller.

Q. Statements vs. PreparedStatements

Prepared statements make formatting a non-issue, adds some security against SQL injection, and are pre-compiled.

Q. Comparators and Sorting

Q. SAX (push), DOM, StAX (pull)

Maven Notes - [Common Commands]

Daniel Kirkdorffer — Thu, 21 Oct 2021 03:31:32 -0400

Maven Notes

Searchable Public Repositories

http://repo1.maven.org/maven2/ - Default Maven Repository

pom.xml

Introduction to the POM
Project Descriptor Reference - A reference for the Maven project descriptor used in Maven

Build Phases

Build lifecycles are defined by a different list of build phases, wherein a build phase represents a stage in the lifecycle. The default lifecycle has the following build phases:

validate - validate the project is correct and all necessary information is available
compile - compile the source code of the project
test - test the compiled source code using a suitable unit testing framework. These tests should not require the code be packaged or deployed
package - take the compiled code and package it in its distributable format, such as a JAR.
integration-test - process and deploy the package if necessary into an environment where integration tests can be run
verify - run any checks to verify the package is valid and meets quality criteria
install - install the package into the local repository, for use as a dependency in other projects locally
deploy - done in an integration or release environment, copies the final package to the remote repository for sharing with other developers and projects.

Common Commands

mvn archetype:create
-DarchetypeGroupId=org.apache.maven.archetypes
-DarchetypeArtifactId=maven-archetype-webapp
-DgroupId=com.mycompany.app
-DartifactId=my-webapp
mvn compile
mvn test
mvn test-compile
mvn package
mvn install
mvn site
mvn clean
mvn eclipse:eclipse
mvn process-resources

Data Structures And Algorithm Notes - [Questions and Topics]

Daniel Kirkdorffer — Wed, 15 Apr 2020 20:40:59 -0400

Data Structures And Algorithm Notes

Data Structures and Algorithms with Object-Oriented Design Patterns in Java (Online Book)

Algorithms

Dictionary of Algorithms and Data Structures
Top Coder Algorithm Tutorials
Damn Cool Algorithms, Part 1: BK-Trees
Search algorithm (Wikipedia)
Sorting algorithm (Wikipedia)
NP-complete (Wikipedia)
Travelling salesman problem (Wikipedia)
Knapsack problem (Wikipedia)
Graph theory (Wikipedia)
Breadth-first search (Wikipedia)
Depth-first search (Wikipedia)

Questions and Topics

Q. Bitwise Operations and Bitwise AND, OR, XOR and NOT Operators and Bit Masks

NOT - Bits that are 0 become 1, and those that are 1 become 0.  Used to unset/turn off bit flags.
AND - Multiplication of bits; i.e., 1 × 0 = 0 and 1 × 1 = 1.  Used to check state of a bit flag.
OR  - 1 if either bit is 1, otherwise 0.  Used to set/turn on bit flags regardless of whether already on or not.
XOR - 1 if both bits are different, 0 if they are the same.  Used to toggle flag bits of a mask.

Arithmetic Shifts: left << (multiplies by 2, 0 shifted on as least significant bit), right >> (divides by 2, left-most sign bit is retained)
Logical Shift: right >>> (divides by 2, 0 shifted on as most significant bit)

Q. What's the difference between a LinkedList and an ArrayList (or between a linked list and an array/vector)?

An ArrayList is a List implementation backed by a Java array. With a LinkedList, the List implementation is backed by a 
doubly linked list data structure.

Q. How can you detect a cycle in a linked list?

Turtle and Rabbit: The idea is to have two references to the list and move them at different speeds. Move one forward by 1  
node and the other by 2 nodes. If the linked list has a loop they will meet. If there is no loop either of the references 
will become null when it reaches the end of the list. O(n)

Q. What is a weighted round robin load balancing algorithm?

Round robin distribution is used by DNS servers, peer-to-peer networks, and many other multiple-node clusters/networks.  
In a weighted round-robin algorithm, each destination (in this case, server) is assigned a value that signifies, relative 
to the other servers in the list, how that server performs. This "weight" determines how many more (or fewer) requests are 
sent that server's way; compared to the other servers on the list.

Q. Breadth first search

root, children (enqueue/add), children of children (dequeue/remove first and enqueue), etc... Use a fifo queue

Typical applications:
- Shortest path between two vertices.

public class BreadthFirstPaths {

    private boolean[] marked;
    private int[] edgeTo;

    ...
    
    private void bfs(Graph G, int s) {
        Queue<Integer> q = new Queue<Integer>();
        q.enqueue(s);
        marked[s] = true;
        while (!q.isEmpty()) {
            int v = q.dequeue();
            for (int w : G.adj(v)) {
                if (!marked[w]) {
                    q.enqueue(w);
                    marked[w] = true;
                    edgeTo[w] = v;
                }
            }
        }
    }
}

Q. Depth first search

root, children (push) to leaf nodes, left, then up (pop) and right... Use a stack
    +
  3   4
preorder/prefix (Polish notation, e.g. + 3 4), postorder/postfix (reverse Polish notation, e.g. 3 4 +), 
inorder/infix (e.g. 3 + 4) - expression tree

Recursive algorithm.

Typical applications:
- Find all vertices connected to a given source vertex.
- Find a path between two vertices.

After DFS, should be able to:
- Find vertices connected to root/source in constant time
- Find a path back to root/source in time proportional to its length

public class DepthFirstPaths {

    private boolean[] marked;
    private int[] edgeTo;
    private int s;

    public DepthFirstSearch(Graph G, int s) {
        ...
        dfs(G, s);
    }

    private void dfs(Graph G, int v) {
        marked[v] = true;
        for (int w : G.adj(v))
            if (!marked[w]) {
                dfs(G, w);
                edgeTo[w] = v;
            }
    }
}

Q. Name some self balancing binary trees

Red/black tree, splay tree, AVL tree

Q. What is Big-O Notation?

Defines worst case performance of an algorithm (ex: O(N)).  There is also Omega (best case - ex: Ω(N)) and Theta (average case - ex: Θ(N)).
Given N we might have, N, N log N, N^2 performance, for example.

Q. Merge sort

Split in 2, recurse left, recurse right, merge sorted halves.

Can be "stable" - i.e. retains existing sorts if order of equal items is not changed, and no long distance exchanges are made.

Java sorts Objects with a merge sort algorithm.  N log N.

public class MergeSort {

    public static void sort(Object[] a, Comparator comparator) {
        Object[] aux = new Object[a.length];
        sort(a, aux, comparator, 0, a.length - 1);
    }

    private static void sort(Object[] a, Object[] aux, Comparator c, int lo, int hi) {
        // Optimize sort for small subarrays (CUTOFF = 7 perhaps):
        if (hi <= lo + CUTOFF - 1) {
            Insertion.sort(a, c, lo, hi);
            return;
        }

        int mid = lo + (hi - lo) / 2;
        sort(a, aux, c, lo, mid);
        sort(a, aux, c, mid + 1, hi);

        // Optimize if already sorted:
        if (!less(c, a[mid + 1], a[mid])) return;

        merge(a, aux, c, lo, mid, hi);
    }

    private static void merge(Object[] a, Object[] aux, Comparator c, int lo, int mid, int hi) {
        assert isSorted(a, c, lo, mid);      // precondition: a[lo..mid] sorted
        assert isSorted(a, c, mid + 1, hi);  // precondition: a[mid+1..hi] sorted

        // Copy to working array:
        for (int k = lo; k <= hi; k++)
            aux[k] = a[k];

        // Merge two arrays:
        int i = lo, j = mid + 1;
        for (int k = lo; k <= hi; k++) {
            if (i > mid)                      a[k] = aux[j++];
            else if (j > hi)                  a[k] = aux[i++];
            else if (less(c, aux[j], aux[i])) a[k] = aux[j++];
            else                              a[k] = aux[i++];
        }

        assert isSorted(a, c, lo, hi);       // postcondition: a[lo..hi] sorted
    }

    ...

}

Q. Quick sort

Randomly shuffle array to prep process and avoid worst case comparisons (~1/2 * N^2) which becomes very unlikely to happen (if shuffle actually 
sorted the array!)
Then pick a partitioning element as a divide/pivot point, less vs. greater, exchange elements that are out of place, recurse.

Is not "stable".

Faster than Merge sort because less movement of items even though more compares in average case.  N log N.  Too many duplicate keys can also 
affect efficiency.

Java sorts primitive types with a quick sort algorithm.

public class QuickSort {

    private static int partition(Comparable[] a, int lo, int hi) {
        int i = lo, j = hi + 1;
        while (true) {
            while (less(a[++i], a[lo])) // find item on left to swap
                if (i == hi) break;

            while (less(a[lo], a[--j])) // find item on right to swap
                if (j == lo) break;

            if (i >= j) break;          // check if pointers cross
            exch(a, i, j);              // swap items
        }
        exch(a, lo, j);                 // swap with partitioning item
        return j;                       // return index of item now known to be in place
    }

    public static void sort(Comparable[] a) {
        StdRandom.shuffle(a);  // shuffle ensures performance is good
        sort(a, 0, a.length - 1);
    }

    private static void sort(Comparable[] a, int lo, int hi) {
        // Optimize sort for small subarrays (CUTOFF between 10 and 20):
        if (hi <= lo + CUTOFF - 1) {
            Insertion.sort(a, lo, hi);
            return;
        }
        
        int j = partition(a, lo, hi);
        sort(a, lo, j - 1);
        sort(a, j + 1, hi);
    }
}

Q. Sorting Summary

Q. Implement a hashtable (dictionary)

An array of linked lists, indexed by a hash, where hash collisions are placed in buckets in the linked list.

Q. Binary search trees

left subtree nodes < parent node <= right subtree nodes.  Efficient for sorting, searching in-order.

public class BST<Key extends Comparable<Key>, Value> {
    private Node root;             // root of BST

    private class Node {
        private Key key;           // sorted by key
        private Value val;         // associated data
        private Node left, right;  // left and right subtrees

        public Node(Key key, Value val, int N) {
            this.key = key;
            this.val = val;
            this.N = N;
        }
    }

    // return value associated with the given key, or null if no such key exists
    public Value get(Key key) {
        return get(root, key);
    }

    private Value get(Node x, Key key) {
        if (x == null) return null;

        int cmp = key.compareTo(x.key);

        if      (cmp < 0) return get(x.left, key);
        else if (cmp > 0) return get(x.right, key);
        else              return x.val;
    }


    /***********************************************************************
    *  Insert key-value pair into BST
    *  If key already exists, update with new value
    ***********************************************************************/
    public void put(Key key, Value val) {
        root = put(root, key, val);
    }

    private Node put(Node x, Key key, Value val) {
        if (x == null) return new Node(key, val, 1);

        int cmp = key.compareTo(x.key);

        if      (cmp < 0) x.left  = put(x.left,  key, val);
        else if (cmp > 0) x.right = put(x.right, key, val);
        else              x.val   = val;

        return x;
    }
}

Q. Heap (priority queue)

Complete binary tree (i.e. only bottom level might not be complete, left to right), 
heap ordered (i.e. parent values > children values)

Q. Graphs

trees with interconnecting nodes

Q. Graph algorithms, such as Dijkstra and A*

Best-first search is a search algorithm which explores a graph by expanding the most promising node chosen 
according to a specified rule.  A* uses a best-first search and finds the least-cost path from a given initial
node to one goal node (out of one or more possible goals).  It uses a distance-plus-cost heuristic  function 
(usually denoted f(x)) to determine the order in which the search visits nodes in the tree.
  
Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959,[1]  is a graph search 
algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, 
producing a shortest path tree. This algorithm is often used in routing.

Q. NP-complete problems, such as traveling salesman and the knapsack problem

Traveling Salesman problem: Given a list of cities and their pairwise distances, the task is to find a shortest 
possible tour that visits each city exactly once.

Knapsack problem: Given a set of items, each with a weight and a value, determine the number of each item to 
include in a collection so that the total weight is less than a given limit and the total value is as large as 
possible.

Linux Notes - [General Documentation]

Daniel Kirkdorffer — Sat, 14 Mar 2020 17:29:13 -0400

Linux Notes

General Documentation

Unix

Unix Toolbox - A collection of useful Unix/Linux/BSD commands and tasks
Solaris QuickSheet
Sunfreeware - Free and Open Source Software (FOSS) for Sun Microsystem's Solaris

Samba

Samba can be installed by running:

 apt-get install samba

Samba allows you to share a directory on your Linux filesystem with your Windows machine. In the /etc/samba directory, there is an smb.conf.user file that is used for any Samba extensions that you'd like to make to share additional directories. By default, you should have your home directory set up as a samba share in smb.conf. It's in there as the [homes] clause, but the actual share name is the same as your username (ex. \\mylinuxservername\dkirkdorffer). If you are connecting for the first time, you will have to set the samba password using following command:

 sudo smbpasswd -a dkirkdorffer

You will be prompted to enter a new password; this will be the password to use when connecting to your Linux box from your Windows box.

 [dkirkdorffer]
    path = /home/dkirkdorffer
    read only = no
    valid users = dkirkdorffer
    create mask = 0644
    browsable = no

If you want to have access to the root of your linux drive, you can edit the /etc/samba/smb.conf.user file and add this snippet (modify the username to your username):

 [root]
    path = /
    read only = no
    valid users = dkirkdorffer
    create mask = 0644
    browsable = no

This will enable you to access the root of your linux drive using the alias “root” (ex: \\mylinuxservername\root)

Start (or stop and restart) the smbd daemon (at /usr/sbin or possibly at /etc/init.d) like so:

 /usr/sbin/smbd start
 
 /usr/sbin/smbd stop
 
 /usr/sbin/smbd restart

For troubleshooting info read the ”The Samba Checklist”.

To determine the IP address of the Samba server run:

nmblookup -B BIGSERVER __SAMBA__

UNIX

Additional UNIX resources of use:

Enabling and configuring SAMBA as shipped with Solaris 10 or SAMBA and SWAT in Solaris 10 Update 4 (Solaris 10 8/07).

Start and stop alternatives:

 /usr/sfw/sbin/smbd start
 
 /usr/sfw/sbin/smbd stop
 
 /usr/sfw/sbin/smbd restart

 svcadm enable samba wins
 
 svcadm disable samba wins

SSH

How to set up SSH keys - i.e. generate the keys on the server (UNIX, Linux, BSD etc.) instead of the client (i.e. in Windows).
Special instructions for Cervisia - Before doing a check-out for the first time, make sure that the key for the CVS server is in your .ssh/known_hosts file. One way to do this is: 'ssh <user>@<cvs_hostname>'. Failing to do this will make Cervisia ask for a password and then terminate the checkout with the error “Host key verification failed”.

VNC

You can start the VNC Server by running ./startvnc.sh or ./startvnc4.sh. VNC Viewer can then be installed on your Windows system, allowing you full access to your Linux system from Windows (or another Linux system). You can override the default geometry of the VNC window created by the server by altering the shell script like this:

 #!/bin/sh
 vncserver -geometry 1580x1100 -depth 24
 nohup vncconfig -nowin > /dev/null 2>&1 &

 #!/bin/sh
 /usr/bin/vnc4server -geometry 1220x830 -depth 24
 nohup /usr/bin/vnc4config -nowin > /dev/null 2>&1 &

An .vnc/xstartup file is also used and if using KDE can be setup as so

 #!/bin/sh
 vncconfig -nowin &
 startkde &

Set the password by running vncpasswd, vnc4passwd or tightvncpasswd, depending on your version of VNC.

The default starting port for VNC is 5901 (or 5801 through a web browser), additional instances of VNC will increment this number by 1 (so 5902 for the second one). You can find what port it's currently running on by running:

 ps -ef | grep vnc

and looking for the ”rfbport” parameter. Alternatively, look in the ~/.vnc directory at the log file.

TightVNC and RealVNC are both provide good client viewers, and VNC servers.

UNIX

See: VNC on Solaris

On Solaris, the ./startvnc.sh might look like this:

 #!/bin/ksh
 PATH=$PATH:/usr/dt/bin:/usr/openwin/bin:/usr/X11/bin
 cd ~
 vncserver -depth 24 -geometry 1500x768 :1

./killvnc.sh might look like this:

 #!/bin/ksh
 PATH=$PATH:/usr/dt/bin:/usr/openwin/bin:/usr/X11/bin
 cd ~
 vncserver -kill :1

and the .vnc/xstartup file might look like this:

 #!/bin/sh
 [ -r $HOME/.Xresources ] && xrdb $HOME/.Xresources
 xsetroot -solid grey
 vncconfig -iconic &
 xterm -geometry 80x24+10+10 -ls -title "$VNCDESKTOP Desktop" &
 gnome-session &

Seattle WingDing Notes - [Java Security]

Daniel Kirkdorffer — Thu, 06 Jul 2017 13:34:27 -0400

Seattle WingDing Notes

Java Security

Studied from January 2017 - April 2017

Java Coding Guidelines: 75 Recommendations for Reliable and Secure Programs
- SEI CERT Oracle Coding Standard for Java Wiki
- Robert Kuhar's Github notes

Security and Countermeasures / Bitcoin

Studied from January 2014 - February 2014

SSL:

Bitcoin:

Bitcoins For Dummies - Steven Lewis Presentation
How the Bitcoin protocol actually works
Why Bitcoin Matters - By Marc Andreessen
Bitcoin Wisdom - Current Market Price

Akka

Studied from September 2013 - January 2014

Algorithms

Studied from April 2013 - Present

Algorithms, Part II - Princeton online course ( Saved Local Files)
Algorithms, Part I - Princeton online course ( Saved Local Files)
Algorithms, 4th Edition - Online Book with code

Additional Material:

MIT Introduction to Algorithms (SMA 5503) - Video lectures

Functional Programming / Clojure

Studied from October 2012 - March 2013

"Functional Programming for the Object-Oriented Programmer" by Brian Marick
- Google Groups book forum
- Light Table playground (REPL)
- leiningen - for automating Clojure projects

GWT and PhoneGap

Brief look at cross platform development using PhoneGap on GWT in September 2012

Web Apps & Mobile Platform Proliferation: Affecting Team Dynamics with Development Language Choices (PDF)

Various Articles by Robert C. Martin

Studied from May 2012 - September 2012

Articles By Robert C. Martin
- Testing Things That Seem Hard to Test (PPT)
- Proxy and Stairway to Heaven (PDF)
- Agile Processes (PDF)
- Simple Hickey - Regarding Rich Hickey's "Simple made Easy" talk
- The Open Closed Principle (PDF)
- The Liskov Substitution Principle (PDF)
  - Liskov Substitution Principle (Steven Lewis' Slides)
- The Dependency Inversion Principle (PDF)
- The Interface Segregation Principle (PDF)
- The Single Responsibility Principle (PDF)

Various Papers on Programming

Studied from January 2012 - May 2012

10 Papers Every Programmer Should Read (At Least Twice)
- On the criteria to be used in decomposing systems into modules – David Parnas
- A Note On Distributed Computing – Jim Waldo, Geoff Wyant, Ann Wollrath, Sam Kendall
- The Next 700 Programming Languages – P. J. Landin
- Can Programming Be Liberated from the von Neumann Style? – John Backus
- Reflections on Trusting Trust – Ken Thompson
- Lisp: Good News, Bad News, How to Win Big – Richard Gabriel
- An experimental evaluation of the assumption of independence in multiversion programming – John Knight and Nancy Leveson
- Arguments and Results – James Noble
- A Laboratory For Teaching Object-Oriented Thinking – Kent Beck, Ward Cunningham
- Programming as an Experience: the inspiration for Self – David Ungar, Randall B. Smith

Plus:

Google Guava

Studied from December 2011 - January 2012

Google Guava:

Java

Studied from October 2011 - December 2011

"Java: The Good Parts" by Jim Waldo - O'Reilly

REST

Studied from April 2011 - October 2011

REST in Practice - O'Reilly Media

HTML 5

Studied from January 2011 - April 2011

JavaScript

Studied from September 2010 - December 2010

NoSQL

Studied from May 2010 - August 2010

Scala

Studied from September 2009 - April 2010

Studied in August 2009

Code Commit Blog Article - Roundup: Scala for Java Refugees

Clojure

Looked at briefly in July 2009

Collective Intelligence

Studied from February 2009 - July 2009

Python

Brief overview of Python 2.x by Brian Dorsey in January 2009

Java

Studied from June 2008 - December 2008

"Effective Java, 2nd Edition" by Joshua Bloch

Git Notes - [Various Git Commands]

Daniel Kirkdorffer — Tue, 07 Mar 2017 14:36:05 -0400

Git Notes

Git Reference
Git Immersion - Guided tour through Git
Think Like (a) Git - A Guide for the Perplexed
Git data flow diagram
A Git Workflow
Pro Git (Free HTML Book)

Git

msysgit - Git for Windows

Training

GitHub

defunkt/hub - Command line tool that wraps git in order to extend it with extra features and commands that make working with GitHub easier.
Emoji cheat sheet for Campfire and GitHub (Emoticons)
GitHub Flow (vs. git-flow)

Tools

Git in Eclipse
Git with Eclipse (EGit) - Tutorial
github/GitPad - EXE to make Notepad the Git editor (commits, interactive rebase, etc).
Setting up a Windows editor for commit messages
Setting up an external diff tool

Git & SVN

Migrating from Subversion to Git and GitHub (Slides)

VIM Editor

Various Git Commands

  git diff           < diff of what is changed but not staged
  git diff --staged  < diff of what is staged but not committed
  git diff HEAD      < diff of the current state of the files as compared against the most recent commit
  
  git show <hash>    < diff of a specific commit
  
  git log origin/master..master             < lists unpushed commits
  git log origin/master..master --oneline
  
  
  git commit --amend  < change last commit message
  git rebase -i       < choose and mark the commit to "reword"
  
  git reset --hard HEAD  < Restore working to last committed state
  git reset --hard       < same
  git reset --hard MYTAG < Restore working to MYTAG tag reference point
  
  
  git log --stat -M                    < shows "renames" instead of deletes and adds
  
  git log --stat -C -C                 < shows "copies" if that's likely what happened
  git log --stat --find-copies-harder  < same
  
  git log -- deletedFile.txt           < find a deleted file in log history
  
  git add -u .     < Add tracked files in the staging area rather than the working tree
  git add -A .     < Add files in the working tree in addition to the staging area
  git add --all .  < same
  
  git fetch        < retrieval without merging to work in progress
  git merge        < merges what has been fetched in to working files
  git pull         < retrieval with merge into work in progress
  
  git log --graph --pretty=oneline --abbrev-commit --decorate --all -5
  
  git branch           < local branches
  git branch -r        < local remote branches
  git branch -a        < local and local remote branches
  git ls-remote origin < remote branches
  git ls-remote        < same
  
  git branch <branchname>           < create new local branch <branchname>
  git checkout <branchname>         < switch to local branch <branchname>
  git checkout -b <branchname>      < create and switch to new local branch <branchname>
  git push -u origin <branchname>   < publishes local branch to remote origin
  
  git checkout master
  git merge <branchname>  < merges local branch to checked out branch (master in this case)
  
  git stash                      < push onto a local stash stack
  git stash pop                  < pop the local stash stack
  git stash apply                < same
  git stash branch <branchname>  < create branch <branchname> from top of local stash stack
  
  git branch <branchname> THETAGNAME  < create branch <branchname> from tag THETAGNAME
  
  git config --get-regexp alias  < list aliases
  
  Alias examples:
  git config --global alias.aliases "config --get-regexp 'alias.*'"
  git config --global alias.s "status -u -s"
  git config --global alias.logfive "log --graph --pretty=oneline --abbrev-commit --decorate --all -5" 
   
  [alias]
  hist = log --pretty=format:\"%h %ad | %s%d [%an]\" --graph --date=short
  aliases = config --get-regexp \"alias.*\"
  unpushed-commits = log origin/master..master --date=\"local\" --pretty=format:\"%H %cd - %s\"
  statii = "!f() { echo \"Unpushed Commits:\"; echo; git unpushed-commits; echo; echo \"Status of Tracked Files:\"; echo; git status -uno; }; f"
  unpushed = "!f() { git log origin/$1..$1 --date=\"local\" --pretty=format:\"%H %cd - %s\"; }; f"
  pullr = "!f() { echo \"Stashing uncommitted work...\"; echo; git stash clear; git stash; echo; echo \"Pulling latest changes with rebase...\"; echo; git pull --rebase; echo; echo \"Applying previously stashed work...\"; echo; git stash apply; }; f"

Web Notes - [JavaScript]

Daniel Kirkdorffer — Wed, 22 Jun 2016 17:58:54 -0400

Web Notes

General

Testing

Browser Sandbox - Run any browser from the web - Supports testing of pages on various browsers via a plug-in.

Design

Nifty Color Scheme Designer tool
Useful Generate It online tools (Mod Rewrite, Favicons, Rounded Corners, CSS Layout, etc…)

JavaScript

Douglas Crockford on Javascript - 5 video presentations (and others) about JavaScript
Douglas Crockford: "Advanced JavaScript" - 3 video presentations
jconsole - Web-based interactive JavaScript shell

About Prototype and Inheritance

Testing

JSLint

YUI

jQuery and YUI 3: A Tale of Two JavaScript Libraries

JQuery

Ajax

Ajax Mistakes

CSS

Browser Specific Syntax Rules Support (Chart)
CSS Compatibility and Internet Explorer (IE 5 through IE 8)
The CSS Position Property

HTML 5

Video: Introduction to HTML 5 - Brad Neuberg (Developer Programs, Google), Slides (PDF) - Oct, 2009
Modernizr - HTML 5 Support Detector Library
The HTML5 test - How well does your browser support HTML5?
HTML 5 Outliner

Flash MP3 Player

Google Search Result Links

Home - [Table of Contents]

Daniel Kirkdorffer — Mon, 01 Dec 2014 22:59:08 -0400

Home

Welcome to this wiki page powered by DokuWiki. This is a repository of notes, thoughts and information regarding various things, mostly technical and Java related. This is not a publicly editable wiki though - it is just a place I can capture info for easy access on the intertubes.

Here is a little bit about me.

General

Notes from Conferences and Symposiums - JavaOne, No Fluff Just Stuff
The Best of Technology Writing 2008
Other articles of interest - Computing, Clouds, JIRA & Confluence, SSO, CSV, Development
Data Structures And Algorithm Notes - Definitions, Q&A
ThoughtWorks Technology Radar

Seattle WingDing Notes - Notes and links for study iterations since 2008

Projects

Jenkins build-pipeline-plugin - Open Source Project I've contributed to.

Languages

Comparisons: Rosetta Code, Posters: O'Reilly - The History of Programming Languages, Levenez - Computer Languages History
Java - General Documentation, JSP and TagLibs, Hibernate, Ant Tools, Code Analyzers, Design Patterns, VM Memory, Q&A
- Spring - General Documentation, Sprint Security, Acegi
Python - General Documentation and References
Ruby - Rails, General Documentation and References
SQL - General Documentation, MySQL, Oracle, Explain Plans, Q&A
Web Based - Testing, Design, JavaScript, Ajax, CSS, HTML 5

Other

Web Services - General Documentation, SOA, ESB, Jersey, RESTEasy
Regular Expressions - General Documentation, Testing Tools and Analyzers

Platforms

Linux (also includes UNIX Notes) - Samba, SSH, VNC
Windows - Tools

Development

CVS - Quick Reference, Branching, Diffs
Git - General Documentation and References
Maven - Public Repos, pom.xml, Build Phases, Common Commands
Gradle - Documentation and References

Wiki

DokuWiki Notes - Information about syntax for using installed plugins

Home

Daniel Kirkdorffer — Mon, 13 May 2013 18:20:32 -0400

Home - created

Daniel Kirkdorffer — Thu, 02 May 2013 19:30:27 -0400