31:Ta5a,getLimitsKross = { function getIndexToIns(arr, num) { return arr .concat(num) .sort((a, b) => a - b) .indexOf(num); } function indexOfSmallest(a) { var lowest = 0; for (var i = 1; i < a.length; i++) { if (a[i] < a[lowest]) lowest = i; } return lowest; } function getLimitsKross(a, b) { //these are sorted function getGrenze(gre) { return gre[1] == "b" ? b[gre[2]] + "-tau" : a[gre[2]]; } //a(t)b(tau+t) //0<a[last] //b[0]-t>a[last] //t Math.abs(c))) + Math.max.apply(this, a.map(c => Math.abs(c))), I = 1; do { //if(I==4)debugger; //compute differences //diff=[a[a.length-1]-a[a.length-2],b[1]-b[0]]; var d = b .map(c => c + t) .map(c => { var g = getIndexToIns(a, c) - 1; if (g == -1) return [Infinity, g]; return [c - a[g], g]; }); var bi = indexOfSmallest(d.map(c => c[0])); //bi is the index of b that should be moved //t is how much b should be shifted //thanks to d and bi we know //where b goes to var l = a .map((c, i) => [c, "a", i]) .concat(b.map((c, i) => [c + a[d[bi][1]] - b[bi], "b", i])); var info2 = trimBorder( l.sort((a, b) => a[0] - b[0] || a[1].charCodeAt() - b[1].charCodeAt()) ); var info = info2[0]; s += `${I++}. Fall ${b[bi]}-tau>${a[d[bi][1]]} ${previndex}= 0); return s; } function trimBorder(a) { var vc = { a: "b", b: "a" }, c = a.map(c => c[1]), counts = {}; a.slice(0, 1 + c.indexOf(vc[a[0][1]])) .map(c => c[1]) .forEach(function(x) { counts[x] = (counts[x] || 0) + 1; }); return [ a.slice( c.indexOf(vc[a[0][1]]), 1 + c.lastIndexOf(vc[a[a.length - 1][1]]) ), counts ]; } return getLimitsKross; }32:[] 2f:{"title":"fall Unterscheidung","cells":[{"id":0,"value":"md`# fall Unterscheidung`","pinned":true,"hidden":false,"mode":"ojs"},{"id":19,"value":"a = [-1, 0, 2]","pinned":true,"hidden":false,"mode":"ojs"},{"id":25,"value":"b=[1,5000]","pinned":true,"hidden":false,"mode":"ojs"},{"id":18,"value":"md`Fall unterscheidung von 2 stuckweise funktionen, a ist stückweise definiert in interval ${a.join(\n ','\n)} und b in interval ${b.join(',')}`","pinned":false,"hidden":false,"mode":"ojs"},{"id":7,"value":"getLimitsKross(a, b)","pinned":true,"hidden":false,"mode":"ojs"},{"id":13,"value":"md`getLimitsKross nimmt an, dass die Funktionen endlich sind, also in dieser fall, sind nur fall 1 bis 4 da v eine Heaviside funktion war`","pinned":true,"hidden":false,"mode":"ojs"},{"id":3,"value":"$31","pinned":false,"hidden":false,"mode":"ojs"}],"files":"$W32","stdlib":"1","titling":"auto"}