Gradle

Clone Tools
  • last updated a few seconds ago
Constraints
Constraints: committers
 
Constraints: files
Constraints: dates
Rename `HashFunction` methods hinting at object allocation

Rename `HashFunction` methods hinting at object allocation

Rename `HashFunction` methods hinting at object allocation

Add new hasher tests for `Hashing#hash` consistency

Add (failing) tests for hasher reusability

Add (failing) tests for hasher reusability

Add new hasher tests for `Hashing#hash` consistency

Add (failing) tests for hasher reusability

Add new hasher tests for `Hashing#hash` consistency

Add new hasher tests for `Hashing#hash` consistency

Delay selection when constraint exists

When a node makes it into the graph, it potentially can transform

pending constraints into valid edges. When that happens, we defer the

selection of the the node so that it happens when the constraint

selector also is known.

In the best case, a fixed version is computed, skipping a dynamic

version resolution. In the worst case, the defer was not needed because

the constraint does not change the selection result.

Delay selection when constraint exists

When a node makes it into the graph, it potentially can transform

pending constraints into valid edges. When that happens, we defer the

selection of the the node so that it happens when the constraint

selector also is known.

In the best case, a fixed version is computed, skipping a dynamic

version resolution. In the worst case, the defer was not needed because

the constraint does not change the selection result.

Delay selection when constraint exists

When a node makes it into the graph, it potentially can transform

pending constraints into valid edges. When that happens, we defer the

selection of the the node so that it happens when the constraint

selector also is known.

In the best case, a fixed version is computed, skipping a dynamic

version resolution. In the worst case, the defer was not needed because

the constraint does not change the selection result.

Delay selection when constraint exists

When a node makes it into the graph, it potentially can transform

pending constraints into valid edges. When that happens, we defer the

selection of the the node so that it happens when the constraint

selector also is known.

In the best case, a fixed version is computed, skipping a dynamic

version resolution. In the worst case, the defer was not needed because

the constraint does not change the selection result.

Delay selection when constraint exists

When a node makes it into the graph, it potentially can transform

pending constraints into valid edges. When that happens, we defer the

selection of the the node so that it happens when the constraint

selector also is known.

In the best case, a fixed version is computed, skipping a dynamic

version resolution. In the worst case, the defer was not needed because

the constraint does not change the selection result.

Delay selection when constraint exists

When a node makes it into the graph, it potentially can transform

pending constraints into valid edges. When that happens, we defer the

selection of the the node so that it happens when the constraint

selector also is known.

In the best case, a fixed version is computed, skipping a dynamic

version resolution. In the worst case, the defer was not needed because

the constraint does not change the selection result.

Delay selection when constraint exists

When a node makes it into the graph, it potentially can transform

pending constraints into valid edges. When that happens, we defer the

selection of the the node so that it happens when the constraint

selector also is known.

In the best case, a fixed version is computed, skipping a dynamic

version resolution. In the worst case, the defer was not needed because

the constraint does not change the selection result.

Delay selection when constraint exists

When a node makes it into the graph, it potentially can transform

pending constraints into valid edges. When that happens, we defer the

selection of the the node so that it happens when the constraint

selector also is known.

In the best case, a fixed version is computed, skipping a dynamic

version resolution. In the worst case, the defer was not needed because

the constraint does not change the selection result.

Publish 5.4.1

Rework how composite excludes are joined

Set init kotlin version to 1.3.31

for consistency

Signed-off-by: Paul Merlin <paul@gradle.com>

Merge branch 'master' into bamboo/master/kotlin-1.3.31

Introduce interfaces for exclude leaf types

This is a preliminary step to introducing a new factory.

  1. … 3 more files in changeset.
Remove caching factory as it's inefficient

Reduce number of smoke tested kotlin versions

Signed-off-by: Paul Merlin <paul@gradle.com>

Fix incorrect reduction of anyOf/allOf

Update released version to latest snapshot

Update library versions in build init to latest for 5.6

Clean release notes and welcome message for 5.6

    • -18
    • +0
    /subprojects/docs/src/docs/release/notes.md
Update version to 5.6