adilakhter

object BinarySearchApp extends App{

    BinarySearch.execute(Array(1,2,3))(1) is Some(0)
    BinarySearch.execute(Array(1,2,3))(3) is Some(2)
    BinarySearch.execute(Array(1,2,3))(10) is None
}


object BinarySearch{

adilakhter

http://host:port/path/SampleService.svc/Categories(1)/Products?$top=2&$orderby=Name
\______________________________________/\____________________/ \__________________/
                  |                               |                       |
          service root URL                  resource path           query options

adilakhter

trait Functor[A,+M[_]] {
	def map2[B](f: A => B): M[B]
}

object Functor {
  implicit class SeqFunctor[A](seq: Seq[A]) extends Functor[A,Seq] {
    def map2[B](f: A => B): Seq[B] = seq map f
  }
  implicit class MapFunctor[K,V1](mapKV1: Map[K,V1]) extends Functor[K,({type λ[α] = Map[α,V1]})#λ] {
    def map2[K2](f: K => K2): Map[K2,V1] = mapKV1 map {

adilakhter

// Example HList with type member Hd
trait HList{
  type Hd
}

class IntList extends HList {
  type Hd = Int
}

adilakhter

import com.timgroup.statsd.NonBlockingStatsDClient;
import com.timgroup.statsd.StatsDClient;

public class DemoClient {

    public static void main(String[] args) throws InterruptedException {
        StatsDClient client = new NonBlockingStatsDClient("nc", "127.0.0.1", 8125);
        int counter = 100;

        client.gauge("activeroute.request",counter);

adilakhter

Requesting....0
Requesting....1
Requesting....2
Requesting....3
Buffer((0,200 OK), (1,200 OK), (2,200 OK), (3,200 OK))
Requesting....4
Requesting....5
Requesting....6
Requesting....7
Requesting....8

adilakhter

Following is the concurrent behaviour:

Iteration 1: No of Concurrent Request 12.  Result: 
 List(200 OK, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 200 OK, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 200 OK, 429 Too Many Requests)
Iteration 2: No of Concurrent Request 12.  Result: 
 List(429 Too Many Requests, 429 Too Many Requests, 200 OK, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests)
Iteration 3: No of Concurrent Request 12.  Result: 
 List(429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 200 OK, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests, 429 Too Many Requests)
Iteration 4: No of Concurrent Request 12.  Result: 
 L

adilakhter

case class MapFunctor[K,V](mapKV: Map[K,V]) 
  extends Functor[V, ({type L[a] = Map[K,a]})#L]{ 
    
    override def map[V2](f: V => V2): Map[K, V2] 
      = mapKV map{ case (k,v) => (k, f(v)) 
    } 
} 

adilakhter

Functor[A, +M[_]] 
=>
Functor[V, 
  (
    {
      type L[a] = Map[K, a] // structural type definition 
    } 
  ) #L // type projection 
]

adilakhter

case class ReadableMapFunctor[K,V](mapKV: Map[K,V]){
  def mapFunctor[V2] = {
    type `Map[K]`[V2] = Map[K, V2]
    new Functor[V, `Map[K]`] {
      override def map[V2](f: (V) => V2): `Map[K]`[V2] = mapKV map{
        case (k,v) => (k, f(v))
      }
    }
  }