contents := make([]Object, 0, len(objects))
	var owner *Owner
	if fetchOwner {
		owner = &Owner{
			ID:          globalMinioDefaultOwnerID,
			DisplayName: "minio",
		}
	}

	data := ListObjectsV2Response{}

	for _, object := range objects {
		content := Object{}

                return o instanceof DefaultVersionResolverRequest that
                        && Objects.equals(artifactCoordinates, that.artifactCoordinates)
                        && Objects.equals(repositories, that.repositories);
            }

            @Override
            public int hashCode() {
                return Objects.hash(artifactCoordinates, repositories);
            }

            @Override

                return o instanceof DefaultVersionResolverRequest that
                        && Objects.equals(artifactCoordinates, that.artifactCoordinates)
                        && Objects.equals(repositories, that.repositories);
            }

            @Override
            public int hashCode() {
                return Objects.hash(artifactCoordinates, repositories);
            }

            @Override

                        && Objects.equals(installationSettingsSource, that.installationSettingsSource)
                        && Objects.equals(projectSettingsSource, that.projectSettingsSource)
                        && Objects.equals(userSettingsSource, that.userSettingsSource)
                        && Objects.equals(interpolationSource, that.interpolationSource);
            }

 *   <li>Each other step is derived from one or more input steps. At each step, zero or more objects
 *       can be captured for later closing.
 *   <li>There is one last step (the root of the tree), from which you can extract the final result
 *       of the computation. After that result is available (or the computation fails), all objects
 *       captured by any of the steps in the pipeline are closed.
 * </ol>
 *

					}
					prevPrefix = currPrefix
					objects = append(objects, ObjectInfo{
						IsDir:  true,
						Bucket: bucket,
						Name:   currPrefix,
					})
					continue
				}
			}

			fi, err := entry.fileInfo(bucket)
			if err == nil && fi.VersionPurgeStatus().Empty() {
				versioned := vcfg != nil && vcfg.Versioned(entry.name)
				objects = append(objects, fi.ToObjectInfo(bucket, entry.name, versioned))
			}

            return false;
        }
        InputSource that = (InputSource) o;
        return Objects.equals(modelId, that.modelId)
                && Objects.equals(location, that.location)
                && Objects.equals(inputs, that.inputs);
    }

    @Override
    public int hashCode() {
        return Objects.hash(modelId, location, inputs);
    }

    Stream<InputSource> sources() {

 *
 * @author wyukawa
 */
public abstract class ObjectUtil {

    /**
     * Do not instantiate.
     */
    protected ObjectUtil() {
    }

    /**
     * Returns true if the two objects are equal, or both are null.
     *
     * @param object1 the first object
     * @param object2 the second object
     * @return true if equal or both null, false otherwise
     */

                        && retryFailedDeploymentCount == that.retryFailedDeploymentCount
                        && Objects.equals(repository, that.repository)
                        && Objects.equals(artifacts, that.artifacts);
            }

            @Override
            public int hashCode() {
                return Objects.hash(repository, artifacts, retryFailedDeploymentCount);
            }

            @Override

                return o instanceof DefaultArtifactResolverRequest that
                        && Objects.equals(coordinates, that.coordinates)
                        && Objects.equals(repositories, that.repositories);
            }

            @Override
            public int hashCode() {
                return Objects.hash(coordinates, repositories);
            }

            @Override
            @Nonnull