mirror of
https://git.femboyfinancial.jp/james/lipsync.git
synced 2024-11-28 21:11:59 -08:00
186 lines
7.3 KiB
C#
186 lines
7.3 KiB
C#
/*
|
|
* VsqNrpn.cs
|
|
* Copyright (c) 2008-2009 kbinani
|
|
*
|
|
* This file is part of Boare.Lib.Vsq.
|
|
*
|
|
* Boare.Lib.Vsq is free software; you can redistribute it and/or
|
|
* modify it under the terms of the BSD License.
|
|
*
|
|
* Boare.Lib.Vsq is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
*/
|
|
using System;
|
|
using System.Collections.Generic;
|
|
|
|
using bocoree;
|
|
|
|
namespace Boare.Lib.Vsq {
|
|
|
|
using boolean = System.Boolean;
|
|
|
|
public struct VsqNrpn : IComparable<VsqNrpn> {
|
|
public int Clock;
|
|
public ushort Nrpn;
|
|
public byte DataMsb;
|
|
public byte DataLsb;
|
|
public boolean DataLsbSpecified;
|
|
public boolean msbOmitRequired;
|
|
private Vector<VsqNrpn> m_list;
|
|
|
|
public VsqNrpn( int clock, ushort nrpn, byte data_msb ) {
|
|
Clock = clock;
|
|
Nrpn = nrpn;
|
|
DataMsb = data_msb;
|
|
DataLsb = 0x0;
|
|
DataLsbSpecified = false;
|
|
msbOmitRequired = false;
|
|
m_list = new Vector<VsqNrpn>();
|
|
}
|
|
|
|
public VsqNrpn( int clock, ushort nrpn, byte data_msb, byte data_lsb ) {
|
|
Clock = clock;
|
|
Nrpn = nrpn;
|
|
DataMsb = data_msb;
|
|
DataLsb = data_lsb;
|
|
DataLsbSpecified = true;
|
|
msbOmitRequired = false;
|
|
m_list = new Vector<VsqNrpn>();
|
|
}
|
|
|
|
public VsqNrpn[] expand() {
|
|
Vector<VsqNrpn> ret = new Vector<VsqNrpn>();
|
|
if ( DataLsbSpecified ) {
|
|
VsqNrpn v = new VsqNrpn( Clock, Nrpn, DataMsb, DataLsb );
|
|
v.msbOmitRequired = msbOmitRequired;
|
|
ret.add( v );
|
|
} else {
|
|
VsqNrpn v = new VsqNrpn( Clock, Nrpn, DataMsb );
|
|
v.msbOmitRequired = msbOmitRequired;
|
|
ret.add( v );
|
|
}
|
|
for ( int i = 0; i < m_list.size(); i++ ) {
|
|
ret.addAll( m_list.get( i ).expand() );
|
|
}
|
|
return ret.toArray( new VsqNrpn[]{} );
|
|
}
|
|
|
|
public static Vector<VsqNrpn> sort( Vector<VsqNrpn> list ) {
|
|
Vector<VsqNrpn> ret = new Vector<VsqNrpn>();
|
|
Collections.sort( list );
|
|
if ( list.size() >= 2 ) {
|
|
Vector<VsqNrpn> work = new Vector<VsqNrpn>(); //workには、clockが同じNRPNだけが入る
|
|
int last_clock = list.get( 0 ).Clock;
|
|
work.add( list.get( 0 ) );
|
|
for ( int i = 1; i < list.size(); i++ ) {
|
|
if ( list.get( i ).Clock == last_clock ) {
|
|
work.add( list.get( i ) );
|
|
} else {
|
|
// まずworkを並べ替え
|
|
last_clock = list.get( i ).Clock;
|
|
boolean changed = true;
|
|
while ( changed ) {
|
|
changed = false;
|
|
for ( int j = 0; j < work.size() - 1; j++ ) {
|
|
byte nrpn_msb0 = (byte)((work.get( j ).Nrpn >> 8) & 0xff);
|
|
byte nrpn_msb1 = (byte)((work.get( j + 1 ).Nrpn >> 8) & 0xff);
|
|
if ( nrpn_msb1 > nrpn_msb0 ) {
|
|
VsqNrpn buf = work.get( j );
|
|
work.set( j, work.get( j + 1 ) );
|
|
work.set( j + 1, buf );
|
|
changed = true;
|
|
}
|
|
}
|
|
}
|
|
for ( int j = 0; j < work.size(); j++ ) {
|
|
ret.add( work.get( j ) );
|
|
}
|
|
work.clear();
|
|
work.add( list.get( i ) );
|
|
}
|
|
}
|
|
for ( int j = 0; j < work.size(); j++ ) {
|
|
ret.add( work.get( j ) );
|
|
}
|
|
} else {
|
|
for ( int i = 0; i < list.size(); i++ ) {
|
|
ret.add( list.get( i ) );
|
|
}
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
public static VsqNrpn[] merge( VsqNrpn[] src1, VsqNrpn[] src2 ) {
|
|
Vector<VsqNrpn> ret = new Vector<VsqNrpn>();
|
|
for ( int i = 0; i < src1.Length; i++ ) {
|
|
ret.add( src1[i] );
|
|
}
|
|
for ( int i = 0; i < src2.Length; i++ ) {
|
|
ret.add( src2[i] );
|
|
}
|
|
Collections.sort( ret );
|
|
return ret.toArray( new VsqNrpn[]{} );
|
|
}
|
|
|
|
public static NrpnData[] convert( VsqNrpn[] source ) {
|
|
ushort nrpn = (ushort)source[0].Nrpn;
|
|
byte msb = (byte)(nrpn >> 8);
|
|
byte lsb = (byte)(nrpn - (nrpn << 8));
|
|
Vector<NrpnData> ret = new Vector<NrpnData>();
|
|
ret.add( new NrpnData( source[0].Clock, 0x63, msb ) );
|
|
ret.add( new NrpnData( source[0].Clock, 0x62, lsb ) );
|
|
ret.add( new NrpnData( source[0].Clock, 0x06, source[0].DataMsb ) );
|
|
if ( source[0].DataLsbSpecified ) {
|
|
ret.add( new NrpnData( source[0].Clock, 0x26, source[0].DataLsb ) );
|
|
}
|
|
for ( int i = 1; i < source.Length; i++ ) {
|
|
VsqNrpn item = source[i];
|
|
ushort tnrpn = item.Nrpn;
|
|
msb = (byte)(tnrpn >> 8);
|
|
lsb = (byte)(tnrpn - (tnrpn << 8));
|
|
if ( item.msbOmitRequired ) {
|
|
ret.add( new NrpnData( item.Clock, 0x62, lsb ) );
|
|
ret.add( new NrpnData( item.Clock, 0x06, item.DataMsb ) );
|
|
if ( item.DataLsbSpecified ) {
|
|
ret.add( new NrpnData( item.Clock, 0x26, item.DataLsb ) );
|
|
}
|
|
} else {
|
|
ret.add( new NrpnData( item.Clock, 0x63, msb ) );
|
|
ret.add( new NrpnData( item.Clock, 0x62, lsb ) );
|
|
ret.add( new NrpnData( item.Clock, 0x06, item.DataMsb ) );
|
|
if ( item.DataLsbSpecified ) {
|
|
ret.add( new NrpnData( item.Clock, 0x26, item.DataLsb ) );
|
|
}
|
|
}
|
|
}
|
|
return ret.toArray( new NrpnData[]{} );
|
|
}
|
|
|
|
public int CompareTo( VsqNrpn item ) {
|
|
return Clock - item.Clock;
|
|
}
|
|
|
|
public void append( ushort nrpn, byte data_msb ) {
|
|
m_list.add( new VsqNrpn( Clock, nrpn, data_msb ) );
|
|
}
|
|
|
|
public void append( ushort nrpn, byte data_msb, byte data_lsb ) {
|
|
m_list.add( new VsqNrpn( Clock, nrpn, data_msb, data_lsb ) );
|
|
}
|
|
|
|
public void append( ushort nrpn, byte data_msb, boolean msb_omit_required ) {
|
|
VsqNrpn v = new VsqNrpn( Clock, nrpn, data_msb );
|
|
v.msbOmitRequired = msb_omit_required;
|
|
m_list.add( v );
|
|
}
|
|
|
|
public void append( ushort nrpn, byte data_msb, byte data_lsb, boolean msb_omit_required ) {
|
|
VsqNrpn v = new VsqNrpn( Clock, nrpn, data_msb, data_lsb );
|
|
v.msbOmitRequired = msb_omit_required;
|
|
m_list.add( v );
|
|
}
|
|
}
|
|
|
|
}
|