aamir batakpout

🎯

Focusing

Functional Programmer

batakpout / alternative, using regex

Created April 4, 2016 06:27 — forked from ArtemGr/alternative, using regex

CSV parser in Scala

	val pattern = java.util.regex.Pattern.compile ("""(?xs) ("(.?)"\|) ; ("(.?)"\|) (?: \r?\n \| \z ) """)
	val matcher = pattern.matcher (input)
	while (matcher.find) {
	val col1 = matcher.group (2)
	val col2 = matcher.group (4)
	// ...
	}

batakpout / eventStreamExample.scala

Created August 14, 2017 09:22 — forked from DanielaSfregola/eventStreamExample.scala

An example on how to use an EventStream in Akka. See article http://danielasfregola.com/2015/04/20/peer-to-many-communication-in-akka/

	import akka.actor._

	case class Book(title: String, authors: List[String])

	class BookPublisher extends Actor {

	def receive = {
	case book: Book => {
	println(s"Yeah! Publishing a new book: $book")
	context.system.eventStream.publish(book)

batakpout / customEventBusExample.scala

Created August 14, 2017 10:42 — forked from DanielaSfregola/customEventBusExample.scala

An example on how to customize an Event Bus in Akka. See article http://danielasfregola.com/2015/04/20/peer-to-many-communication-in-akka/

	import akka.actor._
	import akka.event.{LookupClassification, EventBus}
	import akka.event.ActorEventBus

	case class Book(title: String, authors: List[String])

	class AuthorBookBus(author: String) extends EventBus
	with LookupClassification
	with ActorEventBus {

batakpout / Tree.scala

Created June 30, 2020 04:42 — forked from codejitsu/Tree.scala

	/**
	* D Holbrook
	*
	* Code Club: PO1
	*
	* (*) Define a binary tree data structure and related fundamental operations.
	*
	* Use whichever language features are the best fit (this will depend on the language you have selected). The following operations should be supported:
	*
	* Constructors

batakpout / latency.txt

Created September 23, 2021 17:40 — forked from jboner/latency.txt

Latency Numbers Every Programmer Should Know

	Latency Comparison Numbers (~2012)
	----------------------------------
	L1 cache reference 0.5 ns
	Branch mispredict 5 ns
	L2 cache reference 7 ns 14x L1 cache
	Mutex lock/unlock 25 ns
	Main memory reference 100 ns 20x L2 cache, 200x L1 cache
	Compress 1K bytes with Zippy 3,000 ns 3 us
	Send 1K bytes over 1 Gbps network 10,000 ns 10 us
	Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD