All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.googlecode.mp4parser.boxes.mp4.samplegrouping.RateShareEntry Maven / Gradle / Ivy

Go to download

A generic parser and writer for all ISO 14496 based files (MP4, Quicktime, DCF, PDCF, ...)

The newest version!
/*
 * Copyright 2012 castLabs, Berlin
 *
 * Licensed under the Apache License, Version 2.0 (the License);
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an AS IS BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */


package com.googlecode.mp4parser.boxes.mp4.samplegrouping;

import com.coremedia.iso.IsoTypeReader;
import com.coremedia.iso.IsoTypeWriter;

import java.nio.ByteBuffer;
import java.util.LinkedList;
import java.util.List;

import static com.googlecode.mp4parser.util.CastUtils.l2i;

/**
 * 

4cc = "{@value #TYPE}"

*

Each sample of a track may be associated to (zero or) one of a number of sample group descriptions, each of * which defines a record of rate-share information. Typically the same rate-share information applies to many * consecutive samples and it may therefore be enough to define two or three sample group descriptions that * can be used at different time intervals.

*

The grouping type 'rash' (short for rate share) is defined as the grouping criterion for rate share information. * Zero or one sample-to-group box ('sbgp') for the grouping type 'rash' can be contained in the sample * table box ('stbl') of a track. It shall reside in a hint track, if a hint track is used, otherwise in a media track.

*

Target rate share may be specified for several operation points that are defined in terms of the total available * bitrate, i.e., the bitrate that should be shared. If only one operation point is defined, the target rate share * applies to all available bitrates. If several operation points are defined, then each operation point specifies a * target rate share. Target rate share values specified for the first and the last operation points also specify the * target rate share values at lower and higher available bitrates, respectively. The target rate share between two * operation points is specified to be in the range between the target rate shares of those operation points. One * possibility is to estimate with linear interpolation.

*/ public class RateShareEntry extends GroupEntry { public static final String TYPE = "rash"; private short operationPointCut; private short targetRateShare; private List entries = new LinkedList(); private int maximumBitrate; private int minimumBitrate; private short discardPriority; @Override public String getType() { return TYPE; } @Override public void parse(ByteBuffer byteBuffer) { operationPointCut = byteBuffer.getShort(); if (operationPointCut == 1) { targetRateShare = byteBuffer.getShort(); } else { int entriesLeft = operationPointCut; while (entriesLeft-- > 0) { entries.add(new Entry(l2i(IsoTypeReader.readUInt32(byteBuffer)), byteBuffer.getShort())); } } maximumBitrate = l2i(IsoTypeReader.readUInt32(byteBuffer)); minimumBitrate = l2i(IsoTypeReader.readUInt32(byteBuffer)); discardPriority = (short) IsoTypeReader.readUInt8(byteBuffer); } @Override public ByteBuffer get() { ByteBuffer buf = ByteBuffer.allocate(operationPointCut == 1 ? 13 : (operationPointCut * 6 + 11)); buf.putShort(operationPointCut); if (operationPointCut == 1) { buf.putShort(targetRateShare); } else { for (Entry entry : entries) { buf.putInt(entry.getAvailableBitrate()); buf.putShort(entry.getTargetRateShare()); } } buf.putInt(maximumBitrate); buf.putInt(minimumBitrate); IsoTypeWriter.writeUInt8(buf, discardPriority); buf.rewind(); return buf; } @Override public boolean equals(Object o) { if (this == o) { return true; } if (o == null || getClass() != o.getClass()) { return false; } RateShareEntry that = (RateShareEntry) o; if (discardPriority != that.discardPriority) { return false; } if (maximumBitrate != that.maximumBitrate) { return false; } if (minimumBitrate != that.minimumBitrate) { return false; } if (operationPointCut != that.operationPointCut) { return false; } if (targetRateShare != that.targetRateShare) { return false; } if (entries != null ? !entries.equals(that.entries) : that.entries != null) { return false; } return true; } @Override public int hashCode() { int result = (int) operationPointCut; result = 31 * result + (int) targetRateShare; result = 31 * result + (entries != null ? entries.hashCode() : 0); result = 31 * result + maximumBitrate; result = 31 * result + minimumBitrate; result = 31 * result + (int) discardPriority; return result; } public short getOperationPointCut() { return operationPointCut; } public void setOperationPointCut(short operationPointCut) { this.operationPointCut = operationPointCut; } public short getTargetRateShare() { return targetRateShare; } public void setTargetRateShare(short targetRateShare) { this.targetRateShare = targetRateShare; } public List getEntries() { return entries; } public void setEntries(List entries) { this.entries = entries; } public int getMaximumBitrate() { return maximumBitrate; } public void setMaximumBitrate(int maximumBitrate) { this.maximumBitrate = maximumBitrate; } public int getMinimumBitrate() { return minimumBitrate; } public void setMinimumBitrate(int minimumBitrate) { this.minimumBitrate = minimumBitrate; } public short getDiscardPriority() { return discardPriority; } public void setDiscardPriority(short discardPriority) { this.discardPriority = discardPriority; } public static class Entry { int availableBitrate; short targetRateShare; public Entry(int availableBitrate, short targetRateShare) { this.availableBitrate = availableBitrate; this.targetRateShare = targetRateShare; } @Override public String toString() { return "{" + "availableBitrate=" + availableBitrate + ", targetRateShare=" + targetRateShare + '}'; } public int getAvailableBitrate() { return availableBitrate; } public void setAvailableBitrate(int availableBitrate) { this.availableBitrate = availableBitrate; } public short getTargetRateShare() { return targetRateShare; } public void setTargetRateShare(short targetRateShare) { this.targetRateShare = targetRateShare; } @Override public boolean equals(Object o) { if (this == o) { return true; } if (o == null || getClass() != o.getClass()) { return false; } Entry entry = (Entry) o; if (availableBitrate != entry.availableBitrate) { return false; } if (targetRateShare != entry.targetRateShare) { return false; } return true; } @Override public int hashCode() { int result = availableBitrate; result = 31 * result + (int) targetRateShare; return result; } } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy