Initiative of simplifying logic of Each/Count

[uselessgoddess]

In current implementation:

function CountBase {
    if query.Len == 0 {
        ...
    }

    if query.Len == 1 {
        ...
    }

    if query.Len == 2 {
        ...
    }
    . . . .
}

I suggest impl CountBase only for query of link size:

function CountBase {
    assert query.Len == 3
    . . . .
}

function CountExt {
    match query {
        [] => CountBase([Any, Any, Any])
        . . . .
        [id, from_id, to_id, ..] => CountBase([id, from_id, to_id])
    }
}

Also, i recommend add more complex logic for CountBase([Value, Value]). Anything that is more complicated than if or completely reject it query

[Konard]

I like the idea of simplification of logic to use only query.Len == 3 this will lead to smaller code and should make it even faster. This also removes the confusion about API, because Len == 1 or Len == 2 is closer to undefined behavior. We can try to make a benchmark of memory regular memory manager and simplified one to check how much performance gain we will get.