You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
2 lines
2.3 KiB
2 lines
2.3 KiB
!function(e){var t={};function n(r){if(t[r])return t[r].exports;var u=t[r]={i:r,l:!1,exports:{}};return e[r].call(u.exports,u,u.exports,n),u.l=!0,u.exports}n.m=e,n.c=t,n.d=function(e,t,r){n.o(e,t)||Object.defineProperty(e,t,{enumerable:!0,get:r})},n.r=function(e){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})},n.t=function(e,t){if(1&t&&(e=n(e)),8&t)return e;if(4&t&&"object"==typeof e&&e&&e.__esModule)return e;var r=Object.create(null);if(n.r(r),Object.defineProperty(r,"default",{enumerable:!0,value:e}),2&t&&"string"!=typeof e)for(var u in e)n.d(r,u,function(t){return e[t]}.bind(null,u));return r},n.n=function(e){var t=e&&e.__esModule?function(){return e.default}:function(){return e};return n.d(t,"a",t),t},n.o=function(e,t){return Object.prototype.hasOwnProperty.call(e,t)},n.p="",n(n.s=79)}({18:function(e,t){e.exports=function(e,t,n){return t in e?Object.defineProperty(e,t,{value:n,enumerable:!0,configurable:!0,writable:!0}):e[t]=n,e}},6:function(e,t,n){"use strict";n.d(t,"b",(function(){return r})),n.d(t,"a",(function(){return u}));const r="mx-voice-worklet";let u;!function(e){e.Timekeep="timekeep",e.AmplitudeMark="amplitude_mark"}(u||(u={}))},79:function(e,t,n){"use strict";n.r(t);var r=n(18),u=n.n(r),o=n(6),i=n(9);class c extends AudioWorkletProcessor{constructor(...e){super(...e),u()(this,"nextAmplitudeSecond",0)}process(e,t,n){const r=Math.round(currentTime);if(r===this.nextAmplitudeSecond){const t=e[0][0],n=Math.min(...t),u=Math.max(...t),c=Object(i.c)(u,-1,1)-Object(i.c)(n,-1,1);this.port.postMessage({ev:o.a.AmplitudeMark,amplitude:c,forSecond:r}),this.nextAmplitudeSecond++}return this.port.postMessage({ev:o.a.Timekeep,timeSeconds:currentTime}),!0}}registerProcessor(o.b,c),t.default=null},9:function(e,t,n){"use strict";function r(e,t){return Number.isFinite(e)?Number(e):t}function u(e,t,n){return Math.min(Math.max(e,t),n)}function o(...e){return[...e].reduce((e,t)=>t+e,0)}function i(e,t,n){return e*(n-t)+t}function c(e,t,n){return(e-t)/(n-t)}n.d(t,"b",(function(){return r})),n.d(t,"a",(function(){return u})),n.d(t,"e",(function(){return o})),n.d(t,"d",(function(){return i})),n.d(t,"c",(function(){return c}))}});
|
|
//# sourceMappingURL=recorder-worklet.js.map
|