TrashVersionUtil.java

/**
 * Copyright (c) 2000-present Liferay, Inc. All rights reserved.
 *
 * This library is free software; you can redistribute it and/or modify it under
 * the terms of the GNU Lesser General Public License as published by the Free
 * Software Foundation; either version 2.1 of the License, or (at your option)
 * any later version.
 *
 * This library is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
 * details.
 */

package com.liferay.trash.kernel.service.persistence;

import aQute.bnd.annotation.ProviderType;

import com.liferay.portal.kernel.bean.PortalBeanLocatorUtil;
import com.liferay.portal.kernel.dao.orm.DynamicQuery;
import com.liferay.portal.kernel.service.ServiceContext;
import com.liferay.portal.kernel.util.OrderByComparator;
import com.liferay.portal.kernel.util.ReferenceRegistry;

import com.liferay.trash.kernel.model.TrashVersion;

import java.util.List;

/**
 * The persistence utility for the trash version service. This utility wraps {@link com.liferay.portlet.trash.service.persistence.impl.TrashVersionPersistenceImpl} and provides direct access to the database for CRUD operations. This utility should only be used by the service layer, as it must operate within a transaction. Never access this utility in a JSP, controller, model, or other front-end class.
 *
 * <p>
 * Caching information and settings can be found in <code>portal.properties</code>
 * </p>
 *
 * @author Brian Wing Shun Chan
 * @see TrashVersionPersistence
 * @see com.liferay.portlet.trash.service.persistence.impl.TrashVersionPersistenceImpl
 * @generated
 */
@ProviderType
public class TrashVersionUtil {
	/*
	 * NOTE FOR DEVELOPERS:
	 *
	 * Never modify this class directly. Modify <code>service.xml</code> and rerun ServiceBuilder to regenerate this class.
	 */

	/**
	 * @see com.liferay.portal.kernel.service.persistence.BasePersistence#clearCache()
	 */
	public static void clearCache() {
		getPersistence().clearCache();
	}

	/**
	 * @see com.liferay.portal.kernel.service.persistence.BasePersistence#clearCache(com.liferay.portal.kernel.model.BaseModel)
	 */
	public static void clearCache(TrashVersion trashVersion) {
		getPersistence().clearCache(trashVersion);
	}

	/**
	 * @see com.liferay.portal.kernel.service.persistence.BasePersistence#countWithDynamicQuery(DynamicQuery)
	 */
	public static long countWithDynamicQuery(DynamicQuery dynamicQuery) {
		return getPersistence().countWithDynamicQuery(dynamicQuery);
	}

	/**
	 * @see com.liferay.portal.kernel.service.persistence.BasePersistence#findWithDynamicQuery(DynamicQuery)
	 */
	public static List<TrashVersion> findWithDynamicQuery(
		DynamicQuery dynamicQuery) {
		return getPersistence().findWithDynamicQuery(dynamicQuery);
	}

	/**
	 * @see com.liferay.portal.kernel.service.persistence.BasePersistence#findWithDynamicQuery(DynamicQuery, int, int)
	 */
	public static List<TrashVersion> findWithDynamicQuery(
		DynamicQuery dynamicQuery, int start, int end) {
		return getPersistence().findWithDynamicQuery(dynamicQuery, start, end);
	}

	/**
	 * @see com.liferay.portal.kernel.service.persistence.BasePersistence#findWithDynamicQuery(DynamicQuery, int, int, OrderByComparator)
	 */
	public static List<TrashVersion> findWithDynamicQuery(
		DynamicQuery dynamicQuery, int start, int end,
		OrderByComparator<TrashVersion> orderByComparator) {
		return getPersistence()
				   .findWithDynamicQuery(dynamicQuery, start, end,
			orderByComparator);
	}

	/**
	 * @see com.liferay.portal.kernel.service.persistence.BasePersistence#update(com.liferay.portal.kernel.model.BaseModel)
	 */
	public static TrashVersion update(TrashVersion trashVersion) {
		return getPersistence().update(trashVersion);
	}

	/**
	 * @see com.liferay.portal.kernel.service.persistence.BasePersistence#update(com.liferay.portal.kernel.model.BaseModel, ServiceContext)
	 */
	public static TrashVersion update(TrashVersion trashVersion,
		ServiceContext serviceContext) {
		return getPersistence().update(trashVersion, serviceContext);
	}

