,GAA6BH,2CAC7BI,GAAkCD,GAAN,aAC5BE,GAAkCF,GAAN,aAC5BG,GAA0BN,4CAC1BO,GAAwBD,GAAN,cAClBE,GAA0BF,GAAN,gBACpBG,GAAuBH,GAAN,aACjBI,GAA6B,uCAE7BC,GAA4B,oCAC5BC,GAAgC,+BAChCC,GAAyB,cACzBC,GAA6B,yBAE7B7N,GAAU,CACd8N,WADc,SACHC,GACT,OAAOA,GAETC,aAJc,SAIDD,GACX,OAAOA,GAETE,aAPc,SAODF,GACX,OAAOA,GAETG,gBAAgB,EAChBC,gBAAgB,EAChBC,gBAAgB,EAChBC,cAAc,EACdC,iBAAiB,EACjBC,aAAa,EACbC,eAAe,EACfC,gBAAgB,EAChBC,aAAc,GACdC,oBAAoB,EACpBC,aAAc,YACdC,aAAc,eAQVC,GAAAA,WACJ,SAAAA,EAAY1N,EAASkC,GACnBhC,KAAKiG,QAAUjE,EACf...

    
```

These are all Java processes. Each process has a corresponding "runtime".
All source code in Gradle is written to target one or more of these runtimes.
Most source code targets the daemon and the remaining code either targets a single runtime, for example the Gradle client, or is shared across multiple runtimes.

## Composition by architecture modules

 * </pre>
 *
 * <p>This tests:
 *
 * <ul>
 *   <li>comparing each object against itself returns true
 *   <li>comparing each object against null returns false
 *   <li>comparing each object against an instance of an incompatible class returns false
 *   <li>comparing each pair of objects within the same equality group returns true
 *   <li>comparing each pair of objects from different equality groups returns false

## Build state model

As Gradle executes, it acts on various pieces of the build definition, such as each project in the build.
Gradle tracks the state of each piece and transitions each piece through its lifecycle as the build runs.

A central part of the Gradle architecture is the "build state model", which holds the state for each piece and coordinates state transitions and other mutations. 

needed.  When you restart, it is immediate and non-disruptive to the applications. Each group of servers in the command-line is called a pool. There are 2 server pools in this example. New objects are placed in server pools in proportion to the amount of free space in each pool. Within each pool, the location of the erasure-set of drives is determined based on a deterministic hashing algorithm.

> **NOTE:** **Each pool you add must have the same erasure coding parity configuration as the original...

")),!c&&e.attr("list")){var l=[],m=a("#"+e.attr("list"));if(m.find("option").each(function(){l.push(a(this).text())}),0===l.length){var n=a.trim(a("#"+e.attr("list")).text()).split("\n");a.each(n,function(b,c){l.push(a.trim(c))})}m.remove(),a.formUtils.suggest(e,l)}if(b.length){f||(h["data-validation-optional"]="true"),g=!0;var o=(e.attr("data-validation")||"")+" "+b.join(" ");e.attr("data-validation",a.trim(o)),a.each(h,function(a,b){e.attr(a,b)})}}),g&&e.trigger("html5ValidationAttrsFound"),b|...

The install is organized in 'environments' - each environment consists of a set of components
in different namespaces that are configured to work together. Regardless of 'environment',
workloads can talk with each other and obey the Istio configuration resources, but each environment
can use different Istio versions and different configuration defaults.

    + row.withPanels([
      panels.timeSeries.simple('Pilot Versions', queries.istioBuild, 'Version number of each running instance'),
    ]),
  ], panelHeight=5)
  + grid.makeGrid([
    row.new('Resource Usage')
    + row.withPanels([
      panels.timeSeries.bytes('Memory Usage', queries.goMemoryUsage, 'Memory usage of each running instance'),

    }

    List<PropertyDoc> getExtensionProperties() {
        List<PropertyDoc> properties = []
        mixinClasses.each { mixin ->
            mixin.classProperties.each { prop ->
                properties << prop.forClass(targetClass)
            }
        }
        extraProperties.each { prop ->
            properties << prop.forClass(targetClass)
        }
        return properties.sort { it.name }
    }

 *
 * <p>{@code CharSink} provides two kinds of methods:
 *
 * <ul>
 *   <li><b>Methods that return a writer:</b> These methods should return a <i>new</i>, independent
 *       instance each time they are called. The caller is responsible for ensuring that the
 *       returned writer is closed.
 *   <li><b>Convenience methods:</b> These are implementations of common operations that are