public class RepeatFinder extends Exchange
FindRepeat
function of Graham Dixon's ("mathdon") C++ library ExchangeIR.
This function/class takes a signal as a timing list of alternating MARK and SPACE times in microseconds
and analyzes it for a repeat section, returning the burst counts of the single, repeat and extra
sections and the number of copies of the repeat section in the signal. The length (in bursts)
of the timing list is:
sngl_count + rpts*rpt_count + extra_countThe
errlimit
parameter is used in determining whether two times should be considered as nominally
equal. Two times are nominally equal if they are either within 2.5% of one another or if their
difference in microseconds does not exceed errlimit
. The errlimit criterion represents a
variation inherent in the signal capture mechanism, the percentage criterion represents natural
variations in the signal.Analyzer
errlimit, versionString
Constructor and Description |
---|
RepeatFinder(int[] times,
int errlimit)
Constructor
|
Modifier and Type | Method and Description |
---|---|
int |
getNoEndingBursts() |
int |
getNoIntroBursts() |
int |
getNoRepeatBursts() |
int |
getNoRepeats() |
String |
toString() |
equalTimes, equalTimes, getVersion, outputDebugString, outputDebugString, setDebug
public RepeatFinder(int[] times, int errlimit)
times
- Integer timing list of alternating MARK and SPACE times in microsecondserrlimit
- Two times are nominally equal if they are either within 2.5% of one another or if their
difference in microseconds does not exceed errlimit
.Copyright © 2016. All rights reserved.