	/**
	* Returns all the trash versions where entryId = ?.
	*
	* @param entryId the entry ID
	* @return the matching trash versions
	*/
	public static List<TrashVersion> findByEntryId(long entryId) {
		return getPersistence().findByEntryId(entryId);
	}

	/**
	* Returns a range of all the trash versions where entryId = ?.
	*
	* <p>
	* Useful when paginating results. Returns a maximum of <code>end - start</code> instances. <code>start</code> and <code>end</code> are not primary keys, they are indexes in the result set. Thus, <code>0</code> refers to the first result in the set. Setting both <code>start</code> and <code>end</code> to {@link QueryUtil#ALL_POS} will return the full result set. If <code>orderByComparator</code> is specified, then the query will include the given ORDER BY logic. If <code>orderByComparator</code> is absent and pagination is required (<code>start</code> and <code>end</code> are not {@link QueryUtil#ALL_POS}), then the query will include the default ORDER BY logic from {@link TrashVersionModelImpl}. If both <code>orderByComparator</code> and pagination are absent, for performance reasons, the query will not have an ORDER BY clause and the returned result set will be sorted on by the primary key in an ascending order.
	* </p>
	*
	* @param entryId the entry ID
	* @param start the lower bound of the range of trash versions
	* @param end the upper bound of the range of trash versions (not inclusive)
	* @return the range of matching trash versions
	*/
	public static List<TrashVersion> findByEntryId(long entryId, int start,
		int end) {
		return getPersistence().findByEntryId(entryId, start, end);
	}

	/**
	* Returns an ordered range of all the trash versions where entryId = ?.
	*
	* <p>
	* Useful when paginating results. Returns a maximum of <code>end - start</code> instances. <code>start</code> and <code>end</code> are not primary keys, they are indexes in the result set. Thus, <code>0</code> refers to the first result in the set. Setting both <code>start</code> and <code>end</code> to {@link QueryUtil#ALL_POS} will return the full result set. If <code>orderByComparator</code> is specified, then the query will include the given ORDER BY logic. If <code>orderByComparator</code> is absent and pagination is required (<code>start</code> and <code>end</code> are not {@link QueryUtil#ALL_POS}), then the query will include the default ORDER BY logic from {@link TrashVersionModelImpl}. If both <code>orderByComparator</code> and pagination are absent, for performance reasons, the query will not have an ORDER BY clause and the returned result set will be sorted on by the primary key in an ascending order.
	* </p>
	*
	* @param entryId the entry ID
	* @param start the lower bound of the range of trash versions
	* @param end the upper bound of the range of trash versions (not inclusive)
	* @param orderByComparator the comparator to order the results by (optionally <code>null</code>)
	* @return the ordered range of matching trash versions
	*/
	public static List<TrashVersion> findByEntryId(long entryId, int start,
		int end, OrderByComparator<TrashVersion> orderByComparator) {
		return getPersistence()
				   .findByEntryId(entryId, start, end, orderByComparator);
	}

	/**
	* Returns an ordered range of all the trash versions where entryId = ?.
	*
	* <p>
	* Useful when paginating results. Returns a maximum of <code>end - start</code> instances. <code>start</code> and <code>end</code> are not primary keys, they are indexes in the result set. Thus, <code>0</code> refers to the first result in the set. Setting both <code>start</code> and <code>end</code> to {@link QueryUtil#ALL_POS} will return the full result set. If <code>orderByComparator</code> is specified, then the query will include the given ORDER BY logic. If <code>orderByComparator</code> is absent and pagination is required (<code>start</code> and <code>end</code> are not {@link QueryUtil#ALL_POS}), then the query will include the default ORDER BY logic from {@link TrashVersionModelImpl}. If both <code>orderByComparator</code> and pagination are absent, for performance reasons, the query will not have an ORDER BY clause and the returned result set will be sorted on by the primary key in an ascending order.
	* </p>
	*
	* @param entryId the entry ID
	* @param start the lower bound of the range of trash versions
	* @param end the upper bound of the range of trash versions (not inclusive)
	* @param orderByComparator the comparator to order the results by (optionally <code>null</code>)
	* @param retrieveFromCache whether to retrieve from the finder cache
	* @return the ordered range of matching trash versions
	*/
	public static List<TrashVersion> findByEntryId(long entryId, int start,
		int end, OrderByComparator<TrashVersion> orderByComparator,
		boolean retrieveFromCache) {
		return getPersistence()
				   .findByEntryId(entryId, start, end, orderByComparator,
			retrieveFromCache);
	}

