Handle negative and >=1 slice steps in pyfaust and do the same as what 8db762bf did for matfaust.

These non-one step functions rely on the same backend C++ code as fancy indexing.

Related issues: #30, #32, #11.