313314315316317318319320321322323
} beta = (delta - deltaMid) / deltaOld; break; default: // Should never happen. throw new MathInternalError(); } steepestDescent = newSteepestDescent; // Compute conjugate search direction. if (getIterations() % n == 0 ||
136137138139140141142143
switch (iterationOrder) { case LEXICOGRAPHIC: return new LexicographicIterator(n, k); default: throw new MathInternalError(); // Should never happen. } }
341342343344345346347348349350351
} } break; default: // Should never happen. throw new MathInternalError(); } previous = val[i]; } return true;
406407408409410411412413414415416
} } break; default: // Should never happen. throw new MathInternalError(); } previous = val[index]; }
15351536153715381539154015411542
list[i] = temp; } } break; default: throw new MathInternalError(); // Should never happen. } }
151152153154155156157158159
break; } } return pTotal; default: throw new MathInternalError(LocalizedFormats. OUT_OF_RANGE_SIMPLE, alternativeHypothesis, AlternativeHypothesis.TWO_SIDED, AlternativeHypothesis.LESS_THAN); } }
812813814815816817818819
case MULTIPLICATIVE: return MULTIPLICATIVE_MODE; case ADDITIVE: return ADDITIVE_MODE; default: throw new MathInternalError(); // Should never happen. } }
342343344345346347348349350351352
} } break; default: throw new MathInternalError(); // Cannot happen. } final Neuron aNeuron = network.getNeuron(identifiers[i][j]); for (long b : linkEnd) { final Neuron bNeuron = network.getNeuron(b);
148149150151152153154155
case ABOVE_SIDE : Assert.assertTrue(yResult.positiveOrNull()); break; default : // this should never happen throw new MathInternalError(null); } }
222223224225226227228229230231232
return (yA <= 0) ? xA : xB; case ABOVE_SIDE : return (yA < 0) ? xB : xA; default : // this should never happen throw new MathInternalError(null); } } // target for the next evaluation point double targetY;