	/**
	* Returns the first trash version in the ordered set where entryId = ?.
	*
	* @param entryId the entry ID
	* @param orderByComparator the comparator to order the set by (optionally <code>null</code>)
	* @return the first matching trash version
	* @throws NoSuchVersionException if a matching trash version could not be found
	*/
	public static TrashVersion findByEntryId_First(long entryId,
		OrderByComparator<TrashVersion> orderByComparator)
		throws com.liferay.trash.kernel.exception.NoSuchVersionException {
		return getPersistence().findByEntryId_First(entryId, orderByComparator);
	}

	/**
	* Returns the first trash version in the ordered set where entryId = ?.
	*
	* @param entryId the entry ID
	* @param orderByComparator the comparator to order the set by (optionally <code>null</code>)
	* @return the first matching trash version, or <code>null</code> if a matching trash version could not be found
	*/
	public static TrashVersion fetchByEntryId_First(long entryId,
		OrderByComparator<TrashVersion> orderByComparator) {
		return getPersistence().fetchByEntryId_First(entryId, orderByComparator);
	}

	/**
	* Returns the last trash version in the ordered set where entryId = ?.
	*
	* @param entryId the entry ID
	* @param orderByComparator the comparator to order the set by (optionally <code>null</code>)
	* @return the last matching trash version
	* @throws NoSuchVersionException if a matching trash version could not be found
	*/
	public static TrashVersion findByEntryId_Last(long entryId,
		OrderByComparator<TrashVersion> orderByComparator)
		throws com.liferay.trash.kernel.exception.NoSuchVersionException {
		return getPersistence().findByEntryId_Last(entryId, orderByComparator);
	}

	/**
	* Returns the last trash version in the ordered set where entryId = ?.
	*
	* @param entryId the entry ID
	* @param orderByComparator the comparator to order the set by (optionally <code>null</code>)
	* @return the last matching trash version, or <code>null</code> if a matching trash version could not be found
	*/
	public static TrashVersion fetchByEntryId_Last(long entryId,
		OrderByComparator<TrashVersion> orderByComparator) {
		return getPersistence().fetchByEntryId_Last(entryId, orderByComparator);
	}

	/**
	* Returns the trash versions before and after the current trash version in the ordered set where entryId = ?.
	*
	* @param versionId the primary key of the current trash version
	* @param entryId the entry ID
	* @param orderByComparator the comparator to order the set by (optionally <code>null</code>)
	* @return the previous, current, and next trash version
	* @throws NoSuchVersionException if a trash version with the primary key could not be found
	*/
	public static TrashVersion[] findByEntryId_PrevAndNext(long versionId,
		long entryId, OrderByComparator<TrashVersion> orderByComparator)
		throws com.liferay.trash.kernel.exception.NoSuchVersionException {
		return getPersistence()
				   .findByEntryId_PrevAndNext(versionId, entryId,
			orderByComparator);
	}

	/**
	* Removes all the trash versions where entryId = ? from the database.
	*
	* @param entryId the entry ID
	*/
	public static void removeByEntryId(long entryId) {
		getPersistence().removeByEntryId(entryId);
	}

	/**
	* Returns the number of trash versions where entryId = ?.
	*
	* @param entryId the entry ID
	* @return the number of matching trash versions
	*/
	public static int countByEntryId(long entryId) {
		return getPersistence().countByEntryId(entryId);
	}

	/**
	* Returns all the trash versions where entryId = ? and classNameId = ?.
	*
	* @param entryId the entry ID
	* @param classNameId the class name ID
	* @return the matching trash versions
	*/
	public static List<TrashVersion> findByE_C(long entryId, long classNameId) {
		return getPersistence().findByE_C(entryId, classNameId);
	}

