JKrag

Dear participant, in order to be prepared for our Git course please make sure that you have Git up and running.

You should be working with a reasonably recent version. The newest at time of writing is 2.42.1, but 2.28 and forward should be good enough for our needs.

Windows: Download appropriate installer from: https://git-scm.com/download/win

Mac: Download from: https://git-scm.com/download/mac or use Homebrew with brew install git.

Linux: Instructions for various distributions can be found at https://git-scm.com/download/linux

JKrag

Kære deltager.

Mit navn er Jan Krag, og det er mig, der skal undervise jer på IDA-kurset ”Mastering Version control with Git” den 9.-10. december.

Til dette kursus vil det være en stor hjælp hvis alle deltagere har installeret Git på forhånd. Gerne en nogenlunde ny version. Den nyeste for tiden hedder 2.24, men 2.18 eller 2.19 og frem burde ikke give problemer.

Windows: Download passende installer fra: https://git-scm.com/download/win

Mac: Enten Download fra: https://git-scm.com/download/mac eller brug Homebrew med “brew install git”.

JKrag

git config --global core.editor "'C:/Program Files/Notepad++/notepad++.exe' -multiInst -notabbar -nosession -noPlugin"

JKrag

echo "--- Containers ------------------------------------------------------"
if [[ $(hyper ps -aq) ]]; then
    echo "Deleting containers:"
	hyper rm -v -f `hyper ps -aq`
else
    echo "no containers found"
fi
echo "--- Volumes ---------------------------------------------------------"
if [[ $(hyper volume ls -q) ]]; then
    echo "Deleting Volumes:"

JKrag

echo "--- Containers ------------------------------------------------------"
hyper ps -a
echo "--- Volumes ---------------------------------------------------------"
hyper volume ls
echo "--- Images ----------------------------------------------------------"
hyper images
echo "--- FIP'S -----------------------------------------------------------"
hyper fip ls
echo "--- Services --------------------------------------------------------"
hyper service ls

JKrag

Mon May 30 00:31:40 UTC 2016

JKrag

// title      : OpenJSCAD.org Logo
// author     : Rene K. Mueller
// license    : MIT License
// revision   : 0.003
// tags       : Logo,Intersection,Sphere,Cube
// file       : logo.jscad

function main() {
   return union(
      difference(

JKrag

+++++ +++++             initialize counter (cell #0) to 10
[                       use loop to set 70/90/110/30/10
    > +++++ ++             add 7 to cell #1
    > +++++ ++++           add 9 to cell #2
    > +++++ +++++ +        add 11 to cell #3
    >+++                   add 3 to cell #4
    > +                    add 1 to cell #5
    <<<<< -                decrement counter in cell #0
]
> ++++ .                Increment cell #1 to 74 and print 'J'

JKrag

= Exploring Cat pedigress in Neo4J
:author: Jan Krag
:twitter: @jankrag

This is a Neo4J GraphGist where I discover how to model pedigrees in Neo, and various Cypher queries to explore the data.

The data used is from a public available online pedigree of cats. I have stripped of all the names and registration data for simplicity.
From a large dataset, I have extracted all the cats belonging to the very small breeds, giving a total of about 1000 cats instead of 200K. 

The following picture shows my general sketch of the data-model. The arrows between cats could also have been illustrated as "recursive" arrows 

JKrag

Exploring cat pedigrees in Neo4J

This is a Neo4J GraphGist where I discover how to model pedigrees in Neo, and various Cypher queries to explore the data.

The data used is from a public available online pedigree of cats. I have stripped of all the names and registration data for simplicity. From a large dataset, I have extracted all the cats belonging to the very small breeds, giving a total of about 600 cats instead of 200K.

The following picture shows a sketch of my general data-model. The arrows between cats could also have been illustrated as "recursive" arrows back to the same cat node-type, but I think that this visualisation better describes the DAG (Directed Acyclical Graph) property of a pedigree/family tree.