/* * 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. */ #if JAVA package org.kbinani.vsq; import java.util.*; #else using System; using bocoree; using bocoree.java.util; namespace Boare.Lib.Vsq { using boolean = System.Boolean; #endif #if JAVA public class VsqNrpn implements Comparable { #else public struct VsqNrpn : IComparable { #endif public int Clock; public int Nrpn; public byte DataMsb; public byte DataLsb; public boolean DataLsbSpecified; public boolean msbOmitRequired; private Vector m_list; public VsqNrpn( int clock, int nrpn, byte data_msb ) { Clock = clock; Nrpn = nrpn; DataMsb = data_msb; DataLsb = 0x0; DataLsbSpecified = false; msbOmitRequired = false; m_list = new Vector(); } public VsqNrpn( int clock, int 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(); } public VsqNrpn[] expand() { Vector ret = new Vector(); 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( Arrays.asList( m_list.get( i ).expand() ) ); } return ret.toArray( new VsqNrpn[] { } ); } public static Vector sort( Vector list ) { Vector ret = new Vector(); Collections.sort( list ); if ( list.size() >= 2 ) { Vector work = new Vector(); //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 ret = new Vector(); 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 ) { int nrpn = source[0].Nrpn; byte msb = (byte)(nrpn >> 8); byte lsb = (byte)(nrpn - (nrpn << 8)); Vector ret = new Vector(); ret.add( new NrpnData( source[0].Clock, (byte)0x63, msb ) ); ret.add( new NrpnData( source[0].Clock, (byte)0x62, lsb ) ); ret.add( new NrpnData( source[0].Clock, (byte)0x06, source[0].DataMsb ) ); if ( source[0].DataLsbSpecified ) { ret.add( new NrpnData( source[0].Clock, (byte)0x26, source[0].DataLsb ) ); } for ( int i = 1; i < source.Length; i++ ) { VsqNrpn item = source[i]; int tnrpn = item.Nrpn; msb = (byte)(tnrpn >> 8); lsb = (byte)(tnrpn - (tnrpn << 8)); if ( item.msbOmitRequired ) { ret.add( new NrpnData( item.Clock, (byte)0x62, lsb ) ); ret.add( new NrpnData( item.Clock, (byte)0x06, item.DataMsb ) ); if ( item.DataLsbSpecified ) { ret.add( new NrpnData( item.Clock, (byte)0x26, item.DataLsb ) ); } } else { ret.add( new NrpnData( item.Clock, (byte)0x63, msb ) ); ret.add( new NrpnData( item.Clock, (byte)0x62, lsb ) ); ret.add( new NrpnData( item.Clock, (byte)0x06, item.DataMsb ) ); if ( item.DataLsbSpecified ) { ret.add( new NrpnData( item.Clock, (byte)0x26, item.DataLsb ) ); } } } return ret.toArray( new NrpnData[] { } ); } public int compareTo( VsqNrpn item ) { return Clock - item.Clock; } #if !JAVA public int CompareTo( VsqNrpn item ) { return compareTo( item ); } #endif public void append( int nrpn, byte data_msb ) { m_list.add( new VsqNrpn( Clock, nrpn, data_msb ) ); } public void append( int nrpn, byte data_msb, byte data_lsb ) { m_list.add( new VsqNrpn( Clock, nrpn, data_msb, data_lsb ) ); } public void append( int 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( int 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 ); } } #if !JAVA } #endif