/* inslai.f -- translated by f2c (version 19980913).
   You must link the resulting object file with the libraries:
	-lf2c -lm   (in that order)
*/

#include "f2c.h"

/* $Procedure      INSLAI (Insert at location in an integer array) */
/* Subroutine */ int inslai_(integer *elts, integer *ne, integer *loc, 
	integer *array, integer *na)
{
    /* System generated locals */
    integer i__1;

    /* Local variables */
    integer size, i__;
    extern /* Subroutine */ int chkin_(char *, ftnlen), sigerr_(char *, 
	    ftnlen), chkout_(char *, ftnlen), setmsg_(char *, ftnlen), 
	    errint_(char *, integer *, ftnlen);
    extern logical return_(void);

/* $ Abstract */

/*      Insert one or more elements into an integer array at */
/*      the indicated location. */

/* $ Disclaimer */

/*     THIS SOFTWARE AND ANY RELATED MATERIALS WERE CREATED BY THE */
/*     CALIFORNIA INSTITUTE OF TECHNOLOGY (CALTECH) UNDER A U.S. */
/*     GOVERNMENT CONTRACT WITH THE NATIONAL AERONAUTICS AND SPACE */
/*     ADMINISTRATION (NASA). THE SOFTWARE IS TECHNOLOGY AND SOFTWARE */
/*     PUBLICLY AVAILABLE UNDER U.S. EXPORT LAWS AND IS PROVIDED "AS-IS" */
/*     TO THE RECIPIENT WITHOUT WARRANTY OF ANY KIND, INCLUDING ANY */
/*     WARRANTIES OF PERFORMANCE OR MERCHANTABILITY OR FITNESS FOR A */
/*     PARTICULAR USE OR PURPOSE (AS SET FORTH IN UNITED STATES UCC */
/*     SECTIONS 2312-2313) OR FOR ANY PURPOSE WHATSOEVER, FOR THE */
/*     SOFTWARE AND RELATED MATERIALS, HOWEVER USED. */

/*     IN NO EVENT SHALL CALTECH, ITS JET PROPULSION LABORATORY, OR NASA */
/*     BE LIABLE FOR ANY DAMAGES AND/OR COSTS, INCLUDING, BUT NOT */
/*     LIMITED TO, INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, */
/*     INCLUDING ECONOMIC DAMAGE OR INJURY TO PROPERTY AND LOST PROFITS, */
/*     REGARDLESS OF WHETHER CALTECH, JPL, OR NASA BE ADVISED, HAVE */
/*     REASON TO KNOW, OR, IN FACT, SHALL KNOW OF THE POSSIBILITY. */

/*     RECIPIENT BEARS ALL RISK RELATING TO QUALITY AND PERFORMANCE OF */
/*     THE SOFTWARE AND ANY RELATED MATERIALS, AND AGREES TO INDEMNIFY */
/*     CALTECH AND NASA FOR ALL THIRD-PARTY CLAIMS RESULTING FROM THE */
/*     ACTIONS OF RECIPIENT IN THE USE OF THE SOFTWARE. */

/* $ Required_Reading */

/*     None. */

/* $ Keywords */

/*      ARRAY,  ASSIGNMENT */

/* $ Declarations */
/* $ Brief_I/O */

/*      VARIABLE  I/O  DESCRIPTION */
/*      --------  ---  -------------------------------------------------- */
/*      ELTS       I   Elements to be inserted. */
/*      NE         I   Number of elements to be inserted. */
/*      LOC        I   Location of the first inserted element. */
/*      ARRAY     I/O  Input/output array. */
/*      NA        I/O  Number of elements in the input/output array. */

/* $ Detailed_Input */

/*      ELTS        contains one or more elements which are to be */
/*                  inserted into the input array. */

/*      NE          is the number of elements to be inserted. */

/*      LOC         is the location in the array at which the first */
/*                  element of ELTS is to be inserted. LOC must be */
/*                  within the interval [1, NA+1]. To append to */
/*                  ARRAY, set LOC equal to NA+1. */

/*      ARRAY       on input, is the original array. */

/*      NA          on input, is the number of elements in ARRAY. */

/* $ Detailed_Output */

/*      ARRAY       on output, is the original array with the elements */
/*                  of ELT inserted into positions LOC through LOC+NE-1. */
/*                  The original elements in these positions are moved */
/*                  back to make room for the inserted elements. */

/*      NA          on output, is the number of elements in ARRAY. */

/* $ Parameters */

/*     None. */

/* $ Particulars */

/*      The elements in positions LOC through LOC+NE-1 are moved back */
/*      by NE spaces to make room for the new elements, which are then */
/*      inserted into the vacated spaces. */

/* $ Examples */

/*      Let */

/*            ELTS(1) = 5        NA = 4      ARRAY(1) =  1 */
/*            ELTS(2) = 6                    ARRAY(2) =  2 */
/*            ELTS(3) = 7                    ARRAY(3) =  3 */
/*                                           ARRAY(4) =  4 */

/*      Then the call */

/*            CALL INSLAI ( ELTS, 3, 3, ARRAY, NA ) */

/*      yields the following result: */

/*            NA = 7      ARRAY(1) = 1 */
/*                        ARRAY(2) = 2 */
/*                        ARRAY(3) = 5 */
/*                        ARRAY(4) = 6 */
/*                        ARRAY(5) = 7 */
/*                        ARRAY(6) = 3 */
/*                        ARRAY(7) = 4 */


/*      The following calls to INSLAI signal errors. */

/*      CALL INSLAI ( ELTS, 3, -1, ARRAY, NA ) */
/*      CALL INSLAI ( ELTS, 3,  6, ARRAY, NA ) */
/*      CALL INSLAI ( ELTS, 3,  2, ARRAY, -1 ) */
/*      CALL INSLAI ( ELTS, 3, -1, ARRAY, -1 ) */

/* $ Restrictions */

/*      The array must be large enough to contain both the original */
/*      and the inserted elements. */

/* $ Exceptions */

/*     1) The dimension of the array is set equal to zero if its */
/*        input value is less than one. */

/*     2) If LOC is not in the interval [1, NA+1], the error */
/*        SPICE(INVALIDINDEX) is signalled. */

/*     3) If the number of elements to be inserted is less than one, */
/*        the array is not modified. */

/* $ Files */

/*      None. */

/* $ Author_and_Institution */

/*      H.A. Neilan     (JPL) */
/*      I.M. Underwood  (JPL) */

/* $ Literature_References */

/*      None. */

/* $ Version */

/* -     SPICELIB Version 1.0.1, 10-MAR-1992 (WLT) */

/*         Comment section for permuted index source lines was added */
/*         following the header. */

/* -     SPICELIB Version 1.0.0, 31-JAN-1990 (IMU) */

/* -& */
/* $ Index_Entries */

/*     insert at location in an integer array */

/* -& */
/* $ Revisions */

/* -     Beta Version 2.0.0, 30-DEC-1988 (HAN) */

/*         If the location at which the elements are to be inserted is */
/*         not in the interval [1, NA+1], an error is signalled. */
/*         Locations not within that interval refer to non-exixtent */
/*         array elements. (To append to the array, the location */
/*         should be equal to NA+1.) */

/*         A negative dimension bug was fixed. The results of the */
/*         old version were unpredictable if the input array dimension */
/*         was negative. To avoid this problem the maximum of zero and */
/*         the input dimension becomes the dimension used by the */
/*         the routine. In this case, the only valid location at which */
/*         to insert is 1. If it is not 1, an error is signalled */
/*         when the location is checked. */

/* -& */

/*     SPICELIB functions */


/*     Other functions */


/*     Local variables */


/*     Standard SPICE error handling. */

    if (return_()) {
	return 0;
    } else {
	chkin_("INSLAI", (ftnlen)6);
    }

/*     Check the dimension of the array. */

    size = max(0,*na);

/*     Make sure the location at which the elements are to be inserted */
/*     is not out of range. If it is, signal an error and bail out. */

    if (*loc < 1 || *loc > size + 1) {
	setmsg_("Location was *.", (ftnlen)15);
	errint_("*", loc, (ftnlen)1);
	sigerr_("SPICE(INVALIDINDEX)", (ftnlen)19);
	chkout_("INSLAI", (ftnlen)6);
	return 0;
    }

/*     If the number of elements to be inserted is greater than zero, */
/*     insert them. If not, do not modify the array. */

    if (*ne > 0) {

/*        Move the trailing elements back to make room for the new ones. */

	i__1 = *loc;
	for (i__ = size; i__ >= i__1; --i__) {
	    array[i__ + *ne - 1] = array[i__ - 1];
	}

/*        Now put the new elements in the vacated spaces. */

	i__1 = *ne;
	for (i__ = 1; i__ <= i__1; ++i__) {
	    array[*loc + i__ - 2] = elts[i__ - 1];
	}

/*        Update the number of elements in the array. */

	*na = size + *ne;
    }
    chkout_("INSLAI", (ftnlen)6);
    return 0;
} /* inslai_ */