1 /* 2 * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. Oracle designates this 8 * particular file as subject to the "Classpath" exception as provided 9 * by Oracle in the LICENSE file that accompanied this code. 10 * 11 * This code is distributed in the hope that it will be useful, but WITHOUT 12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 14 * version 2 for more details (a copy is included in the LICENSE file that 15 * accompanied this code). 16 * 17 * You should have received a copy of the GNU General Public License version 18 * 2 along with this work; if not, write to the Free Software Foundation, 19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 20 * 21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 22 * or visit www.oracle.com if you need additional information or have any 23 * questions. 24 */ 25 26 package com.sun.xml.internal.bind.v2.runtime.reflect; 27 28 import com.sun.xml.internal.bind.api.AccessorException; 29 import com.sun.xml.internal.bind.v2.runtime.XMLSerializer; 30 31 /** 32 * {@link Lister} for primitive type arrays. 33 * 34 * <p> 35 * B y t e ArrayLister is used as the master to generate the rest of the 36 * lister classes. Do not modify the generated copies. 37 */ 38 final class PrimitiveArrayListerDouble<BeanT> extends Lister<BeanT,double[],Double,PrimitiveArrayListerDouble.DoubleArrayPack> { 39 40 private PrimitiveArrayListerDouble() { 41 } 42 43 /*package*/ static void register() { 44 Lister.primitiveArrayListers.put(Double.TYPE,new PrimitiveArrayListerDouble()); 45 } 46 47 public ListIterator<Double> iterator(final double[] objects, XMLSerializer context) { 48 return new ListIterator<Double>() { 49 int idx=0; 50 public boolean hasNext() { 51 return idx<objects.length; 52 } 53 54 public Double next() { 55 return objects[idx++]; 56 } 57 }; 58 } 59 60 public DoubleArrayPack startPacking(BeanT current, Accessor<BeanT, double[]> acc) { 61 return new DoubleArrayPack(); 62 } 63 64 public void addToPack(DoubleArrayPack objects, Double o) { 65 objects.add(o); 66 } 67 68 public void endPacking( DoubleArrayPack pack, BeanT bean, Accessor<BeanT,double[]> acc ) throws AccessorException { 69 acc.set(bean,pack.build()); 70 } 71 72 public void reset(BeanT o,Accessor<BeanT,double[]> acc) throws AccessorException { 73 acc.set(o,new double[0]); 74 } 75 76 static final class DoubleArrayPack { 77 double[] buf = new double[16]; 78 int size; 79 80 void add(Double b) { 81 if(buf.length==size) { 82 // realloc 83 double[] nb = new double[buf.length*2]; 84 System.arraycopy(buf,0,nb,0,buf.length); 85 buf = nb; 86 } 87 if(b!=null) 88 buf[size++] = b; 89 } 90 91 double[] build() { 92 if(buf.length==size) 93 // if we are lucky enough 94 return buf; 95 96 double[] r = new double[size]; 97 System.arraycopy(buf,0,r,0,size); 98 return r; 99 } 100 } 101 }