Get the average waiting msecs per hard admission job entrance.

@return Average waiting msecs per hard admission job entrance
504535
synchronized float getAverageWaitMsecsPerHardAdmissionJob() {
    float averageWaitMsecsPerHardAdmissionJob = -1f;
    if (!hardAdmissionMillisQueue.isEmpty()) {
      long totalWait = 0;
      for (Long waitMillis : hardAdmissionMillisQueue) {
        totalWait += waitMillis;
      }
      averageWaitMsecsPerHardAdmissionJob =
        ((float) totalWait) / hardAdmissionMillisQueue.size();
    }
    return averageWaitMsecsPerHardAdmissionJob;
  }
723408
public int getJobType() {
	String jobType = getSingle("jobtype");
	if (jobType == null) return -1;
	if (jobType.equalsIgnoreCase("single")) {
	    return JOBTYPE_SINGLE;
	} else if (jobType.equalsIgnoreCase("multiple")) {
	    return JOBTYPE_MULTIPLE;
	} else if (jobType.equalsIgnoreCase("mpi")) {
	    return JOBTYPE_MPI;
	} else if (jobType.equalsIgnoreCase("condor")) {
	    return JOBTYPE_CONDOR;
	} else {
	    return -1;
	}
    }
914407
public com.google.api.ads.adwords.axis.v201809.cm.Money getAverageCpc() {
        return averageCpc;
    }
1135643
@Override
  public synchronized List<JobSpec> getJobs() {
    return Lists.transform(Lists.newArrayList(
        loader.loadPullFilesRecursively(loader.getRootDirectory(), this.sysConfig, shouldLoadGlobalConf())),
        this.converter);
  }
1558
def n_waiting(self):
        """"""
        return self._counters[JobStatus.no_job] +\
            self._counters[JobStatus.unknown] +\
            self._counters[JobStatus.not_ready] +\
            self._counters[JobStatus.ready]
53865
public static int getActiveJobs() {
	int jobs = 0;
	Enumeration e = callbackHandlers.elements();
	while(e.hasMoreElements()) {
	    CallbackHandler handler = (CallbackHandler)e.nextElement();
	    jobs += handler.getRegisteredJobsSize();
	}
	return jobs;
    }
862196
public java.util.List<ReservedInstancesOffering> getReservedInstancesOfferings() {
        if (reservedInstancesOfferings == null) {
            reservedInstancesOfferings = new com.amazonaws.internal.SdkInternalList<ReservedInstancesOffering>();
        }
        return reservedInstancesOfferings;
    }
565551
@Exported
    public int getBusyExecutors() {
        int r=0;
        for (Computer c : get_all()) {
            if(c.isOnline())
                r += c.countBusy();
        }
        return r;
    }
600646
public java.util.List<Job> getJobs() {
        if (jobs == null) {
            jobs = new com.amazonaws.internal.SdkInternalList<Job>();
        }
        return jobs;
    }
585509
public java.util.List<String> getJobFlowStates() {
        if (jobFlowStates == null) {
            jobFlowStates = new com.amazonaws.internal.SdkInternalList<String>();
        }
        return jobFlowStates;
    }
1247767
public Iterable<Entry<String, ProfileNode>> getDescendingOrderedNodes() {
			if( nodes == null ) return null;
			
			List<Entry<String, ProfileNode>> averageStepTimes = new LinkedList<Entry<String, ProfileNode>>(nodes.entrySet());
			
			Collections.sort(averageStepTimes, new Comparator<Entry<String, ProfileNode>>() {
				public int compare(Entry<String, ProfileNode> o1, Entry<String, ProfileNode> o2) {
					return (int) (o1.getValue().totalMillisecs - o2.getValue().totalMillisecs);
				}
			});
			
			
			return averageStepTimes;
	}
