diff options
Diffstat (limited to 'songdbj/com/jcraft/jorbis/Residue1.java')
-rw-r--r-- | songdbj/com/jcraft/jorbis/Residue1.java | 51 |
1 files changed, 51 insertions, 0 deletions
diff --git a/songdbj/com/jcraft/jorbis/Residue1.java b/songdbj/com/jcraft/jorbis/Residue1.java new file mode 100644 index 0000000000..c29ed8d671 --- /dev/null +++ b/songdbj/com/jcraft/jorbis/Residue1.java | |||
@@ -0,0 +1,51 @@ | |||
1 | /* JOrbis | ||
2 | * Copyright (C) 2000 ymnk, JCraft,Inc. | ||
3 | * | ||
4 | * Written by: 2000 ymnk<ymnk@jcraft.com> | ||
5 | * | ||
6 | * Many thanks to | ||
7 | * Monty <monty@xiph.org> and | ||
8 | * The XIPHOPHORUS Company http://www.xiph.org/ . | ||
9 | * JOrbis has been based on their awesome works, Vorbis codec. | ||
10 | * | ||
11 | * This program is free software; you can redistribute it and/or | ||
12 | * modify it under the terms of the GNU Library General Public License | ||
13 | * as published by the Free Software Foundation; either version 2 of | ||
14 | * the License, or (at your option) any later version. | ||
15 | |||
16 | * This program is distributed in the hope that it will be useful, | ||
17 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
18 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
19 | * GNU Library General Public License for more details. | ||
20 | * | ||
21 | * You should have received a copy of the GNU Library General Public | ||
22 | * License along with this program; if not, write to the Free Software | ||
23 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | ||
24 | */ | ||
25 | |||
26 | package com.jcraft.jorbis; | ||
27 | |||
28 | import com.jcraft.jogg.*; | ||
29 | |||
30 | class Residue1 extends Residue0{ | ||
31 | int forward(Block vb,Object vl, float[][] in, int ch){ | ||
32 | System.err.println("Residue0.forward: not implemented"); | ||
33 | return 0; | ||
34 | } | ||
35 | |||
36 | int inverse(Block vb, Object vl, float[][] in, int[] nonzero, int ch){ | ||
37 | //System.err.println("Residue0.inverse"); | ||
38 | int used=0; | ||
39 | for(int i=0; i<ch; i++){ | ||
40 | if(nonzero[i]!=0){ | ||
41 | in[used++]=in[i]; | ||
42 | } | ||
43 | } | ||
44 | if(used!=0){ | ||
45 | return(_01inverse(vb,vl,in,used,1)); | ||
46 | } | ||
47 | else{ | ||
48 | return 0; | ||
49 | } | ||
50 | } | ||
51 | } | ||