001/* ***** BEGIN LICENSE BLOCK *****
002 * Version: MPL 1.1/GPL 2.0/LGPL 2.1
003 *
004 * The contents of this file are subject to the Mozilla Public License Version
005 * 1.1 (the "License"); you may not use this file except in compliance with
006 * the License. You may obtain a copy of the License at
007 * http://www.mozilla.org/MPL/
008 *
009 * Software distributed under the License is distributed on an "AS IS" basis,
010 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
011 * for the specific language governing rights and limitations under the
012 * License.
013 *
014 * The Original Code is part of dcm4che, an implementation of DICOM(TM) in
015 * Java(TM), hosted at https://github.com/gunterze/dcm4che.
016 *
017 * The Initial Developer of the Original Code is
018 * Agfa Healthcare.
019 * Portions created by the Initial Developer are Copyright (C) 2011
020 * the Initial Developer. All Rights Reserved.
021 *
022 * Contributor(s):
023 * See @authors listed below
024 *
025 * Alternatively, the contents of this file may be used under the terms of
026 * either the GNU General Public License Version 2 or later (the "GPL"), or
027 * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
028 * in which case the provisions of the GPL or the LGPL are applicable instead
029 * of those above. If you wish to allow use of your version of this file only
030 * under the terms of either the GPL or the LGPL, and not to allow others to
031 * use your version of this file under the terms of the MPL, indicate your
032 * decision by deleting the provisions above and replace them with the notice
033 * and other provisions required by the GPL or the LGPL. If you do not delete
034 * the provisions above, a recipient may use your version of this file under
035 * the terms of any one of the MPL, the GPL or the LGPL.
036 *
037 * ***** END LICENSE BLOCK ***** */
038
039package org.dcm4che3.tool.dcmqrscp;
040
041import java.io.IOException;
042
043import org.dcm4che3.data.Attributes;
044import org.dcm4che3.data.Tag;
045import org.dcm4che3.media.DicomDirReader;
046import org.dcm4che3.net.Association;
047import org.dcm4che3.net.Status;
048import org.dcm4che3.net.pdu.PresentationContext;
049import org.dcm4che3.net.service.DicomServiceException;
050import org.dcm4che3.util.StringUtils;
051
052class SeriesQueryTask extends StudyQueryTask {
053
054    protected final String[] seriesIUIDs;
055    protected Attributes seriesRec;
056
057    public SeriesQueryTask(Association as, PresentationContext pc, Attributes rq, Attributes keys,
058            DicomDirReader ddr, String availability) throws DicomServiceException {
059        super(as, pc, rq, keys, ddr, availability);
060        seriesIUIDs = StringUtils.maskNull(
061                keys.getStrings(Tag.SeriesInstanceUID));
062        wrappedFindNextSeries();
063   }
064
065    @Override
066    public boolean hasMoreMatches() throws DicomServiceException {
067        return seriesRec != null;
068    }
069
070    @Override
071    public Attributes nextMatch() throws DicomServiceException {
072        Attributes ret = new Attributes(patRec.size()
073                + studyRec.size()
074                + seriesRec.size());
075        ret.addAll(patRec);
076        ret.addAll(studyRec);
077        ret.addAll(seriesRec);
078        wrappedFindNextSeries();
079        return ret;
080    }
081
082    private void wrappedFindNextSeries() throws DicomServiceException {
083        try {
084            findNextSeries();
085        } catch (IOException e) {
086            throw new DicomServiceException(Status.UnableToProcess, e);
087        }
088    }
089
090    protected boolean findNextSeries() throws IOException {
091        if (studyRec == null)
092            return false;
093
094        if (seriesRec == null)
095            seriesRec = ddr.findSeriesRecord(studyRec, seriesIUIDs);
096        else if (seriesIUIDs != null && seriesIUIDs.length == 1)
097            seriesRec = null;
098        else
099            seriesRec = ddr.findNextSeriesRecord(seriesRec, seriesIUIDs);
100
101        while (seriesRec == null && super.findNextStudy())
102            seriesRec = ddr.findSeriesRecord(studyRec, seriesIUIDs);
103
104        return seriesRec != null;
105    }
106}