allanx2000

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class Solution {

allanx2000

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class Solution {

allanx2000

using System;
using System.Collections.Generic;

namespace PrintOval
{
    class Program
    {
        static void Main(string[] args)
        {
            string str = "hairyass ";

allanx2000

/*
For node.js... maybe not needed... http://solutionoptimist.com/2013/12/27/javascript-promise-chains-2/

Executes multiple queries using Sequalize (in general executes Promises (async) in a synchrounous but where further Promises 
may be added depending on some business logic (onResult). 

i.e. if 2/5 queries return no data, create these, then continue once all the needed records are created. 

Basically for processing forms data that has multiple fields that need to be created on several tables... if they are not already there.

allanx2000

public class LinearProbingHT<T1, T2> extends HashTable<T1, T2> {

	private int size = 0;
	private Object[] nodes;

	public LinearProbingHT(int initSize) {
		nodes = new Object[initSize];
	}

	private int getIndexFromHash(T1 key) {

allanx2000

import java.util.LinkedList;


public class HashTable<T1,T2> {
	
	public static void main(String[] args)
	{
		HashTable<String,String> ht = new HashTable<>(10);
		
		ht.put("Hello", "World");

allanx2000

import java.util.Comparator;
import java.util.LinkedList;


public class RBTree<T1,T2> {
	
	
	public static final boolean RED = true;
	public static final boolean BLACK = false;
	

allanx2000

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace BatchMove
{
    class Program