annotate src/uk/ac/qmul/eecs/depic/daw/Clip.java @ 0:3074a84ef81e

first import
author Fiore Martin <f.martin@qmul.ac.uk>
date Wed, 26 Aug 2015 16:16:53 +0100
parents
children 629262395647
rev   line source
f@0 1 /*
f@0 2 Cross-Modal DAW Prototype - Prototype of a simple Cross-Modal Digital Audio Workstation.
f@0 3
f@0 4 Copyright (C) 2015 Queen Mary University of London (http://depic.eecs.qmul.ac.uk/)
f@0 5
f@0 6 This program is free software: you can redistribute it and/or modify
f@0 7 it under the terms of the GNU General Public License as published by
f@0 8 the Free Software Foundation, either version 3 of the License, or
f@0 9 (at your option) any later version.
f@0 10
f@0 11 This program is distributed in the hope that it will be useful,
f@0 12 but WITHOUT ANY WARRANTY; without even the implied warranty of
f@0 13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
f@0 14 GNU General Public License for more details.
f@0 15
f@0 16 You should have received a copy of the GNU General Public License
f@0 17 along with this program. If not, see <http://www.gnu.org/licenses/>.
f@0 18 */
f@0 19 package uk.ac.qmul.eecs.depic.daw;
f@0 20
f@0 21 import uk.ac.qmul.eecs.depic.patterns.Range;
f@0 22
f@0 23
f@0 24 public class Clip extends Range<Integer> implements Comparable<Clip> {
f@0 25 private Sample sample;
f@0 26 private int sampleStart;
f@0 27 private float startMs;
f@0 28 private float endMs;
f@0 29 private float millisecPerChunk;
f@0 30 private float sampleStartMs;
f@0 31
f@0 32 public Clip(int start, int end, Sample sample, int sampleStart, float millisecPerChunk) {
f@0 33 super(start, end);
f@0 34 this.sample = sample;
f@0 35 this.sampleStart = sampleStart;
f@0 36
f@0 37 this.millisecPerChunk = millisecPerChunk;
f@0 38 updateTimeMs();
f@0 39 sampleStartMs = sampleStart * millisecPerChunk;
f@0 40 }
f@0 41
f@0 42 /**
f@0 43 *
f@0 44 * Copy constructor
f@0 45 *
f@0 46 * @param c another instance of {@code Clip}
f@0 47 */
f@0 48 public Clip(Clip c){
f@0 49 this(c.start,c.end,c.sample,c.sampleStart,c.millisecPerChunk);
f@0 50 }
f@0 51
f@0 52 private void updateTimeMs(){
f@0 53 startMs = start * millisecPerChunk;
f@0 54 endMs = end * (millisecPerChunk) + millisecPerChunk;
f@0 55 }
f@0 56
f@0 57 /**
f@0 58 * Shifts the clips of the amount given as argument
f@0 59 * @param amount
f@0 60 */
f@0 61 public void shift(int amount){
f@0 62 start += amount;
f@0 63 end = end += amount;
f@0 64
f@0 65 updateTimeMs();
f@0 66 }
f@0 67
f@0 68 public void setStartAt(int position){
f@0 69 int diff = position - start;
f@0 70 start = position;
f@0 71 end = end + diff;
f@0 72
f@0 73 updateTimeMs();
f@0 74 }
f@0 75
f@0 76 public Sample getSample() {
f@0 77 return sample;
f@0 78 }
f@0 79
f@0 80 /**
f@0 81 * Returns the chunks index where this selection starts relative to the start of the sample.
f@0 82 *
f@0 83 * This is different from {@code getStart()}, as {@code getStart()} returns the
f@0 84 * absolute position (a.k.a. chunk index) of the selection start
f@0 85 *
f@0 86 * @return
f@0 87 */
f@0 88 public int getSampleStart(){
f@0 89 return sampleStart;
f@0 90 }
f@0 91
f@0 92 public float getSampleStartMs(){
f@0 93 return sampleStartMs;
f@0 94 }
f@0 95
f@0 96 public float getStartTimeMs(){
f@0 97 return startMs;
f@0 98 }
f@0 99
f@0 100 public float getEndTimeMs(){
f@0 101 return endMs;
f@0 102 }
f@0 103
f@0 104 public float getMillisecPerChunk(){
f@0 105 return millisecPerChunk;
f@0 106 }
f@0 107
f@0 108 /**
f@0 109 * Checks whether {@code p} is contained in the selection,
f@0 110 * that is greater than {@code getStart()} and lower than {@code getEnd()}.
f@0 111 *
f@0 112 *
f@0 113 * @param p the integer value to check for
f@0 114 * @return {@code true} if {@code pos} is contained in the selection, {@code false} otherwise
f@0 115 */
f@0 116 public boolean contains(int pos){
f@0 117 return ((pos>=getStart()) && (pos<=getEnd()));
f@0 118 }
f@0 119
f@0 120 public boolean containsTime(float time){
f@0 121 return time >= startMs && time <= endMs;
f@0 122 }
f@0 123
f@0 124 /**
f@0 125 * Splits the selection around the given position.
f@0 126 *
f@0 127 * If {@code pos} is less than the clip start or greater than the clip end, then the array will have size 1 and will
f@0 128 * contain this Clip. Conversely if {@code pos} is contained in this clip an array with two new instances of {@code Clip} is returned. The clip at index 0, will range
f@0 129 * from {@code geStart()} to {@code pos-1}, whereas the clip at index 1 will range from {@code pos} to {@code getEnd()}
f@0 130 *
f@0 131 *
f@0 132 * @param pos the split position
f@0 133 * @return an array of one or two clips, resulted from a split at position {@code pos}
f@0 134 */
f@0 135 public Clip [] split(int pos){
f@0 136 /* if pos can go from start+1 to end *
f@0 137 * if pos == start+1, the split will be [start,start] and [start+1,end] *
f@0 138 * if pos == end, the split will be [start,end-1] and [end,end] */
f@0 139 if(pos <= getStart() || pos > getEnd()){
f@0 140 return new Clip [] {this};
f@0 141 }else{
f@0 142 return new Clip [] {
f@0 143 new Clip(getStart(),pos-1,sample,sampleStart,millisecPerChunk),
f@0 144 new Clip(pos,getEnd(),sample,sampleStart+pos-getStart(),millisecPerChunk)
f@0 145 };
f@0 146 }
f@0 147 }
f@0 148
f@0 149 @Override
f@0 150 public int compareTo(Clip s) {
f@0 151 return getStart().compareTo(s.getStart());
f@0 152 }
f@0 153
f@0 154 @Override
f@0 155 public String toString(){
f@0 156 return super.toString()+ ", selection in Ms:["+startMs+","+endMs+"], sample:"+ sample+ ", sample start:" +sampleStart;
f@0 157 }
f@0 158
f@0 159 public static Clip join(Clip clip1, Clip clip2){
f@0 160 /* nulls not joinable */
f@0 161 if(clip1 == null || clip2 == null){
f@0 162 return null;
f@0 163 }
f@0 164
f@0 165 /* clips with different sample or different resolution not joinable */
f@0 166 if(!clip1.sample.equals(clip2.sample) || clip1.millisecPerChunk != clip2.millisecPerChunk ){
f@0 167 return null;
f@0 168 }
f@0 169
f@0 170 /* try clip2 after clip1 */
f@0 171 if(clip1.end+1 == clip2.start){
f@0 172 int clip1Len = clip1.end - clip1.start;
f@0 173
f@0 174 if(clip1.sampleStart + clip1Len + 1 == clip2.sampleStart){
f@0 175 return new Clip(
f@0 176 clip1.start,
f@0 177 clip2.end,
f@0 178 clip1.sample,
f@0 179 clip1.sampleStart,
f@0 180 clip1.millisecPerChunk
f@0 181 );
f@0 182 }
f@0 183 /* try clip1 after clip2 */
f@0 184 }else if(clip2.end+1 == clip1.start){
f@0 185 int clip2Len = clip2.end - clip2.start;
f@0 186
f@0 187 if(clip2.sampleStart + clip2Len + 1 == clip2.sampleStart){
f@0 188 return new Clip(
f@0 189 clip2.start,
f@0 190 clip1.end,
f@0 191 clip2.sample,
f@0 192 clip2.sampleStart,
f@0 193 clip2.millisecPerChunk
f@0 194 );
f@0 195 }
f@0 196 }
f@0 197
f@0 198 /* not joinable */
f@0 199 return null;
f@0 200 }
f@0 201
f@0 202 }