	/**
	* Returns a range of all the trash versions where entryId = ? and classNameId = ?.
	*
	* <p>
	* Useful when paginating results. Returns a maximum of <code>end - start</code> instances. <code>start</code> and <code>end</code> are not primary keys, they are indexes in the result set. Thus, <code>0</code> refers to the first result in the set. Setting both <code>start</code> and <code>end</code> to {@link QueryUtil#ALL_POS} will return the full result set. If <code>orderByComparator</code> is specified, then the query will include the given ORDER BY logic. If <code>orderByComparator</code> is absent and pagination is required (<code>start</code> and <code>end</code> are not {@link QueryUtil#ALL_POS}), then the query will include the default ORDER BY logic from {@link TrashVersionModelImpl}. If both <code>orderByComparator</code> and pagination are absent, for performance reasons, the query will not have an ORDER BY clause and the returned result set will be sorted on by the primary key in an ascending order.
	* </p>
	*
	* @param entryId the entry ID
	* @param classNameId the class name ID
	* @param start the lower bound of the range of trash versions
	* @param end the upper bound of the range of trash versions (not inclusive)
	* @return the range of matching trash versions
	*/
	public static List<TrashVersion> findByE_C(long entryId, long classNameId,
		int start, int end) {
		return getPersistence().findByE_C(entryId, classNameId, start, end);
	}

	/**
	* Returns an ordered range of all the trash versions where entryId = ? and classNameId = ?.
	*
	* <p>
	* Useful when paginating results. Returns a maximum of <code>end - start</code> instances. <code>start</code> and <code>end</code> are not primary keys, they are indexes in the result set. Thus, <code>0</code> refers to the first result in the set. Setting both <code>start</code> and <code>end</code> to {@link QueryUtil#ALL_POS} will return the full result set. If <code>orderByComparator</code> is specified, then the query will include the given ORDER BY logic. If <code>orderByComparator</code> is absent and pagination is required (<code>start</code> and <code>end</code> are not {@link QueryUtil#ALL_POS}), then the query will include the default ORDER BY logic from {@link TrashVersionModelImpl}. If both <code>orderByComparator</code> and pagination are absent, for performance reasons, the query will not have an ORDER BY clause and the returned result set will be sorted on by the primary key in an ascending order.
	* </p>
	*
	* @param entryId the entry ID
	* @param classNameId the class name ID
	* @param start the lower bound of the range of trash versions
	* @param end the upper bound of the range of trash versions (not inclusive)
	* @param orderByComparator the comparator to order the results by (optionally <code>null</code>)
	* @return the ordered range of matching trash versions
	*/
	public static List<TrashVersion> findByE_C(long entryId, long classNameId,
		int start, int end, OrderByComparator<TrashVersion> orderByComparator) {
		return getPersistence()
				   .findByE_C(entryId, classNameId, start, end,
			orderByComparator);
	}

	/**
	* Returns an ordered range of all the trash versions where entryId = ? and classNameId = ?.
	*
	* <p>
	* Useful when paginating results. Returns a maximum of <code>end - start</code> instances. <code>start</code> and <code>end</code> are not primary keys, they are indexes in the result set. Thus, <code>0</code> refers to the first result in the set. Setting both <code>start</code> and <code>end</code> to {@link QueryUtil#ALL_POS} will return the full result set. If <code>orderByComparator</code> is specified, then the query will include the given ORDER BY logic. If <code>orderByComparator</code> is absent and pagination is required (<code>start</code> and <code>end</code> are not {@link QueryUtil#ALL_POS}), then the query will include the default ORDER BY logic from {@link TrashVersionModelImpl}. If both <code>orderByComparator</code> and pagination are absent, for performance reasons, the query will not have an ORDER BY clause and the returned result set will be sorted on by the primary key in an ascending order.
	* </p>
	*
	* @param entryId the entry ID
	* @param classNameId the class name ID
	* @param start the lower bound of the range of trash versions
	* @param end the upper bound of the range of trash versions (not inclusive)
	* @param orderByComparator the comparator to order the results by (optionally <code>null</code>)
	* @param retrieveFromCache whether to retrieve from the finder cache
	* @return the ordered range of matching trash versions
	*/
	public static List<TrashVersion> findByE_C(long entryId, long classNameId,
		int start, int end, OrderByComparator<TrashVersion> orderByComparator,
		boolean retrieveFromCache) {
		return getPersistence()
				   .findByE_C(entryId, classNameId, start, end,
			orderByComparator, retrieveFromCache);
	}

	/**
	* Returns the first trash version in the ordered set where entryId = ? and classNameId = ?.
	*
	* @param entryId the entry ID
	* @param classNameId the class name ID
	* @param orderByComparator the comparator to order the set by (optionally <code>null</code>)
	* @return the first matching trash version
	* @throws NoSuchVersionException if a matching trash version could not be found
	*/
	public static TrashVersion findByE_C_First(long entryId, long classNameId,
		OrderByComparator<TrashVersion> orderByComparator)
		throws com.liferay.trash.kernel.exception.NoSuchVersionException {
		return getPersistence()
				   .findByE_C_First(entryId, classNameId, orderByComparator);
	}

