1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762
|
/*
* BezierCurves.cs
* Copyright © 2008-2011 kbinani
*
* This file is part of org.kbinani.cadencii.
*
* org.kbinani.cadencii is free software; you can redistribute it and/or
* modify it under the terms of the GPLv3 License.
*
* org.kbinani.cadencii 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.cadencii;
import java.util.*;
import org.kbinani.*;
import org.kbinani.xml.*;
#else
using System;
using org.kbinani.java.util;
namespace org.kbinani.cadencii {
using boolean = System.Boolean;
using Integer = Int32;
#endif
/// <summary>
/// AtatchedCurveをXMLシリアライズするためのクラス
/// であると同時に,各トラックに付随する情報を格納するためのクラス←New!
/// </summary>
public class BezierCurves : ICloneable
{
public static readonly CurveType[] CURVES = new CurveType[]{
CurveType.DYN,
CurveType.BRE,
CurveType.BRI,
CurveType.CLE,
CurveType.OPE,
CurveType.GEN,
CurveType.POR,
CurveType.VibratoRate,
CurveType.VibratoDepth,
CurveType.harmonics,
CurveType.fx2depth,
CurveType.reso1freq,
CurveType.reso1bw,
CurveType.reso1amp,
CurveType.reso2freq,
CurveType.reso2bw,
CurveType.reso2amp,
CurveType.reso3freq,
CurveType.reso3bw,
CurveType.reso3amp,
CurveType.reso4freq,
CurveType.reso4bw,
CurveType.reso4amp,
CurveType.PIT,
CurveType.PBS, };
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Dynamics;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Brethiness;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Brightness;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Clearness;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Opening;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> GenderFactor;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> PortamentoTiming;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> VibratoRate;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> VibratoDepth;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Harmonics;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> FX2Depth;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Reso1Freq;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Reso1BW;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Reso1Amp;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Reso2Freq;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Reso2BW;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Reso2Amp;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Reso3Freq;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Reso3BW;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Reso3Amp;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Reso4Freq;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Reso4BW;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> Reso4Amp;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> PitchBend;
#if JAVA
@XmlGenericType( BezierChain.class )
#endif
public Vector<BezierChain> PitchBendSensitivity;
public BezierCurves()
{
Dynamics = new Vector<BezierChain>();
Brethiness = new Vector<BezierChain>();
Brightness = new Vector<BezierChain>();
Clearness = new Vector<BezierChain>();
Opening = new Vector<BezierChain>();
GenderFactor = new Vector<BezierChain>();
PortamentoTiming = new Vector<BezierChain>();
VibratoRate = new Vector<BezierChain>();
VibratoDepth = new Vector<BezierChain>();
Harmonics = new Vector<BezierChain>();
FX2Depth = new Vector<BezierChain>();
Reso1Freq = new Vector<BezierChain>();
Reso1BW = new Vector<BezierChain>();
Reso1Amp = new Vector<BezierChain>();
Reso2Freq = new Vector<BezierChain>();
Reso2BW = new Vector<BezierChain>();
Reso2Amp = new Vector<BezierChain>();
Reso3Freq = new Vector<BezierChain>();
Reso3BW = new Vector<BezierChain>();
Reso3Amp = new Vector<BezierChain>();
Reso4Freq = new Vector<BezierChain>();
Reso4BW = new Vector<BezierChain>();
Reso4Amp = new Vector<BezierChain>();
PitchBend = new Vector<BezierChain>();
PitchBendSensitivity = new Vector<BezierChain>();
}
public BezierChain getBezierChain( CurveType curve_type, int chain_id )
{
Vector<BezierChain> list = this.get( curve_type );
int count = list.size();
for ( int i = 0; i < count; i++ ) {
if ( list.get( i ).id == chain_id ) {
return list.get( i );
}
}
return null;
}
public void setBezierChain( CurveType curve_type, int chain_id, BezierChain item )
{
Vector<BezierChain> list = this.get( curve_type );
int count = list.size();
for ( int i = 0; i < count; i++ ) {
if ( list.get( i ).id == chain_id ) {
list.set( i, item );
break;
}
}
}
/// <summary>
/// 指定した種類のコントロールカーブにベジエ曲線を追加します。
/// AddBezierChainとの違い、オーバーラップする部分があれば自動的に結合されます。
/// chainには2個以上のデータ点が含まれている必要がある
/// </summary>
/// <param name="curve"></param>
/// <param name="chain"></param>
public void mergeBezierChain( CurveType curve, BezierChain chain )
{
if ( chain.points.size() <= 1 ) {
return;
}
int chain_start = (int)chain.getStart();
int chain_end = (int)chain.getEnd();
// まず、全削除する必要のあるBezierChainを検索
Vector<Integer> delete_list = new Vector<Integer>();
Vector<BezierChain> src = this.get( curve );
//foreach ( int id in this[curve].Keys ) {
for ( int j = 0; j < src.size(); j++ ) {
//BezierChain bc = this[curve][id];
BezierChain bc = src.get( j );
if ( bc.points.size() <= 0 ) {
continue;
}
int bc_start = (int)bc.getStart();
int bc_end = (int)bc.getEnd();
if ( chain_start <= bc_start && bc_end <= chain_end ) {
delete_list.add( bc.id );
}
}
// 削除を実行
for ( Iterator<Integer> itr = delete_list.iterator(); itr.hasNext(); ) {
int id = itr.next();
remove( curve, id );
//this[curve].Remove( id );
}
// マージする必要があるかどうかを検査。
boolean processed = true;
while ( processed ) {
processed = false;
Vector<BezierChain> list = this.get( curve );
//foreach ( int id in this[curve].Keys ) {
for ( int j = 0; j < list.size(); j++ ) {
//BezierChain bc = this[curve][id];
BezierChain bc = list.get( j );
int id = bc.id;
int start = (int)bc.getStart();
int end = (int)bc.getEnd();
// 被っている箇所が2箇所以上ある可能性があるので、ifでヒットしてもbreakしない
if ( start < chain_start && chain_start <= end && end < chain_end ) {
// bcのchain_start ~ endを削除し、chain_startで結合
BezierChain bc_edit = null;
try {
bc_edit = bc.extractPartialBezier( start, chain_start );
} catch ( Exception ex ) {
Logger.write( typeof( BezierCurves ) + ".mergeBezierChain; ex=" + ex + "\n" );
continue;
}
bc_edit.id = bc.id;
int last = bc_edit.size() - 1;
// 接合部分では、制御点無しでステップ変化する
bc_edit.points.get( last ).setControlRightType( BezierControlType.None );
chain.points.get( 0 ).setControlLeftType( BezierControlType.None );
int copy_start = 0;
if ( bc_edit.points.get( last ).getBase().getY() == chain.points.get( 0 ).getBase().getY() ) {
// bcの終点とchainの始点の座標が一致している場合
if ( bc_edit.points.get( last ).getControlLeftType() != BezierControlType.None ) {
bc_edit.points.get( last ).setControlLeftType( BezierControlType.Master );
}
bc_edit.points.get( last ).setControlRight( chain.points.get( 0 ).controlLeft );
if ( chain.points.get( 0 ).getControlRightType() != BezierControlType.None ) {
bc_edit.points.get( last ).setControlLeftType( BezierControlType.Master );
}
copy_start = 1;
}
for ( int i = copy_start; i < chain.points.size(); i++ ) {
chain.points.get( i ).setID( bc_edit.getNextId() );
bc_edit.add( chain.points.get( i ) );
}
//this[curve].Remove( id );
remove( curve, id );
chain = bc_edit;
chain_start = (int)chain.getStart();
chain_end = (int)chain.getEnd();
processed = true;
break;
} else if ( chain_start < start && start <= chain_end && chain_end < end ) {
// bcのstart ~ chain_endを削除し、chain_endで結合
BezierChain bc_edit = null;
try {
bc_edit = bc.extractPartialBezier( chain_end, end );
} catch ( Exception ex ) {
Logger.write( typeof( BezierCurves ) + ".mergeBezierChain; ex=" + ex + "\n" );
continue;
}
bc_edit.id = bc.id;
int last = chain.size() - 1;
// 接合部分では、制御点無しでステップ変化する
bc_edit.points.get( 0 ).setControlLeftType( BezierControlType.None );
chain.points.get( last ).setControlRightType( BezierControlType.None );
int copy_end = last;
if ( chain.points.get( last ).getBase().getY() == bc_edit.points.get( 0 ).getBase().getY() ) {
// bcの終点とchainの始点の座標が一致している場合
if ( chain.points.get( last ).getControlLeftType() != BezierControlType.None ) {
chain.points.get( last ).setControlLeftType( BezierControlType.Master );
}
chain.points.get( last ).setControlRight( bc_edit.points.get( 0 ).controlLeft );
if ( bc_edit.points.get( 0 ).getControlRightType() != BezierControlType.None ) {
chain.points.get( last ).setControlLeftType( BezierControlType.Master );
}
copy_end = last - 1;
}
for ( int i = 0; i <= copy_end; i++ ) {
chain.points.get( i ).setID( bc_edit.getNextId() );
bc_edit.add( chain.points.get( i ) );
}
//this[curve].Remove( id );
remove( curve, id );
chain = bc_edit;
chain_start = (int)chain.getStart();
chain_end = (int)chain.getEnd();
processed = true;
break;
} else if ( start < chain_start && chain_end < end ) {
// bcのchain_start ~ chain_endをchainで置き換え
// left + chain + right
BezierChain left = null;
try {
left = bc.extractPartialBezier( start, chain_start );
} catch ( Exception ex ) {
Logger.write( typeof( BezierCurves ) + ".mergeBezierChain; ex=" + ex + "\n" );
continue;
}
BezierChain right = null;
try {
right = bc.extractPartialBezier( chain_end, end );
} catch ( Exception ex ) {
Logger.write( typeof( BezierCurves ) + ".mergeBezierChain; ex=" + ex + "\n" );
continue;
}
left.id = bc.id;
// 接合部ではステップ変化
left.points.get( left.size() - 1 ).setControlRightType( BezierControlType.None );
chain.points.get( 0 ).setControlLeftType( BezierControlType.None );
chain.points.get( chain.size() - 1 ).setControlRightType( BezierControlType.None );
right.points.get( 0 ).setControlLeftType( BezierControlType.None );
int copy_start = 0;
int copy_end = chain.size() - 1;
if ( left.points.get( left.size() - 1 ).getBase().getY() == chain.points.get( 0 ).getBase().getY() ) {
// bcの終点とchainの始点の座標が一致している場合
if ( left.points.get( left.size() - 1 ).getControlLeftType() != BezierControlType.None ) {
left.points.get( left.size() - 1 ).setControlLeftType( BezierControlType.Master );
}
left.points.get( left.size() - 1 ).setControlRight( chain.points.get( 0 ).controlLeft );
if ( chain.points.get( 0 ).getControlRightType() != BezierControlType.None ) {
left.points.get( left.size() - 1 ).setControlLeftType( BezierControlType.Master );
}
copy_start = 1;
}
if ( chain.points.get( chain.size() - 1 ).getBase().getY() == right.points.get( 0 ).getBase().getY() ) {
// bcの終点とchainの始点の座標が一致している場合
if ( chain.points.get( chain.size() - 1 ).getControlLeftType() != BezierControlType.None ) {
chain.points.get( chain.size() - 1 ).setControlLeftType( BezierControlType.Master );
}
chain.points.get( chain.size() - 1 ).setControlRight( right.points.get( 0 ).controlLeft );
if ( right.points.get( 0 ).getControlRightType() != BezierControlType.None ) {
chain.points.get( chain.size() - 1 ).setControlLeftType( BezierControlType.Master );
}
copy_end = chain.size() - 2;
}
// 追加
for ( int i = copy_start; i <= copy_end; i++ ) {
chain.points.get( i ).setID( left.getNextId() );
left.add( chain.points.get( i ) );
}
for ( int i = 0; i < right.points.size(); i++ ) {
right.points.get( i ).setID( left.getNextId() );
left.add( right.points.get( i ) );
}
//this[curve].Remove( id );
remove( curve, id );
chain = left;
chain_start = (int)chain.getStart();
chain_end = (int)chain.getEnd();
processed = true;
break;
}
}
}
if ( !processed ) {
chain.id = this.getNextId( curve );
}
//this[curve].Add( chain.ID, chain );
addBezierChain( curve, chain, chain.id );
}
/// <summary>
/// 指定した位置に,指定した量の空白を挿入します
/// </summary>
/// <param name="clock_start">空白を挿入する位置</param>
/// <param name="clock_amount">挿入する空白の量</param>
public void insertBlank( int clock_start, int clock_amount )
{
// 全種類のカーブ
Vector<CurveType> target_curve = new Vector<CurveType>();
foreach ( CurveType ct in CURVES ) {
Vector<BezierChain> vbc = get( ct );
for ( Iterator<BezierChain> itr = vbc.iterator(); itr.hasNext(); ) {
BezierChain bc = itr.next();
int size = vec.size( bc.points );
for ( int i = 0; i < size; i++ ) {
BezierPoint bp = vec.get( bc.points, i );
PointD p = bp.getBase();
if ( clock_start <= p.getX() ) {
p.setX( p.getX() + clock_amount );
bp.setBase( p );
}
}
}
}
}
/// <summary>
/// 全種類のカーブの指定した範囲を削除します.
/// 削除範囲以降の部分は,操作後には(clock_end - clock_start)だけシフトされます.
/// </summary>
/// <param name="clock_start"></param>
/// <param name="clock_end"></param>
public void removePart( int clock_start, int clock_end )
{
// 全種類のカーブが対象
Vector<CurveType> target_curve = new Vector<CurveType>();
foreach ( CurveType ct in CURVES ) {
vec.add( target_curve, ct );
}
// 便利メソッドで削除をやる
deleteBeziers( target_curve, clock_start, clock_end );
// データ点のclockがclock_end以降になってるものについて,シフトを行う
int delta = clock_end - clock_start;
for ( Iterator<CurveType> itr = target_curve.iterator(); itr.hasNext(); ) {
CurveType ct = itr.next();
Vector<BezierChain> vbc = get( ct );
for ( Iterator<BezierChain> itr_bc = vbc.iterator(); itr_bc.hasNext(); ) {
BezierChain bc = itr_bc.next();
int size = vec.size( bc.points );
for ( int i = 0; i < size; i++ ) {
BezierPoint bp = vec.get( bc.points, i );
PointD p = bp.getBase();
if ( clock_end <= p.getX() ) {
p.setX( p.getX() - delta );
bp.setBase( p );
}
}
}
}
}
/// <summary>
/// 指定したカーブ種類のベジエ曲線の,指定した範囲を削除します.
/// 削除はclock_startからclock_endの範囲について行われ,clock_end以降のシフト操作は行われません.
/// つまり,操作後にclock_end以降のイベントが(clock_end - clock_start)だけ前方にシフトしてくることはありません.
/// </summary>
/// <param name="target_curve"></param>
/// <param name="clock_start"></param>
/// <param name="clock_end"></param>
/// <returns></returns>
public boolean deleteBeziers(
Vector<CurveType> target_curve,
int clock_start,
int clock_end
)
{
boolean edited = false;
for ( Iterator<CurveType> itr1 = target_curve.iterator(); itr1.hasNext(); ) {
CurveType curve = itr1.next();
if ( curve.isScalar() || curve.isAttachNote() ) {
continue;
}
Vector<BezierChain> tmp = new Vector<BezierChain>();
for ( Iterator<BezierChain> itr = this.get( curve ).iterator(); itr.hasNext(); ) {
BezierChain bc = itr.next();
int len = bc.points.size();
if ( len < 1 ) {
continue;
}
int chain_start = (int)bc.points.get( 0 ).getBase().getX();
int chain_end;
if ( len < 2 ) {
chain_end = chain_start;
} else {
chain_end = (int)bc.points.get( len - 1 ).getBase().getX();
}
if ( clock_start < chain_start && chain_start < clock_end && clock_end < chain_end ) {
// end ~ chain_endを残す
try {
BezierChain chain = bc.extractPartialBezier( clock_end, chain_end );
chain.id = bc.id;
tmp.add( chain );
edited = true;
} catch ( Exception ex ) {
Logger.write( typeof( BezierCurves ) + ".deleteBeziers; ex=" + ex + "\n" );
}
} else if ( chain_start <= clock_start && clock_end <= chain_end ) {
// chain_start ~ startとend ~ chain_endを残す
try {
BezierChain chain1 = bc.extractPartialBezier( chain_start, clock_start );
chain1.id = bc.id;
BezierChain chain2 = bc.extractPartialBezier( clock_end, chain_end );
chain2.id = -1; // 後で番号をつける
tmp.add( chain1 );
tmp.add( chain2 );
edited = true;
} catch ( Exception ex ) {
Logger.write( typeof( BezierCurves ) + ".deleteBeziers; ex=" + ex + "\n" );
}
} else if ( chain_start < clock_start && clock_start < chain_end && chain_end < clock_end ) {
// chain_start ~ startを残す
try {
BezierChain chain = bc.extractPartialBezier( chain_start, clock_start );
chain.id = bc.id;
tmp.add( chain );
edited = true;
} catch ( Exception ex ) {
Logger.write( typeof( BezierCurves ) + ".deleteBeiers; ex=" + ex + "\n" );
}
} else if ( clock_start <= chain_start && chain_end <= clock_end ) {
// 全体を削除
edited = true;
} else {
// 全体を残す
tmp.add( (BezierChain)bc.clone() );
}
}
this.get( curve ).clear();
for ( Iterator<BezierChain> itr = tmp.iterator(); itr.hasNext(); ) {
BezierChain bc = itr.next();
if ( bc.id >= 0 ) {
addBezierChain( curve, bc, bc.id );
}
}
for ( Iterator<BezierChain> itr = tmp.iterator(); itr.hasNext(); ) {
BezierChain bc = itr.next();
if ( bc.id < 0 ) {
bc.id = this.getNextId( curve );
addBezierChain( curve, bc, bc.id );
}
}
}
return edited;
}
public void remove( CurveType curve_type, int chain_id )
{
Vector<BezierChain> list = this.get( curve_type );
for ( int i = 0; i < list.size(); i++ ) {
if ( list.get( i ).id == chain_id ) {
list.removeElementAt( i );
break;
}
}
}
/// <summary>
/// 指定したコントロールカーブにベジエ曲線を追加します。
/// </summary>
/// <param name="curve_type"></param>
/// <param name="chain"></param>
public void addBezierChain( CurveType curve_type, BezierChain chain, int chain_id )
{
BezierChain add = (BezierChain)chain.clone();
add.id = chain_id;
this.get( curve_type ).add( add );
}
public Object clone()
{
BezierCurves ret = new BezierCurves();
for ( int j = 0; j < Utility.CURVE_USAGE.Length; j++ ) {
CurveType ct = Utility.CURVE_USAGE[j];
Vector<BezierChain> src = this.get( ct );
ret.set( ct, new Vector<BezierChain>() );
int count = src.size();
for ( int i = 0; i < count; i++ ) {
ret.get( ct ).add( (BezierChain)src.get( i ).clone() );
}
}
return ret;
}
#if !JAVA
public Object Clone()
{
return clone();
}
#endif
public int getNextId( CurveType curve_type )
{
Vector<BezierChain> bc = this.get( curve_type );
int ret = bc.size();
boolean found = true;
while ( found ) {
found = false;
for ( int i = 0; i < bc.size(); i++ ) {
if ( bc.get( i ).id == ret ) {
found = true;
ret++;
break;
}
}
}
return ret;
}
public Vector<BezierChain> get( CurveType curve )
{
if ( curve.equals( CurveType.BRE ) ) {
return Brethiness;
} else if ( curve.equals( CurveType.BRI ) ) {
return Brightness;
} else if ( curve.equals( CurveType.CLE ) ) {
return Clearness;
} else if ( curve.equals( CurveType.DYN ) ) {
return Dynamics;
} else if ( curve.equals( CurveType.fx2depth ) ) {
return FX2Depth;
} else if ( curve.equals( CurveType.GEN ) ) {
return GenderFactor;
} else if ( curve.equals( CurveType.harmonics ) ) {
return Harmonics;
} else if ( curve.equals( CurveType.OPE ) ) {
return Opening;
} else if ( curve.equals( CurveType.POR ) ) {
return PortamentoTiming;
} else if ( curve.equals( CurveType.PIT ) ) {
return PitchBend;
} else if ( curve.equals( CurveType.PBS ) ) {
return PitchBendSensitivity;
} else if ( curve.equals( CurveType.reso1amp ) ) {
return Reso1Amp;
} else if ( curve.equals( CurveType.reso1bw ) ) {
return Reso1BW;
} else if ( curve.equals( CurveType.reso1freq ) ) {
return Reso1Freq;
} else if ( curve.equals( CurveType.reso2amp ) ) {
return Reso2Amp;
} else if ( curve.equals( CurveType.reso2bw ) ) {
return Reso2BW;
} else if ( curve.equals( CurveType.reso2freq ) ) {
return Reso2Freq;
} else if ( curve.equals( CurveType.reso3amp ) ) {
return Reso3Amp;
} else if ( curve.equals( CurveType.reso3bw ) ) {
return Reso3BW;
} else if ( curve.equals( CurveType.reso3freq ) ) {
return Reso3Freq;
} else if ( curve.equals( CurveType.reso4amp ) ) {
return Reso4Amp;
} else if ( curve.equals( CurveType.reso4bw ) ) {
return Reso4BW;
} else if ( curve.equals( CurveType.reso4freq ) ) {
return Reso4Freq;
} else if ( curve.equals( CurveType.VibratoDepth ) ) {
return VibratoDepth;
} else if ( curve.equals( CurveType.VibratoRate ) ) {
return VibratoRate;
} else {
return null;
}
}
public void set( CurveType curve, Vector<BezierChain> value )
{
if ( curve.equals( CurveType.BRE ) ) {
Brethiness = value;
} else if ( curve.equals( CurveType.BRI ) ) {
Brightness = value;
} else if ( curve.equals( CurveType.CLE ) ) {
Clearness = value;
} else if ( curve.equals( CurveType.DYN ) ) {
Dynamics = value;
} else if ( curve.equals( CurveType.fx2depth ) ) {
FX2Depth = value;
} else if ( curve.equals( CurveType.GEN ) ) {
GenderFactor = value;
} else if ( curve.equals( CurveType.harmonics ) ) {
Harmonics = value;
} else if ( curve.equals( CurveType.OPE ) ) {
Opening = value;
} else if ( curve.equals( CurveType.POR ) ) {
PortamentoTiming = value;
} else if ( curve.equals( CurveType.PIT ) ) {
PitchBend = value;
} else if ( curve.equals( CurveType.PBS ) ) {
PitchBendSensitivity = value;
} else if ( curve.equals( CurveType.reso1amp ) ) {
Reso1Amp = value;
} else if ( curve.equals( CurveType.reso1bw ) ) {
Reso1BW = value;
} else if ( curve.equals( CurveType.reso1freq ) ) {
Reso1Freq = value;
} else if ( curve.equals( CurveType.reso2amp ) ) {
Reso2Amp = value;
} else if ( curve.equals( CurveType.reso2bw ) ) {
Reso2BW = value;
} else if ( curve.equals( CurveType.reso2freq ) ) {
Reso2Freq = value;
} else if ( curve.equals( CurveType.reso3amp ) ) {
Reso3Amp = value;
} else if ( curve.equals( CurveType.reso3bw ) ) {
Reso3BW = value;
} else if ( curve.equals( CurveType.reso3freq ) ) {
Reso3Freq = value;
} else if ( curve.equals( CurveType.reso4amp ) ) {
Reso4Amp = value;
} else if ( curve.equals( CurveType.reso4bw ) ) {
Reso4BW = value;
} else if ( curve.equals( CurveType.reso4freq ) ) {
Reso4Freq = value;
} else if ( curve.equals( CurveType.VibratoDepth ) ) {
VibratoDepth = value;
} else if ( curve.equals( CurveType.VibratoRate ) ) {
VibratoRate = value;
}
}
}
#if !JAVA
}
#endif
|