871929
public int getIncrementalMinResultSizeAndReset() {
        int retval = m_workerTask.m_incrMinResultSize;
        m_workerTask.m_incrMinResultSize = Integer.MAX_VALUE;
        if (isCoordinatorStatsUsable(true)) {
            m_coordinatorTask.m_incrMinResultSize = Integer.MAX_VALUE;
        }
        return retval;
    }
941820
public static int getQueuedTaskCount() {
    Thread t;
    ForkJoinPool.WorkQueue q;
    if ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread)
      q = ((ForkJoinWorkerThread) t).workQueue;
    else
      q = ForkJoinPool.commonSubmitterQueue();
    return (q == null) ? 0 : q.queueSize();
  }
20201
@Override
    public long getCumulativeJobInstancesCount()
    {
        DbConn em2 = Helpers.getNewDbSession();
        try
        {
            return em2.runSelectSingle("history_select_count_for_poller", Long.class, this.queue.getId(), this.engine.getNode().getId());
        }
        finally
        {
            Helpers.closeQuietly(em2);
        }
    }
602109
public double calcAvgSeek() {
        int count = 0;

        for (int i = 0, len = mSymbols.length; i < len; ++i) {
            if (mSymbols[i] != null) {
                ++count;
            }
        }

        for (int i = 0, len = mBuckets.length; i < len; ++i) {
            Bucket b = mBuckets[i];
            int cost = 2;
            while (b != null) {
                count += cost;
                ++cost;
                b = b.getNext();
            }
        }

        return ((double) count) / ((double) mSize);
    }
606618
public int getMin() {
        List<Integer> value = new ArrayList<Integer>();
        for (AnalysisType at : analysisType) {
            value.add(at.getValue());
        }
        return Collections.min(value);
    }
323475
public double[][] getResults() {
        double[][] results = new double[networkPipes.length][28];
        double[] one = new double[networkPipes.length];
        double[] two = new double[networkPipes.length];
        for( int i = 0; i < networkPipes.length; i++ ) {
            one[i] = i;
            two[i] = networkPipes[i].getId();

        }
        QuickSortAlgorithm t = new QuickSortAlgorithm(pm);
        t.sort(two, one);

        for( int i = 0; i < networkPipes.length; i++ ) {
            int index = (int) one[i];
            results[i][0] = networkPipes[index].getId();
            results[i][1] = networkPipes[index].getIdPipeWhereDrain();
            results[i][2] = networkPipes[index].getDrainArea();
            results[i][3] = networkPipes[index].getLenght();
            results[i][4] = networkPipes[index].getInitialElevation();
            results[i][5] = networkPipes[index].getFinalElevation();
            results[i][6] = networkPipes[index].getRunoffCoefficient();
            results[i][7] = networkPipes[index].getAverageResidenceTime();
            results[i][8] = networkPipes[index].getKs();
            results[i][9] = networkPipes[index].getMinimumPipeSlope();
            results[i][10] = networkPipes[index].getPipeSectionType();
            results[i][11] = networkPipes[index].getAverageSlope();
            results[i][12] = networkPipes[index].discharge;
            results[i][13] = networkPipes[index].coeffUdometrico;
            results[i][14] = networkPipes[index].residenceTime;
            results[i][15] = networkPipes[index].tP;
            results[i][16] = networkPipes[index].tQmax;
            results[i][17] = networkPipes[index].meanSpeed;
            results[i][18] = networkPipes[index].pipeSlope;
            results[i][19] = networkPipes[index].diameter;
            results[i][20] = networkPipes[index].emptyDegree;
            results[i][21] = networkPipes[index].depthInitialPipe;
            results[i][22] = networkPipes[index].depthFinalPipe;
            results[i][23] = networkPipes[index].initialFreesurface;
            results[i][24] = networkPipes[index].finalFreesurface;
            results[i][25] = networkPipes[index].totalSubNetArea;
            results[i][26] = networkPipes[index].meanLengthSubNet;
            results[i][27] = networkPipes[index].varianceLengthSubNet;

        }

        return results;
    }