text
stringlengths 1
22.8M
|
|---|
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\Looker;
class Date extends \Google\Model
{
/**
* @var int
*/
public $day;
/**
* @var int
*/
public $month;
/**
* @var int
*/
public $year;
/**
* @param int
*/
public function setDay($day)
{
$this->day = $day;
}
/**
* @return int
*/
public function getDay()
{
return $this->day;
}
/**
* @param int
*/
public function setMonth($month)
{
$this->month = $month;
}
/**
* @return int
*/
public function getMonth()
{
return $this->month;
}
/**
* @param int
*/
public function setYear($year)
{
$this->year = $year;
}
/**
* @return int
*/
public function getYear()
{
return $this->year;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(Date::class, 'Google_Service_Looker_Date');
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
var discreteUniform = require( '@stdlib/random/base/discrete-uniform' );
var months = require( './../lib' );
var list;
var len;
var idx;
var i;
list = months();
len = list.length;
// Select random months from the list...
for ( i = 0; i < 100; i++ ) {
idx = discreteUniform( 0, len-1 );
console.log( list[ idx ] );
}
```
|
```kotlin
package de.westnordost.streetcomplete.quests.bus_stop_bench
import de.westnordost.streetcomplete.R
import de.westnordost.streetcomplete.data.osm.geometry.ElementGeometry
import de.westnordost.streetcomplete.data.osm.osmquests.OsmFilterQuestType
import de.westnordost.streetcomplete.data.user.achievements.EditTypeAchievement.PEDESTRIAN
import de.westnordost.streetcomplete.osm.Tags
import de.westnordost.streetcomplete.osm.updateWithCheckDate
import de.westnordost.streetcomplete.quests.YesNoQuestForm
import de.westnordost.streetcomplete.util.ktx.toYesNo
class AddBenchStatusOnBusStop : OsmFilterQuestType<Boolean>() {
override val elementFilter = """
nodes, ways, relations with
(
public_transport = platform
or (highway = bus_stop and public_transport != stop_position)
)
and physically_present != no and naptan:BusStopType != HAR
and (!bench or bench older today -4 years)
"""
override val changesetComment = "Specify whether public transport stops have benches"
override val wikiLink = "Key:bench"
override val icon = R.drawable.ic_quest_bench_public_transport
override val achievements = listOf(PEDESTRIAN)
override fun getTitle(tags: Map<String, String>) = R.string.quest_busStopBench_title2
override fun createForm() = YesNoQuestForm()
override fun applyAnswerTo(answer: Boolean, tags: Tags, geometry: ElementGeometry, timestampEdited: Long) {
tags.updateWithCheckDate("bench", answer.toYesNo())
}
}
```
|
```go
package events
import "github.com/docker/go-metrics"
var (
eventsCounter metrics.Counter
eventSubscribers metrics.Gauge
)
func init() {
ns := metrics.NewNamespace("engine", "daemon", nil)
eventsCounter = ns.NewCounter("events", "The number of events logged")
eventSubscribers = ns.NewGauge("events_subscribers", "The number of current subscribers to events", metrics.Total)
metrics.Register(ns)
}
```
|
```javascript
'use strict';
if (process.env.NODE_ENV === 'production') {
module.exports = require('./cjs/react-dom-test-utils.production.js');
} else {
module.exports = require('./cjs/react-dom-test-utils.development.js');
}
```
|
```xml
interface Model {
id: number;
description: string;
fail: unknown;
}
const model: Model = {
id: 1,
description: 'Hello, World',
fail: null,
};
```
|
Puig d'Arques is a mountain of Catalonia, Spain. It has an elevation of 532 metres above sea level.
See also
Catalan Coastal Range
Mountains of Catalonia
References
Mountains of Catalonia
|
Thozhur Krishnan Nair (22 May 1896 – 15 June 1972) was the second and the last Prime Minister of the state of Cochin, India, from 1947 to 1948.
References
1896 births
1972 deaths
Politicians from Thrissur
Malayali politicians
Indian independence activists from Kerala
Chief Ministers of Kerala
|
```go
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
package prometheus
import (
"fmt"
"math"
"runtime"
"sort"
"sync"
"sync/atomic"
"time"
//lint:ignore SA1019 Need to keep deprecated package for compatibility.
"github.com/golang/protobuf/proto"
dto "github.com/prometheus/client_model/go"
)
// A Histogram counts individual observations from an event or sample stream in
// configurable buckets. Similar to a summary, it also provides a sum of
// observations and an observation count.
//
// On the Prometheus server, quantiles can be calculated from a Histogram using
// the histogram_quantile function in the query language.
//
// Note that Histograms, in contrast to Summaries, can be aggregated with the
// Prometheus query language (see the documentation for detailed
// procedures). However, Histograms require the user to pre-define suitable
// buckets, and they are in general less accurate. The Observe method of a
// Histogram has a very low performance overhead in comparison with the Observe
// method of a Summary.
//
// To create Histogram instances, use NewHistogram.
type Histogram interface {
Metric
Collector
// Observe adds a single observation to the histogram.
Observe(float64)
}
// bucketLabel is used for the label that defines the upper bound of a
// bucket of a histogram ("le" -> "less or equal").
const bucketLabel = "le"
// DefBuckets are the default Histogram buckets. The default buckets are
// tailored to broadly measure the response time (in seconds) of a network
// service. Most likely, however, you will be required to define buckets
// customized to your use case.
var (
DefBuckets = []float64{.005, .01, .025, .05, .1, .25, .5, 1, 2.5, 5, 10}
errBucketLabelNotAllowed = fmt.Errorf(
"%q is not allowed as label name in histograms", bucketLabel,
)
)
// LinearBuckets creates 'count' buckets, each 'width' wide, where the lowest
// bucket has an upper bound of 'start'. The final +Inf bucket is not counted
// and not included in the returned slice. The returned slice is meant to be
// used for the Buckets field of HistogramOpts.
//
// The function panics if 'count' is zero or negative.
func LinearBuckets(start, width float64, count int) []float64 {
if count < 1 {
panic("LinearBuckets needs a positive count")
}
buckets := make([]float64, count)
for i := range buckets {
buckets[i] = start
start += width
}
return buckets
}
// ExponentialBuckets creates 'count' buckets, where the lowest bucket has an
// upper bound of 'start' and each following bucket's upper bound is 'factor'
// times the previous bucket's upper bound. The final +Inf bucket is not counted
// and not included in the returned slice. The returned slice is meant to be
// used for the Buckets field of HistogramOpts.
//
// The function panics if 'count' is 0 or negative, if 'start' is 0 or negative,
// or if 'factor' is less than or equal 1.
func ExponentialBuckets(start, factor float64, count int) []float64 {
if count < 1 {
panic("ExponentialBuckets needs a positive count")
}
if start <= 0 {
panic("ExponentialBuckets needs a positive start value")
}
if factor <= 1 {
panic("ExponentialBuckets needs a factor greater than 1")
}
buckets := make([]float64, count)
for i := range buckets {
buckets[i] = start
start *= factor
}
return buckets
}
// HistogramOpts bundles the options for creating a Histogram metric. It is
// mandatory to set Name to a non-empty string. All other fields are optional
// and can safely be left at their zero value, although it is strongly
// encouraged to set a Help string.
type HistogramOpts struct {
// Namespace, Subsystem, and Name are components of the fully-qualified
// name of the Histogram (created by joining these components with
// "_"). Only Name is mandatory, the others merely help structuring the
// name. Note that the fully-qualified name of the Histogram must be a
// valid Prometheus metric name.
Namespace string
Subsystem string
Name string
// Help provides information about this Histogram.
//
// Metrics with the same fully-qualified name must have the same Help
// string.
Help string
// ConstLabels are used to attach fixed labels to this metric. Metrics
// with the same fully-qualified name must have the same label names in
// their ConstLabels.
//
// ConstLabels are only used rarely. In particular, do not use them to
// attach the same labels to all your metrics. Those use cases are
// better covered by target labels set by the scraping Prometheus
// server, or by one specific metric (e.g. a build_info or a
// machine_role metric). See also
// path_to_url#target-labels-not-static-scraped-labels
ConstLabels Labels
// Buckets defines the buckets into which observations are counted. Each
// element in the slice is the upper inclusive bound of a bucket. The
// values must be sorted in strictly increasing order. There is no need
// to add a highest bucket with +Inf bound, it will be added
// implicitly. The default value is DefBuckets.
Buckets []float64
}
// NewHistogram creates a new Histogram based on the provided HistogramOpts. It
// panics if the buckets in HistogramOpts are not in strictly increasing order.
//
// The returned implementation also implements ExemplarObserver. It is safe to
// perform the corresponding type assertion. Exemplars are tracked separately
// for each bucket.
func NewHistogram(opts HistogramOpts) Histogram {
return newHistogram(
NewDesc(
BuildFQName(opts.Namespace, opts.Subsystem, opts.Name),
opts.Help,
nil,
opts.ConstLabels,
),
opts,
)
}
func newHistogram(desc *Desc, opts HistogramOpts, labelValues ...string) Histogram {
if len(desc.variableLabels) != len(labelValues) {
panic(makeInconsistentCardinalityError(desc.fqName, desc.variableLabels, labelValues))
}
for _, n := range desc.variableLabels {
if n == bucketLabel {
panic(errBucketLabelNotAllowed)
}
}
for _, lp := range desc.constLabelPairs {
if lp.GetName() == bucketLabel {
panic(errBucketLabelNotAllowed)
}
}
if len(opts.Buckets) == 0 {
opts.Buckets = DefBuckets
}
h := &histogram{
desc: desc,
upperBounds: opts.Buckets,
labelPairs: makeLabelPairs(desc, labelValues),
counts: [2]*histogramCounts{{}, {}},
now: time.Now,
}
for i, upperBound := range h.upperBounds {
if i < len(h.upperBounds)-1 {
if upperBound >= h.upperBounds[i+1] {
panic(fmt.Errorf(
"histogram buckets must be in increasing order: %f >= %f",
upperBound, h.upperBounds[i+1],
))
}
} else {
if math.IsInf(upperBound, +1) {
// The +Inf bucket is implicit. Remove it here.
h.upperBounds = h.upperBounds[:i]
}
}
}
// Finally we know the final length of h.upperBounds and can make buckets
// for both counts as well as exemplars:
h.counts[0].buckets = make([]uint64, len(h.upperBounds))
h.counts[1].buckets = make([]uint64, len(h.upperBounds))
h.exemplars = make([]atomic.Value, len(h.upperBounds)+1)
h.init(h) // Init self-collection.
return h
}
type histogramCounts struct {
// sumBits contains the bits of the float64 representing the sum of all
// observations. sumBits and count have to go first in the struct to
// guarantee alignment for atomic operations.
// path_to_url#pkg-note-BUG
sumBits uint64
count uint64
buckets []uint64
}
type histogram struct {
// countAndHotIdx enables lock-free writes with use of atomic updates.
// The most significant bit is the hot index [0 or 1] of the count field
// below. Observe calls update the hot one. All remaining bits count the
// number of Observe calls. Observe starts by incrementing this counter,
// and finish by incrementing the count field in the respective
// histogramCounts, as a marker for completion.
//
// Calls of the Write method (which are non-mutating reads from the
// perspective of the histogram) swap the hotcold under the writeMtx
// lock. A cooldown is awaited (while locked) by comparing the number of
// observations with the initiation count. Once they match, then the
// last observation on the now cool one has completed. All cool fields must
// be merged into the new hot before releasing writeMtx.
//
// Fields with atomic access first! See alignment constraint:
// path_to_url#pkg-note-BUG
countAndHotIdx uint64
selfCollector
desc *Desc
writeMtx sync.Mutex // Only used in the Write method.
// Two counts, one is "hot" for lock-free observations, the other is
// "cold" for writing out a dto.Metric. It has to be an array of
// pointers to guarantee 64bit alignment of the histogramCounts, see
// path_to_url#pkg-note-BUG.
counts [2]*histogramCounts
upperBounds []float64
labelPairs []*dto.LabelPair
exemplars []atomic.Value // One more than buckets (to include +Inf), each a *dto.Exemplar.
now func() time.Time // To mock out time.Now() for testing.
}
func (h *histogram) Desc() *Desc {
return h.desc
}
func (h *histogram) Observe(v float64) {
h.observe(v, h.findBucket(v))
}
func (h *histogram) ObserveWithExemplar(v float64, e Labels) {
i := h.findBucket(v)
h.observe(v, i)
h.updateExemplar(v, i, e)
}
func (h *histogram) Write(out *dto.Metric) error {
// For simplicity, we protect this whole method by a mutex. It is not in
// the hot path, i.e. Observe is called much more often than Write. The
// complication of making Write lock-free isn't worth it, if possible at
// all.
h.writeMtx.Lock()
defer h.writeMtx.Unlock()
// Adding 1<<63 switches the hot index (from 0 to 1 or from 1 to 0)
// without touching the count bits. See the struct comments for a full
// description of the algorithm.
n := atomic.AddUint64(&h.countAndHotIdx, 1<<63)
// count is contained unchanged in the lower 63 bits.
count := n & ((1 << 63) - 1)
// The most significant bit tells us which counts is hot. The complement
// is thus the cold one.
hotCounts := h.counts[n>>63]
coldCounts := h.counts[(^n)>>63]
// Await cooldown.
for count != atomic.LoadUint64(&coldCounts.count) {
runtime.Gosched() // Let observations get work done.
}
his := &dto.Histogram{
Bucket: make([]*dto.Bucket, len(h.upperBounds)),
SampleCount: proto.Uint64(count),
SampleSum: proto.Float64(math.Float64frombits(atomic.LoadUint64(&coldCounts.sumBits))),
}
var cumCount uint64
for i, upperBound := range h.upperBounds {
cumCount += atomic.LoadUint64(&coldCounts.buckets[i])
his.Bucket[i] = &dto.Bucket{
CumulativeCount: proto.Uint64(cumCount),
UpperBound: proto.Float64(upperBound),
}
if e := h.exemplars[i].Load(); e != nil {
his.Bucket[i].Exemplar = e.(*dto.Exemplar)
}
}
// If there is an exemplar for the +Inf bucket, we have to add that bucket explicitly.
if e := h.exemplars[len(h.upperBounds)].Load(); e != nil {
b := &dto.Bucket{
CumulativeCount: proto.Uint64(count),
UpperBound: proto.Float64(math.Inf(1)),
Exemplar: e.(*dto.Exemplar),
}
his.Bucket = append(his.Bucket, b)
}
out.Histogram = his
out.Label = h.labelPairs
// Finally add all the cold counts to the new hot counts and reset the cold counts.
atomic.AddUint64(&hotCounts.count, count)
atomic.StoreUint64(&coldCounts.count, 0)
for {
oldBits := atomic.LoadUint64(&hotCounts.sumBits)
newBits := math.Float64bits(math.Float64frombits(oldBits) + his.GetSampleSum())
if atomic.CompareAndSwapUint64(&hotCounts.sumBits, oldBits, newBits) {
atomic.StoreUint64(&coldCounts.sumBits, 0)
break
}
}
for i := range h.upperBounds {
atomic.AddUint64(&hotCounts.buckets[i], atomic.LoadUint64(&coldCounts.buckets[i]))
atomic.StoreUint64(&coldCounts.buckets[i], 0)
}
return nil
}
// findBucket returns the index of the bucket for the provided value, or
// len(h.upperBounds) for the +Inf bucket.
func (h *histogram) findBucket(v float64) int {
// TODO(beorn7): For small numbers of buckets (<30), a linear search is
// slightly faster than the binary search. If we really care, we could
// switch from one search strategy to the other depending on the number
// of buckets.
//
// Microbenchmarks (BenchmarkHistogramNoLabels):
// 11 buckets: 38.3 ns/op linear - binary 48.7 ns/op
// 100 buckets: 78.1 ns/op linear - binary 54.9 ns/op
// 300 buckets: 154 ns/op linear - binary 61.6 ns/op
return sort.SearchFloat64s(h.upperBounds, v)
}
// observe is the implementation for Observe without the findBucket part.
func (h *histogram) observe(v float64, bucket int) {
// We increment h.countAndHotIdx so that the counter in the lower
// 63 bits gets incremented. At the same time, we get the new value
// back, which we can use to find the currently-hot counts.
n := atomic.AddUint64(&h.countAndHotIdx, 1)
hotCounts := h.counts[n>>63]
if bucket < len(h.upperBounds) {
atomic.AddUint64(&hotCounts.buckets[bucket], 1)
}
for {
oldBits := atomic.LoadUint64(&hotCounts.sumBits)
newBits := math.Float64bits(math.Float64frombits(oldBits) + v)
if atomic.CompareAndSwapUint64(&hotCounts.sumBits, oldBits, newBits) {
break
}
}
// Increment count last as we take it as a signal that the observation
// is complete.
atomic.AddUint64(&hotCounts.count, 1)
}
// updateExemplar replaces the exemplar for the provided bucket. With empty
// labels, it's a no-op. It panics if any of the labels is invalid.
func (h *histogram) updateExemplar(v float64, bucket int, l Labels) {
if l == nil {
return
}
e, err := newExemplar(v, h.now(), l)
if err != nil {
panic(err)
}
h.exemplars[bucket].Store(e)
}
// HistogramVec is a Collector that bundles a set of Histograms that all share the
// same Desc, but have different values for their variable labels. This is used
// if you want to count the same thing partitioned by various dimensions
// (e.g. HTTP request latencies, partitioned by status code and method). Create
// instances with NewHistogramVec.
type HistogramVec struct {
*metricVec
}
// NewHistogramVec creates a new HistogramVec based on the provided HistogramOpts and
// partitioned by the given label names.
func NewHistogramVec(opts HistogramOpts, labelNames []string) *HistogramVec {
desc := NewDesc(
BuildFQName(opts.Namespace, opts.Subsystem, opts.Name),
opts.Help,
labelNames,
opts.ConstLabels,
)
return &HistogramVec{
metricVec: newMetricVec(desc, func(lvs ...string) Metric {
return newHistogram(desc, opts, lvs...)
}),
}
}
// GetMetricWithLabelValues returns the Histogram for the given slice of label
// values (same order as the VariableLabels in Desc). If that combination of
// label values is accessed for the first time, a new Histogram is created.
//
// It is possible to call this method without using the returned Histogram to only
// create the new Histogram but leave it at its starting value, a Histogram without
// any observations.
//
// Keeping the Histogram for later use is possible (and should be considered if
// performance is critical), but keep in mind that Reset, DeleteLabelValues and
// Delete can be used to delete the Histogram from the HistogramVec. In that case, the
// Histogram will still exist, but it will not be exported anymore, even if a
// Histogram with the same label values is created later. See also the CounterVec
// example.
//
// An error is returned if the number of label values is not the same as the
// number of VariableLabels in Desc (minus any curried labels).
//
// Note that for more than one label value, this method is prone to mistakes
// caused by an incorrect order of arguments. Consider GetMetricWith(Labels) as
// an alternative to avoid that type of mistake. For higher label numbers, the
// latter has a much more readable (albeit more verbose) syntax, but it comes
// with a performance overhead (for creating and processing the Labels map).
// See also the GaugeVec example.
func (v *HistogramVec) GetMetricWithLabelValues(lvs ...string) (Observer, error) {
metric, err := v.metricVec.getMetricWithLabelValues(lvs...)
if metric != nil {
return metric.(Observer), err
}
return nil, err
}
// GetMetricWith returns the Histogram for the given Labels map (the label names
// must match those of the VariableLabels in Desc). If that label map is
// accessed for the first time, a new Histogram is created. Implications of
// creating a Histogram without using it and keeping the Histogram for later use
// are the same as for GetMetricWithLabelValues.
//
// An error is returned if the number and names of the Labels are inconsistent
// with those of the VariableLabels in Desc (minus any curried labels).
//
// This method is used for the same purpose as
// GetMetricWithLabelValues(...string). See there for pros and cons of the two
// methods.
func (v *HistogramVec) GetMetricWith(labels Labels) (Observer, error) {
metric, err := v.metricVec.getMetricWith(labels)
if metric != nil {
return metric.(Observer), err
}
return nil, err
}
// WithLabelValues works as GetMetricWithLabelValues, but panics where
// GetMetricWithLabelValues would have returned an error. Not returning an
// error allows shortcuts like
// myVec.WithLabelValues("404", "GET").Observe(42.21)
func (v *HistogramVec) WithLabelValues(lvs ...string) Observer {
h, err := v.GetMetricWithLabelValues(lvs...)
if err != nil {
panic(err)
}
return h
}
// With works as GetMetricWith but panics where GetMetricWithLabels would have
// returned an error. Not returning an error allows shortcuts like
// myVec.With(prometheus.Labels{"code": "404", "method": "GET"}).Observe(42.21)
func (v *HistogramVec) With(labels Labels) Observer {
h, err := v.GetMetricWith(labels)
if err != nil {
panic(err)
}
return h
}
// CurryWith returns a vector curried with the provided labels, i.e. the
// returned vector has those labels pre-set for all labeled operations performed
// on it. The cardinality of the curried vector is reduced accordingly. The
// order of the remaining labels stays the same (just with the curried labels
// taken out of the sequence which is relevant for the
// (GetMetric)WithLabelValues methods). It is possible to curry a curried
// vector, but only with labels not yet used for currying before.
//
// The metrics contained in the HistogramVec are shared between the curried and
// uncurried vectors. They are just accessed differently. Curried and uncurried
// vectors behave identically in terms of collection. Only one must be
// registered with a given registry (usually the uncurried version). The Reset
// method deletes all metrics, even if called on a curried vector.
func (v *HistogramVec) CurryWith(labels Labels) (ObserverVec, error) {
vec, err := v.curryWith(labels)
if vec != nil {
return &HistogramVec{vec}, err
}
return nil, err
}
// MustCurryWith works as CurryWith but panics where CurryWith would have
// returned an error.
func (v *HistogramVec) MustCurryWith(labels Labels) ObserverVec {
vec, err := v.CurryWith(labels)
if err != nil {
panic(err)
}
return vec
}
type constHistogram struct {
desc *Desc
count uint64
sum float64
buckets map[float64]uint64
labelPairs []*dto.LabelPair
}
func (h *constHistogram) Desc() *Desc {
return h.desc
}
func (h *constHistogram) Write(out *dto.Metric) error {
his := &dto.Histogram{}
buckets := make([]*dto.Bucket, 0, len(h.buckets))
his.SampleCount = proto.Uint64(h.count)
his.SampleSum = proto.Float64(h.sum)
for upperBound, count := range h.buckets {
buckets = append(buckets, &dto.Bucket{
CumulativeCount: proto.Uint64(count),
UpperBound: proto.Float64(upperBound),
})
}
if len(buckets) > 0 {
sort.Sort(buckSort(buckets))
}
his.Bucket = buckets
out.Histogram = his
out.Label = h.labelPairs
return nil
}
// NewConstHistogram returns a metric representing a Prometheus histogram with
// fixed values for the count, sum, and bucket counts. As those parameters
// cannot be changed, the returned value does not implement the Histogram
// interface (but only the Metric interface). Users of this package will not
// have much use for it in regular operations. However, when implementing custom
// Collectors, it is useful as a throw-away metric that is generated on the fly
// to send it to Prometheus in the Collect method.
//
// buckets is a map of upper bounds to cumulative counts, excluding the +Inf
// bucket.
//
// NewConstHistogram returns an error if the length of labelValues is not
// consistent with the variable labels in Desc or if Desc is invalid.
func NewConstHistogram(
desc *Desc,
count uint64,
sum float64,
buckets map[float64]uint64,
labelValues ...string,
) (Metric, error) {
if desc.err != nil {
return nil, desc.err
}
if err := validateLabelValues(labelValues, len(desc.variableLabels)); err != nil {
return nil, err
}
return &constHistogram{
desc: desc,
count: count,
sum: sum,
buckets: buckets,
labelPairs: makeLabelPairs(desc, labelValues),
}, nil
}
// MustNewConstHistogram is a version of NewConstHistogram that panics where
// NewConstHistogram would have returned an error.
func MustNewConstHistogram(
desc *Desc,
count uint64,
sum float64,
buckets map[float64]uint64,
labelValues ...string,
) Metric {
m, err := NewConstHistogram(desc, count, sum, buckets, labelValues...)
if err != nil {
panic(err)
}
return m
}
type buckSort []*dto.Bucket
func (s buckSort) Len() int {
return len(s)
}
func (s buckSort) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
func (s buckSort) Less(i, j int) bool {
return s[i].GetUpperBound() < s[j].GetUpperBound()
}
```
|
```yaml
---
it:
simple_form:
hints:
account:
discoverable: I tuoi post pubblici e il tuo profilo potrebbero essere presenti o consigliati in varie aree di Mastodon e il tuo profilo potrebbe essere suggerito ad altri utenti.
display_name: Il tuo nome completo o il tuo soprannome.
fields: La tua homepage, i pronomi, l'et, tutto quello che vuoi.
indexable: I tuoi post pubblici potrebbero apparire nei risultati di ricerca su Mastodon. Le persone che hanno interagito con i tuoi post potrebbero essere in grado di cercarli anche se non hai attivato questa impostazione.
note: 'Puoi @menzionare altre persone o usare gli #hashtags.'
show_collections: Le persone saranno in grado di navigare attraverso i tuoi seguaci e seguaci. Le persone che segui vedranno che li seguirai indipendentemente dalle tue impostazioni.
unlocked: Le persone saranno in grado di seguirti senza richiedere l'approvazione. Deseleziona se vuoi controllare le richieste di seguirti e scegli se accettare o rifiutare nuovi follower.
account_alias:
acct: Indica il nomeutente@dominio dell'account dal quale vuoi trasferirti
account_migration:
acct: Indica il nomeutente@dominio dell'account al quale vuoi trasferirti
account_warning_preset:
text: Puoi usare la sintassi dei post, come URL, hashtag e menzioni
title: Opzionale. Non visibile al destinatario
admin_account_action:
include_statuses: L'utente vedr quali post hanno causato l'azione di moderazione o l'avviso
send_email_notification: L'utente ricever una spiegazione di ci che successo con suo account
text_html: Opzionale. Puoi usare la sintassi dei post. Puoi <a href="%{path}">aggiungere avvisi preimpostati</a> per risparmiare tempo
type_html: Decidi cosa fare con <strong>%{acct}</strong>
types:
disable: Impedisce all'utente di utilizzare il suo account, ma non elimina o nasconde i suoi contenuti.
none: Usa questo per inviare un avviso all'utente, senza eseguire altre azioni.
sensitive: Forza tutti gli allegati multimediali di questo utente ad essere contrassegnati come sensibili.
silence: Impedisce all'utente di poter pubblicare con visibilit pubblica, nasconde i suoi post e notifiche a persone che non lo seguono. Chiude tutte le segnalazioni relative a questo account.
suspend: Impedisce qualsiasi interazione da o verso questo account e cancellarne il contenuto. Annullabile entro 30 giorni. Chiude tutte le segnalazioni contro questo account.
warning_preset_id: Opzionale. Puoi aggiungere un testo personalizzato alla fine di quello preimpostato
announcement:
all_day: Se selezionato, verranno visualizzate solo le date dell'intervallo di tempo
ends_at: Opzionale. L'annuncio verr automaticamente ritirato in questo momento
scheduled_at: Lascia vuoto per pubblicare immediatamente l'annuncio
starts_at: Opzionale. Quando l'annuncio legato a un intervallo di tempo specifico
text: Puoi usare la sintassi dei post. Tieni presente lo spazio che l'annuncio occuper nello schermo dell'utente
appeal:
text: Puoi appellarti solo una volta
defaults:
autofollow: Le persone che si iscrivono attraverso l'invito ti seguiranno automaticamente
avatar: WEBP, PNG, GIF o JPG. Al massimo %{size}. Verranno scalate a %{dimensions}px
bot: Questo account esegue principalmente operazioni automatiche e potrebbe non essere tenuto sotto controllo da una persona
context: Uno o pi contesti nei quali il filtro dovrebbe essere applicato
current_password: Per motivi di sicurezza inserisci la password dell'account attuale
current_username: Per confermare, inserisci il nome utente dell'account attuale
digest: Inviata solo dopo un lungo periodo di inattivit e solo se hai ricevuto qualche messaggio personale in tua assenza
email: Ti manderemo una email di conferma
header: WEBP, PNG, GIF o JPG. Al massimo %{size}. Verranno scalate a %{dimensions}px
inbox_url: Copia la URL dalla pagina iniziale del ripetitore che vuoi usare
irreversible: I post filtrati scompariranno in modo irreversibile, anche se il filtro viene eliminato
locale: La lingua dell'interfaccia utente, di email e notifiche push
password: Usa almeno 8 caratteri
phrase: Il confronto sar eseguito ignorando minuscole/maiuscole e i content warning
scopes: A quali API l'applicazione potr avere accesso. Se selezionate un ambito di alto livello, non c' bisogno di selezionare quelle singole.
setting_aggregate_reblogs: Non mostrare nuove condivisioni per toot che sono stati condivisi di recente (ha effetto solo sulle nuove condivisioni)
setting_always_send_emails: Normalmente le notifiche e-mail non vengono inviate quando si utilizza attivamente Mastodon
setting_default_sensitive: Media con contenuti sensibili sono nascosti in modo predefinito e possono essere rivelati con un click
setting_display_media_default: Nascondi media segnati come sensibili
setting_display_media_hide_all: Nascondi sempre tutti i media
setting_display_media_show_all: Mostra sempre i media segnati come sensibili
setting_use_blurhash: I gradienti sono basati sui colori delle immagini nascoste ma offuscano tutti i dettagli
setting_use_pending_items: Fare clic per mostrare i nuovi messaggi invece di aggiornare la timeline automaticamente
username: Puoi usare lettere, numeri e caratteri di sottolineatura
whole_word: Quando la parola chiave o la frase solo alfanumerica, si applica solo se corrisponde alla parola intera
domain_allow:
domain: Questo dominio potr recuperare i dati da questo server e i dati in arrivo da esso verranno elaborati e memorizzati
email_domain_block:
domain: Questo pu essere il nome di dominio che appare nell'indirizzo e-mail o nel record MX che utilizza. Verranno controllati al momento dell'iscrizione.
with_dns_records: Sar effettuato un tentativo di risolvere i record DNS del dominio in questione e i risultati saranno inseriti anche nella blacklist
featured_tag:
name: 'Ecco alcuni degli hashtag che hai usato di pi recentemente:'
filters:
action: Scegli quale azione eseguire quando un post corrisponde al filtro
actions:
hide: Nascondi completamente il contenuto filtrato, come se non esistesse
warn: Nascondi il contenuto filtrato e mostra invece un avviso, citando il titolo del filtro
form_admin_settings:
activity_api_enabled: Conteggi di post pubblicati localmente, utenti attivi e nuove registrazioni in gruppi settimanali
app_icon: WEBP, PNG, GIF o JPG. Sostituisce l'icona dell'app predefinita sui dispositivi mobili con un'icona personalizzata.
backups_retention_period: Gli utenti hanno la possibilit di generare archivi dei propri post da scaricare successivamente. Se impostati su un valore positivo, questi archivi verranno automaticamente eliminati dallo spazio di archiviazione dopo il numero di giorni specificato.
bootstrap_timeline_accounts: Questi account verranno aggiunti in cima ai consigli da seguire dei nuovi utenti.
closed_registrations_message: Visualizzato alla chiusura delle iscrizioni
content_cache_retention_period: Tutti i post da altri server (inclusi booster e risposte) verranno eliminati dopo il numero specificato di giorni, senza tener conto di eventuali interazioni con gli utenti locali con tali post. Questo include i post in cui un utente locale ha contrassegnato come segnalibri o preferiti. Anche le menzioni private tra utenti di diverse istanze andranno perse e impossibile da ripristinare. L'uso di questa impostazione inteso per casi di scopo speciale e rompe molte aspettative dell'utente quando implementato per uso generale.
custom_css: possibile applicare stili personalizzati sulla versione web di Mastodon.
favicon: WEBP, PNG, GIF o JPG. Sostituisce la favicon predefinita di Mastodon con un'icona personalizzata.
mascot: Sostituisce l'illustrazione nell'interfaccia web avanzata.
media_cache_retention_period: I file multimediali da post fatti da utenti remoti sono memorizzati nella cache sul tuo server. Quando impostato a un valore positivo, i media verranno eliminati dopo il numero specificato di giorni. Se i dati multimediali sono richiesti dopo che sono stati eliminati, saranno nuovamente scaricati, se il contenuto sorgente ancora disponibile. A causa di restrizioni su quanto spesso link anteprima carte sondaggio siti di terze parti, si consiglia di impostare questo valore ad almeno 14 giorni, o le schede di anteprima link non saranno aggiornate su richiesta prima di quel tempo.
peers_api_enabled: Un elenco di nomi di dominio che questo server ha incontrato nel fediverse. Qui non sono inclusi dati sul fatto se si federano con un dato server, solo che il server ne a conoscenza. Questo viene utilizzato dai servizi che raccolgono statistiche sulla federazione in senso generale.
profile_directory: La directory del profilo elenca tutti gli utenti che hanno acconsentito ad essere individuabili.
require_invite_text: 'Quando le iscrizioni richiedono l''approvazione manuale, rendi la domanda: "Perch vuoi unirti?" obbligatoria anzich facoltativa'
site_contact_email: In che modo le persone possono contattarti per richieste legali o di supporto.
site_contact_username: In che modo le persone possono raggiungerti su Mastodon.
site_extended_description: Qualsiasi informazione aggiuntiva che possa essere utile ai visitatori e ai tuoi utenti. Pu essere strutturata con la sintassi Markdown.
site_short_description: Una breve descrizione per aiutare a identificare in modo univoco il tuo server. Chi lo gestisce, a chi rivolto?
site_terms: Usa la tua politica sulla privacy o lascia vuoto per usare l'impostazione predefinita. Pu essere strutturata con la sintassi Markdown.
site_title: In che modo le persone possono fare riferimento al tuo server oltre al suo nome di dominio.
status_page_url: URL di una pagina in cui le persone possono visualizzare lo stato di questo server durante un disservizio
theme: Tema visualizzato dai visitatori e dai nuovi utenti disconnessi.
thumbnail: Un'immagine approssimativamente 2:1 visualizzata insieme alle informazioni del tuo server.
timeline_preview: I visitatori disconnessi potranno sfogliare i post pubblici pi recenti disponibili sul server.
trendable_by_default: Salta la revisione manuale dei contenuti di tendenza. I singoli elementi possono ancora essere rimossi dalle tendenze dopo il fatto.
trends: Le tendenze mostrano quali post, hashtag e notizie stanno guadagnando popolarit sul tuo server.
trends_as_landing_page: Mostra i contenuti di tendenza agli utenti disconnessi e ai visitatori, invece di una descrizione di questo server. Richiede l'abilitazione delle tendenze.
form_challenge:
current_password: Stai entrando in un'area sicura
imports:
data: File CSV esportato da un altro server Mastodon
invite_request:
text: Questo ci aiuter ad esaminare la tua richiesta
ip_block:
comment: Opzionale. Ricorda perch hai aggiunto questa regola.
expires_in: Gli indirizzi IP sono una risorsa finita, a volte sono condivisi e spesso cambiano possessore. Per questo motivo, i blocchi IP indefiniti non sono consigliati.
ip: Inserisci un indirizzo IPv4 o IPv6. Puoi bloccare interi intervalli usando la sintassi CIDR. Fai attenzione a non bloccare te stesso!
severities:
no_access: Blocca l'accesso a tutte le risorse
sign_up_block: Le nuove iscrizioni non saranno possibili
sign_up_requires_approval: Le nuove iscrizioni richiederanno la tua approvazione
severity: Scegli cosa accadr con le richieste da questo IP
rule:
hint: Opzionale. Fornisce maggiori dettagli sulla regola
text: Descrivi una regola o un requisito per gli utenti su questo server. Prova a mantenerla breve e semplice
sessions:
otp: 'Inserisci il codice a due fattori generato dall''app del tuo telefono o usa uno dei codici di recupero:'
webauthn: Se si tratta di una chiavetta USB assicurati di inserirla e, se necessario, toccarla.
settings:
indexable: La pagina del tuo profilo potrebbe apparire nei risultati di ricerca su Google, Bing e altri.
show_application: Tu sarai sempre in grado di vedere quale app ha pubblicato il tuo post anche se hai attivato questa impostazione.
tag:
name: Puoi cambiare solo il minuscolo/maiuscolo delle lettere, ad esempio, per renderlo pi leggibile
user:
chosen_languages: Quando una o pi lingue sono contrassegnate, nelle timeline pubbliche vengono mostrati solo i toot nelle lingue selezionate
role: Il ruolo controlla quali permessi ha l'utente
user_role:
color: Colore da usare per il ruolo in tutta l'UI, come RGB in formato esadecimale
highlighted: Rende il ruolo visibile
name: Nome pubblico del ruolo, se il ruolo impostato per essere visualizzato come distintivo
permissions_as_keys: Gli utenti con questo ruolo avranno accesso a...
position: Un ruolo pi alto decide la risoluzione dei conflitti in determinate situazioni. Alcune azioni possono essere eseguite solo su ruoli con priorit pi bassa
webhook:
events: Seleziona eventi da inviare
template: Componi il tuo carico utile JSON utilizzando l'interpolazione variabile. Lascia vuoto per il JSON predefinito.
url: Dove gli eventi saranno inviati
labels:
account:
discoverable: Include il profilo e i post negli algoritmi di scoperta
fields:
name: Etichetta
value: Contenuto
indexable: Includi i post pubblici nei risultati di ricerca
show_collections: Mostra chi segui e chi ti segue sul profilo
unlocked: Accetta automaticamente nuovi follower
account_alias:
acct: Handle del vecchio account
account_migration:
acct: Handle del nuovo account
account_warning_preset:
text: Testo preimpostato
title: Titolo
admin_account_action:
include_statuses: Includi i toots segnalati nell'email
send_email_notification: Informa l'utente via email
text: Avviso personalizzato
type: Azione
types:
disable: Disabilita
none: Non fare nulla
sensitive: Sensibile
silence: Silenzia
suspend: Sospendi e cancella i dati dell'account in modo irreversibile
warning_preset_id: Usa un avviso preimpostato
announcement:
all_day: Tutto il giorno
ends_at: Fine dell'evento
scheduled_at: Programma la pubblicazione
starts_at: Inizio dell'evento
text: Annuncio
appeal:
text: Spiega perch la decisione dovrebbe essere annullata
defaults:
autofollow: Invita a seguire il tuo account
avatar: Immagine di profilo
bot: Questo account un bot
chosen_languages: Filtra lingue
confirm_new_password: Conferma nuova password
confirm_password: Conferma password
context: Contesti del filtro
current_password: Password corrente
data: Dati
display_name: Nome visualizzato
email: Indirizzo email
expires_in: Scade dopo
fields: Metadati del profilo
header: Intestazione
honeypot: "%{label} (non compilare)"
inbox_url: URL della inbox del ripetitore
irreversible: Elimina invece di nascondere
locale: Lingua dell'interfaccia
max_uses: Numero massimo di utilizzi
new_password: Nuova password
note: Biografia
otp_attempt: Codice due-fattori
password: Password
phrase: Parola chiave o frase
setting_advanced_layout: Abilita interfaccia web avanzata
setting_aggregate_reblogs: Raggruppa condivisioni in timeline
setting_always_send_emails: Manda sempre notifiche via email
setting_auto_play_gif: Riproduci automaticamente le GIF animate
setting_boost_modal: Mostra dialogo di conferma prima del boost
setting_default_language: Lingua dei post
setting_default_privacy: Privacy dei post
setting_default_sensitive: Segna sempre i media come sensibili
setting_delete_modal: Mostra dialogo di conferma prima di eliminare un post
setting_disable_hover_cards: Disabilita l'anteprima del profilo al passaggio del mouse
setting_disable_swiping: Disabilita i movimenti di scorrimento
setting_display_media: Visualizzazione dei media
setting_display_media_default: Predefinita
setting_display_media_hide_all: Nascondi tutti
setting_display_media_show_all: Mostra tutti
setting_expand_spoilers: Espandi sempre post con content warning
setting_hide_network: Nascondi la tua rete
setting_reduce_motion: Riduci movimento nelle animazioni
setting_system_font_ui: Usa il carattere predefinito del sistema
setting_theme: Tema del sito
setting_trends: Mostra tendenze di oggi
setting_unfollow_modal: Chiedi conferma prima di smettere di seguire qualcuno
setting_use_blurhash: Mostra i gradienti colorati per i media nascosti
setting_use_pending_items: Modalit lenta
severity: Severit
sign_in_token_attempt: Codice di sicurezza
title: Titolo
type: Tipo importazione
username: Nome utente
username_or_email: Nome utente o email
whole_word: Parola intera
email_domain_block:
with_dns_records: Includi record MX e indirizzi IP del dominio
featured_tag:
name: Etichetta
filters:
actions:
hide: Nascondi completamente
warn: Nascondi con avviso
form_admin_settings:
activity_api_enabled: Pubblica le statistiche aggregate sull'attivit degli utenti nell'API
app_icon: Icona app
backups_retention_period: Periodo di conservazione dell'archivio utente
bootstrap_timeline_accounts: Consiglia sempre questi account ai nuovi utenti
closed_registrations_message: Messaggio personalizzato quando le iscrizioni non sono disponibili
content_cache_retention_period: Periodo di ritenzione del contenuto remoto
custom_css: Personalizza CSS
favicon: Favicon
mascot: Personalizza mascotte (legacy)
media_cache_retention_period: Periodo di conservazione della cache multimediale
peers_api_enabled: Pubblica l'elenco dei server scoperti nell'API
profile_directory: Abilita directory del profilo
registrations_mode: Chi pu iscriversi
require_invite_text: Richiedi un motivo per unirsi
show_domain_blocks: Mostra i blocchi di dominio
show_domain_blocks_rationale: Mostra perch i domini sono stati bloccati
site_contact_email: Contatto email
site_contact_username: Nome utente di contatto
site_extended_description: Descrizione estesa
site_short_description: Descrizione del server
site_terms: Politica sulla privacy
site_title: Nome del server
status_page_url: URL della pagina di stato
theme: Tema predefinito
thumbnail: Miniatura del server
timeline_preview: Consenti l'accesso non autenticato alle timeline pubbliche
trendable_by_default: Consenti le tendenze senza revisione preventiva
trends: Abilita le tendenze
trends_as_landing_page: Usa le tendenze come pagina di destinazione
interactions:
must_be_follower: Blocca notifiche da chi non ti segue
must_be_following: Blocca notifiche dalle persone che non segui
must_be_following_dm: Blocca i messaggi diretti dalle persone che non segui
invite:
comment: Commento
invite_request:
text: Perch vuoi iscriverti?
ip_block:
comment: Commento
ip: IP
severities:
no_access: Blocca accesso
sign_up_block: Blocca iscrizioni
sign_up_requires_approval: Limita iscrizioni
severity: Regola
notification_emails:
appeal: Qualcuno ricorre contro una decisione del moderatore
digest: Invia email riassuntive
favourite: Qualcuno ha apprezzato il tuo post
follow: Invia email quando qualcuno ti segue
follow_request: Invia email quando qualcuno chiede di seguirti
mention: Invia email quando qualcuno ti menziona
pending_account: Invia e-mail quando un nuovo account richiede l'approvazione
reblog: Qualcuno ha condiviso il tuo post
report: Una nuova segnalazione stata inviata
software_updates:
all: Notifica su tutti gli aggiornamenti
critical: Notifica soltanto sugli aggiornamenti critici
label: Una nuova versione di Mastodon disponibile
none: Non notificare mai sugli aggiornamenti (sconsigliato)
patch: Notifica sulle correzioni di bug
trending_tag: La nuova tendenza richiede un controllo
rule:
hint: Informazioni aggiuntive
text: Regola
settings:
indexable: Includi la pagina del profilo nei motori di ricerca
show_application: Mostra da quale app hai inviato un post
tag:
listable: Permetti a questo hashtag di apparire nella directory dei profili
name: Hashtag
trendable: Permetti a questo hashtag di apparire nelle tendenze
usable: Permetti ai post di utilizzare questo hashtag localmente
user:
role: Ruolo
time_zone: Fuso orario
user_role:
color: Colore distintivo
highlighted: Mostra il ruolo come distintivo sui profili utente
name: Nome
permissions_as_keys: Permessi
position: Priorit
webhook:
events: Eventi abilitati
template: Modello di carico utile
url: URL endpoint
'no': 'No'
not_recommended: Non consigliato
overridden: Sostituito
recommended: Consigliato
required:
mark: "*"
text: richiesto
title:
sessions:
webauthn: Usa una delle tue chiavi di sicurezza per accedere
'yes': Si
```
|
John Piña Craven (October 30, 1924 – February 12, 2015) was an American scientist who was known for his involvement with Bayesian search theory and the recovery of lost objects at sea. He was Chief Scientist of the Special Projects Office of the United States Navy.
Biography
John Piña Craven was born in Brooklyn, New York, in 1924. He held a Bachelor of Arts degree from Cornell University, a Master of Science degree from the California Institute of Technology, a Ph.D. from the University of Iowa, and a law degree from the National Law Center of the George Washington University.
He met his wife, Dorothy Drakesmith, while attending the University of Iowa.
Craven had 40 years of experience in the innovation, development, design, construction, and operational deployment of major oceanic systems. As a boy, John Piña Craven studied ocean technology at the Brooklyn Technical High School, and he became familiar with the ocean on the beaches of Long Island and the waterfront of New York City.
During World War II, Craven served as an enlisted man on the . In 1944, Craven was selected for the navy's V-12 program for officer trainees. From this, he earned his commission as an ensign in the navy. After earning his Ph.D., Craven worked at the David Taylor Model Basin of the Naval Surface Warfare Center at Carderock, Maryland, working on nuclear submarine hull designs. He received two civilian service awards in connection with these developments. He was later appointed as the project manager for the navy's Polaris submarine program and the navy's Special Projects Office. He later became its chief scientist. Craven was awarded two Distinguished Civilian Service Awards (the Department of Defense's highest honor for civilians) among other commendations.
While working for the navy, Craven helped pioneer the use of Bayesian search techniques to locate objects lost at sea (Bayesian search theory). Craven's work was instrumental in the navy's search for the missing hydrogen bomb that had been lost in the Mediterranean Sea, off the coast of Spain in 1966. Craven's next large accomplishment was in the search for and locating of the submarine , which had disappeared in deep water in the Atlantic Ocean west of Portugal and Spain.
As chief scientist of the Special Projects Office, Craven was in charge of the Deep Submergence Systems Project, which included the SEALAB program. In February 1969, when aquanaut Berry L. Cannon died while attempting to repair a leak in SEALAB III, Craven headed an advisory group that determined the best method of salvaging the SEALAB habitat.
After leaving the navy, Craven became the marine affairs coordinator for the State of Hawaii and also the dean of marine programs at the University of Hawaii. During his time in Hawaii, it has been alleged that Craven was involved in the development and operation of the secretive salvage ship Glomar Explorer, built to follow up on the discovery of a sunken Soviet submarine, the K-129, by other of Craven's projects, the nuclear-powered spy submarine Halibut.
Craven also served on the U.S. government's Weather Modification Commission during the Carter Administration. During that time, a hypothetical method was developed to significantly reduce the impact of tropical cyclones. In 1976, after losing in his campaign to become a member of the United States House of Representatives, Craven was appointed as the Director of the Law of the Sea Institute. In 2001, he was the president of the Common Heritage Corporation.
After earning his law degree through an evening program, Craven was responsible for directing the International Law of the Sea Institute. In 1990 he established the Common Heritage Corporation for innovation management to benefit the common heritage of mankind. Craven was a member of the National Academy of Engineering.
According to the magazine Wired, Craven's latest undertaking was to link islands in the Pacific Ocean with sustainable energy, agriculture, and freshwater through the use of Deep Ocean Water pumped up using pipes from offshore. He was developing a new and innovative cold water therapy, which may produce significant health breakthroughs and slow the aging process.
Craven wrote the book, The Silent War: The Cold War Battle Beneath the Sea.
John Piña Craven's daughter, Sarah Craven, is a prominent international advocate of women's rights.
John Piña Craven resided in Honolulu, Hawaii for many years. In 1994, he ran against long-term Honolulu mayor Frank Fasi for the nomination of the new Best Party for governor; Fasi won the nomination but came in second in the general election.
In 1998, he received the first Distinguished Civilian Service Award by the Naval Submarine League for his work on Scorpion, Polaris, and other projects.
Craven died in Honolulu on February 12, 2015, at the age of 90, from Parkinson's disease.
Notes
References
Sherry Sontag, Blind Man's Bluff: The Untold Story of American Submarine Espionage (New York: Public Affairs, 1998), . Craven is mentioned frequently in this nonfiction book on American submarine-based espionage.
Roger C. Dunham, Spy Sub - Top Secret Mission To The Bottom Of The Pacific (New York: Penguin Books, 1996),
Roy Varner and Wayne Collier, "A Matter of Risk: The Incredible Inside Story of the CIA's Hughes Glomar Explorer Mission to Raise a Russian Submarine", 1978
Further reading
All hands down by Kenneth Sewell and Jerome Preisler, Pocket Star, 2009.
External links
Wired: The Mad Genius from the Bottom of the Sea
Power and fresh water from the deep Ocean
Ocean engineer left mark on isle research, education
1924 births
2015 deaths
University of Iowa alumni
George Washington University Law School alumni
Cornell University alumni
United States Navy officers
People from Honolulu
Scientists from Brooklyn
California Institute of Technology alumni
Brooklyn Technical High School alumni
|
```xml
<?xml version="1.0" encoding="utf-8"?>
<Project ToolsVersion="4.0" xmlns="path_to_url">
<ItemGroup>
<ClInclude Include="..\..\test\access_v_test.cpp">
<Filter>qvm\test</Filter>
</ClInclude>
</ItemGroup>
<ItemGroup>
<Filter Include="qvm">
<UniqueIdentifier>{4F0D0A15-7DA4-54F2-1949-0CF051A43F7C}</UniqueIdentifier>
</Filter>
<Filter Include="qvm\test">
<UniqueIdentifier>{314E1C3A-02FE-5E09-4D15-34D67E967F3B}</UniqueIdentifier>
</Filter>
</ItemGroup>
</Project>
```
|
```go
// Code generated by private/model/cli/gen-api/main.go. DO NOT EDIT.
package internetmonitor
import (
"github.com/aws/aws-sdk-go/private/protocol"
)
const (
// ErrCodeAccessDeniedException for service response error code
// "AccessDeniedException".
//
// You don't have sufficient permission to perform this action.
ErrCodeAccessDeniedException = "AccessDeniedException"
// ErrCodeBadRequestException for service response error code
// "BadRequestException".
//
// A bad request was received.
ErrCodeBadRequestException = "BadRequestException"
// ErrCodeConflictException for service response error code
// "ConflictException".
//
// The requested resource is in use.
ErrCodeConflictException = "ConflictException"
// ErrCodeInternalServerErrorException for service response error code
// "InternalServerErrorException".
//
// There was an internal server error.
ErrCodeInternalServerErrorException = "InternalServerErrorException"
// ErrCodeInternalServerException for service response error code
// "InternalServerException".
//
// An internal error occurred.
ErrCodeInternalServerException = "InternalServerException"
// ErrCodeLimitExceededException for service response error code
// "LimitExceededException".
//
// The request exceeded a service quota.
ErrCodeLimitExceededException = "LimitExceededException"
// ErrCodeNotFoundException for service response error code
// "NotFoundException".
//
// The request specifies something that doesn't exist.
ErrCodeNotFoundException = "NotFoundException"
// ErrCodeResourceNotFoundException for service response error code
// "ResourceNotFoundException".
//
// The request specifies a resource that doesn't exist.
ErrCodeResourceNotFoundException = "ResourceNotFoundException"
// ErrCodeThrottlingException for service response error code
// "ThrottlingException".
//
// The request was denied due to request throttling.
ErrCodeThrottlingException = "ThrottlingException"
// ErrCodeTooManyRequestsException for service response error code
// "TooManyRequestsException".
//
// There were too many requests.
ErrCodeTooManyRequestsException = "TooManyRequestsException"
// ErrCodeValidationException for service response error code
// "ValidationException".
//
// Invalid request.
ErrCodeValidationException = "ValidationException"
)
var exceptionFromCode = map[string]func(protocol.ResponseMetadata) error{
"AccessDeniedException": newErrorAccessDeniedException,
"BadRequestException": newErrorBadRequestException,
"ConflictException": newErrorConflictException,
"InternalServerErrorException": newErrorInternalServerErrorException,
"InternalServerException": newErrorInternalServerException,
"LimitExceededException": newErrorLimitExceededException,
"NotFoundException": newErrorNotFoundException,
"ResourceNotFoundException": newErrorResourceNotFoundException,
"ThrottlingException": newErrorThrottlingException,
"TooManyRequestsException": newErrorTooManyRequestsException,
"ValidationException": newErrorValidationException,
}
```
|
```javascript
/*!
* Bootstrap-select v1.10.0 (path_to_url
*
*/
(function (root, factory) {
if (typeof define === 'function' && define.amd) {
// AMD. Register as an anonymous module unless amdModuleId is set
define(["jquery"], function (a0) {
return (factory(a0));
});
} else if (typeof exports === 'object') {
// Node. Does not work with strict CommonJS, but
// only CommonJS-like environments that support module.exports,
// like Node.
module.exports = factory(require("jquery"));
} else {
factory(jQuery);
}
}(this, function (jQuery) {
(function ($) {
$.fn.selectpicker.defaults = {
noneSelectedText: 'Vlasszon!',
noneResultsText: 'Nincs tallat {0}',
countSelectedText: function (numSelected, numTotal) {
return '{0} elem kivlasztva';
},
maxOptionsText: function (numAll, numGroup) {
return [
'Legfeljebb {n} elem vlaszthat',
'A csoportban legfeljebb {n} elem vlaszthat'
];
},
selectAllText: 'Mind',
deselectAllText: 'Egyik sem',
multipleSeparator: ', '
};
})(jQuery);
}));
```
|
```rust
#![allow(dead_code)] // some code is tested for type checking only
use super::*;
derive_display!(TestErr, T, E);
#[derive(Debug, Error)]
enum TestErr<E, T> {
Unit,
NamedImplicitNoSource {
field: T,
},
NamedImplicitSource {
source: E,
field: T,
},
NamedExplicitNoSource {
#[error(not(source))]
source: E,
field: T,
},
NamedExplicitSource {
#[error(source)]
explicit_source: E,
field: T,
},
NamedExplicitNoSourceRedundant {
#[error(not(source))]
field: T,
},
NamedExplicitSourceRedundant {
#[error(source)]
source: E,
field: T,
},
NamedExplicitSuppressesImplicit {
source: T,
#[error(source)]
field: E,
},
UnnamedImplicitNoSource(T, T),
UnnamedImplicitSource(E),
UnnamedExplicitNoSource(#[error(not(source))] E),
UnnamedExplicitSource(#[error(source)] E, T),
UnnamedExplicitNoSourceRedundant(#[error(not(source))] T, #[error(not(source))] T),
UnnamedExplicitSourceRedundant(#[error(source)] E),
NamedIgnore {
#[error(ignore)]
source: E,
field: T,
},
UnnamedIgnore(#[error(ignore)] E),
NamedIgnoreRedundant {
#[error(ignore)]
field: T,
},
UnnamedIgnoreRedundant(#[error(ignore)] T, #[error(ignore)] T),
#[error(ignore)]
NamedVariantIgnore {
source: E,
field: T,
},
#[error(ignore)]
UnnamedVariantIgnore(E),
#[error(ignore)]
NamedVariantIgnoreRedundant {
field: T,
},
#[error(ignore)]
UnnamedVariantIgnoreRedundant(T, T),
}
#[test]
fn unit() {
assert!(TestErr::<SimpleErr, i32>::Unit.source().is_none());
}
#[test]
fn named_implicit_no_source() {
let err = TestErr::<SimpleErr, _>::NamedImplicitNoSource { field: 0 };
assert!(err.source().is_none());
}
#[test]
fn named_implicit_source() {
let err = TestErr::NamedImplicitSource {
source: SimpleErr,
field: 0,
};
assert!(err.source().is_some());
assert!(err.source().unwrap().is::<SimpleErr>());
}
#[test]
fn named_explicit_no_source() {
let err = TestErr::NamedExplicitNoSource {
source: SimpleErr,
field: 0,
};
assert!(err.source().is_none());
}
#[test]
fn named_explicit_source() {
let err = TestErr::NamedExplicitSource {
explicit_source: SimpleErr,
field: 0,
};
assert!(err.source().is_some());
assert!(err.source().unwrap().is::<SimpleErr>());
}
#[test]
fn named_explicit_no_source_redundant() {
let err = TestErr::<SimpleErr, _>::NamedExplicitNoSourceRedundant { field: 0 };
assert!(err.source().is_none());
}
#[test]
fn named_explicit_source_redundant() {
let err = TestErr::NamedExplicitSourceRedundant {
source: SimpleErr,
field: 0,
};
assert!(err.source().is_some());
assert!(err.source().unwrap().is::<SimpleErr>());
}
#[test]
fn named_explicit_suppresses_implicit() {
let err = TestErr::NamedExplicitSuppressesImplicit {
source: 0,
field: SimpleErr,
};
assert!(err.source().is_some());
assert!(err.source().unwrap().is::<SimpleErr>());
}
#[test]
fn unnamed_implicit_no_source() {
let err = TestErr::<SimpleErr, _>::UnnamedImplicitNoSource(0, 0);
assert!(err.source().is_none());
}
#[test]
fn unnamed_implicit_source() {
let err = TestErr::<_, i32>::UnnamedImplicitSource(SimpleErr);
assert!(err.source().is_some());
assert!(err.source().unwrap().is::<SimpleErr>());
}
#[test]
fn unnamed_explicit_no_source() {
let err = TestErr::<_, i32>::UnnamedExplicitNoSource(SimpleErr);
assert!(err.source().is_none());
}
#[test]
fn unnamed_explicit_source() {
let err = TestErr::UnnamedExplicitSource(SimpleErr, 0);
assert!(err.source().is_some());
assert!(err.source().unwrap().is::<SimpleErr>());
}
#[test]
fn unnamed_explicit_no_source_redundant() {
let err = TestErr::<SimpleErr, _>::UnnamedExplicitNoSourceRedundant(0, 0);
assert!(err.source().is_none());
}
#[test]
fn unnamed_explicit_source_redundant() {
let err = TestErr::<_, i32>::UnnamedExplicitSourceRedundant(SimpleErr);
assert!(err.source().is_some());
assert!(err.source().unwrap().is::<SimpleErr>());
}
#[test]
fn named_ignore() {
let err = TestErr::NamedIgnore {
source: SimpleErr,
field: 0,
};
assert!(err.source().is_none());
}
#[test]
fn unnamed_ignore() {
let err = TestErr::<_, i32>::UnnamedIgnore(SimpleErr);
assert!(err.source().is_none());
}
#[test]
fn named_ignore_redundant() {
let err = TestErr::<SimpleErr, _>::NamedIgnoreRedundant { field: 0 };
assert!(err.source().is_none());
}
#[test]
fn unnamed_ignore_redundant() {
let err = TestErr::<SimpleErr, _>::UnnamedIgnoreRedundant(0, 0);
assert!(err.source().is_none());
}
#[test]
fn named_variant_ignore() {
let err = TestErr::NamedVariantIgnore {
source: SimpleErr,
field: 0,
};
assert!(err.source().is_none());
}
#[test]
fn unnamed_variant_ignore() {
let err = TestErr::<_, i32>::UnnamedVariantIgnore(SimpleErr);
assert!(err.source().is_none())
}
#[test]
fn named_variant_ignore_redundant() {
let err = TestErr::<SimpleErr, _>::NamedVariantIgnoreRedundant { field: 0 };
assert!(err.source().is_none());
}
#[test]
fn unnamed_variant_ignore_redundant() {
let err = TestErr::<SimpleErr, _>::UnnamedVariantIgnoreRedundant(0, 0);
assert!(err.source().is_none())
}
```
|
```xml
import React, { Component } from 'react';
import { inject, observer } from 'mobx-react';
import { get, find } from 'lodash';
import BigNumber from 'bignumber.js';
import type { InjectedProps } from '../../../../types/injectedPropsType';
import type { DelegationCalculateFeeResponse } from '../../../../api/staking/types';
import UndelegateWalletConfirmationDialog from '../../../../components/wallet/settings/UndelegateWalletConfirmationDialog';
import UndelegateWalletSuccessDialog from '../../../../components/wallet/settings/UndelegateWalletSuccessDialog';
import {
DELEGATION_ACTIONS,
DELEGATION_DEPOSIT,
} from '../../../../config/stakingConfig';
type Props = InjectedProps & {
onExternalLinkClick: (...args: Array<any>) => any;
};
type State = {
stakePoolQuitFee: DelegationCalculateFeeResponse | null | undefined;
};
@inject('actions', 'stores')
@observer
class UndelegateWalletDialogContainer extends Component<Props, State> {
static defaultProps = {
actions: null,
stores: null,
};
state = {
stakePoolQuitFee: null,
};
_isMounted = false;
componentDidMount() {
this._isMounted = true;
this._handleCalculateTransactionFee();
}
componentWillUnmount() {
this._isMounted = false;
}
get selectedWalletId() {
return get(
this.props,
['stores', 'uiDialogs', 'dataForActiveDialog', 'walletId'],
null
);
}
async _handleCalculateTransactionFee() {
const { staking, wallets, hardwareWallets } = this.props.stores;
const { calculateDelegationFee } = staking;
const selectedWallet = find(
wallets.allWallets,
(wallet) => wallet.id === this.selectedWalletId
);
const { lastDelegatedStakePoolId, delegatedStakePoolId } = selectedWallet;
const poolId = lastDelegatedStakePoolId || delegatedStakePoolId || '';
let stakePoolQuitFee;
if (selectedWallet.isHardwareWallet) {
const coinsSelection = await hardwareWallets.selectDelegationCoins({
walletId: this.selectedWalletId,
poolId,
delegationAction: DELEGATION_ACTIONS.QUIT,
});
const { deposits, depositsReclaimed, fee } = coinsSelection;
stakePoolQuitFee = {
deposits,
depositsReclaimed,
fee,
};
hardwareWallets.initiateTransaction({
walletId: this.selectedWalletId,
});
} else {
stakePoolQuitFee = await calculateDelegationFee({
walletId: this.selectedWalletId,
});
// @TODO Remove this when api returns depositsReclaimed value
if (stakePoolQuitFee) {
stakePoolQuitFee.depositsReclaimed = new BigNumber(DELEGATION_DEPOSIT);
}
}
if (this._isMounted && stakePoolQuitFee) {
this.setState({
stakePoolQuitFee,
});
}
}
render() {
const { actions, stores, onExternalLinkClick } = this.props;
const {
wallets,
staking,
networkStatus,
profile,
hardwareWallets,
} = stores;
const { futureEpoch } = networkStatus;
const { currentLocale } = profile;
const {
getStakePoolById,
quitStakePoolRequest,
isDelegationTransactionPending,
} = staking;
const { getWalletById, undelegateWalletSubmissionSuccess } = wallets;
const {
hwDeviceStatus,
sendMoneyRequest,
selectCoinsRequest,
checkIsTrezorByWalletId,
} = hardwareWallets;
const { stakePoolQuitFee } = this.state;
const futureEpochStartTime = get(futureEpoch, 'epochStart', 0);
const walletToBeUndelegated = getWalletById(this.selectedWalletId);
if (!walletToBeUndelegated) return null;
const isTrezor = checkIsTrezorByWalletId(walletToBeUndelegated.id);
const { name: walletName } = walletToBeUndelegated;
const {
lastDelegatedStakePoolId,
delegatedStakePoolId,
} = walletToBeUndelegated;
const stakePoolId = lastDelegatedStakePoolId || delegatedStakePoolId || '';
if (
(!stakePoolId || !isDelegationTransactionPending) &&
undelegateWalletSubmissionSuccess &&
!quitStakePoolRequest.error
) {
return (
<UndelegateWalletSuccessDialog
walletName={walletName}
futureEpochStartTime={futureEpochStartTime}
currentLocale={currentLocale}
onClose={() => {
actions.dialogs.closeActiveDialog.trigger();
quitStakePoolRequest.reset();
actions.wallets.setUndelegateWalletSubmissionSuccess.trigger({
result: false,
});
}}
/>
);
}
const delegatedStakePool = getStakePoolById(stakePoolId);
const stakePoolName = get(delegatedStakePool, 'name', '');
const stakePoolTicker = get(delegatedStakePool, 'ticker');
return (
<UndelegateWalletConfirmationDialog
selectedWallet={walletToBeUndelegated}
stakePoolName={stakePoolName}
stakePoolTicker={stakePoolTicker}
onConfirm={(passphrase: string, isHardwareWallet: boolean) => {
actions.wallets.undelegateWallet.trigger({
walletId: this.selectedWalletId,
passphrase,
isHardwareWallet,
});
}}
onCancel={() => {
actions.dialogs.closeActiveDialog.trigger();
quitStakePoolRequest.reset();
actions.wallets.setUndelegateWalletSubmissionSuccess.trigger({
result: false,
});
}}
onExternalLinkClick={onExternalLinkClick}
isSubmitting={
quitStakePoolRequest.isExecuting ||
sendMoneyRequest.isExecuting ||
isDelegationTransactionPending
}
error={
quitStakePoolRequest.error ||
sendMoneyRequest.error ||
selectCoinsRequest.error
}
fees={stakePoolQuitFee}
hwDeviceStatus={hwDeviceStatus}
isTrezor={isTrezor}
/>
);
}
}
export default UndelegateWalletDialogContainer;
```
|
Hongshandian () is a town of Shuangfeng County in Hunan, China. It has an area of with a population of 49,000 (as of 2017). The town has 22 villages and 3 communities under its jurisdiction.
History
Two villages of Zimu () and Gutang () were transferred to Shexingshan Town in January 2017.
Administrative division
The town is divided into 41 villages and 3 communities, the following areas: Zhongxin Community, Taipingsi Community, Liyutang Community, Gutang Village, Zimu Village, Qiantang Village, Yangliu Village, Sifang Village, Xinzhong Village, Guanchong Village, Lashu Village, Fuchong Village, Shuangqiao Village, Qingjing Village, Zhazi Village, Nanxi Village, Jianxin Village, Pianyu Village, Xiaoduan Village, Qiantang Village, Lixin Village, Songmu Village, Xinbian Village, Xianjia Village, Xinhu Village, Xianxin Village, Guiling Village, Xintang Village, Yajiaping Village, Daqi Village, Juhua Village, Yanglin Village, Yongzhong Village, Aotou Village, Youpu Village, Zhoushang Village, Gaoqiao Village, Yonghong Village, Panjin Village, Taiping Village, Taihe Village, Gongyi Village, Xintan Village, and Tanmu Village (中心社区、太平寺社区、鲤鱼塘社区、古塘村、梓木村、堑塘村、杨柳村、四方村、新中村、观冲村、腊树村、扶冲村、双桥村、清靖村、柞子村、南溪村、建新村、片玉村、小段村、前塘村、栗新村、松木村、新边村、咸加村、新湖村、咸新村、龟灵村、新塘村、亚家坪村、大旗村、菊花村、杨林村、永忠村、熬头村、油铺村、洲上村、高桥村、永红村、盘金村、太平村、太和村、公益村、新檀村、檀木村).
References
Divisions of Shuangfeng County
|
```java
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package jdk.graal.compiler.core.test.ea;
import org.junit.Test;
import jdk.graal.compiler.nodes.ParameterNode;
import jdk.graal.compiler.nodes.PhiNode;
import jdk.graal.compiler.nodes.ValuePhiNode;
public class EAMergingTest extends EATestBase {
@Test
public void testSimpleMerge() {
testEscapeAnalysis("simpleMergeSnippet", null, false);
assertDeepEquals(1, returnNodes.size());
assertTrue(returnNodes.get(0).result() instanceof ValuePhiNode);
PhiNode phi = (PhiNode) returnNodes.get(0).result();
assertTrue(phi.valueAt(0) instanceof ParameterNode);
assertTrue(phi.valueAt(1) instanceof ParameterNode);
}
public static int simpleMergeSnippet(boolean b, int u, int v) {
TestClassInt obj;
if (b) {
obj = new TestClassInt(u, 0);
notInlineable();
} else {
obj = new TestClassInt(v, 0);
notInlineable();
}
return obj.x;
}
}
```
|
```objective-c
// UIImageView+AFNetworking.m
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
#import "UIImageView+AFNetworking.h"
#import <objc/runtime.h>
#if defined(__IPHONE_OS_VERSION_MIN_REQUIRED)
#import "AFHTTPRequestOperation.h"
@interface AFImageCache : NSCache <AFImageCache>
@end
#pragma mark -
@interface UIImageView (_AFNetworking)
@property (readwrite, nonatomic, strong, setter = af_setImageRequestOperation:) AFHTTPRequestOperation *af_imageRequestOperation;
@end
@implementation UIImageView (_AFNetworking)
+ (NSOperationQueue *)af_sharedImageRequestOperationQueue {
static NSOperationQueue *_af_sharedImageRequestOperationQueue = nil;
static dispatch_once_t onceToken;
dispatch_once(&onceToken, ^{
_af_sharedImageRequestOperationQueue = [[NSOperationQueue alloc] init];
_af_sharedImageRequestOperationQueue.maxConcurrentOperationCount = NSOperationQueueDefaultMaxConcurrentOperationCount;
});
return _af_sharedImageRequestOperationQueue;
}
- (AFHTTPRequestOperation *)af_imageRequestOperation {
return (AFHTTPRequestOperation *)objc_getAssociatedObject(self, @selector(af_imageRequestOperation));
}
- (void)af_setImageRequestOperation:(AFHTTPRequestOperation *)imageRequestOperation {
objc_setAssociatedObject(self, @selector(af_imageRequestOperation), imageRequestOperation, OBJC_ASSOCIATION_RETAIN_NONATOMIC);
}
@end
#pragma mark -
@implementation UIImageView (AFNetworking)
@dynamic imageResponseSerializer;
+ (id <AFImageCache>)sharedImageCache {
static AFImageCache *_af_defaultImageCache = nil;
static dispatch_once_t oncePredicate;
dispatch_once(&oncePredicate, ^{
_af_defaultImageCache = [[AFImageCache alloc] init];
[[NSNotificationCenter defaultCenter] addObserverForName:UIApplicationDidReceiveMemoryWarningNotification object:nil queue:[NSOperationQueue mainQueue] usingBlock:^(NSNotification * __unused notification) {
[_af_defaultImageCache removeAllObjects];
}];
});
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wgnu"
return objc_getAssociatedObject(self, @selector(sharedImageCache)) ?: _af_defaultImageCache;
#pragma clang diagnostic pop
}
+ (void)setSharedImageCache:(id <AFImageCache>)imageCache {
objc_setAssociatedObject(self, @selector(sharedImageCache), imageCache, OBJC_ASSOCIATION_RETAIN_NONATOMIC);
}
#pragma mark -
- (id <AFURLResponseSerialization>)imageResponseSerializer {
static id <AFURLResponseSerialization> _af_defaultImageResponseSerializer = nil;
static dispatch_once_t onceToken;
dispatch_once(&onceToken, ^{
_af_defaultImageResponseSerializer = [AFImageResponseSerializer serializer];
});
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wgnu"
return objc_getAssociatedObject(self, @selector(imageResponseSerializer)) ?: _af_defaultImageResponseSerializer;
#pragma clang diagnostic pop
}
- (void)setImageResponseSerializer:(id <AFURLResponseSerialization>)serializer {
objc_setAssociatedObject(self, @selector(imageResponseSerializer), serializer, OBJC_ASSOCIATION_RETAIN_NONATOMIC);
}
#pragma mark -
- (void)setImageWithURL:(NSURL *)url {
[self setImageWithURL:url placeholderImage:nil];
}
- (void)setImageWithURL:(NSURL *)url
placeholderImage:(UIImage *)placeholderImage
{
NSMutableURLRequest *request = [NSMutableURLRequest requestWithURL:url];
[request addValue:@"image/*" forHTTPHeaderField:@"Accept"];
[self setImageWithURLRequest:request placeholderImage:placeholderImage success:nil failure:nil];
}
- (void)setImageWithURLRequest:(NSURLRequest *)urlRequest
placeholderImage:(UIImage *)placeholderImage
success:(void (^)(NSURLRequest *request, NSHTTPURLResponse *response, UIImage *image))success
failure:(void (^)(NSURLRequest *request, NSHTTPURLResponse *response, NSError *error))failure
{
[self cancelImageRequestOperation];
UIImage *cachedImage = [[[self class] sharedImageCache] cachedImageForRequest:urlRequest];
if (cachedImage) {
if (success) {
success(nil, nil, cachedImage);
} else {
self.image = cachedImage;
}
self.af_imageRequestOperation = nil;
} else {
if (placeholderImage) {
self.image = placeholderImage;
}
__weak __typeof(self)weakSelf = self;
self.af_imageRequestOperation = [[AFHTTPRequestOperation alloc] initWithRequest:urlRequest];
self.af_imageRequestOperation.responseSerializer = self.imageResponseSerializer;
[self.af_imageRequestOperation setCompletionBlockWithSuccess:^(AFHTTPRequestOperation *operation, id responseObject) {
__strong __typeof(weakSelf)strongSelf = weakSelf;
if ([[urlRequest URL] isEqual:[strongSelf.af_imageRequestOperation.request URL]]) {
if (success) {
success(urlRequest, operation.response, responseObject);
} else if (responseObject) {
strongSelf.image = responseObject;
}
if (operation == strongSelf.af_imageRequestOperation){
strongSelf.af_imageRequestOperation = nil;
}
}
[[[strongSelf class] sharedImageCache] cacheImage:responseObject forRequest:urlRequest];
} failure:^(AFHTTPRequestOperation *operation, NSError *error) {
__strong __typeof(weakSelf)strongSelf = weakSelf;
if ([[urlRequest URL] isEqual:[strongSelf.af_imageRequestOperation.request URL]]) {
if (failure) {
failure(urlRequest, operation.response, error);
}
if (operation == strongSelf.af_imageRequestOperation){
strongSelf.af_imageRequestOperation = nil;
}
}
}];
[[[self class] af_sharedImageRequestOperationQueue] addOperation:self.af_imageRequestOperation];
}
}
- (void)cancelImageRequestOperation {
[self.af_imageRequestOperation cancel];
self.af_imageRequestOperation = nil;
}
@end
#pragma mark -
static inline NSString * AFImageCacheKeyFromURLRequest(NSURLRequest *request) {
return [[request URL] absoluteString];
}
@implementation AFImageCache
- (UIImage *)cachedImageForRequest:(NSURLRequest *)request {
switch ([request cachePolicy]) {
case NSURLRequestReloadIgnoringCacheData:
case NSURLRequestReloadIgnoringLocalAndRemoteCacheData:
return nil;
default:
break;
}
return [self objectForKey:AFImageCacheKeyFromURLRequest(request)];
}
- (void)cacheImage:(UIImage *)image
forRequest:(NSURLRequest *)request
{
if (image && request) {
[self setObject:image forKey:AFImageCacheKeyFromURLRequest(request)];
}
}
@end
#endif
```
|
```xml
/*
* Wire
*
* This program is free software: you can redistribute it and/or modify
* (at your option) any later version.
*
* This program 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
*
* along with this program. If not, see path_to_url
*
*/
import {ClientType, RegisteredClient} from '@wireapp/api-client/lib/client/';
import type {RootState} from '../reducer';
export const getClients = (state: RootState) => state.clientState.clients || [];
export const getCurrentSelfClient = (state: RootState): RegisteredClient | null => state.clientState.currentClient;
export const hasLoadedClients = (state: RootState) => state.clientState.clients !== null;
export const isNewCurrentSelfClient = (state: RootState): boolean => state.clientState.isNewClient;
export const getPermanentClients = (state: RootState) =>
getClients(state).filter(client => client.type === ClientType.PERMANENT) || [];
export const getError = (state: RootState) => state.clientState.error;
export const isFetching = (state: RootState) => state.clientState.fetching;
```
|
```xml
<epp xmlns="urn:ietf:params:xml:ns:epp-1.0">
<command>
<update>
<domain:update
xmlns:domain="urn:ietf:params:xml:ns:domain-1.0">
<domain:name>example.tld</domain:name>
<domain:add>
<domain:status s="clientHold" />
</domain:add>
</domain:update>
</update>
<extension>
<rgp:update xmlns:rgp="urn:ietf:params:xml:ns:rgp-1.0">
<rgp:restore op="request"/>
</rgp:update>
</extension>
<clTRID>ABC-12345</clTRID>
</command>
</epp>
```
|
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\CloudSearch;
class User extends \Google\Collection
{
protected $collection_key = 'phoneNumber';
/**
* @var string
*/
public $avatarUrl;
protected $blockRelationshipType = AppsDynamiteSharedUserBlockRelationship::class;
protected $blockRelationshipDataType = '';
protected $botInfoType = BotInfo::class;
protected $botInfoDataType = '';
/**
* @var bool
*/
public $deleted;
/**
* @var string
*/
public $email;
/**
* @var string
*/
public $firstName;
/**
* @var string
*/
public $gender;
protected $idType = UserId::class;
protected $idDataType = '';
/**
* @var bool
*/
public $isAnonymous;
/**
* @var string
*/
public $lastName;
/**
* @var string
*/
public $name;
protected $organizationInfoType = AppsDynamiteSharedOrganizationInfo::class;
protected $organizationInfoDataType = '';
protected $phoneNumberType = AppsDynamiteSharedPhoneNumber::class;
protected $phoneNumberDataType = 'array';
/**
* @var string
*/
public $userAccountState;
/**
* @var string
*/
public $userProfileVisibility;
/**
* @param string
*/
public function setAvatarUrl($avatarUrl)
{
$this->avatarUrl = $avatarUrl;
}
/**
* @return string
*/
public function getAvatarUrl()
{
return $this->avatarUrl;
}
/**
* @param AppsDynamiteSharedUserBlockRelationship
*/
public function setBlockRelationship(AppsDynamiteSharedUserBlockRelationship $blockRelationship)
{
$this->blockRelationship = $blockRelationship;
}
/**
* @return AppsDynamiteSharedUserBlockRelationship
*/
public function getBlockRelationship()
{
return $this->blockRelationship;
}
/**
* @param BotInfo
*/
public function setBotInfo(BotInfo $botInfo)
{
$this->botInfo = $botInfo;
}
/**
* @return BotInfo
*/
public function getBotInfo()
{
return $this->botInfo;
}
/**
* @param bool
*/
public function setDeleted($deleted)
{
$this->deleted = $deleted;
}
/**
* @return bool
*/
public function getDeleted()
{
return $this->deleted;
}
/**
* @param string
*/
public function setEmail($email)
{
$this->email = $email;
}
/**
* @return string
*/
public function getEmail()
{
return $this->email;
}
/**
* @param string
*/
public function setFirstName($firstName)
{
$this->firstName = $firstName;
}
/**
* @return string
*/
public function getFirstName()
{
return $this->firstName;
}
/**
* @param string
*/
public function setGender($gender)
{
$this->gender = $gender;
}
/**
* @return string
*/
public function getGender()
{
return $this->gender;
}
/**
* @param UserId
*/
public function setId(UserId $id)
{
$this->id = $id;
}
/**
* @return UserId
*/
public function getId()
{
return $this->id;
}
/**
* @param bool
*/
public function setIsAnonymous($isAnonymous)
{
$this->isAnonymous = $isAnonymous;
}
/**
* @return bool
*/
public function getIsAnonymous()
{
return $this->isAnonymous;
}
/**
* @param string
*/
public function setLastName($lastName)
{
$this->lastName = $lastName;
}
/**
* @return string
*/
public function getLastName()
{
return $this->lastName;
}
/**
* @param string
*/
public function setName($name)
{
$this->name = $name;
}
/**
* @return string
*/
public function getName()
{
return $this->name;
}
/**
* @param AppsDynamiteSharedOrganizationInfo
*/
public function setOrganizationInfo(AppsDynamiteSharedOrganizationInfo $organizationInfo)
{
$this->organizationInfo = $organizationInfo;
}
/**
* @return AppsDynamiteSharedOrganizationInfo
*/
public function getOrganizationInfo()
{
return $this->organizationInfo;
}
/**
* @param AppsDynamiteSharedPhoneNumber[]
*/
public function setPhoneNumber($phoneNumber)
{
$this->phoneNumber = $phoneNumber;
}
/**
* @return AppsDynamiteSharedPhoneNumber[]
*/
public function getPhoneNumber()
{
return $this->phoneNumber;
}
/**
* @param string
*/
public function setUserAccountState($userAccountState)
{
$this->userAccountState = $userAccountState;
}
/**
* @return string
*/
public function getUserAccountState()
{
return $this->userAccountState;
}
/**
* @param string
*/
public function setUserProfileVisibility($userProfileVisibility)
{
$this->userProfileVisibility = $userProfileVisibility;
}
/**
* @return string
*/
public function getUserProfileVisibility()
{
return $this->userProfileVisibility;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(User::class, 'Google_Service_CloudSearch_User');
```
|
```yaml
presubmits:
kubernetes-sigs/cluster-api-operator:
- name: pull-cluster-api-operator-build-main
cluster: eks-prow-build-cluster
decorate: true
path_alias: sigs.k8s.io/cluster-api-operator
always_run: true
labels:
preset-service-account: "true"
branches:
# The script this job runs is not in all branches.
- ^main$
spec:
containers:
- image: gcr.io/k8s-staging-test-infra/kubekins-e2e:v20240803-cf1183f2db-1.27
command:
- runner.sh
- ./scripts/ci-build.sh
resources:
requests:
cpu: "1"
memory: "2Gi"
limits:
cpu: "1"
memory: "2Gi"
annotations:
testgrid-dashboards: sig-cluster-lifecycle-cluster-api-operator
testgrid-tab-name: capi-operator-pr-build-main
- name: pull-cluster-api-operator-make-main
cluster: eks-prow-build-cluster
decorate: true
path_alias: sigs.k8s.io/cluster-api-operator
always_run: true
labels:
preset-service-account: "true"
preset-dind-enabled: "true"
branches:
# The script this job runs is not in all branches.
- ^main$
spec:
containers:
- image: gcr.io/k8s-staging-test-infra/kubekins-e2e:v20240803-cf1183f2db-1.27
command:
- runner.sh
- ./scripts/ci-make.sh
# docker-in-docker needs privileged mode
securityContext:
privileged: true
resources:
requests:
cpu: "4"
memory: "8Gi"
limits:
cpu: "4"
memory: "8Gi"
annotations:
testgrid-dashboards: sig-cluster-lifecycle-cluster-api-operator
testgrid-tab-name: capi-operator-pr-make-main
- name: pull-cluster-api-operator-apidiff-main
cluster: eks-prow-build-cluster
decorate: true
path_alias: sigs.k8s.io/cluster-api-operator
optional: true
labels:
preset-service-account: "true"
branches:
# The script this job runs is not in all branches.
- ^main$
run_if_changed: '^((api|cmd|config|controllers|hack|internal|scripts|test|util|webhook)/|go\.mod|go\.sum|Dockerfile|Makefile)'
spec:
containers:
- image: gcr.io/k8s-staging-test-infra/kubekins-e2e:v20240803-cf1183f2db-1.27
command:
- runner.sh
- ./scripts/ci-apidiff.sh
resources:
requests:
cpu: "1"
memory: "2Gi"
limits:
cpu: "1"
memory: "2Gi"
annotations:
testgrid-dashboards: sig-cluster-lifecycle-cluster-api-operator
testgrid-tab-name: capi-operator-pr-apidiff-main
- name: pull-cluster-api-operator-verify-main
cluster: eks-prow-build-cluster
decorate: true
path_alias: sigs.k8s.io/cluster-api-operator
always_run: true
labels:
preset-service-account: "true"
branches:
# The script this job runs is not in all branches.
- ^main$
spec:
containers:
- image: gcr.io/k8s-staging-test-infra/kubekins-e2e:v20240803-cf1183f2db-1.27
command:
- "runner.sh"
- ./scripts/ci-verify.sh
resources:
requests:
cpu: "1"
memory: "2Gi"
limits:
cpu: "1"
memory: "2Gi"
annotations:
testgrid-dashboards: sig-cluster-lifecycle-cluster-api-operator
testgrid-tab-name: capi-operator-pr-verify-main
- name: pull-cluster-api-operator-test-main
cluster: eks-prow-build-cluster
decorate: true
path_alias: sigs.k8s.io/cluster-api-operator
labels:
preset-service-account: "true"
branches:
# The script this job runs is not in all branches.
- ^main$
run_if_changed: '^((api|cmd|config|controllers|hack|internal|scripts|test|util|webhook)/|go\.mod|go\.sum|Dockerfile|Makefile)'
spec:
containers:
- image: gcr.io/k8s-staging-test-infra/kubekins-e2e:v20240803-cf1183f2db-1.27
args:
- runner.sh
- ./scripts/ci-test.sh
resources:
requests:
cpu: "1"
memory: "2Gi"
limits:
cpu: "1"
memory: "2Gi"
annotations:
testgrid-dashboards: sig-cluster-lifecycle-cluster-api-operator
testgrid-tab-name: capi-operator-pr-test-main
- name: pull-cluster-api-operator-e2e-main
cluster: eks-prow-build-cluster
path_alias: "sigs.k8s.io/cluster-api-operator"
optional: false
decorate: true
run_if_changed: '^((api|cmd|config|controllers|hack|internal|scripts|test|util|webhook)/|go\.mod|go\.sum|Dockerfile|Makefile)'
max_concurrency: 5
labels:
preset-dind-enabled: "true"
preset-kind-volume-mounts: "true"
branches:
- ^main$
spec:
containers:
- image: gcr.io/k8s-staging-test-infra/kubekins-e2e:v20240803-cf1183f2db-1.27
command:
- runner.sh
args:
- ./scripts/ci-e2e.sh
# docker-in-docker needs privileged mode
securityContext:
privileged: true
resources:
requests:
cpu: "4"
memory: "8Gi"
limits:
cpu: "4"
memory: "8Gi"
annotations:
testgrid-dashboards: sig-cluster-lifecycle-cluster-api-operator
testgrid-tab-name: capi-operator-pr-e2e-main
```
|
```c
/* Provide a version of _doprnt in terms of fprintf.
Contributed by Kaveh Ghazi (ghazi@caip.rutgers.edu) 3/29/98
This program is free software; you can redistribute it and/or modify it
Free Software Foundation; either version 2, or (at your option) any
later version.
This program 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
along with this program; if not, write to the Free Software
Foundation, 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, USA. */
#include "config.h"
#include "ansidecl.h"
#include "safe-ctype.h"
#include <stdio.h>
#include <stdarg.h>
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#undef _doprnt
#ifdef HAVE__DOPRNT
#define TEST
#endif
#ifdef TEST /* Make sure to use the internal one. */
#define _doprnt my_doprnt
#endif
#define COPY_VA_INT \
do { \
const int value = abs (va_arg (ap, int)); \
char buf[32]; \
ptr++; /* Go past the asterisk. */ \
*sptr = '\0'; /* NULL terminate sptr. */ \
sprintf(buf, "%d", value); \
strcat(sptr, buf); \
while (*sptr) sptr++; \
} while (0)
#define PRINT_CHAR(CHAR) \
do { \
putc(CHAR, stream); \
ptr++; \
total_printed++; \
continue; \
} while (0)
#define PRINT_TYPE(TYPE) \
do { \
int result; \
TYPE value = va_arg (ap, TYPE); \
*sptr++ = *ptr++; /* Copy the type specifier. */ \
*sptr = '\0'; /* NULL terminate sptr. */ \
result = fprintf(stream, specifier, value); \
if (result == -1) \
return -1; \
else \
{ \
total_printed += result; \
continue; \
} \
} while (0)
int
_doprnt (const char *format, va_list ap, FILE *stream)
{
const char * ptr = format;
char specifier[128];
int total_printed = 0;
while (*ptr != '\0')
{
if (*ptr != '%') /* While we have regular characters, print them. */
PRINT_CHAR(*ptr);
else /* We got a format specifier! */
{
char * sptr = specifier;
int wide_width = 0, short_width = 0;
*sptr++ = *ptr++; /* Copy the % and move forward. */
while (strchr ("-+ #0", *ptr)) /* Move past flags. */
*sptr++ = *ptr++;
if (*ptr == '*')
COPY_VA_INT;
else
while (ISDIGIT(*ptr)) /* Handle explicit numeric value. */
*sptr++ = *ptr++;
if (*ptr == '.')
{
*sptr++ = *ptr++; /* Copy and go past the period. */
if (*ptr == '*')
COPY_VA_INT;
else
while (ISDIGIT(*ptr)) /* Handle explicit numeric value. */
*sptr++ = *ptr++;
}
while (strchr ("hlL", *ptr))
{
switch (*ptr)
{
case 'h':
short_width = 1;
break;
case 'l':
wide_width++;
break;
case 'L':
wide_width = 2;
break;
default:
abort();
}
*sptr++ = *ptr++;
}
switch (*ptr)
{
case 'd':
case 'i':
case 'o':
case 'u':
case 'x':
case 'X':
case 'c':
{
/* Short values are promoted to int, so just copy it
as an int and trust the C library printf to cast it
to the right width. */
if (short_width)
PRINT_TYPE(int);
else
{
switch (wide_width)
{
case 0:
PRINT_TYPE(int);
break;
case 1:
PRINT_TYPE(long);
break;
case 2:
default:
#if defined(__GNUC__) || defined(HAVE_LONG_LONG)
PRINT_TYPE(long long);
#else
PRINT_TYPE(long); /* Fake it and hope for the best. */
#endif
break;
} /* End of switch (wide_width) */
} /* End of else statement */
} /* End of integer case */
break;
case 'f':
case 'e':
case 'E':
case 'g':
case 'G':
{
if (wide_width == 0)
PRINT_TYPE(double);
else
{
#if defined(__GNUC__) || defined(HAVE_LONG_DOUBLE)
PRINT_TYPE(long double);
#else
PRINT_TYPE(double); /* Fake it and hope for the best. */
#endif
}
}
break;
case 's':
PRINT_TYPE(char *);
break;
case 'p':
PRINT_TYPE(void *);
break;
case '%':
PRINT_CHAR('%');
break;
default:
abort();
} /* End of switch (*ptr) */
} /* End of else statement */
}
return total_printed;
}
#ifdef TEST
#include <math.h>
#ifndef M_PI
#define M_PI (3.1415926535897932385)
#endif
#define RESULT(x) do \
{ \
int i = (x); \
printf ("printed %d characters\n", i); \
fflush(stdin); \
} while (0)
static int checkit (const char * format, ...) ATTRIBUTE_PRINTF_1;
static int
checkit (const char* format, ...)
{
int result;
VA_OPEN (args, format);
VA_FIXEDARG (args, char *, format);
result = _doprnt (format, args, stdout);
VA_CLOSE (args);
return result;
}
int
main (void)
{
RESULT(checkit ("<%d>\n", 0x12345678));
RESULT(printf ("<%d>\n", 0x12345678));
RESULT(checkit ("<%200d>\n", 5));
RESULT(printf ("<%200d>\n", 5));
RESULT(checkit ("<%.300d>\n", 6));
RESULT(printf ("<%.300d>\n", 6));
RESULT(checkit ("<%100.150d>\n", 7));
RESULT(printf ("<%100.150d>\n", 7));
RESULT(checkit ("<%s>\n",
"jjjjjjjjjiiiiiiiiiiiiiiioooooooooooooooooppppppppppppaa\n\
your_sha256_hash77733333"));
RESULT(printf ("<%s>\n",
"jjjjjjjjjiiiiiiiiiiiiiiioooooooooooooooooppppppppppppaa\n\
your_sha256_hash77733333"));
RESULT(checkit ("<%f><%0+#f>%s%d%s>\n",
1.0, 1.0, "foo", 77, "asdjffffffffffffffiiiiiiiiiiixxxxx"));
RESULT(printf ("<%f><%0+#f>%s%d%s>\n",
1.0, 1.0, "foo", 77, "asdjffffffffffffffiiiiiiiiiiixxxxx"));
RESULT(checkit ("<%4f><%.4f><%%><%4.4f>\n", M_PI, M_PI, M_PI));
RESULT(printf ("<%4f><%.4f><%%><%4.4f>\n", M_PI, M_PI, M_PI));
RESULT(checkit ("<%*f><%.*f><%%><%*.*f>\n", 3, M_PI, 3, M_PI, 3, 3, M_PI));
RESULT(printf ("<%*f><%.*f><%%><%*.*f>\n", 3, M_PI, 3, M_PI, 3, 3, M_PI));
RESULT(checkit ("<%d><%i><%o><%u><%x><%X><%c>\n",
75, 75, 75, 75, 75, 75, 75));
RESULT(printf ("<%d><%i><%o><%u><%x><%X><%c>\n",
75, 75, 75, 75, 75, 75, 75));
RESULT(checkit ("<%d><%i><%o><%u><%x><%X><%c>\n",
75, 75, 75, 75, 75, 75, 75));
RESULT(printf ("<%d><%i><%o><%u><%x><%X><%c>\n",
75, 75, 75, 75, 75, 75, 75));
RESULT(checkit ("Testing (hd) short: <%d><%ld><%hd><%hd><%d>\n", 123, (long)234, 345, 123456789, 456));
RESULT(printf ("Testing (hd) short: <%d><%ld><%hd><%hd><%d>\n", 123, (long)234, 345, 123456789, 456));
#if defined(__GNUC__) || defined (HAVE_LONG_LONG)
RESULT(checkit ("Testing (lld) long long: <%d><%lld><%d>\n", 123, 234234234234234234LL, 345));
RESULT(printf ("Testing (lld) long long: <%d><%lld><%d>\n", 123, 234234234234234234LL, 345));
RESULT(checkit ("Testing (Ld) long long: <%d><%Ld><%d>\n", 123, 234234234234234234LL, 345));
RESULT(printf ("Testing (Ld) long long: <%d><%Ld><%d>\n", 123, 234234234234234234LL, 345));
#endif
#if defined(__GNUC__) || defined (HAVE_LONG_DOUBLE)
RESULT(checkit ("Testing (Lf) long double: <%.20f><%.20Lf><%0+#.20f>\n",
1.23456, 1.234567890123456789L, 1.23456));
RESULT(printf ("Testing (Lf) long double: <%.20f><%.20Lf><%0+#.20f>\n",
1.23456, 1.234567890123456789L, 1.23456));
#endif
return 0;
}
#endif /* TEST */
```
|
Varskhvaran (, also Romanized as Varskhvārān, Varakshvārān, Varaskhvāran, and Vereskeh Vārān) is a village in Doboluk Rural District, Arjomand District, Firuzkuh County, Tehran Province, Iran. At the 2006 census, its population was 463, in 141 families.
References
Populated places in Firuzkuh County
|
Radio Zet () is a Polish commercial radio station.
External links
Official website
Radio stations in Poland
Mass media in Warsaw
Radio stations established in 1990
1990 establishments in Poland
|
```xml
<?xml version="1.0" encoding="utf-8"?>
<!--
~ Nextcloud - Android Client
~
-->
<adaptive-icon xmlns:android="path_to_url">
<background android:drawable="@drawable/ic_launcher_background" />
<foreground android:drawable="@drawable/ic_launcher_foreground" />
<monochrome android:drawable="@drawable/ic_launcher_foreground" />
</adaptive-icon>
```
|
Veerey Ki Wedding () is an Indian Hindi-language romantic comedy film that was released on 2 March 2018. It was directed by Ashu Trikha, and stars Pulkit Samrat, Kriti Kharbanda and Jimmy Sheirgill.
Cast
Pulkit Samrat as Veer Arora (Veerey)
Kriti Kharbanda as Geet Bhalla
Jimmy Sheirgill as Balli Arora
Satish Kaushik as Gopi Bhalla
Yuvika Chaudhary as Inspector Rani Chaudhary
Payal Rajput as Rinki Vohra
Supriya Karnik as Juhi Bhalla
Priyanka Nayan as Riya
Vidyadhar Karmakar as Bade Babu ji
Sapna Choudhary in item number "Hatt Ja Tau Pache Ne"
Mohd Sharia
Soundtrack
The music of the film is composed by Meet Bros, Farzan Faaiz, Jaidev Kumar and Ashok Punjabi while lyrics are penned by Kumaar, Faaiz Anwar, Chandan Bakshi, Deepak Noor, Dr. Devendra Kafir, Ramkesh Jiwanpurwala and Ashok Punjabi. The background music of the film is composed by Sanjoy Chowdhury. The songs featured in the film are sung by Mika Singh, Sunidhi Chauhan, Navraj Hans, Saloni Thakkar, Meet Bros, Neha Kakkar, Deep Money, Javed Ali and Akanksha Bhandari. The first track of the film Mind Blowing which is sung by Mika Singh was released on 9 February 2018. The second song of the film to be released was Hatt Ja Tau which is sung by Sunidhi Chauhan was released on 15 February 2018. The third song of the film, Veerey Ki Wedding (Title Track) which is sung by Navraj Hans and Saloni Thakkar was released on 21 February 2018. The fourth track, Talli Tonight which is sung by Meet Bros, Neha Kakkar and Deep Money was released on 27 February 2018. The soundtrack was released on 27 February 2018 by T-Series.
Controversies
On 19 February 2018, Haryanvi singer Vikas Kumar sent a legal notice to the makers over copyright issues for the song "Hatt Ja Tau". Vikas has claimed that he has originally sung the number and the makers did not seek prior permission before using it in the film. Kumar's lawyer has stated that the makers cannot use the song without his permission and will have to pay him Rs 7 crore.
Veerey Ki Wedding is also in the news for its clash with Sonam Kapoor-Kareena Kapoor Khan starrer Veere Di Wedding'''s title. Mumbai High Court ruled in the favour of the makers of Veerey Ki Wedding''.
References
External links
2010s Hindi-language films
2018 films
2018 romantic comedy films
Films about Indian weddings
Films directed by Ashu Trikha
Indian romantic comedy films
Hindi-language romantic comedy films
|
```html+erb
<div class="content"><%= contents %></div>
<div id="sidebar"><%= include.call("sidebar.html") %></div>
<!-- mobile only -->
<div id="mobile-header">
<a class="menu-button" onclick="document.body.classList.toggle('sidebar-open')"></a>
</div>
```
|
```swift
//
// GameScene.swift
// AR-Live-Tutorial
//
//
import UIKit
import SpriteKit
import AVFoundation
private enum HeroBulletMode {
case normal
case supply//
}
class GameScene: SKScene {
private var monsters = [SKElementNode]()
private var arms = [SKElementNode]()
private var hero = SKElementNode.init(type: .hero)
private var monsterBullets = [SKSpriteNode]()
lazy private var armSoundAction = { () -> SKAction in
let action = SKAction.playSoundFileNamed("shoot.mp3", waitForCompletion: false)
return action
}()
private var player:AVAudioPlayer?
private var scorLb:SKLabelNode?
private var score = 0
private var shouldMove = false
private var supply = TextureManager.shared.node(.supply)
private var boss = SKElementNode.init(type: .boss)
private var totalGeneratedMonsterCount = 0
required init?(coder aDecoder: NSCoder) {
fatalError("init(coder:) has not been implemented")
}
override init(size: CGSize) {
super.init(size: size)
setup()
addNodes()
}
private func setup() {
backgroundColor = .white
let bgNode = SKSpriteNode.init(imageNamed: "bg")
bgNode.position = .zero
bgNode.zPosition = 0
bgNode.anchorPoint = .zero
bgNode.size = size
addChild(bgNode)
guard let path = Bundle.main.path(forResource: "bgm", ofType: "mp3") else {
return
}
let url = URL.init(fileURLWithPath: path)
do{
try player = AVAudioPlayer.init(contentsOf: url)
}catch let e {
print(e.localizedDescription)
return
}
player?.numberOfLoops = -1
player?.volume = 0.8
player?.prepareToPlay()
player?.play()
}
}
//add node
extension GameScene {
private func addNodes() {
addHero()
addScoreLb()
addMonsters()
}
private func addScoreLb() {
scorLb = SKLabelNode.init(fontNamed: "Chalkduster")
scorLb?.text = "0"
scorLb?.fontSize = 20
scorLb?.fontColor = .black
scorLb?.position = .init(x: 50, y: size.height - 40)
addChild(scorLb!)
}
//MARK: -
//MARK:
private func addHero() {
//
hero.position = .init(x: size.width/2, y: hero.size.height/2)
hero.name = "hero"
addChild(hero)
//
weak var wkself = self
let shootAction = SKAction.run {
wkself?.shoot()
}
let wait = SKAction.wait(forDuration: 0.2)
let sequenceAction = SKAction.sequence([shootAction,wait])
let repeatShootAction = SKAction.repeatForever(sequenceAction)
run(repeatShootAction)
}
private func shoot() {
guard hero.shouldShoot else {
return
}
if hero.buff == .none {
let armsNode = SKElementNode.init(type: .bullet)
//
armsNode.position = hero.position
//
addChild(armsNode)
arms.append(armsNode)
//
let distance = size.height - armsNode.position.y
let speed = size.height
//
let duration = distance/speed
let moveAction = SKAction.moveTo(y: size.height, duration: TimeInterval(duration))
weak var wkarms = armsNode
weak var wkself = self
//2action
let group = SKAction.group([moveAction,armSoundAction])
armsNode.run(group, completion: {
wkarms?.removeFromParent()
let index = wkself?.arms.index(of: wkarms!)
if index != nil {
wkself?.arms.remove(at: index!)
}
})
}else if hero.buff == .doubleBullet {
let bullet1 = SKElementNode.init(type: .bullet)
bullet1.position = .init(x: hero.position.x - hero.size.width/4, y: hero.position.y)
addChild(bullet1)
let bullet2 = SKElementNode.init(type: .bullet)
bullet2.position = .init(x: hero.position.x + hero.size.width/4, y: hero.position.y)
addChild(bullet2)
arms.append(bullet1)
arms.append(bullet2)
//
let distance = size.height - bullet1.position.y
let speed = size.height
//
let duration = distance/speed
let moveAction = SKAction.moveTo(y: size.height, duration: TimeInterval(duration))
weak var wkbullet1 = bullet1
weak var wkbullet2 = bullet2
weak var wkself = self
//2action
let group = SKAction.group([moveAction,armSoundAction])
bullet1.run(group, completion: {
wkbullet1?.removeFromParent()
let index = wkself?.arms.index(of: wkbullet1!)
if index != nil {
wkself?.arms.remove(at: index!)
}
})
bullet2.run(moveAction, completion: {
wkbullet2?.removeFromParent()
let index = wkself?.arms.index(of: wkbullet2!)
if index != nil {
wkself?.arms.remove(at: index!)
}
})
}else{
}
}
private func addMonsters() {
weak var wkself = self
//
let addMonsterAction = SKAction.run {
wkself?.generateMonster()
}
let waitAction = SKAction.wait(forDuration: 0.8)
let bgSequence = SKAction.sequence([addMonsterAction,waitAction])
let repeatAction = SKAction.repeatForever(bgSequence)
//Monster
run(repeatAction)
}
private func generateMonster() {
showSupplyeIfNeed()
if boss.parent != nil {
return
}
if totalGeneratedMonsterCount % 80 == 0 && totalGeneratedMonsterCount > 0 {
bossShow()
return
}
weak var wkself = self
//
let minduration:Int = 4
let maxduration:Int = 5
var duration = Int(arc4random_uniform((UInt32(maxduration - minduration)))) + minduration
var bulletCount = 0
//
var enemyType:SKTextureType = .small
if totalGeneratedMonsterCount == 0 {
enemyType = .small
}else if totalGeneratedMonsterCount % 10 == 0 && totalGeneratedMonsterCount % 20 != 0 {
enemyType = .mid
duration = maxduration
bulletCount = 2
}else if totalGeneratedMonsterCount % 20 == 0 {
enemyType = .big
duration = maxduration
bulletCount = 4
}else{
enemyType = .small
}
let monster = SKElementNode.init(type: enemyType)
let minx:Int = Int(monster.size.width / 2)
let maxx:Int = Int(size.width - monster.size.width / 2)
let gapx:Int = maxx - minx
let xpos:Int = Int(arc4random_uniform(UInt32(gapx))) + minx
monster.position = .init(x: CGFloat(xpos), y: (size.height + monster.size.height/2))
addChild(monster)
totalGeneratedMonsterCount += 1
monsters.append(monster)
//
if bulletCount > 0 {
monsterShoot(monster: monster, bulletCount: bulletCount, shootDuration: 0.5, dismisDuration: duration)
}
//
let moveAction = SKAction.moveTo(y: -monster.size.height/2, duration: TimeInterval(duration))
//
let removeAction = SKAction.run {
monster.removeFromParent()
let index = wkself?.monsters.index(of: monster)
if index != nil {
wkself?.monsters.remove(at: index!)
}
//end game
wkself?.gameOver()
}
//2action
monster.run(SKAction.sequence([moveAction,removeAction]))
}
private func showSupplyeIfNeed() {
if arc4random_uniform(100) < 96 {
return
}
if supply.parent != nil {
return
}
let supplyx = CGFloat(arc4random_uniform(UInt32(size.width - supply.size.width))) + supply.size.width/2
supply.removeAllActions()
supply.position = .init(x: supplyx, y: size.height + size.height + supply.size.height/2)
addChild(supply)
let move = SKAction.moveTo(y: -supply.size.height/2, duration: TimeInterval(5))
supply.run(move, completion: {
self.supply.removeFromParent()
})
}
private func bossShow() {
let reference = score/100
if monsters.count > 0 {
monsters.forEach{
$0.removeFromParent()
}
monsters.removeAll()
}
boss.removeAllActions()
hero.shouldShoot = false
boss.position = .init(x: size.width/2, y: size.height + boss.size.height/2)
addChild(boss)
monsters.append(boss)
let hp = 80+reference * 10
boss.hp = UInt(hp)
let monsterShootDuration = 0.5 - 0.01 * CGFloat(reference)
totalGeneratedMonsterCount += 1
let bossAppearWait = SKAction.wait(forDuration: 3)
let appear = SKAction.moveTo(y: size.height-boss.size.height/2, duration: 3)
SKAction.sequence([bossAppearWait, appear])
let center2Left = SKAction.moveTo(x: boss.size.width/2, duration: 3)
weak var wkself = self
let heroOn = SKAction.run {
wkself?.hero.shouldShoot = true
}
let move2Right = SKAction.moveTo(x: size.width - boss.size.width/2, duration: 6)
let move2Left = SKAction.moveTo(x: boss.size.width/2, duration: 6)
let moveRepeat = SKAction.repeatForever(SKAction.sequence([move2Right,move2Left]))
let move = SKAction.sequence([center2Left,moveRepeat])
let group1 = SKAction.group([move, heroOn])
let bossShoot = SKAction.run({
wkself?.monsterShoot(monster: wkself!.boss, bulletCount: 6, shootDuration: TimeInterval(monsterShootDuration), dismisDuration: 3)
})
let boosShootWait = SKAction.wait(forDuration: 4)
let repeatShoot = SKAction.repeatForever(SKAction.sequence([bossShoot, boosShootWait]))
let group2 = SKAction.group([group1,repeatShoot])
boss.run(SKAction.sequence([appear, group2]))
}
private func monsterShoot(monster:SKElementNode, bulletCount:Int, shootDuration:TimeInterval,dismisDuration:Int) {
weak var wkself = self
let wait = SKAction.wait(forDuration: shootDuration)
let shoot = SKAction.run {
if monster.parent == nil {
return
}
let bullet = SKSpriteNode.init(imageNamed: "monster_bullet")
wkself?.addChild(bullet)
wkself?.monsterBullets.append(bullet)
bullet.position = monster.position
let endPos = CGPoint.init(x: wkself!.hero.position.x, y: -bullet.size.height/2)
let move = SKAction.move(to: endPos , duration: TimeInterval(dismisDuration))
weak var wkbullet = bullet
bullet.run(move, completion: {
wkbullet?.removeFromParent()
let index = wkself?.monsterBullets.index(of: wkbullet!)
if index != nil {
wkself?.monsterBullets.remove(at: index!)
}
})
}
let sequence = SKAction.sequence([wait,shoot])
let `repeat` = SKAction.repeat(sequence, count: bulletCount)
run(`repeat`)
}
}
//MARK: -
//MARK:
extension GameScene {
private func gameOver() {
player?.stop()
let lose = LoseScene.init(size: size)
lose.score = score
refreshRecordIfNeed()
let transation = SKTransition.moveIn(with: .up, duration: 0.5)
view?.presentScene(lose, transition: transation)
}
//
private func refreshRecordIfNeed() {
let history = UserDefaults.standard.integer(forKey: "score")
if score > history {
UserDefaults.standard.set(score, forKey: "score")
UserDefaults.standard.synchronize()
}
}
}
//MARK: -
//MARK:
extension GameScene {
override func touchesBegan(_ touches: Set<UITouch>, with event: UIEvent?) {
let touch = touches.first!
let location = touch.location(in: self)
//
var frm = hero.frame
frm = .init(x: frm.origin.x, y: frm.origin.y, width: frm.size.width + 100, height: frm.size.height + 100)
if !frm.contains(location) {
shouldMove = false
}else{
shouldMove = true
}
}
override func touchesMoved(_ touches: Set<UITouch>, with event: UIEvent?) {
guard shouldMove else {
return
}
let touch = touches.first!
let previousPosition = touch.previousLocation(in: view)
let currentPosition = touch.location(in: view)
let offsetx = currentPosition.x - previousPosition.x
let offsety = currentPosition.y - previousPosition.y
let x = hero.position.x + offsetx
guard x>=hero.size.width/2, x <= size.width-hero.size.width/2 else {
return
}
let y = hero.position.y - offsety
guard y>=hero.size.height/2, y <= size.height-hero.size.height/2 else {
return
}
hero.position = .init(x: x , y: y)
}
}
//
extension GameScene {
private func score(_ withType:SKTextureType) -> Int {
if withType == .small {
return 1
}else if withType == .mid {
return 2
}else if withType == .big {
return 3
}else if withType == .boss {
return 5
}else {
return 0
}
}
//SKScene-update:
override func update(_ currentTime: TimeInterval) {
//var toremoveArms = [SKSpriteNode]()
for monster_bullet in monsterBullets {
if monster_bullet.frame.intersects(hero.frame) {
gameOver()
return
}
}
for monster in monsters {
if monster.frame.intersects(hero.frame) {
gameOver()
return
}
for arm in arms {
if arm.frame.intersects(monster.frame) {
//remove bullet
arm.removeFromParent()
let armindex = arms.index(of: arm)
if armindex != nil {
arms.remove(at: armindex!)
}
//refresh hp
if(monster.alive()) {
monster.hp -= 1
if monster.alive() {
continue
}
}
//if not alive, remove mosnter
monster.removeFromParent()
if monster == boss {
boss.removeAllActions()
}
let monsterindex = monsters.index(of: monster)
if monsterindex != nil {
monsters.remove(at: monsterindex!)
}
//refresh score
score += score(monster.type)
scorLb?.text = String(score)
refreshRecordIfNeed()
}
}
}
if supply.parent != nil {
if supply.frame.intersects(hero.frame) {//
supply.removeFromParent()
removeAction(forKey: "supply_key")
hero.buff = .doubleBullet
let last = SKAction.wait(forDuration: 15)
let reset = SKAction.run {
self.hero.buff = .none
}
let sequnce = SKAction.sequence([last,reset])
run(sequnce, withKey: "supply_key")
}
}
}
}
```
|
```antlr
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
lexer grammar Symbol;
AND_: '&&';
OR_: '||';
NOT_: '!';
TILDE_: '~';
VERTICALBAR_: '|';
AMPERSAND_: '&';
SIGNEDLEFTSHIFT_: '<<';
SIGNEDRIGHTSHIFT_: '>>';
CARET_: '^';
MOD_: '%';
COLON_: ':';
PLUS_: '+';
MINUS_: '-';
ASTERISK_: '*';
SLASH_: '/';
BACKSLASH_: '\\';
DOT_: '.';
DOTASTERISK_: '.*';
SAFEEQ_: '<=>';
DEQ_: '==';
EQ_: '=';
NEQ_: '<>' | '!=';
GT_: '>';
GTE_: '>=';
LT_: '<';
LTE_: '<=';
POUND_: '#';
LP_: '(';
RP_: ')';
LBE_: '{';
RBE_: '}';
LBT_: '[';
RBT_: ']';
COMMA_: ',';
DQ_: '"';
SQ_: '\'';
BQ_: '`';
QUESTION_: '?';
AT_: '@';
SEMI_: ';';
JSONSEPARATOR_: '->>';
UL_: '_';
```
|
```c++
/*=============================================================================
path_to_url
file LICENSE_1_0.txt or copy at path_to_url
=============================================================================*/
#ifndef BOOST_SPIRIT_REFACTORING_HPP
#define BOOST_SPIRIT_REFACTORING_HPP
///////////////////////////////////////////////////////////////////////////////
#include <boost/static_assert.hpp>
#include <boost/spirit/home/classic/namespace.hpp>
#include <boost/spirit/home/classic/meta/as_parser.hpp>
#include <boost/spirit/home/classic/core/parser.hpp>
#include <boost/spirit/home/classic/core/composite/composite.hpp>
#include <boost/spirit/home/classic/meta/impl/refactoring.ipp>
///////////////////////////////////////////////////////////////////////////////
namespace boost { namespace spirit {
BOOST_SPIRIT_CLASSIC_NAMESPACE_BEGIN
#if BOOST_WORKAROUND(BOOST_MSVC, >= 1400)
#pragma warning(push)
#pragma warning(disable:4512) //assignment operator could not be generated
#endif
///////////////////////////////////////////////////////////////////////////////
//
// refactor_unary_parser class
//
// This helper template allows to attach an unary operation to a newly
// constructed parser, which combines the subject of the left operand of
// the original given parser (BinaryT) with the right operand of the
// original binary parser through the original binary operation and
// rewraps the resulting parser with the original unary operator.
//
// For instance given the parser:
// *some_parser - another_parser
//
// will be refactored to:
// *(some_parser - another_parser)
//
// If the parser to refactor is not a unary parser, no refactoring is done
// at all.
//
// The original parser should be a binary_parser_category parser,
// else the compilation will fail
//
///////////////////////////////////////////////////////////////////////////////
template <typename NestedT = non_nested_refactoring>
class refactor_unary_gen;
template <typename BinaryT, typename NestedT = non_nested_refactoring>
class refactor_unary_parser :
public parser<refactor_unary_parser<BinaryT, NestedT> > {
public:
// the parser to refactor has to be at least a binary_parser_category
// parser
BOOST_STATIC_ASSERT((
boost::is_convertible<typename BinaryT::parser_category_t,
binary_parser_category>::value
));
refactor_unary_parser(BinaryT const& binary_, NestedT const& nested_)
: binary(binary_), nested(nested_) {}
typedef refactor_unary_parser<BinaryT, NestedT> self_t;
typedef refactor_unary_gen<NestedT> parser_generator_t;
typedef typename BinaryT::left_t::parser_category_t parser_category_t;
template <typename ScannerT>
typename parser_result<self_t, ScannerT>::type
parse(ScannerT const& scan) const
{
return impl::refactor_unary_type<NestedT>::
parse(*this, scan, binary, nested);
}
private:
typename as_parser<BinaryT>::type::embed_t binary;
typename NestedT::embed_t nested;
};
//////////////////////////////////
template <typename NestedT>
class refactor_unary_gen {
public:
typedef refactor_unary_gen<NestedT> embed_t;
refactor_unary_gen(NestedT const& nested_ = non_nested_refactoring())
: nested(nested_) {}
template <typename ParserT>
refactor_unary_parser<ParserT, NestedT>
operator[](parser<ParserT> const& subject) const
{
return refactor_unary_parser<ParserT, NestedT>
(subject.derived(), nested);
}
private:
typename NestedT::embed_t nested;
};
const refactor_unary_gen<> refactor_unary_d = refactor_unary_gen<>();
///////////////////////////////////////////////////////////////////////////////
//
// refactor_action_parser class
//
// This helper template allows to attach an action taken from the left
// operand of the given binary parser to a newly constructed parser,
// which combines the subject of the left operand of the original binary
// parser with the right operand of the original binary parser by means of
// the original binary operator parser.
//
// For instance the parser:
// some_parser[some_attached_functor] - another_parser
//
// will be refactored to:
// (some_parser - another_parser)[some_attached_functor]
//
// If the left operand to refactor is not an action parser, no refactoring
// is done at all.
//
// The original parser should be a binary_parser_category parser,
// else the compilation will fail
//
///////////////////////////////////////////////////////////////////////////////
template <typename NestedT = non_nested_refactoring>
class refactor_action_gen;
template <typename BinaryT, typename NestedT = non_nested_refactoring>
class refactor_action_parser :
public parser<refactor_action_parser<BinaryT, NestedT> > {
public:
// the parser to refactor has to be at least a binary_parser_category
// parser
BOOST_STATIC_ASSERT((
boost::is_convertible<typename BinaryT::parser_category_t,
binary_parser_category>::value
));
refactor_action_parser(BinaryT const& binary_, NestedT const& nested_)
: binary(binary_), nested(nested_) {}
typedef refactor_action_parser<BinaryT, NestedT> self_t;
typedef refactor_action_gen<NestedT> parser_generator_t;
typedef typename BinaryT::left_t::parser_category_t parser_category_t;
template <typename ScannerT>
typename parser_result<self_t, ScannerT>::type
parse(ScannerT const& scan) const
{
return impl::refactor_action_type<NestedT>::
parse(*this, scan, binary, nested);
}
private:
typename as_parser<BinaryT>::type::embed_t binary;
typename NestedT::embed_t nested;
};
//////////////////////////////////
template <typename NestedT>
class refactor_action_gen {
public:
typedef refactor_action_gen<NestedT> embed_t;
refactor_action_gen(NestedT const& nested_ = non_nested_refactoring())
: nested(nested_) {}
template <typename ParserT>
refactor_action_parser<ParserT, NestedT>
operator[](parser<ParserT> const& subject) const
{
return refactor_action_parser<ParserT, NestedT>
(subject.derived(), nested);
}
private:
typename NestedT::embed_t nested;
};
const refactor_action_gen<> refactor_action_d = refactor_action_gen<>();
///////////////////////////////////////////////////////////////////////////////
//
// attach_action_parser class
//
// This helper template allows to attach an action given separately
// to to all parsers, out of which the given parser is constructed and
// reconstructs a new parser having the same structure.
//
// For instance the parser:
// (some_parser >> another_parser)[some_attached_functor]
//
// will be refactored to:
// some_parser[some_attached_functor]
// >> another_parser[some_attached_functor]
//
// The original parser should be a action_parser_category parser,
// else the compilation will fail
//
// If the parser, to which the action is attached is not an binary parser,
// no refactoring is done at all.
//
///////////////////////////////////////////////////////////////////////////////
template <typename NestedT = non_nested_refactoring>
class attach_action_gen;
template <typename ActionT, typename NestedT = non_nested_refactoring>
class attach_action_parser :
public parser<attach_action_parser<ActionT, NestedT> > {
public:
// the parser to refactor has to be at least a action_parser_category
// parser
BOOST_STATIC_ASSERT((
boost::is_convertible<typename ActionT::parser_category_t,
action_parser_category>::value
));
attach_action_parser(ActionT const& actor_, NestedT const& nested_)
: actor(actor_), nested(nested_) {}
typedef attach_action_parser<ActionT, NestedT> self_t;
typedef attach_action_gen<NestedT> parser_generator_t;
typedef typename ActionT::parser_category_t parser_category_t;
template <typename ScannerT>
typename parser_result<self_t, ScannerT>::type
parse(ScannerT const& scan) const
{
return impl::attach_action_type<NestedT>::
parse(*this, scan, actor, nested);
}
private:
typename as_parser<ActionT>::type::embed_t actor;
typename NestedT::embed_t nested;
};
//////////////////////////////////
template <typename NestedT>
class attach_action_gen {
public:
typedef attach_action_gen<NestedT> embed_t;
attach_action_gen(NestedT const& nested_ = non_nested_refactoring())
: nested(nested_) {}
template <typename ParserT, typename ActionT>
attach_action_parser<action<ParserT, ActionT>, NestedT>
operator[](action<ParserT, ActionT> const& actor) const
{
return attach_action_parser<action<ParserT, ActionT>, NestedT>
(actor, nested);
}
private:
typename NestedT::embed_t nested;
};
const attach_action_gen<> attach_action_d = attach_action_gen<>();
#if BOOST_WORKAROUND(BOOST_MSVC, >= 1400)
#pragma warning(pop)
#endif
///////////////////////////////////////////////////////////////////////////////
BOOST_SPIRIT_CLASSIC_NAMESPACE_END
}} // namespace BOOST_SPIRIT_CLASSIC_NS
#endif // BOOST_SPIRIT_REFACTORING_HPP
```
|
```ruby
# frozen_string_literal: true
module Decidim
module Admin
module Import
# This is an abstract class with a very naive default implementation
# for the importers to use. It can also serve as a superclass of your
# own implementation.
#
# It is used to be run against each element of an importable collection
# in order to parse relevant fields. Every import should specify their
# own creator or this default will be used.
class Creator
class << self
# Returns the resource class to be created with the provided data.
def resource_klass
raise NotImplementedError, "#{self.class.name} does not define resource class"
end
# Returns the verifier class to be used to ensure the data is valid
# for the import.
def verifier_klass
Decidim::Admin::Import::Verifier
end
def required_headers
[]
end
def localize_headers(header, locales)
@localize_headers ||= locales.map do |locale|
:"#{header}/#{locale}"
end
end
end
attr_reader :data
# Initializes the creator with a resource.
#
# data - The data hash to parse.
# context - The context needed by the producer
def initialize(data, context = nil)
@data = data
@context = context
end
# Can be used to convert the data hash to the resource attributes in
# case the data hash to be imported has different column names than the
# resource object to be created of it.
#
# By default returns the data hash but can be implemented by each creator
# implementation.
#
# Returns the resource attributes to be passed for the constructor.
def resource_attributes
@data
end
# Public: Returns a created object with the parsed data.
#
# Returns a target object.
def produce
self.class.resource_klass.new(resource_attributes)
end
def finish!
resource.save!
end
protected
attr_reader :context
def resource
raise NotImplementedError, "#{self.class.name} does not define resource"
end
#
# Collect field's language specified cells to one hash
#
# field - The field name eg. "title"
# locales - Available locales
#
# Returns the hash including locale-imported_data pairs. eg. {en: "Heading", ca: "Cap", es: "Bveda"}
#
def locale_hasher(field, locales)
hash = {}
locales.each do |locale|
parsed = data[:"#{field}/#{locale}"]
hash[locale] = parsed unless parsed.nil?
end
hash
end
end
end
end
end
```
|
Skilurus, or Scylurus, was a renowned Scythian king reigning during the 2nd century BC. His realm included the lower reaches of the Borysthenes and Hypanis, as well as the northern part of Crimea, where his capital, Scythian Neapolis, was situated.
Skilurus ruled over the Tauri and controlled the ancient trade emporium of Pontic Olbia, where he minted coins. In order to gain advantage against Chersonesos, he allied himself with the Sarmatian tribe of Rhoxolani. In response, Chersonesos forged an alliance with Mithridates VI of Pontus. Skilurus died during a war against Mithridates, a decisive conflict for supremacy in the Pontic steppe. Soon after his death, the Scythians were defeated by Mithridates (ca. 108 BC). Either Skilurus or his son and successor Palacus were buried in a mausoleum at Scythian Neapolis; it was used from ca. 100 BC to ca. 100 AD.
Pseudo-Plutarch, in Sayings of Kings and Commanders, reports the following version of the Aesopic fable "The Old Man and his Sons": "Scilurus on his death-bed, being about to leave eighty sons surviving, offered a bundle of darts to each of them, and bade them break them. When all refused, drawing out one by one, he easily broke them; thus teaching them that, if they held together, they would continue strong, but if they fell out and were divided, they would become weak." cf. "Unity makes strength”.
References
Content of this page in part derives from the Great Soviet Encyclopedia article on the same subject.
Scythian kings
Ancient Crimea
2nd-century BC monarchs
2nd-century BC Iranian people
|
Villexavier is a commune in the Charente-Maritime department in the Nouvelle-Aquitaine region in southwestern France.
Population
See also
Communes of the Charente-Maritime department
References
External links
Communes of Charente-Maritime
Charente-Maritime communes articles needing translation from French Wikipedia
|
```java
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package org.graalvm.visualvm.lib.ui;
import java.awt.*;
/** Various UI Constants used in the JFluid UI
*
* @author Ian Formanek
*/
public interface UIConstants {
//~ Static fields/initializers your_sha256_hash-------------------------------
/** Color used to draw vertical gridlines in JTables */
public static final Color TABLE_VERTICAL_GRID_COLOR = !UIUtils.isDarkResultsBackground() ?
new Color(214, 223, 247) : new Color(84, 93, 117);
/** if true, results tables display the horizontal grid lines */
public static final boolean SHOW_TABLE_HORIZONTAL_GRID = false;
/** if true, results tables display the vertical grid lines */
public static final boolean SHOW_TABLE_VERTICAL_GRID = true;
/** Color used for painting selected cell background in JTables */
public static final Color TABLE_SELECTION_BACKGROUND_COLOR = new Color(193, 210, 238); //(253, 249, 237)
/** Color used for painting selected cell foreground in JTables */
public static final Color TABLE_SELECTION_FOREGROUND_COLOR = Color.BLACK;
public static final int TABLE_ROW_MARGIN = 0;
public static final String PROFILER_PANELS_BACKGROUND = "ProfilerPanels.background"; // NOI18N
}
```
|
Unión de Tenerife (also known as Real Unión de Tenerife Tacuense) is a Spanish women's football team based in Tenerife that play in Segunda División Pro. It is the women's section of Real Unión de Tenerife. They were founded in 1998, and currently plays their home matches at the Campo de Fútbol Pablos Abril.
History
In 2002 UD Tacuense promoted to Segunda División. Fourteen seasons later, on 22 June 2016, Tacuense promoted to Primera División. They were relegated again at the end of the 2016–17 Primera División season.
On 12 August 2020, Tacuense merged with Real Unión de Tenerife and was integrated into its structure. In its first season, the main women's squad will play with the name of "Real Unión de Tenerife Tacuense".
Season to season
References
External links
Official website
Women's football clubs in Spain
Football clubs in the Canary Islands
Sport in Tenerife
Association football clubs established in 1998
Segunda Federación (women) clubs
Liga F clubs
|
```smalltalk
using System;
using System.Collections.Generic;
#if (NETFX_CORE || WINDOWS_UWP)
using Windows.UI.Xaml;
using Windows.UI.Xaml.Data;
#else
using System.Windows;
#endif
namespace MahApps.Metro.IconPacks
{
/// <summary>
/// All icons sourced from Material Design Icons Font <see><cref>path_to_url
/// </summary>
public class PackIconMaterial : PackIconControlBase
{
public static readonly DependencyProperty KindProperty
= DependencyProperty.Register(nameof(Kind), typeof(PackIconMaterialKind), typeof(PackIconMaterial), new PropertyMetadata(default(PackIconMaterialKind), KindPropertyChangedCallback));
private static void KindPropertyChangedCallback(DependencyObject dependencyObject, DependencyPropertyChangedEventArgs e)
{
if (e.NewValue != e.OldValue)
{
((PackIconMaterial)dependencyObject).UpdateData();
}
}
/// <summary>
/// Gets or sets the icon to display.
/// </summary>
public PackIconMaterialKind Kind
{
get { return (PackIconMaterialKind)GetValue(KindProperty); }
set { SetValue(KindProperty, value); }
}
#if !(NETFX_CORE || WINDOWS_UWP)
static PackIconMaterial()
{
DefaultStyleKeyProperty.OverrideMetadata(typeof(PackIconMaterial), new FrameworkPropertyMetadata(typeof(PackIconMaterial)));
}
#endif
public PackIconMaterial()
{
#if NETFX_CORE || WINDOWS_UWP
this.DefaultStyleKey = typeof(PackIconMaterial);
#endif
}
protected override void SetKind<TKind>(TKind iconKind)
{
#if NETFX_CORE || WINDOWS_UWP
BindingOperations.SetBinding(this, PackIconMaterial.KindProperty, new Binding() { Source = iconKind, Mode = BindingMode.OneTime });
#else
this.SetCurrentValue(KindProperty, iconKind);
#endif
}
protected override void UpdateData()
{
if (Kind != default(PackIconMaterialKind))
{
string data = null;
PackIconDataFactory<PackIconMaterialKind>.DataIndex.Value?.TryGetValue(Kind, out data);
this.Data = data;
}
else
{
this.Data = null;
}
}
}
}
```
|
Irwin Thornton Catharine (October 22, 1883 – March 3, 1944) was the chief architect of Philadelphia public schools from 1920 until his retirement in 1937. Buildings built during Catharine's tenure ranged from Gothic Revival, as in the case of Simon Gratz High School, to Streamline Moderne, as in his last project, Joseph H. Brown Elementary School. He died in Philadelphia in 1944.
Catharine succeeded Henry deCoursey Richards as the main school designer in Philadelphia. From 1918 to 1937, his work added 104 new buildings (replacing 37 existing ones), added wings to 26 other schools, and otherwise improved at least 50 other schools.
A number of his works are listed on the U.S. National Register of Historic Places.
Works
Catharine's works (all in Philadelphia) include the following. If Catharine has notable works outside of Philadelphia, none are listed on the National Register.
Universal Alcorn Charter Elementary School, (1931), 1500 S. 32nd St., NRHP-listed
Ethan Allen School, 3001 Robbins Ave., NRHP-listed
Charles Y. Audenried Junior High School, 1601 S. 33rd St., NRHP-listed
Clara Barton School, 300 E. Wyoming Ave., NRHP-listed
John Bartram High School, 67th and Elmwood Sts., NRHP-listed
Dimner Beeber Middle School, 5901 Malvern Ave., NRHP-listed
Belmont Charter School, 4030-4060 Brown St., NRHP-listed
Rudolph Blankenburg School, 4600 Girard Ave., NRHP-listed
Board of Education Building, 21st St. and Benjamin Franklin Pkwy., NRHP-listed
Edward Bok Vocational School, 1909 S. Ninth St., NRHP-listed
Daniel Boone School, Hancock and Wildey Sts., NRHP-listed
F. Amadee Bregy School, 1700 Bigler St., NRHP-listed
Joseph H. Brown School, 8118-8120 Frankford Ave., NRHP-listed
Laura H. Carnell School, 6101 Summerdale Ave., NRHP-listed
Lewis C. Cassidy School, 6523-6543 Lansdowne Ave., NRHP-listed
Castor Gardens Middle School, Cottman Ave. and Loretta St., NRHP-listed
Joseph W. Catharine School, 6600 Chester Ave., NRHP-listed
Central High School, Olney and Ogontz Aves., Logan neighborhood of Philadelphia, NRHP-listed
Conwell Middle Magnet School, 1829-1951 E. Clearfield St., NRHP-listed
Jay Cooke Junior High School, 4735 Old York Rd., NRHP-listed
Thomas Creighton School, 5401 Tabor Rd., NRHP-listed
Kennedy Crossan School, 7341 Palmetto St., NRHP-listed
Lydia Darrah School, 708-732 N. 17th St., NRHP-listed
Hamilton Disston School, 6801 Cottage St., NRHP-listed
Murrell Dobbins Vocational School, 2100 Lehigh Ave., NRHP-listed
James Dobson School, 4665 Umbria St., NRHP-listed
Laurence Dunbar School, 12th above Columbia Ave., NRHP-listed
Henry R. Edmunds School, 1101-1197 Haworth St., NRHP-listed
James Elverson, Jr. School, 1300 Susquehanna Ave., NRHP-listed
Eleanor Cope Emlen School of Practice, 6501 Chew St., NRHP-listed
Federal Street School, 1130-1148 Federal St., NRHP-listed
D. Newlin Fell School, 900 Oregon Ave., NRHP-listed
Joseph C. Ferguson School, 2000-2046 7th St., NRHP-listed
Thomas K. Finletter School, 6101 N. Front St., NRHP-listed
Thomas Fitzsimons Junior High School, 2601 W. Cumberland St., NRHP-listed
Edwin Forrest School, 4300 Bleigh St., NRHP-listed
Robert Fulton School, 60-68 E. Haines St., NRHP-listed
Elizabeth Duane Gillespie Junior High School, 3901-3961 N. 18th St., NRHP-listed
Simon Gratz High School, 3901-3961 N. 18th St., NRHP-listed
Warren G. Harding Junior High School, 2000 Wakeling St., NRHP-listed
William H. Harrison School, 1012-1020 W. Thompson St., NRHP-listed
Francis Hopkinson School, 1301-1331 E. Luzerne Ave., NRHP-listed
Henry H. Houston School, 135 W. Allen's Ln., NRHP-listed
Thomas Jefferson School, 1101-1125 N. 4th St., NRHP-listed
John Story Jenks School, 8301-8317 Germantown Ave., NRHP-listed
John Paul Jones Junior High School, 2922 Memphis St., NRHP-listed
Eliza Butler Kirkbride School, 626 Dickinson St., NRHP-listed
Logan Demonstration School, 5000 N. 17th St., NRHP-listed
James R. Ludlow School, 1323-1345 N. 6th St., NRHP-listed
William Mann School, 1835-1869 N. 54th St., NRHP-listed
Martin Orthopedic School, 800 N. 22nd St., NRHP-listed
Delaplaine McDaniel School, 2100 Moore St., NRHP-listed
George Meade School, 1801 Oxford St., NRHP-listed
William M. Meredith School, 5th and Fitzwater Sts., NRHP-listed
Thomas Mifflin School, 3500 Midvale Ave., NRHP-listed
Andrew J. Morrison School, 300 Duncannon St., NRHP-listed
George W. Nebinger School, 601-627 Carpenter St., NRHP-listed
Jeremiah Nichols School, 1235 S. 16th St., NRHP-listed
Olney High School, Duncannon and Front Sts., NRHP-listed
Overbrook High School, 59th and Lancaster Ave., NRHP-listed
Academy at Palumbo, 1100 Catharine St., NRHP-listed
John M. Patterson School, 7001 Buist Ave., NRHP-listed
William S. Peirce School, 2400 Christian St., NRHP-listed
Penn Treaty Junior High School, 600 E. Thompson St., NRHP-listed
Joseph Pennell School, 1800-1856 Nedro St., NRHP-listed
Samuel W. Pennypacker School, 1800-1850 E. Washington Ln., NRHP-listed
Philadelphia High School for Girls (now Julia R. Masterman School), 17th and Spring Garden Sts., NRHP-listed
Gen. John F. Reynolds School, 2300 Jefferson St., NRHP-listed
Richmond School, 2942 Belgrade St., NRHP-listed
Theodore Roosevelt Junior High School, 430 E. Washington Ln., NRHP-listed
William Rowen School, 6801 N. 19th St., NRHP-listed
Anna Howard Shaw Junior High School, 5401 Warrington St., NRHP-listed
William Shoemaker Junior High School, 1464-1488 N. 53rd St., NRHP-listed
Franklin Smedley School, 5199 Mulberry St., NRHP-listed
Walter George Smith School, 1300 S. 19th St., NRHP-listed
Spring Garden School No. 1, 12th and Ogden Sts., NRHP-listed
Spring Garden School No. 2, Melon St. S of 12th St., NRHP-listed
Edwin M. Stanton School, 1616-1644 Christian St., NRHP-listed
Thaddeus Stevens School of Observation, 1301 Spring Garden St., NRHP-listed
James J. Sullivan School, 5300 Ditman St., NRHP-listed
Mayer Sulzberger Junior High School, 701-741 N. 48th St., NRHP-listed
George C. Thomas Junior High School, 2746 S. 9th St., NRHP-listed
William J. Tilden Junior High School, 66th St. and Elmwood Ave., NRHP-listed
Edwin H. Vare Junior High School, 2102 S. 24th St., NRHP-listed
Roberts Vaux Junior High School, 230-2344 W. Master St., NRHP-listed
Gen. Louis Wagner Junior High School, 17th and Chelton Sts., NRHP-listed
George Washington School, 5th and Federal Sts., NRHP-listed
Mary Channing Wister School, 843-855 N. 8th St., NRHP-listed
George Wolf School, 8100 Lyons Ave., NRHP-listed
References
1883 births
1944 deaths
20th-century American architects
Streamline Moderne architects
Architects from Philadelphia
|
```objective-c
//===-- WatchpointOptions.h -------------------------------------*- C++ -*-===//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
#ifndef LLDB_BREAKPOINT_WATCHPOINTOPTIONS_H
#define LLDB_BREAKPOINT_WATCHPOINTOPTIONS_H
#include <memory>
#include <string>
#include "lldb/Utility/Baton.h"
#include "lldb/Utility/StringList.h"
#include "lldb/lldb-private.h"
namespace lldb_private {
/// \class WatchpointOptions WatchpointOptions.h
/// "lldb/Breakpoint/WatchpointOptions.h" Class that manages the options on a
/// watchpoint.
class WatchpointOptions {
public:
// Constructors and Destructors
/// Default constructor. The watchpoint is enabled, and has no condition,
/// callback, ignore count, etc...
WatchpointOptions();
WatchpointOptions(const WatchpointOptions &rhs);
static WatchpointOptions *CopyOptionsNoCallback(WatchpointOptions &rhs);
/// This constructor allows you to specify all the watchpoint options.
///
/// \param[in] callback
/// This is the plugin for some code that gets run, returns \b true if we
/// are to stop.
///
/// \param[in] baton
/// Client data that will get passed to the callback.
///
/// \param[in] thread_id
/// Only stop if \a thread_id hits the watchpoint.
WatchpointOptions(WatchpointHitCallback callback, void *baton,
lldb::tid_t thread_id = LLDB_INVALID_THREAD_ID);
virtual ~WatchpointOptions();
// Operators
const WatchpointOptions &operator=(const WatchpointOptions &rhs);
// Callbacks
//
// Watchpoint callbacks come in two forms, synchronous and asynchronous.
// Synchronous callbacks will get run before any of the thread plans are
// consulted, and if they return false the target will continue "under the
// radar" of the thread plans. There are a couple of restrictions to
// synchronous callbacks: 1) They should NOT resume the target themselves.
// Just return false if you want the target to restart. 2) Watchpoints with
// synchronous callbacks can't have conditions (or rather, they can have
// them, but they
// won't do anything. Ditto with ignore counts, etc... You are supposed
// to control that all through the
// callback.
// Asynchronous callbacks get run as part of the "ShouldStop" logic in the
// thread plan. The logic there is:
// a) If the watchpoint is thread specific and not for this thread, continue
// w/o running the callback.
// b) If the ignore count says we shouldn't stop, then ditto.
// c) If the condition says we shouldn't stop, then ditto.
// d) Otherwise, the callback will get run, and if it returns true we will
// stop, and if false we won't.
// The asynchronous callback can run the target itself, but at present that
// should be the last action the
// callback does. We will relax this condition at some point, but it will
// take a bit of plumbing to get
// that to work.
//
/// Adds a callback to the watchpoint option set.
///
/// \param[in] callback
/// The function to be called when the watchpoint gets hit.
///
/// \param[in] baton_sp
/// A baton which will get passed back to the callback when it is invoked.
///
/// \param[in] synchronous
/// Whether this is a synchronous or asynchronous callback. See discussion
/// above.
void SetCallback(WatchpointHitCallback callback,
const lldb::BatonSP &baton_sp, bool synchronous = false);
/// Remove the callback from this option set.
void ClearCallback();
// The rest of these functions are meant to be used only within the
// watchpoint handling mechanism.
/// Use this function to invoke the callback for a specific stop.
///
/// \param[in] context
/// The context in which the callback is to be invoked. This includes the
/// stop event, the
/// execution context of the stop (since you might hit the same watchpoint
/// on multiple threads) and
/// whether we are currently executing synchronous or asynchronous
/// callbacks.
///
/// \param[in] watch_id
/// The watchpoint ID that owns this option set.
///
/// \return
/// The callback return value.
bool InvokeCallback(StoppointCallbackContext *context,
lldb::user_id_t watch_id);
/// Used in InvokeCallback to tell whether it is the right time to run this
/// kind of callback.
///
/// \return
/// The synchronicity of our callback.
bool IsCallbackSynchronous() { return m_callback_is_synchronous; }
/// Fetch the baton from the callback.
///
/// \return
/// The baton.
Baton *GetBaton();
/// Fetch a const version of the baton from the callback.
///
/// \return
/// The baton.
const Baton *GetBaton() const;
/// Return the current thread spec for this option. This will return nullptr
/// if the no thread specifications have been set for this Option yet.
/// \return
/// The thread specification pointer for this option, or nullptr if none
/// has
/// been set yet.
const ThreadSpec *GetThreadSpecNoCreate() const;
/// Returns a pointer to the ThreadSpec for this option, creating it. if it
/// hasn't been created already. This API is used for setting the
/// ThreadSpec items for this option.
ThreadSpec *GetThreadSpec();
void SetThreadID(lldb::tid_t thread_id);
void GetDescription(Stream *s, lldb::DescriptionLevel level) const;
/// Get description for callback only.
void GetCallbackDescription(Stream *s, lldb::DescriptionLevel level) const;
/// Returns true if the watchpoint option has a callback set.
bool HasCallback();
/// This is the default empty callback.
/// \return
/// The thread id for which the watchpoint hit will stop,
/// LLDB_INVALID_THREAD_ID for all threads.
static bool NullCallback(void *baton, StoppointCallbackContext *context,
lldb::user_id_t watch_id);
struct CommandData {
CommandData() = default;
~CommandData() = default;
StringList user_source;
std::string script_source;
bool stop_on_error = true;
};
class CommandBaton : public TypedBaton<CommandData> {
public:
CommandBaton(std::unique_ptr<CommandData> Data)
: TypedBaton(std::move(Data)) {}
void GetDescription(llvm::raw_ostream &s, lldb::DescriptionLevel level,
unsigned indentation) const override;
};
protected:
// Classes that inherit from WatchpointOptions can see and modify these
private:
// For WatchpointOptions only
WatchpointHitCallback m_callback; // This is the callback function pointer
lldb::BatonSP m_callback_baton_sp; // This is the client data for the callback
bool m_callback_is_synchronous = false;
std::unique_ptr<ThreadSpec>
m_thread_spec_up; // Thread for which this watchpoint will take
};
} // namespace lldb_private
#endif // LLDB_BREAKPOINT_WATCHPOINTOPTIONS_H
```
|
```c
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
// collecting sum Runtime: O(len(queries)), Space: O(1)
int* sumEvenAfterQueries(int* nums, int numsSize, int** queries, int queriesSize, int* queriesColSize, int* returnSize){
int summ = 0;
int* result = malloc(queriesSize * sizeof(int));
*returnSize = queriesSize;
for(int i = 0; i < numsSize; i++){
if (nums[i] % 2 == 0) {
summ += nums[i];
}
}
for(int i = 0; i < queriesSize; i++){
int* query = queries[i];
int val = query[0];
int index = query[1];
// sub index value from summ if it's even
if (nums[index] % 2 == 0) {
summ -= nums[index];
}
// modify the nums[index] value
nums[index] += val;
// add index value from summ if it's even
if (nums[index] % 2 == 0) {
summ += nums[index];
}
result[i] = summ;
}
return result;
}
```
|
Back from the Abyss is the eighth studio album by British heavy metal band Orange Goblin. It was recorded at The Animal Farm (London), and it was released on 6 October 2014 in Europe and 7 October 2014 in the United States under the label Candlelight Records. The album received positive reviews from Blabbermouth and Metal Injection.
Track listing
"Sabbath Hex" – 4:47
"Übermensch" – 3:57
"The Devil's Whip" – 2:15
"Demon Blues" – 4:40
"Heavy Lies the Crown" – 6:19
"Into the Arms of Morpheus" – 7:07
"Mythical Knives" – 4:48
"Bloodzilla" – 4:10
"The Abyss" – 5:33
"Titan" – 1:59
"Blood of Them" – 5:47
"The Shadow Over Innsmouth" – 2:53
Personnel
Ben Ward – vocals
Joe Hoare – guitar
Chris Turner – drums
Martyn Millard – bass
References
2014 albums
Orange Goblin albums
Candlelight Records albums
|
ZIP is an archive file format that supports lossless data compression. A ZIP file may contain one or more files or directories that may have been compressed. The ZIP file format permits a number of compression algorithms, though DEFLATE is the most common. This format was originally created in 1989 and was first implemented in PKWARE, Inc.'s PKZIP utility, as a replacement for the previous ARC compression format by Thom Henderson. The ZIP format was then quickly supported by many software utilities other than PKZIP. Microsoft has included built-in ZIP support (under the name "compressed folders") in versions of Microsoft Windows since 1998 via the "Plus! 98" addon for Windows 98. Native support was added as of the year 2000 in Windows ME. Apple has included built-in ZIP support in Mac OS X 10.3 (via BOMArchiveHelper, now Archive Utility) and later. Most free operating systems have built in support for ZIP in similar manners to Windows and Mac OS X.
ZIP files generally use the file extensions or and the MIME media type . ZIP is used as a base file format by many programs, usually under a different name. When navigating a file system via a user interface, graphical icons representing ZIP files often appear as a document or other object prominently featuring a zipper.
History
The file format was designed by Phil Katz of PKWARE and Gary Conway of Infinity Design Concepts. The format was created after Systems Enhancement Associates (SEA) filed a lawsuit against PKWARE claiming that the latter's archiving products, named PKARC, were derivatives of SEA's ARC archiving system. The name "zip" (meaning "move at high speed") was suggested by Katz's friend, Robert Mahoney. They wanted to imply that their product would be faster than ARC and other compression formats of the time. By distributing the zip file format within APPNOTE.TXT, compatibility with the zip file format proliferated widely on the public Internet during the 1990s.
PKWARE and Infinity Design Concepts made a joint press release on February 14, 1989, releasing the file format into the public domain.
Version history
The .ZIP File Format Specification has its own version number, which does not necessarily correspond to the version numbers for the PKZIP tool, especially with PKZIP 6 or later. At various times, PKWARE has added preliminary features that allow PKZIP products to extract archives using advanced features, but PKZIP products that create such archives are not made available until the next major release. Other companies or organizations support the PKWARE specifications at their own pace.
The .ZIP file format specification is formally named "APPNOTE - .ZIP File Format Specification" and it is published on the PKWARE.com website since the late 1990s. Several versions of the specification were not published. Specifications of some features such as BZIP2 compression, strong encryption specification and others were published by PKWARE a few years after their creation. The URL of the online specification was changed several times on the PKWARE website.
A summary of key advances in various versions of the PKWARE specification:
2.0: (1993) File entries can be compressed with DEFLATE and use traditional PKWARE encryption (ZipCrypto).
2.1: (1996) Deflate64 compression
4.5: (2001) Documented 64-bit zip format.
4.6: (2001) BZIP2 compression (not published online until the publication of APPNOTE 5.2)
5.0: (2002) SES: DES, Triple DES, RC2, RC4 supported for encryption (not published online until the publication of APPNOTE 5.2)
5.2: (2003) AES encryption support for SES (defined in APPNOTE 5.1 that was not published online) and AES from WinZip ("AE-x"); corrected version of RC2-64 supported for SES encryption.
6.1: (2004) Documented certificate storage.
6.2.0: (2004) Documented Central Directory Encryption.
6.3.0: (2006) Documented Unicode (UTF-8) filename storage. Expanded list of supported compression algorithms (LZMA, PPMd+), encryption algorithms (Blowfish, Twofish), and hashes.
6.3.1: (2007) Corrected standard hash values for SHA-256/384/512.
6.3.2: (2007) Documented compression method 97 (WavPack).
6.3.3: (2012) Document formatting changes to facilitate referencing the PKWARE Application Note from other standards using methods such as the JTC 1 Referencing Explanatory Report (RER) as directed by JTC 1/SC 34 N 1621.
6.3.4: (2014) Updates the PKWARE, Inc. office address.
6.3.5: (2018) Documented compression methods 16, 96 and 99, DOS timestamp epoch and precision, added extra fields for keys and decryption, as well as typos and clarifications.
6.3.6: (2019) Corrected typographical error.
6.3.7: (2020) Added Zstandard compression method ID 20.
6.3.8: (2020) Moved Zstandard compression method ID from 20 to 93, deprecating the former. Documented method IDs 94 and 95 (MP3 and XZ respectively).
6.3.9: (2020) Corrected a typo in Data Stream Alignment description.
6.3.10: (2022) Added several z/OS attribute values for APPENDIX B. Added several additional 3rd party Extra Field mappings.
WinZip, starting with version 12.1, uses the extension for ZIP files that use compression methods newer than DEFLATE; specifically, methods BZip, LZMA, PPMd, Jpeg and Wavpack. The last 2 are applied to appropriate file types when "Best method" compression is selected.
Standardization
In April 2010, ISO/IEC JTC 1 initiated a ballot to determine whether a project should be initiated to create an ISO/IEC International Standard format compatible with ZIP. The proposed project, entitled Document Packaging, envisaged a ZIP-compatible 'minimal compressed archive format' suitable for use with a number of existing standards including OpenDocument, Office Open XML and EPUB.
In 2015, ISO/IEC 21320-1 "Document Container File — Part 1: Core" was published which states that "Document container files are conforming Zip files". It requires the following main restrictions of the ZIP file format:
Files in ZIP archives may only be stored uncompressed, or using the "deflate" compression (i.e. compression method may contain the value "0" - stored or "8" - deflated).
The encryption features are prohibited.
The digital signature features (from SES) are prohibited.
The "patched data" features (from PKPatchMaker) are prohibited.
Archives may not span multiple volumes or be segmented.
Design
files are archives that store multiple files. ZIP allows contained files to be compressed using many different methods, as well as simply storing a file without compressing it. Each file is stored separately, allowing different files in the same archive to be compressed using different methods. Because the files in a ZIP archive are compressed individually, it is possible to extract them, or add new ones, without applying compression or decompression to the entire archive. This contrasts with the format of compressed tar files, for which such random-access processing is not easily possible.
A directory is placed at the end of a ZIP file. This identifies what files are in the ZIP and identifies where in the ZIP that file is located. This allows ZIP readers to load the list of files without reading the entire ZIP archive. ZIP archives can also include extra data that is not related to the ZIP archive. This allows for a ZIP archive to be made into a self-extracting archive (application that decompresses its contained data), by prepending the program code to a ZIP archive and marking the file as executable. Storing the catalog at the end also makes possible hiding a zipped file by appending it to an innocuous file, such as a GIF image file.
The format uses a 32-bit CRC algorithm and includes two copies of each entry metadata to provide greater protection against data loss. The CRC-32 algorithm was contributed by David Schwaderer and can be found in his book "C Programmers Guide to NetBIOS" published by Howard W. Sams & Co. Inc.
Structure
A ZIP file is correctly identified by the presence of an end of central directory record which is located at the end of the archive structure in order to allow the easy appending of new files. If the end of central directory record indicates a non-empty archive, the name of each file or directory within the archive should be specified in a central directory entry, along with other metadata about the entry, and an offset into the ZIP file, pointing to the actual entry data. This allows a file listing of the archive to be performed relatively quickly, as the entire archive does not have to be read to see the list of files. The entries within the ZIP file also include this information, for redundancy, in a local file header. Because ZIP files may be appended to, only files specified in the central directory at the end of the file are valid. Scanning a ZIP file for local file headers is invalid (except in the case of corrupted archives), as the central directory may declare that some files have been deleted and other files have been updated.
For example, we may start with a ZIP file that contains files A, B and C. File B is then deleted and C updated. This may be achieved by just appending a new file C to the end of the original ZIP file and adding a new central directory that only lists file A and the new file C. When ZIP was first designed, transferring files by floppy disk was common, yet writing to disks was very time-consuming. If you had a large zip file, possibly spanning multiple disks, and only needed to update a few files, rather than reading and re-writing all the files, it would be substantially faster to just read the old central directory, append the new files then append an updated central directory.
The order of the file entries in the central directory need not coincide with the order of file entries in the archive.
Each entry stored in a ZIP archive is introduced by a local file header with information about the file such as the comment, file size and file name, followed by optional "extra" data fields, and then the possibly compressed, possibly encrypted file data. The "Extra" data fields are the key to the extensibility of the ZIP format. "Extra" fields are exploited to support the ZIP64 format, WinZip-compatible AES encryption, file attributes, and higher-resolution NTFS or Unix file timestamps. Other extensions are possible via the "Extra" field. ZIP tools are required by the specification to ignore Extra fields they do not recognize.
The ZIP format uses specific 4-byte "signatures" to denote the various structures in the file. Each file entry is marked by a specific signature. The end of central directory record is indicated with its specific signature, and each entry in the central directory starts with the 4-byte central file header signature.
There is no BOF or EOF marker in the ZIP specification. Conventionally the first thing in a ZIP file is a ZIP entry, which can be identified easily by its local file header signature. However, this is not necessarily the case, as this is not required by the ZIP specification - most notably, a self-extracting archive will begin with an executable file header.
Tools that correctly read ZIP archives must scan for the end of central directory record signature, and then, as appropriate, the other, indicated, central directory records. They must not scan for entries from the top of the ZIP file, because (as previously mentioned in this section) only the central directory specifies where a file chunk starts and that it has not been deleted. Scanning could lead to false positives, as the format does not forbid other data to be between chunks, nor file data streams from containing such signatures. However, tools that attempt to recover data from damaged ZIP archives will most likely scan the archive for local file header signatures; this is made more difficult by the fact that the compressed size of a file chunk may be stored after the file chunk, making sequential processing difficult.
Most of the signatures end with the short integer 0x4b50, which is stored in little-endian ordering. Viewed as an ASCII string this reads "PK", the initials of the inventor Phil Katz. Thus, when a ZIP file is viewed in a text editor the first two bytes of the file are usually "PK". (DOS, OS/2 and Windows self-extracting ZIPs have an EXE before the ZIP so start with "MZ"; self-extracting ZIPs for other operating systems may similarly be preceded by executable code for extracting the archive's content on that platform.)
The specification also supports spreading archives across multiple file-system files. Originally intended for storage of large ZIP files across multiple floppy disks, this feature is now used for sending ZIP archives in parts over email, or over other transports or removable media.
The FAT filesystem of DOS has a timestamp resolution of only two seconds; ZIP file records mimic this. As a result, the built-in timestamp resolution of files in a ZIP archive is only two seconds, though extra fields can be used to store more precise timestamps. The ZIP format has no notion of time zone, so timestamps are only meaningful if it is known what time zone they were created in.
In September 2006, PKWARE released a revision of the ZIP specification providing for the storage of file names using UTF-8, finally adding Unicode compatibility to ZIP.
File headers
All multi-byte values in the header are stored in little-endian byte order. All length fields count the length in bytes.
Local file header
The extra field contains a variety of optional data such as OS-specific attributes. It is divided into records, each with at minimum a 16-bit signature and a 16-bit length. A ZIP64 local file extra field record, for example, has the signature 0x0001 and a length of 16 bytes (or more) so that two 64-bit values (the uncompressed and compressed sizes) may follow. Another common local file extension is 0x5455 (or "UT") which contains 32-bit UTC UNIX timestamps.
This is immediately followed by the compressed data.
Data descriptor
If the bit at offset 3 (0x08) of the general-purpose flags field is set, then the CRC-32 and file sizes are not known when the header is written. If the archive is in Zip64 format, the compressed and uncompressed size fields are 8 bytes long instead of 4 bytes long (see section 4.3.9.2). The equivalent fields in the local header (or in the Zip64 extended information extra field in the case of archives in Zip64 format) are filled with zero, and the CRC-32 and size are appended in a 12-byte structure (optionally preceded by a 4-byte signature) immediately after the compressed data:
Central directory file header
The central directory entry is an expanded form of the local header:
End of central directory record (EOCD)
After all the central directory entries comes the end of central directory (EOCD) record, which marks the end of the ZIP file:
This ordering allows a ZIP file to be created in one pass, but the central directory is also placed at the end of the file in order to facilitate easy removal of files from multiple-part (e.g. "multiple floppy-disk") archives, as previously discussed.
Compression methods
The .ZIP File Format Specification documents the following compression methods: Store (no compression), Shrink (LZW), Reduce (levels 1–4; LZ77 + probabilistic), Implode, Deflate, Deflate64, bzip2, LZMA, WavPack, PPMd, and a LZ77 variant provided by IBM z/OS CMPSC instruction. The most commonly used compression method is DEFLATE, which is described in IETF .
Other methods mentioned, but not documented in detail in the specification include: PKWARE DCL Implode (old IBM TERSE), new IBM TERSE, IBM LZ77 z Architecture (PFS), and a JPEG variant. A "Tokenize" method was reserved for a third party, but support was never added.
The word Implode is overused by PKWARE: the DCL/TERSE Implode is distinct from the old PKZIP Implode, a predecessor to Deflate. The DCL Implode is undocumented partially due to its proprietary nature held by IBM, but Mark Adler has nevertheless provided a decompressor called "blast" alongside zlib.
Encryption
ZIP supports a simple password-based symmetric encryption system generally known as ZipCrypto. It is documented in the ZIP specification, and known to be seriously flawed. In particular, it is vulnerable to known-plaintext attacks, which are in some cases made worse by poor implementations of random-number generators. Computers running under native Microsoft Windows without third-party archivers can open, but not create, ZIP files encrypted with ZipCrypto, but cannot extract the contents of files using different encryption.
New features including new compression and encryption (e.g. AES) methods have been documented in the ZIP File Format Specification since version 5.2. A WinZip-developed AES-based open standard ("AE-x" in APPNOTE) is used also by 7-Zip and Xceed, but some vendors use other formats. PKWARE SecureZIP (SES, proprietary) also supports RC2, RC4, DES, Triple DES encryption methods, Digital Certificate-based encryption and authentication (X.509), and archive header encryption. It is, however, patented (see ).
File name encryption is introduced in .ZIP File Format Specification 6.2, which encrypts metadata stored in Central Directory portion of an archive, but Local Header sections remain unencrypted. A compliant archiver can falsify the Local Header data when using Central Directory Encryption. As of version 6.2 of the specification, the Compression Method and Compressed Size fields within Local Header are not yet masked.
ZIP64
The original format had a 4 GB (232 bytes) limit on various things (uncompressed size of a file, compressed size of a file, and total size of the archive), as well as a limit of 65,535 (216-1) entries in a ZIP archive. In version 4.5 of the specification (which is not the same as v4.5 of any particular tool), PKWARE introduced the "ZIP64" format extensions to get around these limitations, increasing the limits to 16 EB (264 bytes). In essence, it uses a "normal" central directory entry for a file, followed by an optional "zip64" directory entry, which has the larger fields.
The format of the Local file header (LOC) and Central directory entry (CEN) are the same in ZIP and ZIP64. However, ZIP64 specifies an extra field that may be added to those records at the discretion of the compressor, whose purpose is to store values that do not fit in the classic LOC or CEN records. To signal that the actual values are stored in ZIP64 extra fields, they are set to 0xFFFF or 0xFFFFFFFF in the corresponding LOC or CEN record. If one entry does not fit into the classic LOC or CEN record, only that entry is required to be moved into a ZIP64 extra field. The other entries may stay in the classic record. Therefore, not all entries shown in the following table might be stored in a ZIP64 extra field. However, if they appear, their order must be as shown in the table.
On the other hand, the format of EOCD for ZIP64 is slightly different from the normal ZIP version.
It is also not necessarily the last record in the file. A End of Central Directory Locator follows (an additional 20 bytes at the end).
The File Explorer in Windows XP does not support ZIP64, but the Explorer in Windows Vista and later do. Likewise, some extension libraries support ZIP64, such as DotNetZip, QuaZIP and IO::Compress::Zip in Perl. Python's built-in zipfile supports it since 2.5 and defaults to it since 3.4. OpenJDK's built-in java.util.zip supports ZIP64 from version Java 7. Android Java API support ZIP64 since Android 6.0. Mac OS Sierra's Archive Utility notably does not support ZIP64, and can create corrupt archives when ZIP64 would be required. However, the ditto command shipped with Mac OS will unzip ZIP64 files. More recent versions of Mac OS ship with info-zip's zip and unzip command line tools which do support Zip64: to verify run zip -v and look for "ZIP64_SUPPORT".
Combination with other file formats
The file format allows for a comment containing up to 65,535 (216−1) bytes of data to occur at the end of the file after the central directory. Also, because the central directory specifies the offset of each file in the archive with respect to the start, it is possible for the first file entry to start at an offset other than zero, although some tools, for example gzip, will not process archive files that do not start with a file entry at offset zero.
This allows arbitrary data to occur in the file both before and after the ZIP archive data, and for the archive to still be read by a ZIP application. A side-effect of this is that it is possible to author a file that is both a working ZIP archive and another format, provided that the other format tolerates arbitrary data at its end, beginning, or middle. Self-extracting archives (SFX), of the form supported by WinZip, take advantage of this, in that they are executable () files that conform to the PKZIP AppNote.txt specification, and can be read by compliant zip tools or libraries.
This property of the format, and of the JAR format which is a variant of ZIP, can be exploited to hide rogue content (such as harmful Java classes) inside a seemingly harmless file, such as a GIF image uploaded to the web. This so-called GIFAR exploit has been demonstrated as an effective attack against web applications such as Facebook.
Limits
The minimum size of a file is 22 bytes. Such an empty zip file contains only an End of Central Directory Record (EOCD):
The maximum size for both the archive file and the individual files inside it is 4,294,967,295 bytes (232−1 bytes, or 4 GB minus 1 byte) for standard ZIP. For ZIP64, the maximum size is 18,446,744,073,709,551,615 bytes (264−1 bytes, or 16 EB minus 1 byte).
Open extensions
Seek-optimized (SOZip) profile
A Seek-Optimized ZIP file (SOZip) profile has been proposed for the ZIP format. Such file contains one or several Deflate-compressed files that are organized and annotated such that a SOZip-aware reader can perform very fast random access (seek) within a compressed file. SOZip makes it possible to access large compressed files directly from a .zip file without prior decompression. It combines the use of ZLib block flushs issued at regular interval with a hidden index file mapping offsets of the uncompressed file to offsets in the compressed stream. ZIP readers that are not aware of that extension can read a SOZip-enabled file normally and ignore the extended features that support efficient seek capability.
Proprietary extensions
Extra field
file format includes an extra field facility within file headers, which can be used to store extra data not defined by existing ZIP specifications, and which allow compliant archivers that do not recognize the fields to safely skip them. Header IDs 0–31 are reserved for use by PKWARE. The remaining IDs can be used by third-party vendors for proprietary usage.
Strong encryption controversy
When WinZip 9.0 public beta was released in 2003, WinZip introduced its own AES-256 encryption, using a different file format, along with the documentation for the new specification. The encryption standards themselves were not proprietary, but PKWARE had not updated APPNOTE.TXT to include Strong Encryption Specification (SES) since 2001, which had been used by PKZIP versions 5.0 and 6.0. WinZip technical consultant Kevin Kearney and StuffIt product manager Mathew Covington accused PKWARE of withholding SES, but PKZIP chief technology officer Jim Peterson claimed that certificate-based encryption was still incomplete.
In another controversial move, PKWare applied for a patent on 16 July 2003 describing a method for combining ZIP and strong encryption to create a secure file.
In the end, PKWARE and WinZip agreed to support each other's products. On 21 January 2004, PKWARE announced the support of WinZip-based AES compression format. In a later version of WinZip beta, it was able to support SES-based ZIP files. PKWARE eventually released version 5.2 of the .ZIP File Format Specification to the public, which documented SES. The Free Software project 7-Zip also supports AES, but not SES in ZIP files (as does its POSIX port p7zip).
When using AES encryption under WinZip, the compression method is always set to 99, with the actual compression method stored in an AES extra data field. In contrast, Strong Encryption Specification stores the compression method in the basic file header segment of Local Header and Central Directory, unless Central Directory Encryption is used to mask/encrypt metadata.
Implementation
There are numerous tools available, and numerous libraries for various programming environments; licenses used include proprietary and free software. WinZip, WinRAR, Info-ZIP, ZipGenius, 7-Zip, PeaZip and B1 Free Archiver are well-known tools, available on various platforms. Some of those tools have library or programmatic interfaces.
Some development libraries licensed under open source agreement are libzip, libarchive, and Info-ZIP. For Java: Java Platform, Standard Edition contains the package "java.util.zip" to handle standard files; the Zip64File library specifically supports large files (larger than 4 GB) and treats files using random access; and the Apache Ant tool contains a more complete implementation released under the Apache Software License.
The Info-ZIP implementations of the format adds support for Unix filesystem features, such as user and group IDs, file permissions, and support for symbolic links. The Apache Ant implementation is aware of these to the extent that it can create files with predefined Unix permissions. The Info-ZIP implementations also know how to use the error correction capabilities built into the compression format. Some programs do not, and will fail on a file that has errors.
The Info-ZIP Windows tools also support NTFS filesystem permissions, and will make an attempt to translate from NTFS permissions to Unix permissions or vice versa when extracting files. This can result in potentially unintended combinations, e.g. .exe files being created on NTFS volumes with executable permission denied.
Versions of Microsoft Windows have included support for compression in Explorer since the Microsoft Plus! pack was released for Windows 98. Microsoft calls this feature "Compressed Folders". Not all features are supported by the Windows Compressed Folders capability. For example, encryption is not supported in Windows 10 Home edition, although it can decrypt. Unicode entry encoding is not supported until Windows 7, while split and spanned archives are not readable or writable by the Compressed Folders feature, nor is AES Encryption supported.
OpenDocument Format (ODF) started using the zip archive format in 2005, ODF is an open format for office documents of all types, this is the default file format used in Collabora Online, LibreOffice and others. Microsoft Office started using the zip archive format in 2006 for their Office Open XML .docx, .xlsx, .pptx, etc. files, which became the default file format with Microsoft Office 2007.
Legacy
There are numerous other standards and formats using "zip" as part of their name. For example, zip is distinct from gzip, and the latter is defined in IETF . Both zip and gzip primarily use the DEFLATE algorithm for compression. Likewise, the ZLIB format (IETF ) also uses the DEFLATE compression algorithm, but specifies different headers for error and consistency checking. Other common, similarly named formats and programs with different native formats include 7-Zip, bzip2, and rzip.
Concerns
The theoretical maximum compression factor for a raw DEFLATE stream is about 1032 to one, but by exploiting the ZIP format in unintended ways, ZIP archives with compression ratios of billions to one can be constructed. These zip bombs unzip to extremely large sizes, overwhelming the capacity of the computer they are decompressed on.
.zip files can be easily confused with URLs ending in the .zip top-level domain, which can be exploited by malicious users.
See also
Comparison of file archivers
Comparison of archive formats
List of archive formats
References
External links
.ZIP Application Note landing page for PKWARE's current and historical .ZIP file
ISO/IEC 21320-1:2015 — Document Container File — Part 1: Core
Zip Files: History, Explanation and Implementation
Shrink, Reduce, and Implode: The Legacy Zip Compression Methods
APPNOTE.TXT mirror
Structure of PKZip file Format specifications, graphical tables
American inventions
Archive formats
|
```objective-c
/* Save and restore current working directory.
Foundation, Inc.
This program is free software: you can redistribute it and/or modify
(at your option) any later version.
This program 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
along with this program. If not, see <path_to_url */
/* Written by Jim Meyering. */
#ifndef SAVE_CWD_H
# define SAVE_CWD_H 1
struct saved_cwd
{
int desc;
char *name;
};
int save_cwd (struct saved_cwd *cwd);
int restore_cwd (const struct saved_cwd *cwd);
void free_cwd (struct saved_cwd *cwd);
#endif /* SAVE_CWD_H */
```
|
```javascript
(x) => ((y, z) => (x, y, z))
```
|
William McNamara (born 1965) is an American actor.
William McNamara may also refer to:
William J. McNamara (1879–?), mayor of Edmonton
William Craig McNamara (1904–1984), president of the Canadian Wheat Board and Canadian Senator
Bill McNamara (1876–1959), Australian rules footballer
William McNamara (soldier) (1835–1912), Irish-born soldier in the 4th U.S. Army Cavalry
William McNamara (horticulturist), American horticulturist
|
```kotlin
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
@file:Suppress("TooManyFunctions")
package org.mybatis.dynamic.sql.util.kotlin.model
import org.mybatis.dynamic.sql.BasicColumn
import org.mybatis.dynamic.sql.SqlBuilder
import org.mybatis.dynamic.sql.SqlTable
import org.mybatis.dynamic.sql.delete.DeleteModel
import org.mybatis.dynamic.sql.insert.BatchInsertModel
import org.mybatis.dynamic.sql.insert.GeneralInsertModel
import org.mybatis.dynamic.sql.insert.InsertModel
import org.mybatis.dynamic.sql.insert.InsertSelectModel
import org.mybatis.dynamic.sql.insert.MultiRowInsertModel
import org.mybatis.dynamic.sql.select.MultiSelectModel
import org.mybatis.dynamic.sql.select.SelectModel
import org.mybatis.dynamic.sql.update.UpdateModel
import org.mybatis.dynamic.sql.util.kotlin.CountCompleter
import org.mybatis.dynamic.sql.util.kotlin.DeleteCompleter
import org.mybatis.dynamic.sql.util.kotlin.GeneralInsertCompleter
import org.mybatis.dynamic.sql.util.kotlin.InsertSelectCompleter
import org.mybatis.dynamic.sql.util.kotlin.KotlinBatchInsertBuilder
import org.mybatis.dynamic.sql.util.kotlin.KotlinBatchInsertCompleter
import org.mybatis.dynamic.sql.util.kotlin.KotlinCountBuilder
import org.mybatis.dynamic.sql.util.kotlin.KotlinDeleteBuilder
import org.mybatis.dynamic.sql.util.kotlin.KotlinGeneralInsertBuilder
import org.mybatis.dynamic.sql.util.kotlin.KotlinInsertBuilder
import org.mybatis.dynamic.sql.util.kotlin.KotlinInsertCompleter
import org.mybatis.dynamic.sql.util.kotlin.KotlinInsertSelectSubQueryBuilder
import org.mybatis.dynamic.sql.util.kotlin.KotlinMultiRowInsertBuilder
import org.mybatis.dynamic.sql.util.kotlin.KotlinMultiRowInsertCompleter
import org.mybatis.dynamic.sql.util.kotlin.KotlinMultiSelectBuilder
import org.mybatis.dynamic.sql.util.kotlin.KotlinSelectBuilder
import org.mybatis.dynamic.sql.util.kotlin.KotlinUpdateBuilder
import org.mybatis.dynamic.sql.util.kotlin.MultiSelectCompleter
import org.mybatis.dynamic.sql.util.kotlin.SelectCompleter
import org.mybatis.dynamic.sql.util.kotlin.UpdateCompleter
fun count(column: BasicColumn, completer: CountCompleter): SelectModel =
KotlinCountBuilder(SqlBuilder.countColumn(column)).apply(completer).build()
fun countDistinct(column: BasicColumn, completer: CountCompleter): SelectModel =
KotlinCountBuilder(SqlBuilder.countDistinctColumn(column)).apply(completer).build()
fun countFrom(table: SqlTable, completer: CountCompleter): SelectModel =
KotlinCountBuilder(SqlBuilder.countColumn(SqlBuilder.constant<Long>("*")))
.from(table).apply(completer).build()
fun deleteFrom(table: SqlTable, completer: DeleteCompleter): DeleteModel =
KotlinDeleteBuilder(SqlBuilder.deleteFrom(table)).apply(completer).build()
fun deleteFrom(table: SqlTable, tableAlias: String, completer: DeleteCompleter): DeleteModel =
KotlinDeleteBuilder(SqlBuilder.deleteFrom(table, tableAlias)).apply(completer).build()
fun <T : Any> insert(row: T, completer: KotlinInsertCompleter<T>): InsertModel<T> =
KotlinInsertBuilder(row).apply(completer).build()
fun <T : Any> insertBatch(rows: Collection<T>, completer: KotlinBatchInsertCompleter<T>): BatchInsertModel<T> =
KotlinBatchInsertBuilder(rows).apply(completer).build()
fun insertInto(table: SqlTable, completer: GeneralInsertCompleter): GeneralInsertModel =
KotlinGeneralInsertBuilder(table).apply(completer).build()
fun <T : Any> insertMultiple(rows: Collection<T>, completer: KotlinMultiRowInsertCompleter<T>): MultiRowInsertModel<T> =
KotlinMultiRowInsertBuilder(rows).apply(completer).build()
fun insertSelect(completer: InsertSelectCompleter): InsertSelectModel =
KotlinInsertSelectSubQueryBuilder().apply(completer).build()
fun select(vararg columns: BasicColumn, completer: SelectCompleter): SelectModel =
select(columns.asList(), completer)
fun select(columns: List<BasicColumn>, completer: SelectCompleter): SelectModel =
KotlinSelectBuilder(SqlBuilder.select(columns)).apply(completer).build()
fun selectDistinct(vararg columns: BasicColumn, completer: SelectCompleter): SelectModel =
selectDistinct(columns.asList(), completer)
fun selectDistinct(columns: List<BasicColumn>, completer: SelectCompleter): SelectModel =
KotlinSelectBuilder(SqlBuilder.selectDistinct(columns)).apply(completer).build()
fun multiSelect(completer: MultiSelectCompleter): MultiSelectModel =
KotlinMultiSelectBuilder().apply(completer).build()
fun update(table: SqlTable, completer: UpdateCompleter): UpdateModel =
KotlinUpdateBuilder(SqlBuilder.update(table)).apply(completer).build()
fun update(table: SqlTable, tableAlias: String, completer: UpdateCompleter): UpdateModel =
KotlinUpdateBuilder(SqlBuilder.update(table, tableAlias)).apply(completer).build()
```
|
```sqlpl
--
--
-- path_to_url
--
-- Unless required by applicable law or agreed to in writing, software
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
alter table "BillingCancellation"
add column if not exists "billing_event_history_id" int8;
alter table "BillingCancellation"
add column if not exists "billing_event_domain_repo_id" text;
alter table "BillingCancellation"
add column if not exists "billing_recurrence_history_id" int8;
alter table "BillingCancellation"
add column if not exists "billing_recurrence_domain_repo_id" text;
```
|
```c++
#include <Columns/ColumnArray.h>
#include <Columns/ColumnString.h>
#include <Columns/ColumnVector.h>
#include <DataTypes/DataTypeArray.h>
#include <DataTypes/DataTypeString.h>
#include <DataTypes/DataTypesNumber.h>
#include <Functions/FunctionFactory.h>
#include <Functions/IFunction.h>
#include <IO/WriteBufferFromVector.h>
#include <IO/WriteHelpers.h>
#include <bit>
namespace DB
{
namespace ErrorCodes
{
extern const int ILLEGAL_TYPE_OF_ARGUMENT;
extern const int ILLEGAL_COLUMN;
}
/** Functions for an unusual conversion to a string or array:
*
* bitmaskToList - takes an integer - a bitmask, returns a string of degrees of 2 separated by a comma.
* for example, bitmaskToList(50) = '2,16,32'
*
* bitmaskToArray(x) - Returns an array of powers of two in the binary form of x. For example, bitmaskToArray(50) = [2, 16, 32].
*
*/
namespace
{
class FunctionBitmaskToList : public IFunction
{
public:
static constexpr auto name = "bitmaskToList";
static FunctionPtr create(ContextPtr) { return std::make_shared<FunctionBitmaskToList>(); }
String getName() const override
{
return name;
}
size_t getNumberOfArguments() const override { return 1; }
bool isInjective(const ColumnsWithTypeAndName &) const override { return true; }
bool isSuitableForShortCircuitArgumentsExecution(const DataTypesWithConstInfo & /*arguments*/) const override { return true; }
DataTypePtr getReturnTypeImpl(const DataTypes & arguments) const override
{
const DataTypePtr & type = arguments[0];
if (!isInteger(type))
throw Exception(ErrorCodes::ILLEGAL_TYPE_OF_ARGUMENT, "Cannot format {} as bitmask string", type->getName());
return std::make_shared<DataTypeString>();
}
bool useDefaultImplementationForConstants() const override { return true; }
ColumnPtr executeImpl(const ColumnsWithTypeAndName & arguments, const DataTypePtr &, size_t input_rows_count) const override
{
ColumnPtr res;
if (!((res = executeType<UInt8>(arguments, input_rows_count))
|| (res = executeType<UInt16>(arguments, input_rows_count))
|| (res = executeType<UInt32>(arguments, input_rows_count))
|| (res = executeType<UInt64>(arguments, input_rows_count))
|| (res = executeType<Int8>(arguments, input_rows_count))
|| (res = executeType<Int16>(arguments, input_rows_count))
|| (res = executeType<Int32>(arguments, input_rows_count))
|| (res = executeType<Int64>(arguments, input_rows_count))))
throw Exception(ErrorCodes::ILLEGAL_COLUMN, "Illegal column {} of argument of function {}",
arguments[0].column->getName(), getName());
return res;
}
private:
template <typename T>
static void writeBitmask(T x, WriteBuffer & out)
{
using UnsignedT = make_unsigned_t<T>;
UnsignedT u_x = x;
bool first = true;
while (u_x)
{
UnsignedT y = u_x & (u_x - 1);
UnsignedT bit = u_x ^ y;
u_x = y;
if (!first)
writeChar(',', out);
first = false;
writeIntText(static_cast<T>(bit), out);
}
}
template <typename T>
ColumnPtr executeType(const ColumnsWithTypeAndName & columns, size_t input_rows_count) const
{
if (const ColumnVector<T> * col_from = checkAndGetColumn<ColumnVector<T>>(columns[0].column.get()))
{
auto col_to = ColumnString::create();
const typename ColumnVector<T>::Container & vec_from = col_from->getData();
ColumnString::Chars & data_to = col_to->getChars();
ColumnString::Offsets & offsets_to = col_to->getOffsets();
data_to.resize(input_rows_count * 2);
offsets_to.resize(input_rows_count);
WriteBufferFromVector<ColumnString::Chars> buf_to(data_to);
for (size_t i = 0; i < input_rows_count; ++i)
{
writeBitmask<T>(vec_from[i], buf_to);
writeChar(0, buf_to);
offsets_to[i] = buf_to.count();
}
buf_to.finalize();
return col_to;
}
return nullptr;
}
};
class FunctionBitmaskToArray : public IFunction
{
public:
static constexpr auto name = "bitmaskToArray";
static FunctionPtr create(ContextPtr) { return std::make_shared<FunctionBitmaskToArray>(); }
String getName() const override
{
return name;
}
size_t getNumberOfArguments() const override { return 1; }
bool isInjective(const ColumnsWithTypeAndName &) const override { return true; }
bool isSuitableForShortCircuitArgumentsExecution(const DataTypesWithConstInfo & /*arguments*/) const override { return true; }
DataTypePtr getReturnTypeImpl(const DataTypes & arguments) const override
{
if (!isInteger(arguments[0]))
throw Exception(ErrorCodes::ILLEGAL_TYPE_OF_ARGUMENT, "Illegal type {} of argument of function {}",
arguments[0]->getName(), getName());
return std::make_shared<DataTypeArray>(arguments[0]);
}
bool useDefaultImplementationForConstants() const override { return true; }
template <typename T>
bool tryExecute(const IColumn * column, ColumnPtr & out_column) const
{
using UnsignedT = make_unsigned_t<T>;
if (const ColumnVector<T> * col_from = checkAndGetColumn<ColumnVector<T>>(column))
{
auto col_values = ColumnVector<T>::create();
auto col_offsets = ColumnArray::ColumnOffsets::create();
typename ColumnVector<T>::Container & res_values = col_values->getData();
ColumnArray::Offsets & res_offsets = col_offsets->getData();
const typename ColumnVector<T>::Container & vec_from = col_from->getData();
size_t size = vec_from.size();
res_offsets.resize(size);
res_values.reserve(size * 2);
for (size_t row = 0; row < size; ++row)
{
UnsignedT x = vec_from[row];
while (x)
{
UnsignedT y = x & (x - 1);
UnsignedT bit = x ^ y;
x = y;
res_values.push_back(bit);
}
res_offsets[row] = res_values.size();
}
out_column = ColumnArray::create(std::move(col_values), std::move(col_offsets));
return true;
}
else
{
return false;
}
}
ColumnPtr executeImpl(const ColumnsWithTypeAndName & arguments, const DataTypePtr &, size_t /*input_rows_count*/) const override
{
const IColumn * in_column = arguments[0].column.get();
ColumnPtr out_column;
if (tryExecute<UInt8>(in_column, out_column) ||
tryExecute<UInt16>(in_column, out_column) ||
tryExecute<UInt32>(in_column, out_column) ||
tryExecute<UInt64>(in_column, out_column) ||
tryExecute<Int8>(in_column, out_column) ||
tryExecute<Int16>(in_column, out_column) ||
tryExecute<Int32>(in_column, out_column) ||
tryExecute<Int64>(in_column, out_column))
return out_column;
throw Exception(ErrorCodes::ILLEGAL_COLUMN, "Illegal column {} of first argument of function {}",
arguments[0].column->getName(), getName());
}
};
class FunctionBitPositionsToArray : public IFunction
{
public:
static constexpr auto name = "bitPositionsToArray";
static FunctionPtr create(ContextPtr) { return std::make_shared<FunctionBitPositionsToArray>(); }
String getName() const override
{
return name;
}
size_t getNumberOfArguments() const override { return 1; }
bool isInjective(const ColumnsWithTypeAndName &) const override { return true; }
bool isSuitableForShortCircuitArgumentsExecution(const DataTypesWithConstInfo & /*arguments*/) const override { return true; }
DataTypePtr getReturnTypeImpl(const DataTypes & arguments) const override
{
if (!isInteger(arguments[0]))
throw Exception(ErrorCodes::ILLEGAL_TYPE_OF_ARGUMENT,
"Illegal type {} of argument of function {}",
getName(),
arguments[0]->getName());
return std::make_shared<DataTypeArray>(std::make_shared<DataTypeUInt64>());
}
bool useDefaultImplementationForConstants() const override { return true; }
template <typename T>
ColumnPtr executeType(const IColumn * column, size_t input_rows_count) const
{
const ColumnVector<T> * col_from = checkAndGetColumn<ColumnVector<T>>(column);
if (!col_from)
return nullptr;
auto result_array_values = ColumnVector<UInt64>::create();
auto result_array_offsets = ColumnArray::ColumnOffsets::create();
auto & result_array_values_data = result_array_values->getData();
auto & result_array_offsets_data = result_array_offsets->getData();
auto & vec_from = col_from->getData();
result_array_offsets_data.resize(input_rows_count);
result_array_values_data.reserve(input_rows_count * 2);
using UnsignedType = make_unsigned_t<T>;
for (size_t row = 0; row < input_rows_count; ++row)
{
UnsignedType x = static_cast<UnsignedType>(vec_from[row]);
if constexpr (is_big_int_v<UnsignedType>)
{
size_t position = 0;
while (x)
{
if (x & 1)
result_array_values_data.push_back(position);
x >>= 1;
++position;
}
}
else
{
while (x)
{
/// ++20 char8_t is not an unsigned integral type anymore path_to_url
/// and thus you cannot use std::countr_zero on it.
if constexpr (std::is_same_v<UnsignedType, UInt8>)
result_array_values_data.push_back(std::countr_zero(static_cast<unsigned char>(x)));
else
result_array_values_data.push_back(std::countr_zero(x));
x &= (x - 1);
}
}
result_array_offsets_data[row] = result_array_values_data.size();
}
auto result_column = ColumnArray::create(std::move(result_array_values), std::move(result_array_offsets));
return result_column;
}
ColumnPtr executeImpl(const ColumnsWithTypeAndName & arguments, const DataTypePtr &, size_t input_rows_count) const override
{
const IColumn * in_column = arguments[0].column.get();
ColumnPtr result_column;
if (!((result_column = executeType<UInt8>(in_column, input_rows_count))
|| (result_column = executeType<UInt16>(in_column, input_rows_count))
|| (result_column = executeType<UInt32>(in_column, input_rows_count))
|| (result_column = executeType<UInt32>(in_column, input_rows_count))
|| (result_column = executeType<UInt64>(in_column, input_rows_count))
|| (result_column = executeType<UInt128>(in_column, input_rows_count))
|| (result_column = executeType<UInt256>(in_column, input_rows_count))
|| (result_column = executeType<Int8>(in_column, input_rows_count))
|| (result_column = executeType<Int16>(in_column, input_rows_count))
|| (result_column = executeType<Int32>(in_column, input_rows_count))
|| (result_column = executeType<Int64>(in_column, input_rows_count))
|| (result_column = executeType<Int128>(in_column, input_rows_count))
|| (result_column = executeType<Int256>(in_column, input_rows_count))))
{
throw Exception(ErrorCodes::ILLEGAL_COLUMN,
"Illegal column {} of first argument of function {}",
arguments[0].column->getName(),
getName());
}
return result_column;
}
};
}
REGISTER_FUNCTION(BitToArray)
{
factory.registerFunction<FunctionBitPositionsToArray>();
factory.registerFunction<FunctionBitmaskToArray>();
factory.registerFunction<FunctionBitmaskToList>();
}
}
```
|
```toml
[package]
org = "ballerina"
name = "pkg1"
version = "2.1.0"
distribution = "2201.7.0"
export = ["pkg1", "pkg1.mod1"]
[build-options]
observabilityIncluded = false
```
|
The following lists events that happened during 1947 in Australia.
Incumbents
Monarch – George VI
Governor-General – Prince Henry, Duke of Gloucester (until 11 March), then William McKell
Prime Minister – Ben Chifley
Chief Justice – Sir John Latham
State Premiers
Premier of New South Wales – William McKell (until 6 February), then James McGirr
Premier of Queensland – Ned Hanlon
Premier of South Australia – Thomas Playford IV
Premier of Tasmania – Robert Cosgrove (until 18 December), then Edward Brooker
Premier of Victoria – John Cain (until 20 November), then Thomas Hollway
Premier of Western Australia – Frank Wise (until 1 April), then Ross McLarty
State Governors
Governor of New South Wales – Sir John Northcott
Governor of Queensland – Sir John Lavarack
Governor of South Australia – Sir Charles Norrie
Governor of Tasmania – Sir Hugh Binney
Governor of Victoria – Sir Winston Dugan
Governor of Western Australia – none appointed
Events
1 January – A massive hailstorm strikes Sydney, causing hundreds of injuries and an estimated £1 million damage.
6 February – William McKell stands down as Premier of New South Wales following royal approval of his appointment as Governor-General. The Labor Party elects James McGirr as its leader and the new Premier.
15 March – A state election is held in Western Australia. The Labor government of Frank Wise is defeated by the Liberal/Country coalition led by Ross McLarty.
3 May – A state election is held in Queensland. Ned Hanlon's Labor government is returned for its sixth term in government.
1 April – The Woomera rocket range is established in South Australia as a testing site for British and Australian missiles.
5 May – A train derails in the Camp Mountain rail accident in Queensland, killing 16 people.
15–17 June – Major flooding in Tasmania.
30 June – The Australian government assumes control of Qantas.
1 July – Real estate company L. J. Hooker is listed on the Australian Stock Exchange.
5 August – Australia becomes a member of the International Monetary Fund.
30 August – The Commonwealth Court of Conciliation and Arbitration grants workers a 40-hour week.
8 November – A state election is held in Victoria, after the upper house blocks supply. The Labor minority government of John Cain is defeated by a Liberal–Country coalition led by Thomas Hollway.
18 November – Australia reduces its trade tariffs after ratifying the General Agreement on Tariffs and Trade (GATT) in Geneva.
18 December – Robert Cosgrove resigns as Premier of Tasmania after being indicted on charges of bribery and corruption. Edward Brooker is sworn in as his replacement the next day.
26 December – Heard Island and McDonald Islands in Antarctica are transferred from British control to Australian territories.
Arts and literature
17 January – William Dargie wins the Archibald Prize with his portrait of Marcus Clarke.
Sport
30 August – Fred Fanning, in his last league match, kicks a VFL/AFL record of eighteen goals against St. Kilda
20 September – Balmain win the 1947 NSWRFL season, claiming their tenth title after defeating minor premiers Canterbury-Bankstown 13–9. The newly formed Parramatta team finish in last place, claiming the wooden spoon.
27 September – Carlton 13.8 (86) defeats Essendon 11.19 85 to win the 51st VFL Premiership in the 1947 VFL Grand Final.
4 November – Hiraji wins the Melbourne Cup.
30 December – Morna takes line honours and Westward wins on handicap in the Sydney to Hobart Yacht Race.
The Parramatta rugby league club is formed in Sydney's West. The Manly-Warringah club is also formed in the Northern Beaches.
Births
10 January
David Irvine, diplomat, Director-General of ASIS and ASIO (died 2022)
Stevie Wright, English-Australian singer-songwriter (died 2015)
29 January – Lorraine Landon, basketball administrator, former player and coach
8 February – Kerrie Biddell, singer and pianist (died 2014)
8 April – Fay Miller, politician (died 2023)
15 May – Graeham Goble, musician
19 May – David Helfgott, concert pianist
29 May – Stan Zemanek, Australian radio broadcaster (died 2007)
3 June – Mike Burgmann, racing driver and accountant (died 1986)
19 June – James Mason, field hockey player
25 June – Robert Percy, Australian rules footballer
14 July – John Blackman, radio and television presenter
16 July – Don Burke, Television presenter, television producer, author, and horticulturist
28 July – Peter Cosgrove, Chief of the Defence Force (2002–05)
5 August – Angry Anderson, singer & actor
28 August – Jennie George, politician and trade unionist
5 September – Bruce Yardley, Test cricketer (died 2019)
28 September – Bob Carr, Premier of New South Wales (1995–2005); Senator and Minister for Foreign Affairs (2012–13)
2 November – David Ahern, composer (died 1988)
4 November – Rod Marsh, cricketer (died 2022)
Deaths
16 January – Traugott Bernhard Zwar, academic, army medical officer and surgeon (b. 1876)
27 February – Charles Hoadley, geologist (b. 1887)
26 April – Hector Lamond, New South Wales politician (b. 1865)
27 April
Robert Barr, Victorian politician (born in the United Kingdom) (b. 1862)
Roland Green, New South Wales politician (b. 1885)
9 May – Hugh de Largie, Western Australian politician (born in the United Kingdom) (b. 1859)
16 May – William McCormack, 22nd Premier of Queensland (b. 1879)
25 May – Rupert Bunny, painter (b. 1864)
28 May – Walter Duncan, New South Wales politician (b. 1883)
1 July – E. Harold Davies, musician, conductor and teacher (born in the United Kingdom) (b. 1867)
30 July – Sir Joseph Cook, 6th Prime Minister of Australia (b. 1860)
28 August – Matthew Reid, Queensland politician (born in the United Kingdom) (b. 1856)
14 September – John Feetham, Anglican bishop (born in the United Kingdom) (b. 1873)
26 October – Jack Bailey, New South Wales politician (b. 1871)
19 December – Arthur Wilson, Australian rules footballer, gynaecologist and obstetrician (b. 1888)
See also
List of Australian films of the 1940s
References
Australia
Years of the 20th century in Australia
|
Cerro Teotepec or Cerro Tiotepec is a mountain summit located in the Mexican state of Guerrero. It is 3,550 meters high and is located in the Sierra Madre del Sur mountain range. It is located in the municipalities of Atoyac de Álvarez and General Heliodoro Castillo.
References
Landforms of Guerrero
Teotepec
Sierra Madre del Sur
North American 3000 m summits
|
```ruby
class Audit < PaperTrail::Version
self.table_name = :audits
belongs_to :user, foreign_key: 'whodunnit', optional: true, inverse_of: :audits
end
```
|
```javascript
/* your_sha256_hash--------------
*
* # D3.js - basic pie chart
*
* Demo d3.js pie chart setup with .csv data source
*
* Version: 1.0
* Latest update: August 1, 2015
*
* your_sha256_hash------------ */
$(function () {
// Initialize chart
pieBasic('#d3-pie-basic', 120);
// Chart setup
function pieBasic(element, radius) {
// Basic setup
// ------------------------------
// Colors
var color = d3.scale.category20();
// Create chart
// ------------------------------
// Add SVG element
var container = d3.select(element).append("svg");
// Add SVG group
var svg = container
.attr("width", radius * 2)
.attr("height", radius * 2)
.append("g")
.attr("transform", "translate(" + radius + "," + radius + ")");
// Construct chart layout
// ------------------------------
// Arc
var arc = d3.svg.arc()
.outerRadius(radius)
.innerRadius(0);
// Pie
var pie = d3.layout.pie()
.sort(null)
.value(function(d) { return d.population; });
// Load data
// ------------------------------
d3.csv("assets/demo_data/d3/pies/pies_basic.csv", function(error, data) {
// Pull out values
data.forEach(function(d) {
d.population = +d.population;
});
//
// Append chart elements
//
// Bind data
var g = svg.selectAll(".d3-arc")
.data(pie(data))
.enter()
.append("g")
.attr("class", "d3-arc");
// Add arc path
g.append("path")
.attr("d", arc)
.style("stroke", "#fff")
.style("fill", function(d) { return color(d.data.age); });
// Add text labels
g.append("text")
.attr("transform", function(d) { return "translate(" + arc.centroid(d) + ")"; })
.attr("dy", ".35em")
.style("fill", "#fff")
.style("font-size", 12)
.style("text-anchor", "middle")
.text(function(d) { return d.data.age; });
});
}
});
```
|
Jonesboro High School is a four-year public high school located in Jonesboro, Georgia, United States. The school is part of the Clayton County School District, and is located at 7728 Mt. Zion Boulevard.
The school's teams are known as the Cardinals, and the school colors are red, white, and black. U.S. News & World Report selected Jonesboro as one of the top 100 schools in the United States in its December 1998 issue. The school has produced several notable alumni.
Established as a public high school on September 21, 1891, Jonesboro High School was originally located on College Street. The school was moved to Spring Street during the Christmas break of 1917 and moved again to its present location on the corner of Mt. Zion Boulevard in the fall of 1963.
Campus
The library originally started out in what is now the ROTC room and was moved into its own building in 1968. In 1975 the vocational building was completed, giving JHS the chance to expand it faculty to include assistant principals, counselors, and vocational teachers. A technology lab was added in the 1994–95 school year.
Jonesboro High School underwent construction starting the 2006–07 school year for the addition of a freshman wing. The wing was complete for use in the 2007–2008 school year, and opened in February 2008. This addition cost the county a total of $4,025,593. The school is getting an auxiliary gymnasium. The work began on June 15, 2010, and the date of opening is unknown. The addition of this new building is costing the county an estimated $2,250,000.
Awards and recognition
Jonesboro High School won the 2007 National High School Mock Trial Championship, held in Dallas, Texas and again in 2008 in Wilmington, Delaware.
Notable alumni
Harry Douglas, NFL wide receiver for the Tennessee Titans
Toney Douglas (born 1986), basketball player for Hapoel Eilat of the Israeli Basketball Premier League
Steve Lundquist, swimmer; won two Olympic gold medals at the 1984 Summer Olympics in Los Angeles, California (1979)
Jason Perry, former MLB outfielder
Cameron Sutton, NFL cornerback for the Detroit Lions
References
External links
Clayton County Public Schools website
Schools in Clayton County, Georgia
Public high schools in Georgia (U.S. state)
Educational institutions established in 1891
1891 establishments in Georgia (U.S. state)
|
```smalltalk
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Threading.Tasks;
using McMaster.Extensions.CommandLineUtils;
using Microsoft.Diagnostics.Tracing.Etlx;
namespace Microsoft.Diagnostics.Tools.Analyze.Commands
{
public class EventStackCommand : TraceCommandBase
{
public override IReadOnlyList<string> Names => new[] { "eventstack" };
public override string Description => "Dumps the stack trace associated with an event, if there is one.";
protected override Task RunAsyncCore(IConsole console, string[] args, AnalysisSession session, TraceLog trace)
{
if (args.Length < 1)
{
console.Error.WriteLine("Usage: eventstack <eventIndex>");
return Task.CompletedTask;
}
if (!int.TryParse(args[0], NumberStyles.HexNumber, CultureInfo.InvariantCulture, out var eventIndex))
{
console.Error.WriteLine("Usage: eventstack <eventIndex>");
return Task.CompletedTask;
}
var evt = trace.Events.ElementAt(eventIndex);
var stack = evt.CallStack();
if (stack != null)
{
WriteStack(stack, console);
}
else
{
console.Error.WriteLine($"Unable to find any call stacks for event {eventIndex:X4}!");
}
return Task.CompletedTask;
}
private void WriteStack(TraceCallStack stack, IConsole console)
{
while (stack != null)
{
console.WriteLine($" at {stack.CodeAddress.ModuleName}!{stack.CodeAddress.FullMethodName} + 0x{stack.CodeAddress.ILOffset:X4}");
stack = stack.Caller;
}
}
public override Task WriteHelpAsync(IConsole console)
{
console.WriteLine("TODO");
return Task.CompletedTask;
}
}
}
```
|
```html
<!DOCTYPE HTML>
<html>
<head>
<meta charset='UTF-8'>
<title>Redirecting... Page moved</title>
<link rel='canonical' href='path_to_url
<meta http-equiv=refresh content='0;URL="path_to_url"'>
</head>
<body>
<h1>Redirecting... Page moved...</h1>
<p><a href='path_to_url here if you are not redirected</a></p>
<script>window.location.href = 'path_to_url
</body>
</html>
```
|
```javascript
'use strict';
module.exports.definition = {
set: function (v) {
this._setProperty('cue-before', v);
},
get: function () {
return this.getPropertyValue('cue-before');
},
enumerable: true,
configurable: true
};
```
|
Arne Jacobsen (born 12 June 1942) is a Danish archer. He competed at the 1972 Summer Olympics and the 1976 Summer Olympics.
References
1942 births
Living people
Danish male archers
Olympic archers for Denmark
Archers at the 1972 Summer Olympics
Archers at the 1976 Summer Olympics
Sportspeople from Aarhus
20th-century Danish people
|
```scala
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.openwhisk.core.scheduler.queue
import akka.actor.ActorSystem
import org.apache.openwhisk.common.Logging
import org.apache.openwhisk.core.entity.WhiskActionMetaData
import scala.concurrent.Future
object NoopDurationCheckerProvider extends DurationCheckerProvider {
override def instance(actorSystem: ActorSystem, log: Logging): NoopDurationChecker = {
implicit val as: ActorSystem = actorSystem
implicit val logging: Logging = log
new NoopDurationChecker()
}
}
object NoopDurationChecker {
implicit val serde = new ElasticSearchDurationCheckResultFormat()
}
class NoopDurationChecker extends DurationChecker {
import scala.concurrent.ExecutionContext.Implicits.global
override def checkAverageDuration(invocationNamespace: String, actionMetaData: WhiskActionMetaData)(
callback: DurationCheckResult => DurationCheckResult): Future[DurationCheckResult] = {
Future {
DurationCheckResult(Option.apply(0), 0, 0)
}
}
}
```
|
```javascript
import React from 'react';
import SvgIcon from '../../SvgIcon';
const AlertErrorOutline = (props) => (
<SvgIcon {...props}>
<path d="M11 15h2v2h-2zm0-8h2v6h-2zm.99-5C6.47 2 2 6.48 2 12s4.47 10 9.99 10C17.52 22 22 17.52 22 12S17.52 2 11.99 2zM12 20c-4.42 0-8-3.58-8-8s3.58-8 8-8 8 3.58 8 8-3.58 8-8 8z"/>
</SvgIcon>
);
AlertErrorOutline.displayName = 'AlertErrorOutline';
AlertErrorOutline.muiName = 'SvgIcon';
export default AlertErrorOutline;
```
|
Sir Oliver Cromwell ( – 28 August 1655) was an English landowner, lawyer and politician who sat in the House of Commons at various times between 1589 and 1625. He was the uncle of Oliver Cromwell, the Member of Parliament, general, and Lord Protector of England.
Biography
Born around 1562, Cromwell was the eldest son and heir of Sir Henry Williams, alias Cromwell, of Hinchingbrooke, and his wife Joan, a daughter of Sir Ralph Warren, Lord Mayor of London. He matriculated from Queens' College, Cambridge, at Lent 1579 and was admitted at Lincoln's Inn on 12 May 1582. He lived at Godmanchester until the death of his father.
Cromwell held a number of local offices: In 1585 he was captain of musters for Huntingdonshire and at the time of the Spanish Armada he was one of the officers in charge of the men raised in Huntingdonshire. He was recorder of Huntingdon in 1596. He was Sheriff of Cambridgeshire and Huntingdonshire from 1598 to 1599 and while Sheriff, in 1598, Queen Elizabeth may have dubbed him a knight bachelor.
He was a Justice of the Peace from about 1585 but was removed in 1587, when there was one of the periodic purges of justices. In 1594 he was restored to his position as a J.P.; as the online History of Parliament observes: "It was felt that in a county as small as Huntingdonshire, the custom by which only one member of a family could be a justice was inapplicable — particularly in the case of the owners of Hinchingbrooke".
In 1600 the lutenist and composer John Dowland dedicated a pavane to him which was published in his Second Book of Songs.
Cromwell was first elected one of the members of parliament for Huntingdonshire in 1589. He was re-elected to each Parliament up to and including the Addled Parliament of 1614 (that is, in 1593, 1597, 1601, 1604, and 1614). In 1621, the seat was occupied by Richard Beavill, but Sir Oliver stood for and was elected to the Happy Parliament of 1624, and its successor, the Useless Parliament of 1625, after the dissolution at King James' death.
He entertained King James at Hinchingbrooke on 27 April 1603, when the King was travelling south to occupy the English throne. Cromwell's presents to the King included "a cup of gold, goodly horses, deep-mouthed hounds, and divers hawks of excellent wing" and some of the heads of Cambridge University came dressed in scarlet gowns and corner caps to present a Latin oration. It was described as "the greatest feast that had ever been given to a king by a subject". King James made him a Knight of the Bath at the coronation on 24 July 1603. He became attorney to Queen Anne of Denmark and a gentleman of the privy chamber.
On 6 January 1604, his father died and Sir Oliver succeeded to Hinchingbrooke and the family estates; about 1605, he also succeeded to his father's office, Custos Rotulorum of Huntingdonshire.
King James was frequently at Hinchingbrooke, apparently treating the place as his own – in 1614 he appointed a keeper of the wardrobe there. By 1623 Sir Oliver was trying to sell Hinchingbrooke to the King, to pay off his debts, but the death of James I in March 1625 ended the negotiations on Hinchingbrooke. Hinchingbrooke was finally sold on 20 June 1627 to Sir Sidney Montagu. Other estates had been sold to meet debts contracted to London moneylenders and he was left with the property at Ramsey, Cambridgeshire.
Cromwell was loyal to the crown at the outbreak of the English Civil War. His nephew and godson Oliver Cromwell was sent by parliament to the house at Ramsey to search for arms which could be sent to the King at York. The younger Cromwell is said to have stood head uncovered in the presence of his uncle. Later the Ramsey estates were sequestered but were restored to him on 18 April 1648 through the influence of his nephew who became the Lord Protector.
Cromwell died in 1655 and was buried at Ramsey on the same day, 28 August, to prevent his body being seized by creditors. According to Sir William Dugdale, he died two days after becoming 'scorched' when falling or collapsing into a hearth at his home while drying himself after being out in rain.
Marriages and issue
Cromwell married firstly Elizabeth, daughter of Thomas Bromley, the Lord Chancellor and Elizabeth Fortescue, by whom he had four sons and four daughters:
Henry
John
William
Thomas
Hannah
Katherine
Jane
Elizabeth
He married secondly in July 1601, Anne, widow of the financier Sir Horatio Palavicino and daughter of Gillis Hooftman of Antwerp, by whom he had two sons and two daughters:
Oliver
Giles
Mary
Anne
He had a total of twelve children, he himself being the oldest of 11 siblings: two of Cromwell's sons by his first marriage subsequently married two of Anne's daughters by her first marriage. Another daughter, Elizabeth (probably also by his first marriage), married secondly the Roundhead Sir Richard Ingoldsby: one of their many children, Richard Ingoldsby, was among those who signed Charles I's death warrant. His second son John married Abigail Clere, daughter of Sir Henry Clere, 1st Baronet; Abigail is familiar to readers of the Diary of Samuel Pepys as "Madam Williams", who left her husband to live openly with Pepys' colleague William Brouncker, 2nd Viscount Brouncker. It seems that John and Abigail, like many of the Cromwells, thought it prudent after 1660 to use the older family name, Williams. Another daughter, Mary, married Edward Rolt (born cir 1600) in 1628. They had a son Thomas Rolt (1632-1710). Mary died in 1634.
He was the brother of Richard, Robert (the father of the Lord Protector) and Henry Cromwell.
Notes
References
Further reading
– A four-page account (with footnotes) of James I's stay at Hinchingbrooke House
External links
The Cromwell Museum, Huntingdon
Pedigree of Oliver Cromwell
1560s births
1655 deaths
English landowners
Alumni of Queens' College, Cambridge
17th-century English lawyers
English lawyers
English MPs 1589
English MPs 1593
English MPs 1597–1598
English MPs 1601
English MPs 1604–1611
English MPs 1614
English MPs 1624–1625
Cromwell family
16th-century English lawyers
|
Lower Daggons is a hamlet in the New Forest district of Hampshire, England. At the 2011 Census the Post Office affirmed the population was included in the civil parish of Damerham. The hamlet lies close to the Hampshire-Dorset border. It is about 3.5 miles (6 km) from the New Forest National Park.
Notes
Hamlets in Hampshire
|
```xml
<?xml version="1.0" encoding="UTF-8"?>
<configuration>
<appender name="STDOUT" class="ch.qos.logback.core.ConsoleAppender">
<encoder>
<pattern>%date{ISO8601} %-5level %logger - %msg%n</pattern>
</encoder>
</appender>
<logger name="org.apache.cassandra" level="ERROR" />
<logger name="com.datastax.driver" level="WARN" />
<logger name="mockservice" level="OFF" />
<logger name="akka" level="WARN" />
<root level="INFO">
<appender-ref ref="STDOUT" />
</root>
</configuration>
```
|
Eugène Plet (born 7 February 1952) is a French former professional racing cyclist. He rode in three editions of the Tour de France. His finished in tenth place on stage 8 of the 1977 Tour de France.
References
External links
1952 births
Living people
French male cyclists
Sportspeople from Mayenne
Cyclists from Pays de la Loire
|
Pseudocharacium is a genus of green algae in the family Ignatiaceae.
References
Ulvophyceae
Ulvophyceae genera
|
The 2023 Challenger Città di Lugano was a professional tennis tournament played on indoor hard courts. It was the 3rd edition of the tournament which was part of the 2023 ATP Challenger Tour. It took place in Lugano, Switzerland between 6 and 12 March 2023.
Singles main-draw entrants
Seeds
1 Rankings are as of 27 February 2023.
Other entrants
The following players received wildcards into the singles main draw:
Mika Brunold
Pierre-Hugues Herbert
Jakub Paul
The following player received entry into the singles main draw as an alternate:
Raphaël Collignon
The following players received entry from the qualifying draw:
Dan Added
Marius Copil
Calvin Hemery
Cem İlkel
Gauthier Onclin
Vitaliy Sachko
Champions
Singles
Otto Virtanen def. Cem İlkel 6–4, 7–6(7–5).
Doubles
Zizou Bergs / David Pel def. Constantin Frantzen / Hendrik Jebens 6–2, 7–6(8–6).
References
2023 ATP Challenger Tour
March 2023 sports events in Switzerland
2023 in Swiss sport
|
Thongwa Township () is a township of Yangon Region, Myanmar, located in the southeastern section of the region, by the Gulf of Martaban.
References
Townships of Yangon Region
|
```xml
<?xml version="1.0" encoding="UTF-8" ?>
<!DOCTYPE mapper PUBLIC "-//mybatis.org//DTD Mapper 3.0//EN" "path_to_url" >
<mapper namespace="com.roncoo.pay.trade.dao.impl.RpMicroSubmitRecordDaoImpl">
<resultMap id="baseResultMap" type="com.roncoo.pay.trade.entity.RpMicroSubmitRecord">
<id column="id" property="id" jdbcType="VARCHAR"/>
<result column="version" property="version" jdbcType="INTEGER"/>
<result column="create_time" property="createTime" jdbcType="TIMESTAMP"/>
<result column="creater" property="creater" jdbcType="VARCHAR"/>
<result column="edit_time" property="editTime" jdbcType="TIMESTAMP"/>
<result column="editor" property="editor" jdbcType="VARCHAR"/>
<result column="status" property="status" jdbcType="VARCHAR"/>
<result column="business_code" property="businessCode" jdbcType="VARCHAR"/>
<result column="sub_mch_id" property="subMchId" jdbcType="VARCHAR"/>
<result column="id_card_copy" property="idCardCopy" jdbcType="VARCHAR"/>
<result column="id_card_national" property="idCardNational" jdbcType="VARCHAR"/>
<result column="id_card_name" property="idCardName" jdbcType="DECIMAL"/>
<result column="id_card_number" property="idCardNumber" jdbcType="VARCHAR"/>
<result column="id_card_valid_time" property="idCardValidTime" jdbcType="VARCHAR"/>
<result column="account_bank" property="accountBank" jdbcType="VARCHAR"/>
<result column="bank_address_code" property="bankAddressCode" jdbcType="VARCHAR"/>
<result column="account_number" property="accountNumber" jdbcType="VARCHAR"/>
<result column="store_name" property="storeName" jdbcType="VARCHAR"/>
<result column="store_address_code" property="storeAddressCode" jdbcType="VARCHAR"/>
<result column="store_street" property="storeStreet" jdbcType="VARCHAR"/>
<result column="store_entrance_pic" property="storeEntrancePic" jdbcType="VARCHAR"/>
<result column="indoor_pic" property="indoorPic" jdbcType="VARCHAR"/>
<result column="merchant_shortname" property="merchantShortname" jdbcType="VARCHAR"/>
<result column="service_phone" property="servicePhone" jdbcType="VARCHAR"/>
<result column="product_desc" property="productDesc" jdbcType="VARCHAR"/>
<result column="rate" property="rate" jdbcType="VARCHAR"/>
<result column="contact_phone" property="contactPhone" jdbcType="VARCHAR"/>
</resultMap>
<!---->
<sql id="table_name">
rp_micro_submit_record
</sql>
<!---->
<sql id="base_column_list">
id, version, create_time, creater, edit_time, editor, status, business_code, sub_mch_id, id_card_copy,
id_card_national, id_card_name, id_card_number, id_card_valid_time, account_bank,
bank_address_code, account_number, store_name, store_address_code, store_street,
store_entrance_pic, indoor_pic, merchant_shortname, service_phone, product_desc, rate, contact_phone
</sql>
<!-- -->
<sql id="condition_sql">
<if test="idCardName != null and idCardName != ''">and id_card_name like CONCAT('%',CONCAT(#{idCardName,jdbcType=VARCHAR},'%'))</if>
<if test="storeName != null and storeName != ''">and store_name like CONCAT('%',CONCAT(#{storeName,jdbcType=VARCHAR},'%'))</if>
<if test="businessCode != null and businessCode != ''">and business_code = #{businessCode,jdbcType=VARCHAR}</if>
</sql>
<!---->
<select id="selectByPrimaryKey" resultMap="baseResultMap" parameterType="java.lang.String">
select
<include refid="base_column_list"/>
from
<include refid="table_name"/>
where id = #{id,jdbcType=VARCHAR}
</select>
<!---->
<select id="listBy" parameterType="java.util.Map" resultMap="baseResultMap">
select
<include refid="base_column_list"/>
from
<include refid="table_name"/>
<where>
<include refid="condition_sql"/>
</where>
order by create_time desc
</select>
<!-- -->
<select id="listPage" parameterType="java.util.Map" resultMap="baseResultMap">
select
<include refid="base_column_list"/>
from
<include refid="table_name"/>
<where>
<include refid="condition_sql"/>
</where>
order by create_time desc limit #{pageFirst}, #{pageSize}
</select>
<!-- -->
<select id="listPageCount" parameterType="java.util.Map" resultType="java.lang.Long">
select count(1) from
<include refid="table_name"/>
<where>
<include refid="condition_sql"/>
</where>
</select>
<!---->
<insert id="insert" parameterType="com.roncoo.pay.trade.entity.RpMicroSubmitRecord">
insert into
<include refid="table_name"/>
<trim prefix="(" suffix=")">
<include refid="base_column_list"/>
</trim>
<trim prefix="values (" suffix=")">
#{id,jdbcType=VARCHAR},
#{version,jdbcType=INTEGER},
#{createTime,jdbcType=TIMESTAMP},
#{creater,jdbcType=VARCHAR},
#{editTime, jdbcType=TIMESTAMP},
#{editor,jdbcType=VARCHAR},
#{status,jdbcType=VARCHAR},
#{businessCode,jdbcType=VARCHAR},
#{subMchId,jdbcType=VARCHAR},
#{idCardCopy,jdbcType=VARCHAR},
#{idCardNational,jdbcType=VARCHAR},
#{idCardName,jdbcType=VARCHAR},
#{idCardNumber,jdbcType=VARCHAR},
#{idCardValidTime,jdbcType=VARCHAR},
#{accountBank,jdbcType=VARCHAR},
#{bankAddressCode,jdbcType=VARCHAR},
#{accountNumber,jdbcType=VARCHAR},
#{storeName,jdbcType=VARCHAR},
#{storeAddressCode,jdbcType=VARCHAR},
#{storeStreet,jdbcType=VARCHAR},
#{storeEntrancePic,jdbcType=VARCHAR},
#{indoorPic,jdbcType=VARCHAR},
#{merchantShortname,jdbcType=VARCHAR},
#{servicePhone,jdbcType=VARCHAR},
#{productDesc,jdbcType=VARCHAR},
#{rate,jdbcType=VARCHAR},
#{contactPhone,jdbcType=VARCHAR}
</trim>
</insert>
<!-- -->
<delete id="deleteByPrimaryKey" parameterType="java.lang.String">
delete from
<include refid="table_name"/>
where id = #{id,jdbcType=VARCHAR}
</delete>
<!-- -->
<update id="updateByPrimaryKey" parameterType="com.roncoo.pay.trade.entity.RpMicroSubmitRecord">
update
<include refid="table_name"/>
set
version = #{version,jdbcType=INTEGER},
create_time = #{createTime,jdbcType=TIMESTAMP},
creater = #{creater,jdbcType=VARCHAR},
edit_time = #{editTime, jdbcType=TIMESTAMP},
editor = #{editor,jdbcType=VARCHAR},
status = #{status,jdbcType=VARCHAR},
business_code = #{businessCode,jdbcType=VARCHAR},
sub_mch_id = #{subMchId,jdbcType=VARCHAR},
id_card_copy = #{idCardCopy,jdbcType=VARCHAR},
id_card_national = #{idCardNational,jdbcType=VARCHAR},
id_card_name = #{idCardName,jdbcType=VARCHAR},
id_card_number = #{idCardNumber,jdbcType=VARCHAR},
id_card_valid_time = #{idCardValidTime,jdbcType=VARCHAR},
account_bank = #{accountBank,jdbcType=VARCHAR},
bank_address_code = #{bankAddressCode,jdbcType=VARCHAR},
account_number = #{accountNumber,jdbcType=VARCHAR},
store_name = #{storeName,jdbcType=VARCHAR},
store_address_code = #{storeAddressCode,jdbcType=VARCHAR},
store_street = #{storeStreet,jdbcType=VARCHAR},
store_entrance_pic = #{storeEntrancePic,jdbcType=VARCHAR},
indoor_pic = #{indoorPic,jdbcType=VARCHAR},
merchant_shortname = #{merchantShortname,jdbcType=VARCHAR},
service_phone = #{servicePhone,jdbcType=VARCHAR},
product_desc = #{productDesc,jdbcType=VARCHAR},
rate = #{rate,jdbcType=VARCHAR},
contact_phone = #{contactPhone,jdbcType=VARCHAR}
where id = #{id,jdbcType=VARCHAR}
</update>
</mapper>
```
|
```yaml
run:
# which dirs to skip
skip-dirs:
- mocks
# Timeout for analysis, e.g. 30s, 5m.
# Default: 1m
timeout: 5m
# Exit code when at least one issue was found.
# Default: 1
issues-exit-code: 2
# Include test files or not.
# Default: true
tests: false
# allow parallel run
allow-parallel-runners: true
linters-settings:
govet:
check-shadowing: true
gocyclo:
min-complexity: 15
maligned:
suggest-new: true
dupl:
threshold: 100
goconst:
min-len: 2
min-occurrences: 2
misspell:
locale: US
ignore-words:
- "cancelled"
goimports:
local-prefixes: github.com/golangci/golangci-lint
gocritic:
enabled-tags:
- diagnostic
- experimental
- opinionated
- performance
- style
disabled-checks:
- dupImport # path_to_url
- ifElseChain
- octalLiteral
- rangeValCopy
- unnamedResult
- whyNoLint
- wrapperFunc
funlen:
lines: 105
statements: 50
linters:
# please, do not use `enable-all`: it's deprecated and will be removed soon.
# inverted configuration with `enable-all` and `disable` is not scalable during updates of golangci-lint
disable-all: true
enable:
- asciicheck
- bidichk
- bodyclose
# - containedctx
# - contextcheck disabled because of generics
- decorder
# - depguard
- dogsled
- dupl
- durationcheck
- errcheck
- errchkjson
- errname
- errorlint
- exhaustive
# - exhaustivestruct TODO: check how to fix it
- exportloopref
# - forbidigo TODO: configure forbidden code patterns
# - forcetypeassert
- funlen
- gci
# - gochecknoglobals TODO: remove globals from code
# - gochecknoinits TODO: remove main.init
- gocognit
- goconst
- gocritic
- gocyclo
# - godox
- goerr113
- gofmt
- goimports
- gomnd
# - gomoddirectives
- gosec
- gosimple
- govet
- goprintffuncname
- grouper
- importas
# - ireturn TODO: not sure if it is a good linter
- ineffassign
- interfacebloat
- loggercheck
- maintidx
- makezero
- misspell
- nakedret
# - nestif
- nilerr
- nilnil
# - noctx
- nolintlint
- prealloc
- predeclared
- promlinter
- reassign
- revive
# - rowserrcheck disabled because of generics
# - staticcheck doesn't work with go1.19
# - structcheck disabled because of generics
- stylecheck
- tenv
- testableexamples
- typecheck
- unconvert
- unparam
- unused
# - varnamelen TODO: review naming
# - varcheck depricated 1.49
# - wastedassign disabled because of generics
- whitespace
- wrapcheck
# - wsl
issues:
exclude-rules:
- path: _test\.go
linters:
- funlen
- bodyclose
- gosec
- dupl
- gocognit
- goconst
- gocyclo
exclude:
- Using the variable on range scope `tt` in function literal
```
|
Tophisar is a neighbourhood in the municipality and district of Karacabey, Bursa Province in Turkey. Its population is 326 (2022).
It is located 15 km west of Karacabey district centre.
References
Neighbourhoods in Karacabey District
|
```php
<div class="action-panel">
<div class="action-panel-header">
<!-- Nav tabs -->
<ul class="nav nav-tabs" role="tablist">
<li role="presentation" class="active">
<a href="#notifications" class="action-panel-header__nav-link" aria-controls="home" role="tab" data-toggle="tab">{{__('Notifications')}}</a>
</li>
<li role="presentation">
<a href="#actions" class="action-panel-header__nav-link" aria-controls="profile" role="tab" data-toggle="tab">{{__('Actions')}}</a>
</li>
</ul>
<button id="close-sidebar" class="action-panel-header__btn-close">
<i class="flaticon-close"></i>
</button>
</div>
<!-- Tab panes -->
<div class="tab-content">
<div role="tabpanel" class="tab-pane active" id="notifications">
@include('partials.action-panel._notification-list')
</div>
<div role="tabpanel" class="tab-pane" id="actions">
<ul>
<div class="action-content">
<h3 style="position: absolute; margin-top: 180px; margin-left: 10px;" class="title">@lang('No new actions')</h3>
<img src="{{url('/images/undraw_no_data.svg')}}" class="not_found_image_wrapper">
</div>
</ul>
</div>
</div>
</div>
@push('scripts')
<script>
$('#grid-action').click(function (e) {
e.stopPropagation();
$(".action-panel").toggleClass('bar')
});
$('#page-content-wrapper').click(function (e) {
if ($('.action-panel').hasClass('bar')) {
$(".action-panel").toggleClass('bar')
}
});
$('#close-sidebar').click(function (e) {
if ($('.action-panel').hasClass('bar')) {
$(".action-panel").toggleClass('bar')
}
});
id = {};
</script>
@endpush
```
|
```c++
/*
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include <gtest/gtest.h>
#include <boost/algorithm/string.hpp>
#include <unordered_set>
#include "ApkResources.h"
#include "DexAnnotation.h"
#include "DexClass.h"
#include "RedexResources.h"
#include "utils/Serialize.h"
#include "verify/VerifyUtil.h"
namespace {
// These lists are formatted this way to make them easy to generate. Example:
// aapt d resources ~/foo.apk | grep -E "^[ ]*resource" | sed 's/: .*//' | \
// sed 's/^[^:]*://' | sed 's/\(.*\)/"\1",/'
const std::unordered_set<std::string> KEPT_RESOURCES = {
"array/some_fruits",
"attr/a_boolean",
"attr/fancy_effects",
"attr/reverb_type",
"attr/themeColor",
"attr/themePadding",
"color/bg_grey",
"color/keep_me_unused_color",
"color/prickly_green",
"dimen/margin_top",
"dimen/padding_left",
"dimen/padding_right",
"dimen/welcome_text_size",
"drawable/icon",
"drawable/prickly",
"id/delay",
"id/distortion",
"id/hall",
"id/overdrive",
"id/plate",
"id/reverb",
"id/shimmer",
"id/spring",
"id/welcome_view",
"layout/activity_main",
"layout/themed",
"plurals/a_sentence_with_geese",
"string/app_name",
"string/button_txt",
"string/keep_me_unused_str",
"string/indirection",
"string/log_msg",
"string/some_fragment",
"string/toast_fmt",
"string/too_many",
"string/used_from_layout",
"string/welcome",
"string/yummy_orange",
"style/CustomText",
"style/CustomText.Prickly",
"style/ThemeA",
"style/ThemeB",
};
// <declare-styleable> value names will generate entries in resource table, but
// not R fields, so don't run ID comparisons on these.
const std::unordered_set<std::string> NO_FIELD_RESOURCES = {
"id/delay", "id/distortion", "id/hall", "id/overdrive",
"id/plate", "id/reverb", "id/shimmer", "id/spring",
};
const std::unordered_set<std::string> ADDITIONAL_KEPT_RESOURCES = {
"dimen/bar",
"dimen/small",
"dimen/medium2",
"dimen/medium",
"string/_an_unused_string",
"attr/SameAttributeA",
"color/hex_or_file2",
};
const std::unordered_set<std::string> UNUSED_RESOURCES = {
"array/unused_fruits",
"attr/SameAttributeA",
"attr/SameAttributeB",
"attr/themeUnused",
"color/hex_or_file",
"color/hex_or_file2",
"dimen/bar",
"dimen/baz",
"dimen/boo",
"dimen/far",
"dimen/foo",
"dimen/medium",
"dimen/medium2",
"dimen/small",
"dimen/unused_dimen_1",
"dimen/unused_dimen_2",
"dimen/foo",
"drawable/x_icon",
"drawable/x_prickly",
"string/_an_unused_string",
"string/unused_durian",
"string/unused_pineapple",
"string/unused_str",
"style/CustomText.Unused",
"style/ThemeDifferentA",
"style/ThemeDifferentB",
"style/ThemeUnused",
};
const std::unordered_set<std::string> KEPT_FILE_PATHS = {
"res/drawable-mdpi-v4/icon.png",
"res/drawable-mdpi-v4/prickly.png",
"res/layout/activity_main.xml",
"res/layout/themed.xml",
};
const std::unordered_set<std::string> REMOVED_FILE_PATHS = {
"res/color/hex_or_file2.xml",
"res/color-night-v8/hex_or_file.xml",
"res/drawable-mdpi-v4/x_icon.png",
"res/drawable-mdpi-v4/x_prickly.png",
};
const std::unordered_set<std::string> ADDITIONAL_KEPT_FILE_PATHS = {
"res/color/hex_or_file2.xml",
};
std::unordered_set<std::string> get_resource_names_of_type(
const std::unordered_set<std::string>& list, const std::string& type) {
std::unordered_set<std::string> result;
for (const auto& str : list) {
if (str.find(type) == 0) {
result.emplace(str.substr(str.find('/') + 1));
}
}
return result;
}
// Asserts that for a given resource type (dimen, string, drawable, etc) that
// all resource names have a corresponding value and that the range of values is
// contiguous from [0, list.size())
void assert_type_contiguous(const std::unordered_set<std::string>& list,
const std::string& type,
ResourceTableFile* res_table) {
auto resources = get_resource_names_of_type(list, type);
std::unordered_set<uint32_t> values;
for (const auto& resource : resources) {
auto ids = res_table->get_res_ids_by_name(resource);
EXPECT_EQ(ids.size(), 1) << "Expected only 1 resource ID for " << resource;
// Don't care about package ID or type ID, just get the entry IDs.
values.emplace(ids[0] & 0xFFFF);
}
EXPECT_EQ(resources.size(), values.size()) << "Resource values not unique";
for (uint32_t i = 0; i < resources.size(); i++) {
EXPECT_EQ(values.count(i), 1) << "Values are not contiguous, missing " << i;
}
}
// Asserts that for a given resource type (dimen, string, drawable, etc) that
// all resources under used_list are kept and not nullified, resources not
// under used_list still have entry but nullified, and resources after
// current_entry_num are removed.
void assert_type_nullified(const std::unordered_set<std::string>& used_list,
const std::string& type,
int original_entry_num,
int current_entry_num,
ResourceTableFile* res_table) {
auto used_resources = get_resource_names_of_type(used_list, type);
std::unordered_set<uint32_t> values;
uint32_t package_and_type = 0;
for (const auto& resource : used_resources) {
auto ids = res_table->get_res_ids_by_name(resource);
EXPECT_EQ(ids.size(), 1) << "Expected only 1 resource ID for " << resource;
// Don't care about package ID or type ID, just get the entry IDs.
values.emplace(ids[0] & 0xFFFF);
package_and_type = ids[0] & 0xFFFF0000;
}
EXPECT_NE(package_and_type, 0)
<< "package_and_type remains zero after going through kepted list: "
<< type;
for (uint32_t i = 0; i < original_entry_num; i++) {
auto res_id = package_and_type | i;
if (i >= current_entry_num) {
EXPECT_EQ(res_table->id_to_name.count(res_id), 0)
<< "Values after current all entries still exist: " << res_id;
} else if (values.count(i) == 0) {
EXPECT_EQ(res_table->resource_value_count(res_id), 0)
<< "Values are not nullified: " << res_id;
} else {
EXPECT_NE(res_table->resource_value_count(res_id), 0)
<< "Values are nullified: " << res_id;
}
}
}
// Asserts that all given resources in the vector have the given number of IDs
// in the resource table, if nonzero that the corresponding R class has a static
// field with the same value.
void run_restable_field_validation(
const DexClasses& classes,
const std::unordered_set<std::string>& values_to_check,
const int num_expected_ids,
ResourceTableFile* res_table) {
for (const auto& resource : values_to_check) {
auto idx = resource.find('/');
auto type = resource.substr(0, idx);
auto name = resource.substr(idx + 1);
auto ids = res_table->get_res_ids_by_name(name);
EXPECT_EQ(ids.size(), num_expected_ids)
<< "Incorrect number of IDs for " << resource;
if (num_expected_ids == 0) {
// No more validation to do
continue;
}
if (NO_FIELD_RESOURCES.count(resource) > 0) {
// Don't look for a field if the ID is known to not generate fields.
continue;
}
auto r_cls_name = "Lcom/facebook/R$" + type + ";";
auto r_cls = find_class_named(classes, r_cls_name.c_str());
boost::replace_all(name, ".", "_");
auto field = find_sfield_named(*r_cls, name.c_str());
EXPECT_NE(nullptr, field)
<< "Could not find static R field for " << resource;
EXPECT_EQ(ids[0], field->get_static_value()->value())
<< "Constant value mismatch between resource table and R class for "
<< resource;
}
}
} // namespace
void preverify_impl(const DexClasses& classes, ResourceTableFile* res_table) {
run_restable_field_validation(classes, KEPT_RESOURCES, 1, res_table);
run_restable_field_validation(classes, UNUSED_RESOURCES, 1, res_table);
}
void postverify_impl(const DexClasses& classes, ResourceTableFile* res_table) {
run_restable_field_validation(classes, KEPT_RESOURCES, 1, res_table);
run_restable_field_validation(classes, UNUSED_RESOURCES, 0, res_table);
// Spot check a couple of types that had several things deleted, to make sure
// ID range is sensible.
assert_type_contiguous(KEPT_RESOURCES, "string", res_table);
assert_type_contiguous(KEPT_RESOURCES, "dimen", res_table);
}
void preverify_nullify_impl(const DexClasses& classes,
ResourceTableFile* res_table) {
run_restable_field_validation(classes, KEPT_RESOURCES, 1, res_table);
run_restable_field_validation(classes, UNUSED_RESOURCES, 1, res_table);
}
void postverify_nullify_impl(const DexClasses& classes,
ResourceTableFile* res_table) {
auto modified_kept_resources = KEPT_RESOURCES;
auto modified_unused_resources = UNUSED_RESOURCES;
// Firstly make sure the resource name and resource id pair is as expected
auto ids = res_table->get_res_ids_by_name("bar");
EXPECT_EQ(ids.size(), 1);
EXPECT_EQ(ids[0], 0x7f040000);
ids = res_table->get_res_ids_by_name("_an_unused_string");
EXPECT_EQ(ids.size(), 1);
EXPECT_EQ(ids[0], 0x7f090000);
ids = res_table->get_res_ids_by_name("hex_or_file2");
EXPECT_EQ(ids.size(), 1);
EXPECT_EQ(ids[0], 0x7f030003);
ids = res_table->get_res_ids_by_name("SameAttributeA");
EXPECT_EQ(ids.size(), 1);
EXPECT_EQ(ids[0], 0x7f020000);
ids = res_table->get_res_ids_by_name("medium2");
EXPECT_EQ(ids.size(), 1);
EXPECT_EQ(ids[0], 0x7f040008);
for (const auto& resource_name : ADDITIONAL_KEPT_RESOURCES) {
modified_unused_resources.erase(resource_name);
modified_kept_resources.emplace(resource_name);
}
run_restable_field_validation(classes, modified_kept_resources, 1, res_table);
run_restable_field_validation(
classes, modified_unused_resources, 0, res_table);
// Spot check a couple of types that had several things deleted, to make sure
// ID range is sensible.
assert_type_nullified(modified_kept_resources, "string", 14, 14, res_table);
assert_type_nullified(modified_kept_resources, "dimen", 15, 15, res_table);
assert_type_nullified(modified_kept_resources, "array", 2, 1, res_table);
assert_type_nullified(modified_kept_resources, "style", 12, 9, res_table);
assert_type_nullified(modified_kept_resources, "drawable", 4, 2, res_table);
}
void apk_postverify_impl(ResourcesArscFile* res_table) {
auto& pool = res_table->get_table_snapshot().get_global_strings();
std::unordered_set<std::string> global_strings;
for (int i = 0; i < pool.size(); i++) {
global_strings.emplace(arsc::get_string_from_pool(pool, i));
}
for (const auto& s : KEPT_FILE_PATHS) {
EXPECT_EQ(global_strings.count(s), 1)
<< "Global string pool should contain string " << s.c_str();
}
for (const auto& s : REMOVED_FILE_PATHS) {
EXPECT_EQ(global_strings.count(s), 0)
<< "Global string pool should NOT contain string " << s.c_str();
}
}
void apk_postverify_nullify_impl(ResourcesArscFile* res_table) {
auto modified_kept_file_paths = KEPT_FILE_PATHS;
auto modified_removed_file_paths = REMOVED_FILE_PATHS;
for (const auto& resource_name : ADDITIONAL_KEPT_FILE_PATHS) {
modified_removed_file_paths.erase(resource_name);
modified_kept_file_paths.emplace(resource_name);
}
auto& pool = res_table->get_table_snapshot().get_global_strings();
std::unordered_set<std::string> global_strings;
for (int i = 0; i < pool.size(); i++) {
global_strings.emplace(arsc::get_string_from_pool(pool, i));
}
for (const auto& s : modified_kept_file_paths) {
EXPECT_EQ(global_strings.count(s), 1)
<< "Global string pool should contain string " << s.c_str();
}
for (const auto& s : modified_removed_file_paths) {
EXPECT_EQ(global_strings.count(s), 0)
<< "Global string pool should NOT contain string " << s.c_str();
}
}
```
|
Eddie & the Showmen were an American surf rock band of the 1960s. Formed in Southern California by Eddie Bertrand, formerly of The Bel-Airs, they released several singles on Liberty Records. Their highest-charting single in Los Angeles was "Mr. Rebel", which reached number four on the Wallichs Music City Hit List on February 10, 1964.
The band originally formed because Bertrand wanted to move on from the Bel-Airs. While the Bel-Airs focused more on guitar interplay, and a moderate sound, Eddie & the Showmen played more in the style of Dick Dale with a prominent lead guitar and heavy sound. The band's original drummer was former Mouseketeer Dick Dodd, who later joined The Standells. One of the guitar players, Larry Carlton, later became a famous jazz guitarist, and another was Rob Edwards of Colours who was the guitarist on the title track for the surf movie, Pacific Vibrations.
One of Eddie & the Showmen's biggest hits, "Squad Car", was written by Paul Johnson of the Bel-Airs.
Eddie and the Showmen are included in the Hard Rock Cafe: Surf 1998 compilation of surf bands and surf music on track 11. Mr. Rebel. They are also included in The Birth of Surf compilation track 20 Squad Car and are on 10 tracks of Toes on the Nose: 32 Surf Age Instrumentals compilation.
Eddie Bertrand died of cancer in November 2012.
Singles
"Toes on the Nose" b/w "Border Town" (Liberty 55566, 1963)
"Squad Car" b/w "Scratch" (Liberty 55608, 1963)
"Mr. Rebel" b/w "Movin'" (Liberty 55659, 1963)
"Lanky Bones" b/w "Far Away Places" (Liberty 55695, 1964)
"We Are the Young" b/w "Young and Lonely" (Liberty 55720, 1964)
Albums
Squad Car (complete singles collection plus 7 bonus tracks) (AVI Records CD-5021/EMI-Capitol Special Markets 72438-18886-29, 1996)
Personnel
Eddie Bertrand - Composer, Executive Producer, Guitar Producer
Rob Edwards - Guitar (Rhythm)
Brett Brady - Guitar (Rhythm)
Larry Carlton - Guitar (Rhythm)
John Anderson - Guitar (Rhythm)
Freddy Buxton - Bass
Doug Henson - Bass
Dick Dodd - Drums
Michael Mills - Drums
Bobby Knight - Saxophone
Sterling Storm - Saxophone
Phillip Pruden - Saxophone
Nokie Edwards - Composer
R. Dodd - Composer
Lee Hazlewood - Composer
Paul Johnson - Composer
Andreas Kramer - Composer
Joan Whitney - Composer
Tom Mouton - Mastering, Mixing
Greg Vaughn - Mastering, Mixing
Pete Ciccone - Art Direction, Design
Patti Drosins - Executive Producer
Bones Howe - Producer
Drew Jessel - Assistant Producer
Lanky Linstrot - Producer
Dave Pell - Producer
Stephanie Press - Assistant Producer
Domenic Priore - Compilation Producer, Liner Notes
Rob Santos - Compilation Producer
Jim York - Producer
References
American surf music groups
Liberty Records artists
Musical groups established in 1963
Rock music groups from California
Instrumental rock musical groups
Musical groups from Los Angeles
American instrumental musical groups
|
The Government of the 1st Dáil was the executive of the unilaterally declared Irish Republic. At the 1918 Westminster election, candidates for Sinn Féin stood on an abstentionist platform, declaring that they would not remain in the Parliament of the United Kingdom but instead form a unicameral, revolutionary parliament for Ireland called Dáil Éireann.
The first meeting of the First Dáil was held on 21 January 1919 in the Round Room of the Mansion House in Dublin and made a Declaration of Independence. It also approved the Dáil Constitution. Under Article 2 of this Constitution, there would be a Ministry of Dáil Éireann led by a President, with five Secretaries leading government departments. There were two Ministries of Dáil Éireann during the First Dáil. The 1st Ministry (22 January to 1 April 1919) was led by Cathal Brugha and lasted for 69 days; it was formed when a large number of those elected for Sinn Féin were in prison. The 2nd Ministry (1 April 1919 to 26 August 1921) was led by Éamon de Valera, leader of Sinn Féin, and lasted for 878 days.
1st Ministry
The 1st Ministry was a temporary cabinet headed by Cathal Brugha, because Éamon de Valera, the leader of Sinn Féin, was in prison at the time.
2nd Ministry
On 1 April, the 1st Ministry resigned. On a motion proposed by Cathal Brugha and seconded by Pádraic Ó Máille, Éamon de Valera was declared elected as President of Dáil Éireann (). The Constitution was amended to allow for up to nine members of the Ministry, as well as the President. The following day, he formed the 2nd Ministry. Countess Markievicz became the first Irish female Cabinet minister. She served until 26 August 1921, and the next woman appointed to cabinet was Máire Geoghegan-Quinn, who was appointed as Minister for the Gaeltacht in 1979.
De Valera travelled to the United States in June 1919, and by letter requested that Arthur Griffith be appointed as Deputy President in his absence and that Ernest Blythe take a place at cabinet. De Valera resumed his position in the Dáil on 25 January 1921.
Resignation of Ministry
In May 1921, the Dáil passed a resolution declaring that elections to the House of Commons of Northern Ireland and the House of Commons of Southern Ireland would be used as the election for the Second Dáil.
The members of the 2nd Dáil first met on 16 August 1921. The outgoing Ministry did not resign immediately. On 26 August 1921, Éamon de Valera resigned as president. De Valera was then re-elected, taking the new title of President of the Republic, and formed the 3rd Ministry of Dáil Éireann.
See also
Dáil Éireann
Government of Ireland
Politics of the Republic of Ireland
1918 United Kingdom general election
References
1st Dáil
Government 01
1918 establishments in Ireland
1919 disestablishments in Ireland
Cabinets established in 1918
Cabinets disestablished in 1919
|
Slipknot is an American heavy metal band from Des Moines, Iowa. Originally formed under the name of The Pale Ones in September 1995, Slipknot have gone through multiple line-up changes, their lineup remained unaltered from 1999 until 2010 with the death of bassist Paul Gray and the departure of Joey Jordison in 2013. The line-up consists of vocalist Corey Taylor, guitarists Mick Thomson and Jim Root, percussionists Shawn Crahan and Chris Fehn, sampler Craig Jones and turntablist Sid Wilson, bassist Alessandro Venturella and drummer Jay Weinberg.
On June 29, 1999 they released their debut self-titled album Slipknot. "Wait and Bleed", a single from the album won a Kerrang! Award for Best Single in 2000 and also brought the band its first Grammy nomination for Best Metal Performance in 2001. Following the release of their second album Iowa, singles "Left Behind" and "My Plague" were also nominated for the Grammy Award for Best Metal Performance in 2002 and 2003 respectively. "My Plague" was also nominated for the Kerrang! Award for Best Video in 2002. On May 25, 2004 Slipknot released their third album Vol. 3: (The Subliminal Verses), which was nominated for Best Album in the 2004 Kerrang! Awards. In 2006, "Before I Forget" a single from the album brought the band their first Grammy Award for Best Metal Performance after six nominations. In 2008 then band released their fourth album All Hope Is Gone, "Psychosocial" single from the album brought the band their first MTV Video Music Awards nomination for Best Rock Video, as well as their seventh Grammy nomination in 2009. Slipknot received their first MTV Europe Music Awards nomination in the Rock Out category, also Kerrang! awarded the band the Kerrang! Icon award. Also in 2009 they received 6 nominations at the Kerrang! Awards, the most of any band that year and in Slipknot's history. Overall, Slipknot has received 25 awards from 59 nominations.
Emma-gaala
!Ref.
|-
| 2008
| Themselves
| Best Foreign Artist
|
|
Fuse Awards
The Fuse Awards are arranged by Fuse TV and are decided by public vote. Slipknot has received one award from two nominations.
|-
| 2008 || "Psychosocial" || Best Video ||
|-
| 2009 || "Dead Memories" || Best Video ||
Grammy Awards
The Grammy Awards are awarded annually by the National Academy of Recording Arts and Sciences. Slipknot has received only 1 award from ten nominations.
|-
| || "Wait and Bleed" ||rowspan="3"| Best Metal Performance ||
|-
| || "Left Behind" ||
|-
| || "My Plague" ||
|-
|rowspan="2"| || "Duality" || Best Hard Rock Performance ||
|-
| "Vermilion" ||rowspan="5"| Best Metal Performance ||
|-
| || "Before I Forget" ||
|-
| || "Psychosocial" ||
|-
| || "The Negative One" ||
|-
|rowspan="2"| 2016 || "Custer" ||
|-
| .5: The Gray Chapter || Best Rock Album ||
Heavy Music Awards
|-
|rowspan="4"| 2020 || Slipknot || Best Live Band ||
|-
| Slipknot || Best International Band ||
|-
| Unsainted || Best Video ||
|-
| We Are Not Your Kind || Best Album ||
|-
Hungarian Music Awards
The Hungarian Music Awards have been given to artists in the field of Hungarian music since 1992.
!Ref.
|-
| 2009
| All Hope Is Gone
| rowspan=3|Best Foreign Hard Rock or Metal Album
|
|
|-
| 2015
| .5: The Gray Chapter
|
|
|-
| 2020
| We Are Not Your Kind
|
|
Kerrang! Awards
The Kerrang! Awards is an annual awards ceremony held by Kerrang!, a British rock magazine. Slipknot has won seven awards from twenty-four nominations.
|-
|rowspan="3"| 2000 || "Wait and Bleed" || Best Single ||
|-
|rowspan="2"| Slipknot || Best International Live Act ||
|-
| Best Band in the World ||
|-
| 2001 || Slipknot || Best Band in the World ||
|-
|rowspan="3"| 2002 || "My Plague" || Best Video ||
|-
|rowspan="2"| Slipknot || Best International Live Act ||
|-
| Best Band in the World ||
|-
|rowspan="4"| 2004 || Vol. 3: (The Subliminal Verses) || Best Album ||
|-
| "Duality" || Best Video ||
|-
|rowspan="2"| Slipknot || Best Live Band ||
|-
| Best Band on the Planet ||
|-
| 2005 || Slipknot || Best Live Band ||
|-
| 2008 || Slipknot || Kerrang! Icon ||
|-
|rowspan="6"| 2009 ||rowspan="2"| Slipknot || Best Live Band ||
|-
| Best International Band ||
|-
| "Dead Memories" ||rowspan="2"| Best Single ||
|-
| "Psychosocial" ||
|-
| "Sulfur" || Best Video ||
|-
| All Hope Is Gone || Best Album ||
|-
| 2010 || "Snuff" || Best Single ||
|-
|rowspan="3"| 2015||rowspan="3"| Slipknot || Best Event ||
|-
| Best Live Band ||
|-
| Best International Band ||
|-
|rowspan="2"| 2019 ||rowspan="2"| "All Out Life" || Best Song ||
|-
| Best International Act ||
|-
Metal Hammer Golden God Awards
The Metal Hammer Golden Gods Awards is an annual awards ceremony held by Metal Hammer, a British heavy metal magazine. Slipknot has won three awards from nine nominations.
|-
| 2005 || Slipknot || Best Live Band ||
|-
| 2008 || Slipknot || Inspiration Award ||
|-
|rowspan="3"| 2009 ||rowspan="2"| Slipknot || Best Live Band ||
|-
| Best International Band ||
|-
| Mick Thomson & Jim Root || Shredder(s) ||
|-
| 2010 || Corey Taylor || Best Vocalist ||
|-
| 2011 || Joey Jordison || Best Drummer ||
|-
| 2012 || Slipknot || Best Comeback of the Year ||
|-
MTV Europe Music Awards
The MTV Europe Music Awards is an annual awards ceremony established in 1994 by MTV Europe. Slipknot has received one nomination.
|-
| 2008 || Slipknot || Rock Out ||
|-
MTV Video Music Awards
The MTV Video Music Awards were established in 1984 by MTV to celebrate the top music videos of the year. Slipknot has received one nomination.
|-
| 2008 || "Psychosocial" || Best Rock Video ||
|-
NME
Founded by the music magazine NME, the NME Awards are awarded annually. Slipknot has received three awards.
NME Premier Awards
|-
| 2000 || Slipknot || Brightest Hope ||
|-
NME Carling Awards
|-
|rowspan="2"| 2002 || Iowa || Best Album ||
|-
| Slipknot || Best Metal Band ||
|-
NME Awards 2020
|-
|rowspan="2"| 2020 || We Are Not Your Kind || Best Album In The World ||
|-
| Slipknot || Best Band In The World ||
|-
Pollstar Concert Industry Awards
The Pollstar Concert Industry Awards is an annual award ceremony to honor artists and professionals in the concert industry.
!Ref.
|-
| 2009
| All Hope Is Gone World Tour
| Most Creative Tour Package
|
|
Revolver Golden Gods Awards
The Revolver Golden Gods Awards is an annual awards ceremony held by Revolver, an American hard rock and heavy metal magazine. Slipknot has won Five awards. Lead Singer/Frontman Corey Taylor has won one.
|-
|rowspan="2"| 2009 || Slipknot || Best Live Band ||
|-
| "Psychosocial" || Best Riff ||
|-
|rowspan="1"| 2012 || Slipknot || Comeback of the Year ||
|-
|rowspan="3"| 2013 ||rowspan="2"| Slipknot || Most Dedicated Fans ||
|-
| Best Live Band ||
|-
| Corey Taylor || Best Vocalist ||
Total Guitar Readers Awards
The Total Guitar Readers Awards is an annual awards ceremony held by Total Guitar, a British guitar magazine. Slipknot has won three awards from three nominations.
|-
|rowspan="3"| 2008 ||rowspan="2"| "Psychosocial" || Best Video ||
|-
| Solo of the Year ||
|-
| Fender Jim Root Telecaster || Hottest Guitar ||
|-
Žebřík Music Awards
!Ref.
|-
| 2001
| rowspan=2|Slipknot
| Best International Surprise
|
|
|-
| 2015
| Best International Group
|
|
References
4th Annual Loudwire Music Awards: Complete Winners List
External links
Slipknot official website
Awards
Slipknot
|
Vertigo ovata, common name the ovate vertigo, is a species of minute, air-breathing land snail, a terrestrial pulmonate gastropod mollusk in the family Vertiginidae, the whorl snails.
Description
The length of the shell attains 2.3 mm, its diameter 1.4 mm.
The brown shell is dextral and subovate. Its apex is obtuse. The shell contains five glabrous whorls. The suture is not very deeply impressed. The body whorl is indented near and upon the outer lip. The aperture is semioval. The outer lip is five-toothed, of which three are situated on the transverse portion of the lip, parallel to each other, equidistant. The superior
and inferior ones are small, the latter sometimes obsolete, the intermediate one lamelliform, prominent. The two others are situated on the columella, approximate, extending at right angles to the three preceding ones, the superior one oblique and smaller. The outer lip is reflected but not flattened, bidentate, the teeth lamelliform and prominent. The umbilicus is distinct.
Distribution
This species is endemic to and widely spread in the United States, occurring in:
Texas, USA.
References
Calkins, W.W. (1880). Description and figure of a new species of Zonites from Illinois. The Valley Naturalist, 2(1): 53.
Cockerell, T. D. A. (1891). New forms of American Mollusca. Zoe. 2(1): 18.
Barker, G. M. (1999). Naturalised terrestrial Stylommatophora (Mollusca: Gastropoda). Fauna of New Zealand 38: 1-254
Rosenberg, G. & Muratov, I. V. (2006). Status report on the terrestrial Mollusca of Jamaica. Proceedings of the Academy of Natural Sciences of Philadelphia. 155: 117-161; Erratum: 156: 401 (2007).
Spencer, H.G., Marshall, B.A. & Willan, R.C. (2009). Checklist of New Zealand living Mollusca. pp 196–219 in Gordon, D.P. (ed.) New Zealand inventory of biodiversity. Volume one. Kingdom Animalia: Radiata, Lophotrochozoa, Deuterostomia. Canterbury University Press, Christchurch.
Charles, L. (2016). Inventaire de mollusques terrestres de Guadeloupe, Petites Antilles: données préliminaires. Journal MalaCo. 12: 47-56.
External links
Say, T. 1822. Description of univalve terrestrial and fluviatile shells of the United States. Journal of the Academy of Natural Sciences of Philadelphia 2(2): 370-381
Adams, C. B. (1849). Descriptions of supposed new Helicidae from Jamaica (Cont.). Contributions to Conchology. 3: 33-38
Pilsbry, H. A. (1900). Land shells from Rejectamenta of the Rio Grande at Mesilla, New Mexico, and of the Gallinas R. at Las Vegas, N. M. The Nautilus. 14(1): 9-10.
Frierson, L. S. (1900). An hour on the great raft. The Nautilus. 14(6): 67-69
https://www.biodiversitylibrary.org/page/1743664
Webster, G. W. (1892). Florida helices. The Nautilus. 15(10): 119
Clapp, G. H. (1920). Vertigo ovata and V. hebardi in Florida. The Nautilus. 33(4): 141
ovata
Molluscs of the United States
Gastropods described in 1822
Taxonomy articles created by Polbot
|
```smalltalk
using Microsoft.MixedReality.Toolkit.Editor;
using Microsoft.MixedReality.Toolkit.Utilities.Editor;
using UnityEditor;
using UnityEngine;
namespace Microsoft.MixedReality.Toolkit.Input.Editor
{
[CustomEditor(typeof(MixedRealityInputActionsProfile))]
public class MixedRealityInputActionsProfileInspector : BaseMixedRealityToolkitConfigurationProfileInspector
{
private static readonly GUIContent MinusButtonContent = new GUIContent("-", "Remove Action");
private static readonly GUIContent AddButtonContent = new GUIContent("+ Add a New Action", "Add New Action");
private static readonly GUIContent ActionContent = new GUIContent("Action", "The Name of the Action.");
private static readonly GUIContent AxisConstraintContent = new GUIContent("Axis Constraint", "Optional Axis Constraint for this input source.");
private const string ProfileTitle = "Input Action Settings";
private const string ProfileDescription = "Input Actions are any/all actions your users will be able to make when interacting with your application.\n\n" +
"After defining all your actions, you can then wire up these actions to hardware sensors, controllers, and other input devices.";
private static Vector2 scrollPosition = Vector2.zero;
private SerializedProperty inputActionList;
protected override void OnEnable()
{
base.OnEnable();
inputActionList = serializedObject.FindProperty("inputActions");
}
public override void OnInspectorGUI()
{
if (!RenderProfileHeader(ProfileTitle, ProfileDescription, target, true, BackProfileType.Input))
{
return;
}
using (new EditorGUI.DisabledGroupScope(IsProfileLock((BaseMixedRealityProfile)target)))
{
serializedObject.Update();
RenderList(inputActionList);
serializedObject.ApplyModifiedProperties();
}
}
protected override bool IsProfileInActiveInstance()
{
var profile = target as BaseMixedRealityProfile;
return MixedRealityToolkit.IsInitialized && profile != null &&
MixedRealityToolkit.Instance.ActiveProfile.InputSystemProfile != null &&
profile == MixedRealityToolkit.Instance.ActiveProfile.InputSystemProfile.InputActionsProfile;
}
private void RenderList(SerializedProperty list)
{
using (new EditorGUILayout.VerticalScope())
{
if (InspectorUIUtility.RenderIndentedButton(AddButtonContent, EditorStyles.miniButton))
{
list.arraySize += 1;
var inputAction = list.GetArrayElementAtIndex(list.arraySize - 1);
var inputActionId = inputAction.FindPropertyRelative("id");
var inputActionDescription = inputAction.FindPropertyRelative("description");
var inputActionConstraint = inputAction.FindPropertyRelative("axisConstraint");
inputActionConstraint.intValue = 0;
inputActionDescription.stringValue = $"New Action {inputActionId.intValue = list.arraySize}";
}
using (new EditorGUILayout.HorizontalScope())
{
var labelWidth = EditorGUIUtility.labelWidth;
EditorGUIUtility.labelWidth = 36f;
EditorGUILayout.LabelField(ActionContent, GUILayout.ExpandWidth(true));
EditorGUILayout.LabelField(AxisConstraintContent, GUILayout.Width(96f));
EditorGUILayout.LabelField(string.Empty, GUILayout.Width(24f));
EditorGUIUtility.labelWidth = labelWidth;
}
scrollPosition = EditorGUILayout.BeginScrollView(scrollPosition, RenderAsSubProfile ? GUILayout.Height(100f) : GUILayout.ExpandHeight(true));
for (int i = 0; i < list.arraySize; i++)
{
using (new EditorGUILayout.HorizontalScope())
{
var previousLabelWidth = EditorGUIUtility.labelWidth;
EditorGUIUtility.labelWidth = 64f;
SerializedProperty inputAction = list.GetArrayElementAtIndex(i);
SerializedProperty inputActionDescription = inputAction.FindPropertyRelative("description");
var inputActionConstraint = inputAction.FindPropertyRelative("axisConstraint");
EditorGUILayout.PropertyField(inputActionDescription, GUIContent.none);
EditorGUILayout.PropertyField(inputActionConstraint, GUIContent.none, GUILayout.Width(96f));
EditorGUIUtility.labelWidth = previousLabelWidth;
if (GUILayout.Button(MinusButtonContent, EditorStyles.miniButtonRight, GUILayout.Width(24f)))
{
list.DeleteArrayElementAtIndex(i);
}
}
}
EditorGUILayout.EndScrollView();
}
EditorGUILayout.Space();
}
}
}
```
|
```java
/*
* This file is part of ViaVersion - path_to_url
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
package com.viaversion.viaversion.api.protocol.version;
import java.util.Set;
public interface BlockedProtocolVersions {
/**
* Returns whether the given protocol version is blocked per boundary ranges or individually blocked versions.
*
* @param protocolVersion protocol version
* @return whether the given protocol version is blocked
*/
boolean contains(ProtocolVersion protocolVersion);
/**
* Returns the boundary below which protocol versions are blocked, or -1 if none is set.
*
* @return exclusive boundary below which protocol versions are blocked, or -1 if none
*/
ProtocolVersion blocksBelow();
/**
* Returns the boundary above which protocol versions are blocked, or -1 if none is set.
*
* @return exclusive boundary above which protocol versions are blocked, or -1 if none
*/
ProtocolVersion blocksAbove();
/**
* Returns a set of blocked protocol versions between the outer block ranges.
*
* @return set of blocked protocol versions between the outer block ranges
*/
Set<ProtocolVersion> singleBlockedVersions();
}
```
|
```xml
import { makeStyles, mergeClasses } from '@griffel/react';
import type { SkeletonItemSlots, SkeletonItemState } from './SkeletonItem.types';
import type { SlotClassNames } from '@fluentui/react-utilities';
import { tokens } from '@fluentui/react-theme';
export const skeletonItemClassNames: SlotClassNames<SkeletonItemSlots> = {
root: 'fui-SkeletonItem',
};
const skeletonWaveAnimation = {
to: {
transform: 'translate(100%)',
},
};
const skeletonPulseAnimation = {
'0%': {
opacity: '1',
},
'50%': {
opacity: '0.4',
},
'100%': {
opacity: '1',
},
};
/**
* Styles for the root slot
*/
const useStyles = makeStyles({
root: {
position: 'relative',
overflow: 'hidden',
'::after': {
content: '""',
display: 'block',
position: 'absolute',
inset: '0',
animationIterationCount: 'infinite',
animationDuration: '3s',
animationTimingFunction: 'ease-in-out',
'@media screen and (prefers-reduced-motion: reduce)': {
animationDuration: '0.01ms',
animationIterationCount: '1',
},
},
},
wave: {
backgroundColor: tokens.colorNeutralStencil1,
'::after': {
animationName: skeletonWaveAnimation,
backgroundImage: `linear-gradient(
to right,
${tokens.colorNeutralStencil1} 0%,
${tokens.colorNeutralStencil2} 50%,
${tokens.colorNeutralStencil1} 100%)`,
transform: 'translate(-100%)',
'@media screen and (forced-colors: active)': {
backgroundColor: 'WindowText',
},
},
},
pulse: {
'::after': {
animationName: skeletonPulseAnimation,
animationDuration: '1s',
backgroundColor: tokens.colorNeutralStencil1,
},
},
translucent: {
backgroundColor: tokens.colorNeutralStencil1Alpha,
'::after': {
backgroundImage: `linear-gradient(
to right,
transparent 0%,
${tokens.colorNeutralStencil1Alpha} 50%,
transparent 100%)`,
},
},
translucentPulse: {
backgroundColor: 'none',
'::after': {
backgroundColor: tokens.colorNeutralStencil1Alpha,
},
},
});
const useRectangleStyles = makeStyles({
root: {
width: '100%',
borderRadius: '4px',
},
8: { height: '8px' },
12: { height: '12px' },
16: { height: '16px' },
20: { height: '20px' },
24: { height: '24px' },
28: { height: '28px' },
32: { height: '32px' },
36: { height: '36px' },
40: { height: '40px' },
48: { height: '48px' },
56: { height: '56px' },
64: { height: '64px' },
72: { height: '72px' },
96: { height: '96px' },
120: { height: '120px' },
128: { height: '128px' },
});
const useSizeStyles = makeStyles({
8: { width: '8px', height: '8px' },
12: { width: '12px', height: '12px' },
16: { width: '16px', height: '16px' },
20: { width: '20px', height: '20px' },
24: { width: '24px', height: '24px' },
28: { width: '28px', height: '28px' },
32: { width: '32px', height: '32px' },
36: { width: '36px', height: '36px' },
40: { width: '40px', height: '40px' },
48: { width: '48px', height: '48px' },
56: { width: '56px', height: '56px' },
64: { width: '64px', height: '64px' },
72: { width: '72px', height: '72px' },
96: { width: '96px', height: '96px' },
120: { width: '120px', height: '120px' },
128: { width: '128px', height: '128px' },
});
const useCircleSizeStyles = makeStyles({
root: {
borderRadius: '50%',
},
});
/**
* Apply styling to the SkeletonItem slots based on the state
*/
export const useSkeletonItemStyles_unstable = (state: SkeletonItemState): SkeletonItemState => {
'use no memo';
const { animation, appearance, size, shape } = state;
const rootStyles = useStyles();
const rectStyles = useRectangleStyles();
const sizeStyles = useSizeStyles();
const circleStyles = useCircleSizeStyles();
state.root.className = mergeClasses(
skeletonItemClassNames.root,
rootStyles.root,
animation === 'wave' && rootStyles.wave,
animation === 'pulse' && rootStyles.pulse,
appearance === 'translucent' && rootStyles.translucent,
animation === 'pulse' && appearance === 'translucent' && rootStyles.translucentPulse,
shape === 'rectangle' && rectStyles.root,
shape === 'rectangle' && rectStyles[size],
shape === 'square' && sizeStyles[size],
shape === 'circle' && circleStyles.root,
shape === 'circle' && sizeStyles[size],
state.root.className,
);
return state;
};
```
|
```smalltalk
namespace Amazon.Lambda.SQSEvents
{
using System;
using System.Collections.Generic;
using System.IO;
/// <summary>
/// Simple Queue Service event
/// </summary>
public class SQSEvent
{
/// <summary>
/// Get and sets the Records
/// </summary>
public List<SQSMessage> Records { get; set; }
/// <summary>
/// Class containing the data for message attributes
/// </summary>
public class MessageAttribute
{
/// <summary>
/// Get and sets value of message attribute of type String or type Number
/// </summary>
public string StringValue { get; set; }
/// <summary>
/// Get and sets value of message attribute of type Binary
/// </summary>
public MemoryStream BinaryValue { get; set; }
/// <summary>
/// Get and sets the list of String values of message attribute
/// </summary>
public List<string> StringListValues { get; set; }
/// <summary>
/// Get and sets the list of Binary values of message attribute
/// </summary>
public List<MemoryStream> BinaryListValues { get; set; }
/// <summary>
/// Get and sets the dataType of message attribute
/// </summary>
public string DataType { get; set; }
}
/// <summary>
/// Class representing a SQS message event coming into a Lambda function
/// </summary>
public class SQSMessage
{
/// <summary>
/// Get and sets the message id
/// </summary>
public string MessageId { get; set; }
/// <summary>
/// Get and sets the receipt handle
/// </summary>
public string ReceiptHandle { get; set; }
/// <summary>
/// Get and sets the Body
/// </summary>
public string Body { get; set; }
/// <summary>
/// Get and sets the Md5OfBody
/// </summary>
public string Md5OfBody { get; set; }
/// <summary>
/// Get and sets the Md5OfMessageAttributes
/// </summary>
public string Md5OfMessageAttributes { get; set; }
/// <summary>
/// Get and sets the EventSourceArn
/// </summary>
public string EventSourceArn { get; set; }
/// <summary>
/// Get and sets the EventSource
/// </summary>
public string EventSource { get; set; }
/// <summary>
/// Get and sets the AwsRegion
/// </summary>
public string AwsRegion { get; set; }
/// <summary>
/// Get and sets the Attributes
/// </summary>
public Dictionary<string, string> Attributes { get; set; }
/// <summary>
/// Get and sets the MessageAttributes
/// </summary>
public Dictionary<string, MessageAttribute> MessageAttributes { get; set; }
}
}
}
```
|
Dreams is an album by Brazilian composer Eloy Fritsch.
AllMusic's Cesar Lanzarini said that Fritsch's debut is "a perfect example of how to combine an infinite quantity of timbres created in different synthesizers and use them as tools to explore human sensations".
Track listing
"Space Odissey" – 3:47
"The Motions of Planets" – 3:33
"Saturn" – 3:46
"Pity" – 3:11
"Crystal" – 3:35
"Electronic Dreams" – 12:14
"Mystical Ocean" – 9:38
"The Hall of Imagination" – 3:21
"Firmament" – 3:34
"Lost Temple" – 3:46
"Progressive Concert" – 6:32
References
1996 albums
Eloy Fritsch albums
|
PRODES (Programa Despoluição de Bacias Hidrográficas, or "Basin Restoration Program") is an innovative program by the Brazilian federal government to finance wastewater treatment plants while providing financial incentives to properly operate and maintain the plants. It is a type of output-based aid, as opposed to financing programs targeted only at inputs.
The program was introduced in 2001 and is managed by the National Water Agency ANA. Under it, the federal government pays utilities (mostly public state or municipal water and sanitation companies) for treating wastewater based on certified outputs. Up to half the investment costs for wastewater treatment plants are eligible to be reimbursed over three to seven years, provided that the quality of the wastewater discharged meets the norms. If the norms are not met in one trimester, a warning is issued. If they are not met in the following trimester, the payment is suspended. If the norms are still not met in the next trimester, the service provider is excluded from the program. This provides strong incentives to properly operate and maintain plants. In short, the program does not fund promises, but results.
The program enhances the financial viability of utilities and thus increases their ability to access commercial credit, through development banks (such as the Caixa Economica Federal) as well as commercial banks. The operational risk is clearly assigned to the service provider, who is best able to manage that risk. In order to prevent over-investment, the treatment plants have to be included in basin plans adopted by water basin agencies as a necessary condition to be eligible for financing under the program.
Between 2001 and 2007, PRODES leveraged investments of US$290 million with subsidies and subsidy commitments of US$94 million, financing 41 wastewater treatment plants in 32 cities serving 2 million people. The program had a portfolio of 52 other projects to be financed serving 5.7 million people. Geographically, the projects are concentrated in the southeast of Brazil, the country's most urbanized region with the most serious pollution problems.
In terms of background, financing and cost recovery for urban sanitation is a challenge throughout the world. Many utilities do not levy separate tariffs for sanitation. Where such charges exist they are usually insufficient to finance operation and maintenance costs, not to speak of capital costs. This problem is particularly acute in countries that embark on ambitious investment programs to increase the coverage of wastewater treatment. The challenge is to devise programs to channel subsidies while promoting efficiency as well as operational and environmental sustainability. PRODES is an interesting case where a program has been introduced that fits these criteria.
See also
Water supply and sanitation in Brazil
Water resources management in Brazil
Sources
ANA PRODES
World Bank Mexico Infrastructure Expenditure Review 2006 - ANNEX A: PAYMENT FOR ENVIRONMENTAL SERVICES IN WASTEWATER TREATMENT – AN EXAMPLE OF PERFORMANCE-BASED TRANSFERS
References
Waste management in Brazil
Environmental policy in Brazil
|
Emily Bauer Jenness is an American voice and stage actress. She has worked in a number of English language dubs of Japanese anime shows including Shinobu in Ninja Nonsense, Megumi Morisato in Ah! My Goddess, Dawn from the Pokémon anime and Lastelle in Nausicaä of the Valley of the Wind.
Early life
Growing up in Millburn, New Jersey, Bauer took dance, acting and singing classes at a local performing arts school and later performed in professional plays and musicals at the Paper Mill Playhouse. She attended Millburn High School and majored in both business and theatre at New York University. She graduated cum laude in 2002 and also received the Presidential Honors Scholar Award for maintaining one of the highest cumulative GPAs.
Career
Bauer has acted in Mona Lisa Smile with Julia Roberts and Long Distance with Monica Keena. In 2005, she voiced in Nausicaä of the Valley of the Wind with Alison Lohman, Patrick Stewart and Uma Thurman. In 2007, she was cast as the lead role of Dawn and as the Sinnoh League Champion Cynthia in the Pokémon: Diamond and Pearl anime series. In 2014, Bauer voiced main character Zuzu Boyle/Ray Akaba and her counterparts in Yu-Gi-Oh! Arc-V.
Bauer has an acting studio in New Jersey and continues to participate in productions in the New York City metro area.
Personal life
Bauer has two children, including her daughter actress Mia Sinclair Jenness.
Filmography
Audiobooks
Life as We Knew It
InCryptid series
Discount Armageddon (2012)
Midnight Blue-Light Special (2013)
Chaos Cheoreography (2016)
Magic for Nothing (2017)
Tricks for Free (2018)
That Ain't Witchcraft (2019)
Imaginary Numbers (2020)
Calculated Risks (2021)
Spelunking Through Hell (2022)
Ishura
Stage
References
External links
- Emily's performing arts studio in Maplewood, New Jersey
- audio review of one of the audio books that Emily reads.
Living people
Actresses from New Jersey
American stage actresses
American video game actors
American voice actresses
Millburn High School alumni
New York University alumni
People from Millburn, New Jersey
21st-century American actresses
Place of birth missing (living people)
Year of birth missing (living people)
|
The Penang Bridge is a dual carriageway toll bridge and controlled-access highway in the state of Penang, Malaysia. The bridge connects Perai on the mainland side of the state with Gelugor on the island, crossing the Penang Strait. The bridge was the first and, until 2014, the only road connection between the peninsula and the island. The bridge is the second-longest bridge over water in Malaysia, with a length over water of .
The bridge was inaugurated on 14 September 1985. The current concession holder and maintainer of the bridge is PLUS Expressways. Penang Bridge Sdn Bhd was the concession holder before it was merged with the current concessionaire.
History
Chronology
Penang Bridge Widening Project
When the bridge was initially constructed, the central span had six lanes, while the rest of the bridge had four lanes. The project to widen the entire bridge to six lanes began in January 2008 and was completed in late 2009.
Features
Penang Bridge has an overall length of : above water, on Penang Island and in Prai. The 225 m main span is 33 m above water, held up by four 101.5 m towers. The carriageway has 3 lanes in each direction and a speed limit of 70–80 km/h.
The bridge has an emergency layby equipped with SOS phone. Traffic CCTV and Variable Message Sign (VMS) are installed at all locations along the bridge. The bridge carries a Tenaga Nasional 132kV power cable.
Tolls
Since 1985, the Penang Bridge has been a tolled bridge. Fees are charged only at one direction, when entering the bridge from the mainland and travelling towards Penang Island. There are no fees imposed for mainland-bound motorists coming from the island. Since 1994, the tolls have been collected by a private concession company, Penang Bridge Sdn Bhd, which has become a member company of PLUS Malaysia Berhad. Beginning 1 January 2019, toll collection for motorcyclists was abolished for both Penang bridges. The price used to be RM1.40. Since then, the toll canopy for motorcyclists was converted into a layby for motorcyclists.
Electronic toll collection
As part of an initiative to facilitate faster transactions at the Perai Toll Plaza, all toll transactions at this toll plaza on the Penang Bridge have been exclusively conducted via electronic toll collection with the use of Touch 'n Go cards and SmartTAGs since 9 September 2015.
Fares
(Since 1 February 2020)
List of interchange
3602B Universiti Sains Malaysia (USM) Link
Commemorative events
Commemorative postage stamps to mark the opening of the Penang Bridge on 1985 were issued by the then Malaysian Postal Services Department (now Pos Malaysia) on 15 September 1985. The denominations for these stamps were 20 sen, 40 sen, and RM 1.00.
Incidents and accidents
Over the years in its operation, the bridge has been a frequent spot for road accidents and suicides.
On 20 January 2019, two cars travelling mainland bound collided and one plunged into the Malacca Strait as a result. A search operation was launched for the submerged car and the victim was later found dead.
In popular culture
Penang Bridge became a subject matter in cartoonist, Lat's comic book, Lat and Gang published in 1987 by Berita Publishing. In the comic's page 58, Lat illustrated various situations took place at the bridge.
See also
Sultan Abdul Halim Muadzam Shah Bridge
North–South Expressway
Tun Dr Lim Chong Eu Expressway
References
External links
Penang Bridge
Malaysian Highway Authority
Satellite Image of Penang Bridge at Google Maps
1985 establishments in Malaysia
Cable-stayed bridges in Malaysia
Expressways in Malaysia
Bridges completed in 1985
Expressways and highways in Penang
Toll bridges in Malaysia
Northern Corridor Economic Region
Bridges in Penang
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var bench = require( '@stdlib/bench' );
var pow = require( '@stdlib/math/base/special/pow' );
var isArray = require( '@stdlib/assert/is-array' );
var filled = require( '@stdlib/array/base/filled' );
var pkg = require( './../package.json' ).name;
var cuevery = require( './../lib' );
// FUNCTIONS //
/**
* Creates a benchmark function.
*
* @private
* @param {PositiveInteger} len - array length
* @returns {Function} benchmark function
*/
function createBenchmark( len ) {
var x = filled( 1.5, len );
return benchmark;
/**
* Benchmark function.
*
* @private
* @param {Benchmark} b - benchmark instance
*/
function benchmark( b ) {
var y;
var v;
var i;
y = filled( false, len );
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
v = cuevery.assign( x, y, 1, 0 );
if ( typeof v !== 'object' ) {
b.fail( 'should return an array' );
}
}
b.toc();
if ( !isArray( v ) ) {
b.fail( 'should return an array' );
}
b.pass( 'benchmark finished' );
b.end();
}
}
// MAIN //
/**
* Main execution sequence.
*
* @private
*/
function main() {
var len;
var min;
var max;
var f;
var i;
min = 1; // 10^min
max = 6; // 10^max
for ( i = min; i <= max; i++ ) {
len = pow( 10, i );
f = createBenchmark( len );
bench( pkg+':assign:len='+len, f );
}
}
main();
```
|
```c
/*
OpenGL loader generated by glad 0.1.29 on Sun Mar 3 23:29:47 2019.
Language/Generator: C/C++
Specification: gl
APIs: gl=3.2
Profile: core
Extensions:
Loader: True
Local files: False
Omit khrplatform: False
Reproducible: False
Commandline:
--profile="core" --api="gl=3.2" --generator="c" --spec="gl" --extensions=""
Online:
path_to_url#profile=core&language=c&specification=gl&loader=on&api=gl%3D3.2
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <glad/glad.h>
static void* get_proc(const char *namez);
#if defined(_WIN32) || defined(__CYGWIN__)
#include <windows.h>
static HMODULE libGL;
typedef void* (APIENTRYP PFNWGLGETPROCADDRESSPROC_PRIVATE)(const char*);
static PFNWGLGETPROCADDRESSPROC_PRIVATE gladGetProcAddressPtr;
#ifdef _MSC_VER
#ifdef __has_include
#if __has_include(<winapifamily.h>)
#define HAVE_WINAPIFAMILY 1
#endif
#elif _MSC_VER >= 1700 && !_USING_V110_SDK71_
#define HAVE_WINAPIFAMILY 1
#endif
#endif
#ifdef HAVE_WINAPIFAMILY
#include <winapifamily.h>
#if !WINAPI_FAMILY_PARTITION(WINAPI_PARTITION_DESKTOP) && WINAPI_FAMILY_PARTITION(WINAPI_PARTITION_APP)
#define IS_UWP 1
#endif
#endif
static
int open_gl(void) {
#ifndef IS_UWP
libGL = LoadLibraryW(L"opengl32.dll");
if(libGL != NULL) {
void (* tmp)(void);
tmp = (void(*)(void)) GetProcAddress(libGL, "wglGetProcAddress");
gladGetProcAddressPtr = (PFNWGLGETPROCADDRESSPROC_PRIVATE) tmp;
return gladGetProcAddressPtr != NULL;
}
#endif
return 0;
}
static
void close_gl(void) {
if(libGL != NULL) {
FreeLibrary((HMODULE) libGL);
libGL = NULL;
}
}
#else
#include <dlfcn.h>
static void* libGL;
#if !defined(__APPLE__) && !defined(__HAIKU__)
typedef void* (APIENTRYP PFNGLXGETPROCADDRESSPROC_PRIVATE)(const char*);
static PFNGLXGETPROCADDRESSPROC_PRIVATE gladGetProcAddressPtr;
#endif
static
int open_gl(void) {
#ifdef __APPLE__
static const char *NAMES[] = {
"../Frameworks/OpenGL.framework/OpenGL",
"/Library/Frameworks/OpenGL.framework/OpenGL",
"/System/Library/Frameworks/OpenGL.framework/OpenGL",
"/System/Library/Frameworks/OpenGL.framework/Versions/Current/OpenGL"
};
#else
static const char *NAMES[] = {"libGL.so.1", "libGL.so"};
#endif
unsigned int index = 0;
for(index = 0; index < (sizeof(NAMES) / sizeof(NAMES[0])); index++) {
libGL = dlopen(NAMES[index], RTLD_NOW | RTLD_GLOBAL);
if(libGL != NULL) {
#if defined(__APPLE__) || defined(__HAIKU__)
return 1;
#else
gladGetProcAddressPtr = (PFNGLXGETPROCADDRESSPROC_PRIVATE)dlsym(libGL,
"glXGetProcAddressARB");
return gladGetProcAddressPtr != NULL;
#endif
}
}
return 0;
}
static
void close_gl(void) {
if(libGL != NULL) {
dlclose(libGL);
libGL = NULL;
}
}
#endif
static
void* get_proc(const char *namez) {
void* result = NULL;
if(libGL == NULL) return NULL;
#if !defined(__APPLE__) && !defined(__HAIKU__)
if(gladGetProcAddressPtr != NULL) {
result = gladGetProcAddressPtr(namez);
}
#endif
if(result == NULL) {
#if defined(_WIN32) || defined(__CYGWIN__)
result = (void*)GetProcAddress((HMODULE) libGL, namez);
#else
result = dlsym(libGL, namez);
#endif
}
return result;
}
int gladLoadGL(void) {
int status = 0;
if(open_gl()) {
status = gladLoadGLLoader(&get_proc);
close_gl();
}
return status;
}
struct gladGLversionStruct GLVersion = { 0, 0 };
#if defined(GL_ES_VERSION_3_0) || defined(GL_VERSION_3_0)
#define _GLAD_IS_SOME_NEW_VERSION 1
#endif
static int max_loaded_major;
static int max_loaded_minor;
static const char *exts = NULL;
static int num_exts_i = 0;
static char **exts_i = NULL;
static int get_exts(void) {
#ifdef _GLAD_IS_SOME_NEW_VERSION
if(max_loaded_major < 3) {
#endif
exts = (const char *)glGetString(GL_EXTENSIONS);
#ifdef _GLAD_IS_SOME_NEW_VERSION
} else {
unsigned int index;
num_exts_i = 0;
glGetIntegerv(GL_NUM_EXTENSIONS, &num_exts_i);
if (num_exts_i > 0) {
exts_i = (char **)malloc((size_t)num_exts_i * (sizeof *exts_i));
}
if (exts_i == NULL) {
return 0;
}
for(index = 0; index < (unsigned)num_exts_i; index++) {
const char *gl_str_tmp = (const char*)glGetStringi(GL_EXTENSIONS, index);
size_t len = strlen(gl_str_tmp);
char *local_str = (char*)malloc((len+1) * sizeof(char));
if(local_str != NULL) {
memcpy(local_str, gl_str_tmp, (len+1) * sizeof(char));
}
exts_i[index] = local_str;
}
}
#endif
return 1;
}
static void free_exts(void) {
if (exts_i != NULL) {
int index;
for(index = 0; index < num_exts_i; index++) {
free((char *)exts_i[index]);
}
free((void *)exts_i);
exts_i = NULL;
}
}
static int has_ext(const char *ext) {
#ifdef _GLAD_IS_SOME_NEW_VERSION
if(max_loaded_major < 3) {
#endif
const char *extensions;
const char *loc;
const char *terminator;
extensions = exts;
if(extensions == NULL || ext == NULL) {
return 0;
}
while(1) {
loc = strstr(extensions, ext);
if(loc == NULL) {
return 0;
}
terminator = loc + strlen(ext);
if((loc == extensions || *(loc - 1) == ' ') &&
(*terminator == ' ' || *terminator == '\0')) {
return 1;
}
extensions = terminator;
}
#ifdef _GLAD_IS_SOME_NEW_VERSION
} else {
int index;
if(exts_i == NULL) return 0;
for(index = 0; index < num_exts_i; index++) {
const char *e = exts_i[index];
if(exts_i[index] != NULL && strcmp(e, ext) == 0) {
return 1;
}
}
}
#endif
return 0;
}
int GLAD_GL_VERSION_1_0 = 0;
int GLAD_GL_VERSION_1_1 = 0;
int GLAD_GL_VERSION_1_2 = 0;
int GLAD_GL_VERSION_1_3 = 0;
int GLAD_GL_VERSION_1_4 = 0;
int GLAD_GL_VERSION_1_5 = 0;
int GLAD_GL_VERSION_2_0 = 0;
int GLAD_GL_VERSION_2_1 = 0;
int GLAD_GL_VERSION_3_0 = 0;
int GLAD_GL_VERSION_3_1 = 0;
int GLAD_GL_VERSION_3_2 = 0;
PFNGLACTIVETEXTUREPROC glad_glActiveTexture = NULL;
PFNGLATTACHSHADERPROC glad_glAttachShader = NULL;
PFNGLBEGINCONDITIONALRENDERPROC glad_glBeginConditionalRender = NULL;
PFNGLBEGINQUERYPROC glad_glBeginQuery = NULL;
PFNGLBEGINTRANSFORMFEEDBACKPROC glad_glBeginTransformFeedback = NULL;
PFNGLBINDATTRIBLOCATIONPROC glad_glBindAttribLocation = NULL;
PFNGLBINDBUFFERPROC glad_glBindBuffer = NULL;
PFNGLBINDBUFFERBASEPROC glad_glBindBufferBase = NULL;
PFNGLBINDBUFFERRANGEPROC glad_glBindBufferRange = NULL;
PFNGLBINDFRAGDATALOCATIONPROC glad_glBindFragDataLocation = NULL;
PFNGLBINDFRAMEBUFFERPROC glad_glBindFramebuffer = NULL;
PFNGLBINDRENDERBUFFERPROC glad_glBindRenderbuffer = NULL;
PFNGLBINDTEXTUREPROC glad_glBindTexture = NULL;
PFNGLBINDVERTEXARRAYPROC glad_glBindVertexArray = NULL;
PFNGLBLENDCOLORPROC glad_glBlendColor = NULL;
PFNGLBLENDEQUATIONPROC glad_glBlendEquation = NULL;
PFNGLBLENDEQUATIONSEPARATEPROC glad_glBlendEquationSeparate = NULL;
PFNGLBLENDFUNCPROC glad_glBlendFunc = NULL;
PFNGLBLENDFUNCSEPARATEPROC glad_glBlendFuncSeparate = NULL;
PFNGLBLITFRAMEBUFFERPROC glad_glBlitFramebuffer = NULL;
PFNGLBUFFERDATAPROC glad_glBufferData = NULL;
PFNGLBUFFERSUBDATAPROC glad_glBufferSubData = NULL;
PFNGLCHECKFRAMEBUFFERSTATUSPROC glad_glCheckFramebufferStatus = NULL;
PFNGLCLAMPCOLORPROC glad_glClampColor = NULL;
PFNGLCLEARPROC glad_glClear = NULL;
PFNGLCLEARBUFFERFIPROC glad_glClearBufferfi = NULL;
PFNGLCLEARBUFFERFVPROC glad_glClearBufferfv = NULL;
PFNGLCLEARBUFFERIVPROC glad_glClearBufferiv = NULL;
PFNGLCLEARBUFFERUIVPROC glad_glClearBufferuiv = NULL;
PFNGLCLEARCOLORPROC glad_glClearColor = NULL;
PFNGLCLEARDEPTHPROC glad_glClearDepth = NULL;
PFNGLCLEARSTENCILPROC glad_glClearStencil = NULL;
PFNGLCLIENTWAITSYNCPROC glad_glClientWaitSync = NULL;
PFNGLCOLORMASKPROC glad_glColorMask = NULL;
PFNGLCOLORMASKIPROC glad_glColorMaski = NULL;
PFNGLCOMPILESHADERPROC glad_glCompileShader = NULL;
PFNGLCOMPRESSEDTEXIMAGE1DPROC glad_glCompressedTexImage1D = NULL;
PFNGLCOMPRESSEDTEXIMAGE2DPROC glad_glCompressedTexImage2D = NULL;
PFNGLCOMPRESSEDTEXIMAGE3DPROC glad_glCompressedTexImage3D = NULL;
PFNGLCOMPRESSEDTEXSUBIMAGE1DPROC glad_glCompressedTexSubImage1D = NULL;
PFNGLCOMPRESSEDTEXSUBIMAGE2DPROC glad_glCompressedTexSubImage2D = NULL;
PFNGLCOMPRESSEDTEXSUBIMAGE3DPROC glad_glCompressedTexSubImage3D = NULL;
PFNGLCOPYBUFFERSUBDATAPROC glad_glCopyBufferSubData = NULL;
PFNGLCOPYTEXIMAGE1DPROC glad_glCopyTexImage1D = NULL;
PFNGLCOPYTEXIMAGE2DPROC glad_glCopyTexImage2D = NULL;
PFNGLCOPYTEXSUBIMAGE1DPROC glad_glCopyTexSubImage1D = NULL;
PFNGLCOPYTEXSUBIMAGE2DPROC glad_glCopyTexSubImage2D = NULL;
PFNGLCOPYTEXSUBIMAGE3DPROC glad_glCopyTexSubImage3D = NULL;
PFNGLCREATEPROGRAMPROC glad_glCreateProgram = NULL;
PFNGLCREATESHADERPROC glad_glCreateShader = NULL;
PFNGLCULLFACEPROC glad_glCullFace = NULL;
PFNGLDELETEBUFFERSPROC glad_glDeleteBuffers = NULL;
PFNGLDELETEFRAMEBUFFERSPROC glad_glDeleteFramebuffers = NULL;
PFNGLDELETEPROGRAMPROC glad_glDeleteProgram = NULL;
PFNGLDELETEQUERIESPROC glad_glDeleteQueries = NULL;
PFNGLDELETERENDERBUFFERSPROC glad_glDeleteRenderbuffers = NULL;
PFNGLDELETESHADERPROC glad_glDeleteShader = NULL;
PFNGLDELETESYNCPROC glad_glDeleteSync = NULL;
PFNGLDELETETEXTURESPROC glad_glDeleteTextures = NULL;
PFNGLDELETEVERTEXARRAYSPROC glad_glDeleteVertexArrays = NULL;
PFNGLDEPTHFUNCPROC glad_glDepthFunc = NULL;
PFNGLDEPTHMASKPROC glad_glDepthMask = NULL;
PFNGLDEPTHRANGEPROC glad_glDepthRange = NULL;
PFNGLDETACHSHADERPROC glad_glDetachShader = NULL;
PFNGLDISABLEPROC glad_glDisable = NULL;
PFNGLDISABLEVERTEXATTRIBARRAYPROC glad_glDisableVertexAttribArray = NULL;
PFNGLDISABLEIPROC glad_glDisablei = NULL;
PFNGLDRAWARRAYSPROC glad_glDrawArrays = NULL;
PFNGLDRAWARRAYSINSTANCEDPROC glad_glDrawArraysInstanced = NULL;
PFNGLDRAWBUFFERPROC glad_glDrawBuffer = NULL;
PFNGLDRAWBUFFERSPROC glad_glDrawBuffers = NULL;
PFNGLDRAWELEMENTSPROC glad_glDrawElements = NULL;
PFNGLDRAWELEMENTSBASEVERTEXPROC glad_glDrawElementsBaseVertex = NULL;
PFNGLDRAWELEMENTSINSTANCEDPROC glad_glDrawElementsInstanced = NULL;
PFNGLDRAWELEMENTSINSTANCEDBASEVERTEXPROC glad_glDrawElementsInstancedBaseVertex = NULL;
PFNGLDRAWRANGEELEMENTSPROC glad_glDrawRangeElements = NULL;
PFNGLDRAWRANGEELEMENTSBASEVERTEXPROC glad_glDrawRangeElementsBaseVertex = NULL;
PFNGLENABLEPROC glad_glEnable = NULL;
PFNGLENABLEVERTEXATTRIBARRAYPROC glad_glEnableVertexAttribArray = NULL;
PFNGLENABLEIPROC glad_glEnablei = NULL;
PFNGLENDCONDITIONALRENDERPROC glad_glEndConditionalRender = NULL;
PFNGLENDQUERYPROC glad_glEndQuery = NULL;
PFNGLENDTRANSFORMFEEDBACKPROC glad_glEndTransformFeedback = NULL;
PFNGLFENCESYNCPROC glad_glFenceSync = NULL;
PFNGLFINISHPROC glad_glFinish = NULL;
PFNGLFLUSHPROC glad_glFlush = NULL;
PFNGLFLUSHMAPPEDBUFFERRANGEPROC glad_glFlushMappedBufferRange = NULL;
PFNGLFRAMEBUFFERRENDERBUFFERPROC glad_glFramebufferRenderbuffer = NULL;
PFNGLFRAMEBUFFERTEXTUREPROC glad_glFramebufferTexture = NULL;
PFNGLFRAMEBUFFERTEXTURE1DPROC glad_glFramebufferTexture1D = NULL;
PFNGLFRAMEBUFFERTEXTURE2DPROC glad_glFramebufferTexture2D = NULL;
PFNGLFRAMEBUFFERTEXTURE3DPROC glad_glFramebufferTexture3D = NULL;
PFNGLFRAMEBUFFERTEXTURELAYERPROC glad_glFramebufferTextureLayer = NULL;
PFNGLFRONTFACEPROC glad_glFrontFace = NULL;
PFNGLGENBUFFERSPROC glad_glGenBuffers = NULL;
PFNGLGENFRAMEBUFFERSPROC glad_glGenFramebuffers = NULL;
PFNGLGENQUERIESPROC glad_glGenQueries = NULL;
PFNGLGENRENDERBUFFERSPROC glad_glGenRenderbuffers = NULL;
PFNGLGENTEXTURESPROC glad_glGenTextures = NULL;
PFNGLGENVERTEXARRAYSPROC glad_glGenVertexArrays = NULL;
PFNGLGENERATEMIPMAPPROC glad_glGenerateMipmap = NULL;
PFNGLGETACTIVEATTRIBPROC glad_glGetActiveAttrib = NULL;
PFNGLGETACTIVEUNIFORMPROC glad_glGetActiveUniform = NULL;
PFNGLGETACTIVEUNIFORMBLOCKNAMEPROC glad_glGetActiveUniformBlockName = NULL;
PFNGLGETACTIVEUNIFORMBLOCKIVPROC glad_glGetActiveUniformBlockiv = NULL;
PFNGLGETACTIVEUNIFORMNAMEPROC glad_glGetActiveUniformName = NULL;
PFNGLGETACTIVEUNIFORMSIVPROC glad_glGetActiveUniformsiv = NULL;
PFNGLGETATTACHEDSHADERSPROC glad_glGetAttachedShaders = NULL;
PFNGLGETATTRIBLOCATIONPROC glad_glGetAttribLocation = NULL;
PFNGLGETBOOLEANI_VPROC glad_glGetBooleani_v = NULL;
PFNGLGETBOOLEANVPROC glad_glGetBooleanv = NULL;
PFNGLGETBUFFERPARAMETERI64VPROC glad_glGetBufferParameteri64v = NULL;
PFNGLGETBUFFERPARAMETERIVPROC glad_glGetBufferParameteriv = NULL;
PFNGLGETBUFFERPOINTERVPROC glad_glGetBufferPointerv = NULL;
PFNGLGETBUFFERSUBDATAPROC glad_glGetBufferSubData = NULL;
PFNGLGETCOMPRESSEDTEXIMAGEPROC glad_glGetCompressedTexImage = NULL;
PFNGLGETDOUBLEVPROC glad_glGetDoublev = NULL;
PFNGLGETERRORPROC glad_glGetError = NULL;
PFNGLGETFLOATVPROC glad_glGetFloatv = NULL;
PFNGLGETFRAGDATALOCATIONPROC glad_glGetFragDataLocation = NULL;
PFNGLGETFRAMEBUFFERATTACHMENTPARAMETERIVPROC glad_glGetFramebufferAttachmentParameteriv = NULL;
PFNGLGETINTEGER64I_VPROC glad_glGetInteger64i_v = NULL;
PFNGLGETINTEGER64VPROC glad_glGetInteger64v = NULL;
PFNGLGETINTEGERI_VPROC glad_glGetIntegeri_v = NULL;
PFNGLGETINTEGERVPROC glad_glGetIntegerv = NULL;
PFNGLGETMULTISAMPLEFVPROC glad_glGetMultisamplefv = NULL;
PFNGLGETPROGRAMINFOLOGPROC glad_glGetProgramInfoLog = NULL;
PFNGLGETPROGRAMIVPROC glad_glGetProgramiv = NULL;
PFNGLGETQUERYOBJECTIVPROC glad_glGetQueryObjectiv = NULL;
PFNGLGETQUERYOBJECTUIVPROC glad_glGetQueryObjectuiv = NULL;
PFNGLGETQUERYIVPROC glad_glGetQueryiv = NULL;
PFNGLGETRENDERBUFFERPARAMETERIVPROC glad_glGetRenderbufferParameteriv = NULL;
PFNGLGETSHADERINFOLOGPROC glad_glGetShaderInfoLog = NULL;
PFNGLGETSHADERSOURCEPROC glad_glGetShaderSource = NULL;
PFNGLGETSHADERIVPROC glad_glGetShaderiv = NULL;
PFNGLGETSTRINGPROC glad_glGetString = NULL;
PFNGLGETSTRINGIPROC glad_glGetStringi = NULL;
PFNGLGETSYNCIVPROC glad_glGetSynciv = NULL;
PFNGLGETTEXIMAGEPROC glad_glGetTexImage = NULL;
PFNGLGETTEXLEVELPARAMETERFVPROC glad_glGetTexLevelParameterfv = NULL;
PFNGLGETTEXLEVELPARAMETERIVPROC glad_glGetTexLevelParameteriv = NULL;
PFNGLGETTEXPARAMETERIIVPROC glad_glGetTexParameterIiv = NULL;
PFNGLGETTEXPARAMETERIUIVPROC glad_glGetTexParameterIuiv = NULL;
PFNGLGETTEXPARAMETERFVPROC glad_glGetTexParameterfv = NULL;
PFNGLGETTEXPARAMETERIVPROC glad_glGetTexParameteriv = NULL;
PFNGLGETTRANSFORMFEEDBACKVARYINGPROC glad_glGetTransformFeedbackVarying = NULL;
PFNGLGETUNIFORMBLOCKINDEXPROC glad_glGetUniformBlockIndex = NULL;
PFNGLGETUNIFORMINDICESPROC glad_glGetUniformIndices = NULL;
PFNGLGETUNIFORMLOCATIONPROC glad_glGetUniformLocation = NULL;
PFNGLGETUNIFORMFVPROC glad_glGetUniformfv = NULL;
PFNGLGETUNIFORMIVPROC glad_glGetUniformiv = NULL;
PFNGLGETUNIFORMUIVPROC glad_glGetUniformuiv = NULL;
PFNGLGETVERTEXATTRIBIIVPROC glad_glGetVertexAttribIiv = NULL;
PFNGLGETVERTEXATTRIBIUIVPROC glad_glGetVertexAttribIuiv = NULL;
PFNGLGETVERTEXATTRIBPOINTERVPROC glad_glGetVertexAttribPointerv = NULL;
PFNGLGETVERTEXATTRIBDVPROC glad_glGetVertexAttribdv = NULL;
PFNGLGETVERTEXATTRIBFVPROC glad_glGetVertexAttribfv = NULL;
PFNGLGETVERTEXATTRIBIVPROC glad_glGetVertexAttribiv = NULL;
PFNGLHINTPROC glad_glHint = NULL;
PFNGLISBUFFERPROC glad_glIsBuffer = NULL;
PFNGLISENABLEDPROC glad_glIsEnabled = NULL;
PFNGLISENABLEDIPROC glad_glIsEnabledi = NULL;
PFNGLISFRAMEBUFFERPROC glad_glIsFramebuffer = NULL;
PFNGLISPROGRAMPROC glad_glIsProgram = NULL;
PFNGLISQUERYPROC glad_glIsQuery = NULL;
PFNGLISRENDERBUFFERPROC glad_glIsRenderbuffer = NULL;
PFNGLISSHADERPROC glad_glIsShader = NULL;
PFNGLISSYNCPROC glad_glIsSync = NULL;
PFNGLISTEXTUREPROC glad_glIsTexture = NULL;
PFNGLISVERTEXARRAYPROC glad_glIsVertexArray = NULL;
PFNGLLINEWIDTHPROC glad_glLineWidth = NULL;
PFNGLLINKPROGRAMPROC glad_glLinkProgram = NULL;
PFNGLLOGICOPPROC glad_glLogicOp = NULL;
PFNGLMAPBUFFERPROC glad_glMapBuffer = NULL;
PFNGLMAPBUFFERRANGEPROC glad_glMapBufferRange = NULL;
PFNGLMULTIDRAWARRAYSPROC glad_glMultiDrawArrays = NULL;
PFNGLMULTIDRAWELEMENTSPROC glad_glMultiDrawElements = NULL;
PFNGLMULTIDRAWELEMENTSBASEVERTEXPROC glad_glMultiDrawElementsBaseVertex = NULL;
PFNGLPIXELSTOREFPROC glad_glPixelStoref = NULL;
PFNGLPIXELSTOREIPROC glad_glPixelStorei = NULL;
PFNGLPOINTPARAMETERFPROC glad_glPointParameterf = NULL;
PFNGLPOINTPARAMETERFVPROC glad_glPointParameterfv = NULL;
PFNGLPOINTPARAMETERIPROC glad_glPointParameteri = NULL;
PFNGLPOINTPARAMETERIVPROC glad_glPointParameteriv = NULL;
PFNGLPOINTSIZEPROC glad_glPointSize = NULL;
PFNGLPOLYGONMODEPROC glad_glPolygonMode = NULL;
PFNGLPOLYGONOFFSETPROC glad_glPolygonOffset = NULL;
PFNGLPRIMITIVERESTARTINDEXPROC glad_glPrimitiveRestartIndex = NULL;
PFNGLPROVOKINGVERTEXPROC glad_glProvokingVertex = NULL;
PFNGLREADBUFFERPROC glad_glReadBuffer = NULL;
PFNGLREADPIXELSPROC glad_glReadPixels = NULL;
PFNGLRENDERBUFFERSTORAGEPROC glad_glRenderbufferStorage = NULL;
PFNGLRENDERBUFFERSTORAGEMULTISAMPLEPROC glad_glRenderbufferStorageMultisample = NULL;
PFNGLSAMPLECOVERAGEPROC glad_glSampleCoverage = NULL;
PFNGLSAMPLEMASKIPROC glad_glSampleMaski = NULL;
PFNGLSCISSORPROC glad_glScissor = NULL;
PFNGLSHADERSOURCEPROC glad_glShaderSource = NULL;
PFNGLSTENCILFUNCPROC glad_glStencilFunc = NULL;
PFNGLSTENCILFUNCSEPARATEPROC glad_glStencilFuncSeparate = NULL;
PFNGLSTENCILMASKPROC glad_glStencilMask = NULL;
PFNGLSTENCILMASKSEPARATEPROC glad_glStencilMaskSeparate = NULL;
PFNGLSTENCILOPPROC glad_glStencilOp = NULL;
PFNGLSTENCILOPSEPARATEPROC glad_glStencilOpSeparate = NULL;
PFNGLTEXBUFFERPROC glad_glTexBuffer = NULL;
PFNGLTEXIMAGE1DPROC glad_glTexImage1D = NULL;
PFNGLTEXIMAGE2DPROC glad_glTexImage2D = NULL;
PFNGLTEXIMAGE2DMULTISAMPLEPROC glad_glTexImage2DMultisample = NULL;
PFNGLTEXIMAGE3DPROC glad_glTexImage3D = NULL;
PFNGLTEXIMAGE3DMULTISAMPLEPROC glad_glTexImage3DMultisample = NULL;
PFNGLTEXPARAMETERIIVPROC glad_glTexParameterIiv = NULL;
PFNGLTEXPARAMETERIUIVPROC glad_glTexParameterIuiv = NULL;
PFNGLTEXPARAMETERFPROC glad_glTexParameterf = NULL;
PFNGLTEXPARAMETERFVPROC glad_glTexParameterfv = NULL;
PFNGLTEXPARAMETERIPROC glad_glTexParameteri = NULL;
PFNGLTEXPARAMETERIVPROC glad_glTexParameteriv = NULL;
PFNGLTEXSUBIMAGE1DPROC glad_glTexSubImage1D = NULL;
PFNGLTEXSUBIMAGE2DPROC glad_glTexSubImage2D = NULL;
PFNGLTEXSUBIMAGE3DPROC glad_glTexSubImage3D = NULL;
PFNGLTRANSFORMFEEDBACKVARYINGSPROC glad_glTransformFeedbackVaryings = NULL;
PFNGLUNIFORM1FPROC glad_glUniform1f = NULL;
PFNGLUNIFORM1FVPROC glad_glUniform1fv = NULL;
PFNGLUNIFORM1IPROC glad_glUniform1i = NULL;
PFNGLUNIFORM1IVPROC glad_glUniform1iv = NULL;
PFNGLUNIFORM1UIPROC glad_glUniform1ui = NULL;
PFNGLUNIFORM1UIVPROC glad_glUniform1uiv = NULL;
PFNGLUNIFORM2FPROC glad_glUniform2f = NULL;
PFNGLUNIFORM2FVPROC glad_glUniform2fv = NULL;
PFNGLUNIFORM2IPROC glad_glUniform2i = NULL;
PFNGLUNIFORM2IVPROC glad_glUniform2iv = NULL;
PFNGLUNIFORM2UIPROC glad_glUniform2ui = NULL;
PFNGLUNIFORM2UIVPROC glad_glUniform2uiv = NULL;
PFNGLUNIFORM3FPROC glad_glUniform3f = NULL;
PFNGLUNIFORM3FVPROC glad_glUniform3fv = NULL;
PFNGLUNIFORM3IPROC glad_glUniform3i = NULL;
PFNGLUNIFORM3IVPROC glad_glUniform3iv = NULL;
PFNGLUNIFORM3UIPROC glad_glUniform3ui = NULL;
PFNGLUNIFORM3UIVPROC glad_glUniform3uiv = NULL;
PFNGLUNIFORM4FPROC glad_glUniform4f = NULL;
PFNGLUNIFORM4FVPROC glad_glUniform4fv = NULL;
PFNGLUNIFORM4IPROC glad_glUniform4i = NULL;
PFNGLUNIFORM4IVPROC glad_glUniform4iv = NULL;
PFNGLUNIFORM4UIPROC glad_glUniform4ui = NULL;
PFNGLUNIFORM4UIVPROC glad_glUniform4uiv = NULL;
PFNGLUNIFORMBLOCKBINDINGPROC glad_glUniformBlockBinding = NULL;
PFNGLUNIFORMMATRIX2FVPROC glad_glUniformMatrix2fv = NULL;
PFNGLUNIFORMMATRIX2X3FVPROC glad_glUniformMatrix2x3fv = NULL;
PFNGLUNIFORMMATRIX2X4FVPROC glad_glUniformMatrix2x4fv = NULL;
PFNGLUNIFORMMATRIX3FVPROC glad_glUniformMatrix3fv = NULL;
PFNGLUNIFORMMATRIX3X2FVPROC glad_glUniformMatrix3x2fv = NULL;
PFNGLUNIFORMMATRIX3X4FVPROC glad_glUniformMatrix3x4fv = NULL;
PFNGLUNIFORMMATRIX4FVPROC glad_glUniformMatrix4fv = NULL;
PFNGLUNIFORMMATRIX4X2FVPROC glad_glUniformMatrix4x2fv = NULL;
PFNGLUNIFORMMATRIX4X3FVPROC glad_glUniformMatrix4x3fv = NULL;
PFNGLUNMAPBUFFERPROC glad_glUnmapBuffer = NULL;
PFNGLUSEPROGRAMPROC glad_glUseProgram = NULL;
PFNGLVALIDATEPROGRAMPROC glad_glValidateProgram = NULL;
PFNGLVERTEXATTRIB1DPROC glad_glVertexAttrib1d = NULL;
PFNGLVERTEXATTRIB1DVPROC glad_glVertexAttrib1dv = NULL;
PFNGLVERTEXATTRIB1FPROC glad_glVertexAttrib1f = NULL;
PFNGLVERTEXATTRIB1FVPROC glad_glVertexAttrib1fv = NULL;
PFNGLVERTEXATTRIB1SPROC glad_glVertexAttrib1s = NULL;
PFNGLVERTEXATTRIB1SVPROC glad_glVertexAttrib1sv = NULL;
PFNGLVERTEXATTRIB2DPROC glad_glVertexAttrib2d = NULL;
PFNGLVERTEXATTRIB2DVPROC glad_glVertexAttrib2dv = NULL;
PFNGLVERTEXATTRIB2FPROC glad_glVertexAttrib2f = NULL;
PFNGLVERTEXATTRIB2FVPROC glad_glVertexAttrib2fv = NULL;
PFNGLVERTEXATTRIB2SPROC glad_glVertexAttrib2s = NULL;
PFNGLVERTEXATTRIB2SVPROC glad_glVertexAttrib2sv = NULL;
PFNGLVERTEXATTRIB3DPROC glad_glVertexAttrib3d = NULL;
PFNGLVERTEXATTRIB3DVPROC glad_glVertexAttrib3dv = NULL;
PFNGLVERTEXATTRIB3FPROC glad_glVertexAttrib3f = NULL;
PFNGLVERTEXATTRIB3FVPROC glad_glVertexAttrib3fv = NULL;
PFNGLVERTEXATTRIB3SPROC glad_glVertexAttrib3s = NULL;
PFNGLVERTEXATTRIB3SVPROC glad_glVertexAttrib3sv = NULL;
PFNGLVERTEXATTRIB4NBVPROC glad_glVertexAttrib4Nbv = NULL;
PFNGLVERTEXATTRIB4NIVPROC glad_glVertexAttrib4Niv = NULL;
PFNGLVERTEXATTRIB4NSVPROC glad_glVertexAttrib4Nsv = NULL;
PFNGLVERTEXATTRIB4NUBPROC glad_glVertexAttrib4Nub = NULL;
PFNGLVERTEXATTRIB4NUBVPROC glad_glVertexAttrib4Nubv = NULL;
PFNGLVERTEXATTRIB4NUIVPROC glad_glVertexAttrib4Nuiv = NULL;
PFNGLVERTEXATTRIB4NUSVPROC glad_glVertexAttrib4Nusv = NULL;
PFNGLVERTEXATTRIB4BVPROC glad_glVertexAttrib4bv = NULL;
PFNGLVERTEXATTRIB4DPROC glad_glVertexAttrib4d = NULL;
PFNGLVERTEXATTRIB4DVPROC glad_glVertexAttrib4dv = NULL;
PFNGLVERTEXATTRIB4FPROC glad_glVertexAttrib4f = NULL;
PFNGLVERTEXATTRIB4FVPROC glad_glVertexAttrib4fv = NULL;
PFNGLVERTEXATTRIB4IVPROC glad_glVertexAttrib4iv = NULL;
PFNGLVERTEXATTRIB4SPROC glad_glVertexAttrib4s = NULL;
PFNGLVERTEXATTRIB4SVPROC glad_glVertexAttrib4sv = NULL;
PFNGLVERTEXATTRIB4UBVPROC glad_glVertexAttrib4ubv = NULL;
PFNGLVERTEXATTRIB4UIVPROC glad_glVertexAttrib4uiv = NULL;
PFNGLVERTEXATTRIB4USVPROC glad_glVertexAttrib4usv = NULL;
PFNGLVERTEXATTRIBI1IPROC glad_glVertexAttribI1i = NULL;
PFNGLVERTEXATTRIBI1IVPROC glad_glVertexAttribI1iv = NULL;
PFNGLVERTEXATTRIBI1UIPROC glad_glVertexAttribI1ui = NULL;
PFNGLVERTEXATTRIBI1UIVPROC glad_glVertexAttribI1uiv = NULL;
PFNGLVERTEXATTRIBI2IPROC glad_glVertexAttribI2i = NULL;
PFNGLVERTEXATTRIBI2IVPROC glad_glVertexAttribI2iv = NULL;
PFNGLVERTEXATTRIBI2UIPROC glad_glVertexAttribI2ui = NULL;
PFNGLVERTEXATTRIBI2UIVPROC glad_glVertexAttribI2uiv = NULL;
PFNGLVERTEXATTRIBI3IPROC glad_glVertexAttribI3i = NULL;
PFNGLVERTEXATTRIBI3IVPROC glad_glVertexAttribI3iv = NULL;
PFNGLVERTEXATTRIBI3UIPROC glad_glVertexAttribI3ui = NULL;
PFNGLVERTEXATTRIBI3UIVPROC glad_glVertexAttribI3uiv = NULL;
PFNGLVERTEXATTRIBI4BVPROC glad_glVertexAttribI4bv = NULL;
PFNGLVERTEXATTRIBI4IPROC glad_glVertexAttribI4i = NULL;
PFNGLVERTEXATTRIBI4IVPROC glad_glVertexAttribI4iv = NULL;
PFNGLVERTEXATTRIBI4SVPROC glad_glVertexAttribI4sv = NULL;
PFNGLVERTEXATTRIBI4UBVPROC glad_glVertexAttribI4ubv = NULL;
PFNGLVERTEXATTRIBI4UIPROC glad_glVertexAttribI4ui = NULL;
PFNGLVERTEXATTRIBI4UIVPROC glad_glVertexAttribI4uiv = NULL;
PFNGLVERTEXATTRIBI4USVPROC glad_glVertexAttribI4usv = NULL;
PFNGLVERTEXATTRIBIPOINTERPROC glad_glVertexAttribIPointer = NULL;
PFNGLVERTEXATTRIBPOINTERPROC glad_glVertexAttribPointer = NULL;
PFNGLVIEWPORTPROC glad_glViewport = NULL;
PFNGLWAITSYNCPROC glad_glWaitSync = NULL;
static void load_GL_VERSION_1_0(GLADloadproc load) {
if(!GLAD_GL_VERSION_1_0) return;
glad_glCullFace = (PFNGLCULLFACEPROC)load("glCullFace");
glad_glFrontFace = (PFNGLFRONTFACEPROC)load("glFrontFace");
glad_glHint = (PFNGLHINTPROC)load("glHint");
glad_glLineWidth = (PFNGLLINEWIDTHPROC)load("glLineWidth");
glad_glPointSize = (PFNGLPOINTSIZEPROC)load("glPointSize");
glad_glPolygonMode = (PFNGLPOLYGONMODEPROC)load("glPolygonMode");
glad_glScissor = (PFNGLSCISSORPROC)load("glScissor");
glad_glTexParameterf = (PFNGLTEXPARAMETERFPROC)load("glTexParameterf");
glad_glTexParameterfv = (PFNGLTEXPARAMETERFVPROC)load("glTexParameterfv");
glad_glTexParameteri = (PFNGLTEXPARAMETERIPROC)load("glTexParameteri");
glad_glTexParameteriv = (PFNGLTEXPARAMETERIVPROC)load("glTexParameteriv");
glad_glTexImage1D = (PFNGLTEXIMAGE1DPROC)load("glTexImage1D");
glad_glTexImage2D = (PFNGLTEXIMAGE2DPROC)load("glTexImage2D");
glad_glDrawBuffer = (PFNGLDRAWBUFFERPROC)load("glDrawBuffer");
glad_glClear = (PFNGLCLEARPROC)load("glClear");
glad_glClearColor = (PFNGLCLEARCOLORPROC)load("glClearColor");
glad_glClearStencil = (PFNGLCLEARSTENCILPROC)load("glClearStencil");
glad_glClearDepth = (PFNGLCLEARDEPTHPROC)load("glClearDepth");
glad_glStencilMask = (PFNGLSTENCILMASKPROC)load("glStencilMask");
glad_glColorMask = (PFNGLCOLORMASKPROC)load("glColorMask");
glad_glDepthMask = (PFNGLDEPTHMASKPROC)load("glDepthMask");
glad_glDisable = (PFNGLDISABLEPROC)load("glDisable");
glad_glEnable = (PFNGLENABLEPROC)load("glEnable");
glad_glFinish = (PFNGLFINISHPROC)load("glFinish");
glad_glFlush = (PFNGLFLUSHPROC)load("glFlush");
glad_glBlendFunc = (PFNGLBLENDFUNCPROC)load("glBlendFunc");
glad_glLogicOp = (PFNGLLOGICOPPROC)load("glLogicOp");
glad_glStencilFunc = (PFNGLSTENCILFUNCPROC)load("glStencilFunc");
glad_glStencilOp = (PFNGLSTENCILOPPROC)load("glStencilOp");
glad_glDepthFunc = (PFNGLDEPTHFUNCPROC)load("glDepthFunc");
glad_glPixelStoref = (PFNGLPIXELSTOREFPROC)load("glPixelStoref");
glad_glPixelStorei = (PFNGLPIXELSTOREIPROC)load("glPixelStorei");
glad_glReadBuffer = (PFNGLREADBUFFERPROC)load("glReadBuffer");
glad_glReadPixels = (PFNGLREADPIXELSPROC)load("glReadPixels");
glad_glGetBooleanv = (PFNGLGETBOOLEANVPROC)load("glGetBooleanv");
glad_glGetDoublev = (PFNGLGETDOUBLEVPROC)load("glGetDoublev");
glad_glGetError = (PFNGLGETERRORPROC)load("glGetError");
glad_glGetFloatv = (PFNGLGETFLOATVPROC)load("glGetFloatv");
glad_glGetIntegerv = (PFNGLGETINTEGERVPROC)load("glGetIntegerv");
glad_glGetString = (PFNGLGETSTRINGPROC)load("glGetString");
glad_glGetTexImage = (PFNGLGETTEXIMAGEPROC)load("glGetTexImage");
glad_glGetTexParameterfv = (PFNGLGETTEXPARAMETERFVPROC)load("glGetTexParameterfv");
glad_glGetTexParameteriv = (PFNGLGETTEXPARAMETERIVPROC)load("glGetTexParameteriv");
glad_glGetTexLevelParameterfv = (PFNGLGETTEXLEVELPARAMETERFVPROC)load("glGetTexLevelParameterfv");
glad_glGetTexLevelParameteriv = (PFNGLGETTEXLEVELPARAMETERIVPROC)load("glGetTexLevelParameteriv");
glad_glIsEnabled = (PFNGLISENABLEDPROC)load("glIsEnabled");
glad_glDepthRange = (PFNGLDEPTHRANGEPROC)load("glDepthRange");
glad_glViewport = (PFNGLVIEWPORTPROC)load("glViewport");
}
static void load_GL_VERSION_1_1(GLADloadproc load) {
if(!GLAD_GL_VERSION_1_1) return;
glad_glDrawArrays = (PFNGLDRAWARRAYSPROC)load("glDrawArrays");
glad_glDrawElements = (PFNGLDRAWELEMENTSPROC)load("glDrawElements");
glad_glPolygonOffset = (PFNGLPOLYGONOFFSETPROC)load("glPolygonOffset");
glad_glCopyTexImage1D = (PFNGLCOPYTEXIMAGE1DPROC)load("glCopyTexImage1D");
glad_glCopyTexImage2D = (PFNGLCOPYTEXIMAGE2DPROC)load("glCopyTexImage2D");
glad_glCopyTexSubImage1D = (PFNGLCOPYTEXSUBIMAGE1DPROC)load("glCopyTexSubImage1D");
glad_glCopyTexSubImage2D = (PFNGLCOPYTEXSUBIMAGE2DPROC)load("glCopyTexSubImage2D");
glad_glTexSubImage1D = (PFNGLTEXSUBIMAGE1DPROC)load("glTexSubImage1D");
glad_glTexSubImage2D = (PFNGLTEXSUBIMAGE2DPROC)load("glTexSubImage2D");
glad_glBindTexture = (PFNGLBINDTEXTUREPROC)load("glBindTexture");
glad_glDeleteTextures = (PFNGLDELETETEXTURESPROC)load("glDeleteTextures");
glad_glGenTextures = (PFNGLGENTEXTURESPROC)load("glGenTextures");
glad_glIsTexture = (PFNGLISTEXTUREPROC)load("glIsTexture");
}
static void load_GL_VERSION_1_2(GLADloadproc load) {
if(!GLAD_GL_VERSION_1_2) return;
glad_glDrawRangeElements = (PFNGLDRAWRANGEELEMENTSPROC)load("glDrawRangeElements");
glad_glTexImage3D = (PFNGLTEXIMAGE3DPROC)load("glTexImage3D");
glad_glTexSubImage3D = (PFNGLTEXSUBIMAGE3DPROC)load("glTexSubImage3D");
glad_glCopyTexSubImage3D = (PFNGLCOPYTEXSUBIMAGE3DPROC)load("glCopyTexSubImage3D");
}
static void load_GL_VERSION_1_3(GLADloadproc load) {
if(!GLAD_GL_VERSION_1_3) return;
glad_glActiveTexture = (PFNGLACTIVETEXTUREPROC)load("glActiveTexture");
glad_glSampleCoverage = (PFNGLSAMPLECOVERAGEPROC)load("glSampleCoverage");
glad_glCompressedTexImage3D = (PFNGLCOMPRESSEDTEXIMAGE3DPROC)load("glCompressedTexImage3D");
glad_glCompressedTexImage2D = (PFNGLCOMPRESSEDTEXIMAGE2DPROC)load("glCompressedTexImage2D");
glad_glCompressedTexImage1D = (PFNGLCOMPRESSEDTEXIMAGE1DPROC)load("glCompressedTexImage1D");
glad_glCompressedTexSubImage3D = (PFNGLCOMPRESSEDTEXSUBIMAGE3DPROC)load("glCompressedTexSubImage3D");
glad_glCompressedTexSubImage2D = (PFNGLCOMPRESSEDTEXSUBIMAGE2DPROC)load("glCompressedTexSubImage2D");
glad_glCompressedTexSubImage1D = (PFNGLCOMPRESSEDTEXSUBIMAGE1DPROC)load("glCompressedTexSubImage1D");
glad_glGetCompressedTexImage = (PFNGLGETCOMPRESSEDTEXIMAGEPROC)load("glGetCompressedTexImage");
}
static void load_GL_VERSION_1_4(GLADloadproc load) {
if(!GLAD_GL_VERSION_1_4) return;
glad_glBlendFuncSeparate = (PFNGLBLENDFUNCSEPARATEPROC)load("glBlendFuncSeparate");
glad_glMultiDrawArrays = (PFNGLMULTIDRAWARRAYSPROC)load("glMultiDrawArrays");
glad_glMultiDrawElements = (PFNGLMULTIDRAWELEMENTSPROC)load("glMultiDrawElements");
glad_glPointParameterf = (PFNGLPOINTPARAMETERFPROC)load("glPointParameterf");
glad_glPointParameterfv = (PFNGLPOINTPARAMETERFVPROC)load("glPointParameterfv");
glad_glPointParameteri = (PFNGLPOINTPARAMETERIPROC)load("glPointParameteri");
glad_glPointParameteriv = (PFNGLPOINTPARAMETERIVPROC)load("glPointParameteriv");
glad_glBlendColor = (PFNGLBLENDCOLORPROC)load("glBlendColor");
glad_glBlendEquation = (PFNGLBLENDEQUATIONPROC)load("glBlendEquation");
}
static void load_GL_VERSION_1_5(GLADloadproc load) {
if(!GLAD_GL_VERSION_1_5) return;
glad_glGenQueries = (PFNGLGENQUERIESPROC)load("glGenQueries");
glad_glDeleteQueries = (PFNGLDELETEQUERIESPROC)load("glDeleteQueries");
glad_glIsQuery = (PFNGLISQUERYPROC)load("glIsQuery");
glad_glBeginQuery = (PFNGLBEGINQUERYPROC)load("glBeginQuery");
glad_glEndQuery = (PFNGLENDQUERYPROC)load("glEndQuery");
glad_glGetQueryiv = (PFNGLGETQUERYIVPROC)load("glGetQueryiv");
glad_glGetQueryObjectiv = (PFNGLGETQUERYOBJECTIVPROC)load("glGetQueryObjectiv");
glad_glGetQueryObjectuiv = (PFNGLGETQUERYOBJECTUIVPROC)load("glGetQueryObjectuiv");
glad_glBindBuffer = (PFNGLBINDBUFFERPROC)load("glBindBuffer");
glad_glDeleteBuffers = (PFNGLDELETEBUFFERSPROC)load("glDeleteBuffers");
glad_glGenBuffers = (PFNGLGENBUFFERSPROC)load("glGenBuffers");
glad_glIsBuffer = (PFNGLISBUFFERPROC)load("glIsBuffer");
glad_glBufferData = (PFNGLBUFFERDATAPROC)load("glBufferData");
glad_glBufferSubData = (PFNGLBUFFERSUBDATAPROC)load("glBufferSubData");
glad_glGetBufferSubData = (PFNGLGETBUFFERSUBDATAPROC)load("glGetBufferSubData");
glad_glMapBuffer = (PFNGLMAPBUFFERPROC)load("glMapBuffer");
glad_glUnmapBuffer = (PFNGLUNMAPBUFFERPROC)load("glUnmapBuffer");
glad_glGetBufferParameteriv = (PFNGLGETBUFFERPARAMETERIVPROC)load("glGetBufferParameteriv");
glad_glGetBufferPointerv = (PFNGLGETBUFFERPOINTERVPROC)load("glGetBufferPointerv");
}
static void load_GL_VERSION_2_0(GLADloadproc load) {
if(!GLAD_GL_VERSION_2_0) return;
glad_glBlendEquationSeparate = (PFNGLBLENDEQUATIONSEPARATEPROC)load("glBlendEquationSeparate");
glad_glDrawBuffers = (PFNGLDRAWBUFFERSPROC)load("glDrawBuffers");
glad_glStencilOpSeparate = (PFNGLSTENCILOPSEPARATEPROC)load("glStencilOpSeparate");
glad_glStencilFuncSeparate = (PFNGLSTENCILFUNCSEPARATEPROC)load("glStencilFuncSeparate");
glad_glStencilMaskSeparate = (PFNGLSTENCILMASKSEPARATEPROC)load("glStencilMaskSeparate");
glad_glAttachShader = (PFNGLATTACHSHADERPROC)load("glAttachShader");
glad_glBindAttribLocation = (PFNGLBINDATTRIBLOCATIONPROC)load("glBindAttribLocation");
glad_glCompileShader = (PFNGLCOMPILESHADERPROC)load("glCompileShader");
glad_glCreateProgram = (PFNGLCREATEPROGRAMPROC)load("glCreateProgram");
glad_glCreateShader = (PFNGLCREATESHADERPROC)load("glCreateShader");
glad_glDeleteProgram = (PFNGLDELETEPROGRAMPROC)load("glDeleteProgram");
glad_glDeleteShader = (PFNGLDELETESHADERPROC)load("glDeleteShader");
glad_glDetachShader = (PFNGLDETACHSHADERPROC)load("glDetachShader");
glad_glDisableVertexAttribArray = (PFNGLDISABLEVERTEXATTRIBARRAYPROC)load("glDisableVertexAttribArray");
glad_glEnableVertexAttribArray = (PFNGLENABLEVERTEXATTRIBARRAYPROC)load("glEnableVertexAttribArray");
glad_glGetActiveAttrib = (PFNGLGETACTIVEATTRIBPROC)load("glGetActiveAttrib");
glad_glGetActiveUniform = (PFNGLGETACTIVEUNIFORMPROC)load("glGetActiveUniform");
glad_glGetAttachedShaders = (PFNGLGETATTACHEDSHADERSPROC)load("glGetAttachedShaders");
glad_glGetAttribLocation = (PFNGLGETATTRIBLOCATIONPROC)load("glGetAttribLocation");
glad_glGetProgramiv = (PFNGLGETPROGRAMIVPROC)load("glGetProgramiv");
glad_glGetProgramInfoLog = (PFNGLGETPROGRAMINFOLOGPROC)load("glGetProgramInfoLog");
glad_glGetShaderiv = (PFNGLGETSHADERIVPROC)load("glGetShaderiv");
glad_glGetShaderInfoLog = (PFNGLGETSHADERINFOLOGPROC)load("glGetShaderInfoLog");
glad_glGetShaderSource = (PFNGLGETSHADERSOURCEPROC)load("glGetShaderSource");
glad_glGetUniformLocation = (PFNGLGETUNIFORMLOCATIONPROC)load("glGetUniformLocation");
glad_glGetUniformfv = (PFNGLGETUNIFORMFVPROC)load("glGetUniformfv");
glad_glGetUniformiv = (PFNGLGETUNIFORMIVPROC)load("glGetUniformiv");
glad_glGetVertexAttribdv = (PFNGLGETVERTEXATTRIBDVPROC)load("glGetVertexAttribdv");
glad_glGetVertexAttribfv = (PFNGLGETVERTEXATTRIBFVPROC)load("glGetVertexAttribfv");
glad_glGetVertexAttribiv = (PFNGLGETVERTEXATTRIBIVPROC)load("glGetVertexAttribiv");
glad_glGetVertexAttribPointerv = (PFNGLGETVERTEXATTRIBPOINTERVPROC)load("glGetVertexAttribPointerv");
glad_glIsProgram = (PFNGLISPROGRAMPROC)load("glIsProgram");
glad_glIsShader = (PFNGLISSHADERPROC)load("glIsShader");
glad_glLinkProgram = (PFNGLLINKPROGRAMPROC)load("glLinkProgram");
glad_glShaderSource = (PFNGLSHADERSOURCEPROC)load("glShaderSource");
glad_glUseProgram = (PFNGLUSEPROGRAMPROC)load("glUseProgram");
glad_glUniform1f = (PFNGLUNIFORM1FPROC)load("glUniform1f");
glad_glUniform2f = (PFNGLUNIFORM2FPROC)load("glUniform2f");
glad_glUniform3f = (PFNGLUNIFORM3FPROC)load("glUniform3f");
glad_glUniform4f = (PFNGLUNIFORM4FPROC)load("glUniform4f");
glad_glUniform1i = (PFNGLUNIFORM1IPROC)load("glUniform1i");
glad_glUniform2i = (PFNGLUNIFORM2IPROC)load("glUniform2i");
glad_glUniform3i = (PFNGLUNIFORM3IPROC)load("glUniform3i");
glad_glUniform4i = (PFNGLUNIFORM4IPROC)load("glUniform4i");
glad_glUniform1fv = (PFNGLUNIFORM1FVPROC)load("glUniform1fv");
glad_glUniform2fv = (PFNGLUNIFORM2FVPROC)load("glUniform2fv");
glad_glUniform3fv = (PFNGLUNIFORM3FVPROC)load("glUniform3fv");
glad_glUniform4fv = (PFNGLUNIFORM4FVPROC)load("glUniform4fv");
glad_glUniform1iv = (PFNGLUNIFORM1IVPROC)load("glUniform1iv");
glad_glUniform2iv = (PFNGLUNIFORM2IVPROC)load("glUniform2iv");
glad_glUniform3iv = (PFNGLUNIFORM3IVPROC)load("glUniform3iv");
glad_glUniform4iv = (PFNGLUNIFORM4IVPROC)load("glUniform4iv");
glad_glUniformMatrix2fv = (PFNGLUNIFORMMATRIX2FVPROC)load("glUniformMatrix2fv");
glad_glUniformMatrix3fv = (PFNGLUNIFORMMATRIX3FVPROC)load("glUniformMatrix3fv");
glad_glUniformMatrix4fv = (PFNGLUNIFORMMATRIX4FVPROC)load("glUniformMatrix4fv");
glad_glValidateProgram = (PFNGLVALIDATEPROGRAMPROC)load("glValidateProgram");
glad_glVertexAttrib1d = (PFNGLVERTEXATTRIB1DPROC)load("glVertexAttrib1d");
glad_glVertexAttrib1dv = (PFNGLVERTEXATTRIB1DVPROC)load("glVertexAttrib1dv");
glad_glVertexAttrib1f = (PFNGLVERTEXATTRIB1FPROC)load("glVertexAttrib1f");
glad_glVertexAttrib1fv = (PFNGLVERTEXATTRIB1FVPROC)load("glVertexAttrib1fv");
glad_glVertexAttrib1s = (PFNGLVERTEXATTRIB1SPROC)load("glVertexAttrib1s");
glad_glVertexAttrib1sv = (PFNGLVERTEXATTRIB1SVPROC)load("glVertexAttrib1sv");
glad_glVertexAttrib2d = (PFNGLVERTEXATTRIB2DPROC)load("glVertexAttrib2d");
glad_glVertexAttrib2dv = (PFNGLVERTEXATTRIB2DVPROC)load("glVertexAttrib2dv");
glad_glVertexAttrib2f = (PFNGLVERTEXATTRIB2FPROC)load("glVertexAttrib2f");
glad_glVertexAttrib2fv = (PFNGLVERTEXATTRIB2FVPROC)load("glVertexAttrib2fv");
glad_glVertexAttrib2s = (PFNGLVERTEXATTRIB2SPROC)load("glVertexAttrib2s");
glad_glVertexAttrib2sv = (PFNGLVERTEXATTRIB2SVPROC)load("glVertexAttrib2sv");
glad_glVertexAttrib3d = (PFNGLVERTEXATTRIB3DPROC)load("glVertexAttrib3d");
glad_glVertexAttrib3dv = (PFNGLVERTEXATTRIB3DVPROC)load("glVertexAttrib3dv");
glad_glVertexAttrib3f = (PFNGLVERTEXATTRIB3FPROC)load("glVertexAttrib3f");
glad_glVertexAttrib3fv = (PFNGLVERTEXATTRIB3FVPROC)load("glVertexAttrib3fv");
glad_glVertexAttrib3s = (PFNGLVERTEXATTRIB3SPROC)load("glVertexAttrib3s");
glad_glVertexAttrib3sv = (PFNGLVERTEXATTRIB3SVPROC)load("glVertexAttrib3sv");
glad_glVertexAttrib4Nbv = (PFNGLVERTEXATTRIB4NBVPROC)load("glVertexAttrib4Nbv");
glad_glVertexAttrib4Niv = (PFNGLVERTEXATTRIB4NIVPROC)load("glVertexAttrib4Niv");
glad_glVertexAttrib4Nsv = (PFNGLVERTEXATTRIB4NSVPROC)load("glVertexAttrib4Nsv");
glad_glVertexAttrib4Nub = (PFNGLVERTEXATTRIB4NUBPROC)load("glVertexAttrib4Nub");
glad_glVertexAttrib4Nubv = (PFNGLVERTEXATTRIB4NUBVPROC)load("glVertexAttrib4Nubv");
glad_glVertexAttrib4Nuiv = (PFNGLVERTEXATTRIB4NUIVPROC)load("glVertexAttrib4Nuiv");
glad_glVertexAttrib4Nusv = (PFNGLVERTEXATTRIB4NUSVPROC)load("glVertexAttrib4Nusv");
glad_glVertexAttrib4bv = (PFNGLVERTEXATTRIB4BVPROC)load("glVertexAttrib4bv");
glad_glVertexAttrib4d = (PFNGLVERTEXATTRIB4DPROC)load("glVertexAttrib4d");
glad_glVertexAttrib4dv = (PFNGLVERTEXATTRIB4DVPROC)load("glVertexAttrib4dv");
glad_glVertexAttrib4f = (PFNGLVERTEXATTRIB4FPROC)load("glVertexAttrib4f");
glad_glVertexAttrib4fv = (PFNGLVERTEXATTRIB4FVPROC)load("glVertexAttrib4fv");
glad_glVertexAttrib4iv = (PFNGLVERTEXATTRIB4IVPROC)load("glVertexAttrib4iv");
glad_glVertexAttrib4s = (PFNGLVERTEXATTRIB4SPROC)load("glVertexAttrib4s");
glad_glVertexAttrib4sv = (PFNGLVERTEXATTRIB4SVPROC)load("glVertexAttrib4sv");
glad_glVertexAttrib4ubv = (PFNGLVERTEXATTRIB4UBVPROC)load("glVertexAttrib4ubv");
glad_glVertexAttrib4uiv = (PFNGLVERTEXATTRIB4UIVPROC)load("glVertexAttrib4uiv");
glad_glVertexAttrib4usv = (PFNGLVERTEXATTRIB4USVPROC)load("glVertexAttrib4usv");
glad_glVertexAttribPointer = (PFNGLVERTEXATTRIBPOINTERPROC)load("glVertexAttribPointer");
}
static void load_GL_VERSION_2_1(GLADloadproc load) {
if(!GLAD_GL_VERSION_2_1) return;
glad_glUniformMatrix2x3fv = (PFNGLUNIFORMMATRIX2X3FVPROC)load("glUniformMatrix2x3fv");
glad_glUniformMatrix3x2fv = (PFNGLUNIFORMMATRIX3X2FVPROC)load("glUniformMatrix3x2fv");
glad_glUniformMatrix2x4fv = (PFNGLUNIFORMMATRIX2X4FVPROC)load("glUniformMatrix2x4fv");
glad_glUniformMatrix4x2fv = (PFNGLUNIFORMMATRIX4X2FVPROC)load("glUniformMatrix4x2fv");
glad_glUniformMatrix3x4fv = (PFNGLUNIFORMMATRIX3X4FVPROC)load("glUniformMatrix3x4fv");
glad_glUniformMatrix4x3fv = (PFNGLUNIFORMMATRIX4X3FVPROC)load("glUniformMatrix4x3fv");
}
static void load_GL_VERSION_3_0(GLADloadproc load) {
if(!GLAD_GL_VERSION_3_0) return;
glad_glColorMaski = (PFNGLCOLORMASKIPROC)load("glColorMaski");
glad_glGetBooleani_v = (PFNGLGETBOOLEANI_VPROC)load("glGetBooleani_v");
glad_glGetIntegeri_v = (PFNGLGETINTEGERI_VPROC)load("glGetIntegeri_v");
glad_glEnablei = (PFNGLENABLEIPROC)load("glEnablei");
glad_glDisablei = (PFNGLDISABLEIPROC)load("glDisablei");
glad_glIsEnabledi = (PFNGLISENABLEDIPROC)load("glIsEnabledi");
glad_glBeginTransformFeedback = (PFNGLBEGINTRANSFORMFEEDBACKPROC)load("glBeginTransformFeedback");
glad_glEndTransformFeedback = (PFNGLENDTRANSFORMFEEDBACKPROC)load("glEndTransformFeedback");
glad_glBindBufferRange = (PFNGLBINDBUFFERRANGEPROC)load("glBindBufferRange");
glad_glBindBufferBase = (PFNGLBINDBUFFERBASEPROC)load("glBindBufferBase");
glad_glTransformFeedbackVaryings = (PFNGLTRANSFORMFEEDBACKVARYINGSPROC)load("glTransformFeedbackVaryings");
glad_glGetTransformFeedbackVarying = (PFNGLGETTRANSFORMFEEDBACKVARYINGPROC)load("glGetTransformFeedbackVarying");
glad_glClampColor = (PFNGLCLAMPCOLORPROC)load("glClampColor");
glad_glBeginConditionalRender = (PFNGLBEGINCONDITIONALRENDERPROC)load("glBeginConditionalRender");
glad_glEndConditionalRender = (PFNGLENDCONDITIONALRENDERPROC)load("glEndConditionalRender");
glad_glVertexAttribIPointer = (PFNGLVERTEXATTRIBIPOINTERPROC)load("glVertexAttribIPointer");
glad_glGetVertexAttribIiv = (PFNGLGETVERTEXATTRIBIIVPROC)load("glGetVertexAttribIiv");
glad_glGetVertexAttribIuiv = (PFNGLGETVERTEXATTRIBIUIVPROC)load("glGetVertexAttribIuiv");
glad_glVertexAttribI1i = (PFNGLVERTEXATTRIBI1IPROC)load("glVertexAttribI1i");
glad_glVertexAttribI2i = (PFNGLVERTEXATTRIBI2IPROC)load("glVertexAttribI2i");
glad_glVertexAttribI3i = (PFNGLVERTEXATTRIBI3IPROC)load("glVertexAttribI3i");
glad_glVertexAttribI4i = (PFNGLVERTEXATTRIBI4IPROC)load("glVertexAttribI4i");
glad_glVertexAttribI1ui = (PFNGLVERTEXATTRIBI1UIPROC)load("glVertexAttribI1ui");
glad_glVertexAttribI2ui = (PFNGLVERTEXATTRIBI2UIPROC)load("glVertexAttribI2ui");
glad_glVertexAttribI3ui = (PFNGLVERTEXATTRIBI3UIPROC)load("glVertexAttribI3ui");
glad_glVertexAttribI4ui = (PFNGLVERTEXATTRIBI4UIPROC)load("glVertexAttribI4ui");
glad_glVertexAttribI1iv = (PFNGLVERTEXATTRIBI1IVPROC)load("glVertexAttribI1iv");
glad_glVertexAttribI2iv = (PFNGLVERTEXATTRIBI2IVPROC)load("glVertexAttribI2iv");
glad_glVertexAttribI3iv = (PFNGLVERTEXATTRIBI3IVPROC)load("glVertexAttribI3iv");
glad_glVertexAttribI4iv = (PFNGLVERTEXATTRIBI4IVPROC)load("glVertexAttribI4iv");
glad_glVertexAttribI1uiv = (PFNGLVERTEXATTRIBI1UIVPROC)load("glVertexAttribI1uiv");
glad_glVertexAttribI2uiv = (PFNGLVERTEXATTRIBI2UIVPROC)load("glVertexAttribI2uiv");
glad_glVertexAttribI3uiv = (PFNGLVERTEXATTRIBI3UIVPROC)load("glVertexAttribI3uiv");
glad_glVertexAttribI4uiv = (PFNGLVERTEXATTRIBI4UIVPROC)load("glVertexAttribI4uiv");
glad_glVertexAttribI4bv = (PFNGLVERTEXATTRIBI4BVPROC)load("glVertexAttribI4bv");
glad_glVertexAttribI4sv = (PFNGLVERTEXATTRIBI4SVPROC)load("glVertexAttribI4sv");
glad_glVertexAttribI4ubv = (PFNGLVERTEXATTRIBI4UBVPROC)load("glVertexAttribI4ubv");
glad_glVertexAttribI4usv = (PFNGLVERTEXATTRIBI4USVPROC)load("glVertexAttribI4usv");
glad_glGetUniformuiv = (PFNGLGETUNIFORMUIVPROC)load("glGetUniformuiv");
glad_glBindFragDataLocation = (PFNGLBINDFRAGDATALOCATIONPROC)load("glBindFragDataLocation");
glad_glGetFragDataLocation = (PFNGLGETFRAGDATALOCATIONPROC)load("glGetFragDataLocation");
glad_glUniform1ui = (PFNGLUNIFORM1UIPROC)load("glUniform1ui");
glad_glUniform2ui = (PFNGLUNIFORM2UIPROC)load("glUniform2ui");
glad_glUniform3ui = (PFNGLUNIFORM3UIPROC)load("glUniform3ui");
glad_glUniform4ui = (PFNGLUNIFORM4UIPROC)load("glUniform4ui");
glad_glUniform1uiv = (PFNGLUNIFORM1UIVPROC)load("glUniform1uiv");
glad_glUniform2uiv = (PFNGLUNIFORM2UIVPROC)load("glUniform2uiv");
glad_glUniform3uiv = (PFNGLUNIFORM3UIVPROC)load("glUniform3uiv");
glad_glUniform4uiv = (PFNGLUNIFORM4UIVPROC)load("glUniform4uiv");
glad_glTexParameterIiv = (PFNGLTEXPARAMETERIIVPROC)load("glTexParameterIiv");
glad_glTexParameterIuiv = (PFNGLTEXPARAMETERIUIVPROC)load("glTexParameterIuiv");
glad_glGetTexParameterIiv = (PFNGLGETTEXPARAMETERIIVPROC)load("glGetTexParameterIiv");
glad_glGetTexParameterIuiv = (PFNGLGETTEXPARAMETERIUIVPROC)load("glGetTexParameterIuiv");
glad_glClearBufferiv = (PFNGLCLEARBUFFERIVPROC)load("glClearBufferiv");
glad_glClearBufferuiv = (PFNGLCLEARBUFFERUIVPROC)load("glClearBufferuiv");
glad_glClearBufferfv = (PFNGLCLEARBUFFERFVPROC)load("glClearBufferfv");
glad_glClearBufferfi = (PFNGLCLEARBUFFERFIPROC)load("glClearBufferfi");
glad_glGetStringi = (PFNGLGETSTRINGIPROC)load("glGetStringi");
glad_glIsRenderbuffer = (PFNGLISRENDERBUFFERPROC)load("glIsRenderbuffer");
glad_glBindRenderbuffer = (PFNGLBINDRENDERBUFFERPROC)load("glBindRenderbuffer");
glad_glDeleteRenderbuffers = (PFNGLDELETERENDERBUFFERSPROC)load("glDeleteRenderbuffers");
glad_glGenRenderbuffers = (PFNGLGENRENDERBUFFERSPROC)load("glGenRenderbuffers");
glad_glRenderbufferStorage = (PFNGLRENDERBUFFERSTORAGEPROC)load("glRenderbufferStorage");
glad_glGetRenderbufferParameteriv = (PFNGLGETRENDERBUFFERPARAMETERIVPROC)load("glGetRenderbufferParameteriv");
glad_glIsFramebuffer = (PFNGLISFRAMEBUFFERPROC)load("glIsFramebuffer");
glad_glBindFramebuffer = (PFNGLBINDFRAMEBUFFERPROC)load("glBindFramebuffer");
glad_glDeleteFramebuffers = (PFNGLDELETEFRAMEBUFFERSPROC)load("glDeleteFramebuffers");
glad_glGenFramebuffers = (PFNGLGENFRAMEBUFFERSPROC)load("glGenFramebuffers");
glad_glCheckFramebufferStatus = (PFNGLCHECKFRAMEBUFFERSTATUSPROC)load("glCheckFramebufferStatus");
glad_glFramebufferTexture1D = (PFNGLFRAMEBUFFERTEXTURE1DPROC)load("glFramebufferTexture1D");
glad_glFramebufferTexture2D = (PFNGLFRAMEBUFFERTEXTURE2DPROC)load("glFramebufferTexture2D");
glad_glFramebufferTexture3D = (PFNGLFRAMEBUFFERTEXTURE3DPROC)load("glFramebufferTexture3D");
glad_glFramebufferRenderbuffer = (PFNGLFRAMEBUFFERRENDERBUFFERPROC)load("glFramebufferRenderbuffer");
glad_glGetFramebufferAttachmentParameteriv = (PFNGLGETFRAMEBUFFERATTACHMENTPARAMETERIVPROC)load("glGetFramebufferAttachmentParameteriv");
glad_glGenerateMipmap = (PFNGLGENERATEMIPMAPPROC)load("glGenerateMipmap");
glad_glBlitFramebuffer = (PFNGLBLITFRAMEBUFFERPROC)load("glBlitFramebuffer");
glad_glRenderbufferStorageMultisample = (PFNGLRENDERBUFFERSTORAGEMULTISAMPLEPROC)load("glRenderbufferStorageMultisample");
glad_glFramebufferTextureLayer = (PFNGLFRAMEBUFFERTEXTURELAYERPROC)load("glFramebufferTextureLayer");
glad_glMapBufferRange = (PFNGLMAPBUFFERRANGEPROC)load("glMapBufferRange");
glad_glFlushMappedBufferRange = (PFNGLFLUSHMAPPEDBUFFERRANGEPROC)load("glFlushMappedBufferRange");
glad_glBindVertexArray = (PFNGLBINDVERTEXARRAYPROC)load("glBindVertexArray");
glad_glDeleteVertexArrays = (PFNGLDELETEVERTEXARRAYSPROC)load("glDeleteVertexArrays");
glad_glGenVertexArrays = (PFNGLGENVERTEXARRAYSPROC)load("glGenVertexArrays");
glad_glIsVertexArray = (PFNGLISVERTEXARRAYPROC)load("glIsVertexArray");
}
static void load_GL_VERSION_3_1(GLADloadproc load) {
if(!GLAD_GL_VERSION_3_1) return;
glad_glDrawArraysInstanced = (PFNGLDRAWARRAYSINSTANCEDPROC)load("glDrawArraysInstanced");
glad_glDrawElementsInstanced = (PFNGLDRAWELEMENTSINSTANCEDPROC)load("glDrawElementsInstanced");
glad_glTexBuffer = (PFNGLTEXBUFFERPROC)load("glTexBuffer");
glad_glPrimitiveRestartIndex = (PFNGLPRIMITIVERESTARTINDEXPROC)load("glPrimitiveRestartIndex");
glad_glCopyBufferSubData = (PFNGLCOPYBUFFERSUBDATAPROC)load("glCopyBufferSubData");
glad_glGetUniformIndices = (PFNGLGETUNIFORMINDICESPROC)load("glGetUniformIndices");
glad_glGetActiveUniformsiv = (PFNGLGETACTIVEUNIFORMSIVPROC)load("glGetActiveUniformsiv");
glad_glGetActiveUniformName = (PFNGLGETACTIVEUNIFORMNAMEPROC)load("glGetActiveUniformName");
glad_glGetUniformBlockIndex = (PFNGLGETUNIFORMBLOCKINDEXPROC)load("glGetUniformBlockIndex");
glad_glGetActiveUniformBlockiv = (PFNGLGETACTIVEUNIFORMBLOCKIVPROC)load("glGetActiveUniformBlockiv");
glad_glGetActiveUniformBlockName = (PFNGLGETACTIVEUNIFORMBLOCKNAMEPROC)load("glGetActiveUniformBlockName");
glad_glUniformBlockBinding = (PFNGLUNIFORMBLOCKBINDINGPROC)load("glUniformBlockBinding");
glad_glBindBufferRange = (PFNGLBINDBUFFERRANGEPROC)load("glBindBufferRange");
glad_glBindBufferBase = (PFNGLBINDBUFFERBASEPROC)load("glBindBufferBase");
glad_glGetIntegeri_v = (PFNGLGETINTEGERI_VPROC)load("glGetIntegeri_v");
}
static void load_GL_VERSION_3_2(GLADloadproc load) {
if(!GLAD_GL_VERSION_3_2) return;
glad_glDrawElementsBaseVertex = (PFNGLDRAWELEMENTSBASEVERTEXPROC)load("glDrawElementsBaseVertex");
glad_glDrawRangeElementsBaseVertex = (PFNGLDRAWRANGEELEMENTSBASEVERTEXPROC)load("glDrawRangeElementsBaseVertex");
glad_glDrawElementsInstancedBaseVertex = (PFNGLDRAWELEMENTSINSTANCEDBASEVERTEXPROC)load("glDrawElementsInstancedBaseVertex");
glad_glMultiDrawElementsBaseVertex = (PFNGLMULTIDRAWELEMENTSBASEVERTEXPROC)load("glMultiDrawElementsBaseVertex");
glad_glProvokingVertex = (PFNGLPROVOKINGVERTEXPROC)load("glProvokingVertex");
glad_glFenceSync = (PFNGLFENCESYNCPROC)load("glFenceSync");
glad_glIsSync = (PFNGLISSYNCPROC)load("glIsSync");
glad_glDeleteSync = (PFNGLDELETESYNCPROC)load("glDeleteSync");
glad_glClientWaitSync = (PFNGLCLIENTWAITSYNCPROC)load("glClientWaitSync");
glad_glWaitSync = (PFNGLWAITSYNCPROC)load("glWaitSync");
glad_glGetInteger64v = (PFNGLGETINTEGER64VPROC)load("glGetInteger64v");
glad_glGetSynciv = (PFNGLGETSYNCIVPROC)load("glGetSynciv");
glad_glGetInteger64i_v = (PFNGLGETINTEGER64I_VPROC)load("glGetInteger64i_v");
glad_glGetBufferParameteri64v = (PFNGLGETBUFFERPARAMETERI64VPROC)load("glGetBufferParameteri64v");
glad_glFramebufferTexture = (PFNGLFRAMEBUFFERTEXTUREPROC)load("glFramebufferTexture");
glad_glTexImage2DMultisample = (PFNGLTEXIMAGE2DMULTISAMPLEPROC)load("glTexImage2DMultisample");
glad_glTexImage3DMultisample = (PFNGLTEXIMAGE3DMULTISAMPLEPROC)load("glTexImage3DMultisample");
glad_glGetMultisamplefv = (PFNGLGETMULTISAMPLEFVPROC)load("glGetMultisamplefv");
glad_glSampleMaski = (PFNGLSAMPLEMASKIPROC)load("glSampleMaski");
}
static int find_extensionsGL(void) {
if (!get_exts()) return 0;
(void)&has_ext;
free_exts();
return 1;
}
static void find_coreGL(void) {
/* Thank you @elmindreda
* path_to_url#L176
* path_to_url#L36
*/
int i, major, minor;
const char* version;
const char* prefixes[] = {
"OpenGL ES-CM ",
"OpenGL ES-CL ",
"OpenGL ES ",
NULL
};
version = (const char*) glGetString(GL_VERSION);
if (!version) return;
for (i = 0; prefixes[i]; i++) {
const size_t length = strlen(prefixes[i]);
if (strncmp(version, prefixes[i], length) == 0) {
version += length;
break;
}
}
/* PR #18 */
#ifdef _MSC_VER
sscanf_s(version, "%d.%d", &major, &minor);
#else
sscanf(version, "%d.%d", &major, &minor);
#endif
GLVersion.major = major; GLVersion.minor = minor;
max_loaded_major = major; max_loaded_minor = minor;
GLAD_GL_VERSION_1_0 = (major == 1 && minor >= 0) || major > 1;
GLAD_GL_VERSION_1_1 = (major == 1 && minor >= 1) || major > 1;
GLAD_GL_VERSION_1_2 = (major == 1 && minor >= 2) || major > 1;
GLAD_GL_VERSION_1_3 = (major == 1 && minor >= 3) || major > 1;
GLAD_GL_VERSION_1_4 = (major == 1 && minor >= 4) || major > 1;
GLAD_GL_VERSION_1_5 = (major == 1 && minor >= 5) || major > 1;
GLAD_GL_VERSION_2_0 = (major == 2 && minor >= 0) || major > 2;
GLAD_GL_VERSION_2_1 = (major == 2 && minor >= 1) || major > 2;
GLAD_GL_VERSION_3_0 = (major == 3 && minor >= 0) || major > 3;
GLAD_GL_VERSION_3_1 = (major == 3 && minor >= 1) || major > 3;
GLAD_GL_VERSION_3_2 = (major == 3 && minor >= 2) || major > 3;
if (GLVersion.major > 3 || (GLVersion.major >= 3 && GLVersion.minor >= 2)) {
max_loaded_major = 3;
max_loaded_minor = 2;
}
}
int gladLoadGLLoader(GLADloadproc load) {
GLVersion.major = 0; GLVersion.minor = 0;
glGetString = (PFNGLGETSTRINGPROC)load("glGetString");
if(glGetString == NULL) return 0;
if(glGetString(GL_VERSION) == NULL) return 0;
find_coreGL();
load_GL_VERSION_1_0(load);
load_GL_VERSION_1_1(load);
load_GL_VERSION_1_2(load);
load_GL_VERSION_1_3(load);
load_GL_VERSION_1_4(load);
load_GL_VERSION_1_5(load);
load_GL_VERSION_2_0(load);
load_GL_VERSION_2_1(load);
load_GL_VERSION_3_0(load);
load_GL_VERSION_3_1(load);
load_GL_VERSION_3_2(load);
if (!find_extensionsGL()) return 0;
return GLVersion.major != 0 || GLVersion.minor != 0;
}
```
|
Bloomfield Township, Ohio may refer to:
Bloomfield Township, Jackson County, Ohio
Bloomfield Township, Logan County, Ohio
Bloomfield Township, Trumbull County, Ohio
See also
Bloom Township, Ohio (disambiguation)
Ohio township disambiguation pages
|
Walter Adams (1830–1892) was a politician in Queensland, Australia. He was a Member of the Queensland Legislative Assembly.
Early life
Walter Adams was born on 22 November 1830 in Yeovil, Somersetshire, England. He was educated at a private school at Somerton nearby. He arrived in Sydney, New South Wales in September 1849, where he worked as a blacksmith with his brothers Edward and James. Adam moved to Wide Bay in Queensland in 1853 where he resided in Maryborough and continued to work as a blacksmith. While in Maryborough, he established a machinery business a contracting business. He also owned a sugar cane farm in the Somerville area.
Politics
While living in Maryborough, Adams served as an alderman in the Maryborough Town Council and was chairman of its Works Committee.
In 1872, Adams left Maryborough and moved to Bundaberg, where he purchased the sugar cane farm, Somerville Plantation, at Barolin. In about 1874 he built and operated the Adams Hotel on the south-east corner of Burbong and Barolin Streets. He also contracted to build roads, bridges and telegraph lines. Adams quickly became involved in local affairs, serving as president of the School of Arts for 5 years and also as a member of the Hospital Committee. He was also active in establishing the first primary school. He was a founder and president of the Hibernian Society in Bundaberg. He was the president of the Agricultural and Pastoral Society in Bundaberg.
When the Borough of Bundaberg was established for local government in 1881, Adams was one of the first aldermen elected and served twice as its mayor in 1882 and 1883.
On 5 June 1886, Thomas McIlwraith, the then Member of the Queensland Legislative Assembly for the electoral district of Mulgrave, resigned. Walter Adams won the resulting by-election on 10 July 1886. He held the seat until 5 May 1888 (the 1888 colonial election).
The Electoral Districts Act of 1887 abolished the seat of Mulgrave, but effectively replaced it with the seat of electoral district of Bundaberg. Adams successfully contested Bundaberg in the 1888 state election and held that seat until his death on 15 May 1892. Labour candidate George Hall won the resulting by-election on 16 June 1892.
Death
On 4 May 1892, Adams went to Sydney because he had a cancerous tumour on his lip and neck. He underwent a 2-hour operation on Thursday 12 May at Prince Alfred Hospital which was expected to be successful. However, he died in the hospital on Sunday 15 May 1892. His body was brought to Bundaberg by train and buried in the Bundaberg Catholic cemetery on the afternoon of 21 May. Despite torrential rain, the funeral procession to the cemetery comprised hundreds of people and was nearly a mile long; all businesses were closed for the afternoon.
Legacy
Walter Adams was a generous man and made many donations, including the land on which Shalom Catholic College was established. Adams House at the College is named after him with the house crest bearing the words "Adams" and "Generosity".
See also
Members of the Queensland Legislative Assembly, 1883–1888; 1888–1893
References
Further reading
Members of the Queensland Legislative Assembly
1830 births
1892 deaths
19th-century Australian politicians
Australian Roman Catholics
19th-century Roman Catholics
British emigrants to Australia
|
The Torneo Campeones Olímpicos was a Uruguayan football tournament organized by the Uruguayan Football Association in 1974.
It was a qualifying tournament for the Liguilla Pre-Libertadores and granted four slots for it.
List of champions
Titles by club
1974 Torneo Campeones Olímpicos
Standings
References
H
Recurring sporting events established in 1974
1974 disestablishments in Uruguay
|
Live at the El Mocambo may refer to:
Live at the El Mocambo (Elvis Costello album), 1993
Live at the El Mocambo (April Wine album), 1977
Live at the El Mocambo (Stevie Ray Vaughan video), 1991
El Mocambo 1977, by the Rolling Stones, also referred to as Live at the El Mocambo, 2022
See also
|
```scss
.chat-panel {
border-right: var(--splitter-border);
height: 100%;
display: flex;
flex-direction: column;
& > header {
background-color: var(--toolbar-bg);
color: var(--tab-color);
line-height: 36px;
min-height: 36px;
padding-left: 16px;
text-transform: lowercase;
user-select: text;
white-space: nowrap;
}
}
```
|
```objective-c
#pragma once
#include <Parsers/IParserBase.h>
namespace DB
{
class ParserJSONPathRange : public IParserBase
{
private:
const char * getName() const override { return "ParserJSONPathRange"; }
bool parseImpl(Pos & pos, ASTPtr & node, Expected & expected) override;
public:
explicit ParserJSONPathRange() = default;
};
}
```
|
Edwin Stanton Dewees (born August 7, 1982 in Florence, South Carolina) is an American mixed martial artist who most recently competed in the Heavyweight division. A professional competitor from 2000 to 2014, he was featured on The Ultimate Fighter 4 and competed for the UFC, Affliction, King of the Cage, HDNet Fights, and the MFC.
MMA career and The Ultimate Fighter
In his quarter-final matchup on The Ultimate Fighter 4, Dewees dominated his first round against Gideon Ray, getting a take down and staying at guard for much of the round. However, in the second round, Dewees sustained a large cut in his forehead, forcing referee Herb Dean to call a timeout for the doctor to assess the cut due to the large amount of blood pouring from Dewees' head. After assessing the situation, the doctor allowed the fight to continue. At the end of the first two rounds, UFC President Dana White announced that the fight had been fought to a draw, therefore the fighters would go a third round.
In the third round, Dewees continued to bleed profusely, with blood continuously and steadily pouring from his wound. The two fighters continued to grapple, rolling around in a pool of blood. Ray was clearly distressed by the amount of blood, as Dewees lay atop him and punched with one hand and held the other one over the cut, attempting to alleviate the bleeding. Dewees won the final round with a 10–9 decision. This fight was perhaps the bloodiest battle ever witnessed on The Ultimate Fighter. Dewees proceeded to the semi-finals, but was eliminated from the tournament by Patrick Côté by unanimous decision.
Dewees was featured on the undercard of The Ultimate Finale 4, where he lost to Jorge Rivera by first-round technical knockout. After referee Yves Lavigne stopped the fight, Dewees sprang off the ground in protest of the stoppage.
Dewees was defeated by Antônio Rogério Nogueira at Affliction: Banned on July 19, 2008 via TKO, 4:06 of round 1.
Since losing to Antônio Rogério Nogueira at Affliction: Banned, Dewees has gone 3-5 in independent promotions.
Dewees is currently coaching and training at TNT Mixed Martial Arts Training Center in Phoenix, AZ
Personal life
Dewees has four children, a son born in 2007 and twin boys born in 2008, and a daughter born in 2015. He resides near Phoenix, Arizona. He attended and graduated from Cortez High School.
Mixed martial arts record
|-
| Loss
| align=center| 38–18 (1)
| Dale Sopi
| TKO (head kick and punches)
| Rage in the Cage 174
|
| align=center| 1
| align=center| 1:54
| Phoenix, Arizona, United States
|
|-
| Loss
| align=center| 38–17 (1)
| Lolohea Mahe
| KO (punch)
| Maui Fighting Championship 2012
|
| align=center| 1
| align=center| N/A
| Kahului, Hawaii, United States
|
|-
| Win
| align=center| 38–16 (1)
| Julian Hamilton
| TKO (punches)
| Rage in the Cage 163
|
| align=center| 1
| align=center| 1:13
| Chandler, Arizona, United States
|
|-
| Loss
| align=center| 37–16 (1)
| Luke Harris
| Submission (guillotine choke)
| MFC 33
|
| align=center| 1
| align=center| 2:05
| Edmonton, Alberta, Canada
|
|-
| Loss
| align=center| 37–15 (1)
| Jacen Flynn
| Submission (rear-naked choke)
| Bully's Fight Night 2
|
| align=center| 1
| align=center| 0:44
| Lethbridge, Alberta, Canada
|
|-
| Win
| align=center| 37–14 (1)
| Chuck Huus
| Submission (guillotine choke)
| TCF: Rumble at the Ranch
|
| align=center| 1
| align=center| 0:29
| Glendale, Arizona, United States
|
|-
| Loss
| align=center| 36–14 (1)
| Marcus Vänttinen
| TKO (punches)
| FF 30: Fight Festival 30
|
| align=center| 1
| align=center| 3:13
| Helsinki, Finland
|
|-
| Win
| align=center| 36–13 (1)
| Eric McElroy
| Submission (rear-naked choke)
| RITC: Rage In The Cage 133
|
| align=center| 1
| align=center| 0:56
| Santa Ana Pueblo, New Mexico, United States
|
|-
| Loss
| align=center| 35–13 (1)
| Antônio Rogério Nogueira
| TKO (punches)
| Affliction: Banned
|
| align=center| 1
| align=center| 4:06
| Anaheim, California, United States
|
|-
| Win
| align=center| 35–12 (1)
| Richard Blake
| Submission
| NLF: Redemption
|
| align=center| 1
| align=center| 1:27
| Houston, Texas, United States
|
|-
| Loss
| align=center| 34–12 (1)
| Cory MacDonald
| TKO (punches)
| PFP: New Year's Restitution
|
| align=center| 1
| align=center| 4:14
| Halifax, Nova Scotia, Canada
|
|-
| Loss
| align=center| 34–11 (1)
| Frank Trigg
| Submission (kimura)
| HDNet Fights: Reckless Abandon
|
| align=center| 1
| align=center| 1:40
| Dallas, Texas, United States
|
|-
| Loss
| align=center| 34–10 (1)
| Jorge Rivera
| TKO (punches)
| The Ultimate Fighter: The Comeback Finale
|
| align=center| 1
| align=center| 2:37
| Las Vegas, Nevada, United States
|
|-
| Loss
| align=center| 34–9 (1)
| Art Santore
| KO (punches)
| TC 13: Anarchy
|
| align=center| 2
| align=center| 0:14
| Del Mar, California, United States
|
|-
| Win
| align=center| 34–8 (1)
| Buckley Acosta
| Submission (triangle choke)
| KOTC: Outlaws
|
| align=center| 1
| align=center| 0:56
| Globe, Arizona, United States
|
|-
| Win
| align=center| 33–8 (1)
| Leo Sylvest
| Submission
| LOF 3: Legends of Fighting 3
|
| align=center| 1
| align=center| N/A
| Indianapolis, Indiana, United States
|
|-
| Loss
| align=center| 32–8 (1)
| Chris Leben
| Submission (armbar)
| UFC Ultimate Fight Night 2
|
| align=center| 1
| align=center| 3:26
| Las Vegas, Nevada, United States
|
|-
| Win
| align=center| 32–7 (1)
| Jason Geris
| TKO
| GC 41: Gladiator Challenge 41
|
| align=center| 1
| align=center| 0:55
| Colusa, Arizona, United States
|
|-
| Win
| align=center| 31–7 (1)
| Chance Williams
| Submission (rear-naked choke)
| KOTC 56: Caliente
|
| align=center| 1
| align=center| 1:16
| Globe, Arizona, United States
|
|-
| Win
| align=center| 30–7 (1)
| Rich Alten
| TKO (punches)
| RITC 70: Rage in the Cage 70
|
| align=center| 1
| align=center| 0:49
| Phoenix, Arizona, United States
|
|-
| Loss
| align=center| 29–7 (1)
| Rich Franklin
| TKO (punches and knees)
| UFC 44
|
| align=center| 1
| align=center| 3:35
| Las Vegas, Nevada, United States
|
|-
| Win
| align=center| 29–6 (1)
| Chappo Montijo
| Submission (choke)
| RITC 52: Rivalry
|
| align=center| 1
| align=center| 0:27
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 28–6 (1)
| Robert Beraun
| Submission (choke)
| RITC 49: Stare Down
|
| align=center| 1
| align=center| 1:57
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 27–6 (1)
| John Sullivan
| TKO (strikes)
| RITC 47: Unstoppable
|
| align=center| 1
| align=center| 1:41
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 26–6 (1)
| Auggie Padeken
| Submission (rear-naked choke)
| Rumble on the Rock 2: Rumble on the Rock 2
|
| align=center| 1
| align=center| 2:13
| Honolulu, Hawaii, United States
|
|-
| Win
| align=center| 25–6 (1)
| Homer Moore
| Decision (majority)
| RITC 45: Finally
|
| align=center| 3
| align=center| 3:00
| Phoenix, Arizona, United States
|
|-
| NC
| align=center| 24–6 (1)
| Todd Medina
| No Contest (overturned)
| RITC 43: The Match
|
| align=center| 1
| align=center| 0:45
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 24–6
| Sam Adkins
| Decision (unanimous)
| RITC 39: Bring It
|
| align=center| 3
| align=center| 3:00
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 23–6
| Shannon Ritch
| Submission (armbar)
| RITC 38: Let's Roll
|
| align=center| 1
| align=center| 1:12
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 22–6
| Joey Vigueria
| TKO (submission to punches)
| RITC 37: When Countries Collide
|
| align=center| 1
| align=center| 0:21
| Phoenix, Arizona, United States
|
|-
| Loss
| align=center| 21–6
| Drew Fickett
| Decision (unanimous)
| RITC 36: The Rematch
|
| align=center| 3
| align=center| 3:00
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 21–5
| Joe Grant
| TKO (submission to punches)
| RITC 35: This Time It's Personal
|
| align=center| 1
| align=center| 1:16
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 20–5
| Drew Fickett
| Decision (split)
| RITC 34: Rage in the Cage 34
|
| align=center| 3
| align=center| 3:00
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 19–5
| Brad Reynolds
| Submission (armbar)
| RITC 33: The Big Show
|
| align=center| 1
| align=center| 1:05
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 18–5
| Jesus Valdez
| Submission (choke)
| RITC 31: Rage in the Cage 31
|
| align=center| 2
| align=center| 1:57
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 17–5
| Randy Lavrar
| Submission (choke)
| RITC 30: Rage in the Cage 30
|
| align=center| 1
| align=center| 1:09
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 16–5
| George Lockhart
| Submission (choke)
| RITC 29: Rage in the Cage 29
|
| align=center| 1
| align=center| 1:40
| Phoenix, Arizona, United States
|
|-
| Loss
| align=center| 15–5
| Joe Stevenson
| Decision (unanimous)
| GC 4: Collision at Colusa
|
| align=center| 3
| align=center| 5:00
| Colusa, California, United States
|
|-
| Loss
| align=center| 15–4
| Jeremy Edwards
| Decision (unanimous)
| KOTC 8: Bombs Away
|
| align=center| 2
| align=center| 5:00
| Williams, California, United States
|
|-
| Win
| align=center| 15–3
| Christophe Leininger
| Decision (unanimous)
| RITC 26: Rage in the Cage 26
|
| align=center| 3
| align=center| 3:00
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 14–3
| Allan Sullivan
| Submission (armbar)
| RITC 25: Rage in the Cage 25
|
| align=center| 1
| align=center| 2:30
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 13–3
| Sean Williams
| Submission (armbar)
| RITC 24: Rage in the Cage 24
|
| align=center| 1
| align=center| 1:38
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 12–3
| Ryan Brown
| Submission (choke)
| RITC 23: Rage in the Cage 23
|
| align=center| 1
| align=center| 0:45
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 11–3
| Justin Antle
| TKO (submission to punches)
| rowspan=2|RITC Tucson 5: Rage in the Cage Tucson 5
| rowspan=2|
| align=center| 1
| align=center| 0:45
| rowspan=2|Tucson, Arizona, United States
|
|-
| Win
| align=center| 10–3
| Kyle Deween
| TKO (submission to punches)
| align=center| 1
| align=center| 0:42
|
|-
| Win
| align=center| 9–3
| Rudy Battista
| Submission (choke)
| RITC 22: Rage in the Cage 22
|
| align=center| 1
| align=center| 0:47
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 8–3
| Trinity Boykin
| Submission (triangle choke)
| rowspan=3|RITC 21: Rage in the Cage 21
| rowspan=3|
| align=center| 1
| align=center| 1:13
| rowspan=3|Phoenix, Arizona, United States
|
|-
| Win
| align=center| 7–3
| Trinity Boykin
| Submission (triangle choke)
| align=center| 1
| align=center| 0:53
|
|-
| Win
| align=center| 6–3
| Jeff Horlacher
| Submission (choke)
| align=center| 1
| align=center| 0:58
|
|-
| Win
| align=center| 5–3
| Jesse Amado
| Submission (armbar)
| rowspan=2|RITC Tucson 4: Rage in the Cage Tucson 4
| rowspan=2|
| align=center| 1
| align=center| 1:06
| rowspan=2|Tucson, Arizona, United States
|
|-
| Win
| align=center| 4–3
| Anthony Tarango
| TKO (submission to punches)
| align=center| 1
| align=center| 1:30
|
|-
| Loss
| align=center| 3–3
| Antonio McKee
| Decision (unanimous)
| RITC 20: Rage in the Cage 20
|
| align=center| 3
| align=center| 3:00
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 3–2
| Matt Lynn
| TKO (submission to punches)
| RITC Tucson 3: Rage in the Cage Tucson 3
|
| align=center| 1
| align=center| 0:30
| Tucson, Arizona, United States
|
|-
| Loss
| align=center| 2–2
| David Harris
| Submission (armbar)
| RITC 19: Rage in the Cage 19
|
| align=center| 2
| align=center| 1:52
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 2–1
| MacArthur Blueback
| Submission (choke)
| RITC 18: Rage in the Cage 18
|
| align=center| 1
| align=center| 0:29
| Phoenix, Arizona, United States
|
|-
| Win
| align=center| 1–1
| Chris Meyers
| Submission (ankle lock)
| RITC 17: Rage in the Cage 17
|
| align=center| 2
| align=center| 0:17
| Phoenix, Arizona, United States
|
|-
| Loss
| align=center| 0–1
| Bill Cameron
| Submission (armbar)
| RITC 16: Rage in the Cage 16
|
| align=center| 1
| align=center| 2:27
| Phoenix, Arizona, United States
|
See also
List of male mixed martial artists
References
External links
Official Myspace Site
Edwin "Bam Bam" Dewees Homepage
American male mixed martial artists
American sportspeople in doping cases
Mixed martial artists from Arizona
Mixed martial artists from South Carolina
Doping cases in mixed martial arts
Middleweight mixed martial artists
Ultimate Fighting Championship male fighters
Living people
1982 births
|
New Device are a UK-based hard rock band, established in late 2007. The band's style is rooted in classic rock of the 1980s, influenced by bands such as: Aerosmith, Skid Row, Metallica and Guns N' Roses. They first gained a modicum of fame via their Myspace site, when they uploaded early demos which were successfully received by fans.
Takin' Over
New Device began the recording process for their debut album Takin' Over in June 2008, with Ryan Richards of Funeral for a Friend handling drum duties. The album was released on Powerage Records on 20 July 2009. The band's debut single was the album's title track, "Takin' Over". Second single "In The Fading Light" was featured on the soundtrack for the British movie "Fish Tank". The band played at the Download Festival in 2009 and at the Sonisphere Festival in the same year.
The band appeared in Kerrang! magazine in their Introducing... section in October 2009. They have also appeared in Classic Rock magazine, Rock Sound magazine and Big Cheese magazine.
New Device were nominated for "Best New Band" in the 2009 Classic Rock Awards; however, Sammy Hagar, Mike Anthony, Chad Smith and Joe Satriani's supergroup Chickenfoot went on to win the award.
Touring
New Device supported Europe at their sold-out "Classic Rock Roll of Honour Awards" gig at the Relentless Garage venue in Islington on 1 November 2009. The band then completed two tours of the UK in 2009; the first was with Scottish rock band Gun, in November. This tour saw vocalist Dan Leigh duet with Dante Gizzi from Gun on a cover of the Beastie Boys song, "Fight For Your Right (To Party)" on the Glasgow date. The second leg of the tour was a support slot with joint headliners, Heaven's Basement and Dear Superstar.
In 2010 the band underwent a lineup change, with both Phil Kinman and Robb Wybrow leaving the band. New members were inducted: Shane Lee and Gaz Bolan (guitars) and Andy Saxton (bass guitar). The new lineup's first tour of 2010 was in support for Dear Superstar. During this tour it was announced that the band were to support Bon Jovi for one date at the O2 Arena (London), playing to an estimated audience of 23,000 people. They also opened the 2010 High Voltage Festival in Victoria Park, London.
2011–12
New Device headlined the "Powerage Tour" in February 2011 - a series of free shows across the UK, showcasing bands signed to the Powerage record label. Guitarist K.C. Leigh replaced departing bandmembers Lee and Bolan at this time. Alongside New Device, the Powerage Tour also featured The Treatment, Lethargy and Million Dollar Reload.
After this tour the band took a break, to focus on writing their second album. They debuted new songs in a gig at The Borderline venue in London on 29 November 2011, and a series of live dates with The Treatment followed throughout December. The recording process began in early 2012.
A new lineup was announced in April 2012: Daniel Leigh (vocals), Greg 'Rozzy' Ison (drums), Matt Mallery and Nick Jones (guitars), and Nick Hughes (bass guitar). A new song entitled "Kingdom of the Damned" was posted on the band's official website in June 2012. Their second album, Here We Stand was released in May 2013, preceded by the single, "Save Your Life".
2015–16
2014 saw the departure of guitarist Nick Jones, who was replaced by James Arter. In July 2014, New Device recorded their first live album, Takin' Over London, which was released in May 2015. The band then became a four-piece, having parted ways with James Arter.
Band members
Current members
Daniel Leigh - lead vocals, rhythm guitar (2007-present)
Greg 'Rozzy' Ison - drums (2007-present)
Matt Mallery - lead guitar, backing vocals (2012-present)
Elizabeth "Lzi" Hayes - bass guitar, backing vocals (2017-present)
Former members
Phil Kinman - lead guitar (2007-2010)
Robb Wybrow - rhythm guitar (2007-2010)
Shane Lee - lead guitar (2010-2011)
Gaz Bolan - rhythm guitar (2010-2011)
K.C. Leigh - lead guitar (2011-2012)
Andy C Saxton - bass guitar (2007-2012)
Nick Jones - rhythm guitar (2012-2014)
James Arter - rhythm guitar (2014-2015)
Nick Hughes - bass guitar (2012-2017)
Discography
Studio albums
Takin' Over (2009)
Here We Stand (2013)
Live albums
Takin' Over London (2015)
Extended plays
Devils on the Run (2016)
Coming Home (2017)
Karoshi (2020)
References
External links
New Device - official website
New Device - Reverbnation site
English rock music groups
|
Arve Berg (born 1 May 1935, in Skodje) is a Norwegian politician for the Labour Party.
He was elected to the Norwegian Parliament from Møre og Romsdal in 1973, and was re-elected on three occasions, serving until 1989.
On the local level he was a member of Ålesund city council from 1963 to 1975. From 1971 to 1975, he was also a deputy member of Møre og Romsdal county council. He chaired the local party chapter from 1966 to 1968.
References
1935 births
Living people
Members of the Storting
Møre og Romsdal politicians
Labour Party (Norway) politicians
Politicians from Ålesund
20th-century Norwegian politicians
|
Clan Logan is a very ancient Scottish clan of celtic origin. Two distinct branches of Clan Logan exist: the Highland branch; and the Lowland branch (which descends from Sir Robert Logan of Restalrig who married Katherine Stewart, a daughter of the future Robert II () and, in 1400, became Lord High Admiral of Scotland). The clan does not have a chief recognised by Lord Lyon King of Arms, and therefore can be considered an armigerous clan.
History
The surname Logan is a territorial name, likely derived from the Gaelic word "Lagan or Laggan" meaning low-lying land, a glen, dell, or hollow, based on the situation of their land. They had lands in Gallway and Dumfiresshire at an early period and also in Ulster, Ireland, since the Clans often crossed over. They soon spread over Scotland to Ayrshire, Lanarkshire, Dumfriesshire, Dubarton, and Rossshire. The Logan family was divided into two main branches, the Grugar (later the Restalrig) Chiefs of the name in the south of Scotland, which was recorded by Lord Lyons, and the Highland branch of Driudeurfit, Chiefs in the North. There was also a distinguished branch in Lanarkshire.
Based on modern criteria, with so many people doing genealogy and DNA testing, it's been confirmed by the Logan DNA project, that there are at least 14 separate lines of Logans, known so far, with Scottish Logans, Irish Logans, New Zealand, Australia, Canada, and about anywhere in the world. Most Logan's were ordinary people, farmers, businessman, soldiers, seaman, educators, etc. These Logans would probably not been written about in history books, but the name Logan, has come a long way throughout the world, with airports, towns, counties, and universities named for it.
The Northern Logans
The northern Logan Clan can be traced back on the headstones in Kilmuir Kirkyard, where they were known as the Logans of Drumdeurfit, which is situated in the Black Isel in Easter Rossshire and most of the Black Isle. Robert Logan of Druimdeurfit can be found in this cemetery. But the family can be found over a wide area, even over to Harris in the Western Hebrides. Colan Logan, heiress of Druimmanairig, married Eachuin Beirach, a son of the Baron of Kintail, who died at Eadarachaolis about 1350, leaving a son Eanruig from whom descends the Logans of Harris. Between 1372 - 1450, Crotach M'Gillie Gorm was the Chief of the Northern Clan Logan. From that date up to 1564, the chiefs were buried in Kilmuir, Western Kirkyard, as is recored on Thomas Logan's tomb, but time has worn them away, and the names are no longer legible, but other Logans there are readable.
The Lowland Logans
From 1200 to 1600, the family had large possessions in both Scotland and in Ulster, Ireland, and were amongst the most distinguished knights and barons of that time. They were specifically famed for their steadfast courage and patriotic loyalty, with many being slain in battle against the English invaders. They were supporters of both William Wallace and Robert the Bruce in winning the independence of Scotland from England, both with fighting men and financially.
One of the earliest records of the surname is of Robert Logan who is recorded as witnessing the resignation of the lands of Ingilbristoun in 1204. The name is variously recorded throughout the 13th century. Several Logans are recorded as paying homage to Edward I of England within the Ragman Rolls of 1296. These are Phelippe de Logyn (burgess from Montrose), Thurbrandus de Logyn (from Dumfrieshire), Andreu de Logan (from Wigtonshire), and Wautier Logan (from Lanarkshire). The seal of Wautier Logan (SIGILLVM WALTERI LOGAN) is blazoned a stag's head cabossed, between the antlers, a shield with three piles.
Walter Logan, Lord of Hartside was a sheriff of Lanark in 1301, and in 1298 had received a grant of the lands of "Lus" from Robert Bruce. This Walter Logan appears twice on a roll of landowners forfeited in 1306 by Edward I, for supporting Robert the Bruce. The first instance of Logan has John Cromwell as the petitioner for Logan's forfeited lands, while the second instance of Walter Logan has William Mulcaster and John Bisset petitioning for his lands.
In 1306 Dominus Walter Logan was taken prisoner by the English forces and hanged at Durham, in the presence of Edward of Carnarvon (the future Edward II of England).
In 1330 brothers Sir Robert Logan and Sir Walter Logan, both sons of Dominus Walter Logan; along with Sir William de Keith, Sir William de St. Clair of Rosslyn; accompanied Sir James Douglas in his quest to take the heart of the dead King Robert I of Scotland to the Holy Land. Douglas and his company had been received by Alfonso XI of Castile, who campaigning against the Moors, in the Kingdom of Granada. Near the Castillo de la Estrella, Alfonso's army fought the Saracens at the Battle of Teba. During the battle Douglas observed a knight of his company surrounded by Moorish warriors, and with his remaining men attempted to relieve his countryman. As the knights were hard pressed and outnumbered by the Moors, Sir James Douglas took the silver casket containing the heart of Robert Bruce, and threw it before him among the enemy, saying, "Now pass thou onward before us, as thou wert wont, and I will follow thee or die." Sir James Douglas and most of his men were slain, among them Sir Robert Logan and Sir Walter Logan.
The leading Logan family's principal seat was in Lestalrig or Restalrig, near Edinburgh. Sir Robert Logan of Restalrig married Katherine Stewart, daughter of Robert II of Scotland, and later in 1400 Sir Robert was appointed Admiral of Scotland. Sir Robert Logan, Baron of Grugar, and 1st Logan Baron of Restalrig, was a most distinguished knight, who lived in the reign of Robert II (1371-1390), Robert III (1390-1406) James I (1424-1437), and James II, up to 1439. His Barony of Grugar, Ayrshire, had descended to him from Sir John de Logan, who held it in 1302, and the lands of Malles in Gowrie from Adam de Logan, 1226. When Sir John de Lestalric died in 1382, Sir Robert became the first Logan Baron of Restalric, which was in the Lestalric family from 1124 - 1382.
Sir Robert Logan was one of the hostages given in 1424 to free James I of Scotland from being held in England. Robert's son or grandson, John Logan of Restalrig, was made principal sheriff of Edinburgh by James II of Scotland.
In 1555 Logan of Restalrig sold the superiority of Leith (the principal seaport of Edinburgh) to the queen regent Mary of Lorraine, also known as Marie de Guise.
The last Sir RobertLogan, Seventh and Last Baron of Restalric, Baron of Grugar, Baron of Fast Castle, Baron of Hutton, Lord of the Manor of Gunsgreen, son of Lady Agnes Gray, born in 1555 and dies on 28 Jan 1607, still a very wealthy man, and left his children a large estate. The last the Baron was Robert Logan of Restalrig, who was described by contemporaries as "ane godless, drunkin, and deboshit man". Sir Walter Scott described him as "one of the darkest characters of that dark age". The deceased Sir Robert Logan did not pass way without controversy, though. He is associated with a controversy which even today, has people taking sides as to he was railroaded or he was guilty as sin. This was the infamous Gowrie Conspiracy, which was brought to Scottish Court in 1609, approximately 3 years after his death, but Scottish Law required his body to be in the courtroom. If you like a puzzle, read the Gowrie Conspiracy with an open mind, and decide for yourself, his innocence or guilt, but the final verdict was that King James I as the injured party, and Logan's children were thus forfeited, outlawed, and ruined, and his wealthy estate went to the King, and his closest associates.
The Lowland Logan Clan Chiefs have been traced back to Alexander Logan in 1517, succeeded by Patrick Logan of that Ilk in 1531, to William Logan of Logan in 1558, to George Logan of that Ilk in 1603, to William Logan in 1633 to his son George Logan of Logan. He is the one that officially registered the Coat of Arms with the first Lord Lyons office in 1672 and dies 1756, to George Logan III of Logan, to his brother Hugh Logan, to Hugh Logan of Logan who dies in 1759. The last Logan of Logan, Hugh Logan, in Ayrshire was celebrated for both his wit and eccentricity. Logan was known for his The Laird of Logan, published after his death, which was a compilation of amusing anecdotes and puns. He had one daughter, who married a Mr. Campbell. He died in 1802, without heirs.
Shared tartans
Today both clans Logan and MacLennan share the same tartan. This tartan was first recorded in 1831 by the historian James Logan, in his book The Scottish Gaël. Later in 1845 The Clans of the Scottish Highlands was published, which consisted of text from Logan, accompanied by illustrations from R. R. McIan. This work was the first which showed the MacLennan's sharing the same tartan as the Logans. The text on the history of Clan Logan pointed to an ancient link between the Logans and MacLennans. The plate for MacLennan, shows a man from this clan wearing the Logan tartan, but no name is given to it unlike every other clan tartan shown. Given the style of writing at the time and subtleties used by both the artist and writer, this is not a surprise and allows them to pay homage to the story of the origin of MacLennan. Until the early nineteenth century there was no such thing as "clan tartans".
Clan symbols
Today Scottish clans use crest badges, clan badges (plant badges) and tartan as symbols to represent themselves. The crest badge suitable for members of Clan Logan contains the heraldic crest of a passion nail piercing a human heart, Proper; and the heraldic motto HOC MAJORUM VIRTUS, which translates from Latin as "this is valour of my ancestors". The plant badge (clan badge) associated with Clan Logan is furze (gorse). According to Robert Bain, the slogan of Clan Logan is Druim-nan-deur (translation from Scottish Gaelic: "the ridge of tears").
The tartan most commonly associated with the surname Logan is identical to that of Clan MacLennan. The sett was first published by James Logan's The Scottish Gaël of 1831. There are however earlier dated tartans which are attributed to the name Logan. One such tartan is usually known as a Skene tartan, though it has sometimes been known as a Rose tartan. The official state tartan of Utah is based upon this tartan, in respect of Ephraim Logan who is considered the first American of Scottish descent who left a permanent mark on Utah.
Clan Logan in Fiction
In the drama Law & Order, Detective Mike Logan learns that in his family ancestorial home in Ireland there are only two persons with the Logan surname-one is the Parish priest; the second is his brother who owns a pub and a funeral parlor.
Notes
References
R.R. McIan, "The Clans of The Scottish Highlands" ()
International Clan Logan Society, Inc.
Our Valour©, newsletter of the International Clan Logan Society, Inc.
works cited
Anderson, William. The Scottish Nation; Or The Surnames, Families, Literature, Honours, And Biographical History Of The People Of Scotland. (vol.2). Edinburgh: A. Fullarton & Co., 1862.
Bain, Robert. The Clans And Tartans Of Scotland. London and Glasgow: Fontana and Collins, 1983.
Barrow, G W S. Robert Bruce, and the Community of the Realm of Scotland. London: Eyre & Spottiswoode, 1965.
Black, George Fraser. (1946). The Surnames of Scotland : Their Origin, Meaning and History. (New York).
Stewart, Donald C. The Setts of the Scottish Tartans, with descriptive and historical notes. London: Shepheard-Walwyn, 1974.
Thompson, Thomas. (1834). Publica Sive Processus Super Fidelitatibus Et Homagiis Scotorum Domino Regi Angliæ Factis A.D. MCCXCI-MCCXCVI. (Bannatyne Club).
Major G. J. N. Logan-Home, (1934). "THE History of the Logan Family".
External links
http://www.electricscotland.com/webclans/htol/logan.html
http://www.clanlogansociety.com/
http://www.clanlogan.ca/
Scottish clans
Armigerous clans
|
Net metering in New Mexico is a set of state public policies that govern the relationship between solar customers (and customers with other types of renewable energy systems) and electric utility companies.
Background
Definition
Net metering refers to the interconnection of a renewable energy system to the power grid. It allows consumers who have their own renewable generation power systems to connect to the power grid with an electric meter that spins both forwards and backwards, depending on whether the consumer is adding energy to the grid or using energy from the grid. At the end of the month, the customer's bill is based on the net amount of power that is drawn from the grid, minus the credits for excess power put into the grid.
In New Mexico, customers who have systems that produce up to 80 MW of electricity are able to sign up for net metering. This is the highest power rating eligible for net metering in the United States.
The three main utilities in New Mexico are PNM, Xcel Energy and El Paso Electric.
Benefits of net metering
One benefit of net metering is that power is never wasted. When someone uses an isolated system that uses batteries that become fully charged while the system is still generating power, that excess power is wasted.
Customer-generators, businesses and industrial operations can qualify for net metering. Customer-generators have the added benefit of selling renewable energy credits (REC) back to their utility. (A customer-generator is a small producer—that is not an electric utility—of electricity which is net metered and connected to the electric grid. An example would be a homeowner who puts solar panels on his rooftop.)
Utility-scale solar vs. residential solar
A utility-scale solar facility is a large facility that generates solar power and moves that power into the electric grid. Almost every utility-scale solar facility has what is known as a power purchase agreement with the utility. The agreement guarantees a market for the utility-scale solar facility's energy for a fixed term of time. (Residential solar systems are not considered utility-scale).
The size of a utility-scale facility can vary. For example, some utility-scale facilities provide only enough power per megawatt to power a few hundred average homes. Others offer a lot more energy. Factors that play into this are location, the type of technology used, and the availability of sunlight.
For example, although not located in New Mexico, Recurrent Energies’ “Sunset Reservoir” project in San Francisco produces 5 megawatts of solar energy. It is built on top of enclosed reservoir in the middle of San Francisco. It is considered a utility-scale solar facility.
How it works
Net excess generation
For customers with solar systems that can generate 10 kilowatts or less, the utility company has a choice in how they compensate that customer for net excess generation. The utility can give the customer a credit on their next bill equal to the utility's energy rate (the costs that the utility pays for its own electricity), or crediting the customer for the kilowatt hours of electricity that they have supplied back to utility through the grid.
Technical
In New Mexico, a few technical requirements exist in order for a net metering system to be connected to the grid. First, the net metering system should have a visible means of disconnection allowing the utility to disconnect to system from the grid. Second, a net meter is required and should cost no more than $20. Third, there needs to be an inverter that disconnects when the grid goes down.
The system capacity limit is 80 megawatts.
Eligibility
In New Mexico the types of renewable technologies eligible for net metering are the following:
Combined Heat & Power
Fuel cells using Non-Renewable Fuels
Fuel cells using Renewable Fuels
Geothermal Electric
Hydroelectric
Hydroelectric (Small)
Landfill gas
Microturbines
Municipal solid waste
Solar photovoltaics
Solar thermal electric
Wind (All), Biomass
Wind (Small)
Sectors that can use net metering include commercial, industrial, local government, nonprofits, residential homes, schools, state and federal government, agricultural, and institutional.
The types of utilities that can participate in net metering are investor-owned utilities and electric cooperatives.
Utilities that can participate are investor-owned utilities and electric cooperatives. When a customer leaves the utility, the utility must pay the customer for any unused credits.
Availability and jurisdiction
According to DSIRE, “Net metering is available to all "qualifying facilities" (QFs), as defined by the federal Public Utility Regulatory Policies Act of 1978 (PURPA), which pertains to renewable energy systems and combined heat and power systems up to 80 megawatts (MW) in capacity. There is no statewide cap on the aggregate capacity of net-metered systems.”
Additionally, all utilities that are subject regulation under the Public Regulation Commission’s (PRC) jurisdiction must offer net metering. Municipal utilities, which are not regulated by the PRC, are exempt.
Solar in New Mexico
Growth
In New Mexico, the decrease in prices for solar systems is driving the market for it. Many homeowners and commercial companies are purchasing solar systems to help offset the increase in electric utility bills. More financing options are available today in New Mexico, more solar companies are competing, and this is leading to an increase in market penetration.
The growth is predicted at 20% per year. As of early 2016, the market in the United States for solar systems had reached 1 million solar installations. This is equivalent to generating enough electricity to power 5.4 million homes, according to the national Solar Energy Industry Association.
According to the Albuquerque Journal, “New Mexico ranks 8th in the nation today in terms of installed solar capacity per capita.” It is estimated that the solar market in New Mexico has only experienced approximately 10% of market penetration.
Solar capacity and statistics
According to the Albuquerque Journal, “As of year-end 2015, New Mexico had about 400 megawatts of installed capacity. That includes 85 MW of residential and commercial systems, and 316 MW of utility-scale generation scattered throughout the service territories of New Mexico’s public utilities and electric cooperatives.”
For all the installed solar capacity in the New Mexico, the Public Service Company of New Mexico accounts for around 41% of that. Their facilities include fifteen different projects with a total of 107 MW of capacity, which according to the company, provides enough power 140,000 average homes.
New Mexico requires public utilities to get 15% of their electric generation from renewable sources. That number will increase to 20% by the year 2020.
Within the state, sixty different contracting and installation companies operate. These firms include national companies like SolarCity and ZingSolar.
Consumer incentives
State tax credit
Up until the end of 2016, New Mexico offered a 10% state tax credit for solar installations. The tax credit began in 2008.
Solar companies operating in New Mexico say they are okay to absorb the loss of the state tax credit, meaning that they don't believe it will affect their business. However, in addition to the loss of the tax credit, renewable energy payments from utilities to customers is also declining.
Federal tax credit
In addition to the state tax credit, which is over, the U.S. government gives a 30 percent tax credit for solar installations. In December 2015, Congress extended the program through the end of 2019.
Payments from utilities
PNM and El Paso Electric Co. in southern New Mexico paid customers for each kilowatt hour of electricity they produced from their solar systems. These payments help customers and businesses offset the costs of installing their solar systems.
In addition to the payments, those companies offer net metering. Under net metering, people with solar systems can sell their excess electricity back to the utility company at a price equal to what the utility pays for its own electricity. Note that net metering is a separate system of payments from the renewable payments that utilities offer back to customers.
For example, 7,100 customers have signed up for the renewable payments from the utility PNM. In 2014, that number was only 4,400 customers.
Payments from utilities back to customers decreased from $.13 per kilowatt hour in 2009 to $.025 by the end of 2015. As of the middle of 2016, PNM stopped accepting new applications because the number of people seeking the credits was more than the money available in the program.
According to DSIRE, a program operated by the N.C. Clean Energy Technology Center at North Carolina State University funded by the U.S. Department of Energy, “If a customer has NEG [net energy generation] totaling less than $50 during a monthly billing period, the excess is carried over to the customer’s next monthly bill. If NEG exceeds $50 during a monthly billing period, the utility will pay the customer the following month for the excess.
“The energy rate to be paid for the energy supplied by the QF [qualifying facility] in any month shall be the respective month's rate from the utility's current schedule on file with the PRC. Each utility shall file with the PRC its schedule containing monthly energy rates that will be applicable to the next twelve-month period.”
Price of solar installation
According to a study by Lawrence Livermore National Laboratory, prices for the installation of residential and utility-scale solar generation plants went down by more than 50 percent between 2008 and 2014. In 2015, prices fell another 17 percent.
As of 2017, an average New Mexico residential system producing 4.4 kilowatts costs approximately $17,000 before tax credits and other incentives. After credits and incentives, the system would cost approximately $11,900. In 2009, that same system had cost $30,000. If a consumer chose to finance the system, they could pay around $99 a month.
Regulatory rules
In New Mexico there are two primary rules that govern the interconnection of a solar system to the utility grid:
NMPRC Rule 570 (general interconnection of qualifying facilities—larger solar-producing facilities)
NMPRC Rule 571 (net metering for small renewable energy systems)
According to the New Mexico Solar Energy Association, “These rules apply wherever electricity service is regulated by the PRC. This includes the areas serviced by New Mexico's four investor owned utilities (IOUs) (which encompasses Santa Fe and Albuquerque for example), and the areas services by electric coops. It does not include municipal utilities (such as Los Alamos and Farmington), which are self-regulated.”
Additionally, “If the net-metered facility uses more power than it produces over a billing period, the utility may bill the customer for the net power used according to the rate structure that would apply to the customer if they had not connected as a net-metering facility.”
Future of net metering in New Mexico
The solar industry in New Mexico is facing hurdles. Most utilities want to reduce incentives like net metering and charge customers more who have solar systems. The reason they want to do this is because the utilities maintain that their role in generating plants, transmitting and distributing electricity through distribution lines, and other fixed costs remain unchanged. They argue that solar customers are not financially contributing to those fixed costs.
References
External links
Utility-specific information on net metering can be found at the following websites:
PNM Resources (Public Service Company of NM) - Rider No. 24
Xcel Energy (Southwestern Public Service Company) - PDFs/rates/NM/nm_sps_e_entire.pdf Tariff No. 3018.33
El Paso Electric Company - Rate No. 16
City of Farmington - Rate No. 17
Regulations:
Title 17: Public Utilities And Utility Services. Chapter 9: Electric Services. Part 570: Governing Cogeneration And Small Power Production
Incentives:
MEXICO INCENTIVES PANEL.pdf New Mexico Incentives for Customer-Owned Solar Photovoltaic Systems
Programs:
PNM Customer Solar Energy Program
Energy in New Mexico
Energy policy
|
```smalltalk
using System;
using System.Collections.Generic;
using System.Text.Json;
using System.Threading.Tasks;
using Amazon.Lambda.Annotations;
using Amazon.Lambda.Annotations.APIGateway;
using Amazon.Lambda.APIGatewayEvents;
using Amazon.Lambda.Core;
namespace TestServerlessApp
{
public class Greeter
{
[LambdaFunction(ResourceName = "GreeterSayHello", MemorySize = 1024, PackageType = LambdaPackageType.Image)]
[HttpApi(LambdaHttpMethod.Get, "/Greeter/SayHello", Version = HttpApiVersion.V1)]
public void SayHello([FromQuery(Name = "names")]IEnumerable<string> firstNames, APIGatewayProxyRequest request, ILambdaContext context)
{
context.Logger.LogLine($"Request {JsonSerializer.Serialize(request)}");
if (firstNames == null)
{
return;
}
foreach (var firstName in firstNames)
{
Console.WriteLine($"Hello {firstName}");
}
}
[LambdaFunction(ResourceName = "GreeterSayHelloAsync", Timeout = 50, PackageType = LambdaPackageType.Image)]
[HttpApi(LambdaHttpMethod.Get, "/Greeter/SayHelloAsync", Version = HttpApiVersion.V1)]
public async Task SayHelloAsync([FromHeader(Name = "names")]IEnumerable<string> firstNames)
{
if (firstNames == null)
{
return;
}
foreach (var firstName in firstNames)
{
Console.WriteLine($"Hello {firstName}");
}
await Task.CompletedTask;
}
}
}
```
|
```python
#!/usr/bin/env python3
"""
Usage: script_name jobs url1 url2 [wdir [last_block [first_block]]]
Example: script_name 4 path_to_url path_to_url ./ 5000000 0
set jobs to 0 if you want use all processors
if last_block == 0, it is read from url1 (as reference)
"""
import sys
import json
import os
import shutil
from jsonsocket import JSONSocket
from jsonsocket import steemd_call
from concurrent.futures import ThreadPoolExecutor
from concurrent.futures import ProcessPoolExecutor
from concurrent.futures import Future
from concurrent.futures import wait
from pathlib import Path
wdir = Path()
errors = 0
def main():
if len(sys.argv) < 4 or len(sys.argv) > 7:
print("Usage: script_name jobs url1 url2 [wdir [last_block [first_block]]]")
print(" Example: script_name 4 path_to_url path_to_url ./ 5000000 0")
print( " set jobs to 0 if you want use all processors" )
print(" if last_block == 0, it is read from url1 (as reference)")
exit()
global wdir
global errors
first_block = 0
last_block = 0
jobs = int(sys.argv[1])
if jobs <= 0:
import multiprocessing
jobs = multiprocessing.cpu_count()
url1 = sys.argv[2]
url2 = sys.argv[3]
if len(sys.argv) > 4:
wdir = Path(sys.argv[4])
if len(sys.argv) > 5:
last_block = int(sys.argv[5])
else:
last_block = 0
if len(sys.argv) == 7:
first_block = int(sys.argv[6])
else:
first_block = 0
last_block1 = get_last_block(url1)
last_block2 = get_last_block(url2)
if last_block1 != last_block2:
exit("last block of {} ({}) is different then last block of {} ({})".format(url1, last_block1, url2, last_block2))
if last_block == 0:
last_block = last_block1
elif last_block != last_block1:
print("WARNING: last block from cmdline {} is different then from {} ({})".format(last_block, url1, last_block1))
if last_block == 0:
exit("last block cannot be 0!")
create_wdir()
blocks = last_block - first_block + 1
if jobs > blocks:
jobs = blocks
print("setup:")
print(" jobs: {}".format(jobs))
print(" url1: {}".format(url1))
print(" url2: {}".format(url2))
print(" wdir: {}".format(wdir))
print(" block range: {}:{}".format(first_block, last_block))
if jobs > 1:
blocks_per_job = blocks // jobs
with ProcessPoolExecutor(max_workers=jobs) as executor:
for i in range(jobs-1):
executor.submit(compare_results, first_block, (first_block + blocks_per_job - 1), url1, url2)
first_block = first_block + blocks_per_job
executor.submit(compare_results, first_block, last_block, url1, url2)
else:
compare_results(first_block, last_block, url1, url2)
exit( errors )
def create_wdir():
global wdir
if wdir.exists():
if wdir.is_file():
os.remove(wdir)
if wdir.exists() == False:
wdir.mkdir(parents=True)
def get_last_block(url, max_tries=10, timeout=0.1):
request = bytes( json.dumps( {
"jsonrpc": "2.0",
"id": 0,
"method": "database_api.get_dynamic_global_properties",
"params": {}
} ), "utf-8" ) + b"\r\n"
status, response = steemd_call(url, data=request, max_tries=max_tries, timeout=timeout)
if status == False:
return 0
try:
return response["result"]["head_block_number"]
except:
return 0
def compare_results(f_block, l_block, url1, url2, max_tries=10, timeout=0.1):
global wdir
global errors
print( "Compare blocks [{} : {}]".format(f_block, l_block) )
for i in range(f_block, l_block+1):
request = bytes( json.dumps( {
"jsonrpc": "2.0",
"id": i,
"method": "account_history_api.get_ops_in_block",
"params": { "block_num": i, "only_virtual": False }
} ), "utf-8" ) + b"\r\n"
with ThreadPoolExecutor(max_workers=2) as executor:
#with ProcessPoolExecutor(max_workers=2) as executor:
future1 = executor.submit(steemd_call, url1, data=request, max_tries=max_tries, timeout=timeout)
future2 = executor.submit(steemd_call, url2, data=request, max_tries=max_tries, timeout=timeout)
status1, json1 = future1.result()
status2, json2 = future2.result()
#status1, json1 = steemd_call(url1, data=request, max_tries=max_tries, timeout=timeout)
#status2, json2 = steemd_call(url2, data=request, max_tries=max_tries, timeout=timeout)
if status1 == False or status2 == False or json1 != json2:
print("Difference @block: {}\n".format(i))
errors += 1
filename = wdir / Path(str(f_block) + "_" + str(l_block) + ".log")
try: file = filename.open( "w" )
except: print( "Cannot open file:", filename ); return
file.write("Difference @block: {}\n".format(i))
file.write("{} response:\n".format(url1))
json.dump(json1, file, indent=2, sort_keys=True)
file.write("\n")
file.write("{} response:\n".format(url2))
json.dump(json2, file, indent=2, sort_keys=True)
file.write("\n")
file.close()
print( "Compare blocks [{} : {}] break with error".format(f_block, l_block) )
return
print( "Compare blocks [{} : {}] finished".format(f_block, l_block) )
if __name__ == "__main__":
main()
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.