| ~> scala | |
| Welcome to Scala version 2.11.6 (Java HotSpot(TM) 64-Bit Server VM, Java 1.8.0_66). | |
| Type in expressions to have them evaluated. | |
| Type :help for more information. | |
| scala> class Foo { lazy val bar = 2 } | |
| defined class Foo | |
| scala> :javap Foo | |
| Size 831 bytes |
| def mergeFields(vs1: List[JField], vs2: List[JField]): List[JField] = { | |
| def mergeRec(xleft: List[JField], yleft: List[JField]): List[JField] = xleft match { | |
| case Nil => yleft | |
| case (xn, xv) :: xs => yleft find (_._1 == xn) match { | |
| case Some(y @ (yn, yv)) => | |
| JField(xn, merge(xv, yv)) :: mergeRec(xs, yleft filterNot (_ == y)) | |
| case None => JField(xn, xv) :: mergeRec(xs, yleft) | |
| } | |
| } |
The objectives of CBOR, roughly in decreasing order of importance, are:
A couple open source .NET projects have need for a headache-free storage option. [Jump-Location][1] is a command line tool that currently uses flat files to store information about what directories a user has visited. Flat files were great at first, but we need more. Also, PSReadLine is also running into similar problems.
This will most likely wrap an existing storage engine to take care of the administrative tasks. We'll have to choose a storage engine that meets some basic requirements.
| module Test.Main where | |
| import Debug.Trace | |
| import Data.Char | |
| import Data.String | |
| parse [] = [] | |
| -- Error: unexpected "'" | |
| parse ('h':cs) = cs | |
| parse (c:cs) = c:c:cs |
I hereby claim:
To claim this, I am signing this object:
| implicit class BecauseFsharp[T](obj: T) { | |
| /** | |
| * This comes from OCaml/F#; very handy when used with partial function | |
| * application. It's mainly useful for reducing parenthesis nesting. | |
| * | |
| * `foo(bar)` is same as `bar |> foo` | |
| */ | |
| @inline def |>[U](function: T => U): U = function(obj) | |
| } |
As for statements equating MQTT with CoAP style REST and why they're not complete or true:
CoAP URI path == MQTT topic
This appears to be true because they have a lot in common. In reality an MQTT topic is ephemeral (or you could say it's just a convention). You don't create it, you don't delete it, you just use it to synchronize where you're publishing and where you're subscribing.
A CoAP URI is material. Or at least it is with Californium, and I believe it has to be this way as long as CoAP is used in conjunction with CoRE link formats because all resources have to be enumerated so they can be described by the CoRE document.
I already have a ring of servers (message brokers, to be precise) that uses Cassandra to persist data needed to recover from a crash. We played with some configurations and realized that we get much better performance if we run Cassandra on the same box as the app. The row key is well distributed, so 1/n chance that the IO operation can be performed locally. The traffic is also well distributed (it's a safe assumption) so the question is, why rely on the row key to distribute the rows around the ring? Why can't I just assume the local shard is the master that I want to write to? This would give me a 100% chance that the IO operation can be performed locally.
I assume this is a bit of a corner case, so there's probably nothing pre-boxed for my situation. But is there something that would function as a good starting point?
| sealed trait ParseTree | |
| sealed trait ValueNode extends ParseTree | |
| sealed trait PrimitiveValueNode extends ValueNode | |
| case class OrNode(left: ParseTree, right: ParseTree) extends ParseTree | |
| case class AndNode(left: ParseTree, right: ParseTree) extends ParseTree | |
| case class BoolNode(value: Boolean) extends PrimitiveValueNode | |
| case class IntNode(value: Int) extends PrimitiveValueNode | |
| case class StringNode(value: String) extends PrimitiveValueNode | |
| // Use refined trait ValueNode to better describe what value can *actually* hold |