Hi
I can't figure out how to index bolded field in this complex document. If you have to time to look, I appreciate.

data.docx

var doc = [{
id: 14,
name: "xxxxx",
code: "0001",
term: 1,
term_id: 1,
Programs: {
program_name: "Surgery",
Program_Kind: {

steps to reproduce

Write a loop, from 1 to 80000, each time add a random int to the max heap.

In theory it takes very little time(NlogN, N=80000, <1sec ), but the program does take a long time.

I'v also tested the BinaryHeap in https://github.com/SolutionsDesign/Algorithmia, it performs well, so it is probably due to the bad algorithm.

It would be great if we could turn our maze into an adjacency matrix and see if we can solve it using matrix transformations (I'm not sure if that's possible). Ultimately, it would be fantastic if these could be solved on the GPU.

Search algorithms usually provide a String constructor.

Currently, that just lets us match the sequence of bytes encoded by that string (either in the default Charset, or one that's provided).

But since byteseek is byte oriented, a hex string (or full byteseek regex syntax) might be more useful. One person has already asked whether they can pass in hex string bytes directly to the searc