	/**
	* Returns the first trash version in the ordered set where entryId = ? and classNameId = ?.
	*
	* @param entryId the entry ID
	* @param classNameId the class name ID
	* @param orderByComparator the comparator to order the set by (optionally <code>null</code>)
	* @return the first matching trash version, or <code>null</code> if a matching trash version could not be found
	*/
	public static TrashVersion fetchByE_C_First(long entryId, long classNameId,
		OrderByComparator<TrashVersion> orderByComparator) {
		return getPersistence()
				   .fetchByE_C_First(entryId, classNameId, orderByComparator);
	}

	/**
	* Returns the last trash version in the ordered set where entryId = ? and classNameId = ?.
	*
	* @param entryId the entry ID
	* @param classNameId the class name ID
	* @param orderByComparator the comparator to order the set by (optionally <code>null</code>)
	* @return the last matching trash version
	* @throws NoSuchVersionException if a matching trash version could not be found
	*/
	public static TrashVersion findByE_C_Last(long entryId, long classNameId,
		OrderByComparator<TrashVersion> orderByComparator)
		throws com.liferay.trash.kernel.exception.NoSuchVersionException {
		return getPersistence()
				   .findByE_C_Last(entryId, classNameId, orderByComparator);
	}

	/**
	* Returns the last trash version in the ordered set where entryId = ? and classNameId = ?.
	*
	* @param entryId the entry ID
	* @param classNameId the class name ID
	* @param orderByComparator the comparator to order the set by (optionally <code>null</code>)
	* @return the last matching trash version, or <code>null</code> if a matching trash version could not be found
	*/
	public static TrashVersion fetchByE_C_Last(long entryId, long classNameId,
		OrderByComparator<TrashVersion> orderByComparator) {
		return getPersistence()
				   .fetchByE_C_Last(entryId, classNameId, orderByComparator);
	}

	/**
	* Returns the trash versions before and after the current trash version in the ordered set where entryId = ? and classNameId = ?.
	*
	* @param versionId the primary key of the current trash version
	* @param entryId the entry ID
	* @param classNameId the class name ID
	* @param orderByComparator the comparator to order the set by (optionally <code>null</code>)
	* @return the previous, current, and next trash version
	* @throws NoSuchVersionException if a trash version with the primary key could not be found
	*/
	public static TrashVersion[] findByE_C_PrevAndNext(long versionId,
		long entryId, long classNameId,
		OrderByComparator<TrashVersion> orderByComparator)
		throws com.liferay.trash.kernel.exception.NoSuchVersionException {
		return getPersistence()
				   .findByE_C_PrevAndNext(versionId, entryId, classNameId,
			orderByComparator);
	}

	/**
	* Removes all the trash versions where entryId = ? and classNameId = ? from the database.
	*
	* @param entryId the entry ID
	* @param classNameId the class name ID
	*/
	public static void removeByE_C(long entryId, long classNameId) {
		getPersistence().removeByE_C(entryId, classNameId);
	}

	/**
	* Returns the number of trash versions where entryId = ? and classNameId = ?.
	*
	* @param entryId the entry ID
	* @param classNameId the class name ID
	* @return the number of matching trash versions
	*/
	public static int countByE_C(long entryId, long classNameId) {
		return getPersistence().countByE_C(entryId, classNameId);
	}

	/**
	* Returns the trash version where classNameId = ? and classPK = ? or throws a {@link NoSuchVersionException} if it could not be found.
	*
	* @param classNameId the class name ID
	* @param classPK the class pk
	* @return the matching trash version
	* @throws NoSuchVersionException if a matching trash version could not be found
	*/
	public static TrashVersion findByC_C(long classNameId, long classPK)
		throws com.liferay.trash.kernel.exception.NoSuchVersionException {
		return getPersistence().findByC_C(classNameId, classPK);
	}

	/**
	* Returns the trash version where classNameId = ? and classPK = ? or returns <code>null</code> if it could not be found. Uses the finder cache.
	*
	* @param classNameId the class name ID
	* @param classPK the class pk
	* @return the matching trash version, or <code>null</code> if a matching trash version could not be found
	*/
	public static TrashVersion fetchByC_C(long classNameId, long classPK) {
		return getPersistence().fetchByC_C(classNameId, classPK);
	}

	/**
	* Returns the trash version where classNameId = ? and classPK = ? or returns <code>null</code> if it could not be found, optionally using the finder cache.
	*
	* @param classNameId the class name ID
	* @param classPK the class pk
	* @param retrieveFromCache whether to retrieve from the finder cache
	* @return the matching trash version, or <code>null</code> if a matching trash version could not be found
	*/
	public static TrashVersion fetchByC_C(long classNameId, long classPK,
		boolean retrieveFromCache) {
		return getPersistence()
				   .fetchByC_C(classNameId, classPK, retrieveFromCache);
	}

	/**
	* Removes the trash version where classNameId = ? and classPK = ? from the database.
	*
	* @param classNameId the class name ID
	* @param classPK the class pk
	* @return the trash version that was removed
	*/
	public static TrashVersion removeByC_C(long classNameId, long classPK)
		throws com.liferay.trash.kernel.exception.NoSuchVersionException {
		return getPersistence().removeByC_C(classNameId, classPK);
	}

	/**
	* Returns the number of trash versions where classNameId = ? and classPK = ?.
	*
	* @param classNameId the class name ID
	* @param classPK the class pk
	* @return the number of matching trash versions
	*/
	public static int countByC_C(long classNameId, long classPK) {
		return getPersistence().countByC_C(classNameId, classPK);
	}

	/**
	* Caches the trash version in the entity cache if it is enabled.
	*
	* @param trashVersion the trash version
	*/
	public static void cacheResult(TrashVersion trashVersion) {
		getPersistence().cacheResult(trashVersion);
	}

	/**
	* Caches the trash versions in the entity cache if it is enabled.
	*
	* @param trashVersions the trash versions
	*/
	public static void cacheResult(List<TrashVersion> trashVersions) {
		getPersistence().cacheResult(trashVersions);
	}

	/**
	* Creates a new trash version with the primary key. Does not add the trash version to the database.
	*
	* @param versionId the primary key for the new trash version
	* @return the new trash version
	*/
	public static TrashVersion create(long versionId) {
		return getPersistence().create(versionId);
	}

	/**
	* Removes the trash version with the primary key from the database. Also notifies the appropriate model listeners.
	*
	* @param versionId the primary key of the trash version
	* @return the trash version that was removed
	* @throws NoSuchVersionException if a trash version with the primary key could not be found
	*/
	public static TrashVersion remove(long versionId)
		throws com.liferay.trash.kernel.exception.NoSuchVersionException {
		return getPersistence().remove(versionId);
	}

	public static TrashVersion updateImpl(TrashVersion trashVersion) {
		return getPersistence().updateImpl(trashVersion);
	}

	/**
	* Returns the trash version with the primary key or throws a {@link NoSuchVersionException} if it could not be found.
	*
	* @param versionId the primary key of the trash version
	* @return the trash version
	* @throws NoSuchVersionException if a trash version with the primary key could not be found
	*/
	public static TrashVersion findByPrimaryKey(long versionId)
		throws com.liferay.trash.kernel.exception.NoSuchVersionException {
		return getPersistence().findByPrimaryKey(versionId);
	}

	/**
	* Returns the trash version with the primary key or returns <code>null</code> if it could not be found.
	*
	* @param versionId the primary key of the trash version
	* @return the trash version, or <code>null</code> if a trash version with the primary key could not be found
	*/
	public static TrashVersion fetchByPrimaryKey(long versionId) {
		return getPersistence().fetchByPrimaryKey(versionId);
	}

	public static java.util.Map<java.io.Serializable, TrashVersion> fetchByPrimaryKeys(
		java.util.Set<java.io.Serializable> primaryKeys) {
		return getPersistence().fetchByPrimaryKeys(primaryKeys);
	}

	/**
	* Returns all the trash versions.
	*
	* @return the trash versions
	*/
	public static List<TrashVersion> findAll() {
		return getPersistence().findAll();
	}

