biskandar

import kotlinx.coroutines.*
import java.time.Instant
import java.time.format.DateTimeFormatter
import java.util.concurrent.ExecutorService
import java.util.concurrent.Executors

fun main(args: Array<String>) {
    exampleBlocking()
    exampleBlockingDispatcher()
    exampleLaunchGlobal()

biskandar

package test;

import java.util.Scanner;

public class Test2 {

	public static void main(String[] args) {

		Scanner keyboard = new Scanner(System.in);

biskandar

void loop() {
  
  // verify if there is new client connected
  EthernetClient client = server.available() ;
  if ( !client ) return ;
  
  // prepare for reading request data
  boolean isBlankLine = true ;
  
  // read and proces the client request data

biskandar

#include <SPI.h>
#include <Ethernet.h>
#include <LiquidCrystal.h>

// prepare for lcd shield
LiquidCrystal lcd( 8 , 9 , 4 , 5 , 6 , 7 ) ;

// prepare for ethernet shield
byte mac[] = { 0x00 , 0x08 , 0xDC , 0x00 , 0x00 , 0x09 } ;

biskandar

package com.disney.storm;

import org.apache.storm.Config;
import org.apache.storm.LocalCluster;
import org.apache.storm.trident.TridentState;
import org.apache.storm.trident.TridentTopology;
import org.apache.storm.trident.operation.BaseFunction;
import org.apache.storm.trident.operation.TridentCollector;
import org.apache.storm.trident.operation.builtin.Count;
import org.apache.storm.trident.spout.IBatchSpout;

biskandar

package com.careercup.linkedlist;

public class DoubleLinkedList<AnyType> {
  
  private Node<AnyType> nodeFirst;
  private Node<AnyType> nodeLast;
  private Node<AnyType> nodeIndex;
  
  public DoubleLinkedList() {
    nodeFirst = null;

biskandar

package com.careercup.linkedlist;

public class CircularDoubleLinkedList {
  
  public static class Node<AnyType> {
    
    private AnyType       data;
    private Node<AnyType> next;
    private Node<AnyType> prev;
    

biskandar

package com.careercup.linkedlist;

public class CircularLinkedList {
  
  public static class Node<AnyType> {
    
    private AnyType       data;
    private Node<AnyType> next;
    
    public Node( AnyType data ) {

biskandar

package introalgo.chap2;

import java.util.Random;

public class MergeSort2 {
  
  static int[] init( int max ) {
    int[] data = new int[max];
    Random random = new Random();
    for (int i = 0; i < data.length; i++) {

biskandar

package introalgo.chap2;

import java.util.Random;

public class MergeSort1 {
  
  static int[] init( int max ) {
    int[] data = new int[max];
    Random random = new Random();
    for (int i = 0; i < data.length; i++) {