//--------------------------
// SUPERSEDED BY `bTaylorShift` !!
//--------------------------

// /**
//  * Returns the result of performing a change of variables of the 
//  * form: p(x) <- p(x + b).
//  * 
//  * * see [this stackoverflow question](http://stackoverflow.com/questions/141422/how-can-a-transform-a-polynomial-to-another-coordinate-system)
//  * 
//  * @param p a polynomial with coefficients given densely as an array of
//  * bigints from highest to lowest power, e.g. `[5n,-3n,0n]` represents the 
//  * polynomial `5x^2 - 3x`
//  * @param b the `b` in `x + b`
//  * 
//  * @example
//  * ```typescript
//  * bChangeVariablesTranslateX([1n,2n,7n], 3n); //=> [1n, 8n, 22n]
//  * ```
//  * 
//  * @doc
//  */
// function bChangeVariablesTranslateX(
//         p: bigint[], 
//         b: bigint): bigint[] {

//     // We let the coefficients of p(x + b) be denoted by d_i in the code below. 
//     // d_i is calculated as d = T*c, where c are the original coefficients.
     
//     const d = p.length-1;

//     if (d < 0) { return []; }
    
//     // Initialize a zero matrix
//     const t = new Array<Array<bigint>>(d+1);
//     for (let i=0; i<d+1; i++) {
//         t[i] = new Array(d+1).fill(0n);
//     }

//     // Calculate the triangular matrix T
//     t[0][0] = 1n;
//     for (let j=1; j<=d; j++) {
//         t[0][j] = b*t[0][j-1];
//         for (let i=1; i<=j; i++) {
//             t[i][j] = b*t[i][j-1] + t[i-1][j-1];
//         }
//     }
    
//     // Multiply
//     const res: bigint[] = new Array(d+1).fill(0n);
//     for (let i=0; i<=d; i++) {
//         res[d-i] = 0n;
//         for (let j=i; j<=d; j++) {
//             const acc = t[i][j] * p[d-j];
//             res[d-i] += acc;
//         }
//     }
    
//     return res;
// }


// export { bChangeVariablesTranslateX }