blob: 33bd853b9fa654b60b91832e4a5c22af6c0fac12 [file] [log] [blame]
/*
* Copyright (c) 1997, 2022 Oracle and/or its affiliates. All rights reserved.
*
* This program and the accompanying materials are made available under the
* terms of the Eclipse Distribution License v. 1.0, which is available at
* http://www.eclipse.org/org/documents/edl-v10.php.
*
* SPDX-License-Identifier: BSD-3-Clause
*/
package org.glassfish.jaxb.runtime.v2.runtime.reflect;
import org.glassfish.jaxb.runtime.api.AccessorException;
import org.glassfish.jaxb.runtime.v2.runtime.XMLSerializer;
/**
* {@link Lister} for primitive type arrays.
* <p><b>
* Auto-generated, do not edit.
* </b></p>
* <p>
* B y t e ArrayLister is used as the master to generate the rest of the
* lister classes. Do not modify the generated copies.
* </p>
*/
final class PrimitiveArrayListerBoolean<BeanT> extends Lister<BeanT,boolean[],Boolean,PrimitiveArrayListerBoolean.BooleanArrayPack> {
private PrimitiveArrayListerBoolean() {
}
/*package*/ static void register() {
Lister.primitiveArrayListers.put(Boolean.TYPE,new PrimitiveArrayListerBoolean());
}
@Override
public ListIterator<Boolean> iterator(final boolean[] objects, XMLSerializer context) {
return new ListIterator<>() {
int idx = 0;
@Override
public boolean hasNext() {
return idx < objects.length;
}
@Override
public Boolean next() {
return objects[idx++];
}
};
}
@Override
public BooleanArrayPack startPacking(BeanT current, Accessor<BeanT, boolean[]> acc) {
return new BooleanArrayPack();
}
@Override
public void addToPack(BooleanArrayPack objects, Boolean o) {
objects.add(o);
}
@Override
public void endPacking( BooleanArrayPack pack, BeanT bean, Accessor<BeanT,boolean[]> acc ) throws AccessorException {
acc.set(bean,pack.build());
}
@Override
public void reset(BeanT o,Accessor<BeanT,boolean[]> acc) throws AccessorException {
acc.set(o,new boolean[0]);
}
static final class BooleanArrayPack {
boolean[] buf = new boolean[16];
int size;
void add(Boolean b) {
if(buf.length==size) {
// realloc
boolean[] nb = new boolean[buf.length*2];
System.arraycopy(buf,0,nb,0,buf.length);
buf = nb;
}
if(b!=null)
buf[size++] = b;
}
boolean[] build() {
if(buf.length==size)
// if we are lucky enough
return buf;
boolean[] r = new boolean[size];
System.arraycopy(buf,0,r,0,size);
return r;
}
}
}