|
| 1 | + |
| 2 | +package com.breakfastquay.rubberband.test; |
| 3 | + |
| 4 | +import com.breakfastquay.rubberband.RubberBandStretcher; |
| 5 | + |
| 6 | +import java.util.TreeMap; |
| 7 | + |
| 8 | +public class RubberBandTest |
| 9 | +{ |
| 10 | + |
| 11 | + public static void main(String[] args) { |
| 12 | + |
| 13 | + int channels = 1; |
| 14 | + int rate = 44100; |
| 15 | + |
| 16 | + RubberBandStretcher stretcher = new RubberBandStretcher |
| 17 | + (rate, |
| 18 | + channels, |
| 19 | + RubberBandStretcher.OptionEngineFiner + |
| 20 | + RubberBandStretcher.OptionProcessOffline, |
| 21 | + 1.0, |
| 22 | + 1.0); |
| 23 | + |
| 24 | + stretcher.setTimeRatio(1.5); |
| 25 | + stretcher.setPitchScale(0.8); |
| 26 | + |
| 27 | + System.err.println |
| 28 | + (String.format("Channel count: %d\n" + |
| 29 | + "Time ratio: %f\n" + |
| 30 | + "Pitch scale: %f\n" + |
| 31 | + "Preferred start pad: %d\n" + |
| 32 | + "Start delay: %d\n" + |
| 33 | + "Process size limit: %d", |
| 34 | + stretcher.getChannelCount(), |
| 35 | + stretcher.getTimeRatio(), |
| 36 | + stretcher.getPitchScale(), |
| 37 | + stretcher.getPreferredStartPad(), |
| 38 | + stretcher.getStartDelay(), |
| 39 | + stretcher.getProcessSizeLimit() |
| 40 | + )); |
| 41 | + |
| 42 | + int blocksize = 1024; |
| 43 | + int blocks = 400; |
| 44 | + double freq = 440.0; |
| 45 | + |
| 46 | + stretcher.setMaxProcessSize(blocksize); |
| 47 | + |
| 48 | + TreeMap<Long, Long> keyFrameMap = new TreeMap<Long, Long>(); |
| 49 | + keyFrameMap.put((long)(3 * rate), (long)(4 * rate)); |
| 50 | + keyFrameMap.put((long)(5 * rate), (long)(5 * rate)); |
| 51 | + stretcher.setKeyFrameMap(keyFrameMap); |
| 52 | + |
| 53 | + float[][] buffer = new float[channels][blocksize]; |
| 54 | + |
| 55 | + int i0 = 0; |
| 56 | + |
| 57 | + for (int block = 0; block < blocks; ++block) { |
| 58 | + |
| 59 | + for (int c = 0; c < channels; ++c) { |
| 60 | + for (int i = 0; i < blocksize; ++i) { |
| 61 | + buffer[c][i] = (float)Math.sin |
| 62 | + ((double)i0 * freq * Math.PI * 2.0 / (double)rate); |
| 63 | + if (i0 % rate == 0) { |
| 64 | + buffer[c][i] = 1.f; |
| 65 | + } |
| 66 | + ++i0; |
| 67 | + } |
| 68 | + } |
| 69 | + |
| 70 | + stretcher.study(buffer, block + 1 == blocks); |
| 71 | + } |
| 72 | + |
| 73 | + i0 = 0; |
| 74 | + |
| 75 | + for (int block = 0; block < blocks; ++block) { |
| 76 | + |
| 77 | + for (int c = 0; c < channels; ++c) { |
| 78 | + for (int i = 0; i < blocksize; ++i) { |
| 79 | + buffer[c][i] = (float)Math.sin |
| 80 | + ((double)i0 * freq * Math.PI * 2.0 / (double)rate); |
| 81 | + if (i0 % rate == 0) { |
| 82 | + buffer[c][i] = 1.f; |
| 83 | + } |
| 84 | + ++i0; |
| 85 | + } |
| 86 | + } |
| 87 | + |
| 88 | + stretcher.process(buffer, block + 1 == blocks); |
| 89 | + |
| 90 | + while (true) { |
| 91 | + int available = stretcher.available(); |
| 92 | + if (available <= 0) { |
| 93 | + break; |
| 94 | + } |
| 95 | + int requested = available; |
| 96 | + if (requested > blocksize) { |
| 97 | + requested = blocksize; |
| 98 | + } |
| 99 | + int obtained = stretcher.retrieve(buffer, 0, requested); |
| 100 | + for (int i = 0; i < obtained; ++i) { |
| 101 | + System.out.println(Float.toString(buffer[0][i])); |
| 102 | + } |
| 103 | + } |
| 104 | + } |
| 105 | + |
| 106 | + stretcher.dispose(); |
| 107 | + } |
| 108 | + |
| 109 | +} |
| 110 | + |
0 commit comments