	/**
	* Returns a range of all the trash versions.
	*
	* <p>
	* Useful when paginating results. Returns a maximum of <code>end - start</code> instances. <code>start</code> and <code>end</code> are not primary keys, they are indexes in the result set. Thus, <code>0</code> refers to the first result in the set. Setting both <code>start</code> and <code>end</code> to {@link QueryUtil#ALL_POS} will return the full result set. If <code>orderByComparator</code> is specified, then the query will include the given ORDER BY logic. If <code>orderByComparator</code> is absent and pagination is required (<code>start</code> and <code>end</code> are not {@link QueryUtil#ALL_POS}), then the query will include the default ORDER BY logic from {@link TrashVersionModelImpl}. If both <code>orderByComparator</code> and pagination are absent, for performance reasons, the query will not have an ORDER BY clause and the returned result set will be sorted on by the primary key in an ascending order.
	* </p>
	*
	* @param start the lower bound of the range of trash versions
	* @param end the upper bound of the range of trash versions (not inclusive)
	* @return the range of trash versions
	*/
	public static List<TrashVersion> findAll(int start, int end) {
		return getPersistence().findAll(start, end);
	}

	/**
	* Returns an ordered range of all the trash versions.
	*
	* <p>
	* Useful when paginating results. Returns a maximum of <code>end - start</code> instances. <code>start</code> and <code>end</code> are not primary keys, they are indexes in the result set. Thus, <code>0</code> refers to the first result in the set. Setting both <code>start</code> and <code>end</code> to {@link QueryUtil#ALL_POS} will return the full result set. If <code>orderByComparator</code> is specified, then the query will include the given ORDER BY logic. If <code>orderByComparator</code> is absent and pagination is required (<code>start</code> and <code>end</code> are not {@link QueryUtil#ALL_POS}), then the query will include the default ORDER BY logic from {@link TrashVersionModelImpl}. If both <code>orderByComparator</code> and pagination are absent, for performance reasons, the query will not have an ORDER BY clause and the returned result set will be sorted on by the primary key in an ascending order.
	* </p>
	*
	* @param start the lower bound of the range of trash versions
	* @param end the upper bound of the range of trash versions (not inclusive)
	* @param orderByComparator the comparator to order the results by (optionally <code>null</code>)
	* @return the ordered range of trash versions
	*/
	public static List<TrashVersion> findAll(int start, int end,
		OrderByComparator<TrashVersion> orderByComparator) {
		return getPersistence().findAll(start, end, orderByComparator);
	}

	/**
	* Returns an ordered range of all the trash versions.
	*
	* <p>
	* Useful when paginating results. Returns a maximum of <code>end - start</code> instances. <code>start</code> and <code>end</code> are not primary keys, they are indexes in the result set. Thus, <code>0</code> refers to the first result in the set. Setting both <code>start</code> and <code>end</code> to {@link QueryUtil#ALL_POS} will return the full result set. If <code>orderByComparator</code> is specified, then the query will include the given ORDER BY logic. If <code>orderByComparator</code> is absent and pagination is required (<code>start</code> and <code>end</code> are not {@link QueryUtil#ALL_POS}), then the query will include the default ORDER BY logic from {@link TrashVersionModelImpl}. If both <code>orderByComparator</code> and pagination are absent, for performance reasons, the query will not have an ORDER BY clause and the returned result set will be sorted on by the primary key in an ascending order.
	* </p>
	*
	* @param start the lower bound of the range of trash versions
	* @param end the upper bound of the range of trash versions (not inclusive)
	* @param orderByComparator the comparator to order the results by (optionally <code>null</code>)
	* @param retrieveFromCache whether to retrieve from the finder cache
	* @return the ordered range of trash versions
	*/
	public static List<TrashVersion> findAll(int start, int end,
		OrderByComparator<TrashVersion> orderByComparator,
		boolean retrieveFromCache) {
		return getPersistence()
				   .findAll(start, end, orderByComparator, retrieveFromCache);
	}

	/**
	* Removes all the trash versions from the database.
	*/
	public static void removeAll() {
		getPersistence().removeAll();
	}

	/**
	* Returns the number of trash versions.
	*
	* @return the number of trash versions
	*/
	public static int countAll() {
		return getPersistence().countAll();
	}

	public static TrashVersionPersistence getPersistence() {
		if (_persistence == null) {
			_persistence = (TrashVersionPersistence)PortalBeanLocatorUtil.locate(TrashVersionPersistence.class.getName());

			ReferenceRegistry.registerReference(TrashVersionUtil.class,
				"_persistence");
		}

		return _persistence;
	}

	private static TrashVersionPersistence _persistence;
}