Parithi

START
SET numExhibits = Total number of exhibits
    FOR each exhibit e = 1 to numExhibits
    Find midpoint m
    Find adjacent exhibits of e by doing this
          FOR every other exhibit a = 1 to numExhibits do the following
          IF e is sharing coordinate(s) with a, add a.
          ELSE Line l drawn between e.m and a.m intersects any side s of exhibit
              FOR each exhibit x = 1 to numExhibits do the following
                  Use LeMothe’s algorithm to find intersection point of two line segments l and s.

Parithi

Get the connecting point on the open list which has the lowest score. Let’s call this point p.
Remove p from the open list and add p to the closed list.
FOR each connecting point q in p’s walkable adjacent points:
    IF q is in the closed list: Ignore it.
    IF q is not in the open list: Add it and compute its score.
    IF q is already in the open list: Check if the f score is lower when we use the current generated path to get there.
    If it is, update its score and update its parent as well.

Parithi

Keybase proof

I hereby claim:

• I am parithi on github.
• I am parithi (https://keybase.io/parithi) on keybase.
• I have a public key ASBr0T0TRgserl2p3KphBjUXoiKEBjyXiYl6UKR08ppD8Qo

To claim this, I am signing this object:

Parithi

C:\ubuntu_vagrant>vagrant ssh --debug
 INFO global: Vagrant version: 1.9.6
 INFO global: Ruby version: 2.3.4
 INFO global: RubyGems version: 2.5.2
 INFO global: VAGRANT_EXECUTABLE="C:\\HashiCorp\\Vagrant\\embedded\\gems\\gems\\vagrant-1.9.6\\bin\\vagrant"
 INFO global: VAGRANT_INSTALLER_EMBEDDED_DIR="C:\\HashiCorp\\Vagrant\\embedded"
 INFO global: VAGRANT_INSTALLER_ENV="1"
 INFO global: VAGRANT_INSTALLER_VERSION="2"
 INFO global: VAGRANT_LOG="debug"
 INFO global: VAGRANT_OLD_ENV_="ExitCode=00000002"

Parithi

package com.parithi;

import java.util.Arrays;

public class BubbleSort {

    public static void main(String[] args) {
        int[] array = {9,4,1,2,7,5,6,3,8};
        System.out.println(Arrays.toString(array));

Parithi

package com.vuforia.samples.VuforiaSamples.app.ImageTargets;

import android.opengl.GLES20;
import android.opengl.GLSurfaceView;

import com.threed.jpct.Camera;
import com.threed.jpct.Config;
import com.threed.jpct.FrameBuffer;
import com.threed.jpct.Light;
import com.threed.jpct.Loader;

Parithi

<ion-grid>
	<ion-row justify-content-center>
		<ion-col align-self-center size-md="6" size-lg="5" size-xs="12">
			<div text-center>
				<h4>Login Form</h4>
			</div>
			<div padding>
				<ion-item>
					<ion-input type="text" placeholder="Username"></ion-input>
				</ion-item>

Parithi

app-login {
    
}

$white-color: #fff;
$height100: 100%;

ion-grid {
    width:100%;
    height: $height100;

Parithi

Pushing to Multiple Git Repos

If a project has to have multiple git repos (e.g. Bitbucket and Github) then it's better that they remain in sync.

Usually this would involve pushing each branch to each repo in turn, but actually Git allows pushing to multiple repos in one go.

If in doubt about what git is doing when you run these commands, just

Parithi

function getName() {
    var names = ["Aaren","Aarika","Abagael","Abagail","Abbe","Abbey","Abbi","Abbie","Abby","Abbye","Abigael","Abigail","Abigale","Abra","Ada","Adah","Adaline","Adan","Adara","Adda","Addi","Addia","Addie","Addy","Adel","Adela","Adelaida","Adelaide","Adele","Adelheid","Adelice","Adelina","Adelind","Adeline","Adella","Adelle","Adena","Adey","Adi","Adiana","Adina","Adora","Adore","Adoree","Adorne","Adrea","Adria","Adriaens","Adrian","Adriana","Adriane","Adrianna","Adrianne","Adriena","Adrienne","Aeriel","Aeriela","Aeriell","Afton","Ag","Agace","Agata","Agatha","Agathe","Aggi","Aggie","Aggy","Agna","Agnella","Agnes","Agnese","Agnesse","Agneta","Agnola","Agretha","Aida","Aidan","Aigneis","Aila","Aile","Ailee","Aileen","Ailene","Ailey","Aili","Ailina","Ailis","Ailsun","Ailyn","Aime","Aimee","Aimil","Aindrea","Ainslee","Ainsley","Ainslie","Ajay","Alaine","Alameda","Alana","Alanah","Alane","Alanna","Alayne","Alberta","Albertina","Albertine","Albina","Alecia","Aleda","Aleece","Aleen","Alejandra","A