content
stringlengths 4
1.04M
| lang
stringclasses 358
values | score
int64 0
5
| repo_name
stringlengths 5
114
| repo_path
stringlengths 4
229
| repo_licenses
listlengths 1
8
|
|---|---|---|---|---|---|
/******************************************************************************
* Copyright 2018 The Apollo Authors. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*****************************************************************************/
#include "modules/canbus/vehicle/lexus/protocol/vin_rpt_414.h"
#include "glog/logging.h"
#include "modules/drivers/canbus/common/byte.h"
#include "modules/drivers/canbus/common/canbus_consts.h"
namespace apollo {
namespace canbus {
namespace lexus {
using ::apollo::drivers::canbus::Byte;
Vinrpt414::Vinrpt414() {}
const int32_t Vinrpt414::ID = 0x414;
void Vinrpt414::Parse(const std::uint8_t* bytes, int32_t length,
ChassisDetail* chassis) const {
chassis->mutable_lexus()->mutable_vin_rpt_414()->set_veh_serial(
veh_serial(bytes, length));
chassis->mutable_lexus()->mutable_vin_rpt_414()->set_veh_my_code(
veh_my_code(bytes, length));
chassis->mutable_lexus()->mutable_vin_rpt_414()->set_veh_mfg_code(
veh_mfg_code(bytes, length));
}
// config detail: {'name': 'veh_serial', 'offset': 0.0, 'precision': 1.0, 'len':
// 24, 'is_signed_var': False, 'physical_range': '[0|0]', 'bit': 39, 'type':
// 'int', 'order': 'motorola', 'physical_unit': ''}
int Vinrpt414::veh_serial(const std::uint8_t* bytes, int32_t length) const {
Byte t0(bytes + 4);
int32_t x = t0.get_byte(0, 8);
Byte t1(bytes + 5);
int32_t t = t1.get_byte(0, 8);
x <<= 8;
x |= t;
Byte t2(bytes + 6);
t = t2.get_byte(0, 8);
x <<= 8;
x |= t;
int ret = x;
return ret;
}
// config detail: {'name': 'veh_my_code', 'offset': 0.0, 'precision': 1.0,
// 'len': 8, 'is_signed_var': False, 'physical_range': '[0|0]', 'bit': 31,
// 'type': 'int', 'order': 'motorola', 'physical_unit': ''}
int Vinrpt414::veh_my_code(const std::uint8_t* bytes, int32_t length) const {
Byte t0(bytes + 3);
int32_t x = t0.get_byte(0, 8);
int ret = x;
return ret;
}
// config detail: {'name': 'veh_mfg_code', 'offset': 0.0, 'precision': 1.0,
// 'len': 24, 'is_signed_var': False, 'physical_range': '[0|0]', 'bit': 7,
// 'type': 'int', 'order': 'motorola', 'physical_unit': ''}
int Vinrpt414::veh_mfg_code(const std::uint8_t* bytes, int32_t length) const {
Byte t0(bytes + 0);
int32_t x = t0.get_byte(0, 8);
Byte t1(bytes + 1);
int32_t t = t1.get_byte(0, 8);
x <<= 8;
x |= t;
Byte t2(bytes + 2);
t = t2.get_byte(0, 8);
x <<= 8;
x |= t;
int ret = x;
return ret;
}
} // namespace lexus
} // namespace canbus
} // namespace apollo
| C++ | 4 | seeclong/apollo | modules/canbus/vehicle/lexus/protocol/vin_rpt_414.cc | [
"Apache-2.0"
]
|
/*
Warnings relating to configuration defines located in this XC source file rather than the devicedefines.h header file in order to avoid multiple warnings being issued when the devicedefines.h header file is included in multiple files.
*/
#include "customdefines.h"
#include "customdefines.h"
#ifndef DEFAULT_FREQ
#warning DEFAULT_FREQ not defined. Using MIN_FREQ
#endif
#ifndef MIN_FREQ
#warning MIN_FREQ not defined. Using 44100
#endif
#ifndef MAX_FREQ
#warning MAX_FREQ not defined. Using 192000
#endif
#ifndef SPDIF_TX_INDEX
#warning SPDIF_TX_INDEX not defined! Using 0
#endif
#ifndef VENDOR_STR
#warning VENDOR_STR not defined. Using "XMOS"
#endif
#ifndef VENDOR_ID
#warning VENDOR_ID not defined. Using XMOS vendor ID (0x20B1)
#endif
#ifndef PRODUCT_STR_A2
#warning PRODUCT_STR_A2 not defined. Using default XMOS string
#endif
#ifndef PRODUCT_STR_A1
#warning PRODUCT_STR_A1 not defined. Using default XMOS string
#endif
#ifndef BCD_DEVICE
#warning BCD_DEVICE not defined. Using XMOS release version number
#endif
#if (AUDIO_CLASS==1) || defined(AUDIO_CLASS_FALLBACK)
#ifndef PID_AUDIO_1
#warning PID_AUDIO_1 not defined. Using 0x0003
#endif
#endif
#ifndef PID_AUDIO_2
#warning PID_AUDIO_2 not defined. Using 0x0002
#endif
#ifndef AUDIO_CLASS
#warning AUDIO_CLASS not defined, using 2
#endif
#ifndef AUDIO_CLASS_FALLBACK
#warning AUDIO_CLASS_FALLBACK not defined, using 0 (i.e. disabled)
#endif
/* Sanity check on FS channel counts */
#if (NUM_USB_CHAN_OUT_FS > NUM_USB_CHAN_OUT)
#error NUM_USB_CHAN_OUT expected to be less than or equal to NUM_USB_CHAN_OUT
#endif
#if (NUM_USB_CHAN_IN_FS > NUM_USB_CHAN_IN)
#error NUM_USB_CHAN_IN expected to be less than or equal to NUM_USB_CHAN_IN
#endif
| XC | 4 | simongapp/xmos_usb_mems_interface | 01Firmware/PDM_USB/PDM_USB/src/warnings.xc | [
"Unlicense"
]
|
using Uno;
using Uno.Testing;
using FuseTest;
namespace Fuse.Controls.Test
{
public class BringToFrontTest : TestBase
{
[Test]
public void ToFront()
{
var p = new UX.BringToFront.Basic();
using (var root = TestRootPanel.CreateWithChild(p))
{
Assert.AreEqual( "C,B,A", GetDudZ(p));
p.bFront.Pulse();
root.PumpDeferred();
Assert.AreEqual( "C,A,B", GetDudZ(p));
p.cFront.Pulse();
root.PumpDeferred();
Assert.AreEqual( "A,B,C", GetDudZ(p));
}
}
[Test]
public void ToBack()
{
var p = new UX.BringToFront.BackBasic();
using (var root = TestRootPanel.CreateWithChild(p))
{
Assert.AreEqual( "C,B,A", GetDudZ(p));
p.bBack.Pulse();
root.PumpDeferred();
Assert.AreEqual( "B,C,A", GetDudZ(p));
p.aBack.Pulse();
root.PumpDeferred();
Assert.AreEqual( "A,B,C", GetDudZ(p));
}
}
}
}
| Uno | 3 | helilabs/fuselibs | Source/Fuse.Controls/Tests/BringToFront.Test.uno | [
"MIT"
]
|
<template>
<div>
<h4>
_slug: <i data-date-slug>
{{ date }}
</i>
</h4>
</div>
</template>
<script>
export default {
watchParam: false,
asyncData () {
return {
date: Date.now()
}
}
}
</script>
| Vue | 4 | ardyno/nuxt.js | test/fixtures/children/pages/patch/_id/reuse/_slug.vue | [
"MIT"
]
|
# Copyright 1999-2018 Gentoo Foundation
# Distributed under the terms of the GNU General Public License v2
# @ECLASS: ruby-single.eclass
# @MAINTAINER:
# Ruby team <[email protected]>
# @AUTHOR:
# Author: Hans de Graaff <[email protected]>
# Based on python-single-r1 by: Michał Górny <[email protected]>
# @SUPPORTED_EAPIS: 4 5 6 7
# @BLURB: An eclass for Ruby packages not installed for multiple implementations.
# @DESCRIPTION:
# An eclass for packages which don't support being installed for
# multiple Ruby implementations. This mostly includes ruby-based
# scripts. Set USE_RUBY to include all the ruby targets that have been
# verified to work and include the eclass. RUBY_DEPS is now available to
# pull in the dependency on the requested ruby targets.
#
# @CODE
# USE_RUBY="ruby20 ruby21"
# inherit ruby-single
# RDEPEND="${RUBY_DEPS}"
# @CODE
case "${EAPI:-0}" in
0|1|2|3)
die "Unsupported EAPI=${EAPI:-0} (too old) for ${ECLASS}"
;;
4|5|6|7)
;;
*)
die "Unsupported EAPI=${EAPI} (unknown) for ${ECLASS}"
;;
esac
if [[ ! ${_RUBY_SINGLE} ]]; then
inherit ruby-utils
# @ECLASS-VARIABLE: USE_RUBY
# @DEFAULT_UNSET
# @REQUIRED
# @DESCRIPTION:
# This variable contains a space separated list of targets (see above) a package
# is compatible to. It must be set before the `inherit' call. There is no
# default. All ebuilds are expected to set this variable.
# @ECLASS-VARIABLE: RUBY_DEPS
# @DEFAULT_UNSET
# @DESCRIPTION:
#
# This is an eclass-generated Ruby dependency string for all
# implementations listed in USE_RUBY. Any one of the supported ruby
# targets will satisfy this dependency. A dependency on
# virtual/rubygems is also added to ensure that this is installed
# in time for the package to use it.
#
# Example use:
# @CODE
# RDEPEND="${RUBY_DEPS}
# dev-foo/mydep"
# BDEPEND="${RDEPEND}"
# @CODE
#
# Example value:
# @CODE
# || ( dev-lang/ruby:2.0 dev-lang/ruby:1.9 ) virtual/rubygems
# @CODE
#
# The order of dependencies will change over time to best match the
# current state of ruby targets, e.g. stable version first.
_ruby_single_implementations_depend() {
local depend
for _ruby_implementation in ${RUBY_TARGETS_PREFERENCE}; do
if [[ ${USE_RUBY} =~ ${_ruby_implementation} ]]; then
depend="${depend} $(_ruby_implementation_depend $_ruby_implementation)"
fi
done
echo "|| ( ${depend} ) virtual/rubygems"
}
_ruby_single_set_globals() {
RUBY_DEPS=$(_ruby_single_implementations_depend)
}
_ruby_single_set_globals
_RUBY_SINGLE=1
fi
| Gentoo Eclass | 5 | NighttimeDriver50000/Sabayon-Packages | local_overlay/eclass/ruby-single.eclass | [
"MIT"
]
|
import { withRouter } from 'next/router'
function useWithRouter(props) {
return <div>I use withRouter</div>
}
// we add getServerSideProps to prevent static optimization
// to allow us to compare server-side changes
export const getServerSideProps = () => {
return {
props: {},
}
}
export default withRouter(useWithRouter)
| JavaScript | 4 | blomqma/next.js | test/.stats-app/pages/withRouter.js | [
"MIT"
]
|
--TEST--
SPL: SplDoublyLinkedList : offsetUnset - first element
--CREDITS--
PHPNW TestFest2009 - Rowan Merewood <[email protected]>
--FILE--
<?php
$list = new SplDoublyLinkedList();
$list->push('oh');
$list->push('hai');
$list->push('thar');
echo $list->bottom() . "\n";
$list->offsetUnset(0);
echo $list->bottom() . "\n";
?>
--EXPECT--
oh
hai
| PHP | 3 | guomoumou123/php5.5.10 | ext/spl/tests/SplDoublylinkedlist_offsetunset_first002.phpt | [
"PHP-3.01"
]
|
export const A = "A"; | JavaScript | 1 | 1shenxi/webpack | test/configCases/dll-plugin/0-create-dll/ha.js | [
"MIT"
]
|
version date files npm v8 uv zlib openssl modules lts security
v17.2.0 2021-11-30 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 8.1.4 9.6.180.14 1.42.0 1.2.11 3.0.0+quic 102 - -
v17.1.0 2021-11-09 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 8.1.2 9.5.172.25 1.42.0 1.2.11 3.0.0+quic 102 - -
v17.0.1 2021-10-20 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 8.1.0 9.5.172.21 1.42.0 1.2.11 3.0.0+quic 102 - -
v17.0.0 2021-10-19 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 8.1.0 9.5.172.21 1.42.0 1.2.11 3.0.0+quic 102 - -
v16.13.1 2021-12-01 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 8.1.2 9.4.146.24 1.42.0 1.2.11 1.1.1l+quic 93 Gallium -
v16.13.0 2021-10-26 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 8.1.0 9.4.146.19 1.42.0 1.2.11 1.1.1l+quic 93 Gallium -
v16.12.0 2021-10-20 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 8.1.0 9.4.146.19 1.42.0 1.2.11 1.1.1l+quic 93 - -
v16.11.1 2021-10-12 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 8.0.0 9.4.146.19 1.42.0 1.2.11 1.1.1l+quic 93 - true
v16.11.0 2021-10-08 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 8.0.0 9.4.146.19 1.42.0 1.2.11 1.1.1l+quic 93 - -
v16.10.0 2021-09-22 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.24.0 9.3.345.19 1.42.0 1.2.11 1.1.1l+quic 93 - -
v16.9.1 2021-09-10 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.21.1 9.3.345.16 1.42.0 1.2.11 1.1.1l+quic 93 - -
v16.9.0 2021-09-07 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.21.1 9.3.345.16 1.42.0 1.2.11 1.1.1l+quic 93 - -
v16.8.0 2021-08-25 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.21.0 9.2.230.21 1.42.0 1.2.11 1.1.1k+quic 93 - -
v16.7.0 2021-08-18 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.20.3 9.2.230.21 1.42.0 1.2.11 1.1.1k+quic 93 - -
v16.6.2 2021-08-11 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.20.3 9.2.230.21 1.41.0 1.2.11 1.1.1k+quic 93 - true
v16.6.1 2021-08-03 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.20.3 9.2.230.21 1.41.0 1.2.11 1.1.1k+quic 93 - -
v16.6.0 2021-07-29 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.19.1 9.2.230.21 1.41.0 1.2.11 1.1.1k+quic 93 - true
v16.5.0 2021-07-14 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.19.1 9.1.269.38 1.41.0 1.2.11 1.1.1k+quic 93 - -
v16.4.2 2021-07-05 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.18.1 9.1.269.36 1.41.0 1.2.11 1.1.1k+quic 93 - -
v16.4.1 2021-07-01 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.18.1 9.1.269.36 1.41.0 1.2.11 1.1.1k+quic 93 - true
v16.4.0 2021-06-23 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.18.1 9.1.269.36 1.41.0 1.2.11 1.1.1k+quic 93 - -
v16.3.0 2021-06-03 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.15.1 9.0.257.25 1.41.0 1.2.11 1.1.1k+quic 93 - -
v16.2.0 2021-05-19 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.13.0 9.0.257.25 1.41.0 1.2.11 1.1.1k+quic 93 - -
v16.1.0 2021-05-04 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.11.2 9.0.257.24 1.41.0 1.2.11 1.1.1k+quic 93 - -
v16.0.0 2021-04-20 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-arm64-tar,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.10.0 9.0.257.17 1.41.0 1.2.11 1.1.1k+quic 93 - -
v15.14.0 2021-04-06 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.7.6 8.6.395.17 1.41.0 1.2.11 1.1.1k+quic 88 - -
v15.13.0 2021-03-31 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.7.6 8.6.395.17 1.41.0 1.2.11 1.1.1j+quic 88 - -
v15.12.0 2021-03-17 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.6.3 8.6.395.17 1.41.0 1.2.11 1.1.1j+quic 88 - -
v15.11.0 2021-03-03 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.6.0 8.6.395.17 1.41.0 1.2.11 1.1.1j 88 - -
v15.10.0 2021-02-23 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.5.3 8.6.395.17 1.41.0 1.2.11 1.1.1j 88 - true
v15.9.0 2021-02-18 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.5.3 8.6.395.17 1.41.0 1.2.11 1.1.1i 88 - -
v15.8.0 2021-02-02 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.5.1 8.6.395.17 1.40.0 1.2.11 1.1.1i 88 - -
v15.7.0 2021-01-25 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.4.3 8.6.395.17 1.40.0 1.2.11 1.1.1i 88 - -
v15.6.0 2021-01-14 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.4.0 8.6.395.17 1.40.0 1.2.11 1.1.1i 88 - -
v15.5.1 2021-01-04 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.3.0 8.6.395.17 1.40.0 1.2.11 1.1.1i 88 - true
v15.5.0 2020-12-22 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.3.0 8.6.395.17 1.40.0 1.2.11 1.1.1i 88 - -
v15.4.0 2020-12-09 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.0.15 8.6.395.17 1.40.0 1.2.11 1.1.1g 88 - -
v15.3.0 2020-11-24 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.0.14 8.6.395.17 1.40.0 1.2.11 1.1.1g 88 - -
v15.2.1 2020-11-16 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.0.8 8.6.395.17 1.40.0 1.2.11 1.1.1g 88 - true
v15.2.0 2020-11-10 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.0.8 8.6.395.17 1.40.0 1.2.11 1.1.1g 88 - -
v15.1.0 2020-11-04 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.0.8 8.6.395.17 1.40.0 1.2.11 1.1.1g 88 - -
v15.0.1 2020-10-21 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.0.3 8.6.395.17 1.40.0 1.2.11 1.1.1g 88 - -
v15.0.0 2020-10-20 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 7.0.2 8.6.395.16 1.40.0 1.2.11 1.1.1g 88 - -
v14.18.2 2021-11-30 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.15 8.4.371.23 1.42.0 1.2.11 1.1.1l 83 Fermium -
v14.18.1 2021-10-12 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.15 8.4.371.23 1.42.0 1.2.11 1.1.1l 83 Fermium true
v14.18.0 2021-09-28 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.15 8.4.371.23 1.42.0 1.2.11 1.1.1l 83 Fermium -
v14.17.6 2021-08-30 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.15 8.4.371.23 1.41.0 1.2.11 1.1.1l 83 Fermium true
v14.17.5 2021-08-11 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.14 8.4.371.23 1.41.0 1.2.11 1.1.1k 83 Fermium true
v14.17.4 2021-07-29 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.14 8.4.371.23 1.41.0 1.2.11 1.1.1k 83 Fermium true
v14.17.3 2021-07-05 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.13 8.4.371.23 1.41.0 1.2.11 1.1.1k 83 Fermium true
v14.17.2 2021-07-01 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.13 8.4.371.23 1.41.0 1.2.11 1.1.1k 83 Fermium true
v14.17.1 2021-06-15 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.13 8.4.371.23 1.41.0 1.2.11 1.1.1k 83 Fermium -
v14.17.0 2021-05-11 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.13 8.4.371.23 1.41.0 1.2.11 1.1.1k 83 Fermium -
v14.16.1 2021-04-06 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.12 8.4.371.19 1.40.0 1.2.11 1.1.1k 83 Fermium true
v14.16.0 2021-02-23 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.11 8.4.371.19 1.40.0 1.2.11 1.1.1j 83 Fermium true
v14.15.5 2021-02-09 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.11 8.4.371.19 1.40.0 1.2.11 1.1.1i 83 Fermium -
v14.15.4 2021-01-04 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.10 8.4.371.19 1.40.0 1.2.11 1.1.1i 83 Fermium true
v14.15.3 2020-12-17 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.9 8.4.371.19 1.40.0 1.2.11 1.1.1g 83 Fermium -
v14.15.2 2020-12-15 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.9 8.4.371.19 1.40.0 1.2.11 1.1.1g 83 Fermium -
v14.15.1 2020-11-16 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.8 8.4.371.19 1.40.0 1.2.11 1.1.1g 83 Fermium true
v14.15.0 2020-10-27 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.8 8.4.371.19 1.40.0 1.2.11 1.1.1g 83 Fermium -
v14.14.0 2020-10-15 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.8 8.4.371.19 1.40.0 1.2.11 1.1.1g 83 - -
v14.13.1 2020-10-07 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.8 8.4.371.19 1.40.0 1.2.11 1.1.1g 83 - -
v14.13.0 2020-09-29 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.8 8.4.371.19 1.40.0 1.2.11 1.1.1g 83 - -
v14.12.0 2020-09-22 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.8 8.4.371.19 1.39.0 1.2.11 1.1.1g 83 - -
v14.11.0 2020-09-15 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.8 8.4.371.19 1.39.0 1.2.11 1.1.1g 83 - true
v14.10.1 2020-09-10 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.8 8.4.371.19 1.39.0 1.2.11 1.1.1g 83 - -
v14.10.0 2020-09-08 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.8 8.4.371.19 1.39.0 1.2.11 1.1.1g 83 - -
v14.9.0 2020-08-27 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.8 8.4.371.19 1.39.0 1.2.11 1.1.1g 83 - -
v14.8.0 2020-08-11 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.7 8.4.371.19 1.38.1 1.2.11 1.1.1g 83 - -
v14.7.0 2020-07-29 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.7 8.4.371.19 1.38.1 1.2.11 1.1.1g 83 - -
v14.6.0 2020-07-20 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.6 8.4.371.19 1.38.1 1.2.11 1.1.1g 83 - -
v14.5.0 2020-06-30 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.5 8.3.110.9 1.38.0 1.2.11 1.1.1g 83 - -
v14.4.0 2020-06-02 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.5 8.1.307.31 1.37.0 1.2.11 1.1.1g 83 - true
v14.3.0 2020-05-19 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.5 8.1.307.31 1.37.0 1.2.11 1.1.1g 83 - -
v14.2.0 2020-05-05 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.4 8.1.307.31 1.37.0 1.2.11 1.1.1g 83 - -
v14.1.0 2020-04-29 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.4 8.1.307.31 1.37.0 1.2.11 1.1.1g 83 - -
v14.0.0 2020-04-21 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.4 8.1.307.30 1.37.0 1.2.11 1.1.1f 83 - -
v13.14.0 2020-04-29 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.4 7.9.317.25 1.37.0 1.2.11 1.1.1g 79 - -
v13.13.0 2020-04-14 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.4 7.9.317.25 1.35.0 1.2.11 1.1.1f 79 - -
v13.12.0 2020-03-26 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.4 7.9.317.25 1.35.0 1.2.11 1.1.1e 79 - -
v13.11.0 2020-03-12 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.7 7.9.317.25 1.34.2 1.2.11 1.1.1d 79 - -
v13.10.1 2020-03-04 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.7 7.9.317.25 1.34.2 1.2.11 1.1.1d 79 - -
v13.10.0 2020-03-04 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.7 7.9.317.25 1.34.2 1.2.11 1.1.1d 79 - -
v13.9.0 2020-02-18 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.7 7.9.317.25 1.34.2 1.2.11 1.1.1d 79 - -
v13.8.0 2020-02-05 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.6 7.9.317.25 1.34.1 1.2.11 1.1.1d 79 - true
v13.7.0 2020-01-21 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.6 7.9.317.25 1.34.1 1.2.11 1.1.1d 79 - -
v13.6.0 2020-01-07 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.4 7.9.317.25 1.34.0 1.2.11 1.1.1d 79 - -
v13.5.0 2019-12-18 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.4 7.9.317.25 1.34.0 1.2.11 1.1.1d 79 - -
v13.4.0 2019-12-17 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.4 7.9.317.25 1.34.0 1.2.11 1.1.1d 79 - true
v13.3.0 2019-12-03 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.1 7.9.317.25 1.33.1 1.2.11 1.1.1d 79 - -
v13.2.0 2019-11-21 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.1 7.9.317.23 1.33.1 1.2.11 1.1.1d 79 - -
v13.1.0 2019-11-05 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.12.1 7.8.279.17 1.33.1 1.2.11 1.1.1d 79 - -
v13.0.1 2019-10-23 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.12.0 7.8.279.17 1.33.1 1.2.11 1.1.1d 79 - -
v13.0.0 2019-10-22 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.12.0 7.8.279.17 1.32.0 1.2.11 1.1.1d 79 - -
v12.22.8 2021-12-16 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.15 7.8.279.23 1.40.0 1.2.11 1.1.1m 72 Erbium -
v12.22.7 2021-10-12 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.15 7.8.279.23 1.40.0 1.2.11 1.1.1l 72 Erbium true
v12.22.6 2021-08-30 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.15 7.8.279.23 1.40.0 1.2.11 1.1.1l 72 Erbium true
v12.22.5 2021-08-11 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.14 7.8.279.23 1.40.0 1.2.11 1.1.1k 72 Erbium true
v12.22.4 2021-07-29 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.14 7.8.279.23 1.40.0 1.2.11 1.1.1k 72 Erbium true
v12.22.3 2021-07-05 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.13 7.8.279.23 1.40.0 1.2.11 1.1.1k 72 Erbium -
v12.22.2 2021-07-01 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.13 7.8.279.23 1.40.0 1.2.11 1.1.1k 72 Erbium true
v12.22.1 2021-04-06 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.12 7.8.279.23 1.40.0 1.2.11 1.1.1k 72 Erbium true
v12.22.0 2021-03-30 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.11 7.8.279.23 1.40.0 1.2.11 1.1.1j 72 Erbium -
v12.21.0 2021-02-23 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.11 7.8.279.23 1.40.0 1.2.11 1.1.1j 72 Erbium true
v12.20.2 2021-02-10 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.11 7.8.279.23 1.40.0 1.2.11 1.1.1i 72 Erbium -
v12.20.1 2021-01-04 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.10 7.8.279.23 1.40.0 1.2.11 1.1.1i 72 Erbium -
v12.20.0 2020-11-24 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.8 7.8.279.23 1.40.0 1.2.11 1.1.1g 72 Erbium -
v12.19.1 2020-11-16 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.8 7.8.279.23 1.39.0 1.2.11 1.1.1g 72 Erbium true
v12.19.0 2020-10-06 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.8 7.8.279.23 1.39.0 1.2.11 1.1.1g 72 Erbium -
v12.18.4 2020-09-15 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.6 7.8.279.23 1.38.0 1.2.11 1.1.1g 72 Erbium true
v12.18.3 2020-07-22 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.6 7.8.279.23 1.38.0 1.2.11 1.1.1g 72 Erbium -
v12.18.2 2020-06-30 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.5 7.8.279.23 1.38.0 1.2.11 1.1.1g 72 Erbium -
v12.18.1 2020-06-17 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.5 7.8.279.23 1.38.0 1.2.11 1.1.1g 72 Erbium -
v12.18.0 2020-06-02 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.4 7.8.279.23 1.37.0 1.2.11 1.1.1g 72 Erbium true
v12.17.0 2020-05-26 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.4 7.8.279.23 1.37.0 1.2.11 1.1.1g 72 Erbium -
v12.16.3 2020-04-28 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.4 7.8.279.23 1.34.2 1.2.11 1.1.1g 72 Erbium -
v12.16.2 2020-04-08 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.4 7.8.279.23 1.34.2 1.2.11 1.1.1e 72 Erbium -
v12.16.1 2020-02-18 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.4 7.8.279.23 1.34.0 1.2.11 1.1.1d 72 Erbium -
v12.16.0 2020-02-11 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.4 7.8.279.23 1.34.0 1.2.11 1.1.1d 72 Erbium -
v12.15.0 2020-02-05 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.4 7.7.299.13 1.33.1 1.2.11 1.1.1d 72 Erbium true
v12.14.1 2020-01-07 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.4 7.7.299.13 1.33.1 1.2.11 1.1.1d 72 Erbium -
v12.14.0 2019-12-17 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.4 7.7.299.13 1.33.1 1.2.11 1.1.1d 72 Erbium true
v12.13.1 2019-11-19 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.12.1 7.7.299.13 1.33.1 1.2.11 1.1.1d 72 Erbium -
v12.13.0 2019-10-21 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.12.0 7.7.299.13 1.32.0 1.2.11 1.1.1d 72 Erbium -
v12.12.0 2019-10-11 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.11.3 7.7.299.13 1.32.0 1.2.11 1.1.1d 72 - -
v12.11.1 2019-10-01 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.11.3 7.7.299.11 1.32.0 1.2.11 1.1.1c 72 - -
v12.11.0 2019-09-25 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.11.3 7.7.299.11 1.32.0 1.2.11 1.1.1c 72 - -
v12.10.0 2019-09-04 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.10.3 7.6.303.29 1.31.0 1.2.11 1.1.1c 72 - -
v12.9.1 2019-08-26 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.10.2 7.6.303.29 1.31.0 1.2.11 1.1.1c 72 - -
v12.9.0 2019-08-20 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.10.2 7.6.303.29 1.31.0 1.2.11 1.1.1c 72 - -
v12.8.1 2019-08-15 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.10.2 7.5.288.22 1.30.1 1.2.11 1.1.1c 72 - true
v12.8.0 2019-08-06 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.10.2 7.5.288.22 1.30.1 1.2.11 1.1.1c 72 - -
v12.7.0 2019-07-23 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.10.0 7.5.288.22 1.30.1 1.2.11 1.1.1c 72 - -
v12.6.0 2019-07-03 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.9.0 7.5.288.22 1.30.1 1.2.11 1.1.1c 72 - -
v12.5.0 2019-06-26 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.9.0 7.5.288.22 1.29.1 1.2.11 1.1.1c 72 - -
v12.4.0 2019-06-04 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.9.0 7.4.288.27 1.29.1 1.2.11 1.1.1b 72 - -
v12.3.1 2019-05-22 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.9.0 7.4.288.27 1.29.1 1.2.11 1.1.1b 72 - -
v12.3.0 2019-05-21 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.9.0 7.4.288.27 1.28.0 1.2.11 1.1.1b 72 - -
v12.2.0 2019-05-07 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.9.0 7.4.288.21 1.28.0 1.2.11 1.1.1b 72 - -
v12.1.0 2019-04-29 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.9.0 7.4.288.21 1.28.0 1.2.11 1.1.1b 72 - -
v12.0.0 2019-04-23 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.9.0 7.4.288.21 1.28.0 1.2.11 1.1.1b 72 - -
v11.15.0 2019-04-30 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.7.0 7.0.276.38 1.27.0 1.2.11 1.1.1b 67 - -
v11.14.0 2019-04-10 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.7.0 7.0.276.38 1.27.0 1.2.11 1.1.1b 67 - -
v11.13.0 2019-03-28 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.7.0 7.0.276.38 1.27.0 1.2.11 1.1.1b 67 - -
v11.12.0 2019-03-14 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.7.0 7.0.276.38 1.26.0 1.2.11 1.1.1b 67 - -
v11.11.0 2019-03-05 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.7.0 7.0.276.38 1.26.0 1.2.11 1.1.1a 67 - -
v11.10.1 2019-02-28 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.7.0 7.0.276.38 1.26.0 1.2.11 1.1.1a 67 - true
v11.10.0 2019-02-14 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.7.0 7.0.276.38 1.26.0 1.2.11 1.1.1a 67 - -
v11.9.0 2019-01-30 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.5.0 7.0.276.38 1.25.0 1.2.11 1.1.1a 67 - -
v11.8.0 2019-01-24 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.5.0 7.0.276.38 1.25.0 1.2.11 1.1.0j 67 - -
v11.7.0 2019-01-17 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.5.0 7.0.276.38 1.24.1 1.2.11 1.1.0j 67 - -
v11.6.0 2018-12-26 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.5.0-next.0 7.0.276.38 1.24.1 1.2.11 1.1.0j 67 - -
v11.5.0 2018-12-18 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 7.0.276.38 1.24.0 1.2.11 1.1.0j 67 - -
v11.4.0 2018-12-07 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 7.0.276.38 1.24.0 1.2.11 1.1.0j 67 - -
v11.3.0 2018-11-27 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 7.0.276.38 1.23.2 1.2.11 1.1.0j 67 - true
v11.2.0 2018-11-15 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 7.0.276.38 1.23.2 1.2.11 1.1.0i 67 - -
v11.1.0 2018-10-30 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 7.0.276.32 1.23.2 1.2.11 1.1.0i 67 - -
v11.0.0 2018-10-23 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 7.0.276.28 1.23.2 1.2.11 1.1.0i 67 - -
v10.24.1 2021-04-06 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.12 6.8.275.32 1.34.2 1.2.11 1.1.1k 64 Dubnium true
v10.24.0 2021-02-23 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.11 6.8.275.32 1.34.2 1.2.11 1.1.1j 64 Dubnium true
v10.23.3 2021-02-09 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.11 6.8.275.32 1.34.2 1.2.11 1.1.1i 64 Dubnium -
v10.23.2 2021-01-26 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.10 6.8.275.32 1.34.2 1.2.11 1.1.1i 64 Dubnium -
v10.23.1 2021-01-04 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.10 6.8.275.32 1.34.2 1.2.11 1.1.1i 64 Dubnium -
v10.23.0 2020-10-27 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.8 6.8.275.32 1.34.2 1.2.11 1.1.1g 64 Dubnium -
v10.22.1 2020-09-15 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.6 6.8.275.32 1.34.2 1.2.11 1.1.1g 64 Dubnium true
v10.22.0 2020-07-21 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.6 6.8.275.32 1.34.2 1.2.11 1.1.1g 64 Dubnium -
v10.21.0 2020-06-02 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.4 6.8.275.32 1.34.2 1.2.11 1.1.1e 64 Dubnium true
v10.20.1 2020-04-12 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.4 6.8.275.32 1.34.2 1.2.11 1.1.1e 64 Dubnium -
v10.20.0 2020-03-26 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.14.4 6.8.275.32 1.34.2 1.2.11 1.1.1e 64 Dubnium -
v10.19.0 2020-02-05 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.4 6.8.275.32 1.28.0 1.2.11 1.1.1d 64 Dubnium true
v10.18.1 2020-01-09 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.4 6.8.275.32 1.28.0 1.2.11 1.1.1d 64 Dubnium -
v10.18.0 2019-12-17 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.4 6.8.275.32 1.28.0 1.2.11 1.1.1d 64 Dubnium true
v10.17.0 2019-10-22 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.11.3 6.8.275.32 1.28.0 1.2.11 1.1.1d 64 Dubnium -
v10.16.3 2019-08-15 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.9.0 6.8.275.32 1.28.0 1.2.11 1.1.1c 64 Dubnium true
v10.16.2 2019-08-06 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.9.0 6.8.275.32 1.28.0 1.2.11 1.1.1c 64 Dubnium -
v10.16.1 2019-07-31 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.9.0 6.8.275.32 1.28.0 1.2.11 1.1.1c 64 Dubnium -
v10.16.0 2019-05-28 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.9.0 6.8.275.32 1.28.0 1.2.11 1.1.1b 64 Dubnium -
v10.15.3 2019-03-05 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.8.275.32 1.23.2 1.2.11 1.1.0j 64 Dubnium -
v10.15.2 2019-02-28 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.8.275.32 1.23.2 1.2.11 1.1.0j 64 Dubnium true
v10.15.1 2019-01-29 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.8.275.32 1.23.2 1.2.11 1.1.0j 64 Dubnium -
v10.15.0 2018-12-26 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.8.275.32 1.23.2 1.2.11 1.1.0j 64 Dubnium -
v10.14.2 2018-12-10 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.8.275.32 1.23.2 1.2.11 1.1.0j 64 Dubnium -
v10.14.1 2018-11-29 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.8.275.32 1.23.2 1.2.11 1.1.0j 64 Dubnium -
v10.14.0 2018-11-27 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.8.275.32 1.23.2 1.2.11 1.1.0j 64 Dubnium true
v10.13.0 2018-10-30 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.8.275.32 1.23.2 1.2.11 1.1.0i 64 Dubnium -
v10.12.0 2018-10-10 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.8.275.32 1.23.2 1.2.11 1.1.0i 64 - -
v10.11.0 2018-09-19 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.8.275.32 1.23.0 1.2.11 1.1.0i 64 - -
v10.10.0 2018-09-06 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.8.275.30 1.23.0 1.2.11 1.1.0i 64 - -
v10.9.0 2018-08-15 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.2.0 6.8.275.24 1.22.0 1.2.11 1.1.0i 64 - -
v10.8.0 2018-08-01 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.2.0 6.7.288.49 1.22.0 1.2.11 1.1.0h 64 - -
v10.7.0 2018-07-18 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.1.0 6.7.288.49 1.22.0 1.2.11 1.1.0h 64 - -
v10.6.0 2018-07-04 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.1.0 6.7.288.46 1.21.0 1.2.11 1.1.0h 64 - -
v10.5.0 2018-06-20 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.1.0 6.7.288.46 1.20.3 1.2.11 1.1.0h 64 - -
v10.4.1 2018-06-12 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.1.0 6.7.288.45 1.20.3 1.2.11 1.1.0h 64 - -
v10.4.0 2018-06-06 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.1.0 6.7.288.43 1.20.3 1.2.11 1.1.0h 64 - -
v10.3.0 2018-05-29 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.1.0 6.6.346.32 1.20.3 1.2.11 1.1.0h 64 - -
v10.2.1 2018-05-24 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.6.346.32 1.20.3 1.2.11 1.1.0h 64 - -
v10.2.0 2018-05-23 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.6.346.32 1.20.3 1.2.11 1.1.0h 64 - -
v10.1.0 2018-05-08 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.6.346.27 1.20.2 1.2.11 1.1.0h 64 - -
v10.0.0 2018-04-24 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,osx-x64-pkg,osx-x64-tar,src,sunos-x64,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.6.346.24 1.20.2 1.2.11 1.1.0h 64 - -
v9.11.2 2018-06-12 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.46 1.19.2 1.2.11 1.0.2o 59 - -
v9.11.1 2018-04-05 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.46 1.19.2 1.2.11 1.0.2o 59 - -
v9.11.0 2018-04-04 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.46 1.19.2 1.2.11 1.0.2o 59 - -
v9.10.1 2018-03-29 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.46 1.19.2 1.2.11 1.0.2o 59 - -
v9.10.0 2018-03-28 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.46 1.19.2 1.2.11 1.0.2o 59 - true
v9.9.0 2018-03-21 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.46 1.19.2 1.2.11 1.0.2n 59 - -
v9.8.0 2018-03-07 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.46 1.19.2 1.2.11 1.0.2n 59 - -
v9.7.1 2018-03-02 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.46 1.19.2 1.2.11 1.0.2n 59 - -
v9.7.0 2018-03-01 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.46 1.19.2 1.2.11 1.0.2n 59 - -
v9.6.1 2018-02-23 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.46 1.19.1 1.2.11 1.0.2n 59 - -
v9.6.0 2018-02-21 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.46 1.19.1 1.2.11 1.0.2n 59 - -
v9.5.0 2018-01-31 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.46 1.19.1 1.2.11 1.0.2n 59 - -
v9.4.0 2018-01-10 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.46 1.18.0 1.2.11 1.0.2n 59 - -
v9.3.0 2017-12-12 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.5.1 6.2.414.46 1.18.0 1.2.11 1.0.2n 59 - -
v9.2.1 2017-12-08 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.5.1 6.2.414.44 1.16.1 1.2.11 1.0.2n 59 - -
v9.2.0 2017-11-14 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.5.1 6.2.414.44 1.16.1 1.2.11 1.0.2m 59 - -
v9.1.0 2017-11-07 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.5.1 6.2.414.32 1.15.0 1.2.11 1.0.2m 59 - -
v9.0.0 2017-10-31 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.5.1 6.2.414.32 1.15.0 1.2.11 1.0.2l 59 - -
v8.17.0 2019-12-17 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.13.4 6.2.414.78 1.23.2 1.2.11 1.0.2s 57 Carbon true
v8.16.2 2019-10-09 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.2.414.78 1.23.2 1.2.11 1.0.2s 57 Carbon -
v8.16.1 2019-08-15 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.2.414.77 1.23.2 1.2.11 1.0.2r 57 Carbon true
v8.16.0 2019-04-16 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.2.414.77 1.23.2 1.2.11 1.0.2r 57 Carbon -
v8.15.1 2019-02-28 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.2.414.75 1.23.2 1.2.11 1.0.2r 57 Carbon true
v8.15.0 2018-12-26 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.2.414.75 1.23.2 1.2.11 1.0.2q 57 Carbon -
v8.14.1 2018-12-18 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.2.414.75 1.23.2 1.2.11 1.0.2q 57 Carbon -
v8.14.0 2018-11-27 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.2.414.72 1.23.2 1.2.11 1.0.2q 57 Carbon true
v8.13.0 2018-11-20 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.2.414.72 1.23.2 1.2.11 1.0.2p 57 Carbon -
v8.12.0 2018-09-10 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 6.4.1 6.2.414.66 1.19.2 1.2.11 1.0.2p 57 Carbon -
v8.11.4 2018-08-15 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.54 1.19.1 1.2.11 1.0.2p 57 Carbon true
v8.11.3 2018-06-12 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.54 1.19.1 1.2.11 1.0.2o 57 Carbon -
v8.11.2 2018-05-15 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.54 1.19.1 1.2.11 1.0.2o 57 Carbon -
v8.11.1 2018-03-29 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.50 1.19.1 1.2.11 1.0.2o 57 Carbon -
v8.11.0 2018-03-28 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.50 1.19.1 1.2.11 1.0.2o 57 Carbon true
v8.10.0 2018-03-06 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.2.414.50 1.19.1 1.2.11 1.0.2n 57 Carbon -
v8.9.4 2018-01-02 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.6.0 6.1.534.50 1.15.0 1.2.11 1.0.2n 57 Carbon -
v8.9.3 2017-12-07 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.5.1 6.1.534.48 1.15.0 1.2.11 1.0.2n 57 Carbon true
v8.9.2 2017-12-05 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.5.1 6.1.534.48 1.15.0 1.2.11 1.0.2m 57 Carbon -
v8.9.1 2017-11-07 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.5.1 6.1.534.47 1.15.0 1.2.11 1.0.2m 57 Carbon -
v8.9.0 2017-10-31 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.5.1 6.1.534.46 1.15.0 1.2.11 1.0.2l 57 Carbon -
v8.8.1 2017-10-25 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.4.2 6.1.534.42 1.15.0 1.2.11 1.0.2l 57 - -
v8.8.0 2017-10-24 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.4.2 6.1.534.42 1.15.0 1.2.11 1.0.2l 57 - -
v8.7.0 2017-10-11 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.4.2 6.1.534.42 1.15.0 1.2.11 1.0.2l 57 - -
v8.6.0 2017-09-26 aix-ppc64,headers,linux-arm64,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.3.0 6.0.287.53 1.14.1 1.2.11 1.0.2l 57 - -
v8.5.0 2017-09-12 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.3.0 6.0.287.53 1.14.1 1.2.11 1.0.2l 57 - -
v8.4.0 2017-08-15 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.3.0 6.0.286.52 1.13.1 1.2.11 1.0.2l 57 - -
v8.3.0 2017-08-08 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.3.0 6.0.286.52 1.13.1 1.2.11 1.0.2l 57 - -
v8.2.1 2017-07-20 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.3.0 5.8.283.41 1.13.1 1.2.11 1.0.2l 57 - -
v8.2.0 2017-07-19 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.3.0 5.8.283.41 1.13.1 1.2.11 1.0.2l 57 - -
v8.1.4 2017-07-11 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.0.3 5.8.283.41 1.12.0 1.2.11 1.0.2l 57 - true
v8.1.3 2017-06-29 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.0.3 5.8.283.41 1.12.0 1.2.11 1.0.2l 57 - -
v8.1.2 2017-06-15 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.0.3 5.8.283.41 1.12.0 1.2.11 1.0.2l 57 - -
v8.1.1 2017-06-13 aix-ppc64,headers,linux-arm64,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.0.3 5.8.283.41 1.12.0 1.2.11 1.0.2l 57 - -
v8.1.0 2017-06-08 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.0.3 5.8.283.41 1.12.0 1.2.11 1.0.2l 57 - -
v8.0.0 2017-05-30 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 5.0.0 5.8.283.41 1.11.0 1.2.11 1.0.2k 57 - -
v7.10.1 2017-07-11 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 4.2.0 5.5.372.43 1.11.0 1.2.11 1.0.2k 51 - true
v7.10.0 2017-05-02 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 4.2.0 5.5.372.43 1.11.0 1.2.11 1.0.2k 51 - -
v7.9.0 2017-04-11 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 4.2.0 5.5.372.43 1.11.0 1.2.11 1.0.2k 51 - -
v7.8.0 2017-03-29 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 4.2.0 5.5.372.43 1.11.0 1.2.11 1.0.2k 51 - -
v7.7.4 2017-03-21 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 4.1.2 5.5.372.42 1.11.0 1.2.11 1.0.2k 51 - -
v7.7.3 2017-03-14 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 4.1.2 5.5.372.41 1.11.0 1.2.11 1.0.2k 51 - -
v7.7.2 2017-03-08 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 4.1.2 5.5.372.41 1.11.0 1.2.11 1.0.2k 51 - -
v7.7.1 2017-03-02 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 4.1.2 5.5.372.41 1.11.0 1.2.11 1.0.2k 51 - -
v7.7.0 2017-02-28 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 4.1.2 5.5.372.41 1.11.0 1.2.11 1.0.2k 51 - -
v7.6.0 2017-02-21 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 4.1.2 5.5.372.40 1.11.0 1.2.11 1.0.2k 51 - -
v7.5.0 2017-01-31 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 4.1.2 5.4.500.48 1.10.2 1.2.8 1.0.2k 51 - -
v7.4.0 2017-01-04 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 4.0.5 5.4.500.45 1.10.1 1.2.8 1.0.2j 51 - -
v7.3.0 2016-12-20 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.4.500.45 1.10.1 1.2.8 1.0.2j 51 - -
v7.2.1 2016-12-06 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.4.500.44 1.10.1 1.2.8 1.0.2j 51 - -
v7.2.0 2016-11-22 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.9 5.4.500.43 1.10.1 1.2.8 1.0.2j 51 - -
v7.1.0 2016-11-08 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.9 5.4.500.36 1.10.0 1.2.8 1.0.2j 51 - -
v7.0.0 2016-10-25 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.8 5.4.500.36 1.9.1 1.2.8 1.0.2j 51 - -
v6.17.1 2019-04-03 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.111 1.16.1 1.2.11 1.0.2r 48 Boron -
v6.17.0 2019-02-28 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.111 1.16.1 1.2.11 1.0.2r 48 Boron true
v6.16.0 2018-12-26 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.111 1.16.1 1.2.11 1.0.2q 48 Boron -
v6.15.1 2018-12-03 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.111 1.16.1 1.2.11 1.0.2q 48 Boron -
v6.15.0 2018-11-27 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.111 1.16.1 1.2.11 1.0.2q 48 Boron true
v6.14.4 2018-08-15 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.111 1.16.1 1.2.11 1.0.2p 48 Boron true
v6.14.3 2018-06-12 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.111 1.16.1 1.2.11 1.0.2o 48 Boron -
v6.14.2 2018-04-30 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.111 1.16.1 1.2.11 1.0.2o 48 Boron -
v6.14.1 2018-03-29 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.111 1.16.1 1.2.11 1.0.2o 48 Boron -
v6.14.0 2018-03-28 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.111 1.16.1 1.2.11 1.0.2o 48 Boron true
v6.13.1 2018-03-06 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.111 1.16.1 1.2.11 1.0.2n 48 Boron -
v6.13.0 2018-02-10 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.111 1.16.1 1.2.11 1.0.2n 48 Boron -
v6.12.3 2018-01-02 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.111 1.15.0 1.2.11 1.0.2n 48 Boron -
v6.12.2 2017-12-07 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.109 1.15.0 1.2.11 1.0.2n 48 Boron true
v6.12.1 2017-12-05 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.109 1.15.0 1.2.11 1.0.2m 48 Boron -
v6.12.0 2017-11-06 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.108 1.15.0 1.2.11 1.0.2m 48 Boron -
v6.11.5 2017-10-24 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.108 1.11.0 1.2.11 1.0.2l 48 Boron true
v6.11.4 2017-10-03 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.108 1.11.0 1.2.11 1.0.2l 48 Boron -
v6.11.3 2017-09-05 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.107 1.11.0 1.2.11 1.0.2l 48 Boron -
v6.11.2 2017-08-01 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.103 1.11.0 1.2.11 1.0.2l 48 Boron -
v6.11.1 2017-07-10 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.103 1.11.0 1.2.11 1.0.2k 48 Boron true
v6.11.0 2017-06-06 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.102 1.11.0 1.2.11 1.0.2k 48 Boron -
v6.10.3 2017-05-02 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.101 1.9.1 1.2.11 1.0.2k 48 Boron -
v6.10.2 2017-04-04 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.98 1.9.1 1.2.11 1.0.2k 48 Boron -
v6.10.1 2017-03-21 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.95 1.9.1 1.2.8 1.0.2k 48 Boron -
v6.10.0 2017-02-21 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.93 1.9.1 1.2.8 1.0.2k 48 Boron -
v6.9.5 2017-01-31 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.89 1.9.1 1.2.8 1.0.2k 48 Boron -
v6.9.4 2017-01-05 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.89 1.9.1 1.2.8 1.0.2j 48 Boron -
v6.9.3 2017-01-05 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.10 5.1.281.89 1.9.1 1.2.8 1.0.2j 48 Boron -
v6.9.2 2016-12-06 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.9 5.1.281.88 1.9.1 1.2.8 1.0.2j 48 Boron -
v6.9.1 2016-10-19 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.8 5.1.281.84 1.9.1 1.2.8 1.0.2j 48 Boron -
v6.9.0 2016-10-18 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.8 5.1.281.84 1.9.1 1.2.8 1.0.2j 48 Boron -
v6.8.1 2016-10-14 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.8 5.1.281.84 1.9.1 1.2.8 1.0.2j 48 - -
v6.8.0 2016-10-12 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.8 5.1.281.84 1.9.1 1.2.8 1.0.2j 48 - -
v6.7.0 2016-09-27 aix-ppc64,headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.3 5.1.281.83 1.9.1 1.2.8 1.0.2j 48 - true
v6.6.0 2016-09-14 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-s390x,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.3 5.1.281.83 1.9.1 1.2.8 1.0.2h 48 - -
v6.5.0 2016-08-26 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.3 5.1.281.81 1.9.1 1.2.8 1.0.2h 48 - -
v6.4.0 2016-08-12 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.3 5.0.71.60 1.9.1 1.2.8 1.0.2h 48 - -
v6.3.1 2016-07-21 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.3 5.0.71.57 1.9.1 1.2.8 1.0.2h 48 - -
v6.3.0 2016-07-06 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.10.3 5.0.71.52 1.9.1 1.2.8 1.0.2h 48 - -
v6.2.2 2016-06-16 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.9.5 5.0.71.52 1.9.1 1.2.8 1.0.2h 48 - -
v6.2.1 2016-06-02 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 3.9.3 5.0.71.52 1.9.1 1.2.8 1.0.2h 48 - -
v6.2.0 2016-05-17 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.8.9 5.0.71.47 1.9.1 1.2.8 1.0.2h 48 - -
v6.1.0 2016-05-05 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.8.6 5.0.71.35 1.9.0 1.2.8 1.0.2h 48 - -
v6.0.0 2016-04-26 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.8.6 5.0.71.35 1.9.0 1.2.8 1.0.2g 48 - -
v5.12.0 2016-06-23 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.8.6 4.6.85.32 1.8.0 1.2.8 1.0.2h 47 - -
v5.11.1 2016-05-05 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.8.6 4.6.85.31 1.8.0 1.2.8 1.0.2h 47 - -
v5.11.0 2016-04-21 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.8.6 4.6.85.31 1.8.0 1.2.8 1.0.2g 47 - -
v5.10.1 2016-04-05 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.8.3 4.6.85.31 1.8.0 1.2.8 1.0.2g 47 - -
v5.10.0 2016-04-01 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.8.3 4.6.85.31 1.8.0 1.2.8 1.0.2g 47 - -
v5.9.1 2016-03-22 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.7.3 4.6.85.31 1.8.0 1.2.8 1.0.2g 47 - -
v5.9.0 2016-03-16 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.7.3 4.6.85.31 1.8.0 1.2.8 1.0.2g 47 - -
v5.8.0 2016-03-09 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.7.3 4.6.85.31 1.8.0 1.2.8 1.0.2g 47 - -
v5.7.1 2016-03-02 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.6.0 4.6.85.31 1.8.0 1.2.8 1.0.2g 47 - -
v5.7.0 2016-02-23 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.6.0 4.6.85.31 1.8.0 1.2.8 1.0.2f 47 - -
v5.6.0 2016-02-09 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.6.0 4.6.85.31 1.8.0 1.2.8 1.0.2f 47 - -
v5.5.0 2016-01-21 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.3.12 4.6.85.31 1.8.0 1.2.8 1.0.2e 47 - -
v5.4.1 2016-01-12 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.3.12 4.6.85.31 1.8.0 1.2.8 1.0.2e 47 - -
v5.4.0 2016-01-06 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.3.12 4.6.85.31 1.8.0 1.2.8 1.0.2e 47 - -
v5.3.0 2015-12-15 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.3.12 4.6.85.31 1.8.0 1.2.8 1.0.2e 47 - -
v5.2.0 2015-12-09 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.3.12 4.6.85.31 1.7.5 1.2.8 1.0.2e 47 - -
v5.1.1 2015-12-03 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.3.12 4.6.85.31 1.7.5 1.2.8 1.0.2e 47 - -
v5.1.0 2015-11-17 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.3.12 4.6.85.31 1.7.5 1.2.8 1.0.2d 47 - -
v5.0.0 2015-10-29 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 3.3.6 4.6.85.28 1.7.5 1.2.8 1.0.2d 47 - -
v4.9.1 2018-03-29 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.11 4.5.103.53 1.9.1 1.2.11 1.0.2o 46 Argon -
v4.9.0 2018-03-28 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.11 4.5.103.53 1.9.1 1.2.11 1.0.2o 46 Argon true
v4.8.7 2017-12-07 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.11 4.5.103.53 1.9.1 1.2.11 1.0.2n 46 Argon true
v4.8.6 2017-11-06 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.11 4.5.103.53 1.9.1 1.2.11 1.0.2m 46 Argon -
v4.8.5 2017-10-24 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.11 4.5.103.47 1.9.1 1.2.11 1.0.2k 46 Argon true
v4.8.4 2017-07-11 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.11 4.5.103.47 1.9.1 1.2.11 1.0.2k 46 Argon true
v4.8.3 2017-05-02 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.11 4.5.103.47 1.9.1 1.2.11 1.0.2k 46 Argon -
v4.8.2 2017-04-04 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.11 4.5.103.46 1.9.1 1.2.11 1.0.2k 46 Argon -
v4.8.1 2017-03-21 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.11 4.5.103.46 1.9.1 1.2.8 1.0.2k 46 Argon -
v4.8.0 2017-02-21 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.11 4.5.103.45 1.9.1 1.2.8 1.0.2k 46 Argon -
v4.7.3 2017-01-31 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.11 4.5.103.43 1.9.1 1.2.8 1.0.2k 46 Argon -
v4.7.2 2017-01-05 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.11 4.5.103.43 1.9.1 1.2.8 1.0.2j 46 Argon -
v4.7.1 2017-01-05 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.11 4.5.103.43 1.9.1 1.2.8 1.0.2j 46 Argon -
v4.7.0 2016-12-06 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.11 4.5.103.43 1.9.1 1.2.8 1.0.2j 46 Argon -
v4.6.2 2016-11-08 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.11 4.5.103.42 1.9.1 1.2.8 1.0.2j 46 Argon -
v4.6.1 2016-10-18 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.9 4.5.103.37 1.9.1 1.2.8 1.0.2j 46 Argon true
v4.6.0 2016-09-27 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.9 4.5.103.37 1.9.1 1.2.8 1.0.2j 46 Argon true
v4.5.0 2016-08-16 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-7z,win-x64-exe,win-x64-msi,win-x64-zip,win-x86-7z,win-x86-exe,win-x86-msi,win-x86-zip 2.15.9 4.5.103.37 1.9.1 1.2.8 1.0.2h 46 Argon -
v4.4.7 2016-06-28 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.15.8 4.5.103.36 1.8.0 1.2.8 1.0.2h 46 Argon -
v4.4.6 2016-06-23 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.15.5 4.5.103.36 1.8.0 1.2.8 1.0.2h 46 Argon -
v4.4.5 2016-05-24 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.15.5 4.5.103.35 1.8.0 1.2.8 1.0.2h 46 Argon -
v4.4.4 2016-05-05 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.15.1 4.5.103.35 1.8.0 1.2.8 1.0.2h 46 Argon -
v4.4.3 2016-04-12 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.15.1 4.5.103.35 1.8.0 1.2.8 1.0.2g 46 Argon -
v4.4.2 2016-04-01 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.15.0 4.5.103.35 1.8.0 1.2.8 1.0.2g 46 Argon -
v4.4.1 2016-03-22 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.20 4.5.103.35 1.8.0 1.2.8 1.0.2g 46 Argon -
v4.4.0 2016-03-08 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.20 4.5.103.35 1.8.0 1.2.8 1.0.2g 46 Argon -
v4.3.2 2016-03-02 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-ppc64le,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.12 4.5.103.35 1.8.0 1.2.8 1.0.2g 46 Argon -
v4.3.1 2016-02-16 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.12 4.5.103.35 1.8.0 1.2.8 1.0.2f 46 Argon -
v4.3.0 2016-02-09 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.12 4.5.103.35 1.8.0 1.2.8 1.0.2f 46 Argon -
v4.2.6 2016-01-21 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.12 4.5.103.35 1.8.0 1.2.8 1.0.2e 46 Argon -
v4.2.5 2016-01-20 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.12 4.5.103.35 1.8.0 1.2.8 1.0.2e 46 Argon -
v4.2.4 2015-12-23 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.12 4.5.103.35 1.7.5 1.2.8 1.0.2e 46 Argon -
v4.2.3 2015-12-03 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.7 4.5.103.35 1.7.5 1.2.8 1.0.2e 46 Argon -
v4.2.2 2015-11-03 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.7 4.5.103.35 1.7.5 1.2.8 1.0.2d 46 Argon -
v4.2.1 2015-10-13 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.7 4.5.103.35 1.7.5 1.2.8 1.0.2d 46 Argon -
v4.2.0 2015-10-12 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.7 4.5.103.35 1.7.5 1.2.8 1.0.2d 46 Argon -
v4.1.2 2015-10-05 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.4 4.5.103.35 1.7.5 1.2.8 1.0.2d 46 - -
v4.1.1 2015-09-23 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.4 4.5.103.33 1.7.4 1.2.8 1.0.2d 46 - -
v4.1.0 2015-09-17 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.3 4.5.103.33 1.7.4 1.2.8 1.0.2d 46 - -
v4.0.0 2015-09-08 headers,linux-arm64,linux-armv6l,linux-armv7l,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 2.14.2 4.5.103.30 1.7.3 1.2.8 1.0.2d 46 - -
v0.12.18 2017-02-22 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.15.11 3.28.71.20 1.6.1 1.2.8 1.0.1u 14 - -
v0.12.17 2016-10-18 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.15.1 3.28.71.19 1.6.1 1.2.8 1.0.1u 14 - true
v0.12.16 2016-09-27 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.15.1 3.28.71.19 1.6.1 1.2.8 1.0.1u 14 - true
v0.12.15 2016-06-23 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.15.1 3.28.71.19 1.6.1 1.2.8 1.0.1t 14 - true
v0.12.14 2016-05-06 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.15.1 3.28.71.19 1.6.1 1.2.8 1.0.1t 14 - -
v0.12.13 2016-03-31 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.15.0 3.28.71.19 1.6.1 1.2.8 1.0.1s 14 - -
v0.12.12 2016-03-08 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.14.9 3.28.71.19 1.6.1 1.2.8 1.0.1s 14 - -
v0.12.11 2016-03-03 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.14.9 3.28.71.19 1.6.1 1.2.8 1.0.1s 14 - -
v0.12.10 2016-02-09 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.14.9 3.28.71.19 1.6.1 1.2.8 1.0.1r 14 - -
v0.12.9 2015-12-03 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.14.9 3.28.71.19 1.6.1 1.2.8 1.0.1q 14 - -
v0.12.8 2015-11-24 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.14.9 3.28.71.19 1.6.1 1.2.8 1.0.1p 14 - -
v0.12.7 2015-07-09 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.11.3 3.28.71.19 1.6.1 1.2.8 1.0.1p 14 - -
v0.12.6 2015-07-04 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.11.2 3.28.71.19 1.6.1 1.2.8 1.0.1o 14 - -
v0.12.5 2015-06-22 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.11.2 3.28.71.19 1.6.1 1.2.8 1.0.1o 14 - -
v0.12.4 2015-05-23 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.10.1 3.28.71.19 1.5.0 1.2.8 1.0.1m 14 - -
v0.12.3 2015-05-14 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.9.1 3.28.71.19 1.5.0 1.2.8 1.0.1m 14 - -
v0.12.2 2015-03-31 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.7.4 3.28.73.0 1.4.2 1.2.8 1.0.1m 14 - -
v0.12.1 2015-03-24 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.5.1 3.28.73.0 1.0.2 1.2.8 1.0.1m 14 - -
v0.12.0 2015-02-06 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.5.1 3.28.73.0 1.0.2 1.2.8 1.0.1l 14 - -
v0.11.16 2015-01-30 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.3.0 3.28.73.0 1.0.2 1.2.8 1.0.1l 14 - -
v0.11.15 2015-01-20 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.1.6 3.28.73.0 1.0.2 1.2.8 1.0.1j 14 - -
v0.11.14 2014-08-19 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.0.0 3.26.33.0 1.0.0 1.2.3 1.0.1i 14 - -
v0.11.13 2014-05-02 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.9 3.25.30.0 0.11.25 1.2.3 1.0.1g 14 - -
v0.11.12 2014-03-11 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.3 3.22.24.19 0.11.22 1.2.3 1.0.1f 14 - -
v0.11.11 2014-01-29 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.25 3.22.24.19 0.11.18 1.2.3 1.0.1f 14 - -
v0.11.10 2013-12-31 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.22 3.22.24.10 0.11.17 1.2.3 1.0.1e 13 - -
v0.11.9 2013-11-21 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.15 3.22.24.5 0.11.15 1.2.3 1.0.1e 13 - -
v0.11.8 2013-10-30 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.13 3.21.18.3 0.11.14 1.2.3 1.0.1e 13 - -
v0.11.7 2013-09-04 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.8 3.20.17.0 0.11.13 1.2.3 1.0.1e 0x000C - -
v0.11.6 2013-08-21 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x86-msi 1.3.8 3.20.14.1 0.11.8 1.2.3 1.0.1e 0x000C - -
v0.11.5 2013-08-07 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.6 3.20.11.0 0.11.7 1.2.3 1.0.1e 0x000C - -
v0.11.4 2013-07-12 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x86-msi 1.3.4 3.20.2.0 0.11.5 1.2.3 1.0.1e 0x000C - -
v0.11.3 2013-06-26 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.25 3.19.13.0 0.11.5 1.2.3 1.0.1e 0x000C - -
v0.11.2 2013-05-13 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.21 3.19.0.0 0.11.2 1.2.3 1.0.1e 0x000C - -
v0.11.1 2013-04-19 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.18 3.18.0.0 0.11.1 1.2.3 1.0.1e 0x000C - -
v0.11.0 2013-03-28 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.15 3.17.13.0 0.10.3 1.2.3 1.0.1e 0x000C - -
v0.10.48 2016-10-18 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.15.1 3.14.5.11 0.10.37 1.2.8 1.0.1u 11 - true
v0.10.47 2016-09-27 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.15.1 3.14.5.11 0.10.37 1.2.8 1.0.1u 11 - true
v0.10.46 2016-06-23 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.15.1 3.14.5.9 0.10.37 1.2.8 1.0.1t 11 - true
v0.10.45 2016-05-06 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.15.1 3.14.5.9 0.10.36 1.2.8 1.0.1t 11 - -
v0.10.44 2016-03-31 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 2.15.0 3.14.5.9 0.10.36 1.2.8 1.0.1s 11 - -
v0.10.43 2016-03-03 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.29 3.14.5.9 0.10.36 1.2.8 1.0.1s 11 - -
v0.10.42 2016-02-09 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.29 3.14.5.9 0.10.36 1.2.8 1.0.1r 11 - -
v0.10.41 2015-12-03 headers,linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.29 3.14.5.9 0.10.36 1.2.8 1.0.1q 11 - -
v0.10.40 2015-07-09 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.28 3.14.5.9 0.10.36 1.2.8 1.0.1p 11 - -
v0.10.39 2015-06-19 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.28 3.14.5.9 0.10.36 1.2.8 1.0.1o 11 - -
v0.10.38 2015-03-23 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.28 3.14.5.9 0.10.36 1.2.8 1.0.1m 11 - -
v0.10.37 2015-03-11 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.28 3.14.5.9 0.10.36 1.2.8 1.0.1l 11 - -
v0.10.36 2015-01-26 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.28 3.14.5.9 0.10.30 1.2.8 1.0.1l 11 - -
v0.10.35 2014-12-22 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.28 3.14.5.9 0.10.30 1.2.8 1.0.1j 11 - -
v0.10.34 2014-12-17 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.28 3.14.5.9 0.10.30 1.2.8 1.0.1j 11 - -
v0.10.33 2014-10-21 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.28 3.14.5.9 0.10.29 1.2.3 1.0.1j 11 - -
v0.10.32 2014-09-16 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.28 3.14.5.9 0.10.28 1.2.3 1.0.1i 11 - -
v0.10.31 2014-08-19 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.23 3.14.5.9 0.10.28 1.2.3 1.0.1i 11 - -
v0.10.30 2014-07-31 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.21 3.14.5.9 0.10.28 1.2.3 1.0.1h 11 - -
v0.10.29 2014-06-09 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.14 3.14.5.9 0.10.27 1.2.3 1.0.1h 11 - -
v0.10.28 2014-05-02 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.9 3.14.5.9 0.10.27 1.2.3 1.0.1g 11 - -
v0.10.27 2014-05-01 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.8 3.14.5.9 0.10.27 1.2.3 1.0.1g 11 - -
v0.10.26 2014-02-18 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.4.3 3.14.5.9 0.10.25 1.2.3 1.0.1e 11 - -
v0.10.25 2014-01-23 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.24 3.14.5.9 0.10.23 1.2.3 1.0.1e 11 - -
v0.10.24 2013-12-19 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.21 3.14.5.9 0.10.21 1.2.3 1.0.1e 11 - -
v0.10.23 2013-12-12 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.17 3.14.5.9 0.10.20 1.2.3 1.0.1e 11 - -
v0.10.22 2013-11-12 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.14 3.14.5.9 0.10.19 1.2.3 1.0.1e 11 - -
v0.10.21 2013-10-18 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.11 3.14.5.9 0.10.18 1.2.3 1.0.1e 11 - -
v0.10.20 2013-09-30 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.11 3.14.5.9 0.10.17 1.2.3 1.0.1e 11 - -
v0.10.19 2013-09-24 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.11 3.14.5.9 0.10.17 1.2.3 1.0.1e 11 - -
v0.10.18 2013-09-04 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.8 3.14.5.9 0.10.15 1.2.3 1.0.1e 11 - -
v0.10.17 2013-08-21 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.8 3.14.5.9 0.10.14 1.2.3 1.0.1e 11 - -
v0.10.16 2013-08-16 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.8 3.14.5.9 0.10.13 1.2.3 1.0.1e 11 - -
v0.10.15 2013-07-25 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.5 3.14.5.9 0.10.13 1.2.3 1.0.1e 11 - -
v0.10.14 2013-07-25 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.5 3.14.5.9 0.10.13 1.2.3 1.0.1e 11 - -
v0.10.13 2013-07-09 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.3.2 3.14.5.9 0.10.12 1.2.3 1.0.1e 11 - -
v0.10.12 2013-06-18 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.32 3.14.5.9 0.10.11 1.2.3 1.0.1e 11 - -
v0.10.11 2013-06-13 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.30 3.14.5.9 0.10.11 1.2.3 1.0.1e 11 - -
v0.10.10 2013-06-04 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.25 3.14.5.9 0.10.10 1.2.3 1.0.1e 11 - -
v0.10.9 2013-05-30 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.24 3.14.5.9 0.10.9 1.2.3 1.0.1e 11 - -
v0.10.8 2013-05-24 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.23 3.14.5.9 0.10.8 1.2.3 1.0.1e 11 - -
v0.10.7 2013-05-17 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.21 3.14.5.8 0.10.7 1.2.3 1.0.1e 11 - -
v0.10.6 2013-05-14 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.18 3.14.5.8 0.10.5 1.2.3 1.0.1e 11 - -
v0.10.5 2013-04-23 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.18 3.14.5.8 0.10.5 1.2.3 1.0.1e 11 - -
v0.10.4 2013-04-11 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.18 3.14.5.8 0.10.4 1.2.3 1.0.1e 11 - -
v0.10.3 2013-04-03 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.17 3.14.5.8 0.10.3 1.2.3 1.0.1e 0x000B - -
v0.10.2 2013-03-28 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.15 3.14.5.8 0.10.3 1.2.3 1.0.1e 0x000B - -
v0.10.1 2013-03-21 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.15 3.14.5.8 0.10 1.2.3 1.0.1e 0x000B - -
v0.10.0 2013-03-11 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.14 3.14.5.8 0.9 1.2.3 1.0.1e 0x000B - -
v0.9.12 2013-03-06 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.12 3.14.5.8 0.9 1.2.3 1.0.1e 0x000B - -
v0.9.11 2013-03-01 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.12 3.14.5.0 0.9 1.2.3 1.0.1e 0x000B - -
v0.9.10 2013-02-19 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.12 3.15.11.15 0.9 1.2.3 1.0.1c 0x000B - -
v0.9.9 2013-02-07 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.10 3.15.11.10 0.9 1.2.3 1.0.1c 0x000B - -
v0.9.8 2013-01-24 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.3 3.15.11.10 0.9 1.2.3 1.0.1c 0x000A - -
v0.9.7 2013-01-18 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.2 3.15.11.7 0.9 1.2.3 1.0.1c 0x000A - -
v0.9.6 2013-01-11 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.0 3.15.11.5 0.9 1.2.3 1.0.1c 0x000A - -
v0.9.5 2012-12-30 linux-x64,linux-x86,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.1.70 3.13.7.4 0.9 1.2.3 1.0.1c 0x000A - -
v0.9.4 2012-12-21 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.1.70 3.13.7.4 0.9 1.2.3 1.0.1c 0x000A - -
v0.9.3 2012-10-24 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.1.64 3.13.7.4 0.9 1.2.3 1.0.1c 0x000A - -
v0.9.2 2012-09-17 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.1.61 3.11.10.22 0.9 1.2.3 1.0.1c 0x000A - -
v0.9.1 2012-08-28 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.1.59 3.11.10.19 0.9 1.2.3 1.0.0f 0x000A - -
v0.9.0 2012-07-20 osx-x64-pkg,src,win-x64-exe,win-x86-exe,win-x86-msi 1.1.44 3.11.10.15 0.9 1.2.3 1.0.0f 1 - -
v0.8.28 2014-07-31 linux-x64,linux-x86,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.30 3.11.10.26 0.8 1.2.3 1.0.0f 1 - -
v0.8.27 2014-06-09 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x86-msi 1.2.30 3.11.10.26 0.8 1.2.3 1.0.0f 1 - -
v0.8.26 2013-10-18 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.30 3.11.10.26 0.8 1.2.3 1.0.0f 1 - -
v0.8.25 2013-06-13 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.30 3.11.10.25 0.8 1.2.3 1.0.0f 1 - -
v0.8.24 2013-06-03 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.24 3.11.10.25 0.8 1.2.3 1.0.0f 1 - -
v0.8.23 2013-04-09 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.18 3.11.10.25 0.8 1.2.3 1.0.0f 1 - -
v0.8.22 2013-03-06 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.14 3.11.10.25 0.8 1.2.3 1.0.0f 1 - -
v0.8.21 2013-02-25 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.11 3.11.10.25 0.8 1.2.3 1.0.0f 1 - -
v0.8.20 2013-02-15 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.11 3.11.10.25 0.8 1.2.3 1.0.0f 1 - -
v0.8.19 2013-02-06 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.10 3.11.10.25 0.8 1.2.3 1.0.0f 1 - -
v0.8.18 2013-01-18 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.2 3.11.10.25 0.8 1.2.3 1.0.0f 1 - -
v0.8.17 2013-01-10 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.2.0 3.11.10.25 0.8 1.2.3 1.0.0f 1 - -
v0.8.16 2012-12-12 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.1.69 3.11.10.25 0.8 1.2.3 1.0.0f 1 - -
v0.8.15 2012-11-26 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.1.66 3.11.10.25 0.8 1.2.3 1.0.0f 1 - -
v0.8.14 2012-10-25 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.1.65 3.11.10.25 0.8 1.2.3 1.0.0f 1 - -
v0.8.13 2012-10-25 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.1.65 3.11.10.25 0.8 1.2.3 1.0.0f 1 - -
v0.8.12 2012-10-11 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.1.63 3.11.10.22 0.8 1.2.3 1.0.0f 1 - -
v0.8.11 2012-09-27 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.1.62 3.11.10.22 0.8 1.2.3 1.0.0f 1 - -
v0.8.10 2012-09-25 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.1.62 3.11.10.22 0.8 1.2.3 1.0.0f 1 - -
v0.8.9 2012-09-11 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.1.61 3.11.10.22 0.8 1.2.3 1.0.0f 1 - -
v0.8.8 2012-08-22 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 1.1.59 3.11.10.19 0.8 1.2.3 1.0.0f 1 - -
v0.8.7 2012-08-15 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.1.49 3.11.10.17 0.8 1.2.3 1.0.0f 1 - -
v0.8.6 2012-08-06 linux-x64,linux-x86,osx-x64-pkg,osx-x64-tar,osx-x86-tar,src,sunos-x64,sunos-x86,win-x64-exe,win-x86-exe,win-x86-msi 1.1.48 3.11.10.17 0.8 1.2.3 1.0.0f 1 - -
v0.8.5 2012-08-02 osx-x64-pkg,src,win-x64-exe,win-x86-exe,win-x86-msi 1.1.46 3.11.10.17 0.8 1.2.3 1.0.0f 1 - -
v0.8.4 2012-07-24 osx-x64-pkg,src,win-x64-exe,win-x86-exe,win-x86-msi 1.1.45 3.11.10.17 0.8 1.2.3 1.0.0f 1 - -
v0.8.3 2012-07-17 osx-x64-pkg,src,win-x64-exe,win-x86-exe,win-x86-msi 1.1.43 3.11.10.15 0.8 1.2.3 1.0.0f 1 - -
v0.8.2 2012-07-09 osx-x64-pkg,src,win-x64-exe,win-x86-exe,win-x86-msi 1.1.36 3.11.10.14 0.8 1.2.3 1.0.0f 1 - -
v0.8.1 2012-06-29 osx-x64-pkg,src,win-x64-exe,win-x86-exe,win-x86-msi 1.1.33 3.11.10.12 0.8 1.2.3 1.0.0f 1 - -
v0.8.0 2012-06-22 osx-x64-pkg,src,win-x64-exe,win-x86-exe,win-x86-msi 1.1.32 3.11.10.10 0.8 1.2.3 1.0.0f 1 - -
v0.7.12 2012-06-19 osx-x64-pkg,src,win-x64-exe,win-x86-exe,win-x86-msi 1.1.30 3.11.10.0 0.6 1.2.3 1.0.0f 1 - -
v0.7.11 2012-06-15 osx-x64-pkg,src,win-x64-exe,win-x64-msi,win-x86-exe,win-x86-msi 1.1.26 3.11.10.0 0.6 1.2.3 1.0.0f 1 - -
v0.7.10 2012-06-11 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.25 3.9.24.31 0.6 1.2.3 1.0.0f 1 - -
v0.7.9 2012-05-29 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.23 3.11.1.0 0.6 1.2.3 1.0.0f 1 - -
v0.7.8 2012-04-18 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.18 3.9.24.9 0.6 1.2.3 1.0.0f 1 - -
v0.7.7 2012-03-30 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.15 3.9.24.7 0.6 1.2.3 0.9.8r 1 - -
v0.7.6 2012-03-13 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.8 3.9.17.0 0.6 1.2.3 0.9.8r 1 - -
v0.7.5 2012-02-23 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.1 3.9.5.0 0.6 1.2.3 0.9.8r 1 - -
v0.7.4 2012-02-14 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.1 3.9.5.0 0.6 1.2.3 0.9.8r 1 - -
v0.7.3 2012-02-07 osx-x64-pkg,src,win-x86-exe 1.1.0-3 3.9.2.0 0.6 1.2.3 0.9.8r 1 - -
v0.7.2 2012-02-01 osx-x64-pkg,src,win-x86-exe 1.1.0-3 3.8.9.0 0.6 1.2.3 0.9.8r 1 - -
v0.7.1 2012-01-23 osx-x64-pkg,src,win-x86-exe 1.1.0-2 3.8.8.0 0.6 1.2.3 0.9.8r 1 - -
v0.7.0 2012-01-17 osx-x64-pkg,src,win-x86-exe 1.1.0-2 3.8.6.0 0.6 1.2.3 0.9.8r 1 - -
v0.6.21 2012-08-03 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.37 3.6.6.25 0.6 1.2.3 0.9.8r 1 - -
v0.6.20 2012-07-10 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.37 3.6.6.25 0.6 1.2.3 0.9.8r 1 - -
v0.6.19 2012-06-06 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.24 3.6.6.25 0.6 1.2.3 0.9.8r 1 - -
v0.6.18 2012-05-14 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.21 3.6.6.25 0.6 1.2.3 0.9.8r 1 - -
v0.6.17 2012-05-04 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.21 3.6.6.25 0.6 1.2.3 0.9.8r 1 - -
v0.6.16 2012-04-27 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.19 3.6.6.25 0.6 1.2.3 0.9.8r 1 - -
v0.6.15 2012-04-08 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.16 3.6.6.24 0.6 1.2.3 0.9.8r 1 - -
v0.6.14 2012-03-23 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.12 3.6.6.24 0.6 1.2.3 0.9.8r 1 - -
v0.6.13 2012-03-15 osx-x64-pkg,src,win-x64-exe,win-x86-exe 1.1.9 3.6.6.24 0.6 1.2.3 0.9.8r 1 - -
v0.6.12 2012-03-02 osx-x64-pkg,src,win-x86-exe 1.1.4 3.6.6.24 0.6 1.2.3 0.9.8r 1 - -
v0.6.11 2012-02-08 osx-x64-pkg,src,win-x86-exe 1.1.1 3.6.6.20 0.6 1.2.3 0.9.8r 1 - -
v0.6.10 2012-02-03 osx-x64-pkg,src,win-x86-exe 1.1.0-3 3.6.6.20 0.6 1.2.3 0.9.8r 1 - -
v0.6.9 2012-01-27 osx-x64-pkg,src,win-x86-exe 1.1.0-3 3.6.6.19 0.6 1.2.3 0.9.8r 1 - -
v0.6.8 2012-01-20 osx-x64-pkg,src,win-x86-exe 1.1.0-2 3.6.6.19 0.6 1.2.3 0.9.8r 1 - -
v0.6.7 2012-01-07 osx-x64-pkg,src,win-x86-exe 1.1.0-beta-10 3.6.6.15 0.6 1.2.3 0.9.8r 1 - -
v0.6.6 2011-12-15 osx-x64-pkg,src,win-x86-exe 1.1.0-beta-4 3.6.6.14 0.6 1.2.3 0.9.8r 1 - -
v0.6.5 2011-12-04 osx-x64-pkg,src,win-x86-exe 1.1.0-alpha-6 3.6.6.11 0.6 1.2.3 0.9.8r 1 - -
v0.6.4 2011-12-02 osx-x64-pkg,src,win-x86-exe 1.1.0-alpha-6 3.6.6.8 0.6 1.2.3 0.9.8r 1 - -
v0.6.3 2011-11-25 osx-x64-pkg,src,win-x86-exe 1.1.0-alpha-2 3.6.6.8 0.6 1.2.3 0.9.8r 1 - -
v0.6.2 2011-11-18 osx-x64-pkg,src,win-x86-exe - 3.6.6.8 0.6 1.2.3 0.9.8r 1 - -
v0.6.1 2011-11-11 osx-x64-pkg,src,win-x86-exe - 3.6.6.7 0.1 1.2.3 0.9.8r 1 - -
v0.6.0 2011-11-04 src,win-x86-exe - 3.6.6.6 0.1 1.2.3 0.9.8r 1 - -
v0.5.10 2011-10-22 src,win-x86-exe - 3.7.0.0 0.1 1.2.3 0.9.8r 1 - -
v0.5.9 2011-10-11 src,win-x86-exe - 3.6.4.0 0.1 1.2.3 0.9.8r 1 - -
v0.5.8 2011-09-30 src,win-x86-exe - 3.6.4.0 0.1 1.2.3 0.9.8r 1 - -
v0.5.7 2011-09-16 src,win-x86-exe - 3.6.4.0 0.1 - 0.9.8r 1 - -
v0.5.6 2011-08-26 src,win-x86-exe - 3.6.2.0 0.1 - 0.9.8r 1 - -
v0.5.5 2011-08-26 src,win-x86-exe - 3.5.8.0 0.1 - 0.9.8r 1 - -
v0.5.4 2011-08-26 src,win-x86-exe - 3.5.4.3 0.1 - - 1 - -
v0.5.3 2011-08-26 src,win-x86-exe - 3.4.14.0 0.1 - - 1 - -
v0.5.2 2011-08-26 src,win-x86-exe - 3.4.14.0 0.1 - - 1 - -
v0.5.1 2011-08-26 src,win-x86-exe - 3.4.10.0 0.1 - - 1 - -
v0.5.0 2011-08-26 src - 3.1.8.25 - - - 1 - -
v0.4.12 2011-09-15 src - 3.1.8.26 - - - 1 - -
v0.4.11 2011-08-26 src - 3.1.8.26 - - - 1 - -
v0.4.10 2011-08-26 src - 3.1.8.26 - - - 1 - -
v0.4.9 2011-08-26 src - 3.1.8.25 - - - 1 - -
v0.4.8 2011-08-26 src - 3.1.8.16 - - - 1 - -
v0.4.7 2011-08-26 src - 3.1.8.10 - - - 1 - -
v0.4.6 2011-08-26 src - 3.1.8.10 - - - 1 - -
v0.4.5 2011-08-26 src - 3.1.8.8 - - - 1 - -
v0.4.4 2011-08-26 src - 3.1.8.5 - - - 1 - -
v0.4.3 2011-08-26 src - 3.1.8.3 - - - 1 - -
v0.4.2 2011-08-26 src - 3.1.8.0 - - - 1 - -
v0.4.1 2011-08-26 src - 3.1.5.0 - - - 1 - -
v0.4.0 2011-08-26 src - 3.1.2.0 - - - 1 - -
v0.3.8 2011-08-26 src - 3.1.1.0 - - - 1 - -
v0.3.7 2011-08-26 src - 3.0.10.0 - - - 1 - -
v0.3.6 2011-08-26 src - 3.0.9.0 - - - 1 - -
v0.3.5 2011-08-26 src - 3.0.4.1 - - - 1 - -
v0.3.4 2011-08-26 src - 3.0.4.1 - - - 1 - -
v0.3.3 2011-08-26 src - 3.0.4.1 - - - 1 - -
v0.3.2 2011-08-26 src - 3.0.3.0 - - - 1 - -
v0.3.1 2011-08-26 src - 2.5.3.0 - - - 1 - -
v0.3.0 2011-08-26 src - 2.5.1.0 - - - 1 - -
v0.2.6 2011-08-26 src - 2.3.8.0 - - - 1 - -
v0.2.5 2011-08-26 src - 2.3.8.0 - - - 1 - -
v0.2.4 2011-08-26 src - 2.3.8.0 - - - 1 - -
v0.2.3 2011-08-26 src - 2.3.8.0 - - - 1 - -
v0.2.2 2011-08-26 src - 2.3.8.0 - - - 1 - -
v0.2.1 2011-08-26 src - 2.3.8.0 - - - 1 - -
v0.2.0 2011-08-26 src - 2.3.8.0 - - - 1 - -
v0.1.104 2011-08-26 src - 2.3.6.1 - - - - - -
v0.1.103 2011-08-26 src - 2.3.5.0 - - - - - -
v0.1.102 2011-08-26 src - 2.3.2.0 - - - - - -
v0.1.101 2011-08-26 src - 2.3.0.0 - - - - - -
v0.1.100 2011-08-26 src - 2.2.21.0 - - - - - -
v0.1.99 2011-08-26 src - 2.2.18.0 - - - - - -
v0.1.98 2011-08-26 src - 2.2.16.0 - - - - - -
v0.1.97 2011-08-26 src - 2.2.12.0 - - - - - -
v0.1.96 2011-08-26 src - 2.2.0 - - - - - -
v0.1.95 2011-08-26 src - 2.2.0 - - - - - -
v0.1.94 2011-08-26 src - 2.2.8.0 - - - - - -
v0.1.93 2011-08-26 src - 2.2.6.0 - - - - - -
v0.1.92 2011-08-26 src - 2.2.4.2 - - - - - -
v0.1.91 2011-08-26 src - 2.2.3.1 - - - - - -
v0.1.90 2011-08-26 src - 2.2.0.3 - - - - - -
v0.1.33 2011-08-26 src - 2.1.6.0 - - - - - -
v0.1.32 2011-08-26 src - 2.1.3.0 - - - - - -
v0.1.31 2011-08-26 src - 2.1.2.0 - - - - - -
v0.1.30 2011-08-26 src - 2.1.1.1 - - - - - -
v0.1.29 2011-08-26 src - 2.1.0.0 - - - - - -
v0.1.28 2011-08-26 src - 2.1.0.0 - - - - - -
v0.1.27 2011-08-26 src - 2.1.0.0 - - - - - -
v0.1.26 2011-08-26 src - 2.0.6.1 - - - - - -
v0.1.25 2011-08-26 src - 2.0.5.4 - - - - - -
v0.1.24 2011-08-26 src - 2.0.5.4 - - - - - -
v0.1.23 2011-08-26 src - 2.0.0 - - - - - -
v0.1.22 2011-08-26 src - 2.0.0 - - - - - -
v0.1.21 2011-08-26 src - 2.0.0 - - - - - -
v0.1.20 2011-08-26 src - 2.0.2.0 - - - - - -
v0.1.19 2011-08-26 src - 2.0.2.0 - - - - - -
v0.1.18 2011-08-26 src - 1.3.18.0 - - - - - -
v0.1.17 2011-08-26 src - 1.3.18.0 - - - - - -
v0.1.16 2011-08-26 src - 1.3.18.0 - - - - - -
v0.1.15 2011-08-26 src - 1.3.16.0 - - - - - -
v0.1.14 2011-08-26 src - 1.3.15.0 - - - - - -
| SQL | 2 | victorfu/nvm | test/fast/Unit tests/mocks/nodejs.org-dist-index.tab | [
"MIT"
]
|
.page-login .login-box .container {
max-width: 400px;
}
| CSS | 2 | asahiocean/joplin | packages/server/public/css/index/login.css | [
"MIT"
]
|
/*---------------------------------------------------------------------------------------------
* Copyright (c) Microsoft Corporation. All rights reserved.
* Licensed under the MIT License. See License.txt in the project root for license information.
*--------------------------------------------------------------------------------------------*/
import * as assert from 'assert';
import { renderLabelWithIcons } from 'vs/base/browser/ui/iconLabel/iconLabels';
suite('renderLabelWithIcons', () => {
test('no icons', () => {
const result = renderLabelWithIcons(' hello World .');
assert.strictEqual(elementsToString(result), ' hello World .');
});
test('icons only', () => {
const result = renderLabelWithIcons('$(alert)');
assert.strictEqual(elementsToString(result), '<span class="codicon codicon-alert"></span>');
});
test('icon and non-icon strings', () => {
const result = renderLabelWithIcons(` $(alert) Unresponsive`);
assert.strictEqual(elementsToString(result), ' <span class="codicon codicon-alert"></span> Unresponsive');
});
test('multiple icons', () => {
const result = renderLabelWithIcons('$(check)$(error)');
assert.strictEqual(elementsToString(result), '<span class="codicon codicon-check"></span><span class="codicon codicon-error"></span>');
});
test('escaped icons', () => {
const result = renderLabelWithIcons('\\$(escaped)');
assert.strictEqual(elementsToString(result), '$(escaped)');
});
test('icon with animation', () => {
const result = renderLabelWithIcons('$(zip~anim)');
assert.strictEqual(elementsToString(result), '<span class="codicon codicon-zip codicon-modifier-anim"></span>');
});
const elementsToString = (elements: Array<HTMLElement | string>): string => {
return elements
.map(elem => elem instanceof HTMLElement ? elem.outerHTML : elem)
.reduce((a, b) => a + b, '');
};
});
| TypeScript | 5 | sbj42/vscode | src/vs/base/test/browser/iconLabels.test.ts | [
"MIT"
]
|
describe "import", ->
it "should import from table", ->
import sort, insert from table
t = { 4,2,6 }
insert t, 1
sort t
assert.same t, {1,2,4,6}
it "should import from local", ->
thing = { var: 10, hello: "world", func: => @var }
import hello, \func from thing
assert.same hello, thing.hello
assert.same func!, thing.var
it "should not call source multiple times", ->
count = 0
source = ->
count += 1
{ hello: "world", foo: "bar" }
import hello, foo from source!
assert.same count, 1
| MoonScript | 3 | Shados/moonscript | spec/import_spec.moon | [
"MIT",
"Unlicense"
]
|
#![feature(generic_associated_types)]
use std::{future::Future, pin::Pin};
pub trait Foo {
type Bar: AsRef<()>;
fn foo(&self) -> Pin<Box<dyn Future<Output = Self::Bar> + '_>>;
}
| Rust | 4 | Eric-Arellano/rust | src/test/ui/generic-associated-types/auxiliary/foo_defn.rs | [
"ECL-2.0",
"Apache-2.0",
"MIT-0",
"MIT"
]
|
[Files]
Source: RevitPythonShell\bin\Debug\PythonConsoleControl.dll; DestDir: {app};
Source: RevitPythonShell\bin\Debug\RevitPythonShell.dll; DestDir: {app};
Source: RequiredLibraries\ICSharpCode.AvalonEdit.dll; DestDir: {app};
Source: RequiredLibraries\IronPython.dll; DestDir: {app};
Source: RequiredLibraries\IronPython.Modules.dll; DestDir: {app};
Source: RequiredLibraries\Microsoft.Scripting.Metadata.dll; DestDir: {app};
Source: RequiredLibraries\Microsoft.Dynamic.dll; DestDir: {app};
Source: RequiredLibraries\Microsoft.Scripting.dll; DestDir: {app};
Source: RevitPythonShell\RevitPythonShell.xml; DestDir: {userappdata}\RevitPythonShell2013; Flags: onlyifdoesntexist;
[code]
{ HANDLE INSTALL PROCESS STEPS }
procedure CurStepChanged(CurStep: TSetupStep);
var
AddInFilePath: String;
AddInFileContents: String;
begin
if CurStep = ssPostInstall then
begin
{ GET LOCATION OF USER AppData (Roaming) }
AddInFilePath := ExpandConstant('{userappdata}\Autodesk\Vasari\Addins\2013\RevitPythonShell2013.addin');
{ CREATE NEW ADDIN FILE }
AddInFileContents := '<?xml version="1.0" encoding="utf-16" standalone="no"?>' + #13#10;
AddInFileContents := AddInFileContents + '<RevitAddIns>' + #13#10;
AddInFileContents := AddInFileContents + ' <AddIn Type="Application">' + #13#10;
AddInFileContents := AddInFileContents + ' <Name>RevitPythonShell</Name>' + #13#10;
AddInFileContents := AddInFileContents + ' <Assembly>' + ExpandConstant('{app}') + '\RevitPythonShell.dll</Assembly>' + #13#10;
AddInFileContents := AddInFileContents + ' <AddInId>3a7a1d24-51ed-462b-949f-1ddcca12008d</AddInId>' + #13#10;
AddInFileContents := AddInFileContents + ' <FullClassName>RevitPythonShell.RevitPythonShellApplication</FullClassName>' + #13#10;
AddInFileContents := AddInFileContents + ' <VendorId>RIPS</VendorId>' + #13#10;
AddInFileContents := AddInFileContents + ' </AddIn>' + #13#10;
AddInFileContents := AddInFileContents + '</RevitAddIns>' + #13#10;
SaveStringToFile(AddInFilePath, AddInFileContents, False);
end;
end;
[Setup]
AppName=RevitPythonShell for Vasari Beta1
AppVerName=RevitPythonShell for Vasari Beta1
RestartIfNeededByRun=false
DefaultDirName={pf32}\RevitPythonShell_for_Vasari_Beta1
OutputBaseFilename=Setup_RevitPythonShell_Vasari_Beta1
ShowLanguageDialog=auto
FlatComponentsList=false
UninstallFilesDir={app}\Uninstall
UninstallDisplayName=RevitPythonShell for Vasari Beta1
AppVersion=2012.0
VersionInfoVersion=2012.0
VersionInfoDescription=RevitPythonShell for Vasari Beta1
VersionInfoTextVersion=RevitPythonShell for Vasari Beta1
| Inno Setup | 3 | PavelAltynnikov/revitpythonshell | Setup_RevitPythonShell_Vasari_Beta1.iss | [
"MIT"
]
|
import arguments.helperfunctions;
import arguments.choice;
import arguments.argument;
import arguments.arguments;
import arguments.command;
trait Handler {
function nothing(cmd: Command): Void;
function extra(choice: Choice, args: Arguments): Void;
function end(cmd: Command): Void;
function arg(choice: Choice, arg: Argument, args: Arguments): Void;
}
struct DefaultHandler {
var a: Int;
static function new(): DefaultHandler {
return struct Self {
a: 0
};
}
}
implement Handler for DefaultHandler {
function nothing(cmd: Command): Void {
printf("`DefaultHandler.nothing()`\n");
}
function extra(choice: Choice, args: Arguments): Void {
printf("`DefaultHandler.extra()`\n");
}
function end(cmd: Command): Void {
printf("`DefaultHandler.end()`\n");
}
function arg(choice: Choice, arg: Argument, args: Arguments): Void {
printf("`DefaultHandler.arg()`\n");
}
}
| Kit | 4 | smola/language-dataset | data/github.com/AlexPoulsen/Kitten/3b8f82fbef468420a388e2bc9b6d0a661aacc9fd/src/arguments/handler.kit | [
"MIT"
]
|
Characters
plus_char = [+]
digit = [0-9]
white_space = [\t \n]
Tokens
Int = '0'|([1-9]digit*) ;
white_space<ignore> = white_space+ ;
Productions expr
expr = "start" int_decl* { new Grammar($1); }
int_decl = Int { new Integer($0); }
| Opal | 3 | mrfichtn/opal | tests/option.opal | [
"Apache-2.0"
]
|
<!--
Used to ensure there is a lang set on the html attribute for storybook
This is important for accessibility scores
-->
<script>
document.documentElement.setAttribute('lang', 'en');
</script>
| HTML | 4 | KN878/react-beautiful-dnd | .storybook/preview-head.html | [
"Apache-2.0"
]
|
{% assign scores = include.scores | split: "," %}
<table>
<thead>
<tr>
<th>Model</th>
{% for score in scores %}
<th style="text-align: center">{{ score }}</th>
{% endfor %}
<th>Paper / Source</th>
<th>Code</th>
</tr>
</thead>
<tbody>
{% for result in include.results %}
<tr>
<td>{% if result.model %} {{ result.model }} by {% endif %} {{ result.authors }} ({{ result.year }})</td>
{% for score in scores %}
<td style="text-align: center">{{ result[score] }}</td>
{% endfor %}
<td><a href="{{ result.url }}">{{ result.paper }}</a></td>
<td>
{% for el in result.code %}
<a href="{{ el.url }}">{{ el.name }}</a>
{% endfor %}
</td>
</tr>
{% endfor %}
</tbody>
</table>
| HTML | 3 | liuning123/NLP-progress | _includes/table.html | [
"MIT"
]
|
natToInt : Nat -> Integer
natToInt Z = 0
natToInt (S k) = 1 + natToInt k
%builtin NaturalToInteger natToInt
intToNat : Integer -> Nat
intToNat i = if i <= 0
then Z
else S $ intToNat (i - 1)
%builtin IntegerToNatural intToNat
add : Nat -> Nat -> Nat
add Z y = y
add (S x) y = S (add x y)
%transform "add" add x y = intToNat (prim__add_Integer (natToInt x) (natToInt y))
main : IO ()
main = do
printLn $ intToNat 3141592
printLn $ intToNat 12345
printLn $ add 100 1000
printLn $ add 9566 7554
| Idris | 4 | ska80/idris-jvm | tests/idris2/builtin011/Test.idr | [
"BSD-3-Clause"
]
|
"""Tests for the Tailscale config flow."""
from unittest.mock import AsyncMock, MagicMock
from tailscale import TailscaleAuthenticationError, TailscaleConnectionError
from homeassistant.components.tailscale.const import CONF_TAILNET, DOMAIN
from homeassistant.config_entries import SOURCE_REAUTH, SOURCE_USER
from homeassistant.const import CONF_API_KEY
from homeassistant.core import HomeAssistant
from homeassistant.data_entry_flow import (
RESULT_TYPE_ABORT,
RESULT_TYPE_CREATE_ENTRY,
RESULT_TYPE_FORM,
)
from tests.common import MockConfigEntry
async def test_full_user_flow(
hass: HomeAssistant,
mock_tailscale_config_flow: MagicMock,
mock_setup_entry: AsyncMock,
) -> None:
"""Test the full user configuration flow."""
result = await hass.config_entries.flow.async_init(
DOMAIN, context={"source": SOURCE_USER}
)
assert result.get("type") == RESULT_TYPE_FORM
assert result.get("step_id") == SOURCE_USER
assert "flow_id" in result
result2 = await hass.config_entries.flow.async_configure(
result["flow_id"],
user_input={
CONF_TAILNET: "homeassistant.github",
CONF_API_KEY: "tskey-FAKE",
},
)
assert result2.get("type") == RESULT_TYPE_CREATE_ENTRY
assert result2.get("title") == "homeassistant.github"
assert result2.get("data") == {
CONF_TAILNET: "homeassistant.github",
CONF_API_KEY: "tskey-FAKE",
}
assert len(mock_setup_entry.mock_calls) == 1
assert len(mock_tailscale_config_flow.devices.mock_calls) == 1
async def test_full_flow_with_authentication_error(
hass: HomeAssistant,
mock_tailscale_config_flow: MagicMock,
mock_setup_entry: AsyncMock,
) -> None:
"""Test the full user configuration flow with incorrect API key.
This tests tests a full config flow, with a case the user enters an invalid
Tailscale API key, but recovers by entering the correct one.
"""
result = await hass.config_entries.flow.async_init(
DOMAIN, context={"source": SOURCE_USER}
)
assert result.get("type") == RESULT_TYPE_FORM
assert result.get("step_id") == SOURCE_USER
assert "flow_id" in result
mock_tailscale_config_flow.devices.side_effect = TailscaleAuthenticationError
result2 = await hass.config_entries.flow.async_configure(
result["flow_id"],
user_input={
CONF_TAILNET: "homeassistant.github",
CONF_API_KEY: "tskey-INVALID",
},
)
assert result2.get("type") == RESULT_TYPE_FORM
assert result2.get("step_id") == SOURCE_USER
assert result2.get("errors") == {"base": "invalid_auth"}
assert "flow_id" in result2
assert len(mock_setup_entry.mock_calls) == 0
assert len(mock_tailscale_config_flow.devices.mock_calls) == 1
mock_tailscale_config_flow.devices.side_effect = None
result3 = await hass.config_entries.flow.async_configure(
result2["flow_id"],
user_input={
CONF_TAILNET: "homeassistant.github",
CONF_API_KEY: "tskey-VALID",
},
)
assert result3.get("type") == RESULT_TYPE_CREATE_ENTRY
assert result3.get("title") == "homeassistant.github"
assert result3.get("data") == {
CONF_TAILNET: "homeassistant.github",
CONF_API_KEY: "tskey-VALID",
}
assert len(mock_setup_entry.mock_calls) == 1
assert len(mock_tailscale_config_flow.devices.mock_calls) == 2
async def test_connection_error(
hass: HomeAssistant, mock_tailscale_config_flow: MagicMock
) -> None:
"""Test API connection error."""
mock_tailscale_config_flow.devices.side_effect = TailscaleConnectionError
result = await hass.config_entries.flow.async_init(
DOMAIN,
context={"source": SOURCE_USER},
data={
CONF_TAILNET: "homeassistant.github",
CONF_API_KEY: "tskey-FAKE",
},
)
assert result.get("type") == RESULT_TYPE_FORM
assert result.get("errors") == {"base": "cannot_connect"}
assert len(mock_tailscale_config_flow.devices.mock_calls) == 1
async def test_reauth_flow(
hass: HomeAssistant,
mock_config_entry: MockConfigEntry,
mock_tailscale_config_flow: MagicMock,
mock_setup_entry: AsyncMock,
) -> None:
"""Test the reauthentication configuration flow."""
mock_config_entry.add_to_hass(hass)
result = await hass.config_entries.flow.async_init(
DOMAIN,
context={
"source": SOURCE_REAUTH,
"unique_id": mock_config_entry.unique_id,
"entry_id": mock_config_entry.entry_id,
},
data=mock_config_entry.data,
)
assert result.get("type") == RESULT_TYPE_FORM
assert result.get("step_id") == "reauth_confirm"
assert "flow_id" in result
result2 = await hass.config_entries.flow.async_configure(
result["flow_id"],
{CONF_API_KEY: "tskey-REAUTH"},
)
await hass.async_block_till_done()
assert result2.get("type") == RESULT_TYPE_ABORT
assert result2.get("reason") == "reauth_successful"
assert mock_config_entry.data == {
CONF_TAILNET: "homeassistant.github",
CONF_API_KEY: "tskey-REAUTH",
}
assert len(mock_setup_entry.mock_calls) == 1
assert len(mock_tailscale_config_flow.devices.mock_calls) == 1
async def test_reauth_with_authentication_error(
hass: HomeAssistant,
mock_config_entry: MockConfigEntry,
mock_tailscale_config_flow: MagicMock,
mock_setup_entry: AsyncMock,
) -> None:
"""Test the reauthentication configuration flow with an authentication error.
This tests tests a reauth flow, with a case the user enters an invalid
API key, but recover by entering the correct one.
"""
mock_config_entry.add_to_hass(hass)
result = await hass.config_entries.flow.async_init(
DOMAIN,
context={
"source": SOURCE_REAUTH,
"unique_id": mock_config_entry.unique_id,
"entry_id": mock_config_entry.entry_id,
},
data=mock_config_entry.data,
)
assert result.get("type") == RESULT_TYPE_FORM
assert result.get("step_id") == "reauth_confirm"
assert "flow_id" in result
mock_tailscale_config_flow.devices.side_effect = TailscaleAuthenticationError
result2 = await hass.config_entries.flow.async_configure(
result["flow_id"],
{CONF_API_KEY: "tskey-INVALID"},
)
await hass.async_block_till_done()
assert result2.get("type") == RESULT_TYPE_FORM
assert result2.get("step_id") == "reauth_confirm"
assert result2.get("errors") == {"base": "invalid_auth"}
assert "flow_id" in result2
assert len(mock_setup_entry.mock_calls) == 0
assert len(mock_tailscale_config_flow.devices.mock_calls) == 1
mock_tailscale_config_flow.devices.side_effect = None
result3 = await hass.config_entries.flow.async_configure(
result2["flow_id"],
user_input={CONF_API_KEY: "tskey-VALID"},
)
await hass.async_block_till_done()
assert result3.get("type") == RESULT_TYPE_ABORT
assert result3.get("reason") == "reauth_successful"
assert mock_config_entry.data == {
CONF_TAILNET: "homeassistant.github",
CONF_API_KEY: "tskey-VALID",
}
assert len(mock_setup_entry.mock_calls) == 1
assert len(mock_tailscale_config_flow.devices.mock_calls) == 2
async def test_reauth_api_error(
hass: HomeAssistant,
mock_tailscale_config_flow: MagicMock,
mock_config_entry: MockConfigEntry,
) -> None:
"""Test API error during reauthentication."""
mock_config_entry.add_to_hass(hass)
result = await hass.config_entries.flow.async_init(
DOMAIN,
context={
"source": SOURCE_REAUTH,
"unique_id": mock_config_entry.unique_id,
"entry_id": mock_config_entry.entry_id,
},
data=mock_config_entry.data,
)
assert result.get("type") == RESULT_TYPE_FORM
assert result.get("step_id") == "reauth_confirm"
assert "flow_id" in result
mock_tailscale_config_flow.devices.side_effect = TailscaleConnectionError
result2 = await hass.config_entries.flow.async_configure(
result["flow_id"],
{CONF_API_KEY: "tskey-VALID"},
)
await hass.async_block_till_done()
assert result2.get("type") == RESULT_TYPE_FORM
assert result2.get("step_id") == "reauth_confirm"
assert result2.get("errors") == {"base": "cannot_connect"}
| Python | 5 | MrDelik/core | tests/components/tailscale/test_config_flow.py | [
"Apache-2.0"
]
|
note
description: "Git checkout command."
author: "Olivier Ligot"
class
GIT_CHECKOUT_COMMAND
inherit
GIT_COMMAND
create
make,
make_master
feature {NONE} -- Initialization
make (a_branch: STRING)
-- Checkout the branch `a_branch'.
do
initialize
arguments.force_last (a_branch)
branch := a_branch
ensure
branch_set: branch = a_branch
end
make_master
-- Checkout the master branch.
do
make ("master")
end
feature -- Access
branch: STRING
-- Branch to checkout
name: STRING = "checkout"
-- Git subcommand name
end
| Eiffel | 4 | JavascriptID/sourcerer-app | src/test/resources/samples/langs/Eiffel/git_checkout_command.e | [
"MIT"
]
|
= email_default_heading(_("Hello, %{name}!") % { name: @resource.name })
%p
= _('Someone, hopefully you, has requested to reset the password for your GitLab account on %{link_to_gitlab}.').html_safe % { link_to_gitlab: Gitlab.config.gitlab.url }
%p
= _('If you did not perform this request, you can safely ignore this email.')
%p
= _('Otherwise, click the link below to complete the process.')
#cta
= link_to(_('Reset password'), edit_password_url(@resource, reset_password_token: @token))
| Haml | 4 | Testiduk/gitlabhq | app/views/devise/mailer/reset_password_instructions.html.haml | [
"MIT"
]
|
label ccd0008b:
call gl(0,"bgcc0006")
call vsp(0,1)
call vsp(1,0)
with wipeleft
play bgm "bgm/bgm003.ogg"
"一年教室に入った。"
"霧たちはいない。"
"教室の隅にダンボール箱が転がっている。"
"赤い丸文字アルファベットでミキハウスと描かれた版権的に危険な代物だ。"
太一 "「もっと安全なとこで勝負しようぜ……」"
"察するところ、ミキの私物か？"
"子供服とか売りさばいてる場合じゃねぇ。"
"ミキハウスに入ってみる。"
"どうして狭い空間があると入っちゃうんだろう？"
"だが、この狭さがいい。"
"待つ。"
"ほどなくして、霧が来た。"
"一人だ。"
"荷物を置いて、窓際に寄る。"
"周囲に人がいないのを確認して、スカートに手を入れる。"
"下着の食い込みを直した。"
stop bgm
太一 "「……………………」"
"下着の食い込みを直した。"
"下着の食い込みを直した！"
"下着の食い込みを直した！！"
"下着の食い込みを直した！！！"
"下着の食い＊みを直した！！！！"
"下着＊食い＊みを＊した！！！！"
"下＊＊食＊＊＊を＊し＊！！！！"
"＊＊＊＊＊＊＊＊＊＊＊！！！！"
play bgm "bgm/bgm006.ogg"
"動物化する俺。"
"カメラ。"
"嗚呼、カメラ。"
"どうしてカメラを、持ってこなかったんだ……俺は？"
"苛立ち。怒り。"
"自分に対する怨嗟が、黒い炎となって膨れあがる。"
"どうして！ 今！ この場で！ カメラを持てない！"
"モノローグを力強く区切り、猛省の嵐に身を置く。"
"霧のハレンチは、それだけでは終わらない。"
"周囲に視線をやる。"
"誰もいないことを確認し、スカートのホックを外した。"
voice "vfCCD0001kri008"
霧 "「……あん」"
"スカートがするっと落ちた。"
"ぱんつまるだし―――"
"ＩＱが下がった。"
"かわりに表面積が増してきた（大人のジョーク）。"
voice "vfCCD0001kri009"
霧 "「……ん……しょっと」"
"なんと下着をずりおろした！"
"そしてすぐたくしあげる。"
"俺の目は、その瞬間確かに淡い陰毛をとらえた！"
"スカートをひろって、はき直した。"
voice "vfCCD0001kri010"
霧 "「……ほ、漏れてなかった」"
"漏れる？ 何がだ？ まさか……生理……？"
"何気ない少女の痴態。"
"汚れた、ではなく漏れた、というところにくるモンがあった。"
"俺をエレクトさせるには充分だ。"
"もう我慢できねぇ。できねぇよ。"
"霧が窓際によりかかると同時に、"
太一 "「ダッダーン！！」"
call gl(1,"TCSK0003|TCSK0003")
call gp(1,t=center)#x=220
call vsp(1,1)
with dissolve
voice "vfCCD0001kri011"
霧 "「きゃっ！？」"
"ミキハウスから爆誕。"
voice "vfCCD0001kri012"
霧 "「あ、黒須……先輩！」"
太一 "「ダッダーン！！」"
voice "vfCCD0001kri013"
霧 "「なっ、なななななななな？？」"
"パニクっとるパニクっとる。"
太一 "「……みちゃった」"
voice "vfCCD0001kri014"
霧 "「な、なにを……？」"
太一 "「霧のぱんつ」"
voice "vfCCD0001kri015"
霧 "「……う゛！？」"
太一 "「食い込み直すとこも、そのあとのシーンも」"
voice "vfCCD0001kri016"
霧 "「あああああぁぁあぁぁあぁぁぁぁ……」"
"おたおた。逃げ腰。"
太一 "「……可憐なヘアもな」"
voice "vfCCD0001kri017"
霧 "「あ、あぎゃあ……」"
"言葉を失う。"
太一 "「朝からいいものが見られた。ありがとう、霧っち」"
voice "vfCCD0001kri018"
霧 "「そ、そんな……ことが……う、ううう……」"
太一 "「それでうち解けたところで相談なんだけど……昼飯でも一緒にどうかなって」"
call gl(1,"TCSK0021|TCSK0021")
call vsp(1,1)
with dissolve
voice "vfCCD0001kri019"
霧 "「出て行けーーーーーーーーーーーーーっ！！」"
"叩き出された。"
stop bgm
return
# | Ren'Py | 0 | fossabot/cross-channel_chinese-localization_project | AllPlatforms/scripts/ccd/ccd0008b.rpy | [
"Apache-2.0"
]
|
/*---------------------------------------------------------------------------------------------
* Copyright (c) Microsoft Corporation. All rights reserved.
* Licensed under the MIT License. See License.txt in the project root for license information.
*--------------------------------------------------------------------------------------------*/
import { tmpdir } from 'os';
import { Queue } from 'vs/base/common/async';
import { randomPath } from 'vs/base/common/extpath';
import { Promises } from 'vs/base/node/pfs';
import { resolveTerminalEncoding } from 'vs/base/node/terminalEncoding';
export function hasStdinWithoutTty() {
try {
return !process.stdin.isTTY; // Via https://twitter.com/MylesBorins/status/782009479382626304
} catch (error) {
// Windows workaround for https://github.com/nodejs/node/issues/11656
}
return false;
}
export function stdinDataListener(durationinMs: number): Promise<boolean> {
return new Promise(resolve => {
const dataListener = () => resolve(true);
// wait for 1s maximum...
setTimeout(() => {
process.stdin.removeListener('data', dataListener);
resolve(false);
}, durationinMs);
// ...but finish early if we detect data
process.stdin.once('data', dataListener);
});
}
export function getStdinFilePath(): string {
return randomPath(tmpdir(), 'code-stdin', 3);
}
export async function readFromStdin(targetPath: string, verbose: boolean): Promise<void> {
let encoding = await resolveTerminalEncoding(verbose);
const iconv = await import('@vscode/iconv-lite-umd');
if (!iconv.encodingExists(encoding)) {
console.log(`Unsupported terminal encoding: ${encoding}, falling back to UTF-8.`);
encoding = 'utf8';
}
// Pipe into tmp file using terminals encoding
// Use a `Queue` to be able to use `appendFile`
// which helps file watchers to be aware of the
// changes because each append closes the underlying
// file descriptor.
// (https://github.com/microsoft/vscode/issues/148952)
const decoder = iconv.getDecoder(encoding);
const appendFileQueue = new Queue();
process.stdin.on('data', chunk => {
const chunkStr = decoder.write(chunk);
appendFileQueue.queue(() => Promises.appendFile(targetPath, chunkStr));
});
process.stdin.on('end', () => {
const end = decoder.end();
if (typeof end === 'string') {
appendFileQueue.queue(() => Promises.appendFile(targetPath, end));
}
});
}
| TypeScript | 5 | EngineLessCC/vscode | src/vs/platform/environment/node/stdin.ts | [
"MIT"
]
|
package com.baeldung.resttemplate.json.consumer.service;
import com.baeldung.resttemplate.json.model.Address;
import com.baeldung.resttemplate.json.model.User;
import com.fasterxml.jackson.databind.ObjectMapper;
import org.springframework.core.ParameterizedTypeReference;
import org.springframework.http.HttpMethod;
import org.springframework.http.HttpStatus;
import org.springframework.http.MediaType;
import org.springframework.http.ResponseEntity;
import org.springframework.web.client.RestTemplate;
import java.util.Arrays;
import java.util.List;
import java.util.stream.Collectors;
public class UserConsumerServiceImpl implements UserConsumerService {
private static final String BASE_URL = "http://localhost:8080/users";
private final RestTemplate restTemplate;
private static final ObjectMapper mapper = new ObjectMapper();
public UserConsumerServiceImpl(RestTemplate restTemplate) {
this.restTemplate = restTemplate;
}
@Override
public List<String> processUserDataFromObjectArray() {
ResponseEntity<Object[]> responseEntity = restTemplate.getForEntity(BASE_URL, Object[].class);
Object[] objects = responseEntity.getBody();
return Arrays.stream(objects)
.map(object -> mapper.convertValue(object, User.class))
.map(User::getName)
.collect(Collectors.toList());
}
@Override
public List<String> processUserDataFromUserArray() {
ResponseEntity<User[]> responseEntity = restTemplate.getForEntity(BASE_URL, User[].class);
User[] userArray = responseEntity.getBody();
return Arrays.stream(userArray)
.map(User::getName)
.collect(Collectors.toList());
}
@Override
public List<String> processUserDataFromUserList() {
ResponseEntity<List<User>> responseEntity =
restTemplate.exchange(
BASE_URL,
HttpMethod.GET,
null,
new ParameterizedTypeReference<List<User>>() {}
);
List<User> users = responseEntity.getBody();
return users.stream()
.map(User::getName)
.collect(Collectors.toList());
}
@Override
public List<String> processNestedUserDataFromUserArray() {
ResponseEntity<User[]> responseEntity = restTemplate.getForEntity(BASE_URL, User[].class);
User[] userArray = responseEntity.getBody();
//we can get more info if we need :
MediaType contentType = responseEntity.getHeaders().getContentType();
HttpStatus statusCode = responseEntity.getStatusCode();
return Arrays.stream(userArray)
.flatMap(user -> user.getAddressList().stream())
.map(Address::getPostCode)
.collect(Collectors.toList());
}
@Override
public List<String> processNestedUserDataFromUserList() {
ResponseEntity<List<User>> responseEntity =
restTemplate.exchange(
BASE_URL,
HttpMethod.GET,
null,
new ParameterizedTypeReference<List<User>>() {}
);
List<User> userList = responseEntity.getBody();
return userList.stream()
.flatMap(user -> user.getAddressList().stream())
.map(Address::getPostCode)
.collect(Collectors.toList());
}
} | Java | 5 | DBatOWL/tutorials | spring-web-modules/spring-resttemplate-2/src/main/java/com/baeldung/resttemplate/json/consumer/service/UserConsumerServiceImpl.java | [
"MIT"
]
|
This is a literate CoffeeScript file.
console.log 'C'
| Literate CoffeeScript | 0 | himanshiLt/decaffeinate | test_fixtures/C.litcoffee | [
"MIT"
]
|
#Region ;**** Directives created by AutoIt3Wrapper_GUI ****
#AutoIt3Wrapper_Icon=..\Resources\Magic Item Sort\MagicItems_icon.ico
#AutoIt3Wrapper_Outfile=..\Magic Item Sort.exe
#AutoIt3Wrapper_Compression=0
#EndRegion ;**** Directives created by AutoIt3Wrapper_GUI ****
#cs ----------------------------------------------------------------------------
AutoIt Version: 3.3.12.0
Author: sDoddler
Script Function:
Template AutoIt script.
#ce ----------------------------------------------------------------------------
#include-once
#include <WindowsConstants.au3>
#include <GUIConstantsEx.au3>
#include <Editconstants.au3>
#include <GuiListView.au3>
#include <IniEx.au3>
#include <Array.au3>
#include <GuiMenu.au3>
#include <ComboConstants.au3>
#include <File.au3>
#include "..\Resources\CustomCreator.au3"
#include "..\Resources\_RefreshCache.au3"
_RefreshCache()
#Region Variables Etc.
$appDir = EnvGet("APPDATA") & "\Doddler's D&D\"
DirCreate($appDir)
DirCreate($appDir & "Magic Item Sort Resources")
$basicIni = $appDir & "Magic Item Sort Resources\MagicItems-BasicInfo.TXT"
$completeIni = $appDir & "Magic Item Sort Resources\MagicItems-CompleteInfo.TXT"
$prefIni = $appDir & "Preferences.ini"
$pMagicItemIni = IniRead($prefIni, "Settings", "Custom Magic Items File", "")
If FileExists($pMagicItemIni) Then
Global $custIni = $pMagicItemIni
ElseIf FileExists(@ScriptDir & "\MagicItems-Custom.ini") Then
Global $custIni = @ScriptDir & "\MagicItems-Custom.ini"
Else
Global $custIni = ""
EndIf
ConsoleWrite($custIni & @LF)
$iconsIcl = $appDir & "Icons.icl"
#EndRegion Variables Etc.
#Region File and Icon Installs
FileInstall("..\Resources\Magic Item Sort\MagicItems-BasicInfo.TXT", $basicIni, 0)
FileInstall("..\Resources\Magic Item Sort\MagicItems-CompleteInfo.TXT", $completeIni, 0)
FileInstall("..\Resources\Icons.icl", $appDir & "Icons.icl", 0)
#EndRegion File and Icon Installs
Global $winTitle = "D&D Magic Item Sort"
Global $subWindows = 0
Global $hSubs[0]
$winWidth = 600
$winHeight = 420 ; HUEHUEHUE
#Region Main Gui
$hGUI = GUICreate($winTitle, $winWidth, $winHeight, -1, -1, $WS_MAXIMIZEBOX + $WS_MINIMIZEBOX + $WS_SIZEBOX)
$fileMenu = GUICtrlCreateMenu("File")
$fCustomCreator = GUICtrlCreateMenuItem("Create or Edit Custom Items", $fileMenu)
GUICtrlCreateMenuItem("", $fileMenu)
$fSetItems = GUICtrlCreateMenuItem("Set Custom Magic Items File", $fileMenu)
$fRestart = GUICtrlCreateMenuItem("Restart", $fileMenu)
#Region Right Click Menu
Global $defaultItems = 0
Global Enum $idproc1 = 1000, $idproc2 = 2000, $idproc3 = 3000, $idproc4 = 4000
Local $iItem = 0
Local $dummy_proc1 = GUICtrlCreateDummy()
Local $dummy_proc2 = GUICtrlCreateDummy()
Local $dummy_proc3 = GUICtrlCreateDummy()
Local $dummy_proc4 = GUICtrlCreateDummy()
Local $hMenu = _GUICtrlMenu_CreatePopup()
_GUICtrlMenu_InsertMenuItem($hMenu, 0, "View Full Components\Description", $idproc1)
_GUICtrlMenu_InsertMenuItem($hMenu, 1, "Add new Custom Item", $idproc4)
Local $hMenu2 = _GUICtrlMenu_CreatePopup()
_GUICtrlMenu_InsertMenuItem($hMenu2, 0, "View Full Components\Description", $idproc1)
_GUICtrlMenu_InsertMenuItem($hMenu2, 1, "Add new Custom Item", $idproc4)
_GUICtrlMenu_InsertMenuItem($hMenu2, 2, "Delete Custom Item", $idproc2)
_GUICtrlMenu_InsertMenuItem($hMenu2, 3, "Edit Custom Item", $idproc3)
#EndRegion Right Click Menu
$Enter_KEY = GUICtrlCreateDummy()
Dim $Arr[1][2] = [["{ENTER}", $Enter_KEY]]
GUISetAccelerators($Arr, $hGUI)
GUICtrlCreateGroup("", 5, 1, 510, 39)
GUICtrlSetResizing(-1, $GUI_DOCKALL)
GUICtrlCreateLabel("Item Name", 10, 1)
GUICtrlSetResizing(-1, $GUI_DOCKALL)
$ihSearch = GUICtrlCreateInput("", 10, 15, 100, -1, $ES_AUTOHSCROLL)
GUICtrlSetResizing(-1, $GUI_DOCKALL)
GUICtrlCreateLabel("Type", 125, 1)
GUICtrlSetResizing(-1, $GUI_DOCKALL)
$cType = GUICtrlCreateCombo("", 130, 15, 100)
GUICtrlSetResizing(-1, $GUI_DOCKALL)
GUICtrlSetData(-1, "Any|Armor|Potion|Ring|Rod|Scroll|Staff|Wand|Weapon|Wondrous Item", "Any")
GUICtrlCreateLabel("Rarity", 245, 1)
GUICtrlSetResizing(-1, $GUI_DOCKALL)
$cRarity = GUICtrlCreateCombo("", 250, 15, 78, -1, $CBS_DROPDOWNLIST)
GUICtrlSetResizing(-1, $GUI_DOCKALL)
GUICtrlSetData(-1, "Any|Common|Uncommon|Rare|Very Rare|Legendary", "Any")
GUICtrlCreateLabel("Attunement", 340, 1)
GUICtrlSetResizing(-1, $GUI_DOCKALL)
$cAttune = GUICtrlCreateCombo("", 345, 15, 60, -1, $CBS_DROPDOWNLIST) ; Yes/no
GUICtrlSetResizing(-1, $GUI_DOCKALL)
GUICtrlSetData(-1, "Any|Yes|-", "Any")
GUICtrlCreateLabel("Custom Items", 420, 1)
GUICtrlSetResizing(-1, $GUI_DOCKALL)
$cCustom = GUICtrlCreateCombo("", 425, 15, 70, -1, $CBS_DROPDOWNLIST)
GUICtrlSetResizing(-1, $GUI_DOCKALL)
GUICtrlSetData(-1, "Any|Only|No", "Any")
GUICtrlCreateGroup("", 5, 40, 345, 39)
GUICtrlSetResizing(-1, $GUI_DOCKALL)
GUICtrlCreateLabel("Notes", 10, 40)
GUICtrlSetResizing(-1, $GUI_DOCKALL)
$iNotes = GUICtrlCreateInput("", 10, 54, 100)
GUICtrlSetResizing(-1, $GUI_DOCKALL)
$bUpdate = GUICtrlCreateButton("Update", 125, 50, 100)
GUICtrlSetResizing(-1, $GUI_DOCKALL)
$bClear = GUICtrlCreateButton("Clear", 245, 50, 100)
GUICtrlSetResizing(-1, $GUI_DOCKALL)
#EndRegion Main Gui
#Region Listview Creation
Local $iStylesEx = BitOR($LVS_EX_GRIDLINES, $LVS_EX_FULLROWSELECT)
$idListview = GUICtrlCreateListView("", 10, 90, $winWidth - 20, 280, BitOR($LVS_SHOWSELALWAYS, $LVS_REPORT))
_GUICtrlListView_SetExtendedListViewStyle($idListview, $iStylesEx)
GUICtrlSetResizing(-1, $GUI_DOCKLEFT + $GUI_DOCKTOP + $GUI_DOCKBOTTOM + $GUI_DOCKRIGHT)
;;Sect[ITEM][0] = Magic Item Name
;[ITME][1] = Type
;[ITME][2] = Rarity
;[ITME][3] = Attunement
;[ITME][4] = Notes
;[ITME][5] = Source
_GUICtrlListView_AddColumn($idListview, "Magic Item Name", 120)
_GUICtrlListView_AddColumn($idListview, "Type", 60)
_GUICtrlListView_AddColumn($idListview, "Rarity", 100)
_GUICtrlListView_AddColumn($idListview, "Attunement", 45)
_GUICtrlListView_AddColumn($idListview, "Notes", 100)
_GUICtrlListView_AddColumn($idListview, "Source", 100)
#EndRegion Listview Creation
#Region Display ICons
$gSteamIcon = GUICtrlCreateIcon($iconsIcl,12,360,45,32,32);$appDir & "Steam_Icon.Ico", -1, 360, 45, 32, 32)
GUICtrlSetTip($gSteamIcon, " ", "sDoddler's Steam Profile")
GUICtrlSetResizing(-1, $GUI_DOCKTOP + $GUI_DOCKRIGHT + $GUI_DOCKSIZE)
GUICtrlSetCursor(-1, 0)
$gTwitterIcon = GUICtrlCreateIcon($iconsIcl,13, 400, 45, 32, 32)
GUICtrlSetResizing(-1, $GUI_DOCKTOP + $GUI_DOCKRIGHT + $GUI_DOCKSIZE)
GUICtrlSetCursor(-1, 0)
GUICtrlSetTip($gTwitterIcon, " ", "sDoddler's Twitter Page")
$gYoutubeIcon = GUICtrlCreateIcon($iconsIcl,14, 440, 45, 32, 32)
GUICtrlSetTip($gYoutubeIcon, " ", "sDoddler's YouTube Channel")
GUICtrlSetResizing(-1, $GUI_DOCKTOP + $GUI_DOCKRIGHT + $GUI_DOCKSIZE)
GUICtrlSetCursor(-1, 0)
$gGithubIcon = GUICtrlCreateIcon($iconsIcl,11, 480, 45, 32, 32)
GUICtrlSetTip($gGithubIcon, " ", "D&D Software Suite Github Page")
GUICtrlSetResizing(-1, $GUI_DOCKTOP + $GUI_DOCKRIGHT + $GUI_DOCKSIZE)
GUICtrlSetCursor(-1, 0)
#EndRegion Display ICons
GUISetState()
_GUICtrlSetState($GUI_DISABLE)
$itemArray = CreateItemArray()
_GUICtrlSetState($GUI_ENABLE)
GUIRegisterMsg($WM_NOTIFY, "WM_NOTIFY")
GUIRegisterMsg($WM_COMMAND, "WM_COMMAND")
$winSize = WinGetClientSize($winTitle)
$lastWinSize = $winSize[0]
_GUICtrlListView_RegisterSortCallBack($idListview)
OnAutoItExitRegister("SavePreferences")
While 1
$msg = GUIGetMsg(1)
Switch $msg[1]
Case $hGUI
Switch $msg[0]
Case $GUI_EVENT_CLOSE ; Esc or X window button is pressed
Exit
Case $idListview ; List View Sort call
_GUICtrlListView_SortItems($idListview, GUICtrlGetState($idListview))
Case $bUpdate ; Upadte Button is pressed
Update()
Case $Enter_KEY ; GUI Accelerator {ENTER} is pressed
If ControlGetHandle($winTitle, "", ControlGetFocus($winTitle)) = GUICtrlGetHandle($idListview) Then
$indicies = _GUICtrlListView_GetSelectedIndices($idListview, True)
For $i = 1 To $indicies[0]
$item = _GUICtrlListView_GetItemText($idListview, $indicies[$i])
For $j = 0 To UBound($itemArray) - 1
If $itemArray[$j][0] = $item Then
If $itemArray[$j][6] = "CUSTOMITEM" Then
$itemRead = IniRead($custIni, "Index", $item, "")
$type = "Custom"
Else
$itemRead = IniRead($basicIni, "MagicItems", $item, "")
$type = "Complete"
EndIf
ExitLoop
EndIf
Next
$split = StringSplit($itemRead, "\\", 1)
If $split[0] = 6 Then
;ConsoleWrite($split[6] & @LF)
$quick = _IniDecode($split[6], $type)
CreateSubWindow($split[6], $quick[0], 200 + ($quick[1] * 5))
;ConsoleWrite(200 + (StringLen($split[6]) * 4) & @LF)
Else
;ConsoleWrite($item & @LF)
$quick = _IniDecode($item, $type)
CreateSubWindow($item, $quick[0], 200 + ($quick[1] * 5))
;ConsoleWrite(200 + (StringLen($item) * 4) & @LF)
EndIf
Next
Else
Update()
EndIf
Case $bClear ; Clear Button is Pressed
GUICtrlSetData($cRarity, "")
GUICtrlSetData($cType, "")
GUICtrlSetData($cAttune, "")
GUICtrlSetData($cCustom, "")
GUICtrlSetData($cRarity, "Any|Common|Uncommon|Rare|Very Rare|Legendary", "Any")
GUICtrlSetData($cType, "Any|Armor|Potion|Ring|Rod|Scroll|Staff|Wand|Weapon|Wondrous Item", "Any")
GUICtrlSetData($cAttune, "Any|Yes|-", "Any")
GUICtrlSetData($cCustom, "Any|Only|No", "Any")
GUICtrlSetData($iNotes, "")
GUICtrlSetData($ihSearch, "")
Case $dummy_proc1 ; View Item Description
$item = _GUICtrlListView_GetItemText($idListview, $iItem)
For $j = 0 To UBound($itemArray) - 1
If $itemArray[$j][0] = $item Then
If $itemArray[$j][6] = "CUSTOMITEM" Then
$itemRead = IniRead($custIni, "Index", $item, "")
$type = "Custom"
Else
$itemRead = IniRead($basicIni, "MagicItems", $item, "")
$type = "Complete"
EndIf
ExitLoop
EndIf
Next
$split = StringSplit($itemRead, "\\", 1)
If $split[0] = 6 Then
;ConsoleWrite($split[6] & @LF)
$quick = _IniDecode($split[6], $type)
CreateSubWindow($split[6], $quick[0], 200 + ($quick[1] * 5))
;ConsoleWrite(200 + (StringLen($split[6]) * 4) & @LF)
Else
;ConsoleWrite($item & @LF)
$quick = _IniDecode($item, $type)
CreateSubWindow($item, $quick[0], 200 + ($quick[1] * 5))
;ConsoleWrite(200 + (StringLen($item) * 4) & @LF)
EndIf
;,_GUICtrlListView_GetItemText($idListview, $iItem,6),_GUICtrlListView_GetItemText($idListview, $iItem,8))
;MsgBox(64,_GUICtrlListView_GetItemText($idListview, $iItem),"Components: " &_GUICtrlListView_GetItemText($idListview, $iItem,6) & @LF & @LF & "Description: " & _GUICtrlListView_GetItemText($idListview, $iItem,8))
Case $dummy_proc2 ; Delete Custom Item
$delItem = _GUICtrlListView_GetItemText($idListview, $iItem)
$iMsg = MsgBox(52, "Delete Item? ", "Are you sure you want to delete: " & $delItem & @LF & "At Location: " & $custIni)
If $iMsg = 6 Then
IniDelete($custIni, $delItem)
IniDelete($custIni, "Index", $delItem)
_GUICtrlListView_DeleteItem($idListview, $iItem)
_GUICtrlSetState($GUI_DISABLE)
$itemArray = CreateItemArray(False)
_GUICtrlSetState($GUI_ENABLE)
EndIf
Case $dummy_proc3 ; Edit Custom Item
$itemName = _GUICtrlListView_GetItemText($idListview, $iItem)
For $i = 0 To UBound($itemArray) - 1
If $itemName = $itemArray[$i][0] Then ExitLoop
Next
_CustomCreator($hGUI, $winTitle, "Magic Item", $itemName, IniRead($custIni, "Index", $itemName, ""), IniReadSection($custIni, $itemName))
$pMagicItemIni = IniRead($prefIni, "Settings", "Custom Magic Items File", "")
If FileExists($pMagicItemIni) Then
Global $custIni = $pMagicItemIni
EndIf
_GUICtrlSetState($GUI_DISABLE)
GUIRegisterMsg($WM_NOTIFY, "WM_NOTIFY")
$itemArray = CreateItemArray(False)
Update()
_GUICtrlSetState($GUI_ENABLE)
Case $dummy_proc4 ; Add?
_CustomCreator($hGUI, $winTitle, "Magic Item")
$pMagicItemIni = IniRead($prefIni, "Settings", "Custom Magic Items File", "")
If FileExists($pMagicItemIni) Then
Global $custIni = $pMagicItemIni
EndIf
_GUICtrlSetState($GUI_DISABLE)
GUIRegisterMsg($WM_NOTIFY, "WM_NOTIFY")
$itemArray = CreateItemArray(False)
Update()
_GUICtrlSetState($GUI_ENABLE)
Case $gSteamIcon
ShellExecute('https://steamcommunity.com/id/sdoddler')
Case $gTwitterIcon
ShellExecute('https://twitter.com/sdoddler')
Case $gYoutubeIcon
ShellExecute('https://youtube.com/user/doddddy')
Case $gGithubIcon
ShellExecute('https://github.com/sdoddler/D-D-Software-Suite')
Case $fRestart
Restart()
Case $fSetItems
If $custIni <> "" Then
$iniSplit = StringSplit($custIni, "\")
$iniRep = StringReplace($custIni, $iniSplit[$iniSplit[0]], "", -1)
$pMagicItemIni = FileOpenDialog("Select the Custom Magic Item Ini Location", $iniRep, "Ini Files (*.ini)", 1, $iniSplit[$iniSplit[0]])
Else
$pMagicItemIni = FileOpenDialog("Select the Custom Magic Item Ini Location", @ScriptDir, "Ini Files (*.ini)", 1)
EndIf
If FileExists($pMagicItemIni) Then
$custIni = $pMagicItemIni
ConsoleWrite($custIni & @LF)
_GUICtrlSetState($GUI_DISABLE)
$itemArray = CreateItemArray(False)
Update()
_GUICtrlSetState($GUI_ENABLE)
EndIf
;$custIni = FileOpenDialog("Select the Custom Magic Items Ini Location", @ScriptDir, "Ini Files (*.ini)", 1)
Case $fCustomCreator
_CustomCreator($hGUI, $winTitle)
$pMagicItemIni = IniRead($prefIni, "Settings", "Custom Magic Items File", "")
If FileExists($pMagicItemIni) Then
Global $custIni = $pMagicItemIni
EndIf
_GUICtrlSetState($GUI_DISABLE)
GUIRegisterMsg($WM_NOTIFY, "WM_NOTIFY")
$itemArray = CreateItemArray(False)
Update()
_GUICtrlSetState($GUI_ENABLE)
EndSwitch
EndSwitch
For $i = 1 To UBound($hSubs) - 1
If $msg[1] = $hSubs[$i][0] Then
;ConsoleWrite("Message hit on: " & $hDescripts[$i]&@LF)
Switch $msg[0]
Case $GUI_EVENT_CLOSE
GUIDelete($hSubs[$i][0])
_ArrayDelete($hSubs, $i)
$subWindows -= 1
ExitLoop
Case $hSubs[$i][2]
$hSubs[$i][6] = Not ($hSubs[$i][6])
If $hSubs[$i][6] Then
$styles = BitOR($ES_READONLY, $ES_MULTILINE, $WS_VSCROLL)
Else
$styles = BitOR($ES_MULTILINE, $WS_VSCROLL)
EndIf
GUICtrlSetStyle($hSubs[$i][5], $styles)
Case $hSubs[$i][3]
GUICtrlSetData($hSubs[$i][5], $hSubs[$i][1])
Case $hSubs[$i][4]
$quickSave = FileSaveDialog($hSubs[$i][7], @ScriptDir, "Text files (*.txt)")
If Not (@error) Then
FileWrite($quickSave, GUICtrlRead($hSubs[$i][5]))
EndIf
EndSwitch
EndIf
Next
Sleep(10)
WEnd
Func SavePreferences()
IniWrite($prefIni, "Settings", "Custom Magic Items File", $custIni)
EndFunc ;==>SavePreferences
Func Restart()
If @Compiled Then
Run(FileGetShortName(@ScriptFullPath))
Else
Run(FileGetShortName(@AutoItExe) & " " & FileGetShortName(@ScriptFullPath))
EndIf
Exit
EndFunc ;==>Restart
Func _GUICtrlSetState($state)
If $state = $GUI_DISABLE Then
GUISetState($hGUI, @SW_LOCK)
EndIf
If $state = $GUI_ENABLE Then
GUISetState($hGUI, @SW_UNLOCK)
EndIf
GUICtrlSetState($idListview, $state)
GUICtrlSetState($cCustom, $state)
GUICtrlSetState($cType, $state)
GUICtrlSetState($iNotes, $state)
GUICtrlSetState($cRarity, $state)
GUICtrlSetState($cAttune, $state)
GUICtrlSetState($ihSearch, $state)
GUICtrlSetState($bUpdate, $state)
GUICtrlSetState($bClear, $state)
GUICtrlSetState($fileMenu, $state)
Switch $state
Case $GUI_ENABLE
GUISetAccelerators($Arr, $hGUI)
Case $GUI_DISABLE
GUISetAccelerators(0, $hGUI)
EndSwitch
EndFunc ;==>_GUICtrlSetState
Func WM_NOTIFY($hWnd, $iMsg, $iwParam, $ilParam)
; structure to map $ilParam ($tNMHDR - see Help file)
Local $tNMHDR = DllStructCreate($tagNMHDR, $ilParam);, $tagNMLISTVIEW
Switch $tNMHDR.IDFrom
Case $idListview
Switch $tNMHDR.Code
Case $NM_DBLCLK
$tInfo = DllStructCreate($tagNMLISTVIEW, $ilParam)
If $tInfo.Item > -1 Then
$iItem = $tInfo.Item
$item = _GUICtrlListView_GetItemText($idListview, $iItem)
For $i = 0 To UBound($itemArray) - 1
If $item = $itemArray[$i][0] Then
If $itemArray[$i][6] = "CUSTOMITEM" Then
$quick = _IniDecode($itemArray[$i][0], "Custom")
$name = $itemArray[$i][0]
Else
$quick = _IniDecode($itemArray[$i][6])
$name = $itemArray[$i][6]
EndIf
CreateSubWindow($name, $quick[0], 200 + ($quick[1] * 5))
ExitLoop
EndIf
Next
;~ $itemRead = IniRead($basicIni, "MagicItems", $item, "")
;~ $split = StringSplit($itemRead, "\\", 1)
;~ If $split[0] = 6 Then
;~ ;ConsoleWrite($split[6] & @LF)
;~ $quick = _IniDecode($split[6])
;~ CreateSubWindow($split[6],$quick[0] , 200 + ($quick[1] * 5))
;~ ;ConsoleWrite(200 + (StringLen($split[6]) * 4) & @LF)
;~ Else
;~ ;ConsoleWrite($item & @LF)
;~ $quick = _IniDecode($item)
;~ CreateSubWindow($item, $quick[0], 200 + ($quick[1] * 5))
;~ ;ConsoleWrite(200 + (StringLen($item) * 4) & @LF)
;~ EndIf
EndIf
Case $NM_RCLICK
$tInfo = DllStructCreate($tagNMLISTVIEW, $ilParam)
If $tInfo.Item > -1 Then
$iItem = $tInfo.Item
ConsoleWrite($iItem & @LF)
For $i = 0 To UBound($itemArray) - 1
If $itemArray[$i][0] = _GUICtrlListView_GetItemText($idListview, $iItem) Then
ExitLoop
EndIf
Next
If $i < $defaultItems Or $i = 0 Then
_GUICtrlMenu_TrackPopupMenu($hMenu, $hGUI)
Else
_GUICtrlMenu_TrackPopupMenu($hMenu2, $hGUI)
EndIf
EndIf
EndSwitch
EndSwitch
Return $GUI_RUNDEFMSG
EndFunc ;==>WM_NOTIFY
Func WM_COMMAND($hWnd, $iMsg, $iwParam, $ilParam)
; $iwParam contains the application messages that we defined earlier
Switch $iwParam
Case $idproc1
GUICtrlSendToDummy($dummy_proc1)
Case $idproc2
GUICtrlSendToDummy($dummy_proc2)
Case $idproc3
GUICtrlSendToDummy($dummy_proc3)
Case $idproc4
GUICtrlSendToDummy($dummy_proc4)
EndSwitch
EndFunc ;==>WM_COMMAND
Func CreateItemArray($redoList = True)
;;Sect[ITEM][0] = Magic Item Name
;[ITME][1] = Type
;[ITME][2] = Rarity
;[ITME][3] = Attunement
;[ITME][4] = Notes
;[ITME][5] = Source
If $redoList Then _GUICtrlListView_DeleteAllItems($idListview)
Local $listCount = 0
$secT = IniReadSection($basicIni, "MagicItems")
Dim $itArray[$secT[0][0]][7]
$defaultItems = $secT[0][0]
;_ArrayDisplay($secT)
For $j = 1 To $secT[0][0]
$itArray[$listCount][0] = $secT[$j][0]
$iSplit = StringSplit($secT[$j][1], "\\", 1)
$itArray[$listCount][1] = $iSplit[1]
$itArray[$listCount][2] = $iSplit[2]
$itArray[$listCount][3] = $iSplit[3]
$itArray[$listCount][4] = $iSplit[4]
$itArray[$listCount][5] = $iSplit[5]
If $iSplit[0] = 6 Then
$itArray[$listCount][6] = $iSplit[6]
Else
$itArray[$listCount][6] = $itArray[$listCount][0]
EndIf
If $redoList Then
_GUICtrlListView_AddItem($idListview, $itArray[$listCount][0])
_GUICtrlListView_AddSubItem($idListview, $listCount, $iSplit[1], 1)
_GUICtrlListView_AddSubItem($idListview, $listCount, $iSplit[2], 2)
_GUICtrlListView_AddSubItem($idListview, $listCount, $iSplit[3], 3)
_GUICtrlListView_AddSubItem($idListview, $listCount, $iSplit[4], 4)
_GUICtrlListView_AddSubItem($idListview, $listCount, $iSplit[5], 5)
EndIf
$listCount += 1
Next
ConsoleWrite($custIni & @LF)
If FileExists($custIni) Then
ConsoleWrite("BOOYAH")
$UB = UBound($itArray)
$secT = IniReadSection($custIni, "Index")
if IsArray($sect) Then
ReDim $itArray[$UB + $secT[0][0]][7]
;_ArrayDisplay($itArray)
For $j = 1 To $secT[0][0]
$itArray[$listCount][0] = $secT[$j][0]
$iSplit = StringSplit($secT[$j][1], "\\", 1)
If $iSplit[0] <> 5 Then ContinueLoop
$itArray[$listCount][1] = $iSplit[1]
$itArray[$listCount][2] = $iSplit[2]
$itArray[$listCount][3] = $iSplit[3]
$itArray[$listCount][4] = $iSplit[4]
$itArray[$listCount][5] = $iSplit[5]
$itArray[$listCount][6] = "CUSTOMITEM"
If $redoList Then
_GUICtrlListView_AddItem($idListview, $itArray[$listCount][0])
_GUICtrlListView_AddSubItem($idListview, $listCount, $iSplit[1], 1)
_GUICtrlListView_AddSubItem($idListview, $listCount, $iSplit[2], 2)
_GUICtrlListView_AddSubItem($idListview, $listCount, $iSplit[3], 3)
_GUICtrlListView_AddSubItem($idListview, $listCount, $iSplit[4], 4)
_GUICtrlListView_AddSubItem($idListview, $listCount, $iSplit[5], 5)
EndIf
$listCount += 1
Next
EndIf
EndIf
Return $itArray
EndFunc ;==>CreateItemArray
Func SearchMagicItems($iSearch = 0)
Local $listCount = 0
_GUICtrlListView_DeleteAllItems($idListview)
;;Sect[ITEM][0] = Magic Item Name
;[ITME][1] = Type
;[ITME][2] = Rarity
;[ITME][3] = Attunement
;[ITME][4] = Notes
;[ITME][5] = Source
For $i = 0 To UBound($itemArray) - 1
Local $include = True
For $j = 0 To UBound($iSearch) - 1
Switch $iSearch[$j][1]
Case "Magic Item Name"
If Not (StringInStr($itemArray[$i][0], $iSearch[$j][0])) Then
$include = False
ExitLoop
EndIf
Case "Type"
If Not (StringInStr($itemArray[$i][1], $iSearch[$j][0])) Then
$include = False
ExitLoop
EndIf
Case "Rarity"
If Not ($itemArray[$i][2] = $iSearch[$j][0]) Then
$include = False
ExitLoop
EndIf
Case "Attunement"
If Not (StringInStr($itemArray[$i][3], $iSearch[$j][0])) Then
$include = False
ExitLoop
EndIf
Case "Custom Items"
If $itemArray[$i][6] = "CUSTOMITEM" Then
If $iSearch[$j][0] = "No" Then
$include = False
ExitLoop
EndIf
Else
If $iSearch[$j][0] = "Only" Then
$include = False
ExitLoop
EndIf
EndIf
Case "Notes"
If Not (StringInStr($itemArray[$i][4], $iSearch[$j][0])) Then
$include = False
ExitLoop
EndIf
EndSwitch
Next
If $include Then
_GUICtrlListView_AddItem($idListview, $itemArray[$i][0])
_GUICtrlListView_AddSubItem($idListview, $listCount, $itemArray[$i][1], 1)
_GUICtrlListView_AddSubItem($idListview, $listCount, $itemArray[$i][2], 2)
_GUICtrlListView_AddSubItem($idListview, $listCount, $itemArray[$i][3], 3)
_GUICtrlListView_AddSubItem($idListview, $listCount, $itemArray[$i][4], 4)
_GUICtrlListView_AddSubItem($idListview, $listCount, $itemArray[$i][5], 5)
$listCount += 1
EndIf
Next
EndFunc ;==>SearchMagicItems
Func Update()
$searchArray = 0
Dim $searchArray[5][2]
;;Sect[ITEM][0] = Magic Item Name
;[ITME][1] = Type
;[ITME][2] = Rarity
;[ITME][3] = Attunement
;[ITME][4] = Notes
;[ITME][5] = Source
$qCount = 0
If GUICtrlRead($ihSearch) <> "" Then
$searchArray[$qCount][1] = "Magic Item Name"
$searchArray[$qCount][0] = GUICtrlRead($ihSearch)
$qCount += 1
EndIf
If GUICtrlRead($cType) <> "Any" Then
$searchArray[$qCount][1] = "Type"
$searchArray[$qCount][0] = GUICtrlRead($cType)
$qCount += 1
EndIf
If GUICtrlRead($cRarity) <> "Any" Then
$searchArray[$qCount][1] = "Rarity"
$searchArray[$qCount][0] = GUICtrlRead($cRarity)
$qCount += 1
EndIf
If GUICtrlRead($cAttune) <> "Any" Then
$searchArray[$qCount][1] = "Attunement"
$searchArray[$qCount][0] = GUICtrlRead($cAttune)
$qCount += 1
EndIf
If GUICtrlRead($cCustom) <> "Any" Then
$searchArray[$qCount][1] = "Custom Items"
$searchArray[$qCount][0] = GUICtrlRead($cCustom)
$qCount += 1
EndIf
If GUICtrlRead($iNotes) <> "" Then
$searchArray[$qCount][1] = "Notes"
$searchArray[$qCount][0] = GUICtrlRead($iNotes)
$qCount += 1
EndIf
;_ArrayDisplay($searchArray)
If $qCount > 0 Then
ConsoleWrite("Qcount > 0" & @LF)
ReDim $searchArray[$qCount][2]
_GUICtrlSetState($GUI_DISABLE)
SearchMagicItems($searchArray)
_GUICtrlSetState($GUI_ENABLE)
Else
ConsoleWrite("Qcount = 0" & @LF)
_GUICtrlSetState($GUI_DISABLE)
$itemArray = CreateItemArray()
_GUICtrlSetState($GUI_ENABLE)
EndIf
EndFunc ;==>Update
Func _IniDecode($iSection, $iniType = "Complete")
ConsoleWrite("Initype = " & $iniType & @LF)
Local $retString = "", $longestStr = 0
$titleLen = StringLen($iSection)
;ConsoleWrite($titleLen & @LF)
$retString = "+"
For $i = 0 To $titleLen + 1
$retString &= "~"
Next
$retString &= "+" & @CRLF
$retString &= "| " & $iSection & " |" & @CRLF
$retString &= "+"
For $i = 0 To $titleLen + 1
$retString &= "~"
Next
$retString &= "+" & @CRLF
If $iniType = "Complete" Then
$iniData = IniReadSection($completeIni, $iSection)
ElseIf $iniType = "Custom" Then
$iniData = IniReadSection($custIni, $iSection)
EndIf
For $i = 1 To $iniData[0][0]
Select
Case StringInStr($iniData[$i][0], "Type")
$retString &= $iniData[$i][1] & @CRLF & @CRLF
Case StringInStr($iniData[$i][0], "Description")
If StringInStr($iniData[$i][0], "DescriptionTitle") Then
$strLen = StringLen($iniData[$i][1])
$retString &= "|"
For $j = 0 To $strLen + 1
$retString &= "~"
Next
$retString &= "|" & @CRLF
$retString &= "| " & $iniData[$i][1] & " |" & @CRLF
$retString &= "|"
For $j = 0 To $strLen + 1
$retString &= "~"
Next
$retString &= "|" & @CRLF
Else
$retString &= " " & $iniData[$i][1] & @CRLF
EndIf
Case StringInStr($iniData[$i][0], "Subitem")
$retString &= "- " & $iniData[$i][1] & @CRLF
Case StringInStr($iniData[$i][0], "TableTitle") Or StringInStr($iniData[$i][0], "TableColumns") Or StringInStr($iniData[$i][0], "TableRow")
$j = $i
$longestStr = 0
$colInt = 0
$tabInt = 0
$tableArray = 0
$tableItems = 0
$colLengths = 0
$colSplit = 0
$columns = 1
$boolTitle = False
$boolCol = False
$boolRow = False
$tableTitle = ""
Dim $tableArray[2000][10]
Do
If StringInStr($iniData[$j][0], "Table") Then
If StringInStr($iniData[$j][0], "TableTitle") Then
If $boolTitle = True Then ExitLoop
If $boolRow = True Then ExitLoop
$longestStr = StringLen($iniData[$j][1]) + 2
$tableTitle = $iniData[$j][1]
$boolTitle = True
;ConsoleWrite($tableArray[0][1] & @LF)
ElseIf StringInStr($iniData[$j][0], "TableColumns") Then
If $boolCol = True Then ExitLoop
If $boolRow = True Then ExitLoop
$colSplit = StringSplit($iniData[$j][1], "\\", 1)
Dim $colLengths[$colSplit[0]]
For $a = 1 To $colSplit[0]
$tableArray[1][$a - 1] = $colSplit[$a]
;ConsoleWrite("Column " & $a & " is " & $tableArray[1][$a - 1] & @LF)
$colLengths[$a - 1] = StringLen($tableArray[1][$a - 1])
Next
$boolCol = True
Else
$tabItemSplit = StringSplit($iniData[$j][1], "\\", 1)
$tableItems += 1
If $boolRow = True Then
If UBound($colLengths) < $tabItemSplit[0] Then
ConsoleWrite("Wrong Number of Columns" & @LF)
ExitLoop
EndIf
EndIf
$columns = $tabItemSplit[0]
ConsoleWrite($columns & @LF)
If $longestStr = 0 Then
$longestStr += 1
For $b = 1 To $tabItemSplit[0]
$longestStr += StringLen($tabItemSplit[$b])
If Not ($b = $tabItemSplit[0]) Then $longestStr += 3
Next
$longestStr += 1
Else
$rowStr = 1
ConsoleWrite($tabItemSplit & @LF)
$n = 1
If $boolCol Then $n = 2
For $b = $n To $tabItemSplit[0]
$rowStr += StringLen($tabItemSplit[$b])
If Not ($b = $tabItemSplit[0]) Then $rowStr += 3
Next
$rowStr += 1
If $rowStr > $longestStr Then $longestStr = $rowStr
EndIf
If Not (IsArray($colLengths)) Then
Dim $colLengths[$tabItemSplit[0]]
EndIf
For $a = 1 To $tabItemSplit[0]
If $boolCol Then
$tableArray[$tableItems + 1][$a - 1] = $tabItemSplit[$a]
Else
$tableArray[$tableItems][$a - 1] = $tabItemSplit[$a]
EndIf
;ConsoleWrite("Item " & $tableItems & " column " & $a & " is " & $tableArray[$tableItems + 1][$a - 1] & @LF)
If StringLen($tableArray[$tableItems + 1][$a - 1]) > $colLengths[$a - 1] Then $colLengths[$a - 1] = StringLen($tableArray[$tableItems + 1][$a - 1])
Next
$boolRow = True
EndIf
;ConsoleWrite($iniData[$j][0] &@LF)
EndIf
;Add to Array in here maybe instead? Can't tell at the moment if its better to do Longest Str first or not?
; You would probably need array because Columns\Items need +3 inbetween each column where as a Title only needs +2 on either side
$j += 1
Until ($j > $iniData[0][0] Or StringInStr($iniData[$j][0], "Table") = 0)
If Not ($j > $iniData[0][0]) Then
$i = $j - 1
Else
$i = $j
EndIf
$colInt = 1
For $j = 0 To UBound($colLengths) - 1
$colInt += $colLengths[$j]
If $j = UBound($colLengths) - 1 Then
$colInt += 1
Else
$colInt += 3
EndIf
Next
If $colInt > $longestStr Then
$longestStr = $colInt
Else
$j = $colInt
$z = 0
Do
If $z > UBound($colLengths) - 1 Then $z = 0
If $colLengths <> 0 Then $colLengths[$z] += 1
$j += 1
$z += 1
Until $j > $longestStr - 1
EndIf
If IsArray($colSplit) Then
If $colSplit[0] > $columns Then $columns = $colSplit[0]
ReDim $tableArray[$tableItems + 2][$columns]
Else
ReDim $tableArray[$tableItems + 1][$columns]
EndIf
$tableArray[0][0] = $tableItems
If $tableTitle <> "" Then
$retString &= "+"
For $j = 1 To $longestStr
$retString &= "-"
Next
$retString &= "+" & @CRLF & "+"
$titleSpace = ($longestStr - StringLen($tableTitle)) / 2
For $j = 1 To Ceiling($titleSpace)
$retString &= " "
Next
$retString &= $tableTitle
For $j = 1 To Floor($titleSpace)
$retString &= " "
Next
$retString &= "+" & @CRLF
EndIf
$retString &= "+"
For $j = 1 To $longestStr
$retString &= "-"
Next
$retString &= "+" & @CRLF
$n = 0
If IsArray($colSplit) Then $n = 1
For $j = 1 To $tableItems + $n
$retString &= "|"
If $tableItems > 0 Or IsArray($colSplit) Then
For $a = 0 To UBound($tableArray, 2) - 1
$itemSpace = ($colLengths[$a] - StringLen($tableArray[$j][$a])) / 2
For $z = 0 To Floor($itemSpace)
$retString &= " "
Next
$retString &= $tableArray[$j][$a]
For $z = 0 To Ceiling($itemSpace)
$retString &= " "
Next
If Not ($a >= UBound($tableArray, 2) - 1) Then $retString &= "|"
Next
EndIf
$retString &= "|" & @CRLF
If $j = 1 And $boolCol Then
$retString &= "+"
For $x = 1 To $longestStr
$retString &= "-"
Next
$retString &= "+" & @CRLF
EndIf
Next
$retString &= "+"
For $j = 1 To $longestStr
$retString &= "-"
Next
$retString &= "+" & @CRLF & @CRLF
Case StringInStr($iniData[$i][0], "Roll")
$strLen = StringLen($iniData[$i][1])
If StringInStr($iniData[$i][0], "DiceRoll") Then $strLen += 11
$retString &= "+"
For $j = 0 To $strLen + 1
$retString &= "-"
Next
$retString &= "+" & @CRLF & "+ "
If StringInStr($iniData[$i][0], "DiceRoll") Then $retString &= "Dice Roll: "
$retString &= $iniData[$i][1] & " +" & @CRLF
$retString &= "+"
For $j = 0 To $strLen + 1
$retString &= "-"
Next
$retString &= "+" & @CRLF
Case StringInStr($iniData[$i][0], "Effect")
$retString &= $iniData[$i][1] & @CRLF & @CRLF
Case StringInStr($iniData[$i][0], "Heading")
If StringInStr($iniData[$i][0], "EndHeading") Then
$retString &= "+----------------+" & @CRLF
Else
$strLen = StringLen($iniData[$i][1])
$retString &= "+"
For $j = 0 To $strLen + 1
$retString &= "-"
Next
$retString &= "+" & @CRLF & "+ "
$retString &= $iniData[$i][1] & " +" & @CRLF
$retString &= "+"
For $j = 0 To $strLen + 1
$retString &= "-"
Next
$retString &= "+" & @CRLF
EndIf
EndSelect
Next
If $longestStr > $titleLen Then $titleLen = $longestStr
Dim $retArray[2] = [$retString, $titleLen]
Return $retArray
EndFunc ;==>_IniDecode
Func CreateSubWindow($iTitle, $iData, $iWidth = 250, $iReadOnly = True)
;; For additional windows have an Array structured as per below
;$windows[X][0] = WindowHandle
;$windows[X][1] = Full Data (Returned from whatever Generator was used)
;$windows[X][2] = Allow Edit (Button with Toggle)
;$windows[X][3] = Reset Data (Button to reset Input to [x][1])
;$windows[X][5] = Input Handle
;$windows[X][4] = Save Button? (Save current to .txt)
;$windows[X][6] = Allow Edit Value (True/False) ??
Local $height, $width
GUISetState(@SW_DISABLE, $hGUI)
$subWindows += 1
ReDim $hSubs[$subWindows + 1][8]
$hSubs[$subWindows][0] = GUICreate($iTitle, $iWidth, 300, -1, -1, $WS_MAXIMIZEBOX + $WS_MINIMIZEBOX + $WS_SIZEBOX)
$hSubs[$subWindows][1] = $iData
$hSubs[$subWindows][2] = GUICtrlCreateIcon($iconsIcl, 3, 10, 230);;Lock\Unlock
GUICtrlSetResizing(-1, $GUI_DOCKBOTTOM + $GUI_DOCKLEFT + $GUI_DOCKSIZE)
GUICtrlSetCursor(-1, 0)
GUICtrlSetTip(-1, "Unlock the workspace for editing" & @LF & "Useful for Picking and choosing loot or releasing over time", "Unlock\Lock Workspace")
$hSubs[$subWindows][3] = GUICtrlCreateIcon($iconsIcl, 4, 40, 230);Reset WorkSpace
GUICtrlSetResizing(-1, $GUI_DOCKBOTTOM + $GUI_DOCKLEFT + $GUI_DOCKSIZE)
GUICtrlSetCursor(-1, 0)
GUICtrlSetTip(-1, "Reset the text to it's default state" & @LF _
& "(How it was generated)", "Reset Workspace")
$hSubs[$subWindows][4] = GUICtrlCreateIcon($iconsIcl, 1, 70, 230);Save
GUICtrlSetResizing(-1, $GUI_DOCKBOTTOM + $GUI_DOCKLEFT + $GUI_DOCKSIZE)
GUICtrlSetCursor(-1, 0)
GUICtrlSetTip(-1, "Save current text to a text file for later viewing", "Save")
$hSubs[$subWindows][6] = $iReadOnly
$hSubs[$subWindows][7] = $iTitle
If $iReadOnly Then
$styles = BitOR($ES_READONLY, $ES_MULTILINE, $WS_VSCROLL)
Else
$styles = BitOR($ES_MULTILINE, $WS_VSCROLL)
EndIf
$hSubs[$subWindows][5] = GUICtrlCreateEdit($iData, 5, 5, $iWidth - 10, 210, $styles)
GUICtrlSetFont(-1, 9, 400, -1, "Consolas")
GUICtrlSetResizing(-1, $GUI_DOCKLEFT + $GUI_DOCKTOP + $GUI_DOCKBOTTOM + $GUI_DOCKRIGHT)
GUISetState()
GUISetState(@SW_ENABLE, $hGUI)
EndFunc ;==>CreateSubWindow
| AutoIt | 5 | sdoddler/D-D-Software-Suite | Magic Item Sort Source/BackUp/MagicItemSort_old1.au3 | [
"Unlicense"
]
|
<GameProjectFile>
<PropertyGroup Type="Node" Name="fx_vic" ID="a216914d-c0d7-49f6-8da3-6a19dd0dc55f" Version="0.0.0.1" />
<Content ctype="GameProjectContent">
<Content>
<Animation Duration="208" Speed="0.4">
<Timeline ActionTag="-663741931" FrameType="PositionFrame">
<PointFrame FrameIndex="4" X="3.15" Y="-19.7" />
<PointFrame FrameIndex="9" X="3.1" Y="-19.55" />
<PointFrame FrameIndex="14" Tween="False" X="3.15" Y="-19.7" />
<PointFrame FrameIndex="55" Tween="False" X="3.15" Y="-19.7" />
</Timeline>
<Timeline ActionTag="-663741931" FrameType="ScaleFrame">
<PointFrame FrameIndex="4" X="4" Y="4" />
<PointFrame FrameIndex="9" X="6.833374" Y="6.833374" />
<PointFrame FrameIndex="14" Tween="False" X="10.93921" Y="10.93921" />
<PointFrame FrameIndex="55" Tween="False" X="10.93921" Y="10.93921" />
</Timeline>
<Timeline ActionTag="-663741931" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="4" X="0" Y="0" />
<PointFrame FrameIndex="9" X="0" Y="0" />
<PointFrame FrameIndex="14" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="55" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="-663741929" FrameType="PositionFrame">
<PointFrame FrameIndex="4" X="3.15" Y="-19.7" />
<PointFrame FrameIndex="9" X="3.1" Y="-19.55" />
<PointFrame FrameIndex="14" Tween="False" X="3.15" Y="-19.7" />
<PointFrame FrameIndex="55" Tween="False" X="3.15" Y="-19.7" />
</Timeline>
<Timeline ActionTag="-663741929" FrameType="ScaleFrame">
<PointFrame FrameIndex="4" X="4" Y="4" />
<PointFrame FrameIndex="9" X="6.833374" Y="6.833374" />
<PointFrame FrameIndex="14" Tween="False" X="10.93921" Y="10.93921" />
<PointFrame FrameIndex="55" Tween="False" X="10.93921" Y="10.93921" />
</Timeline>
<Timeline ActionTag="-663741929" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="4" X="0" Y="0" />
<PointFrame FrameIndex="9" X="0" Y="0" />
<PointFrame FrameIndex="14" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="55" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="-663741927" FrameType="PositionFrame">
<PointFrame FrameIndex="4" X="3.15" Y="-19.7" />
<PointFrame FrameIndex="9" X="3.1" Y="-19.55" />
<PointFrame FrameIndex="14" Tween="False" X="3.15" Y="-19.7" />
<PointFrame FrameIndex="55" Tween="False" X="3.15" Y="-19.7" />
</Timeline>
<Timeline ActionTag="-663741927" FrameType="ScaleFrame">
<PointFrame FrameIndex="4" X="4" Y="4" />
<PointFrame FrameIndex="9" X="6.833374" Y="6.833374" />
<PointFrame FrameIndex="14" Tween="False" X="10.93921" Y="10.93921" />
<PointFrame FrameIndex="55" Tween="False" X="10.93921" Y="10.93921" />
</Timeline>
<Timeline ActionTag="-663741927" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="4" X="0" Y="0" />
<PointFrame FrameIndex="9" X="0" Y="0" />
<PointFrame FrameIndex="14" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="55" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="-663741925" FrameType="PositionFrame">
<PointFrame FrameIndex="4" X="3.15" Y="-19.7" />
<PointFrame FrameIndex="9" X="3.1" Y="-19.55" />
<PointFrame FrameIndex="14" Tween="False" X="3.15" Y="-19.7" />
<PointFrame FrameIndex="55" Tween="False" X="3.15" Y="-19.7" />
</Timeline>
<Timeline ActionTag="-663741925" FrameType="ScaleFrame">
<PointFrame FrameIndex="4" X="4" Y="4" />
<PointFrame FrameIndex="9" X="6.833374" Y="6.833374" />
<PointFrame FrameIndex="14" Tween="False" X="10.93921" Y="10.93921" />
<PointFrame FrameIndex="55" Tween="False" X="10.93921" Y="10.93921" />
</Timeline>
<Timeline ActionTag="-663741925" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="4" X="0" Y="0" />
<PointFrame FrameIndex="9" X="0" Y="0" />
<PointFrame FrameIndex="14" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="55" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="-663741923" FrameType="PositionFrame">
<PointFrame FrameIndex="8" X="-12" Y="-58.05" />
<PointFrame FrameIndex="17" Tween="False" X="-12" Y="-58.05" />
<PointFrame FrameIndex="55" Tween="False" X="-12" Y="-58.05" />
</Timeline>
<Timeline ActionTag="-663741923" FrameType="ScaleFrame">
<PointFrame FrameIndex="8" X="6.098206" Y="6.098206" />
<PointFrame FrameIndex="17" Tween="False" X="8.490906" Y="8.490906" />
<PointFrame FrameIndex="55" Tween="False" X="8.490906" Y="8.490906" />
</Timeline>
<Timeline ActionTag="-663741923" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="8" X="0" Y="0" />
<PointFrame FrameIndex="17" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="55" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836668" FrameType="PositionFrame">
<PointFrame FrameIndex="2" Tween="False" X="-7.65" Y="-53.1" />
<PointFrame FrameIndex="4" X="-7.65" Y="-53.1" />
<PointFrame FrameIndex="8" Tween="False" X="-7.65" Y="-53.1" />
<PointFrame FrameIndex="55" Tween="False" X="-7.65" Y="-53.1" />
</Timeline>
<Timeline ActionTag="898836668" FrameType="ScaleFrame">
<PointFrame FrameIndex="2" Tween="False" X="4" Y="4" />
<PointFrame FrameIndex="4" X="2.73877" Y="2.73877" />
<PointFrame FrameIndex="8" Tween="False" X="5.513123" Y="5.513123" />
<PointFrame FrameIndex="55" Tween="False" X="5.513123" Y="5.513123" />
</Timeline>
<Timeline ActionTag="898836668" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="2" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="4" X="0" Y="0" />
<PointFrame FrameIndex="8" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="55" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836670" FrameType="PositionFrame">
<PointFrame FrameIndex="2" Tween="False" X="-7.65" Y="-53.1" />
<PointFrame FrameIndex="4" X="-7.65" Y="-53.1" />
<PointFrame FrameIndex="8" Tween="False" X="-7.65" Y="-53.1" />
<PointFrame FrameIndex="55" Tween="False" X="-7.65" Y="-53.1" />
</Timeline>
<Timeline ActionTag="898836670" FrameType="ScaleFrame">
<PointFrame FrameIndex="2" Tween="False" X="4" Y="4" />
<PointFrame FrameIndex="4" X="2.73877" Y="2.73877" />
<PointFrame FrameIndex="8" Tween="False" X="5.513123" Y="5.513123" />
<PointFrame FrameIndex="55" Tween="False" X="5.513123" Y="5.513123" />
</Timeline>
<Timeline ActionTag="898836670" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="2" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="4" X="0" Y="0" />
<PointFrame FrameIndex="8" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="55" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836673" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="4" Value="True" />
</Timeline>
<Timeline ActionTag="898836673" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="4" X="0.5" Y="0.5" />
<PointFrame FrameIndex="14" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836673" FrameType="ColorFrame">
<ColorFrame FrameIndex="14" Alpha="255">
<Color A="255" R="255" G="255" B="255" />
</ColorFrame>
<ColorFrame FrameIndex="40" Alpha="0">
<Color A="255" R="255" G="255" B="255" />
</ColorFrame>
</Timeline>
<Timeline ActionTag="898836672" FrameType="PositionFrame">
<PointFrame FrameIndex="4" X="-1.15" Y="-33.35" />
<PointFrame FrameIndex="14" Tween="False" X="-3.8" Y="-41.3" />
</Timeline>
<Timeline ActionTag="898836672" FrameType="ScaleFrame">
<PointFrame FrameIndex="4" X="2.108871" Y="2.108871" />
<PointFrame FrameIndex="40" Tween="False" X="5" Y="5" />
<PointFrame FrameIndex="55" Tween="False" X="3.483139" Y="3.483139" />
<PointFrame FrameIndex="0" X="2.108871" Y="2.1089" />
</Timeline>
<Timeline ActionTag="898836672" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="4" X="0" Y="0" />
<PointFrame FrameIndex="14" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="55" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836702" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="18" Value="True" />
</Timeline>
<Timeline ActionTag="898836702" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="18" X="0.5" Y="0.5" />
<PointFrame FrameIndex="22" X="0.5" Y="0.5" />
<PointFrame FrameIndex="27" X="0.5" Y="0.5" />
<PointFrame FrameIndex="55" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836701" FrameType="PositionFrame">
<PointFrame FrameIndex="18" X="1.45" Y="-36.65" />
<PointFrame FrameIndex="22" X="1.45" Y="-36.65" />
<PointFrame FrameIndex="27" Tween="False" X="1.45" Y="-36.65" />
<PointFrame FrameIndex="55" Tween="False" X="1.45" Y="-36.65" />
</Timeline>
<Timeline ActionTag="898836701" FrameType="ScaleFrame">
<PointFrame FrameIndex="18" X="0.7819977" Y="0.7819977" />
<PointFrame FrameIndex="22" X="1.14299" Y="1.14299" />
<PointFrame FrameIndex="27" Tween="False" X="1" Y="1" />
<PointFrame FrameIndex="55" Tween="False" X="1" Y="1" />
</Timeline>
<Timeline ActionTag="898836701" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="18" X="0" Y="0" />
<PointFrame FrameIndex="22" X="0" Y="0" />
<PointFrame FrameIndex="27" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="55" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836704" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="18" Value="True" />
</Timeline>
<Timeline ActionTag="898836704" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="18" X="0.5" Y="0.5" />
<PointFrame FrameIndex="20" X="0.5" Y="0.5001656" />
<PointFrame FrameIndex="24" X="0.5" Y="0.5" />
<PointFrame FrameIndex="55" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836703" FrameType="PositionFrame">
<PointFrame FrameIndex="18" X="-4.85" Y="-36.65" />
<PointFrame FrameIndex="20" X="-4.85" Y="-36.65" />
<PointFrame FrameIndex="24" Tween="False" X="-4.85" Y="-36.65" />
<PointFrame FrameIndex="55" Tween="False" X="-4.85" Y="-36.65" />
</Timeline>
<Timeline ActionTag="898836703" FrameType="ScaleFrame">
<PointFrame FrameIndex="18" X="1.172028" Y="1.172028" />
<PointFrame FrameIndex="20" X="1.228973" Y="1.228973" />
<PointFrame FrameIndex="24" Tween="False" X="1" Y="1" />
<PointFrame FrameIndex="55" Tween="False" X="1" Y="1" />
</Timeline>
<Timeline ActionTag="898836703" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="18" X="0" Y="0" />
<PointFrame FrameIndex="20" X="0" Y="0" />
<PointFrame FrameIndex="24" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="55" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836706" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="25" Value="True" />
</Timeline>
<Timeline ActionTag="898836706" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="25" X="0.5" Y="0.5" />
<PointFrame FrameIndex="27" X="0.5" Y="0.5" />
<PointFrame FrameIndex="29" X="0.5" Y="0.5" />
<PointFrame FrameIndex="33" X="0.5" Y="0.5" />
<PointFrame FrameIndex="38" X="0.5" Y="0.5" />
<PointFrame FrameIndex="44" X="0.5" Y="0.5" />
<PointFrame FrameIndex="47" X="0.5" Y="0.5" />
<PointFrame FrameIndex="55" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836705" FrameType="PositionFrame">
<PointFrame FrameIndex="25" X="-8.85" Y="-44.95" />
<PointFrame FrameIndex="27" X="-8.85" Y="-145.45" />
<PointFrame FrameIndex="29" X="-8.85" Y="-242.7" />
<PointFrame FrameIndex="33" X="-8.85" Y="-211.35" />
<PointFrame FrameIndex="38" X="-8.85" Y="-229.65" />
<PointFrame FrameIndex="44" X="-8.85" Y="-225.2" />
<PointFrame FrameIndex="47" Tween="False" X="-8.85" Y="-225.2" />
<PointFrame FrameIndex="55" Tween="False" X="-8.85" Y="-225.2" />
</Timeline>
<Timeline ActionTag="898836705" FrameType="ScaleFrame">
<PointFrame FrameIndex="25" X="1.009995" Y="0.4488983" />
<PointFrame FrameIndex="27" X="1" Y="0.8136292" />
<PointFrame FrameIndex="29" X="1" Y="1.059998" />
<PointFrame FrameIndex="33" X="1" Y="0.9600067" />
<PointFrame FrameIndex="38" X="1" Y="1.013123" />
<PointFrame FrameIndex="44" X="1" Y="1" />
<PointFrame FrameIndex="47" Tween="False" X="1" Y="1" />
<PointFrame FrameIndex="55" Tween="False" X="1" Y="1" />
</Timeline>
<Timeline ActionTag="898836705" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="25" X="0" Y="0" />
<PointFrame FrameIndex="27" X="0" Y="0" />
<PointFrame FrameIndex="29" X="0" Y="0" />
<PointFrame FrameIndex="33" X="0" Y="0" />
<PointFrame FrameIndex="38" X="0" Y="0" />
<PointFrame FrameIndex="44" X="0" Y="0" />
<PointFrame FrameIndex="47" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="55" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836729" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
</Timeline>
<Timeline ActionTag="898836731" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="34" Value="True" />
<BoolFrame FrameIndex="55" Value="False" />
</Timeline>
<Timeline ActionTag="898836731" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="34" X="0.5" Y="0.5" />
<PointFrame FrameIndex="54" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836730" FrameType="PositionFrame">
<PointFrame FrameIndex="34" X="-1.7" Y="-31.85" />
<PointFrame FrameIndex="54" Tween="False" X="-1.7" Y="-31.8" />
</Timeline>
<Timeline ActionTag="898836730" FrameType="ScaleFrame">
<PointFrame FrameIndex="34" X="2.034027" Y="2.034027" />
<PointFrame FrameIndex="54" Tween="False" X="2.58902" Y="2.58902" />
</Timeline>
<Timeline ActionTag="898836730" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="34" X="0" Y="0" />
<PointFrame FrameIndex="54" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836733" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="34" Value="True" />
<BoolFrame FrameIndex="55" Value="False" />
</Timeline>
<Timeline ActionTag="898836733" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="34" X="0.5" Y="0.5" />
<PointFrame FrameIndex="54" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836733" FrameType="ColorFrame">
<ColorFrame FrameIndex="55" Alpha="0">
<Color A="255" R="255" G="255" B="255" />
</ColorFrame>
<ColorFrame FrameIndex="40" Alpha="220">
<Color A="255" R="255" G="255" B="255" />
</ColorFrame>
</Timeline>
<Timeline ActionTag="898836732" FrameType="PositionFrame">
<PointFrame FrameIndex="34" X="-1.7" Y="-31.85" />
<PointFrame FrameIndex="54" Tween="False" X="-1.7" Y="-31.8" />
</Timeline>
<Timeline ActionTag="898836732" FrameType="ScaleFrame">
<PointFrame FrameIndex="34" X="2.034027" Y="2.034027" />
<PointFrame FrameIndex="54" Tween="False" X="2.58902" Y="2.58902" />
</Timeline>
<Timeline ActionTag="898836732" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="34" X="0" Y="0" />
<PointFrame FrameIndex="54" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836735" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="20" Value="True" />
<BoolFrame FrameIndex="41" Value="False" />
<BoolFrame FrameIndex="106" Value="True" />
</Timeline>
<Timeline ActionTag="898836735" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="20" X="0.5" Y="0.5" />
<PointFrame FrameIndex="40" X="0.5" Y="0.5" />
<PointFrame FrameIndex="106" X="0.5" Y="0.5" />
<PointFrame FrameIndex="126" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836735" FrameType="ColorFrame">
<ColorFrame FrameIndex="20" Alpha="255">
<Color A="255" R="255" G="255" B="255" />
</ColorFrame>
<ColorFrame FrameIndex="35" Alpha="0">
<Color A="255" R="255" G="255" B="255" />
</ColorFrame>
</Timeline>
<Timeline ActionTag="898836734" FrameType="PositionFrame">
<PointFrame FrameIndex="20" X="-1.7" Y="-31.85" />
<PointFrame FrameIndex="40" Tween="False" X="-1.7" Y="-31.8" />
<PointFrame FrameIndex="106" X="-1.7" Y="-31.85" />
<PointFrame FrameIndex="126" Tween="False" X="-1.7" Y="-31.8" />
</Timeline>
<Timeline ActionTag="898836734" FrameType="ScaleFrame">
<PointFrame FrameIndex="20" X="2.034027" Y="2.034027" />
<PointFrame FrameIndex="40" Tween="False" X="2.58902" Y="2.58902" />
<PointFrame FrameIndex="106" X="2.034027" Y="2.034027" />
<PointFrame FrameIndex="126" Tween="False" X="2.58902" Y="2.58902" />
</Timeline>
<Timeline ActionTag="898836734" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="20" X="0" Y="0" />
<PointFrame FrameIndex="40" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="106" X="0" Y="0" />
<PointFrame FrameIndex="126" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836737" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="20" Value="True" />
<BoolFrame FrameIndex="41" Value="False" />
<BoolFrame FrameIndex="106" Value="True" />
</Timeline>
<Timeline ActionTag="898836737" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="20" X="0.5" Y="0.5" />
<PointFrame FrameIndex="40" X="0.5" Y="0.5" />
<PointFrame FrameIndex="106" X="0.5" Y="0.5" />
<PointFrame FrameIndex="126" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836737" FrameType="ColorFrame">
<ColorFrame FrameIndex="25" Alpha="255">
<Color A="255" R="255" G="255" B="255" />
</ColorFrame>
<ColorFrame FrameIndex="40" Alpha="0">
<Color A="255" R="255" G="255" B="255" />
</ColorFrame>
</Timeline>
<Timeline ActionTag="898836736" FrameType="PositionFrame">
<PointFrame FrameIndex="20" X="-1.7" Y="-31.85" />
<PointFrame FrameIndex="40" Tween="False" X="-1.7" Y="-31.8" />
<PointFrame FrameIndex="106" X="-1.7" Y="-31.85" />
<PointFrame FrameIndex="126" Tween="False" X="-1.7" Y="-31.8" />
</Timeline>
<Timeline ActionTag="898836736" FrameType="ScaleFrame">
<PointFrame FrameIndex="20" X="2.034027" Y="2.034027" />
<PointFrame FrameIndex="40" Tween="False" X="2.58902" Y="2.58902" />
<PointFrame FrameIndex="106" X="2.034027" Y="2.034027" />
<PointFrame FrameIndex="126" Tween="False" X="2.58902" Y="2.58902" />
</Timeline>
<Timeline ActionTag="898836736" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="20" X="0" Y="0" />
<PointFrame FrameIndex="40" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="106" X="0" Y="0" />
<PointFrame FrameIndex="126" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836760" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="12" Value="True" />
<BoolFrame FrameIndex="33" Value="False" />
<BoolFrame FrameIndex="98" Value="True" />
</Timeline>
<Timeline ActionTag="898836760" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="12" X="0.5" Y="0.5" />
<PointFrame FrameIndex="32" X="0.5" Y="0.5" />
<PointFrame FrameIndex="98" X="0.5" Y="0.5" />
<PointFrame FrameIndex="118" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836760" FrameType="ColorFrame">
<ColorFrame FrameIndex="25" Alpha="255">
<Color A="255" R="255" G="255" B="255" />
</ColorFrame>
<ColorFrame FrameIndex="45" Alpha="0">
<Color A="255" R="255" G="255" B="255" />
</ColorFrame>
</Timeline>
<Timeline ActionTag="898836738" FrameType="PositionFrame">
<PointFrame FrameIndex="12" X="-1.7" Y="-31.85" />
<PointFrame FrameIndex="32" Tween="False" X="-1.7" Y="-31.8" />
<PointFrame FrameIndex="98" X="-1.7" Y="-31.85" />
<PointFrame FrameIndex="118" Tween="False" X="-1.7" Y="-31.8" />
</Timeline>
<Timeline ActionTag="898836738" FrameType="ScaleFrame">
<PointFrame FrameIndex="12" X="2.034027" Y="2.034027" />
<PointFrame FrameIndex="32" Tween="False" X="2.58902" Y="2.58902" />
<PointFrame FrameIndex="98" X="2.034027" Y="2.034027" />
<PointFrame FrameIndex="118" Tween="False" X="2.58902" Y="2.58902" />
</Timeline>
<Timeline ActionTag="898836738" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="12" X="0" Y="0" />
<PointFrame FrameIndex="32" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="98" X="0" Y="0" />
<PointFrame FrameIndex="118" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836762" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="12" Value="True" />
<BoolFrame FrameIndex="33" Value="False" />
<BoolFrame FrameIndex="98" Value="True" />
</Timeline>
<Timeline ActionTag="898836762" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="12" X="0.5" Y="0.5" />
<PointFrame FrameIndex="32" X="0.5" Y="0.5" />
<PointFrame FrameIndex="98" X="0.5" Y="0.5" />
<PointFrame FrameIndex="118" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836762" FrameType="ColorFrame">
<ColorFrame FrameIndex="25" Alpha="255">
<Color A="255" R="255" G="255" B="255" />
</ColorFrame>
<ColorFrame FrameIndex="50" Alpha="0">
<Color A="255" R="255" G="255" B="255" />
</ColorFrame>
</Timeline>
<Timeline ActionTag="898836761" FrameType="PositionFrame">
<PointFrame FrameIndex="12" X="-1.7" Y="-31.85" />
<PointFrame FrameIndex="32" Tween="False" X="-1.7" Y="-31.8" />
<PointFrame FrameIndex="98" X="-1.7" Y="-31.85" />
<PointFrame FrameIndex="118" Tween="False" X="-1.7" Y="-31.8" />
</Timeline>
<Timeline ActionTag="898836761" FrameType="ScaleFrame">
<PointFrame FrameIndex="12" X="2.034027" Y="2.034027" />
<PointFrame FrameIndex="32" Tween="False" X="2.58902" Y="2.58902" />
<PointFrame FrameIndex="98" X="2.034027" Y="2.034027" />
<PointFrame FrameIndex="118" Tween="False" X="2.58902" Y="2.58902" />
</Timeline>
<Timeline ActionTag="898836761" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="12" X="0" Y="0" />
<PointFrame FrameIndex="32" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="98" X="0" Y="0" />
<PointFrame FrameIndex="118" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836764" FrameType="VisibleFrame">
<BoolFrame FrameIndex="11" Value="False" />
</Timeline>
<Timeline ActionTag="898836764" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="4" X="0.5" Y="0.5" />
<PointFrame FrameIndex="8" X="0.5" Y="0.5" />
<PointFrame FrameIndex="10" X="0.5" Y="0.5" />
<PointFrame FrameIndex="0" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836763" FrameType="PositionFrame">
<PointFrame FrameIndex="0" Tween="False" X="-11.9" Y="0.35" />
<PointFrame FrameIndex="1" Tween="False" X="-13.7" Y="186.6" />
<PointFrame FrameIndex="2" Tween="False" X="-10.85" Y="-10.6" />
<PointFrame FrameIndex="4" X="-46.89734" Y="-71.29965" />
<PointFrame FrameIndex="8" X="-10.85" Y="-18.1" />
<PointFrame FrameIndex="10" Tween="False" X="-10.9" Y="-29.3" />
</Timeline>
<Timeline ActionTag="898836763" FrameType="ScaleFrame">
<PointFrame FrameIndex="0" Tween="False" X="9.931091" Y="9.931091" />
<PointFrame FrameIndex="1" Tween="False" X="9.090302" Y="9.090302" />
<PointFrame FrameIndex="2" Tween="False" X="2.345276" Y="2.345276" />
<PointFrame FrameIndex="4" X="1.637009" Y="1.637009" />
<PointFrame FrameIndex="8" X="1.860565" Y="1.860565" />
<PointFrame FrameIndex="10" Tween="False" X="1.637009" Y="1.637009" />
</Timeline>
<Timeline ActionTag="898836763" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="0" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="1" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="2" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="4" X="0" Y="0" />
<PointFrame FrameIndex="8" X="0" Y="0" />
<PointFrame FrameIndex="10" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836766" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="True" />
<BoolFrame FrameIndex="4" Value="True" />
</Timeline>
<Timeline ActionTag="898836766" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="4" X="0.5" Y="0.5002404" />
<PointFrame FrameIndex="8" X="0.5" Y="0.5" />
<PointFrame FrameIndex="10" X="0.5" Y="0.5002404" />
</Timeline>
<Timeline ActionTag="898836765" FrameType="PositionFrame">
<PointFrame FrameIndex="4" X="-7.95" Y="-30.8" />
<PointFrame FrameIndex="8" X="-7.95" Y="-30.8" />
<PointFrame FrameIndex="10" Tween="False" X="-7.95" Y="-30.8" />
</Timeline>
<Timeline ActionTag="898836765" FrameType="ScaleFrame">
<PointFrame FrameIndex="4" X="1.018005" Y="1.018005" />
<PointFrame FrameIndex="8" X="1.253906" Y="1.253906" />
<PointFrame FrameIndex="10" Tween="False" X="1.018005" Y="1.018005" />
</Timeline>
<Timeline ActionTag="898836765" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="4" X="0" Y="0" />
<PointFrame FrameIndex="8" X="0" Y="0" />
<PointFrame FrameIndex="10" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836768" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="12" Value="True" />
</Timeline>
<Timeline ActionTag="898836768" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="12" X="0.5" Y="0.5" />
<PointFrame FrameIndex="26" X="0.5" Y="0.5" />
<PointFrame FrameIndex="40" X="0.5" Y="0.5" />
<PointFrame FrameIndex="54" X="0.5" Y="0.5" />
<PointFrame FrameIndex="55" X="0.5" Y="0.5" />
<PointFrame FrameIndex="67" X="0.5" Y="0.5" />
<PointFrame FrameIndex="81" X="0.5" Y="0.5" />
<PointFrame FrameIndex="93" X="0.5" Y="0.5" />
<PointFrame FrameIndex="107" X="0.5" Y="0.5" />
<PointFrame FrameIndex="119" X="0.5" Y="0.5" />
<PointFrame FrameIndex="133" X="0.5" Y="0.5" />
<PointFrame FrameIndex="145" X="0.5" Y="0.5" />
<PointFrame FrameIndex="159" X="0.5" Y="0.5" />
<PointFrame FrameIndex="171" X="0.5" Y="0.5" />
<PointFrame FrameIndex="185" X="0.5" Y="0.5" />
<PointFrame FrameIndex="197" X="0.5" Y="0.5" />
<PointFrame FrameIndex="208" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836767" FrameType="PositionFrame">
<PointFrame FrameIndex="12" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="26" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="40" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="54" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="55" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="67" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="81" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="93" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="107" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="119" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="133" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="145" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="159" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="171" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="185" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="197" X="172.05" Y="-93.45" />
<PointFrame FrameIndex="208" X="172.05" Y="-93.45" />
</Timeline>
<Timeline ActionTag="898836767" FrameType="ScaleFrame">
<PointFrame FrameIndex="12" X="1" Y="1" />
<PointFrame FrameIndex="26" X="1" Y="1" />
<PointFrame FrameIndex="40" X="1" Y="1" />
<PointFrame FrameIndex="54" X="1" Y="1" />
<PointFrame FrameIndex="55" X="1" Y="1" />
<PointFrame FrameIndex="67" X="1" Y="1" />
<PointFrame FrameIndex="81" X="1" Y="1" />
<PointFrame FrameIndex="93" X="1" Y="1" />
<PointFrame FrameIndex="107" X="1" Y="1" />
<PointFrame FrameIndex="119" X="1" Y="1" />
<PointFrame FrameIndex="133" X="1" Y="1" />
<PointFrame FrameIndex="145" X="1" Y="1" />
<PointFrame FrameIndex="159" X="1" Y="1" />
<PointFrame FrameIndex="171" X="1" Y="1" />
<PointFrame FrameIndex="185" X="1" Y="1" />
<PointFrame FrameIndex="197" X="1" Y="1" />
<PointFrame FrameIndex="208" X="1" Y="1" />
</Timeline>
<Timeline ActionTag="898836767" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="12" X="0" Y="0" />
<PointFrame FrameIndex="26" X="0" Y="0" />
<PointFrame FrameIndex="40" X="0" Y="0" />
<PointFrame FrameIndex="54" X="0" Y="0" />
<PointFrame FrameIndex="55" X="0" Y="0" />
<PointFrame FrameIndex="67" X="0" Y="0" />
<PointFrame FrameIndex="81" X="0" Y="0" />
<PointFrame FrameIndex="93" X="0" Y="0" />
<PointFrame FrameIndex="107" X="0" Y="0" />
<PointFrame FrameIndex="119" X="0" Y="0" />
<PointFrame FrameIndex="133" X="0" Y="0" />
<PointFrame FrameIndex="145" X="0" Y="0" />
<PointFrame FrameIndex="159" X="0" Y="0" />
<PointFrame FrameIndex="171" X="0" Y="0" />
<PointFrame FrameIndex="185" X="0" Y="0" />
<PointFrame FrameIndex="197" X="0" Y="0" />
<PointFrame FrameIndex="208" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836767" FrameType="EventFrame">
<StringFrame FrameIndex="208" Value="show_end" />
</Timeline>
<Timeline ActionTag="898836791" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="12" Value="True" />
</Timeline>
<Timeline ActionTag="898836791" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="12" X="0.5" Y="0.5" />
<PointFrame FrameIndex="26" X="0.5" Y="0.5" />
<PointFrame FrameIndex="40" X="0.5" Y="0.5" />
<PointFrame FrameIndex="54" X="0.5" Y="0.5" />
<PointFrame FrameIndex="55" X="0.5" Y="0.5" />
<PointFrame FrameIndex="67" X="0.5" Y="0.5" />
<PointFrame FrameIndex="81" X="0.5" Y="0.5" />
<PointFrame FrameIndex="93" X="0.5" Y="0.5" />
<PointFrame FrameIndex="107" X="0.5" Y="0.5" />
<PointFrame FrameIndex="119" X="0.5" Y="0.5" />
<PointFrame FrameIndex="133" X="0.5" Y="0.5" />
<PointFrame FrameIndex="145" X="0.5" Y="0.5" />
<PointFrame FrameIndex="159" X="0.5" Y="0.5" />
<PointFrame FrameIndex="171" X="0.5" Y="0.5" />
<PointFrame FrameIndex="185" X="0.5" Y="0.5" />
<PointFrame FrameIndex="197" X="0.5" Y="0.5" />
<PointFrame FrameIndex="208" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836769" FrameType="PositionFrame">
<PointFrame FrameIndex="12" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="26" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="40" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="54" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="55" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="67" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="81" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="93" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="107" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="119" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="133" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="145" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="159" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="171" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="185" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="197" X="-178.95" Y="-79.8" />
<PointFrame FrameIndex="208" X="-178.95" Y="-79.8" />
</Timeline>
<Timeline ActionTag="898836769" FrameType="ScaleFrame">
<PointFrame FrameIndex="12" X="1" Y="1" />
<PointFrame FrameIndex="26" X="1" Y="1" />
<PointFrame FrameIndex="40" X="1" Y="1" />
<PointFrame FrameIndex="54" X="1" Y="1" />
<PointFrame FrameIndex="55" X="1" Y="1" />
<PointFrame FrameIndex="67" X="1" Y="1" />
<PointFrame FrameIndex="81" X="1" Y="1" />
<PointFrame FrameIndex="93" X="1" Y="1" />
<PointFrame FrameIndex="107" X="1" Y="1" />
<PointFrame FrameIndex="119" X="1" Y="1" />
<PointFrame FrameIndex="133" X="1" Y="1" />
<PointFrame FrameIndex="145" X="1" Y="1" />
<PointFrame FrameIndex="159" X="1" Y="1" />
<PointFrame FrameIndex="171" X="1" Y="1" />
<PointFrame FrameIndex="185" X="1" Y="1" />
<PointFrame FrameIndex="197" X="1" Y="1" />
<PointFrame FrameIndex="208" X="1" Y="1" />
</Timeline>
<Timeline ActionTag="898836769" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="12" X="0" Y="0" />
<PointFrame FrameIndex="26" X="0" Y="0" />
<PointFrame FrameIndex="40" X="0" Y="0" />
<PointFrame FrameIndex="54" X="0" Y="0" />
<PointFrame FrameIndex="55" X="0" Y="0" />
<PointFrame FrameIndex="67" X="0" Y="0" />
<PointFrame FrameIndex="81" X="0" Y="0" />
<PointFrame FrameIndex="93" X="0" Y="0" />
<PointFrame FrameIndex="107" X="0" Y="0" />
<PointFrame FrameIndex="119" X="0" Y="0" />
<PointFrame FrameIndex="133" X="0" Y="0" />
<PointFrame FrameIndex="145" X="0" Y="0" />
<PointFrame FrameIndex="159" X="0" Y="0" />
<PointFrame FrameIndex="171" X="0" Y="0" />
<PointFrame FrameIndex="185" X="0" Y="0" />
<PointFrame FrameIndex="197" X="0" Y="0" />
<PointFrame FrameIndex="208" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836793" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="13" Value="True" />
</Timeline>
<Timeline ActionTag="898836793" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="13" X="0.5" Y="0.5" />
<PointFrame FrameIndex="15" X="0.5" Y="0.5" />
<PointFrame FrameIndex="18" X="0.5" Y="0.5" />
<PointFrame FrameIndex="19" X="0.5" Y="0.5" />
<PointFrame FrameIndex="23" X="0.5" Y="0.5" />
<PointFrame FrameIndex="55" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836792" FrameType="PositionFrame">
<PointFrame FrameIndex="13" X="-61" Y="-67.8" />
<PointFrame FrameIndex="15" X="-61" Y="-79.8" />
<PointFrame FrameIndex="18" X="-61" Y="-29.9" />
<PointFrame FrameIndex="19" X="-61" Y="-25.6" />
<PointFrame FrameIndex="23" Tween="False" X="-61" Y="-43.85" />
<PointFrame FrameIndex="55" Tween="False" X="-61" Y="-43.85" />
</Timeline>
<Timeline ActionTag="898836792" FrameType="ScaleFrame">
<PointFrame FrameIndex="13" X="1" Y="0.5951385" />
<PointFrame FrameIndex="15" X="1.11792" Y="0.344986" />
<PointFrame FrameIndex="18" X="1" Y="0.9878387" />
<PointFrame FrameIndex="19" X="0.8119507" Y="0.9878387" />
<PointFrame FrameIndex="23" Tween="False" X="1" Y="1" />
<PointFrame FrameIndex="55" Tween="False" X="1" Y="1" />
</Timeline>
<Timeline ActionTag="898836792" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="13" X="0" Y="0" />
<PointFrame FrameIndex="15" X="0" Y="0" />
<PointFrame FrameIndex="18" X="0" Y="0" />
<PointFrame FrameIndex="19" X="0" Y="0" />
<PointFrame FrameIndex="23" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="55" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836795" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="18" Value="True" />
</Timeline>
<Timeline ActionTag="898836795" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="18" X="0.5" Y="0.5" />
<PointFrame FrameIndex="21" X="0.5" Y="0.5" />
<PointFrame FrameIndex="24" X="0.5" Y="0.5" />
<PointFrame FrameIndex="25" X="0.5" Y="0.5" />
<PointFrame FrameIndex="29" X="0.5" Y="0.5" />
<PointFrame FrameIndex="55" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836794" FrameType="PositionFrame">
<PointFrame FrameIndex="18" X="46.65" Y="18.9" />
<PointFrame FrameIndex="21" X="44.5" Y="-66.7" />
<PointFrame FrameIndex="24" X="44.45" Y="-30.15" />
<PointFrame FrameIndex="25" X="44.5" Y="-30.15" />
<PointFrame FrameIndex="29" Tween="False" X="51" Y="-46.15" />
<PointFrame FrameIndex="55" Tween="False" X="51" Y="-46.15" />
</Timeline>
<Timeline ActionTag="898836794" FrameType="ScaleFrame">
<PointFrame FrameIndex="18" X="0.9158173" Y="0.9158173" />
<PointFrame FrameIndex="21" X="0.9158173" Y="0.4413452" />
<PointFrame FrameIndex="24" X="0.8587952" Y="1.015976" />
<PointFrame FrameIndex="25" X="0.7742767" Y="1.015976" />
<PointFrame FrameIndex="29" Tween="False" X="1" Y="1" />
<PointFrame FrameIndex="55" Tween="False" X="1" Y="1" />
</Timeline>
<Timeline ActionTag="898836794" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="18" X="0" Y="0" />
<PointFrame FrameIndex="21" X="0" Y="0" />
<PointFrame FrameIndex="24" X="0" Y="0" />
<PointFrame FrameIndex="25" X="0" Y="0" />
<PointFrame FrameIndex="29" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="55" Tween="False" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836797" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="73" Value="True" />
<BoolFrame FrameIndex="84" Value="False" />
<BoolFrame FrameIndex="98" Value="True" />
<BoolFrame FrameIndex="109" Value="False" />
</Timeline>
<Timeline ActionTag="898836797" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="73" X="0.5" Y="0.5" />
<PointFrame FrameIndex="83" X="0.5" Y="0.5" />
<PointFrame FrameIndex="98" X="0.5" Y="0.5" />
<PointFrame FrameIndex="108" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836796" FrameType="PositionFrame">
<PointFrame FrameIndex="73" X="23.15" Y="-66.75" />
<PointFrame FrameIndex="83" Tween="False" X="23.15" Y="-66.75" />
<PointFrame FrameIndex="98" X="-90.85" Y="-66.75" />
<PointFrame FrameIndex="108" X="-90.85" Y="-66.75" />
</Timeline>
<Timeline ActionTag="898836796" FrameType="ScaleFrame">
<PointFrame FrameIndex="73" X="1.759995" Y="1.759995" />
<PointFrame FrameIndex="83" Tween="False" X="1.759995" Y="1.759995" />
<PointFrame FrameIndex="98" X="1.759995" Y="1.759995" />
<PointFrame FrameIndex="108" X="1.759995" Y="1.759995" />
</Timeline>
<Timeline ActionTag="898836796" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="73" X="0" Y="0" />
<PointFrame FrameIndex="83" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="98" X="0" Y="0" />
<PointFrame FrameIndex="108" X="0" Y="0" />
</Timeline>
<Timeline ActionTag="898836799" FrameType="VisibleFrame">
<BoolFrame FrameIndex="0" Value="False" />
<BoolFrame FrameIndex="77" Value="True" />
<BoolFrame FrameIndex="93" Value="False" />
<BoolFrame FrameIndex="103" Value="True" />
<BoolFrame FrameIndex="117" Value="False" />
<BoolFrame FrameIndex="126" Value="True" />
<BoolFrame FrameIndex="132" Value="False" />
<BoolFrame FrameIndex="134" Value="True" />
<BoolFrame FrameIndex="142" Value="False" />
<BoolFrame FrameIndex="158" Value="True" />
<BoolFrame FrameIndex="164" Value="False" />
<BoolFrame FrameIndex="166" Value="True" />
<BoolFrame FrameIndex="174" Value="False" />
</Timeline>
<Timeline ActionTag="898836799" FrameType="AnchorPointFrame">
<PointFrame FrameIndex="77" X="0.5" Y="0.5" />
<PointFrame FrameIndex="82" X="0.5" Y="0.5" />
<PointFrame FrameIndex="85" X="0.5" Y="0.5" />
<PointFrame FrameIndex="92" X="0.5" Y="0.5" />
<PointFrame FrameIndex="103" X="0.5" Y="0.5" />
<PointFrame FrameIndex="107" X="0.5" Y="0.5" />
<PointFrame FrameIndex="111" X="0.5" Y="0.5" />
<PointFrame FrameIndex="116" X="0.5" Y="0.5" />
<PointFrame FrameIndex="126" X="0.5" Y="0.5" />
<PointFrame FrameIndex="131" X="0.5" Y="0.5" />
<PointFrame FrameIndex="134" X="0.5" Y="0.5" />
<PointFrame FrameIndex="141" X="0.5" Y="0.5" />
<PointFrame FrameIndex="158" X="0.5" Y="0.5" />
<PointFrame FrameIndex="163" X="0.5" Y="0.5" />
<PointFrame FrameIndex="166" X="0.5" Y="0.5" />
<PointFrame FrameIndex="173" X="0.5" Y="0.5" />
</Timeline>
<Timeline ActionTag="898836798" FrameType="PositionFrame">
<PointFrame FrameIndex="77" X="-90.8" Y="-32.55" />
<PointFrame FrameIndex="82" Tween="False" X="-33.75" Y="-32.5" />
<PointFrame FrameIndex="85" X="17.55" Y="-32.5" />
<PointFrame FrameIndex="92" Tween="False" X="80.2" Y="-69.6" />
<PointFrame FrameIndex="103" X="35.2" Y="-32.55" />
<PointFrame FrameIndex="107" X="35.2" Y="-32.55" />
<PointFrame FrameIndex="111" X="35.2" Y="-32.55" />
<PointFrame FrameIndex="116" X="89.2" Y="-32.55" />
<PointFrame FrameIndex="126" X="-90.8" Y="-32.55" />
<PointFrame FrameIndex="131" Tween="False" X="-33.75" Y="-32.5" />
<PointFrame FrameIndex="134" X="17.55" Y="-32.5" />
<PointFrame FrameIndex="141" Tween="False" X="80.2" Y="-69.6" />
<PointFrame FrameIndex="158" X="-90.8" Y="-32.55" />
<PointFrame FrameIndex="163" Tween="False" X="-33.75" Y="-32.5" />
<PointFrame FrameIndex="166" X="17.55" Y="-32.5" />
<PointFrame FrameIndex="173" Tween="False" X="80.2" Y="-69.6" />
</Timeline>
<Timeline ActionTag="898836798" FrameType="ScaleFrame">
<PointFrame FrameIndex="77" X="1.75708" Y="1.75708" />
<PointFrame FrameIndex="82" Tween="False" X="3.751648" Y="3.751648" />
<PointFrame FrameIndex="85" X="3.751648" Y="3.751648" />
<PointFrame FrameIndex="92" Tween="False" X="3.751709" Y="3.751709" />
<PointFrame FrameIndex="103" X="1.75708" Y="1.75708" />
<PointFrame FrameIndex="107" X="2.954834" Y="2.954834" />
<PointFrame FrameIndex="111" X="1.75708" Y="1.75708" />
<PointFrame FrameIndex="116" X="1.75708" Y="1.75708" />
<PointFrame FrameIndex="126" X="1.75708" Y="1.75708" />
<PointFrame FrameIndex="131" Tween="False" X="3.751648" Y="3.751648" />
<PointFrame FrameIndex="134" X="3.751648" Y="3.751648" />
<PointFrame FrameIndex="141" Tween="False" X="3.751709" Y="3.751709" />
<PointFrame FrameIndex="158" X="1.75708" Y="1.75708" />
<PointFrame FrameIndex="163" Tween="False" X="3.751648" Y="3.751648" />
<PointFrame FrameIndex="166" X="3.751648" Y="3.751648" />
<PointFrame FrameIndex="173" Tween="False" X="3.751709" Y="3.751709" />
</Timeline>
<Timeline ActionTag="898836798" FrameType="RotationSkewFrame">
<PointFrame FrameIndex="77" X="0" Y="0" />
<PointFrame FrameIndex="82" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="85" X="0" Y="0" />
<PointFrame FrameIndex="92" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="103" X="0" Y="0" />
<PointFrame FrameIndex="107" X="0" Y="0" />
<PointFrame FrameIndex="111" X="0" Y="0" />
<PointFrame FrameIndex="116" X="0" Y="0" />
<PointFrame FrameIndex="126" X="0" Y="0" />
<PointFrame FrameIndex="131" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="134" X="0" Y="0" />
<PointFrame FrameIndex="141" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="158" X="0" Y="0" />
<PointFrame FrameIndex="163" Tween="False" X="0" Y="0" />
<PointFrame FrameIndex="166" X="0" Y="0" />
<PointFrame FrameIndex="173" Tween="False" X="0" Y="0" />
</Timeline>
</Animation>
<ObjectData Name="fx_vic" CanEdit="False" FrameEvent="">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="sheng" ActionTag="-663741931" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="3.15" Y="-19.7" />
<Scale ScaleX="10.93921" ScaleY="10.93921" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
</NodeObjectData>
<NodeObjectData Name="li" ActionTag="-663741929" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="3.15" Y="-19.7" />
<Scale ScaleX="10.93921" ScaleY="10.93921" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
</NodeObjectData>
<NodeObjectData Name="liangguang" ActionTag="-663741927" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="3.15" Y="-19.7" />
<Scale ScaleX="10.93921" ScaleY="10.93921" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
</NodeObjectData>
<NodeObjectData Name="liangdian" ActionTag="-663741925" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="3.15" Y="-19.7" />
<Scale ScaleX="10.93921" ScaleY="10.93921" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
</NodeObjectData>
<NodeObjectData Name="liangdian2" ActionTag="-663741923" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-12" Y="-58.05" />
<Scale ScaleX="8.490906" ScaleY="8.490906" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
</NodeObjectData>
<NodeObjectData Name="liangdian3" ActionTag="898836668" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-7.65" Y="-53.1" />
<Scale ScaleX="5.513123" ScaleY="5.513123" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
</NodeObjectData>
<NodeObjectData Name="b02" ActionTag="898836670" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-7.65" Y="-53.1" />
<Scale ScaleX="5.513123" ScaleY="5.513123" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
</NodeObjectData>
<NodeObjectData Name="g04" ActionTag="898836672" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-3.8" Y="-41.3" />
<Scale ScaleX="3.483139" ScaleY="3.483139" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836673" Alpha="0" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="160" Y="160" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/g02(25)_00000.png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="youjian" ActionTag="898836701" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="1.45" Y="-36.65" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836702" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="318" Y="302" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/youjian.png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="zuojian" ActionTag="898836703" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-4.85" Y="-36.65" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836704" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="318" Y="302" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/zuojian.png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="qizi0" ActionTag="898836705" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-8.85" Y="-225.2" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836706" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="238" Y="262" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/qz_00000.png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="qizi1" ActionTag="898836707" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-8.1" Y="-234.35" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836729" VisibleForFrame="False" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.4996904" ScaleY="0.5002652" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="323" Y="377" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/lanqizi.png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="b02(50)" ActionTag="898836730" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-1.7" Y="-31.8" />
<Scale ScaleX="2.58902" ScaleY="2.58902" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836731" VisibleForFrame="False" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="300" Y="150" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/b02(50).png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="b02(50)0" ActionTag="898836732" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-1.7" Y="-31.8" />
<Scale ScaleX="2.58902" ScaleY="2.58902" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836733" Alpha="0" VisibleForFrame="False" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="300" Y="150" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/b02(50).png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="hei" ActionTag="898836734" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-1.7" Y="-31.8" />
<Scale ScaleX="2.58902" ScaleY="2.58902" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836735" Alpha="0" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="300" Y="150" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/b02(50).png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="g07_00000" ActionTag="898836736" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-1.7" Y="-31.8" />
<Scale ScaleX="2.58902" ScaleY="2.58902" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836737" Alpha="0" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="300" Y="150" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/b02(50).png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="youjian0" ActionTag="898836738" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-1.7" Y="-31.8" />
<Scale ScaleX="2.58902" ScaleY="2.58902" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836760" Alpha="0" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="300" Y="150" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/b02(50).png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="zuojian0" ActionTag="898836761" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-1.7" Y="-31.8" />
<Scale ScaleX="2.58902" ScaleY="2.58902" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836762" Alpha="0" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="300" Y="150" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/b02(50).png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="canying3" ActionTag="898836763" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-10.9" Y="-29.3" />
<Scale ScaleX="1.637009" ScaleY="1.637009" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836764" VisibleForFrame="False" FrameEvent="" ctype="SpriteObjectData">
<Position X="22.90787" Y="28.19426" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="350" Y="150" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/b01(50).png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="canying2" ActionTag="898836765" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-7.95" Y="-30.8" />
<Scale ScaleX="1.018005" ScaleY="1.018005" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836766" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5002404" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="454" Y="208" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/1.png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="canying1" ActionTag="898836767" FrameEvent="show_end" ctype="SingleNodeObjectData">
<Position X="172.05" Y="-93.45" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836768" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="140" Y="140" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/g05(25)_00000_00000.png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="qizi20" ActionTag="898836769" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-178.95" Y="-79.8" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836791" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="140" Y="140" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/g05(25)_00000_00000.png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="g01_00000" ActionTag="898836792" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-61" Y="-43.85" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836793" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="184" Y="182" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/sheng.png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="g02_00000" ActionTag="898836794" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="51" Y="-46.15" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836795" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="183" Y="181" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/li.png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="g" ActionTag="898836796" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="-90.85" Y="-66.75" />
<Scale ScaleX="1.759995" ScaleY="1.759995" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836797" VisibleForFrame="False" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="60" Y="60" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/x(50).png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="g03_00000" ActionTag="898836798" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="80.2" Y="-69.6" />
<Scale ScaleX="3.751709" ScaleY="3.751709" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<Children>
<NodeObjectData Name="SpriteObject" ActionTag="898836799" VisibleForFrame="False" FrameEvent="" ctype="SpriteObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="60" Y="60" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
<FileData Type="Normal" Path="fx_vic_png/x(50).png" />
</NodeObjectData>
</Children>
</NodeObjectData>
<NodeObjectData Name="lable" ActionTag="898836800" FrameEvent="" ctype="SingleNodeObjectData">
<Position X="0" Y="0" />
<Scale ScaleX="1" ScaleY="1" />
<AnchorPoint ScaleX="0.5" ScaleY="0.5" />
<CColor A="255" R="255" G="255" B="255" />
<Size X="0" Y="0" />
<PrePosition X="0" Y="0" />
<PreSize X="0" Y="0" />
</NodeObjectData>
</Children>
</ObjectData>
</Content>
</Content>
</GameProjectFile> | Csound | 4 | chukong/CocosStudioSamples | DemoMicroCardGame/CocosStudioResources/cocosstudio/fx_vic.csd | [
"MIT"
]
|
untyped
global function GamemodeAITdm_Init
const SQUADS_PER_TEAM = 3
const REAPERS_PER_TEAM = 2
const LEVEL_SPECTRES = 125
const LEVEL_STALKERS = 380
const LEVEL_REAPERS = 500
struct
{
// Due to team based escalation everything is an array
array< int > levels = [ LEVEL_SPECTRES, LEVEL_SPECTRES ]
array< array< string > > podEntities = [ [ "npc_soldier" ], [ "npc_soldier" ] ]
array< bool > reapers = [ false, false ]
} file
void function GamemodeAITdm_Init()
{
SetSpawnpointGamemodeOverride( ATTRITION ) // use bounty hunt spawns as vanilla game has no spawns explicitly defined for aitdm
AddCallback_GameStateEnter( eGameState.Prematch, OnPrematchStart )
AddCallback_GameStateEnter( eGameState.Playing, OnPlaying )
AddCallback_OnNPCKilled( HandleScoreEvent )
AddCallback_OnPlayerKilled( HandleScoreEvent )
AddCallback_OnClientConnected( OnPlayerConnected )
AddCallback_NPCLeeched( OnSpectreLeeched )
if ( GetCurrentPlaylistVarInt( "aitdm_archer_grunts", 0 ) == 0 )
{
AiGameModes_SetGruntWeapons( [ "mp_weapon_rspn101", "mp_weapon_dmr", "mp_weapon_r97", "mp_weapon_lmg" ] )
AiGameModes_SetSpectreWeapons( [ "mp_weapon_hemlok_smg", "mp_weapon_doubletake", "mp_weapon_mastiff" ] )
}
else
{
AiGameModes_SetGruntWeapons( [ "mp_weapon_rocket_launcher" ] )
AiGameModes_SetSpectreWeapons( [ "mp_weapon_rocket_launcher" ] )
}
ScoreEvent_SetupEarnMeterValuesForMixedModes()
}
// Starts skyshow, this also requiers AINs but doesn't crash if they're missing
void function OnPrematchStart()
{
thread StratonHornetDogfightsIntense()
}
void function OnPlaying()
{
// don't run spawning code if ains and nms aren't up to date
if ( GetAINScriptVersion() == AIN_REV && GetNodeCount() != 0 )
{
thread SpawnIntroBatch_Threaded( TEAM_MILITIA )
thread SpawnIntroBatch_Threaded( TEAM_IMC )
}
}
// Sets up mode specific hud on client
void function OnPlayerConnected( entity player )
{
Remote_CallFunction_NonReplay( player, "ServerCallback_AITDM_OnPlayerConnected" )
}
// Used to handle both player and ai events
void function HandleScoreEvent( entity victim, entity attacker, var damageInfo )
{
// Basic checks
if ( victim == attacker || !( attacker.IsPlayer() || attacker.IsTitan() ) || GetGameState() != eGameState.Playing )
return
// Hacked spectre filter
if ( victim.GetOwner() == attacker )
return
// Split score so we can check if we are over the score max
// without showing the wrong value on client
int teamScore
int playerScore
string eventName
// Handle AI, marvins aren't setup so we check for them to prevent crash
if ( victim.IsNPC() && victim.GetClassName() != "npc_marvin" )
{
switch ( victim.GetClassName() )
{
case "npc_soldier":
case "npc_spectre":
case "npc_stalker":
playerScore = 1
break
case "npc_super_spectre":
playerScore = 3
break
default:
playerScore = 0
break
}
// Titan kills get handled bellow this
if ( eventName != "KillNPCTitan" && eventName != "" )
playerScore = ScoreEvent_GetPointValue( GetScoreEvent( eventName ) )
}
if ( victim.IsPlayer() )
playerScore = 5
// Player ejecting triggers this without the extra check
if ( victim.IsTitan() && victim.GetBossPlayer() != attacker )
playerScore += 10
teamScore = playerScore
// Check score so we dont go over max
if ( GameRules_GetTeamScore(attacker.GetTeam()) + teamScore > GetScoreLimit_FromPlaylist() )
teamScore = GetScoreLimit_FromPlaylist() - GameRules_GetTeamScore(attacker.GetTeam())
// Add score + update network int to trigger the "Score +n" popup
AddTeamScore( attacker.GetTeam(), teamScore )
attacker.AddToPlayerGameStat( PGS_ASSAULT_SCORE, playerScore )
attacker.SetPlayerNetInt("AT_bonusPoints", attacker.GetPlayerGameStat( PGS_ASSAULT_SCORE ) )
}
// When attrition starts both teams spawn ai on preset nodes, after that
// Spawner_Threaded is used to keep the match populated
void function SpawnIntroBatch_Threaded( int team )
{
array<entity> dropPodNodes = GetEntArrayByClass_Expensive( "info_spawnpoint_droppod_start" )
array<entity> dropShipNodes = GetValidIntroDropShipSpawn( dropPodNodes )
array<entity> podNodes
array<entity> shipNodes
// mp_rise has weird droppod_start nodes, this gets around it
// To be more specific the teams aren't setup and some nodes are scattered in narnia
if( GetMapName() == "mp_rise" )
{
entity spawnPoint
// Get a spawnpoint for team
foreach ( point in GetEntArrayByClass_Expensive( "info_spawnpoint_dropship_start" ) )
{
if ( point.HasKey( "gamemode_tdm" ) )
if ( point.kv[ "gamemode_tdm" ] == "0" )
continue
if ( point.GetTeam() == team )
{
spawnPoint = point
break
}
}
// Get nodes close enough to team spawnpoint
foreach ( node in dropPodNodes )
{
if ( node.HasKey("teamnum") && Distance2D( node.GetOrigin(), spawnPoint.GetOrigin()) < 2000 )
podNodes.append( node )
}
}
else
{
// Sort per team
foreach ( node in dropPodNodes )
{
if ( node.GetTeam() == team )
podNodes.append( node )
}
}
shipNodes = GetValidIntroDropShipSpawn( podNodes )
// Spawn logic
int startIndex = 0
bool first = true
entity node
int pods = RandomInt( podNodes.len() + 1 )
int ships = shipNodes.len()
for ( int i = 0; i < SQUADS_PER_TEAM; i++ )
{
if ( pods != 0 || ships == 0 )
{
int index = i
if ( index > podNodes.len() - 1 )
index = RandomInt( podNodes.len() )
node = podNodes[ index ]
thread AiGameModes_SpawnDropPod( node.GetOrigin(), node.GetAngles(), team, "npc_soldier", SquadHandler )
pods--
}
else
{
if ( startIndex == 0 )
startIndex = i // save where we started
node = shipNodes[ i - startIndex ]
thread AiGameModes_SpawnDropShip( node.GetOrigin(), node.GetAngles(), team, 4, SquadHandler )
ships--
}
// Vanilla has a delay after first spawn
if ( first )
wait 2
first = false
}
wait 15
thread Spawner_Threaded( team )
}
// Populates the match
void function Spawner_Threaded( int team )
{
svGlobal.levelEnt.EndSignal( "GameStateChanged" )
// used to index into escalation arrays
int index = team == TEAM_MILITIA ? 0 : 1
while( true )
{
Escalate( team )
// TODO: this should possibly not count scripted npc spawns, probably only the ones spawned by this script
array<entity> npcs = GetNPCArrayOfTeam( team )
int count = npcs.len()
int reaperCount = GetNPCArrayEx( "npc_super_spectre", team, -1, <0,0,0>, -1 ).len()
// REAPERS
if ( file.reapers[ index ] )
{
array< entity > points = SpawnPoints_GetDropPod()
if ( reaperCount < REAPERS_PER_TEAM )
{
entity node = points[ GetSpawnPointIndex( points, team ) ]
waitthread AiGameModes_SpawnReaper( node.GetOrigin(), node.GetAngles(), team, "npc_super_spectre_aitdm", ReaperHandler )
}
}
// NORMAL SPAWNS
if ( count < SQUADS_PER_TEAM * 4 - 2 )
{
string ent = file.podEntities[ index ][ RandomInt( file.podEntities[ index ].len() ) ]
array< entity > points = GetZiplineDropshipSpawns()
// Prefer dropship when spawning grunts
if ( ent == "npc_soldier" && points.len() != 0 )
{
if ( RandomInt( points.len() ) )
{
entity node = points[ GetSpawnPointIndex( points, team ) ]
waitthread AiGameModes_SpawnDropShip( node.GetOrigin(), node.GetAngles(), team, 4, SquadHandler )
continue
}
}
points = SpawnPoints_GetDropPod()
entity node = points[ GetSpawnPointIndex( points, team ) ]
waitthread AiGameModes_SpawnDropPod( node.GetOrigin(), node.GetAngles(), team, ent, SquadHandler )
}
WaitFrame()
}
}
// Based on points tries to balance match
void function Escalate( int team )
{
int score = GameRules_GetTeamScore( team )
int index = team == TEAM_MILITIA ? 1 : 0
// This does the "Enemy x incoming" text
string defcon = team == TEAM_MILITIA ? "IMCdefcon" : "MILdefcon"
// Return if the team is under score threshold to escalate
if ( score < file.levels[ index ] || file.reapers[ index ] )
return
// Based on score escalate a team
switch ( file.levels[ index ] )
{
case LEVEL_SPECTRES:
file.levels[ index ] = LEVEL_STALKERS
file.podEntities[ index ].append( "npc_spectre" )
SetGlobalNetInt( defcon, 2 )
return
case LEVEL_STALKERS:
file.levels[ index ] = LEVEL_REAPERS
file.podEntities[ index ].append( "npc_stalker" )
SetGlobalNetInt( defcon, 3 )
return
case LEVEL_REAPERS:
file.reapers[ index ] = true
SetGlobalNetInt( defcon, 4 )
return
}
unreachable // hopefully
}
// Decides where to spawn ai
// Each team has their "zone" where they and their ai spawns
// These zones should swap based on which team is dominating where
int function GetSpawnPointIndex( array< entity > points, int team )
{
entity zone = DecideSpawnZone_Generic( points, team )
if ( IsValid( zone ) )
{
// 20 Tries to get a random point close to the zone
for ( int i = 0; i < 20; i++ )
{
int index = RandomInt( points.len() )
if ( Distance2D( points[ index ].GetOrigin(), zone.GetOrigin() ) < 6000 )
return index
}
}
return RandomInt( points.len() )
}
// tells infantry where to go
// In vanilla there seem to be preset paths ai follow to get to the other teams vone and capture it
// AI can also flee deeper into their zone suggesting someone spent way too much time on this
void function SquadHandler( array<entity> guys )
{
// Not all maps have assaultpoints / have weird assault points ( looking at you ac )
// So we use enemies with a large radius
array< entity > points = GetNPCArrayOfEnemies( guys[0].GetTeam() )
if ( points.len() == 0 )
return
vector point
point = points[ RandomInt( points.len() ) ].GetOrigin()
array<entity> players = GetPlayerArrayOfEnemies( guys[0].GetTeam() )
// Setup AI
foreach ( guy in guys )
{
guy.EnableNPCFlag( NPC_ALLOW_PATROL | NPC_ALLOW_INVESTIGATE | NPC_ALLOW_HAND_SIGNALS | NPC_ALLOW_FLEE )
guy.AssaultPoint( point )
guy.AssaultSetGoalRadius( 1600 ) // 1600 is minimum for npc_stalker, works fine for others
// show on enemy radar
foreach ( player in players )
guy.Minimap_AlwaysShow( 0, player )
//thread AITdm_CleanupBoredNPCThread( guy )
}
// Every 5 - 15 secs change AssaultPoint
while ( true )
{
foreach ( guy in guys )
{
// Check if alive
if ( !IsAlive( guy ) )
{
guys.removebyvalue( guy )
continue
}
// Stop func if our squad has been killed off
if ( guys.len() == 0 )
return
// Get point and send guy to it
points = GetNPCArrayOfEnemies( guy.GetTeam() )
if ( points.len() == 0 )
continue
point = points[ RandomInt( points.len() ) ].GetOrigin()
guy.AssaultPoint( point )
}
wait RandomFloatRange(5.0,15.0)
}
}
// Award for hacking
void function OnSpectreLeeched( entity spectre, entity player )
{
// Set Owner so we can filter in HandleScore
spectre.SetOwner( player )
// Add score + update network int to trigger the "Score +n" popup
AddTeamScore( player.GetTeam(), 1 )
player.AddToPlayerGameStat( PGS_ASSAULT_SCORE, 1 )
player.SetPlayerNetInt("AT_bonusPoints", player.GetPlayerGameStat( PGS_ASSAULT_SCORE ) )
}
// Same as SquadHandler, just for reapers
void function ReaperHandler( entity reaper )
{
array<entity> players = GetPlayerArrayOfEnemies( reaper.GetTeam() )
foreach ( player in players )
reaper.Minimap_AlwaysShow( 0, player )
reaper.AssaultSetGoalRadius( 500 )
// Every 10 - 20 secs get a player and go to him
// Definetly not annoying or anything :)
while( IsAlive( reaper ) )
{
players = GetPlayerArrayOfEnemies( reaper.GetTeam() )
if ( players.len() != 0 )
{
entity player = GetClosest2D( players, reaper.GetOrigin() )
reaper.AssaultPoint( player.GetOrigin() )
}
wait RandomFloatRange(10.0,20.0)
}
// thread AITdm_CleanupBoredNPCThread( reaper )
}
// Currently unused as this is handled by SquadHandler
// May need to use this if my implementation falls apart
void function AITdm_CleanupBoredNPCThread( entity guy )
{
// track all ai that we spawn, ensure that they're never "bored" (i.e. stuck by themselves doing fuckall with nobody to see them) for too long
// if they are, kill them so we can free up slots for more ai to spawn
// we shouldn't ever kill ai if players would notice them die
// NOTE: this partially covers up for the fact that we script ai alot less than vanilla probably does
// vanilla probably messes more with making ai assaultpoint to fights when inactive and stuff like that, we don't do this so much
guy.EndSignal( "OnDestroy" )
wait 15.0 // cover spawning time from dropship/pod + before we start cleaning up
int cleanupFailures = 0 // when this hits 2, cleanup the npc
while ( cleanupFailures < 2 )
{
wait 10.0
if ( guy.GetParent() != null )
continue // never cleanup while spawning
array<entity> otherGuys = GetPlayerArray()
otherGuys.extend( GetNPCArrayOfTeam( GetOtherTeam( guy.GetTeam() ) ) )
bool failedChecks = false
foreach ( entity otherGuy in otherGuys )
{
// skip dead people
if ( !IsAlive( otherGuy ) )
continue
failedChecks = false
// don't kill if too close to anything
if ( Distance( otherGuy.GetOrigin(), guy.GetOrigin() ) < 2000.0 )
break
// don't kill if ai or players can see them
if ( otherGuy.IsPlayer() )
{
if ( PlayerCanSee( otherGuy, guy, true, 135 ) )
break
}
else
{
if ( otherGuy.CanSee( guy ) )
break
}
// don't kill if they can see any ai
if ( guy.CanSee( otherGuy ) )
break
failedChecks = true
}
if ( failedChecks )
cleanupFailures++
else
cleanupFailures--
}
print( "cleaning up bored npc: " + guy + " from team " + guy.GetTeam() )
guy.Destroy()
} | Squirrel | 5 | Orpheus2401/NorthstarMods | Northstar.CustomServers/mod/scripts/vscripts/gamemodes/_gamemode_aitdm.nut | [
"MIT"
]
|
/* Copyright 2019 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
==============================================================================*/
#include <array>
#include "tensorflow/compiler/tf2xla/mlir_xla_op_kernel.h"
#include "tensorflow/compiler/tf2xla/xla_helpers.h"
#include "tensorflow/compiler/tf2xla/xla_op_kernel.h"
#include "tensorflow/compiler/tf2xla/xla_op_registry.h"
#include "tensorflow/compiler/xla/client/lib/matrix.h"
#include "tensorflow/compiler/xla/client/xla_builder.h"
#include "tensorflow/core/framework/op_kernel.h"
namespace tensorflow {
namespace {
constexpr std::array<DataType, 9> kEinsumTypes = {
{DT_INT32, DT_INT64, DT_UINT64, DT_HALF, DT_BFLOAT16, DT_FLOAT, DT_DOUBLE,
DT_COMPLEX64, DT_COMPLEX128}};
REGISTER_XLA_OP(Name("XlaEinsum").TypeConstraint("T", kEinsumTypes),
MlirXlaOpKernel);
REGISTER_XLA_OP(Name("Einsum").TypeConstraint("T", kEinsumTypes),
MlirXlaOpKernel);
} // namespace
} // namespace tensorflow
| C++ | 4 | EricRemmerswaal/tensorflow | tensorflow/compiler/tf2xla/kernels/einsum_op.cc | [
"Apache-2.0"
]
|
/*
Bulllord Game Engine
Copyright (C) 2010-2017 Trix
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software
in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
*/
#include "internal/gpucommon.h"
#if defined(BL_GL_BACKEND)
#include "internal/gpugl.h"
#elif defined(BL_DX_BACKEND)
#include "internal/gpudx.h"
#elif defined(BL_VK_BACKEND)
#include "internal/gpuvk.h"
#elif defined(BL_MTL_BACKEND)
#include "internal/gpumtl.h"
#endif
#if defined(BL_PLATFORM_OSX)
# include <AppKit/NSOpenGL.h>
# include <AppKit/NSApplication.h>
#elif defined(BL_PLATFORM_IOS)
# include <UIKit/UIKit.h>
# include <OpenGLES/EAGLDrawable.h>
#endif
static void
_AllocUBO(_BLUniformBuffer* _UBO)
{
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
GL_CHECK_INTERNAL(glGenBuffers(1, &_UBO->uData.sGL.nHandle));
GL_CHECK_INTERNAL(glBindBuffer(GL_UNIFORM_BUFFER, _UBO->uData.sGL.nHandle));
GL_CHECK_INTERNAL(glBufferData(GL_UNIFORM_BUFFER, _UBO->nSize, NULL, GL_DYNAMIC_DRAW));
GL_CHECK_INTERNAL(glBindBufferBase(GL_UNIFORM_BUFFER, 0, _UBO->uData.sGL.nHandle));
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
}
static void
_FreeUBO(_BLUniformBuffer* _UBO)
{
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
GL_CHECK_INTERNAL(glBindBuffer(GL_UNIFORM_BUFFER, 0));
GL_CHECK_INTERNAL(glDeleteBuffers(1, &_UBO->uData.sGL.nHandle));
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
}
static void
_PipelineStateRefresh()
{
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
_PipelineStateRefreshGL();
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
_PipelineStateRefreshMTL();
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
_PipelineStateRefreshVK();
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
_PipelineStateRefreshDX();
#endif
}
#if defined(BL_PLATFORM_WIN32)
BLVoid
_GpuIntervention(HWND _Hwnd, BLU32 _Width, BLU32 _Height, BLBool _Vsync)
{
_PrGpuMem = (_BLGpuMember*)malloc(sizeof(_BLGpuMember));
_PrGpuMem->bVsync = _Vsync;
_PrGpuMem->sHardwareCaps.bCSSupport = FALSE;
_PrGpuMem->sHardwareCaps.bGSSupport = TRUE;
_PrGpuMem->sHardwareCaps.bAnisotropy = FALSE;
_PrGpuMem->sHardwareCaps.bTSSupport = FALSE;
_PrGpuMem->sHardwareCaps.bFloatRTSupport = FALSE;
_PrGpuMem->sHardwareCaps.fMaxAnisotropy = 0.f;
_PrGpuMem->pTextureCache = blGenDict(TRUE);
_PrGpuMem->pBufferCache = blGenDict(TRUE);
_PrGpuMem->pTechCache = blGenDict(TRUE);
_PrGpuMem->pUBO = (_BLUniformBuffer*)malloc(sizeof(_BLUniformBuffer));
_PrGpuMem->pUBO->nSize = 0;
for (BLU32 _idx = 0; _idx < BL_TF_COUNT; ++_idx)
_PrGpuMem->sHardwareCaps.aTexFormats[_idx] = TRUE;
BLBool _vkinited = FALSE;
if (_vkinited)
{
_PrGpuMem->sHardwareCaps.eApiType = BL_VULKAN_API;
}
else
{
_PrGpuMem->sHardwareCaps.eApiType = BL_GL_API;
_PrGpuMem->sGLHDC = GetDC(_Hwnd);
PIXELFORMATDESCRIPTOR _pfd;
memset(&_pfd, 0, sizeof(_pfd));
_pfd.nSize = sizeof(_pfd);
_pfd.nVersion = 1;
_pfd.dwFlags = PFD_DRAW_TO_WINDOW | PFD_SUPPORT_OPENGL | PFD_DOUBLEBUFFER;
_pfd.iPixelType = PFD_TYPE_RGBA;
_pfd.cColorBits = 32;
_pfd.cDepthBits = 24;
_pfd.cStencilBits = 8;
_pfd.iLayerType = PFD_MAIN_PLANE;
BLS32 _pf = ChoosePixelFormat(_PrGpuMem->sGLHDC, &_pfd);
assert(_pf != 0);
SetPixelFormat(_PrGpuMem->sGLHDC, _pf, &_pfd);
_PrGpuMem->sGLRC = wglCreateContext(_PrGpuMem->sGLHDC);
wglMakeCurrent(_PrGpuMem->sGLHDC, _PrGpuMem->sGLRC);
HMODULE _lib = LoadLibraryW(L"opengl32.dll");
GL_LOAD_INTERNAL(_lib);
GL_SYMBOL_INTERNAL(PFNWGLCREATECONTEXTATTRIBSARBPROC, wglCreateContextAttribsARB, _lib);
GL_SYMBOL_INTERNAL(PFNWGLSWAPINTERVALEXTPROC, wglSwapIntervalEXT, _lib);
FreeLibrary(_lib);
BLS32 _versions[5][2] =
{
{ 4 , 5 },
{ 4 , 4 },
{ 4 , 3 },
{ 4 , 2 },
{ 4 , 1 }
};
BLS32 _attribus[] =
{
WGL_CONTEXT_MAJOR_VERSION_ARB, 4,
WGL_CONTEXT_MINOR_VERSION_ARB, 5,
WGL_CONTEXT_PROFILE_MASK_ARB, WGL_CONTEXT_CORE_PROFILE_BIT_ARB,
0
};
for (BLS32 _idx = 0; _idx < 5 ; ++_idx)
{
_attribus[1] = _versions[_idx][0];
_attribus[3] = _versions[_idx][1];
HGLRC _hwgl = wglCreateContextAttribsARB(_PrGpuMem->sGLHDC, 0, _attribus);
if (_hwgl)
{
wglMakeCurrent(_PrGpuMem->sGLHDC, 0);
wglDeleteContext(_PrGpuMem->sGLRC);
_PrGpuMem->sGLRC = _hwgl;
wglMakeCurrent(_PrGpuMem->sGLHDC, _PrGpuMem->sGLRC);
_PrGpuMem->sHardwareCaps.nApiVersion = _attribus[1] * 100 + _attribus[3] * 10;
break;
}
}
if (_PrGpuMem->bVsync)
wglSwapIntervalEXT(1);
else if (!_PrGpuMem->bVsync)
wglSwapIntervalEXT(0);
_PrGpuMem->sHardwareCaps.aTexFormats[BL_TF_ASTC] = _TextureFormatValidGL(GL_COMPRESSED_RGBA_ASTC_4x4_KHR, GL_ZERO, GL_ZERO, 8) && _TextureFormatValidGL(GL_COMPRESSED_SRGB8_ALPHA8_ASTC_4x4_KHR, GL_ZERO, GL_ZERO, 8);
GLint _extensions = 0;
GL_CHECK_INTERNAL(glGetIntegerv(GL_NUM_EXTENSIONS, &_extensions));
for (GLint _idx = 0; _idx < _extensions; ++_idx)
{
const BLAnsi* _name = (const BLAnsi*)glGetStringi(GL_EXTENSIONS, _idx);
if (!strcmp(_name, "GL_EXT_texture_filter_anisotropic"))
{
GL_CHECK_INTERNAL(glGetFloatv(GL_MAX_TEXTURE_MAX_ANISOTROPY_EXT, &_PrGpuMem->sHardwareCaps.fMaxAnisotropy));
}
}
_PipelineStateDefaultGL(_Width, _Height);
}
}
BLVoid
_GpuSwapBuffer()
{
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
else
{
::SwapBuffers(_PrGpuMem->sGLHDC);
}
}
BLVoid
_GpuAnitIntervention(HWND _Hwnd)
{
_FreeUBO(_PrGpuMem->pUBO);
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
else
{
wglMakeCurrent(_PrGpuMem->sGLHDC, 0);
wglDeleteContext(_PrGpuMem->sGLRC);
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pTextureCache)
{
_BLTextureBuffer* _tex = (_BLTextureBuffer*)_iter->pRes;
blDebugOutput("detected texture resource leak: hash>%u", URIPART_INTERNAL(_tex->nID));
}
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pBufferCache)
{
_BLGeometryBuffer* _geo = (_BLGeometryBuffer*)_iter->pRes;
blDebugOutput("detected geometry buffer resource leak: hash>%u", URIPART_INTERNAL(_geo->nID));
}
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pTechCache)
{
_BLTechnique* _tech = (_BLTechnique*)_iter->pRes;
blDebugOutput("detected technique resource leak: hash>%u", URIPART_INTERNAL(_tech->nID));
}
}
blDeleteDict(_PrGpuMem->pTechCache);
blDeleteDict(_PrGpuMem->pTextureCache);
blDeleteDict(_PrGpuMem->pBufferCache);
free(_PrGpuMem->pUBO);
free(_PrGpuMem);
}
#elif defined(BL_PLATFORM_UWP)
BLVoid
_GpuIntervention(Windows::UI::Core::CoreWindow^ _Hwnd, BLU32 _Width, BLU32 _Height, BLBool _Vsync)
{
_PrGpuMem = new _BLGpuMember;
_PrGpuMem->bVsync = _Vsync;
_PrGpuMem->sHardwareCaps.bCSSupport = TRUE;
_PrGpuMem->sHardwareCaps.bGSSupport = TRUE;
_PrGpuMem->sHardwareCaps.bAnisotropy = TRUE;
_PrGpuMem->sHardwareCaps.bTSSupport = TRUE;
_PrGpuMem->sHardwareCaps.bFloatRTSupport = TRUE;
_PrGpuMem->sHardwareCaps.fMaxAnisotropy = 0.f;
_PrGpuMem->pTextureCache = blGenDict(TRUE);
_PrGpuMem->pBufferCache = blGenDict(TRUE);
_PrGpuMem->pTechCache = blGenDict(TRUE);
_PrGpuMem->nSyncInterval = _Vsync ? 60 : 1;
_PrGpuMem->aBackBufferFence[0] = 0;
_PrGpuMem->aBackBufferFence[1] = 0;
_PrGpuMem->aBackBufferFence[2] = 0;
_PrGpuMem->aBackBufferFence[3] = 0;
_PrGpuMem->pUBO = new _BLUniformBuffer;
_PrGpuMem->pUBO->nSize = 0;
for (BLU32 _idx = 0; _idx < BL_TF_COUNT; ++_idx)
_PrGpuMem->sHardwareCaps.aTexFormats[_idx] = TRUE;
_PrGpuMem->sHardwareCaps.eApiType = BL_DX_API;
_PrGpuMem->sHardwareCaps.aTexFormats[BL_TF_ASTC] = FALSE;
IDXGIFactory5* _factory;
UINT _dxgifactoryflags = 0;
#if defined(_DEBUG)
ID3D12Debug* _debugcontroller;
if (SUCCEEDED(D3D12GetDebugInterface(IID_PPV_ARGS(&_debugcontroller))))
{
_debugcontroller->EnableDebugLayer();
_dxgifactoryflags |= DXGI_CREATE_FACTORY_DEBUG;
}
#endif
DX_CHECK_INTERNAL(CreateDXGIFactory2(_dxgifactoryflags, IID_PPV_ARGS(&_factory)));
D3D_FEATURE_LEVEL _flvl[4] = { D3D_FEATURE_LEVEL_12_1, D3D_FEATURE_LEVEL_12_0, D3D_FEATURE_LEVEL_11_1, D3D_FEATURE_LEVEL_11_0 };
for (BLU32 _i = 0; _i < 4; ++_i)
{
IDXGIAdapter1* _adapter;
for (UINT _j = 0; DXGI_ERROR_NOT_FOUND != _factory->EnumAdapters1(_j, &_adapter); ++_j)
{
DXGI_ADAPTER_DESC1 _desc;
_adapter->GetDesc1(&_desc);
if (_desc.Flags & DXGI_ADAPTER_FLAG_SOFTWARE)
continue;
if (SUCCEEDED(D3D12CreateDevice(_adapter, _flvl[_i], _uuidof(ID3D12Device), nullptr)))
break;
}
if (SUCCEEDED(D3D12CreateDevice(_adapter, _flvl[_i], IID_PPV_ARGS(&_PrGpuMem->pDX))))
{
_adapter->Release();
break;
}
}
DXGI_SWAP_CHAIN_DESC1 _scdesc = {};
_scdesc.BufferCount = 4;
_scdesc.Stereo = 0;
_scdesc.Width = _Width;
_scdesc.Height = _Height;
_scdesc.Format = DXGI_FORMAT_R8G8B8A8_UNORM;
_scdesc.BufferUsage = DXGI_USAGE_RENDER_TARGET_OUTPUT;
_scdesc.SwapEffect = DXGI_SWAP_EFFECT_FLIP_SEQUENTIAL;
_scdesc.Scaling = DXGI_SCALING_STRETCH;
_scdesc.Flags = DXGI_SWAP_CHAIN_FLAG_ALLOW_MODE_SWITCH;
_scdesc.SampleDesc.Count = 1;
_scdesc.SampleDesc.Quality = 0;
IDXGISwapChain1* _tmpsc;
DX_CHECK_INTERNAL(_factory->CreateSwapChainForCoreWindow(_PrGpuMem->pDX, (IUnknown*)(_Hwnd), &_scdesc, nullptr, &_tmpsc));
_tmpsc->QueryInterface(__uuidof(IDXGISwapChain3), (BLVoid**)&_PrGpuMem->pSwapChain);
_tmpsc->Release();
D3D12_DESCRIPTOR_HEAP_DESC _rtvheapdesc = {};
_rtvheapdesc.NumDescriptors = 1028;
_rtvheapdesc.NodeMask = 1;
_rtvheapdesc.Type = D3D12_DESCRIPTOR_HEAP_TYPE_RTV;
_rtvheapdesc.Flags = D3D12_DESCRIPTOR_HEAP_FLAG_NONE;
DX_CHECK_INTERNAL(_PrGpuMem->pDX->CreateDescriptorHeap(&_rtvheapdesc, IID_PPV_ARGS(&_PrGpuMem->pRTVHeap)));
D3D12_DESCRIPTOR_HEAP_DESC _dsvheapdesc = {};
_dsvheapdesc.NumDescriptors = 129;
_dsvheapdesc.NodeMask = 1;
_dsvheapdesc.Type = D3D12_DESCRIPTOR_HEAP_TYPE_DSV;
_dsvheapdesc.Flags = D3D12_DESCRIPTOR_HEAP_FLAG_NONE;
DX_CHECK_INTERNAL(_PrGpuMem->pDX->CreateDescriptorHeap(&_dsvheapdesc, IID_PPV_ARGS(&_PrGpuMem->pDSVHeap)));
D3D12_DESCRIPTOR_RANGE _descrange[] =
{
{ D3D12_DESCRIPTOR_RANGE_TYPE_SAMPLER, 16, 0, 0, D3D12_DESCRIPTOR_RANGE_OFFSET_APPEND },
{ D3D12_DESCRIPTOR_RANGE_TYPE_SRV, 16, 0, 0, D3D12_DESCRIPTOR_RANGE_OFFSET_APPEND },
{ D3D12_DESCRIPTOR_RANGE_TYPE_CBV, 1, 0, 0, D3D12_DESCRIPTOR_RANGE_OFFSET_APPEND },
{ D3D12_DESCRIPTOR_RANGE_TYPE_UAV, 16, 0, 0, D3D12_DESCRIPTOR_RANGE_OFFSET_APPEND },
};
D3D12_ROOT_PARAMETER _rootparameter[] =
{
{ D3D12_ROOT_PARAMETER_TYPE_DESCRIPTOR_TABLE,{ { 1, &_descrange[0] } }, D3D12_SHADER_VISIBILITY_ALL },
{ D3D12_ROOT_PARAMETER_TYPE_DESCRIPTOR_TABLE,{ { 1, &_descrange[1] } }, D3D12_SHADER_VISIBILITY_ALL },
{ D3D12_ROOT_PARAMETER_TYPE_CBV,{ { 0, 0 } }, D3D12_SHADER_VISIBILITY_ALL },
{ D3D12_ROOT_PARAMETER_TYPE_DESCRIPTOR_TABLE,{ { 1, &_descrange[3] } }, D3D12_SHADER_VISIBILITY_ALL },
};
_rootparameter[2].Descriptor.RegisterSpace = 0;
_rootparameter[2].Descriptor.ShaderRegister = 0;
D3D12_ROOT_SIGNATURE_DESC _sigdesc;
_sigdesc.NumParameters = 4;
_sigdesc.pParameters = _rootparameter;
_sigdesc.NumStaticSamplers = 0;
_sigdesc.pStaticSamplers = NULL;
_sigdesc.Flags = D3D12_ROOT_SIGNATURE_FLAG_ALLOW_INPUT_ASSEMBLER_INPUT_LAYOUT;
ID3DBlob* _error;
ID3DBlob* _outblob;
DX_CHECK_INTERNAL(D3D12SerializeRootSignature(&_sigdesc, D3D_ROOT_SIGNATURE_VERSION_1, &_outblob, &_error));
DX_CHECK_INTERNAL(_PrGpuMem->pDX->CreateRootSignature(0, _outblob->GetBufferPointer(), _outblob->GetBufferSize(), IID_PPV_ARGS(&_PrGpuMem->pRootSignature)));
_outblob->Release();
_error->Release();
UINT _rtvsize = _PrGpuMem->pDX->GetDescriptorHandleIncrementSize(D3D12_DESCRIPTOR_HEAP_TYPE_RTV);
for (BLU32 _i = 0; _i < 4; ++_i)
{
D3D12_CPU_DESCRIPTOR_HANDLE _handle = _PrGpuMem->pRTVHeap->GetCPUDescriptorHandleForHeapStart();
_handle.ptr += _i * _rtvsize;
DX_CHECK_INTERNAL(_PrGpuMem->pSwapChain->GetBuffer(_i, IID_PPV_ARGS(&_PrGpuMem->aBackBuffer[_i])));
_PrGpuMem->pDX->CreateRenderTargetView(_PrGpuMem->aBackBuffer[_i], NULL, _handle);
}
D3D12_RESOURCE_DESC _resdesc;
_resdesc.Dimension = D3D12_RESOURCE_DIMENSION_TEXTURE2D;
_resdesc.Alignment = 0;
_resdesc.Width = _Width;
_resdesc.Height = _Height;
_resdesc.DepthOrArraySize = 1;
_resdesc.MipLevels = 0;
_resdesc.Format = DXGI_FORMAT_D24_UNORM_S8_UINT;
_resdesc.SampleDesc.Count = 1;
_resdesc.SampleDesc.Quality = 0;
_resdesc.Layout = D3D12_TEXTURE_LAYOUT_UNKNOWN;
_resdesc.Flags = D3D12_RESOURCE_FLAG_ALLOW_DEPTH_STENCIL;
D3D12_CLEAR_VALUE _clearvalue;
_clearvalue.Format = _resdesc.Format;
_clearvalue.DepthStencil.Depth = 1.0f;
_clearvalue.DepthStencil.Stencil = 0;
D3D12_HEAP_PROPERTIES _heapproperty = { D3D12_HEAP_TYPE_DEFAULT, D3D12_CPU_PAGE_PROPERTY_UNKNOWN, D3D12_MEMORY_POOL_UNKNOWN, 1, 1 };
ID3D12Resource* _resource;
DX_CHECK_INTERNAL(_PrGpuMem->pDX->CreateCommittedResource(&_heapproperty, D3D12_HEAP_FLAG_NONE, &_resdesc, D3D12_RESOURCE_STATE_COMMON, &_clearvalue, IID_PPV_ARGS(&_resource)));
assert(NULL != _resource);
D3D12_DEPTH_STENCIL_VIEW_DESC _dsvdesc;
ZeroMemory(&_dsvdesc, sizeof(_dsvdesc));
_dsvdesc.Format = _resdesc.Format;
_dsvdesc.ViewDimension = D3D12_DSV_DIMENSION_TEXTURE2D;
_dsvdesc.Flags = D3D12_DSV_FLAGS(0);
_PrGpuMem->pDX->CreateDepthStencilView(_PrGpuMem->pBackBufferDS, &_dsvdesc, _PrGpuMem->pDSVHeap->GetCPUDescriptorHandleForHeapStart());
_PipelineStateDefaultDX(_Width, _Height);
}
BLVoid
_GpuSwapBuffer()
{
DX_CHECK_INTERNAL(_PrGpuMem->pSwapChain->Present(_PrGpuMem->nSyncInterval, 0));
}
BLVoid
_GpuAnitIntervention()
{
_FreeUBO(_PrGpuMem->pUBO);
{
FOREACH_DICT(ID3D12PipelineState*, _iter, _PrGpuMem->pPSOCache)
{
_iter->Release();
}
}
blDeleteDict(_PrGpuMem->pPSOCache);
_PrGpuMem->pSwapChain->Release();
_PrGpuMem->aBackBuffer[0]->Release();
_PrGpuMem->aBackBuffer[1]->Release();
_PrGpuMem->aBackBuffer[2]->Release();
_PrGpuMem->aBackBuffer[3]->Release();
_PrGpuMem->pBackBufferDS->Release();
_PrGpuMem->pRTVHeap->Release();
_PrGpuMem->pDSVHeap->Release();
_PrGpuMem->pRootSignature->Release();
_PrGpuMem->pDX->Release();
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pTextureCache)
{
_BLTextureBuffer* _tex = (_BLTextureBuffer*)_iter->pRes;
blDebugOutput("detected texture resource leak: hash>%u", URIPART_INTERNAL(_tex->nID));
}
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pBufferCache)
{
_BLGeometryBuffer* _geo = (_BLGeometryBuffer*)_iter->pRes;
blDebugOutput("detected geometry buffer resource leak: hash>%u", URIPART_INTERNAL(_geo->nID));
}
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pTechCache)
{
_BLTechnique* _tech = (_BLTechnique*)_iter->pRes;
blDebugOutput("detected technique resource leak: hash>%u", URIPART_INTERNAL(_tech->nID));
}
}
blDeleteDict(_PrGpuMem->pTechCache);
blDeleteDict(_PrGpuMem->pTextureCache);
blDeleteDict(_PrGpuMem->pBufferCache);
delete _PrGpuMem->pUBO;
delete _PrGpuMem;
}
#elif defined(BL_PLATFORM_LINUX)
static BLS32
_CtxErrorHandler(Display*, XErrorEvent*)
{
_PrGpuMem->bCtxError = TRUE;
return 0;
}
BLVoid
_GpuIntervention(Display* _Display, Window _Window, BLU32 _Width, BLU32 _Height, GLXFBConfig _Config, BLVoid* _Lib, BLBool _Vsync)
{
_PrGpuMem = (_BLGpuMember*)malloc(sizeof(_BLGpuMember));
_PrGpuMem->bVsync = _Vsync;
_PrGpuMem->sHardwareCaps.bCSSupport = FALSE;
_PrGpuMem->sHardwareCaps.bGSSupport = TRUE;
_PrGpuMem->sHardwareCaps.bAnisotropy = FALSE;
_PrGpuMem->sHardwareCaps.bTSSupport = FALSE;
_PrGpuMem->sHardwareCaps.bFloatRTSupport = FALSE;
_PrGpuMem->sHardwareCaps.fMaxAnisotropy = 0.f;
_PrGpuMem->pTextureCache = blGenDict(TRUE);
_PrGpuMem->pBufferCache = blGenDict(TRUE);
_PrGpuMem->pTechCache = blGenDict(TRUE);
_PrGpuMem->bCtxError = FALSE;
_PrGpuMem->pUBO = (_BLUniformBuffer*)malloc(sizeof(_BLUniformBuffer));
_PrGpuMem->pUBO->nSize = 0;
for (BLU32 _idx = 0; _idx < BL_TF_COUNT; ++_idx)
_PrGpuMem->sHardwareCaps.aTexFormats[_idx] = TRUE;
BLBool _vkinited = FALSE;
if (_vkinited)
{
_PrGpuMem->sHardwareCaps.eApiType = BL_VULKAN_API;
}
else
{
_PrGpuMem->sHardwareCaps.eApiType = BL_GL_API;
GL_LOAD_INTERNAL(_Lib);
glxSwapBuffers = (PFNGLXSWAPBUFFERSPROC)glXGetProcAddress((const GLubyte*)"glXSwapBuffers");
PFNGLXMAKECONTEXTCURRENTPROC glXMakeContextCurrent = (PFNGLXMAKECONTEXTCURRENTPROC)glXGetProcAddress((const GLubyte*)"glXMakeContextCurrent");
PFNGLXSWAPINTERVALEXTPROC glXSwapIntervalEXT = (PFNGLXSWAPINTERVALEXTPROC)glXGetProcAddress((const GLubyte*)"glXSwapIntervalEXT");
PFNGLXSWAPINTERVALSGIPROC glXSwapIntervalSGI = (PFNGLXSWAPINTERVALSGIPROC)glXGetProcAddress((const GLubyte*)"glXSwapIntervalSGI");
PFNGLXCREATECONTEXTATTRIBSARBPROC glXCreateContextAttribsARB = (PFNGLXCREATECONTEXTATTRIBSARBPROC)glXGetProcAddressARB((const GLubyte*)"glXCreateContextAttribsARB");
BLS32 _versions[5][2] =
{
{ 4 , 5 },
{ 4 , 4 },
{ 4 , 3 },
{ 4 , 2 },
{ 4 , 1 }
};
BLS32 _attribus[] =
{
GLX_CONTEXT_MAJOR_VERSION_ARB, 4,
GLX_CONTEXT_MINOR_VERSION_ARB, 5,
GLX_CONTEXT_PROFILE_MASK_ARB, GLX_CONTEXT_CORE_PROFILE_BIT_ARB,
None
};
_PrGpuMem->pDisplay = NULL;
BLS32(*_err)(Display*, XErrorEvent*) = XSetErrorHandler(&_CtxErrorHandler);
for (BLS32 _idx = 0; _idx < 5 ; ++_idx)
{
_attribus[1] = _versions[_idx][0];
_attribus[3] = _versions[_idx][1];
_PrGpuMem->pContext = glXCreateContextAttribsARB(_Display, _Config, 0, True, _attribus);
XSync(_Display, False);
if (_PrGpuMem->pContext)
{
blDebugOutput("Opengl %d.%d boost", _versions[_idx][0], _versions[_idx][1]);
_PrGpuMem->sHardwareCaps.nApiVersion = _versions[_idx][0] * 100 + _versions[_idx][1] * 10;
glXMakeContextCurrent(_Display, _Window, _Window, _PrGpuMem->pContext);
if (glXSwapIntervalEXT)
glXSwapIntervalEXT(_Display , _Window , _Vsync ? 1 : 0);
else if(glXSwapIntervalSGI)
glXSwapIntervalSGI(_Vsync ? 1 : 0);
break;
}
}
XSync(_Display, False);
_PrGpuMem->pDisplay = _Display;
_PrGpuMem->nWindow = _Window;
XSetErrorHandler(_err);
_PrGpuMem->sHardwareCaps.aTexFormats[BL_TF_ASTC] = _TextureFormatValidGL(GL_COMPRESSED_RGBA_ASTC_4x4_KHR, GL_ZERO, GL_ZERO, 8) & _TextureFormatValidGL(GL_COMPRESSED_SRGB8_ALPHA8_ASTC_4x4_KHR, GL_ZERO, GL_ZERO, 8);
GLint _extensions = 0;
GL_CHECK_INTERNAL(glGetIntegerv(GL_NUM_EXTENSIONS, &_extensions));
for (GLint _idx = 0; _idx < _extensions; ++_idx)
{
const BLAnsi* _name = (const BLAnsi*)glGetStringi(GL_EXTENSIONS, _idx);
if (!strcmp(_name, "GL_EXT_texture_filter_anisotropic"))
{
GL_CHECK_INTERNAL(glGetFloatv(GL_MAX_TEXTURE_MAX_ANISOTROPY_EXT, &_PrGpuMem->sHardwareCaps.fMaxAnisotropy));
}
}
_PipelineStateDefaultGL(_Width, _Height);
}
}
BLVoid
_GpuSwapBuffer()
{
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
else
{
glxSwapBuffers(_PrGpuMem->pDisplay, _PrGpuMem->nWindow);
}
}
BLVoid
_GpuAnitIntervention()
{
_FreeUBO(_PrGpuMem->pUBO);
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
else
{
PFNGLXMAKECONTEXTCURRENTPROC glXMakeContextCurrent = (PFNGLXMAKECONTEXTCURRENTPROC)glXGetProcAddress((const GLubyte*)"glXMakeContextCurrent");
glXMakeContextCurrent(_PrGpuMem->pDisplay, None, None, NULL);
PFNGLXDESTROYCONTEXTPROC glXDestroyContext = (PFNGLXDESTROYCONTEXTPROC)glXGetProcAddress((const GLubyte*)"glXDestroyContext");
glXDestroyContext(_PrGpuMem->pDisplay, _PrGpuMem->pContext);
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pTextureCache)
{
_BLTextureBuffer* _tex = (_BLTextureBuffer*)_iter->pRes;
blDebugOutput("detected texture resource leak: hash>%u", URIPART_INTERNAL(_tex->nID));
}
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pBufferCache)
{
_BLGeometryBuffer* _geo = (_BLGeometryBuffer*)_iter->pRes;
blDebugOutput("detected geometry buffer resource leak: hash>%u", URIPART_INTERNAL(_geo->nID));
}
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pTechCache)
{
_BLTechnique* _tech = (_BLTechnique*)_iter->pRes;
blDebugOutput("detected technique resource leak: hash>%u", URIPART_INTERNAL(_tech->nID));
}
}
blDeleteDict(_PrGpuMem->pTechCache);
blDeleteDict(_PrGpuMem->pTextureCache);
blDeleteDict(_PrGpuMem->pBufferCache);
free(_PrGpuMem->pUBO);
free(_PrGpuMem);
}
#elif defined(BL_PLATFORM_ANDROID)
BLVoid
_GpuIntervention(ANativeWindow* _Wnd, BLU32 _Width, BLU32 _Height, BLBool _Vsync, BLBool _Backend, BLBool _AEP)
{
if (_Backend)
{
if (_PrGpuMem->pEglSurface != EGL_NO_SURFACE)
eglDestroySurface(_PrGpuMem->pEglDisplay, _PrGpuMem->pEglSurface);
const EGLint surfaceAttrs[] =
{
EGL_RENDER_BUFFER,
EGL_BACK_BUFFER,
EGL_NONE
};
_PrGpuMem->pEglSurface = eglCreateWindowSurface(_PrGpuMem->pEglDisplay, _PrGpuMem->pEglConfig, _Wnd, surfaceAttrs);
if (!eglMakeCurrent(_PrGpuMem->pEglDisplay, _PrGpuMem->pEglSurface, _PrGpuMem->pEglSurface, _PrGpuMem->pEglContext))
blDebugOutput("ResetSurface failed EGL unable to eglMakeCurrent");
return;
}
_PrGpuMem = (_BLGpuMember*)malloc(sizeof(_BLGpuMember));
_PrGpuMem->bVsync = _Vsync;
_PrGpuMem->sHardwareCaps.bCSSupport = FALSE;
_PrGpuMem->sHardwareCaps.bGSSupport = FALSE;
_PrGpuMem->sHardwareCaps.bAnisotropy = FALSE;
_PrGpuMem->sHardwareCaps.bTSSupport = FALSE;
_PrGpuMem->sHardwareCaps.bFloatRTSupport = FALSE;
_PrGpuMem->sHardwareCaps.fMaxAnisotropy = 0.f;
_PrGpuMem->pTextureCache = blGenDict(TRUE);
_PrGpuMem->pBufferCache = blGenDict(TRUE);
_PrGpuMem->pTechCache = blGenDict(TRUE);
_PrGpuMem->pEglDisplay = EGL_NO_DISPLAY;
_PrGpuMem->pEglContext = EGL_NO_CONTEXT;
_PrGpuMem->pUBO = (_BLUniformBuffer*)malloc(sizeof(_BLUniformBuffer));
_PrGpuMem->pUBO->nSize = 0;
for (BLU32 _idx = 0; _idx < BL_TF_COUNT; ++_idx)
_PrGpuMem->sHardwareCaps.aTexFormats[_idx] = TRUE;
BLBool _vkinited = FALSE;
if (_vkinited)
{
_PrGpuMem->sHardwareCaps.eApiType = BL_VULKAN_API;
}
else
{
_PrGpuMem->sHardwareCaps.eApiType = BL_GL_API;
_PrGpuMem->sHardwareCaps.nApiVersion = 310;
_PrGpuMem->bAEPSupport = _AEP;
EGLint _configattrs[] =
{
EGL_SAMPLE_BUFFERS, 0,
EGL_SAMPLES, 0,
EGL_DEPTH_SIZE, 16,
EGL_RED_SIZE, 8,
EGL_GREEN_SIZE, 8,
EGL_BLUE_SIZE, 8,
EGL_ALPHA_SIZE, 8,
EGL_STENCIL_SIZE, 8,
EGL_SURFACE_TYPE, EGL_WINDOW_BIT,
EGL_RENDERABLE_TYPE, 0x0040,
EGL_NONE
};
EGLint _configcount;
const EGLint _contextattrs31[] = { 0x3098, 3, 0x30FB, 1, 0x30FC, 0, EGL_NONE };
const EGLint _surfaceattrs[] = { EGL_RENDER_BUFFER, EGL_BACK_BUFFER, EGL_NONE };
if (_PrGpuMem->pEglDisplay == EGL_NO_DISPLAY && _PrGpuMem->pEglContext == EGL_NO_CONTEXT)
{
_PrGpuMem->pEglDisplay = eglGetDisplay(EGL_DEFAULT_DISPLAY);
if (_PrGpuMem->pEglDisplay == EGL_NO_DISPLAY)
{
blDebugOutput("egl initialize failed");
return;
}
if (eglInitialize(_PrGpuMem->pEglDisplay, NULL, NULL) != EGL_TRUE)
{
blDebugOutput("egl initialize failed");
return;
}
if (eglChooseConfig(_PrGpuMem->pEglDisplay, _configattrs, &_PrGpuMem->pEglConfig, 1, &_configcount) != EGL_TRUE || _configcount <= 0)
{
blDebugOutput("egl no valid config");
return;
}
_PrGpuMem->pEglContext = eglCreateContext(_PrGpuMem->pEglDisplay, _PrGpuMem->pEglConfig, EGL_NO_CONTEXT, _contextattrs31);
if (_PrGpuMem->pEglContext == EGL_NO_CONTEXT)
{
const EGLint _contextattrs30[] = { 0x3098, 3, 0x30FB, 0, 0x30FC, 0, EGL_NONE };
_PrGpuMem->sHardwareCaps.nApiVersion = 300;
_PrGpuMem->pEglContext = eglCreateContext(_PrGpuMem->pEglDisplay, _PrGpuMem->pEglConfig, EGL_NO_CONTEXT, _contextattrs30);
if (_PrGpuMem->pEglContext == EGL_NO_CONTEXT)
{
blDebugOutput("egl no valid context");
return;
}
}
}
EGLint _format;
eglGetConfigAttrib(_PrGpuMem->pEglDisplay, _PrGpuMem->pEglConfig, EGL_NATIVE_VISUAL_ID, &_format);
ANativeWindow_setBuffersGeometry(_Wnd, _Width, _Height, _format);
_PrGpuMem->pEglSurface = eglCreateWindowSurface(_PrGpuMem->pEglDisplay, _PrGpuMem->pEglConfig, _Wnd, _surfaceattrs);
if (_PrGpuMem->pEglSurface == EGL_NO_SURFACE)
{
blDebugOutput("egl no valid surface");
return;
}
if (eglMakeCurrent(_PrGpuMem->pEglDisplay, _PrGpuMem->pEglSurface, _PrGpuMem->pEglSurface, _PrGpuMem->pEglContext) != EGL_TRUE)
{
blDebugOutput("egl can not make current");
return;
}
eglSwapInterval(_PrGpuMem->pEglDisplay, _Vsync ? 1 : 0);
_PrGpuMem->sHardwareCaps.aTexFormats[BL_TF_ASTC] = _TextureFormatValidGL(GL_COMPRESSED_RGBA_ASTC_4x4_KHR, GL_ZERO, GL_ZERO, 8) & _TextureFormatValidGL(GL_COMPRESSED_SRGB8_ALPHA8_ASTC_4x4_KHR, GL_ZERO, GL_ZERO, 8);
GLint _extensions = 0;
GL_CHECK_INTERNAL(glGetIntegerv(GL_NUM_EXTENSIONS, &_extensions));
for (GLint _idx = 0; _idx < _extensions; ++_idx)
{
const BLAnsi* _name = (const BLAnsi*)glGetStringi(GL_EXTENSIONS, _idx);
if (!strcmp(_name, "GL_EXT_texture_filter_anisotropic"))
{
GL_CHECK_INTERNAL(glGetFloatv(GL_MAX_TEXTURE_MAX_ANISOTROPY_EXT, &_PrGpuMem->sHardwareCaps.fMaxAnisotropy));
}
}
_PipelineStateDefaultGL(_Width, _Height);
}
}
BLVoid
_GpuSwapBuffer()
{
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
else
{
eglSwapBuffers(_PrGpuMem->pEglDisplay, _PrGpuMem->pEglSurface);
}
}
BLVoid
_GpuAnitIntervention()
{
_FreeUBO(_PrGpuMem->pUBO);
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
else
{
eglMakeCurrent(_PrGpuMem->pEglDisplay, EGL_NO_SURFACE, EGL_NO_SURFACE, EGL_NO_CONTEXT);
eglDestroyContext(_PrGpuMem->pEglDisplay, _PrGpuMem->pEglContext);
eglDestroySurface(_PrGpuMem->pEglDisplay, _PrGpuMem->pEglSurface);
_PrGpuMem->pEglDisplay = EGL_NO_DISPLAY;
_PrGpuMem->pEglContext = EGL_NO_CONTEXT;
eglTerminate(_PrGpuMem->pEglDisplay);
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pTextureCache)
{
_BLTextureBuffer* _tex = (_BLTextureBuffer*)_iter->pRes;
blDebugOutput("detected texture resource leak: hash>%u", URIPART_INTERNAL(_tex->nID));
}
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pBufferCache)
{
_BLGeometryBuffer* _geo = (_BLGeometryBuffer*)_iter->pRes;
blDebugOutput("detected geometry buffer resource leak: hash>%u", URIPART_INTERNAL(_geo->nID));
}
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pTechCache)
{
_BLTechnique* _tech = (_BLTechnique*)_iter->pRes;
blDebugOutput("detected technique resource leak: hash>%u", URIPART_INTERNAL(_tech->nID));
}
}
blDeleteDict(_PrGpuMem->pTechCache);
blDeleteDict(_PrGpuMem->pTextureCache);
blDeleteDict(_PrGpuMem->pBufferCache);
free(_PrGpuMem->pUBO);
free(_PrGpuMem);
}
#elif defined(BL_PLATFORM_OSX)
BLVoid
_GpuIntervention(NSView* _View, BLU32 _Width, BLU32 _Height, BLBool _Vsync)
{
_PrGpuMem = (_BLGpuMember*)malloc(sizeof(_BLGpuMember));
_PrGpuMem->bVsync = _Vsync;
_PrGpuMem->sHardwareCaps.bCSSupport = FALSE;
_PrGpuMem->sHardwareCaps.bGSSupport = TRUE;
_PrGpuMem->sHardwareCaps.bAnisotropy = FALSE;
_PrGpuMem->sHardwareCaps.bTSSupport = FALSE;
_PrGpuMem->sHardwareCaps.bFloatRTSupport = FALSE;
_PrGpuMem->sHardwareCaps.fMaxAnisotropy = 0.f;
_PrGpuMem->pTextureCache = blGenDict(TRUE);
_PrGpuMem->pBufferCache = blGenDict(TRUE);
_PrGpuMem->pTechCache = blGenDict(TRUE);
_PrGpuMem->pGLC = nil;
_PrGpuMem->pUBO = (_BLUniformBuffer*)malloc(sizeof(_BLUniformBuffer));
_PrGpuMem->pUBO->nSize = 0;
for (BLU32 _idx = 0; _idx < BL_TF_COUNT; ++_idx)
_PrGpuMem->sHardwareCaps.aTexFormats[_idx] = TRUE;
BLBool _vkinited = FALSE;
if (_vkinited)
{
_PrGpuMem->sHardwareCaps.eApiType = BL_VULKAN_API;
}
else
{
_PrGpuMem->sHardwareCaps.eApiType = BL_GL_API;
CGDisplayCount _numdisplays = 0;
CGDirectDisplayID* _displays, _maindis = 0;
if (kCGErrorSuccess != CGGetOnlineDisplayList(0, NULL, &_numdisplays))
{
blDebugOutput("OSX display not found");
return;
}
_displays = (CGDirectDisplayID*)alloca(sizeof(CGDirectDisplayID) * _numdisplays);
if (kCGErrorSuccess != CGGetOnlineDisplayList(_numdisplays, _displays, &_numdisplays))
{
blDebugOutput("OSX display not found");
return;
}
for (BLU32 _i = 0; _i < _numdisplays; ++_i)
{
if (CGDisplayIsMain(_displays[_i]))
{
_maindis = _displays[_i];
break;
}
}
CFURLRef _dir = CFURLCreateWithFileSystemPath(kCFAllocatorDefault, CFSTR("/System/Library/Frameworks/OpenGL.framework"), kCFURLPOSIXPathStyle, TRUE);
CFBundleRef _lib = CFBundleCreate(kCFAllocatorDefault, _dir);
GL_LOAD_INTERNAL(_lib);
CFRelease(_lib);
CFRelease(_dir);
NSOpenGLPixelFormatAttribute _attr[32] = { 0 };
_attr[0] = NSOpenGLPFAOpenGLProfile;
_attr[1] = NSOpenGLProfileVersion4_1Core;
_attr[2] = NSOpenGLPFAColorSize;
_attr[3] = 24;
_attr[4] = NSOpenGLPFAAlphaSize;
_attr[5] = 8;
_attr[6] = NSOpenGLPFADepthSize;
_attr[7] = 24;
_attr[8] = NSOpenGLPFAStencilSize;
_attr[9] = 8;
_attr[10] = NSOpenGLPFADoubleBuffer;
_attr[11] = 1;
_attr[12] = NSOpenGLPFAAccelerated;
_attr[13] = 1;
_attr[14] = NSOpenGLPFANoRecovery;
_attr[15] = 1;
_attr[16] = NSOpenGLPFAScreenMask;
_attr[17] = CGDisplayIDToOpenGLDisplayMask(_maindis);
NSOpenGLPixelFormat* _fmt;
_fmt = [[NSOpenGLPixelFormat alloc] initWithAttributes:_attr];
if (_fmt == nil)
{
blDebugOutput("bulllord can not choose valid pixel format");
return;
}
_PrGpuMem->pGLC = [[NSOpenGLContext alloc] initWithFormat:_fmt shareContext:nil];
[_fmt release];
if (_PrGpuMem->pGLC == nil)
{
blDebugOutput("Failed creating OpenGL context");
return;
}
[_PrGpuMem->pGLC setView:_View];
[_PrGpuMem->pGLC update];
[_PrGpuMem->pGLC makeCurrentContext];
GLint _sync = _Vsync ? 1 : 0;
[_PrGpuMem->pGLC setValues:&_sync forParameter:NSOpenGLCPSwapInterval];
_PrGpuMem->sHardwareCaps.aTexFormats[BL_TF_ASTC] = _TextureFormatValidGL(GL_COMPRESSED_RGBA_ASTC_4x4_KHR, GL_ZERO, GL_ZERO, 8) && _TextureFormatValidGL(GL_COMPRESSED_SRGB8_ALPHA8_ASTC_4x4_KHR, GL_ZERO, GL_ZERO, 8);
GLint _extensions = 0;
GL_CHECK_INTERNAL(glGetIntegerv(GL_NUM_EXTENSIONS, &_extensions));
for (GLint _idx = 0; _idx < _extensions; ++_idx)
{
const BLAnsi* _name = (const BLAnsi*)glGetStringi(GL_EXTENSIONS, _idx);
if (!strcmp(_name, "GL_EXT_texture_filter_anisotropic"))
{
GL_CHECK_INTERNAL(glGetFloatv(GL_MAX_TEXTURE_MAX_ANISOTROPY_EXT, &_PrGpuMem->sHardwareCaps.fMaxAnisotropy));
}
}
_PipelineStateDefaultGL(_Width, _Height);
_PrGpuMem->sHardwareCaps.nApiVersion = 410;
}
}
BLVoid
_GpuSwapBuffer()
{
if (BL_GL_API == _PrGpuMem->sHardwareCaps.eApiType)
{
[_PrGpuMem->pGLC flushBuffer];
}
}
BLVoid
_GpuAnitIntervention()
{
_FreeUBO(_PrGpuMem->pUBO);
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
else
{
[NSOpenGLContext clearCurrentContext];
[_PrGpuMem->pGLC update];
[_PrGpuMem->pGLC release];
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pTextureCache)
{
_BLTextureBuffer* _tex = (_BLTextureBuffer*)_iter->pRes;
blDebugOutput("detected texture resource leak: hash>%u", URIPART_INTERNAL(_tex->nID));
}
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pBufferCache)
{
_BLGeometryBuffer* _geo = (_BLGeometryBuffer*)_iter->pRes;
blDebugOutput("detected geometry buffer resource leak: hash>%u", URIPART_INTERNAL(_geo->nID));
}
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pTechCache)
{
_BLTechnique* _tech = (_BLTechnique*)_iter->pRes;
blDebugOutput("detected technique resource leak: hash>%u", URIPART_INTERNAL(_tech->nID));
}
}
blDeleteDict(_PrGpuMem->pTechCache);
blDeleteDict(_PrGpuMem->pTextureCache);
blDeleteDict(_PrGpuMem->pBufferCache);
free(_PrGpuMem->pUBO);
free(_PrGpuMem);
}
#elif defined(BL_PLATFORM_IOS)
BLVoid
_GpuIntervention(CALayer* _Layer, BLU32 _Width, BLU32 _Height, BLF32 _Scale, BLBool _Vsync)
{
_PrGpuMem = (_BLGpuMember*)malloc(sizeof(_BLGpuMember));
_PrGpuMem->bVsync = _Vsync;
_PrGpuMem->sHardwareCaps.bCSSupport = FALSE;
_PrGpuMem->sHardwareCaps.bGSSupport = FALSE;
_PrGpuMem->sHardwareCaps.bAnisotropy = FALSE;
_PrGpuMem->sHardwareCaps.bTSSupport = FALSE;
_PrGpuMem->sHardwareCaps.bFloatRTSupport = FALSE;
_PrGpuMem->sHardwareCaps.fMaxAnisotropy = 0.f;
_PrGpuMem->pTextureCache = blGenDict(TRUE);
_PrGpuMem->pBufferCache = blGenDict(TRUE);
_PrGpuMem->pTechCache = blGenDict(TRUE);
_PrGpuMem->pUBO = (_BLUniformBuffer*)malloc(sizeof(_BLUniformBuffer));
_PrGpuMem->pUBO->nSize = 0;
for (BLU32 _idx = 0; _idx < BL_TF_COUNT; ++_idx)
_PrGpuMem->sHardwareCaps.aTexFormats[_idx] = TRUE;
BLBool _mtlinited = FALSE;
if (_mtlinited)
{
_PrGpuMem->sHardwareCaps.eApiType = BL_METAL_API;
}
else
{
_PrGpuMem->sHardwareCaps.eApiType = BL_GL_API;
_PrGpuMem->sHardwareCaps.nApiVersion = 300;
_PrGpuMem->pGLC = [[EAGLContext alloc] initWithAPI:kEAGLRenderingAPIOpenGLES3];
EAGLContext* _pglc = (EAGLContext*)_PrGpuMem->pGLC;
if (![EAGLContext setCurrentContext:_pglc])
{
blDebugOutput("OpenGLES set context failed");
return;
}
glGenRenderbuffers(1, &_PrGpuMem->nBackRB);
glBindRenderbuffer(GL_RENDERBUFFER, _PrGpuMem->nBackRB);
if (![_pglc renderbufferStorage:GL_RENDERBUFFER fromDrawable:(CAEAGLLayer*)_Layer])
{
blDebugOutput("OpenGLES set RenderBufferStorage faield");
return;
}
glGenFramebuffers(1, &_PrGpuMem->nBackFB);
glBindFramebuffer(GL_FRAMEBUFFER, _PrGpuMem->nBackFB);
glFramebufferRenderbuffer(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_RENDERBUFFER, _PrGpuMem->nBackRB);
GLint _backw, _backh;
glGetRenderbufferParameteriv(GL_RENDERBUFFER, GL_RENDERBUFFER_WIDTH, &_backw);
glGetRenderbufferParameteriv(GL_RENDERBUFFER, GL_RENDERBUFFER_HEIGHT, &_backh);
assert(glCheckFramebufferStatus(GL_FRAMEBUFFER) == GL_FRAMEBUFFER_COMPLETE);
glGenRenderbuffers(1, &_PrGpuMem->nDepthRB);
glBindRenderbuffer(GL_RENDERBUFFER, _PrGpuMem->nDepthRB);
glRenderbufferStorage(GL_RENDERBUFFER, GL_DEPTH24_STENCIL8, _backw, _backh);
glFramebufferRenderbuffer(GL_FRAMEBUFFER, GL_DEPTH_ATTACHMENT, GL_RENDERBUFFER, _PrGpuMem->nDepthRB);
glFramebufferRenderbuffer(GL_FRAMEBUFFER, GL_STENCIL_ATTACHMENT, GL_RENDERBUFFER, _PrGpuMem->nDepthRB);
assert(glCheckFramebufferStatus(GL_FRAMEBUFFER) == GL_FRAMEBUFFER_COMPLETE);
glBindRenderbuffer(GL_RENDERBUFFER, _PrGpuMem->nBackRB);
_PrGpuMem->sHardwareCaps.aTexFormats[BL_TF_ASTC] = _TextureFormatValidGL(GL_COMPRESSED_RGBA_ASTC_4x4_KHR, GL_ZERO, GL_ZERO, 8) & _TextureFormatValidGL(GL_COMPRESSED_SRGB8_ALPHA8_ASTC_4x4_KHR, GL_ZERO, GL_ZERO, 8);
GLint _extensions = 0;
GL_CHECK_INTERNAL(glGetIntegerv(GL_NUM_EXTENSIONS, &_extensions));
for (GLint _idx = 0; _idx < _extensions; ++_idx)
{
const BLAnsi* _name = (const BLAnsi*)glGetStringi(GL_EXTENSIONS, _idx);
if (!strcmp(_name, "GL_EXT_texture_filter_anisotropic"))
{
GL_CHECK_INTERNAL(glGetFloatv(GL_MAX_TEXTURE_MAX_ANISOTROPY_EXT, &_PrGpuMem->sHardwareCaps.fMaxAnisotropy));
}
}
_PipelineStateDefaultGL(_Width, _Height);
}
}
BLVoid
_GpuSwapBuffer()
{
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
else
{
EAGLContext* _glc = (EAGLContext*)_PrGpuMem->pGLC;
[_glc presentRenderbuffer:GL_RENDERBUFFER];
}
}
BLVoid
_GpuAnitIntervention()
{
_FreeUBO(_PrGpuMem->pUBO);
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
else
{
glDeleteFramebuffers(1, &_PrGpuMem->nBackRB);
glDeleteFramebuffers(1, &_PrGpuMem->nBackFB);
glDeleteFramebuffers(1, &_PrGpuMem->nDepthRB);
[EAGLContext setCurrentContext:nil];
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pTextureCache)
{
_BLTextureBuffer* _tex = (_BLTextureBuffer*)_iter->pRes;
blDebugOutput("detected texture resource leak: hash>%u", URIPART_INTERNAL(_tex->nID));
}
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pBufferCache)
{
_BLGeometryBuffer* _geo = (_BLGeometryBuffer*)_iter->pRes;
blDebugOutput("detected geometry buffer resource leak: hash>%u", URIPART_INTERNAL(_geo->nID));
}
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pTechCache)
{
_BLTechnique* _tech = (_BLTechnique*)_iter->pRes;
blDebugOutput("detected technique resource leak: hash>%u", URIPART_INTERNAL(_tech->nID));
}
}
blDeleteDict(_PrGpuMem->pTechCache);
blDeleteDict(_PrGpuMem->pTextureCache);
blDeleteDict(_PrGpuMem->pBufferCache);
free(_PrGpuMem->pUBO);
free(_PrGpuMem);
}
#elif defined(BL_PLATFORM_WEB)
BLVoid
_GpuIntervention(BLU32 _Width, BLU32 _Height, BLBool _Vsync)
{
EM_ASM({
Array.prototype.someExtensionFromThirdParty = {};
Array.prototype.someExtensionFromThirdParty.length = 42;
Array.prototype.someExtensionFromThirdParty.something = function() { return "Surprise!"; };
});
_PrGpuMem = (_BLGpuMember*)malloc(sizeof(_BLGpuMember));
_PrGpuMem->bVsync = _Vsync;
_PrGpuMem->sHardwareCaps.bCSSupport = FALSE;
_PrGpuMem->sHardwareCaps.bGSSupport = FALSE;
_PrGpuMem->sHardwareCaps.bAnisotropy = FALSE;
_PrGpuMem->sHardwareCaps.bTSSupport = FALSE;
_PrGpuMem->sHardwareCaps.bFloatRTSupport = FALSE;
_PrGpuMem->sHardwareCaps.fMaxAnisotropy = 0.f;
_PrGpuMem->pTextureCache = blGenDict(TRUE);
_PrGpuMem->pBufferCache = blGenDict(TRUE);
_PrGpuMem->pTechCache = blGenDict(TRUE);
_PrGpuMem->pUBO = (_BLUniformBuffer*)malloc(sizeof(_BLUniformBuffer));
_PrGpuMem->pUBO->nSize = 0;
for (BLU32 _idx = 0; _idx < BL_TF_COUNT; ++_idx)
_PrGpuMem->sHardwareCaps.aTexFormats[_idx] = TRUE;
_PrGpuMem->sHardwareCaps.eApiType = BL_GL_API;
EmscriptenWebGLContextAttributes _attrs;
emscripten_webgl_init_context_attributes(&_attrs);
_attrs.majorVersion = 2;
_attrs.minorVersion = 0;
_attrs.powerPreference = EM_WEBGL_POWER_PREFERENCE_DEFAULT;
_PrGpuMem->pContext = emscripten_webgl_create_context("#canvas", &_attrs);
if (_PrGpuMem->pContext)
{
memset(&_attrs, -1, sizeof(_attrs));
EMSCRIPTEN_RESULT _res = emscripten_webgl_get_context_attributes(_PrGpuMem->pContext, &_attrs);
assert(_res == EMSCRIPTEN_RESULT_SUCCESS);
assert(_attrs.powerPreference == EM_WEBGL_POWER_PREFERENCE_DEFAULT || _attrs.powerPreference == EM_WEBGL_POWER_PREFERENCE_LOW_POWER || _attrs.powerPreference == EM_WEBGL_POWER_PREFERENCE_HIGH_PERFORMANCE);
_res = emscripten_webgl_make_context_current(_PrGpuMem->pContext);
assert(_res == EMSCRIPTEN_RESULT_SUCCESS);
assert(emscripten_webgl_get_current_context() == _PrGpuMem->pContext);
_PrGpuMem->sHardwareCaps.nApiVersion = 300;
_PrGpuMem->sHardwareCaps.aTexFormats[BL_TF_ASTC] = FALSE;
GLint _extensions = 0;
GL_CHECK_INTERNAL(glGetIntegerv(GL_NUM_EXTENSIONS, &_extensions));
for (GLint _idx = 0; _idx < _extensions; ++_idx)
{
const BLAnsi* _name = (const BLAnsi*)glGetStringi(GL_EXTENSIONS, _idx);
if (!strcmp(_name, "GL_EXT_texture_filter_anisotropic"))
{
GL_CHECK_INTERNAL(glGetFloatv(GL_MAX_TEXTURE_MAX_ANISOTROPY_EXT, &_PrGpuMem->sHardwareCaps.fMaxAnisotropy));
}
else if (!strcmp(_name, "WEBGL_compressed_texture_astc"))
{
_PrGpuMem->sHardwareCaps.aTexFormats[BL_TF_ASTC] = TRUE;
}
}
_PipelineStateDefaultGL(_Width, _Height);
}
}
BLVoid
_GpuSwapBuffer()
{
}
BLVoid
_GpuAnitIntervention()
{
_FreeUBO(_PrGpuMem->pUBO);
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pTextureCache)
{
_BLTextureBuffer* _tex = (_BLTextureBuffer*)_iter->pRes;
blDebugOutput("detected texture resource leak: hash>%u", URIPART_INTERNAL(_tex->nID));
}
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pBufferCache)
{
_BLGeometryBuffer* _geo = (_BLGeometryBuffer*)_iter->pRes;
blDebugOutput("detected geometry buffer resource leak: hash>%u", URIPART_INTERNAL(_geo->nID));
}
}
{
FOREACH_DICT(_BLGpuRes*, _iter, _PrGpuMem->pTechCache)
{
_BLTechnique* _tech = (_BLTechnique*)_iter->pRes;
blDebugOutput("detected technique resource leak: hash>%u", URIPART_INTERNAL(_tech->nID));
}
}
blDeleteDict(_PrGpuMem->pTechCache);
blDeleteDict(_PrGpuMem->pTextureCache);
blDeleteDict(_PrGpuMem->pBufferCache);
free(_PrGpuMem->pUBO);
free(_PrGpuMem);
emscripten_webgl_destroy_context(_PrGpuMem->pContext);
}
#else
# "error what's the fucking platform"
#endif
BLVoid
blGpuVSync(IN BLBool _On)
{
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
_VSyncGL(_On);
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
_PrGpuMem->nSyncInterval = _On ? 60 : 1;
}
#endif
}
BLVoid
blGpuCapsQuery(OUT BLEnum* _Api, OUT BLBool* _CSSupport, OUT BLBool* _GSSupport, OUT BLBool* _TSSupport, OUT BLBool* _FloatRTSupport, OUT BLBool _TexSupport[BL_TF_COUNT])
{
if (_Api)
*_Api = _PrGpuMem->sHardwareCaps.eApiType;
if (_CSSupport)
*_CSSupport = _PrGpuMem->sHardwareCaps.bCSSupport;
if (_GSSupport)
*_GSSupport = _PrGpuMem->sHardwareCaps.bGSSupport;
if (_TSSupport)
*_TSSupport = _PrGpuMem->sHardwareCaps.bTSSupport;
if (_FloatRTSupport)
*_FloatRTSupport = _PrGpuMem->sHardwareCaps.bFloatRTSupport;
for (BLU32 _idx = 0; _idx < BL_TF_COUNT; ++_idx)
_TexSupport[_idx] = _PrGpuMem->sHardwareCaps.aTexFormats[_idx];
}
BLVoid
blGpuRasterState(IN BLEnum _CullMode, IN BLS32 _DepthBias, IN BLF32 _SlopeScaledDepthBias, IN BLBool _Scissor, IN BLU32 _LineWidth, IN BLS32 _XPos, IN BLS32 _YPos, IN BLU32 _Width, IN BLU32 _Height, IN BLBool _Force)
{
if (_PrGpuMem->sPipelineState.eCullMode != _CullMode ||
_PrGpuMem->sPipelineState.nDepthBias != _DepthBias ||
!blScalarApproximate(_PrGpuMem->sPipelineState.fSlopeScaledDepthBias, _SlopeScaledDepthBias) ||
_PrGpuMem->sPipelineState.bScissor != _Scissor ||
_PrGpuMem->sPipelineState.nLineWidth != _LineWidth ||
_PrGpuMem->sPipelineState.nScissorX != _XPos ||
_PrGpuMem->sPipelineState.nScissorY != _YPos ||
_PrGpuMem->sPipelineState.nScissorW != _Width ||
_PrGpuMem->sPipelineState.nScissorH != _Height)
{
_PrGpuMem->sPipelineState.eCullMode = _CullMode;
_PrGpuMem->sPipelineState.nDepthBias = _DepthBias;
_PrGpuMem->sPipelineState.fSlopeScaledDepthBias = _SlopeScaledDepthBias;
_PrGpuMem->sPipelineState.bScissor = _Scissor;
_PrGpuMem->sPipelineState.nLineWidth = _LineWidth;
_PrGpuMem->sPipelineState.nScissorX = _XPos;
_PrGpuMem->sPipelineState.nScissorY = _YPos;
_PrGpuMem->sPipelineState.nScissorW = _Width;
_PrGpuMem->sPipelineState.nScissorH = _Height;
_PrGpuMem->sPipelineState.bRasterStateDirty = TRUE;
}
else if (_Force)
{
_PrGpuMem->sPipelineState.eCullMode = _CullMode;
_PrGpuMem->sPipelineState.nDepthBias = _DepthBias;
_PrGpuMem->sPipelineState.fSlopeScaledDepthBias = _SlopeScaledDepthBias;
_PrGpuMem->sPipelineState.bScissor = _Scissor;
_PrGpuMem->sPipelineState.nScissorX = _XPos;
_PrGpuMem->sPipelineState.nScissorY = _YPos;
_PrGpuMem->sPipelineState.nScissorW = _Width;
_PrGpuMem->sPipelineState.nScissorH = _Height;
_PrGpuMem->sPipelineState.bRasterStateDirty = TRUE;
_PipelineStateRefresh();
}
}
BLVoid
blGpuDepthStencilState(IN BLBool _Depth, IN BLBool _Mask, IN BLEnum _DepthCompFunc, IN BLBool _Stencil, IN BLU8 _StencilReadMask, IN BLU8 _StencilWriteMask, IN BLEnum _FrontStencilFailOp, IN BLEnum _FrontStencilDepthFailOp, IN BLEnum _FrontStencilPassOp, IN BLEnum _FrontStencilCompFunc, IN BLEnum _BackStencilFailOp, IN BLEnum _BackStencilDepthFailOp, IN BLEnum _BackStencilPassOp, IN BLEnum _BackStencilCompFunc, IN BLBool _Force)
{
if (_PrGpuMem->sPipelineState.bDepth != _Depth ||
_PrGpuMem->sPipelineState.bDepthMask != _Mask ||
_PrGpuMem->sPipelineState.eDepthCompFunc != _DepthCompFunc ||
_PrGpuMem->sPipelineState.bStencil != _Stencil ||
_PrGpuMem->sPipelineState.nStencilReadMask != _StencilReadMask ||
_PrGpuMem->sPipelineState.nStencilWriteMask != _StencilWriteMask ||
_PrGpuMem->sPipelineState.eFrontStencilFailOp != _FrontStencilFailOp ||
_PrGpuMem->sPipelineState.eFrontStencilDepthFailOp != _FrontStencilDepthFailOp ||
_PrGpuMem->sPipelineState.eFrontStencilPassOp != _FrontStencilPassOp ||
_PrGpuMem->sPipelineState.eFrontStencilCompFunc != _FrontStencilCompFunc ||
_PrGpuMem->sPipelineState.eBackStencilFailOp != _BackStencilFailOp ||
_PrGpuMem->sPipelineState.eBackStencilDepthFailOp != _BackStencilDepthFailOp ||
_PrGpuMem->sPipelineState.eBackStencilPassOp != _BackStencilPassOp ||
_PrGpuMem->sPipelineState.eBackStencilCompFunc != _BackStencilCompFunc)
{
_PrGpuMem->sPipelineState.bDepth = _Depth;
_PrGpuMem->sPipelineState.bDepthMask = _Mask;
_PrGpuMem->sPipelineState.eDepthCompFunc = _DepthCompFunc;
_PrGpuMem->sPipelineState.bStencil = _Stencil;
_PrGpuMem->sPipelineState.nStencilReadMask = _StencilReadMask;
_PrGpuMem->sPipelineState.nStencilWriteMask = _StencilWriteMask;
_PrGpuMem->sPipelineState.eFrontStencilFailOp = _FrontStencilFailOp;
_PrGpuMem->sPipelineState.eFrontStencilDepthFailOp = _FrontStencilDepthFailOp;
_PrGpuMem->sPipelineState.eFrontStencilPassOp = _FrontStencilPassOp;
_PrGpuMem->sPipelineState.eFrontStencilCompFunc = _FrontStencilCompFunc;
_PrGpuMem->sPipelineState.eBackStencilFailOp = _BackStencilFailOp;
_PrGpuMem->sPipelineState.eBackStencilDepthFailOp = _BackStencilDepthFailOp;
_PrGpuMem->sPipelineState.eBackStencilPassOp = _BackStencilPassOp;
_PrGpuMem->sPipelineState.eBackStencilCompFunc = _BackStencilCompFunc;
_PrGpuMem->sPipelineState.bDSStateDirty = TRUE;
}
else if (_Force)
{
_PrGpuMem->sPipelineState.bDepth = _Depth;
_PrGpuMem->sPipelineState.bDepthMask = _Mask;
_PrGpuMem->sPipelineState.eDepthCompFunc = _DepthCompFunc;
_PrGpuMem->sPipelineState.bStencil = _Stencil;
_PrGpuMem->sPipelineState.nStencilReadMask = _StencilReadMask;
_PrGpuMem->sPipelineState.nStencilWriteMask = _StencilWriteMask;
_PrGpuMem->sPipelineState.eFrontStencilFailOp = _FrontStencilFailOp;
_PrGpuMem->sPipelineState.eFrontStencilDepthFailOp = _FrontStencilDepthFailOp;
_PrGpuMem->sPipelineState.eFrontStencilPassOp = _FrontStencilPassOp;
_PrGpuMem->sPipelineState.eFrontStencilCompFunc = _FrontStencilCompFunc;
_PrGpuMem->sPipelineState.eBackStencilFailOp = _BackStencilFailOp;
_PrGpuMem->sPipelineState.eBackStencilDepthFailOp = _BackStencilDepthFailOp;
_PrGpuMem->sPipelineState.eBackStencilPassOp = _BackStencilPassOp;
_PrGpuMem->sPipelineState.eBackStencilCompFunc = _BackStencilCompFunc;
_PrGpuMem->sPipelineState.bDSStateDirty = TRUE;
_PipelineStateRefresh();
}
}
BLVoid
blGpuBlendState(IN BLBool _AlphaToCoverage, IN BLBool _Blend, IN BLEnum _SrcBlendFactor, IN BLEnum _DestBlendFactor, IN BLEnum _SrcBlendAlphaFactor, IN BLEnum _DestBlendAlphaFactor, IN BLEnum _BlendOp, IN BLEnum _BlendOpAlpha, IN BLBool _Force)
{
if (_PrGpuMem->sPipelineState.bAlphaToCoverage != _AlphaToCoverage ||
_PrGpuMem->sPipelineState.bBlend != _Blend ||
_PrGpuMem->sPipelineState.eSrcBlendFactor != _SrcBlendFactor ||
_PrGpuMem->sPipelineState.eDestBlendFactor != _DestBlendFactor ||
_PrGpuMem->sPipelineState.eSrcBlendAlphaFactor != _SrcBlendAlphaFactor ||
_PrGpuMem->sPipelineState.eDestBlendAlphaFactor != _DestBlendAlphaFactor ||
_PrGpuMem->sPipelineState.eBlendOp != _BlendOp ||
_PrGpuMem->sPipelineState.eBlendOpAlpha != _BlendOpAlpha)
{
_PrGpuMem->sPipelineState.bAlphaToCoverage = _AlphaToCoverage;
_PrGpuMem->sPipelineState.bBlend = _Blend;
_PrGpuMem->sPipelineState.eSrcBlendFactor = _SrcBlendFactor;
_PrGpuMem->sPipelineState.eDestBlendFactor = _DestBlendFactor;
_PrGpuMem->sPipelineState.eSrcBlendAlphaFactor = _SrcBlendAlphaFactor;
_PrGpuMem->sPipelineState.eDestBlendAlphaFactor = _DestBlendAlphaFactor;
_PrGpuMem->sPipelineState.eBlendOp = _BlendOp;
_PrGpuMem->sPipelineState.eBlendOpAlpha = _BlendOpAlpha;
_PrGpuMem->sPipelineState.bBlendStateDirty = TRUE;
}
else if (_Force)
{
_PrGpuMem->sPipelineState.bAlphaToCoverage = _AlphaToCoverage;
_PrGpuMem->sPipelineState.bBlend = _Blend;
_PrGpuMem->sPipelineState.eSrcBlendFactor = _SrcBlendFactor;
_PrGpuMem->sPipelineState.eDestBlendFactor = _DestBlendFactor;
_PrGpuMem->sPipelineState.eSrcBlendAlphaFactor = _SrcBlendAlphaFactor;
_PrGpuMem->sPipelineState.eDestBlendAlphaFactor = _DestBlendAlphaFactor;
_PrGpuMem->sPipelineState.eBlendOp = _BlendOp;
_PrGpuMem->sPipelineState.eBlendOpAlpha = _BlendOpAlpha;
_PrGpuMem->sPipelineState.bBlendStateDirty = TRUE;
_PipelineStateRefresh();
}
}
BLGuid
blFrameBufferGen()
{
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
return _GenFrameBufferGL();
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
return INVALID_GUID;
}
BLVoid
blFrameBufferDelete(IN BLGuid _FBO)
{
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
_DeleteFrameBufferGL(_FBO);
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
}
BLVoid
blFrameBufferBind(IN BLGuid _FBO, IN BLBool _Bind)
{
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
_BindFrameBufferGL(_FBO, _Bind);
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
}
BLVoid
blFrameBufferClear(IN BLBool _ColorBit, IN BLBool _DepthBit, IN BLBool _StencilBit)
{
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
_FrameBufferClearGL(_ColorBit, _DepthBit, _StencilBit);
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
}
BLVoid
blFrameBufferResolve(IN BLGuid _FBO)
{
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
_FrameBufferResolveGL(_FBO);
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
}
BLU32
blFrameBufferAttach(IN BLGuid _FBO, IN BLGuid _Tex, IN BLEnum _CFace)
{
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
return _FrameBufferAttachGL(_FBO, _Tex, _CFace);
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
return INVALID_GUID;
}
BLVoid
blFrameBufferDetach(IN BLGuid _FBO, IN BLBool _DepthStencil)
{
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
_FrameBufferDetachGL(_FBO, _DepthStencil);
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
}
BLGuid
blTextureGen(IN BLU32 _Hash, IN BLEnum _Target, IN BLEnum _Format, IN BLBool _Srgb, IN BLBool _Immutable, IN BLBool _RenderTarget, IN BLU32 _Layer, IN BLU32 _Mipmap, IN BLU32 _Width, IN BLU32 _Height, IN BLU32 _Depth, IN BLU8* _Data)
{
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
return _GenTextureGL(_Hash, _Target, _Format, _Srgb, _Immutable, _RenderTarget, _Layer, _Mipmap, _Width, _Height, _Depth, _Data);
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
return INVALID_GUID;
}
BLBool
blTextureDelete(IN BLGuid _Tex)
{
BLBool _discard = FALSE;
_BLTextureBuffer* _tex = (_BLTextureBuffer*)blGuidAsPointer(_Tex);
if (!_tex)
return FALSE;
blMutexLock(_PrGpuMem->pTextureCache->pMutex);
_BLGpuRes* _res = (_BLGpuRes*)blDictElement(_PrGpuMem->pTextureCache, URIPART_INTERNAL(_Tex));
if (_res)
{
_res->nRefCount--;
if (_res->nRefCount <= 0)
{
_discard = TRUE;
free(_res);
blDictErase(_PrGpuMem->pTextureCache, URIPART_INTERNAL(_Tex));
}
}
else
_discard = TRUE;
blMutexUnlock(_PrGpuMem->pTextureCache->pMutex);
if (!_discard)
return FALSE;
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
GLenum _target = GL_TEXTURE_2D;
switch (_tex->eTarget)
{
case BL_TT_1D: _target = GL_TEXTURE_2D; break;
case BL_TT_2D: _target = GL_TEXTURE_2D; break;
case BL_TT_3D: _target = GL_TEXTURE_3D; break;
case BL_TT_CUBE: _target = GL_TEXTURE_CUBE_MAP; break;
case BL_TT_ARRAY1D: _target = GL_TEXTURE_2D_ARRAY; break;
case BL_TT_ARRAY2D: _target = GL_TEXTURE_2D_ARRAY; break;
case BL_TT_ARRAYCUBE: _target = GL_TEXTURE_CUBE_MAP_ARRAY; break;
default:break;
}
GL_CHECK_INTERNAL(glBindTexture(_target, 0));
GL_CHECK_INTERNAL(glDeleteTextures(1, &_tex->uData.sGL.nHandle));
if (_tex->uData.sGL.nRTHandle)
GL_CHECK_INTERNAL(glDeleteRenderbuffers(1, &_tex->uData.sGL.nRTHandle));
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
free(_tex);
blDeleteGuid(_Tex);
return TRUE;
}
BLGuid
blTextureGain(IN BLU32 _Hash)
{
blMutexLock(_PrGpuMem->pTextureCache->pMutex);
_BLGpuRes* _res = (_BLGpuRes*)blDictElement(_PrGpuMem->pTextureCache, _Hash);
if (_res)
{
_res->nRefCount++;
blMutexUnlock(_PrGpuMem->pTextureCache->pMutex);
return ((_BLTextureBuffer*)_res->pRes)->nID;
}
else
{
blMutexUnlock(_PrGpuMem->pTextureCache->pMutex);
return INVALID_GUID;
}
}
BLVoid
blTextureFilter(IN BLGuid _Tex, IN BLEnum _MinFilter, IN BLEnum _MagFilter, IN BLEnum _WrapS, IN BLEnum _WrapT, IN BLBool _Anisotropy)
{
_BLTextureBuffer* _tex = (_BLTextureBuffer*)blGuidAsPointer(_Tex);
if (!_tex)
return;
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
GLenum _target = GL_TEXTURE_2D;
switch (_tex->eTarget)
{
case BL_TT_1D: _target = GL_TEXTURE_2D; break;
case BL_TT_2D: _target = GL_TEXTURE_2D; break;
case BL_TT_3D: _target = GL_TEXTURE_3D; break;
case BL_TT_CUBE: _target = GL_TEXTURE_CUBE_MAP; break;
case BL_TT_ARRAY1D: _target = GL_TEXTURE_2D_ARRAY; break;
case BL_TT_ARRAY2D: _target = GL_TEXTURE_2D_ARRAY; break;
case BL_TT_ARRAYCUBE: _target = GL_TEXTURE_CUBE_MAP_ARRAY; break;
default:break;
}
GLenum _minfilter;
if (BL_TF_NEAREST == _MinFilter)
_minfilter = (_tex->nNumMips >= 1) ? GL_NEAREST_MIPMAP_LINEAR : GL_NEAREST;
else
_minfilter = (_tex->nNumMips >= 1) ? GL_LINEAR_MIPMAP_LINEAR : GL_LINEAR;
GLenum _magfilter;
if (BL_TF_NEAREST == _MagFilter)
_magfilter = GL_NEAREST;
else
_magfilter = GL_LINEAR;
GLenum _wraps = GL_REPEAT, _wrapt = GL_REPEAT;
switch (_WrapS)
{
case BL_TW_REPEAT:
_wraps = GL_REPEAT;
break;
case BL_TW_CLAMP:
_wraps = GL_CLAMP_TO_EDGE;
break;
case BL_TW_MIRROR:
_wraps = GL_MIRRORED_REPEAT;
break;
default:break;
}
switch (_WrapT)
{
case BL_TW_REPEAT:
_wrapt = GL_REPEAT;
break;
case BL_TW_CLAMP:
_wrapt = GL_CLAMP_TO_EDGE;
break;
case BL_TW_MIRROR:
_wrapt = GL_MIRRORED_REPEAT;
break;
default:break;
}
GL_CHECK_INTERNAL(glBindTexture(_target, _tex->uData.sGL.nHandle));
GL_CHECK_INTERNAL(glTexParameteri(_target, GL_TEXTURE_WRAP_S, _wraps));
GL_CHECK_INTERNAL(glTexParameteri(_target, GL_TEXTURE_WRAP_T, _wrapt));
GL_CHECK_INTERNAL(glTexParameteri(_target, GL_TEXTURE_MAG_FILTER, _magfilter));
GL_CHECK_INTERNAL(glTexParameteri(_target, GL_TEXTURE_MIN_FILTER, _minfilter));
GL_CHECK_INTERNAL(glTexParameteri(_target, GL_TEXTURE_MAX_LEVEL, _tex->nNumMips - 1));
if (_Anisotropy && _PrGpuMem->sHardwareCaps.fMaxAnisotropy >= 1.f)
{
GL_CHECK_INTERNAL(glTexParameterf(_target, GL_TEXTURE_MAX_ANISOTROPY_EXT, _PrGpuMem->sHardwareCaps.fMaxAnisotropy));
}
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
}
BLVoid
blTextureSwizzle(IN BLGuid _Tex, IN BLEnum _ChannelR, IN BLEnum _ChannelG, IN BLEnum _ChannelB, IN BLEnum _ChannelA)
{
_BLTextureBuffer* _tex = (_BLTextureBuffer*)blGuidAsPointer(_Tex);
if (!_tex)
return;
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
GLenum _target;
GLint _swizzle[4];
switch (_ChannelR)
{
case BL_TS_ZERO: _swizzle[0] = GL_ZERO; break;
case BL_TS_ONE: _swizzle[0] = GL_ONE; break;
case BL_TS_RED: _swizzle[0] = GL_RED; break;
case BL_TS_GREEN: _swizzle[0] = GL_GREEN; break;
case BL_TS_BLUE: _swizzle[0] = GL_BLUE; break;
case BL_TS_ALPHA: _swizzle[0] = GL_ALPHA; break;
default: _swizzle[0] = GL_ZERO; break;
}
switch (_ChannelG)
{
case BL_TS_ZERO: _swizzle[1] = GL_ZERO; break;
case BL_TS_ONE: _swizzle[1] = GL_ONE; break;
case BL_TS_RED: _swizzle[1] = GL_RED; break;
case BL_TS_GREEN: _swizzle[1] = GL_GREEN; break;
case BL_TS_BLUE: _swizzle[1] = GL_BLUE; break;
case BL_TS_ALPHA: _swizzle[1] = GL_ALPHA; break;
default: _swizzle[1] = GL_ZERO; break;
}
switch (_ChannelB)
{
case BL_TS_ZERO: _swizzle[2] = GL_ZERO; break;
case BL_TS_ONE: _swizzle[2] = GL_ONE; break;
case BL_TS_RED: _swizzle[2] = GL_RED; break;
case BL_TS_GREEN: _swizzle[2] = GL_GREEN; break;
case BL_TS_BLUE: _swizzle[2] = GL_BLUE; break;
case BL_TS_ALPHA: _swizzle[2] = GL_ALPHA; break;
default: _swizzle[2] = GL_ZERO; break;
}
switch (_ChannelA)
{
case BL_TS_ZERO: _swizzle[3] = GL_ZERO; break;
case BL_TS_ONE: _swizzle[3] = GL_ONE; break;
case BL_TS_RED: _swizzle[3] = GL_RED; break;
case BL_TS_GREEN: _swizzle[3] = GL_GREEN; break;
case BL_TS_BLUE: _swizzle[3] = GL_BLUE; break;
case BL_TS_ALPHA: _swizzle[3] = GL_ALPHA; break;
default: _swizzle[3] = GL_ZERO; break;
}
switch (_tex->eTarget)
{
case BL_TT_1D: _target = GL_TEXTURE_2D; break;
case BL_TT_2D: _target = GL_TEXTURE_2D; break;
case BL_TT_3D: _target = GL_TEXTURE_3D; break;
case BL_TT_CUBE: _target = GL_TEXTURE_CUBE_MAP; break;
case BL_TT_ARRAY1D: _target = GL_TEXTURE_2D_ARRAY; break;
case BL_TT_ARRAY2D: _target = GL_TEXTURE_2D_ARRAY; break;
case BL_TT_ARRAYCUBE: _target = GL_TEXTURE_CUBE_MAP_ARRAY; break;
default: _target = GL_TEXTURE_2D; break;
}
GL_CHECK_INTERNAL(glBindTexture(_target, _tex->uData.sGL.nHandle));
GL_CHECK_INTERNAL(glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_R, _swizzle[0]));
GL_CHECK_INTERNAL(glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_G, _swizzle[1]));
GL_CHECK_INTERNAL(glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_B, _swizzle[2]));
GL_CHECK_INTERNAL(glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_A, _swizzle[3]));
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
}
BLVoid
blTextureUpdate(IN BLGuid _Tex, IN BLU32 _Layer, IN BLU32 _Level, IN BLEnum _Face, IN BLU32 _XOffset, IN BLU32 _YOffset, IN BLU32 _ZOffset, IN BLU32 _Width, IN BLU32 _Height, IN BLU32 _Depth, IN BLVoid* _Data)
{
_BLTextureBuffer* _tex = (_BLTextureBuffer*)blGuidAsPointer(_Tex);
if (!_tex)
return;
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
GLenum _ifmt, _fmt, _type, _sfmt, _rtfmt;
_FillTextureFormatGL(_tex->eFormat, &_ifmt, &_fmt, &_type, &_sfmt, &_rtfmt);
GLenum _target;
switch (_tex->eTarget)
{
case BL_TT_1D:
_target = GL_TEXTURE_2D;
GL_CHECK_INTERNAL(glBindTexture(_target, _tex->uData.sGL.nHandle));
GL_CHECK_INTERNAL(glPixelStorei(GL_UNPACK_ALIGNMENT, 1));
if(_tex->eFormat > BL_TF_UNKNOWN)
{
GL_CHECK_INTERNAL(glTexSubImage2D(_target, _Level, _XOffset, _YOffset, _Width, _Height, _fmt, _type, _Data));
}
else
{
GL_CHECK_INTERNAL(glCompressedTexSubImage2D(_target, _Level, _XOffset, _YOffset, _Width, _Height, _ifmt, _TextureSize(_tex->eFormat, _Width, _Height, 1), _Data));
}
break;
case BL_TT_2D:
_target = GL_TEXTURE_2D;
GL_CHECK_INTERNAL(glBindTexture(_target, _tex->uData.sGL.nHandle));
GL_CHECK_INTERNAL(glPixelStorei(GL_UNPACK_ALIGNMENT, 1));
if(_tex->eFormat > BL_TF_UNKNOWN)
{
GL_CHECK_INTERNAL(glTexSubImage2D(_target, _Level, _XOffset, _YOffset, _Width, _Height, _fmt, _type, _Data));
}
else
{
GL_CHECK_INTERNAL(glCompressedTexSubImage2D(_target, _Level, _XOffset, _YOffset, _Width, _Height, _ifmt, _TextureSize(_tex->eFormat, _Width, _Height, 1), _Data));
}
break;
case BL_TT_3D:
_target = GL_TEXTURE_3D;
GL_CHECK_INTERNAL(glBindTexture(_target, _tex->uData.sGL.nHandle));
GL_CHECK_INTERNAL(glPixelStorei(GL_UNPACK_ALIGNMENT, 1));
if(_tex->eFormat > BL_TF_UNKNOWN)
{
GL_CHECK_INTERNAL(glTexSubImage3D(_target, _Level, _XOffset, _YOffset, _ZOffset, _Width, _Height, _Depth, _fmt, _type, _Data));
}
else
{
GL_CHECK_INTERNAL(glCompressedTexSubImage3D(_target, _Level, _XOffset, _YOffset, _ZOffset, _Width, _Height, _Depth, _ifmt, _TextureSize(_tex->eFormat, _Width, _Height, 1), _Data));
}
break;
case BL_TT_CUBE:
_target = GL_TEXTURE_CUBE_MAP;
GL_CHECK_INTERNAL(glBindTexture(_target, _tex->uData.sGL.nHandle));
GL_CHECK_INTERNAL(glPixelStorei(GL_UNPACK_ALIGNMENT, 1));
if(_tex->eFormat > BL_TF_UNKNOWN)
{
GL_CHECK_INTERNAL(glTexSubImage2D(GL_TEXTURE_CUBE_MAP_POSITIVE_X + _Face, _Level, _XOffset, _YOffset, _Width, _Height, _fmt, _type, _Data));
}
else
{
GL_CHECK_INTERNAL(glCompressedTexSubImage2D(GL_TEXTURE_CUBE_MAP_POSITIVE_X + _Face, _Level, _XOffset, _YOffset, _Width, _Height, _ifmt, _TextureSize(_tex->eFormat, _Width, _Height, 1), _Data));
}
break;
case BL_TT_ARRAY1D:
_target = GL_TEXTURE_2D_ARRAY;
GL_CHECK_INTERNAL(glBindTexture(_target, _tex->uData.sGL.nHandle));
GL_CHECK_INTERNAL(glPixelStorei(GL_UNPACK_ALIGNMENT, 1));
if(_tex->eFormat > BL_TF_UNKNOWN)
{
GL_CHECK_INTERNAL(glTexSubImage3D(_target, _Level, _XOffset, _YOffset, _Layer, _Width, _Height, _Depth, _fmt, _type, _Data));
}
else
{
GL_CHECK_INTERNAL(glCompressedTexSubImage3D(_target, _Level, _XOffset, _YOffset, _Layer, _Width, _Height, _Depth, _ifmt, _TextureSize(_tex->eFormat, _Width, _Height, 1), _Data));
}
break;
case BL_TT_ARRAY2D:
_target = GL_TEXTURE_2D_ARRAY;
GL_CHECK_INTERNAL(glBindTexture(_target, _tex->uData.sGL.nHandle));
GL_CHECK_INTERNAL(glPixelStorei(GL_UNPACK_ALIGNMENT, 1));
if(_tex->eFormat > BL_TF_UNKNOWN)
{
GL_CHECK_INTERNAL(glTexSubImage3D(_target, _Level, _XOffset, _YOffset, _Layer, _Width, _Height, _Depth, _fmt, _type, _Data));
}
else
{
GL_CHECK_INTERNAL(glCompressedTexSubImage3D(_target, _Level, _XOffset, _YOffset, _Layer, _Width, _Height, _Depth, _ifmt, _TextureSize(_tex->eFormat, _Width, _Height, 1), _Data));
}
break;
case BL_TT_ARRAYCUBE:
_target = GL_TEXTURE_CUBE_MAP_ARRAY;
GL_CHECK_INTERNAL(glBindTexture(_target, _tex->uData.sGL.nHandle));
GL_CHECK_INTERNAL(glPixelStorei(GL_UNPACK_ALIGNMENT, 1));
if(_tex->eFormat > BL_TF_UNKNOWN)
{
GL_CHECK_INTERNAL(glTexSubImage3D(GL_TEXTURE_CUBE_MAP_POSITIVE_X + _Face, _Level, _XOffset, _YOffset, _Layer, _Width, _Height, _Layer, _fmt, _type, _Data));
}
else
{
GL_CHECK_INTERNAL(glCompressedTexSubImage3D(GL_TEXTURE_CUBE_MAP_POSITIVE_X + _Face, _Level, _XOffset, _YOffset, _Layer, _Width, _Height, _Layer, _ifmt, _TextureSize(_tex->eFormat, _Width, _Height, 1), _Data));
}
break;
default:break;
}
GL_CHECK_INTERNAL(glPixelStorei(GL_UNPACK_ALIGNMENT, 4));
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
}
BLVoid
blTextureQuery(IN BLGuid _Tex, OUT BLEnum* _Target, OUT BLEnum* _Format, OUT BLU32* _Layer, OUT BLU32* _Mipmap, OUT BLU32* _Width, OUT BLU32* _Height, OUT BLU32* _Depth, OUT BLU32* _Size)
{
_BLTextureBuffer* _tex = (_BLTextureBuffer*)blGuidAsPointer(_Tex);
if (!_tex)
return;
*_Target = _tex->eTarget;
*_Format = _tex->eFormat;
*_Layer = _tex->nLayer;
*_Mipmap = _tex->nNumMips;
*_Width = _tex->nWidth;
*_Height = _tex->nHeight;
*_Depth = _tex->nDepth;
*_Size = _TextureSize(_tex->eFormat, _tex->nWidth, _tex->nHeight, _tex->nDepth);
}
BLGuid
blGeometryBufferGen(IN BLU32 _Hash, IN BLEnum _Topology, IN BLBool _Dynamic, IN BLEnum* _Semantic, IN BLEnum* _Decl, IN BLU32 _DeclNum,IN BLVoid* _VBO, IN BLU32 _VBSz, IN BLVoid* _IBO, IN BLU32 _IBSz, IN BLEnum _IBFmt)
{
_BLGeometryBuffer* _geo = NULL;
BLBool _cache = FALSE;
if (!_Dynamic && !_Semantic)
{
blMutexLock(_PrGpuMem->pBufferCache->pMutex);
_BLGpuRes* _res = (_BLGpuRes*)blDictElement(_PrGpuMem->pBufferCache, _Hash);
_geo = _res ? (_BLGeometryBuffer*)_res->pRes : NULL;
if (_res)
_res->nRefCount++;
blMutexUnlock(_PrGpuMem->pBufferCache->pMutex);
}
if (!_geo)
{
_geo = (_BLGeometryBuffer*)malloc(sizeof(_BLGeometryBuffer));
memset(_geo, 0, sizeof(_BLGeometryBuffer));
_cache = !_Dynamic;
}
else if (_geo && !_Semantic)
return _geo->nID;
_geo->eVBTopology = _Topology;
_geo->eIBFormat = _IBFmt;
_geo->bDynamic = _Dynamic;
_geo->nVBSize = _VBSz;
_geo->nIBSize = _IBSz;
_geo->aInsSem[0] = _geo->aInsSem[1] = _geo->aInsSem[2] = _geo->aInsSem[3] = BL_SL_INVALID;
BLU32 _stride = 0;
const BLEnum* _decls = _Decl;
const BLEnum* _semantic = _Semantic;
for (BLU32 _idx = 0; _idx < _DeclNum; ++_idx)
{
switch(_decls[_idx])
{
case BL_VD_BOOLX1: _stride += 1 * 1; break;
case BL_VD_BOOLX2: _stride += 1 * 2; break;
case BL_VD_BOOLX3: _stride += 1 * 3; break;
case BL_VD_BOOLX4: _stride += 1 * 4; break;
case BL_VD_INTX1: _stride += 4 * 1; break;
case BL_VD_INTX2: _stride += 4 * 2; break;
case BL_VD_INTX3: _stride += 4 * 3; break;
case BL_VD_INTX4: _stride += 4 * 4; break;
case BL_VD_FLOATX1: _stride += 4 * 1; break;
case BL_VD_FLOATX2: _stride += 4 * 2; break;
case BL_VD_FLOATX3: _stride += 4 * 3; break;
case BL_VD_FLOATX4: _stride += 4 * 4; break;
default:assert(0);break;
}
}
_geo->nVertexNum = _geo->nVBSize / _stride;
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
_geo->uData.sGL.nIBHandle = -1;
_geo->uData.sGL.nInsHandle[0] = _geo->uData.sGL.nInsHandle[1] = _geo->uData.sGL.nInsHandle[2] = _geo->uData.sGL.nInsHandle[3] = -1;
GL_CHECK_INTERNAL(glGenVertexArrays(1, &_geo->uData.sGL.nVAHandle));
GL_CHECK_INTERNAL(glBindVertexArray(_geo->uData.sGL.nVAHandle));
GL_CHECK_INTERNAL(glGenBuffers(1, &_geo->uData.sGL.nVBHandle));
GL_CHECK_INTERNAL(glBindBuffer(GL_ARRAY_BUFFER, _geo->uData.sGL.nVBHandle));
if (_Hash == 0xFFFFFFFF)
{
GL_CHECK_INTERNAL(glBufferData(GL_ARRAY_BUFFER, _geo->nVBSize, _VBO, GL_STATIC_DRAW));
}
else
{
GL_CHECK_INTERNAL(glBufferData(GL_ARRAY_BUFFER, _geo->nVBSize, _VBO, _Dynamic ? GL_DYNAMIC_DRAW : GL_STATIC_DRAW));
}
if (_geo->eIBFormat != BL_IF_INVALID)
{
GL_CHECK_INTERNAL(glGenBuffers(1, &_geo->uData.sGL.nIBHandle));
GL_CHECK_INTERNAL(glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, _geo->uData.sGL.nIBHandle));
if (_Hash == 0xFFFFFFFF)
{
GL_CHECK_INTERNAL(glBufferData(GL_ELEMENT_ARRAY_BUFFER, _geo->nIBSize, _IBO, GL_STATIC_DRAW));
}
else
{
GL_CHECK_INTERNAL(glBufferData(GL_ELEMENT_ARRAY_BUFFER, _geo->nIBSize, _IBO, _Dynamic ? GL_DYNAMIC_DRAW : GL_STATIC_DRAW));
}
}
BLU8* _offset = NULL;
BLU32 _used[16] = { 0 };
for (BLU32 _idx = 0; _idx < _DeclNum; ++_idx)
{
BLU32 _gtsize = 4;
GLint _numele = 4;
GLenum _gtype = GL_BYTE;
switch(_decls[_idx])
{
case BL_VD_BOOLX1: _numele = 1; _gtype = GL_BYTE; _gtsize = 1 * 1; break;
case BL_VD_BOOLX2: _numele = 2; _gtype = GL_BYTE; _gtsize = 2 * 1; break;
case BL_VD_BOOLX3: _numele = 3; _gtype = GL_BYTE; _gtsize = 3 * 1; break;
case BL_VD_BOOLX4: _numele = 4; _gtype = GL_BYTE; _gtsize = 4 * 1; break;
case BL_VD_INTX1: _numele = 1; _gtype = GL_INT; _gtsize = 1 * 4; break;
case BL_VD_INTX2: _numele = 2; _gtype = GL_INT; _gtsize = 2 * 4; break;
case BL_VD_INTX3: _numele = 3; _gtype = GL_INT; _gtsize = 3 * 4; break;
case BL_VD_INTX4: _numele = 4; _gtype = GL_INT; _gtsize = 4 * 4; break;
case BL_VD_FLOATX1: _numele = 1; _gtype = GL_FLOAT; _gtsize = 1 * 4; break;
case BL_VD_FLOATX2: _numele = 2; _gtype = GL_FLOAT; _gtsize = 2 * 4; break;
case BL_VD_FLOATX3: _numele = 3; _gtype = GL_FLOAT; _gtsize = 3 * 4; break;
case BL_VD_FLOATX4: _numele = 4; _gtype = GL_FLOAT; _gtsize = 4 * 4; break;
default: assert(0); break;
}
GL_CHECK_INTERNAL(glEnableVertexAttribArray(_semantic[_idx]));
GL_CHECK_INTERNAL(glBindBuffer(GL_ARRAY_BUFFER, _geo->uData.sGL.nVBHandle));
GL_CHECK_INTERNAL(glVertexAttribPointer(_semantic[_idx], _numele, _gtype, GL_FALSE, _stride, _offset));
_used[_semantic[_idx]] = 1;
_offset += _gtsize;
}
for (BLU32 _idx = 0; _idx < 16; ++_idx)
{
if (!_used[_idx])
{
GL_CHECK_INTERNAL(glDisableVertexAttribArray(_idx));
}
}
GL_CHECK_INTERNAL(glBindVertexArray(0));
GL_CHECK_INTERNAL(glBindBuffer(GL_ARRAY_BUFFER, 0));
if (_geo->eIBFormat != BL_IF_INVALID)
GL_CHECK_INTERNAL(glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0));
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
if (_cache)
{
blMutexLock(_PrGpuMem->pBufferCache->pMutex);
_BLGpuRes* _res = (_BLGpuRes*)malloc(sizeof(_BLGpuRes));
_res->nRefCount = 1;
_res->pRes = _geo;
blDictInsert(_PrGpuMem->pBufferCache, _Hash, _res);
blMutexUnlock(_PrGpuMem->pBufferCache->pMutex);
}
_geo->nID = blGenGuid(_geo, _Hash);
return _geo->nID;
}
BLBool
blGeometryBufferDelete(IN BLGuid _GBO)
{
BLBool _discard = FALSE;
_BLGeometryBuffer* _geo = (_BLGeometryBuffer*)blGuidAsPointer(_GBO);
if (!_geo)
return FALSE;
if (URIPART_INTERNAL(_geo->nID) == 0xFFFFFFFF)
_discard = TRUE;
else
{
blMutexLock(_PrGpuMem->pBufferCache->pMutex);
_BLGpuRes* _res = (_BLGpuRes*)blDictElement(_PrGpuMem->pBufferCache, URIPART_INTERNAL(_geo->nID));
if (_res)
{
_res->nRefCount--;
if (_res->nRefCount <= 0)
{
_discard = TRUE;
free(_res);
blDictErase(_PrGpuMem->pBufferCache, URIPART_INTERNAL(_geo->nID));
}
}
else
_discard = TRUE;
blMutexUnlock(_PrGpuMem->pBufferCache->pMutex);
}
if (!_discard)
return FALSE;
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
GL_CHECK_INTERNAL(glDeleteBuffers(1, &_geo->uData.sGL.nVBHandle));
if (_geo->uData.sGL.nIBHandle != 0xFFFFFFFF)
{
GL_CHECK_INTERNAL(glDeleteBuffers(1, &_geo->uData.sGL.nIBHandle));
}
if (_geo->uData.sGL.nInsHandle[0] != 0xFFFFFFFF)
{
GL_CHECK_INTERNAL(glDeleteBuffers(1, &_geo->uData.sGL.nInsHandle[0]));
}
if (_geo->uData.sGL.nInsHandle[1] != 0xFFFFFFFF)
{
GL_CHECK_INTERNAL(glDeleteBuffers(1, &_geo->uData.sGL.nInsHandle[1]));
}
if (_geo->uData.sGL.nInsHandle[2] != 0xFFFFFFFF)
{
GL_CHECK_INTERNAL(glDeleteBuffers(1, &_geo->uData.sGL.nInsHandle[2]));
}
if (_geo->uData.sGL.nInsHandle[3] != 0xFFFFFFFF)
{
GL_CHECK_INTERNAL(glDeleteBuffers(1, &_geo->uData.sGL.nInsHandle[3]));
}
GL_CHECK_INTERNAL(glDeleteVertexArrays(1, &_geo->uData.sGL.nVAHandle));
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
free(_geo);
blDeleteGuid(_GBO);
return TRUE;
}
BLGuid
blGeometryBufferGain(IN BLU32 _Hash)
{
blMutexLock(_PrGpuMem->pBufferCache->pMutex);
_BLGpuRes* _res = (_BLGpuRes*)blDictElement(_PrGpuMem->pBufferCache, _Hash);
blMutexUnlock(_PrGpuMem->pBufferCache->pMutex);
if (_res)
{
_res->nRefCount++;
return ((_BLGeometryBuffer*)_res->pRes)->nID;
}
else
return INVALID_GUID;
}
BLVoid
blGeometryBufferUpdate(IN BLGuid _GBO, IN BLU32 _VBOffset, IN BLU8* _VBO, IN BLU32 _VBSz, IN BLU32 _IBOffset, IN BLU8* _IBO, IN BLU32 _IBSz)
{
_BLGeometryBuffer* _geo = (_BLGeometryBuffer*)blGuidAsPointer(_GBO);
if (!_geo)
return;
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
GL_CHECK_INTERNAL(glBindBuffer(GL_ARRAY_BUFFER, _geo->uData.sGL.nVBHandle));
GL_CHECK_INTERNAL(glBufferSubData(GL_ARRAY_BUFFER, _VBOffset, _VBSz, _VBO));
GL_CHECK_INTERNAL(glBindBuffer(GL_ARRAY_BUFFER, 0));
if (_geo->uData.sGL.nIBHandle != 0xFFFFFFFF)
{
GL_CHECK_INTERNAL(glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, _geo->uData.sGL.nIBHandle));
GL_CHECK_INTERNAL(glBufferSubData(GL_ELEMENT_ARRAY_BUFFER, _IBOffset, _IBSz, _IBO));
GL_CHECK_INTERNAL(glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0));
}
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
}
BLVoid
blGeometryBufferInstance(IN BLGuid _GBO, IN BLEnum* _Semantic, IN BLEnum* _Decl, IN BLU32 _DeclNum, IN BLU32 _Instance)
{
if (_DeclNum > 4)
return;
_BLGeometryBuffer* _geo = (_BLGeometryBuffer*)blGuidAsPointer(_GBO);
if (!_geo)
return;
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
GL_CHECK_INTERNAL(glBindVertexArray(_geo->uData.sGL.nVAHandle));
for (BLU32 _idx = 0; _idx < _DeclNum; ++_idx)
{
if (_geo->uData.sGL.nInsHandle[_idx] == 0xFFFFFFFF)
GL_CHECK_INTERNAL(glGenBuffers(1, &_geo->uData.sGL.nInsHandle[_idx]));
BLU32 _vbsz = 0, _numele = 0;
GLenum _type = GL_BYTE;
switch(_Decl[_idx])
{
case BL_VD_BOOLX1: _numele = 1; _type = GL_BYTE; _vbsz = 1 * 1; break;
case BL_VD_BOOLX2: _numele = 2; _type = GL_BYTE; _vbsz = 2 * 1; break;
case BL_VD_BOOLX3: _numele = 3; _type = GL_BYTE; _vbsz = 3 * 1; break;
case BL_VD_BOOLX4: _numele = 4; _type = GL_BYTE; _vbsz = 4 * 1; break;
case BL_VD_INTX1: _numele = 1; _type = GL_INT; _vbsz = 1 * 4; break;
case BL_VD_INTX2: _numele = 2; _type = GL_INT; _vbsz = 2 * 4; break;
case BL_VD_INTX3: _numele = 3; _type = GL_INT; _vbsz = 3 * 4; break;
case BL_VD_INTX4: _numele = 4; _type = GL_INT; _vbsz = 4 * 4; break;
case BL_VD_FLOATX1: _numele = 1; _type = GL_FLOAT; _vbsz = 1 * 4; break;
case BL_VD_FLOATX2: _numele = 2; _type = GL_FLOAT; _vbsz = 2 * 4; break;
case BL_VD_FLOATX3: _numele = 3; _type = GL_FLOAT; _vbsz = 3 * 4; break;
case BL_VD_FLOATX4: _numele = 4; _type = GL_FLOAT; _vbsz = 4 * 4; break;
default: assert(0); break;
}
_vbsz *= _Instance;
GL_CHECK_INTERNAL(glBindBuffer(GL_ARRAY_BUFFER, _geo->uData.sGL.nInsHandle[_idx]));
GL_CHECK_INTERNAL(glBufferData(GL_ARRAY_BUFFER, _vbsz, NULL, GL_DYNAMIC_DRAW));
GL_CHECK_INTERNAL(glEnableVertexAttribArray(_Semantic[_idx]));
GL_CHECK_INTERNAL(glVertexAttribPointer(_Semantic[_idx], _numele, _type, GL_FALSE, 0, NULL));
GL_CHECK_INTERNAL(glVertexAttribDivisor(_Semantic[_idx], 1));
_geo->aInsSem[_idx] = _Semantic[_idx];
}
GL_CHECK_INTERNAL(glBindVertexArray(0));
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
}
BLVoid
blGeometryInstanceUpdate(IN BLGuid _GBO, IN BLEnum _Semantic, IN BLVoid* _Buffer, IN BLU32 _BufferSz)
{
_BLGeometryBuffer* _geo = (_BLGeometryBuffer*)blGuidAsPointer(_GBO);
if (!_geo)
return;
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
BLU32 _idx = 0;
for (; _idx < 4; ++_idx)
{
if (_geo->aInsSem[_idx] == _Semantic)
break;
}
GL_CHECK_INTERNAL(glBindBuffer(GL_ARRAY_BUFFER, _geo->uData.sGL.nInsHandle[_idx]));
GL_CHECK_INTERNAL(glBufferSubData(GL_ARRAY_BUFFER, 0, _BufferSz, _Buffer));
GL_CHECK_INTERNAL(glBindBuffer(GL_ARRAY_BUFFER, 0));
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
}
BLGuid
blTechniqueGen(IN BLAnsi* _Filename, IN BLAnsi* _Source, IN BLBool _ForceCompile)
{
BLBool _cache = FALSE;
_BLTechnique* _tech;
blMutexLock(_PrGpuMem->pTechCache->pMutex);
_BLGpuRes* _res = (_BLGpuRes*)blDictElement(_PrGpuMem->pTechCache, blHashString((const BLUtf8*)_Filename));
_tech = _res ? (_BLTechnique*)_res->pRes : NULL;
if (_res)
_res->nRefCount++;
blMutexUnlock(_PrGpuMem->pTechCache->pMutex);
if (!_tech)
{
_tech = (_BLTechnique*)malloc(sizeof(_BLTechnique));
_cache = TRUE;
}
if (!_cache)
return _tech->nID;
for (BLU32 _idx = 0; _idx < 16; ++_idx)
{
memset(_tech->aUniformVars[_idx].aName, 0, 128 * sizeof(BLAnsi));
_tech->aUniformVars[_idx].pVar = NULL;
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
_tech->aUniformVars[_idx].uData.sGL.nIndices = 0xFFFFFFFF;
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
}
for (BLU32 _idx = 0; _idx < 8; ++_idx)
{
memset(_tech->aSamplerVars[_idx].aName, 0, 128 * sizeof(BLAnsi));
_tech->aSamplerVars[_idx].pTex = NULL;
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
_tech->aSamplerVars[_idx].uData.sGL.nHandle = 0xFFFFFFFF;
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
}
BLU32 _hash = blHashString((const BLUtf8*)_Filename);
BLGuid _stream = INVALID_GUID;
BLAnsi _path[260] = { 0 };
BLBool _findbinary = FALSE;
ezxml_t _doc = NULL;
const BLAnsi* _vert = NULL, *_frag = NULL, *_geom = NULL, *_tesc = NULL, *_tess = NULL, *_comp = NULL;
#if !defined(BL_PLATFORM_WEB)
if (!_ForceCompile)
{
memset(_path, 0, 260 * sizeof(BLAnsi));
strcpy(_path, "b");
strcat(_path, _Filename);
_stream = blStreamGen(_path);
_findbinary = (_stream == INVALID_GUID) ? FALSE : TRUE;
}
#endif
if (!_findbinary)
{
if (!_Source)
{
_stream = blStreamGen(_Filename);
_doc = ezxml_parse_str((BLAnsi*)blStreamData(_stream), blStreamLength(_stream));
}
else
{
BLAnsi* _source = (BLAnsi*)alloca(strlen(_Source) + 1);
strcpy(_source, _Source);
_doc = ezxml_parse_str(_source, strlen(_Source));
}
const BLAnsi* _tag = NULL;
switch (_PrGpuMem->sHardwareCaps.eApiType)
{
case BL_GL_API: _tag = "GL"; break;
case BL_DX_API: _tag = "DX"; break;
case BL_METAL_API: _tag = "MTL"; break;
case BL_VULKAN_API: _tag = "VK"; break;
default: _tag = "Motherfucker"; break;
}
ezxml_t _element = ezxml_child(_doc, _tag);
_element = ezxml_child(_element, "Vert");
do {
if (_element && !strcmp(_element->name, "Vert"))
_vert = ezxml_txt(_element);
else if (_element && !strcmp(_element->name, "Frag"))
_frag = ezxml_txt(_element);
else if (_element && !strcmp(_element->name, "Geom"))
_geom = ezxml_txt(_element);
else if (_element && !strcmp(_element->name, "Tess"))
_tesc = ezxml_txt(_element);
else if (_element && !strcmp(_element->name, "Eval"))
_tess = ezxml_txt(_element);
else if (_element && !strcmp(_element->name, "Comp"))
_comp = ezxml_txt(_element);
_element = _element ? _element->sibling : NULL;
} while (_element);
}
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
BLAnsi _glslver[256] = { 0 };
if (!_findbinary)
{
GLint _compiled = 0;
GLint _linked = 0;
GLuint _vs = 0, _fs = 0, _gs = 0;
_tech->uData.sGL.nHandle = glCreateProgram();
if (_vert)
{
#if defined(BL_PLATFORM_ANDROID) || defined(BL_PLATFORM_IOS) || defined(BL_PLATFORM_WEB)
sprintf(_glslver, "#version %d es\n", _PrGpuMem->sHardwareCaps.nApiVersion);
#else
sprintf(_glslver, "#version %d core\n", _PrGpuMem->sHardwareCaps.nApiVersion);
#endif
BLAnsi* _tmp = (BLAnsi*)alloca(strlen(_glslver) + strlen(_vert) + 1);
strcpy(_tmp, _glslver);
strcat(_tmp, _vert);
_tmp[strlen(_glslver) + strlen(_vert)] = 0;
_vs = glCreateShader(GL_VERTEX_SHADER);
GL_CHECK_INTERNAL(glShaderSource(_vs, 1, &_tmp, NULL));
GL_CHECK_INTERNAL(glCompileShader(_vs));
GL_CHECK_INTERNAL(glGetShaderiv(_vs, GL_COMPILE_STATUS, &_compiled));
if (!_compiled)
{
GLint _len = 0;
GL_CHECK_INTERNAL(glGetShaderiv(_vs, GL_INFO_LOG_LENGTH, &_len));
if (_len)
{
BLAnsi* _info = (BLAnsi*)alloca((_len+100)*sizeof(BLAnsi));
GL_CHECK_INTERNAL(glGetShaderInfoLog(_vs, _len, &_len, _info));
strcat(_info, _Filename);
strcat(_info, "vs");
blDebugOutput(_info);
}
}
else
{
GL_CHECK_INTERNAL(glAttachShader(_tech->uData.sGL.nHandle, _vs));
}
}
if (_frag)
{
#if defined(BL_PLATFORM_ANDROID) || defined(BL_PLATFORM_IOS) || defined(BL_PLATFORM_WEB)
sprintf(_glslver, "#version %d es\n#ifdef GL_FRAGMENT_PRECISION_HIGH\nprecision highp float;\n#else\nprecision mediump float;\n#endif\n", _PrGpuMem->sHardwareCaps.nApiVersion);
#else
sprintf(_glslver, "#version %d core\n", _PrGpuMem->sHardwareCaps.nApiVersion);
#endif
BLAnsi* _tmp = (BLAnsi*)alloca(strlen(_glslver) + strlen(_frag) + 1);
strcpy(_tmp, _glslver);
strcat(_tmp, _frag);
_tmp[strlen(_glslver) + strlen(_frag)] = 0;
_fs = glCreateShader(GL_FRAGMENT_SHADER);
GL_CHECK_INTERNAL(glShaderSource(_fs, 1, &_tmp, NULL));
GL_CHECK_INTERNAL(glCompileShader(_fs));
GL_CHECK_INTERNAL(glGetShaderiv(_fs, GL_COMPILE_STATUS, &_compiled));
if (!_compiled)
{
GLint _len = 0;
GL_CHECK_INTERNAL(glGetShaderiv(_fs, GL_INFO_LOG_LENGTH, &_len));
if (_len)
{
BLAnsi* _info = (BLAnsi*)alloca((_len+100)*sizeof(BLAnsi));
GL_CHECK_INTERNAL(glGetShaderInfoLog(_fs, _len, &_len, _info));
strcat(_info, _Filename);
strcat(_info, "fs");
blDebugOutput(_info);
}
}
else
{
GL_CHECK_INTERNAL(glAttachShader(_tech->uData.sGL.nHandle, _fs));
}
}
if (_geom && _PrGpuMem->sHardwareCaps.bGSSupport)
{
_gs = glCreateShader(GL_GEOMETRY_SHADER);
GL_CHECK_INTERNAL(glShaderSource(_gs, 1, &_geom, NULL));
GL_CHECK_INTERNAL(glCompileShader(_gs));
GL_CHECK_INTERNAL(glGetShaderiv(_gs, GL_COMPILE_STATUS, &_compiled));
if (!_compiled)
{
GLint _len = 0;
GL_CHECK_INTERNAL(glGetShaderiv(_gs, GL_INFO_LOG_LENGTH, &_len));
if (_len)
{
BLAnsi* _info = (BLAnsi*)alloca((_len+1)*sizeof(BLAnsi));
GL_CHECK_INTERNAL(glGetShaderInfoLog(_gs, _len, &_len, _info));
strcat(_info, _Filename);
strcat(_info, "gs");
blDebugOutput(_info);
}
}
else
{
GL_CHECK_INTERNAL(glAttachShader(_tech->uData.sGL.nHandle, _gs));
}
}
#if !defined(BL_PLATFORM_WEB)
GL_CHECK_INTERNAL(glProgramParameteri(_tech->uData.sGL.nHandle, GL_PROGRAM_BINARY_RETRIEVABLE_HINT, GL_TRUE));
#endif
GL_CHECK_INTERNAL(glLinkProgram(_tech->uData.sGL.nHandle));
GL_CHECK_INTERNAL(glGetProgramiv(_tech->uData.sGL.nHandle, GL_LINK_STATUS, &_linked));
if (!_linked)
{
GLint _len = 0;
GL_CHECK_INTERNAL(glGetProgramiv(_tech->uData.sGL.nHandle, GL_INFO_LOG_LENGTH, &_len));
if (_len > 0)
{
BLAnsi* _info = (BLAnsi*)alloca((_len+1)*sizeof(BLAnsi));
GL_CHECK_INTERNAL(glGetProgramInfoLog(_tech->uData.sGL.nHandle, _len, &_len, _info));
blDebugOutput(_info);
}
}
#if !defined(BL_PLATFORM_WEB)
GLint _len = 0;
GL_CHECK_INTERNAL(glGetProgramiv(_tech->uData.sGL.nHandle, GL_PROGRAM_BINARY_LENGTH, &_len));
if (_len)
{
BLU8* _binary = (BLU8*)malloc(_len * sizeof(BLU8) + sizeof(GLenum));
GL_CHECK_INTERNAL(glGetProgramBinary(_tech->uData.sGL.nHandle, _len, NULL, (GLenum*)_binary, _binary + sizeof(GLenum)));
memset(_path, 0, 260 * sizeof(BLAnsi));
strcpy(_path, "b");
strcat(_path, _Filename);
blFileWrite(_path, _len * sizeof(BLU8) + sizeof(GLenum), _binary);
}
#endif
if (_vs)
{
GL_CHECK_INTERNAL(glDeleteShader(_vs));
}
if (_fs)
{
GL_CHECK_INTERNAL(glDeleteShader(_fs));
}
if (_gs)
{
GL_CHECK_INTERNAL(glDeleteShader(_gs));
}
}
else
{
#if !defined(BL_PLATFORM_WEB)
GLint _linked = 0;
_tech->uData.sGL.nHandle = glCreateProgram();
GLenum _format = 0;
blStreamRead(_stream, sizeof(GLenum), &_format);
BLU32 _len = blStreamLength(_stream) - sizeof(GLenum);
GL_CHECK_INTERNAL(glProgramBinary(_tech->uData.sGL.nHandle, _format, (BLU8*)blStreamData(_stream) + sizeof(GLenum), _len));
GL_CHECK_INTERNAL(glGetProgramiv(_tech->uData.sGL.nHandle, GL_LINK_STATUS, &_linked));
if (!_linked)
{
GLint _loglen = 0;
GL_CHECK_INTERNAL(glGetProgramiv(_tech->uData.sGL.nHandle, GL_INFO_LOG_LENGTH, &_loglen));
if (_loglen > 0)
{
BLAnsi* _info = (BLAnsi*)alloca((_loglen+1)*sizeof(BLAnsi));
GL_CHECK_INTERNAL(glGetProgramInfoLog(_tech->uData.sGL.nHandle, _loglen, &_loglen, _info));
blDebugOutput(_info);
}
}
#endif
}
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
}
#endif
if (!_findbinary)
ezxml_free(_doc);
if (_cache)
{
blMutexLock(_PrGpuMem->pTechCache->pMutex);
_res = (_BLGpuRes*)malloc(sizeof(_BLGpuRes));
_res->nRefCount = 1;
_res->pRes = _tech;
blDictInsert(_PrGpuMem->pTechCache, _hash, _res);
blMutexUnlock(_PrGpuMem->pTechCache->pMutex);
}
blStreamDelete(_stream);
_tech->nID = blGenGuid(_tech, _hash);
return _tech->nID;
}
BLBool
blTechniqueDelete(IN BLGuid _Tech)
{
BLBool _discard = FALSE;
_BLTechnique* _tech = (_BLTechnique*)blGuidAsPointer(_Tech);
blMutexLock(_PrGpuMem->pTechCache->pMutex);
_BLGpuRes* _res = (_BLGpuRes*)blDictElement(_PrGpuMem->pTechCache, URIPART_INTERNAL(_tech->nID));
if (_res)
{
_res->nRefCount--;
if (_res->nRefCount <= 0)
{
_discard = TRUE;
free(_res);
blDictErase(_PrGpuMem->pTechCache, URIPART_INTERNAL(_tech->nID));
}
}
else
_discard = TRUE;
blMutexUnlock(_PrGpuMem->pTechCache->pMutex);
if (!_discard)
return FALSE;
for (BLU32 _idx = 0; _idx < 16; ++_idx)
{
if (_tech->aUniformVars[_idx].pVar)
free(_tech->aUniformVars[_idx].pVar);
}
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
GL_CHECK_INTERNAL(glDeleteProgram(_tech->uData.sGL.nHandle));
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
if (_tech->uData.sDX.pVS)
_tech->uData.sDX.pVS->Release();
if (_tech->uData.sDX.pPS)
_tech->uData.sDX.pPS->Release();
if (_tech->uData.sDX.pGS)
_tech->uData.sDX.pGS->Release();
if (_tech->uData.sDX.pDS)
_tech->uData.sDX.pDS->Release();
if (_tech->uData.sDX.pHS)
_tech->uData.sDX.pHS->Release();
}
#endif
free(_tech);
blDeleteGuid(_Tech);
return TRUE;
}
BLGuid
blTechniqueGain(IN BLU32 _Hash)
{
blMutexLock(_PrGpuMem->pTechCache->pMutex);
_BLGpuRes* _res = (_BLGpuRes*)blDictElement(_PrGpuMem->pTechCache, _Hash);
blMutexUnlock(_PrGpuMem->pTechCache->pMutex);
if (_res)
{
_res->nRefCount++;
return ((_BLTechnique*)_res->pRes)->nID;
}
else
return INVALID_GUID;
}
BLVoid
blTechniqueUniform(IN BLGuid _Tech, IN BLEnum _Type, IN BLAnsi* _Name, IN BLVoid* _Data, IN BLU32 _DataSz, IN BLBool _UBO)
{
_BLTechnique* _tech = (_BLTechnique*)blGuidAsPointer(_Tech);
if (!_tech)
return;
BLU32 _idx = 0;
for (_idx = 0; _idx < 16; ++_idx)
{
if (_tech->aUniformVars[_idx].aName[0] == 0)
{
strcpy(_tech->aUniformVars[_idx].aName, _Name);
_tech->aUniformVars[_idx].eType = _Type;
_tech->aUniformVars[_idx].bUBO = _UBO;
_tech->aUniformVars[_idx].pVar = malloc(_DataSz);
memcpy(_tech->aUniformVars[_idx].pVar, _Data, _DataSz);
break;
}
else if (!strcmp(_tech->aUniformVars[_idx].aName, _Name))
{
_tech->aUniformVars[_idx].eType = _Type;
_tech->aUniformVars[_idx].pVar = realloc(_tech->aUniformVars[_idx].pVar, _DataSz);
memcpy(_tech->aUniformVars[_idx].pVar, _Data, _DataSz);
break;
}
}
switch (_Type)
{
case BL_UB_MAT2:
case BL_UB_MAT3:
case BL_UB_MAT4:
case BL_UB_MAT2X3:
case BL_UB_MAT3X2:
case BL_UB_MAT2X4:
case BL_UB_MAT4X2:
case BL_UB_MAT3X4:
case BL_UB_MAT4X3:
_tech->aUniformVars[_idx].nCount = 1;
break;
case BL_UB_S32X1:
case BL_UB_F32X1:
_tech->aUniformVars[_idx].nCount = _DataSz / 4;
break;
case BL_UB_S32X2:
case BL_UB_F32X2:
_tech->aUniformVars[_idx].nCount = _DataSz / 8;
break;
case BL_UB_S32X3:
case BL_UB_F32X3:
_tech->aUniformVars[_idx].nCount = _DataSz / 12;
break;
case BL_UB_S32X4:
case BL_UB_F32X4:
_tech->aUniformVars[_idx].nCount = _DataSz / 16;
break;
default: _tech->aUniformVars[_idx].nCount = 0; break;
}
}
BLVoid
blTechniqueSampler(IN BLGuid _Tech, IN BLAnsi* _Name, IN BLGuid _Tex, IN BLU32 _Unit)
{
_BLTechnique* _tech = (_BLTechnique*)blGuidAsPointer(_Tech);
_BLTextureBuffer* _tex = (_BLTextureBuffer*)blGuidAsPointer(_Tex);
if (!_tech || !_tex)
return;
BLU32 _idx = 0;
for (_idx = 0; _idx < 8; ++_idx)
{
if (_tech->aSamplerVars[_idx].aName[0] == 0)
{
strcpy(_tech->aSamplerVars[_idx].aName, _Name);
_tech->aSamplerVars[_idx].eType = BL_UB_SAMPLER;
_tech->aSamplerVars[_idx].nUnit = _Unit;
_tech->aSamplerVars[_idx].pTex = _tex;
break;
}
else if (!strcmp(_tech->aSamplerVars[_idx].aName, _Name))
{
_tech->aSamplerVars[_idx].eType = BL_UB_SAMPLER;
_tech->aSamplerVars[_idx].nUnit = _Unit;
_tech->aSamplerVars[_idx].pTex = _tex;
break;
}
}
}
BLVoid
blTechniqueDraw(IN BLGuid _Tech, IN BLGuid _GBO, IN BLU32 _Instance)
{
_BLTechnique* _tech = (_BLTechnique*)blGuidAsPointer(_Tech);
_BLGeometryBuffer* _geo = (_BLGeometryBuffer*)blGuidAsPointer(_GBO);
#if defined(BL_GL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_GL_API)
{
_PipelineStateRefresh();
if (!_PrGpuMem->pUBO->nSize)
{
GLuint _uboidx = glGetUniformBlockIndex(_tech->uData.sGL.nHandle, "UBO");
GLint _size;
GL_CHECK_INTERNAL(glGetActiveUniformBlockiv(_tech->uData.sGL.nHandle, _uboidx, GL_UNIFORM_BLOCK_DATA_SIZE, &_size));
_PrGpuMem->pUBO->nSize = (BLU32)_size;
_AllocUBO(_PrGpuMem->pUBO);
}
GL_CHECK_INTERNAL(glUseProgram(_tech->uData.sGL.nHandle));
for (BLU32 _idx = 0; _idx < 16; ++_idx)
{
if (_tech->aUniformVars[_idx].aName[0])
{
BLVoid* _data = _tech->aUniformVars[_idx].pVar;
BLU32 _count = _tech->aUniformVars[_idx].nCount;
if (_tech->aUniformVars[_idx].bUBO)
{
GL_CHECK_INTERNAL(glBindBuffer(GL_UNIFORM_BUFFER, _PrGpuMem->pUBO->uData.sGL.nHandle));
if (_tech->aUniformVars[_idx].uData.sGL.nIndices == 0xFFFFFFFF)
{
const GLchar* _name = _tech->aUniformVars[_idx].aName;
GL_CHECK_INTERNAL(glGetUniformIndices(_tech->uData.sGL.nHandle, 1, &_name, &_tech->aUniformVars[_idx].uData.sGL.nIndices));
GL_CHECK_INTERNAL(glGetActiveUniformsiv(_tech->uData.sGL.nHandle, _count, &_tech->aUniformVars[_idx].uData.sGL.nIndices, GL_UNIFORM_OFFSET, &_tech->aUniformVars[_idx].uData.sGL.nOffset));
GL_CHECK_INTERNAL(glBindBuffer(GL_UNIFORM_BUFFER, _PrGpuMem->pUBO->uData.sGL.nHandle));
}
switch (_tech->aUniformVars[_idx].eType)
{
case BL_UB_S32X1: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, _count * 1 * sizeof(BLS32), (GLint*)_data)); break;
case BL_UB_S32X2: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, _count * 2 * sizeof(BLS32), (GLint*)_data)); break;
case BL_UB_S32X3: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, _count * 3 * sizeof(BLS32), (GLint*)_data)); break;
case BL_UB_S32X4: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, _count * 4 * sizeof(BLS32), (GLint*)_data)); break;
case BL_UB_F32X1: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, _count * 1 * sizeof(BLF32), (GLfloat*)_data)); break;
case BL_UB_F32X2: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, _count * 2 * sizeof(BLF32), (GLfloat*)_data)); break;
case BL_UB_F32X3: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, _count * 3 * sizeof(BLF32), (GLfloat*)_data)); break;
case BL_UB_F32X4: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, _count * 5 * sizeof(BLF32), (GLfloat*)_data)); break;
case BL_UB_MAT2: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, 4 * sizeof(BLF32), (GLfloat*)_data)); break;
case BL_UB_MAT3: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, 9 * sizeof(BLF32), (GLfloat*)_data)); break;
case BL_UB_MAT4: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, 16 * sizeof(BLF32), (GLfloat*)_data)); break;
case BL_UB_MAT2X3: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, 6 * sizeof(BLF32), (GLfloat*)_data)); break;
case BL_UB_MAT3X2: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, 6 * sizeof(BLF32), (GLfloat*)_data)); break;
case BL_UB_MAT2X4: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, 8 * sizeof(BLF32), (GLfloat*)_data)); break;
case BL_UB_MAT4X2: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, 8 * sizeof(BLF32), (GLfloat*)_data)); break;
case BL_UB_MAT3X4: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, 12 * sizeof(BLF32), (GLfloat*)_data)); break;
case BL_UB_MAT4X3: GL_CHECK_INTERNAL(glBufferSubData(GL_UNIFORM_BUFFER, _tech->aUniformVars[_idx].uData.sGL.nOffset, 12 * sizeof(BLF32), (GLfloat*)_data)); break;
default:assert(0); break;
}
GL_CHECK_INTERNAL(glBindBuffer(GL_UNIFORM_BUFFER, 0));
}
else
{
if (_tech->aUniformVars[_idx].uData.sGL.nIndices == 0xFFFFFFFF)
_tech->aUniformVars[_idx].uData.sGL.nIndices = glGetUniformLocation(_tech->uData.sGL.nHandle, _tech->aUniformVars[_idx].aName);
switch (_tech->aUniformVars[_idx].eType)
{
case BL_UB_S32X1: GL_CHECK_INTERNAL(glUniform1iv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, (GLint*)_data)); break;
case BL_UB_S32X2: GL_CHECK_INTERNAL(glUniform2iv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, (GLint*)_data)); break;
case BL_UB_S32X3: GL_CHECK_INTERNAL(glUniform3iv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, (GLint*)_data)); break;
case BL_UB_S32X4: GL_CHECK_INTERNAL(glUniform4iv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, (GLint*)_data)); break;
case BL_UB_F32X1: GL_CHECK_INTERNAL(glUniform1fv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, (GLfloat*)_data)); break;
case BL_UB_F32X2: GL_CHECK_INTERNAL(glUniform2fv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, (GLfloat*)_data)); break;
case BL_UB_F32X3: GL_CHECK_INTERNAL(glUniform3fv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, (GLfloat*)_data)); break;
case BL_UB_F32X4: GL_CHECK_INTERNAL(glUniform4fv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, (GLfloat*)_data)); break;
case BL_UB_MAT2: GL_CHECK_INTERNAL(glUniformMatrix2fv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, FALSE, (GLfloat*)_data)); break;
case BL_UB_MAT3: GL_CHECK_INTERNAL(glUniformMatrix3fv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, FALSE, (GLfloat*)_data)); break;
case BL_UB_MAT4: GL_CHECK_INTERNAL(glUniformMatrix4fv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, FALSE, (GLfloat*)_data)); break;
case BL_UB_MAT2X3: GL_CHECK_INTERNAL(glUniformMatrix2x3fv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, FALSE, (GLfloat*)_data)); break;
case BL_UB_MAT3X2: GL_CHECK_INTERNAL(glUniformMatrix3x2fv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, FALSE, (GLfloat*)_data)); break;
case BL_UB_MAT2X4: GL_CHECK_INTERNAL(glUniformMatrix2x4fv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, FALSE, (GLfloat*)_data)); break;
case BL_UB_MAT4X2: GL_CHECK_INTERNAL(glUniformMatrix4x2fv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, FALSE, (GLfloat*)_data)); break;
case BL_UB_MAT3X4: GL_CHECK_INTERNAL(glUniformMatrix3x4fv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, FALSE, (GLfloat*)_data)); break;
case BL_UB_MAT4X3: GL_CHECK_INTERNAL(glUniformMatrix4x3fv(_tech->aUniformVars[_idx].uData.sGL.nIndices, _count, FALSE, (GLfloat*)_data)); break;
default:assert(0); break;
}
}
}
else
break;
}
for (BLU32 _idx = 0; _idx < 8; ++_idx)
{
if (_tech->aSamplerVars[_idx].aName[0])
{
if (_tech->aSamplerVars[_idx].uData.sGL.nHandle == 0xFFFFFFFF)
_tech->aSamplerVars[_idx].uData.sGL.nHandle = glGetUniformLocation(_tech->uData.sGL.nHandle, _tech->aSamplerVars[_idx].aName);
GL_CHECK_INTERNAL(glActiveTexture(GL_TEXTURE0 + _tech->aSamplerVars[_idx].nUnit));
_BLTextureBuffer* _tex = (_BLTextureBuffer*)_tech->aSamplerVars[_idx].pTex;
GLenum _target = GL_TEXTURE_2D;
switch (_tex->eTarget)
{
case BL_TT_1D: _target = GL_TEXTURE_2D; break;
case BL_TT_2D: _target = GL_TEXTURE_2D; break;
case BL_TT_3D: _target = GL_TEXTURE_3D; break;
case BL_TT_CUBE: _target = GL_TEXTURE_CUBE_MAP; break;
case BL_TT_ARRAY1D: _target = GL_TEXTURE_2D_ARRAY; break;
case BL_TT_ARRAY2D: _target = GL_TEXTURE_2D_ARRAY; break;
case BL_TT_ARRAYCUBE: _target = GL_TEXTURE_CUBE_MAP_ARRAY; break;
default:break;
}
GL_CHECK_INTERNAL(glBindTexture(_target, _tex->uData.sGL.nHandle));
GL_CHECK_INTERNAL(glUniform1i(_tech->aSamplerVars[_idx].uData.sGL.nHandle, _tech->aSamplerVars[_idx].nUnit));
}
else
break;
}
GLenum _prim;
switch (_geo->eVBTopology)
{
case BL_PT_POINTS: _prim = GL_POINTS; break;
case BL_PT_LINES: _prim = GL_LINES; break;
case BL_PI_LINELOOP: _prim = GL_LINE_LOOP; break;
case BL_PT_LINESTRIP: _prim = GL_LINE_STRIP; break;
case BL_PT_TRIANGLES: _prim = GL_TRIANGLES; break;
case BL_PT_TRIANGLESTRIP: _prim = GL_TRIANGLE_STRIP; break;
case BL_PT_TRIANGLEFAN: _prim = GL_TRIANGLE_FAN; break;
default: _prim = GL_TRIANGLES; break;
}
if (_geo->uData.sGL.nIBHandle != 0xFFFFFFFF)
{
GL_CHECK_INTERNAL(glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, _geo->uData.sGL.nIBHandle));
GL_CHECK_INTERNAL(glBindVertexArray(_geo->uData.sGL.nVAHandle));
if (_geo->uData.sGL.nInsHandle[0] == 0xFFFFFFFF)
{
GL_CHECK_INTERNAL(glDrawElements(_prim, (_geo->eIBFormat == BL_IF_32) ? (_geo->nIBSize >> 2) : (_geo->nIBSize >> 1), (_geo->eIBFormat == BL_IF_32) ? GL_UNSIGNED_INT : GL_UNSIGNED_SHORT, NULL));
}
else
{
GL_CHECK_INTERNAL(glDrawElementsInstanced(_prim, (_geo->eIBFormat == BL_IF_32) ? (_geo->nIBSize >> 2) : (_geo->nIBSize >> 1), (_geo->eIBFormat == BL_IF_32) ? GL_UNSIGNED_INT : GL_UNSIGNED_SHORT, NULL, _Instance));
}
GL_CHECK_INTERNAL(glBindVertexArray(0));
}
else
{
GL_CHECK_INTERNAL(glBindBuffer(GL_ARRAY_BUFFER, _geo->uData.sGL.nVBHandle));
GL_CHECK_INTERNAL(glBindVertexArray(_geo->uData.sGL.nVAHandle));
if (_geo->uData.sGL.nInsHandle[0] == 0xFFFFFFFF)
{
GL_CHECK_INTERNAL(glDrawArrays(_prim, 0, _geo->nVertexNum));
}
else
{
GL_CHECK_INTERNAL(glDrawArraysInstanced(_prim, 0, _geo->nVertexNum, _Instance));
}
GL_CHECK_INTERNAL(glBindVertexArray(0));
}
GL_CHECK_INTERNAL(glUseProgram(0));
}
#elif defined(BL_MTL_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_METAL_API)
{
_PipelineStateRefresh();
}
#elif defined(BL_VK_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_VULKAN_API)
{
_PipelineStateRefresh();
}
#elif defined(BL_DX_BACKEND)
if (_PrGpuMem->sHardwareCaps.eApiType == BL_DX_API)
{
_PipelineStateRefresh();
}
#endif
}
BLVoid
blFlush()
{
_GpuSwapBuffer();
}
| XC | 4 | timgates42/Bulllord-Engine | code/src/gpu.xc | [
"MIT"
]
|
MODULE GMEM
DESCRIPTION Global shared memory library
VERSION 1.0
SOURCE ITT Visual Information Solutions
BUILD_DATE OCT 28 2009
CHECKSUM MAPX4QWH
FUNCTION GMEM_READ 1 2 KEYWORDS
PROCEDURE GMEM_INFO 0 2 KEYWORDS
PROCEDURE GMEM_MAP 2 2 KEYWORDS
PROCEDURE GMEM_UNMAP 1 1 KEYWORDS
PROCEDURE GMEM_WRITE 2 5 KEYWORDS
| IDL | 1 | rogerionegri/GeotexInspector | GeotexInspector_Windows/IDL71/bin/bin.x86/idl_gmem.dlm | [
"MIT"
]
|
#define SORTING
#include "emittedparticle_simulateCS.hlsl"
| HLSL | 1 | rohankumardubey/WickedEngine | WickedEngine/shaders/emittedparticle_simulateCS_SORTING.hlsl | [
"MIT"
]
|
###########################
# Settings
# These can be overwritten any time.
# If they are not set yet, they will be
# overwritten with their default values
default fastfile_dir "${HOME}/.fastfile"
default fastfile_var_prefix "§"
###########################
# Impl
#
# Generate a shortcut
#
# Arguments:
# 1. name - The name of the shortcut (default: name of the file)
# 2. file - The file or directory to make the shortcut for
# STDOUT:
# => fastfile_print
#
function fastfile() {
test "$2" || 2="."
file=$(readlink -f "$2")
test "$1" || 1="$(basename "$file")"
name=$(echo "$1" | tr " " "_")
mkdir -p "${fastfile_dir}"
echo "$file" > "$(fastfile_resolv "$name")"
fastfile_sync
fastfile_print "$name"
}
#
# Resolve the location of a shortcut file (the database file, where the value is written!)
#
# Arguments:
# 1. name - The name of the shortcut
# STDOUT:
# The path to the shortcut file
#
function fastfile_resolv() {
echo "${fastfile_dir}/${1}"
}
#
# Get the real path of a shortcut
#
# Arguments:
# 1. name - The name of the shortcut
# STDOUT:
# The path
#
function fastfile_get() {
cat "$(fastfile_resolv "$1")"
}
#
# Print a shortcut
#
# Arguments:
# 1. name - The name of the shortcut
# STDOUT:
# Name and value of the shortcut
#
function fastfile_print() {
echo "${fastfile_var_prefix}${1} -> $(fastfile_get "$1")"
}
#
# List all shortcuts
#
# STDOUT:
# (=> fastfile_print) for each shortcut
#
function fastfile_ls() {
for f in "${fastfile_dir}"/*(N); do
file=$(basename "$f") # To enable simpler handling of spaces in file names
varkey=$(echo "$file" | tr " " "_")
# Special format for columns
echo "${fastfile_var_prefix}${varkey}|->|$(fastfile_get "$file")"
done | column -t -s "|"
}
#
# Remove a shortcut
#
# Arguments:
# 1. name - The name of the shortcut (default: name of the file)
# STDOUT:
# => fastfile_print
#
function fastfile_rm() {
fastfile_print "$1"
rm "$(fastfile_resolv "$1")"
unalias "${fastfile_var_prefix}${1}"
}
#
# Generate the aliases for the shortcuts
#
function fastfile_sync() {
for f in "${fastfile_dir}"/*(N); do
file=$(basename "$f") # To enable simpler handling of spaces in file names
varkey=$(echo "$file" | tr " " "_")
alias -g "${fastfile_var_prefix}${varkey}"="'$(fastfile_get "$file")'"
done
}
##################################
# Shortcuts
alias ff=fastfile
alias ffp=fastfile_print
alias ffrm=fastfile_rm
alias ffls=fastfile_ls
alias ffsync=fastfile_sync
##################################
# Init
fastfile_sync
| Shell | 5 | residwi/ohmyzsh | plugins/fastfile/fastfile.plugin.zsh | [
"MIT"
]
|
// run-pass
#![allow(non_upper_case_globals)]
const a: isize = 1;
const b: isize = a + 2;
pub fn main() {
assert_eq!(b, 3);
}
| Rust | 4 | Eric-Arellano/rust | src/test/ui/consts/const-const.rs | [
"ECL-2.0",
"Apache-2.0",
"MIT-0",
"MIT"
]
|
%{
/*
**** BEGIN LICENSE BLOCK *****
* Version: EPL 2.0/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Eclipse Public
* License Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.eclipse.org/legal/epl-v20.html
*
* Software distributed under the License is distributed on an "AS
* IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
* implied. See the License for the specific language governing
* rights and limitations under the License.
*
* Copyright (C) 2008-2017 Thomas E Enebo <[email protected]>
*
* Alternatively, the contents of this file may be used under the terms of
* either of the GNU General Public License Version 2 or later (the "GPL"),
* or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the EPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the EPL, the GPL or the LGPL.
***** END LICENSE BLOCK *****/
package org.jruby.parser;
import java.io.IOException;
import org.jruby.RubySymbol;
import org.jruby.ast.ArgsNode;
import org.jruby.ast.ArgumentNode;
import org.jruby.ast.ArrayNode;
import org.jruby.ast.AssignableNode;
import org.jruby.ast.BackRefNode;
import org.jruby.ast.BeginNode;
import org.jruby.ast.BlockAcceptingNode;
import org.jruby.ast.BlockArgNode;
import org.jruby.ast.BlockNode;
import org.jruby.ast.BlockPassNode;
import org.jruby.ast.BreakNode;
import org.jruby.ast.ClassNode;
import org.jruby.ast.ClassVarNode;
import org.jruby.ast.ClassVarAsgnNode;
import org.jruby.ast.Colon3Node;
import org.jruby.ast.ConstNode;
import org.jruby.ast.ConstDeclNode;
import org.jruby.ast.DefinedNode;
import org.jruby.ast.DStrNode;
import org.jruby.ast.DSymbolNode;
import org.jruby.ast.DXStrNode;
import org.jruby.ast.DefnNode;
import org.jruby.ast.DefsNode;
import org.jruby.ast.DotNode;
import org.jruby.ast.EncodingNode;
import org.jruby.ast.EnsureNode;
import org.jruby.ast.EvStrNode;
import org.jruby.ast.FalseNode;
import org.jruby.ast.FileNode;
import org.jruby.ast.FCallNode;
import org.jruby.ast.FixnumNode;
import org.jruby.ast.FloatNode;
import org.jruby.ast.ForNode;
import org.jruby.ast.GlobalAsgnNode;
import org.jruby.ast.GlobalVarNode;
import org.jruby.ast.HashNode;
import org.jruby.ast.InstAsgnNode;
import org.jruby.ast.InstVarNode;
import org.jruby.ast.IterNode;
import org.jruby.ast.KeywordArgNode;
import org.jruby.ast.LambdaNode;
import org.jruby.ast.ListNode;
import org.jruby.ast.LiteralNode;
import org.jruby.ast.ModuleNode;
import org.jruby.ast.MultipleAsgnNode;
import org.jruby.ast.NextNode;
import org.jruby.ast.NilImplicitNode;
import org.jruby.ast.NilNode;
import org.jruby.ast.Node;
import org.jruby.ast.NonLocalControlFlowNode;
import org.jruby.ast.NumericNode;
import org.jruby.ast.OptArgNode;
import org.jruby.ast.PostExeNode;
import org.jruby.ast.PreExe19Node;
import org.jruby.ast.RationalNode;
import org.jruby.ast.RedoNode;
import org.jruby.ast.RegexpNode;
import org.jruby.ast.RequiredKeywordArgumentValueNode;
import org.jruby.ast.RescueBodyNode;
import org.jruby.ast.RestArgNode;
import org.jruby.ast.RetryNode;
import org.jruby.ast.ReturnNode;
import org.jruby.ast.SClassNode;
import org.jruby.ast.SelfNode;
import org.jruby.ast.StarNode;
import org.jruby.ast.StrNode;
import org.jruby.ast.TrueNode;
import org.jruby.ast.UnnamedRestArgNode;
import org.jruby.ast.UntilNode;
import org.jruby.ast.VAliasNode;
import org.jruby.ast.WhileNode;
import org.jruby.ast.XStrNode;
import org.jruby.ast.YieldNode;
import org.jruby.ast.ZArrayNode;
import org.jruby.ast.ZSuperNode;
import org.jruby.ast.types.ILiteralNode;
import org.jruby.common.IRubyWarnings;
import org.jruby.common.IRubyWarnings.ID;
import org.jruby.lexer.LexerSource;
import org.jruby.lexer.LexingCommon;
import org.jruby.lexer.yacc.RubyLexer;
import org.jruby.lexer.yacc.StackState;
import org.jruby.lexer.yacc.StrTerm;
import org.jruby.util.ByteList;
import org.jruby.util.CommonByteLists;
import org.jruby.util.KeyValuePair;
import org.jruby.util.StringSupport;
import static org.jruby.lexer.LexingCommon.EXPR_BEG;
import static org.jruby.lexer.LexingCommon.EXPR_FITEM;
import static org.jruby.lexer.LexingCommon.EXPR_FNAME;
import static org.jruby.lexer.LexingCommon.EXPR_ENDFN;
import static org.jruby.lexer.LexingCommon.EXPR_ENDARG;
import static org.jruby.lexer.LexingCommon.EXPR_END;
import static org.jruby.lexer.LexingCommon.EXPR_LABEL;
import static org.jruby.parser.ParserSupport.arg_blk_pass;
import static org.jruby.parser.ParserSupport.node_assign;
public class RubyParser {
protected ParserSupport support;
protected RubyLexer lexer;
public RubyParser(LexerSource source, IRubyWarnings warnings) {
this.support = new ParserSupport();
this.lexer = new RubyLexer(support, source, warnings);
support.setLexer(lexer);
support.setWarnings(warnings);
}
@Deprecated
public RubyParser(LexerSource source) {
this(new ParserSupport(), source);
}
@Deprecated
public RubyParser(ParserSupport support, LexerSource source) {
this.support = support;
lexer = new RubyLexer(support, source);
support.setLexer(lexer);
}
public void setWarnings(IRubyWarnings warnings) {
support.setWarnings(warnings);
lexer.setWarnings(warnings);
}
%}
// patch_parser.rb will look for token lines with {{ and }} within it to put
// in reasonable strings we expect during a parsing error.
%token <Integer> keyword_class /* {{class}} */
%token <Integer> keyword_module /* {{module}} */
%token <Integer> keyword_def /* {{def}} */
%token <Integer> keyword_undef /* {{undef}} */
%token <Integer> keyword_begin /* {{begin}} */
%token <Integer> keyword_rescue /* {{rescue}} */
%token <Integer> keyword_ensure /* {{ensure}} */
%token <Integer> keyword_end /* {{end}} */
%token <Integer> keyword_if /* {{if}} */
%token <Integer> keyword_unless /* {{unless}} */
%token <Integer> keyword_then /* {{then}} */
%token <Integer> keyword_elsif /* {{elsif}} */
%token <Integer> keyword_else /* {{else}} */
%token <Integer> keyword_case /* {{case}} */
%token <Integer> keyword_when /* {{when}} */
%token <Integer> keyword_while /* {{while}} */
%token <Integer> keyword_until /* {{until}} */
%token <Integer> keyword_for /* {{for}} */
%token <Integer> keyword_break /* {{break}} */
%token <Integer> keyword_next /* {{next}} */
%token <Integer> keyword_redo /* {{redo}} */
%token <Integer> keyword_retry /* {{retry}} */
%token <Integer> keyword_in /* {{in}} */
%token <Integer> keyword_do /* {{do}} */
%token <Integer> keyword_do_cond /* {{do (for condition)}} */
%token <Integer> keyword_do_block /* {{do (for block)}} */
%token <Integer> keyword_return /* {{return}} */
%token <Integer> keyword_yield /* {{yield}} */
%token <Integer> keyword_super /* {{super}} */
%token <Integer> keyword_self /* {{self}} */
%token <Integer> keyword_nil /* {{nil}} */
%token <Integer> keyword_true /* {{true}} */
%token <Integer> keyword_false /* {{false}} */
%token <Integer> keyword_and /* {{and}} */
%token <Integer> keyword_or /* {{or}} */
%token <Integer> keyword_not /* {{not}} */
%token <Integer> modifier_if /* {{if (modifier)}} */
%token <Integer> modifier_unless /* {{unless (modifier)}} */
%token <Integer> modifier_while /* {{while (modifier)}} */
%token <Integer> modifier_until /* {{until (modifier)}} */
%token <Integer> modifier_rescue /* {{rescue (modifier)}} */
%token <Integer> keyword_alias /* {{alias}} */
%token <Integer> keyword_defined /* {{defined}} */
%token <Integer> keyword_BEGIN /* {{BEGIN}} */
%token <Integer> keyword_END /* {{END}} */
%token <Integer> keyword__LINE__ /* {{__LINE__}} */
%token <Integer> keyword__FILE__ /* {{__FILE__}} */
%token <Integer> keyword__ENCODING__ /* {{__ENCODING__}} */
%token <Integer> keyword_do_lambda /* {{do (for lambda)}} */
%token <ByteList> tIDENTIFIER
%token <ByteList> tFID
%token <ByteList> tGVAR
%token <ByteList> tIVAR
%token <ByteList> tCONSTANT
%token <ByteList> tCVAR
%token <ByteList> tLABEL
%token <StrNode> tCHAR
%token <ByteList> tUPLUS /* {{unary+}} */
%token <ByteList> tUMINUS /* {{unary-}} */
%token <ByteList> tUMINUS_NUM
%token <ByteList> tPOW /* {{**}} */
%token <ByteList> tCMP /* {{<=>}} */
%token <ByteList> tEQ /* {{==}} */
%token <ByteList> tEQQ /* {{===}} */
%token <ByteList> tNEQ /* {{!=}} */
%token <ByteList> tGEQ /* {{>=}} */
%token <ByteList> tLEQ /* {{<=}} */
%token <ByteList> tANDOP /* {{&&}}*/
%token <ByteList> tOROP /* {{||}} */
%token <ByteList> tMATCH /* {{=~}} */
%token <ByteList> tNMATCH /* {{!~}} */
%token <ByteList> tDOT /* {{.}} - '.' in ruby and not a token */
%token <ByteList> tDOT2 /* {{..}} */
%token <ByteList> tDOT3 /* {{...}} */
%token <ByteList> tAREF /* {{[]}} */
%token <ByteList> tASET /* {{[]=}} */
%token <ByteList> tLSHFT /* {{<<}} */
%token <ByteList> tRSHFT /* {{>>}} */
%token <ByteList> tANDDOT /* {{&.}} */
%token <ByteList> tCOLON2 /* {{::}} */
%token <ByteList> tCOLON3 /* {{:: at EXPR_BEG}} */
%token <ByteList> tOP_ASGN /* +=, -= etc. */
%token <ByteList> tASSOC /* {{=>}} */
%token <Integer> tLPAREN /* {{(}} */
%token <Integer> tLPAREN2 /* {{(}} - '(' in ruby and not a token */
%token <ByteList> tRPAREN /* {{)}} */
%token <Integer> tLPAREN_ARG /* {{( arg}} */
%token <ByteList> tLBRACK /* {{[}} */
%token <ByteList> tRBRACK /* {{]}} */
%token <Integer> tLBRACE /* {{{}} */
%token <Integer> tLBRACE_ARG /* {{{ arg}} */
%token <ByteList> tSTAR /* {{*}} */
%token <ByteList> tSTAR2 /* {{*}} - '*' in ruby and not a token */
%token <ByteList> tAMPER /* {{&}} */
%token <ByteList> tAMPER2 /* {{&}} - '&' in ruby and not a token */
%token <ByteList> tTILDE /* {{`}} - '`' in ruby and not a token */
%token <ByteList> tPERCENT /* {{%}} - '%' in ruby and not a token */
%token <ByteList> tDIVIDE /* {{/}} - '/' in ruby and not a token */
%token <ByteList> tPLUS /* {{+}} - '+' in ruby and not a token */
%token <ByteList> tMINUS /* {{-}} - '-' in ruby and not a token */
%token <ByteList> tLT /* {{<}} - '<' in ruby and not a token */
%token <ByteList> tGT /* {{>}} - '>' in ruby and not a token */
%token <ByteList> tPIPE /* {{|}} - '|' in ruby and not a token */
%token <ByteList> tBANG /* {{!}} - '!' in ruby and not a token */
%token <ByteList> tCARET /* {{^}} - '^' in ruby and not a token */
%token <Integer> tLCURLY /* {{{}} - '{' in ruby and not a token */
%token <ByteList> tRCURLY /* {{}}} - '}' in ruby and not a token */
%token <ByteList> tBACK_REF2 /* {{`}} - '`' in ruby and not a token */
%token <ByteList> tSYMBEG tSTRING_BEG tXSTRING_BEG tREGEXP_BEG tWORDS_BEG tQWORDS_BEG
%token <ByteList> tSTRING_DBEG tSTRING_DVAR tSTRING_END
%token <ByteList> tLAMBDA /* {{->}} */
%token <ByteList> tLAMBEG
%token <Node> tNTH_REF tBACK_REF tSTRING_CONTENT tINTEGER tIMAGINARY
%token <FloatNode> tFLOAT
%token <RationalNode> tRATIONAL
%token <RegexpNode> tREGEXP_END
%type <ByteList> sym symbol operation operation2 operation3 op fname cname
%type <ByteList> f_norm_arg restarg_mark
%type <ByteList> dot_or_colon blkarg_mark
%type <RestArgNode> f_rest_arg
%type <Node> singleton strings string string1 xstring regexp
%type <Node> string_contents xstring_contents method_call
%type <Object> string_content
%type <Node> regexp_contents
%type <Node> words qwords word literal dsym cpath command_asgn command_call
%type <NumericNode> numeric simple_numeric
%type <Node> mrhs_arg
%type <Node> compstmt bodystmt stmts stmt expr arg primary command
%type <Node> stmt_or_begin
%type <Node> expr_value expr_value_do primary_value opt_else cases if_tail exc_var rel_expr
%type <Node> call_args opt_ensure paren_args superclass
%type <Node> command_args var_ref opt_paren_args block_call block_command
%type <Node> command_rhs arg_rhs
%type <Node> f_opt
%type <Node> undef_list
%type <Node> string_dvar backref
%type <ArgsNode> f_args f_larglist block_param block_param_def opt_block_param
%type <Object> f_arglist
%type <Node> mrhs mlhs_item mlhs_node arg_value case_body exc_list aref_args
%type <Node> lhs none args
%type <ListNode> qword_list word_list
%type <ListNode> f_arg f_optarg
%type <ListNode> f_marg_list symbol_list
%type <ListNode> qsym_list symbols qsymbols
// FIXME: These are node until a better understanding of underlying type
%type <ArgsTailHolder> opt_args_tail opt_block_args_tail block_args_tail args_tail
%type <Node> f_kw f_block_kw
%type <ListNode> f_block_kwarg f_kwarg
%type <HashNode> assoc_list
%type <HashNode> assocs
%type <KeyValuePair> assoc
%type <ListNode> mlhs_head mlhs_post
%type <ListNode> f_block_optarg
%type <BlockPassNode> opt_block_arg block_arg none_block_pass
%type <BlockArgNode> opt_f_block_arg f_block_arg
%type <IterNode> brace_block do_block cmd_brace_block brace_body do_body
%type <MultipleAsgnNode> mlhs mlhs_basic
%type <RescueBodyNode> opt_rescue
%type <AssignableNode> var_lhs
%type <LiteralNode> fsym
%type <Node> fitem
%type <Node> f_arg_item
%type <Node> bv_decls
%type <Node> opt_bv_decl lambda_body
%type <LambdaNode> lambda
%type <Node> mlhs_inner f_block_opt for_var
%type <Node> opt_call_args f_marg f_margs
%type <ByteList> bvar
%type <ByteList> reswords f_bad_arg relop
%type <ByteList> rparen rbracket
%type <Node> top_compstmt top_stmts top_stmt
%token <ByteList> tSYMBOLS_BEG
%token <ByteList> tQSYMBOLS_BEG
%token <ByteList> tDSTAR /* {{**arg}} */
%token <ByteList> tSTRING_DEND
%type <ByteList> kwrest_mark f_kwrest f_label
%type <ByteList> call_op call_op2
%type <ArgumentNode> f_arg_asgn
%type <FCallNode> fcall
%token <ByteList> tLABEL_END
%type <Integer> k_return k_class k_module k_else
// For error reporting
%token <Integer> '\\' /* {{backslash}} */
%token <Integer> tSP /* {{escaped space}} */
%token <Integer> '\t' /* {{escaped horizontal tab}} */
%token <Integer> '\f' /* {{escaped form feed}} */
%token <Integer> '\r' /* {{escaped carriage return}} */
%token <Integer> '\v' /* {{escaped vertical tab}} */
/*
* precedence table
*/
%nonassoc tLOWEST
%nonassoc tLBRACE_ARG
%nonassoc modifier_if modifier_unless modifier_while modifier_until
%left keyword_or keyword_and
%right keyword_not
%nonassoc keyword_defined
%right '=' tOP_ASGN
%left modifier_rescue
%right '?' ':'
%nonassoc tDOT2 tDOT3
%left tOROP
%left tANDOP
%nonassoc tCMP tEQ tEQQ tNEQ tMATCH tNMATCH
%left tGT tGEQ tLT tLEQ
%left tPIPE tCARET
%left tAMPER2
%left tLSHFT tRSHFT
%left tPLUS tMINUS
%left tSTAR2 tDIVIDE tPERCENT
%right tUMINUS_NUM tUMINUS
%right tPOW
%right tBANG tTILDE tUPLUS
//%token <Integer> tLAST_TOKEN
%%
program : {
lexer.setState(EXPR_BEG);
support.initTopLocalVariables();
} top_compstmt {
if ($2 != null && !support.getConfiguration().isEvalParse()) {
/* last expression should not be void */
if ($2 instanceof BlockNode) {
support.void_expr($<BlockNode>2.getLast());
} else {
support.void_expr($2);
}
}
support.getResult().setAST(support.addRootNode($2));
}
top_compstmt : top_stmts opt_terms {
$$ = support.void_stmts($1);
}
top_stmts : none
| top_stmt {
$$ = support.newline_node($1, support.getPosition($1));
}
| top_stmts terms top_stmt {
$$ = support.appendToBlock($1, support.newline_node($3, support.getPosition($3)));
}
| error top_stmt {
$$ = $2;
}
top_stmt : stmt
| keyword_BEGIN tLCURLY top_compstmt tRCURLY {
support.getResult().addBeginNode(new PreExe19Node($1, support.getCurrentScope(), $3, lexer.getRubySourceline()));
$$ = null;
}
bodystmt : compstmt opt_rescue k_else {
if ($2 == null) support.yyerror("else without rescue is useless");
} compstmt opt_ensure {
$$ = support.new_bodystmt($1, $2, $5, $6);
}
| compstmt opt_rescue opt_ensure {
$$ = support.new_bodystmt($1, $2, null, $3);
}
compstmt : stmts opt_terms {
$$ = support.void_stmts($1);
}
stmts : none
| stmt_or_begin {
$$ = support.newline_node($1, support.getPosition($1));
}
| stmts terms stmt_or_begin {
$$ = support.appendToBlock($1, support.newline_node($3, support.getPosition($3)));
}
| error stmt {
$$ = $2;
}
stmt_or_begin : stmt {
$$ = $1;
}
// FIXME: How can this new begin ever work? is yyerror conditional in MRI?
| keyword_begin {
support.yyerror("BEGIN is permitted only at toplevel");
} tLCURLY top_compstmt tRCURLY {
$$ = new BeginNode($1, support.makeNullNil($2));
}
stmt : keyword_alias fitem {
lexer.setState(EXPR_FNAME|EXPR_FITEM);
} fitem {
$$ = ParserSupport.newAlias($1, $2, $4);
}
| keyword_alias tGVAR tGVAR {
$$ = new VAliasNode($1, support.symbolID($2), support.symbolID($3));
}
| keyword_alias tGVAR tBACK_REF {
$$ = new VAliasNode($1, support.symbolID($2), support.symbolID($<BackRefNode>3.getByteName()));
}
| keyword_alias tGVAR tNTH_REF {
support.yyerror("can't make alias for the number variables");
}
| keyword_undef undef_list {
$$ = $2;
}
| stmt modifier_if expr_value {
$$ = support.new_if(support.getPosition($1), support.cond($3), $1, null);
support.fixpos($<Node>$, $3);
}
| stmt modifier_unless expr_value {
$$ = support.new_if(support.getPosition($1), support.cond($3), null, $1);
support.fixpos($<Node>$, $3);
}
| stmt modifier_while expr_value {
if ($1 != null && $1 instanceof BeginNode) {
$$ = new WhileNode(support.getPosition($1), support.cond($3), $<BeginNode>1.getBodyNode(), false);
} else {
$$ = new WhileNode(support.getPosition($1), support.cond($3), $1, true);
}
}
| stmt modifier_until expr_value {
if ($1 != null && $1 instanceof BeginNode) {
$$ = new UntilNode(support.getPosition($1), support.cond($3), $<BeginNode>1.getBodyNode(), false);
} else {
$$ = new UntilNode(support.getPosition($1), support.cond($3), $1, true);
}
}
| stmt modifier_rescue stmt {
$$ = support.newRescueModNode($1, $3);
}
| keyword_END tLCURLY compstmt tRCURLY {
if (support.isInDef()) {
support.warn(ID.END_IN_METHOD, $1, "END in method; use at_exit");
}
$$ = new PostExeNode($1, $3, lexer.getRubySourceline());
}
| command_asgn
| mlhs '=' command_call {
support.value_expr(lexer, $3);
$$ = node_assign($1, $3);
}
| lhs '=' mrhs {
support.value_expr(lexer, $3);
$$ = node_assign($1, $3);
}
| mlhs '=' mrhs_arg {
$$ = node_assign($1, $3);
}
| expr
command_asgn : lhs '=' command_rhs {
support.value_expr(lexer, $3);
$$ = node_assign($1, $3);
}
| var_lhs tOP_ASGN command_rhs {
support.value_expr(lexer, $3);
$$ = support.new_op_assign($1, $2, $3);
}
| primary_value '[' opt_call_args rbracket tOP_ASGN command_rhs {
support.value_expr(lexer, $6);
$$ = support.new_ary_op_assign($1, $5, $3, $6);
}
| primary_value call_op tIDENTIFIER tOP_ASGN command_rhs {
support.value_expr(lexer, $5);
$$ = support.new_attr_op_assign($1, $2, $5, $3, $4);
}
| primary_value call_op tCONSTANT tOP_ASGN command_rhs {
support.value_expr(lexer, $5);
$$ = support.new_attr_op_assign($1, $2, $5, $3, $4);
}
| primary_value tCOLON2 tCONSTANT tOP_ASGN command_rhs {
int line = $1.getLine();
$$ = support.new_const_op_assign(line, support.new_colon2(line, $1, $3), $4, $5);
}
| primary_value tCOLON2 tIDENTIFIER tOP_ASGN command_rhs {
support.value_expr(lexer, $5);
$$ = support.new_attr_op_assign($1, $2, $5, $3, $4);
}
| backref tOP_ASGN command_rhs {
support.backrefAssignError($1);
}
command_rhs : command_call %prec tOP_ASGN {
support.value_expr(lexer, $1);
$$ = $1;
}
| command_call modifier_rescue stmt {
support.value_expr(lexer, $1);
$$ = support.newRescueModNode($1, $3);
}
| command_asgn
// Node:expr *CURRENT* all but arg so far
expr : command_call
| expr keyword_and expr {
$$ = support.newAndNode($1, $3);
}
| expr keyword_or expr {
$$ = support.newOrNode($1, $3);
}
| keyword_not opt_nl expr {
$$ = support.getOperatorCallNode(support.method_cond($3), lexer.BANG);
}
| tBANG command_call {
$$ = support.getOperatorCallNode(support.method_cond($2), $1);
}
| arg
expr_value : expr {
support.value_expr(lexer, $1);
}
expr_value_do : {
lexer.getConditionState().push1();
} expr_value do {
lexer.getConditionState().pop();
} {
$$ = $2;
}
// Node:command - call with or with block on end [!null]
command_call : command
| block_command
// Node:block_command - A call with a block (foo.bar {...}, foo::bar {...}, bar {...}) [!null]
block_command : block_call
| block_call call_op2 operation2 command_args {
$$ = support.new_call($1, $2, $3, $4, null, (@3.start >> 16));
}
// :brace_block - [!null]
cmd_brace_block : tLBRACE_ARG brace_body tRCURLY {
$$ = $2;
}
fcall : operation {
$$ = support.new_fcall($1);
}
// Node:command - fcall/call/yield/super [!null]
command : fcall command_args %prec tLOWEST {
support.frobnicate_fcall_args($1, $2, null);
$$ = $1;
}
| fcall command_args cmd_brace_block {
support.frobnicate_fcall_args($1, $2, $3);
$$ = $1;
}
| primary_value call_op operation2 command_args %prec tLOWEST {
$$ = support.new_call($1, $2, $3, $4, null, (@3.start >> 16));
}
| primary_value call_op operation2 command_args cmd_brace_block {
$$ = support.new_call($1, $2, $3, $4, $5, (@3.start >> 16));
}
| primary_value tCOLON2 operation2 command_args %prec tLOWEST {
$$ = support.new_call($1, $3, $4, null);
}
| primary_value tCOLON2 operation2 command_args cmd_brace_block {
$$ = support.new_call($1, $3, $4, $5);
}
| keyword_super command_args {
$$ = support.new_super($1, $2);
}
| keyword_yield command_args {
$$ = support.new_yield($1, $2);
}
| k_return call_args {
$$ = new ReturnNode($1, support.ret_args($2, $1));
}
| keyword_break call_args {
$$ = new BreakNode($1, support.ret_args($2, $1));
}
| keyword_next call_args {
$$ = new NextNode($1, support.ret_args($2, $1));
}
// MultipleAssigNode:mlhs - [!null]
mlhs : mlhs_basic
| tLPAREN mlhs_inner rparen {
$$ = $2;
}
// MultipleAssignNode:mlhs_entry - mlhs w or w/o parens [!null]
mlhs_inner : mlhs_basic {
$$ = $1;
}
| tLPAREN mlhs_inner rparen {
$$ = new MultipleAsgnNode($1, support.newArrayNode($1, $2), null, null);
}
// MultipleAssignNode:mlhs_basic - multiple left hand side (basic because used in multiple context) [!null]
mlhs_basic : mlhs_head {
$$ = new MultipleAsgnNode($1.getLine(), $1, null, null);
}
| mlhs_head mlhs_item {
$$ = new MultipleAsgnNode($1.getLine(), $1.add($2), null, null);
}
| mlhs_head tSTAR mlhs_node {
$$ = new MultipleAsgnNode($1.getLine(), $1, $3, (ListNode) null);
}
| mlhs_head tSTAR mlhs_node ',' mlhs_post {
$$ = new MultipleAsgnNode($1.getLine(), $1, $3, $5);
}
| mlhs_head tSTAR {
$$ = new MultipleAsgnNode($1.getLine(), $1, new StarNode(lexer.getRubySourceline()), null);
}
| mlhs_head tSTAR ',' mlhs_post {
$$ = new MultipleAsgnNode($1.getLine(), $1, new StarNode(lexer.getRubySourceline()), $4);
}
| tSTAR mlhs_node {
$$ = new MultipleAsgnNode($2.getLine(), null, $2, null);
}
| tSTAR mlhs_node ',' mlhs_post {
$$ = new MultipleAsgnNode($2.getLine(), null, $2, $4);
}
| tSTAR {
$$ = new MultipleAsgnNode(lexer.getRubySourceline(), null, new StarNode(lexer.getRubySourceline()), null);
}
| tSTAR ',' mlhs_post {
$$ = new MultipleAsgnNode(lexer.getRubySourceline(), null, new StarNode(lexer.getRubySourceline()), $3);
}
mlhs_item : mlhs_node
| tLPAREN mlhs_inner rparen {
$$ = $2;
}
// Set of mlhs terms at front of mlhs (a, *b, d, e = arr # a is head)
mlhs_head : mlhs_item ',' {
$$ = support.newArrayNode($1.getLine(), $1);
}
| mlhs_head mlhs_item ',' {
$$ = $1.add($2);
}
// Set of mlhs terms at end of mlhs (a, *b, d, e = arr # d,e is post)
mlhs_post : mlhs_item {
$$ = support.newArrayNode($1.getLine(), $1);
}
| mlhs_post ',' mlhs_item {
$$ = $1.add($3);
}
mlhs_node : /*mri:user_variable*/ tIDENTIFIER {
$$ = support.assignableLabelOrIdentifier($1, null);
}
| tIVAR {
$$ = new InstAsgnNode(lexer.tokline, support.symbolID($1), NilImplicitNode.NIL);
}
| tGVAR {
$$ = new GlobalAsgnNode(lexer.tokline, support.symbolID($1), NilImplicitNode.NIL);
}
| tCONSTANT {
if (support.isInDef()) support.compile_error("dynamic constant assignment");
$$ = new ConstDeclNode(lexer.tokline, support.symbolID($1), null, NilImplicitNode.NIL);
}
| tCVAR {
$$ = new ClassVarAsgnNode(lexer.tokline, support.symbolID($1), NilImplicitNode.NIL);
} /*mri:user_variable*/
| /*mri:keyword_variable*/ keyword_nil {
support.compile_error("Can't assign to nil");
$$ = null;
}
| keyword_self {
support.compile_error("Can't change the value of self");
$$ = null;
}
| keyword_true {
support.compile_error("Can't assign to true");
$$ = null;
}
| keyword_false {
support.compile_error("Can't assign to false");
$$ = null;
}
| keyword__FILE__ {
support.compile_error("Can't assign to __FILE__");
$$ = null;
}
| keyword__LINE__ {
support.compile_error("Can't assign to __LINE__");
$$ = null;
}
| keyword__ENCODING__ {
support.compile_error("Can't assign to __ENCODING__");
$$ = null;
} /*mri:keyword_variable*/
| primary_value '[' opt_call_args rbracket {
$$ = support.aryset($1, $3);
}
| primary_value call_op tIDENTIFIER {
$$ = support.attrset($1, $2, $3);
}
| primary_value tCOLON2 tIDENTIFIER {
$$ = support.attrset($1, $3);
}
| primary_value call_op tCONSTANT {
$$ = support.attrset($1, $2, $3);
}
| primary_value tCOLON2 tCONSTANT {
if (support.isInDef()) support.yyerror("dynamic constant assignment");
Integer position = support.getPosition($1);
$$ = new ConstDeclNode(position, (RubySymbol) null, support.new_colon2(position, $1, $3), NilImplicitNode.NIL);
}
| tCOLON3 tCONSTANT {
if (support.isInDef()) {
support.yyerror("dynamic constant assignment");
}
Integer position = lexer.tokline;
$$ = new ConstDeclNode(position, (RubySymbol) null, support.new_colon3(position, $2), NilImplicitNode.NIL);
}
| backref {
support.backrefAssignError($1);
}
// [!null or throws]
lhs : /*mri:user_variable*/ tIDENTIFIER {
$$ = support.assignableLabelOrIdentifier($1, null);
}
| tIVAR {
$$ = new InstAsgnNode(lexer.tokline, support.symbolID($1), NilImplicitNode.NIL);
}
| tGVAR {
$$ = new GlobalAsgnNode(lexer.tokline, support.symbolID($1), NilImplicitNode.NIL);
}
| tCONSTANT {
if (support.isInDef()) support.compile_error("dynamic constant assignment");
$$ = new ConstDeclNode(lexer.tokline, support.symbolID($1), null, NilImplicitNode.NIL);
}
| tCVAR {
$$ = new ClassVarAsgnNode(lexer.tokline, support.symbolID($1), NilImplicitNode.NIL);
} /*mri:user_variable*/
| /*mri:keyword_variable*/ keyword_nil {
support.compile_error("Can't assign to nil");
$$ = null;
}
| keyword_self {
support.compile_error("Can't change the value of self");
$$ = null;
}
| keyword_true {
support.compile_error("Can't assign to true");
$$ = null;
}
| keyword_false {
support.compile_error("Can't assign to false");
$$ = null;
}
| keyword__FILE__ {
support.compile_error("Can't assign to __FILE__");
$$ = null;
}
| keyword__LINE__ {
support.compile_error("Can't assign to __LINE__");
$$ = null;
}
| keyword__ENCODING__ {
support.compile_error("Can't assign to __ENCODING__");
$$ = null;
} /*mri:keyword_variable*/
| primary_value '[' opt_call_args rbracket {
$$ = support.aryset($1, $3);
}
| primary_value call_op tIDENTIFIER {
$$ = support.attrset($1, $2, $3);
}
| primary_value tCOLON2 tIDENTIFIER {
$$ = support.attrset($1, $3);
}
| primary_value call_op tCONSTANT {
$$ = support.attrset($1, $2, $3);
}
| primary_value tCOLON2 tCONSTANT {
if (support.isInDef()) {
support.yyerror("dynamic constant assignment");
}
Integer position = support.getPosition($1);
$$ = new ConstDeclNode(position, (RubySymbol) null, support.new_colon2(position, $1, $3), NilImplicitNode.NIL);
}
| tCOLON3 tCONSTANT {
if (support.isInDef()) {
support.yyerror("dynamic constant assignment");
}
Integer position = lexer.tokline;
$$ = new ConstDeclNode(position, (RubySymbol) null, support.new_colon3(position, $2), NilImplicitNode.NIL);
}
| backref {
support.backrefAssignError($1);
}
cname : tIDENTIFIER {
support.yyerror("class/module name must be CONSTANT", @1);
}
| tCONSTANT {
$$ = $1;
}
cpath : tCOLON3 cname {
$$ = support.new_colon3(lexer.tokline, $2);
}
| cname {
$$ = support.new_colon2(lexer.tokline, null, $1);
}
| primary_value tCOLON2 cname {
$$ = support.new_colon2(support.getPosition($1), $1, $3);
}
// ByteList:fname - A function name [!null]
fname : tIDENTIFIER {
$$ = $1;
}
| tCONSTANT {
$$ = $1;
}
| tFID {
$$ = $1;
}
| op {
lexer.setState(EXPR_ENDFN);
$$ = $1;
}
| reswords {
lexer.setState(EXPR_ENDFN);
$$ = $1;
}
// LiteralNode:fsym
fsym : fname {
$$ = new LiteralNode(lexer.getRubySourceline(), support.symbolID($1));
}
| symbol {
$$ = new LiteralNode(lexer.getRubySourceline(), support.symbolID($1));
}
// Node:fitem
fitem : fsym { // LiteralNode
$$ = $1;
}
| dsym { // SymbolNode/DSymbolNode
$$ = $1;
}
undef_list : fitem {
$$ = ParserSupport.newUndef($1.getLine(), $1);
}
| undef_list ',' {
lexer.setState(EXPR_FNAME|EXPR_FITEM);
} fitem {
$$ = support.appendToBlock($1, ParserSupport.newUndef($1.getLine(), $4));
}
// ByteList:op
op : tPIPE {
$$ = $1;
}
| tCARET {
$$ = $1;
}
| tAMPER2 {
$$ = $1;
}
| tCMP {
$$ = $1;
}
| tEQ {
$$ = $1;
}
| tEQQ {
$$ = $1;
}
| tMATCH {
$$ = $1;
}
| tNMATCH {
$$ = $1;
}
| tGT {
$$ = $1;
}
| tGEQ {
$$ = $1;
}
| tLT {
$$ = $1;
}
| tLEQ {
$$ = $1;
}
| tNEQ {
$$ = $1;
}
| tLSHFT {
$$ = $1;
}
| tRSHFT{
$$ = $1;
}
| tDSTAR {
$$ = $1;
}
| tPLUS {
$$ = $1;
}
| tMINUS {
$$ = $1;
}
| tSTAR2 {
$$ = $1;
}
| tSTAR {
$$ = $1;
}
| tDIVIDE {
$$ = $1;
}
| tPERCENT {
$$ = $1;
}
| tPOW {
$$ = $1;
}
| tBANG {
$$ = $1;
}
| tTILDE {
$$ = $1;
}
| tUPLUS {
$$ = $1;
}
| tUMINUS {
$$ = $1;
}
| tAREF {
$$ = $1;
}
| tASET {
$$ = $1;
}
| tBACK_REF2 {
$$ = $1;
}
// String:op
reswords : keyword__LINE__ {
$$ = RubyLexer.Keyword.__LINE__.bytes;
}
| keyword__FILE__ {
$$ = RubyLexer.Keyword.__FILE__.bytes;
}
| keyword__ENCODING__ {
$$ = RubyLexer.Keyword.__ENCODING__.bytes;
}
| keyword_BEGIN {
$$ = RubyLexer.Keyword.LBEGIN.bytes;
}
| keyword_END {
$$ = RubyLexer.Keyword.LEND.bytes;
}
| keyword_alias {
$$ = RubyLexer.Keyword.ALIAS.bytes;
}
| keyword_and {
$$ = RubyLexer.Keyword.AND.bytes;
}
| keyword_begin {
$$ = RubyLexer.Keyword.BEGIN.bytes;
}
| keyword_break {
$$ = RubyLexer.Keyword.BREAK.bytes;
}
| keyword_case {
$$ = RubyLexer.Keyword.CASE.bytes;
}
| keyword_class {
$$ = RubyLexer.Keyword.CLASS.bytes;
}
| keyword_def {
$$ = RubyLexer.Keyword.DEF.bytes;
}
| keyword_defined {
$$ = RubyLexer.Keyword.DEFINED_P.bytes;
}
| keyword_do {
$$ = RubyLexer.Keyword.DO.bytes;
}
| keyword_else {
$$ = RubyLexer.Keyword.ELSE.bytes;
}
| keyword_elsif {
$$ = RubyLexer.Keyword.ELSIF.bytes;
}
| keyword_end {
$$ = RubyLexer.Keyword.END.bytes;
}
| keyword_ensure {
$$ = RubyLexer.Keyword.ENSURE.bytes;
}
| keyword_false {
$$ = RubyLexer.Keyword.FALSE.bytes;
}
| keyword_for {
$$ = RubyLexer.Keyword.FOR.bytes;
}
| keyword_in {
$$ = RubyLexer.Keyword.IN.bytes;
}
| keyword_module {
$$ = RubyLexer.Keyword.MODULE.bytes;
}
| keyword_next {
$$ = RubyLexer.Keyword.NEXT.bytes;
}
| keyword_nil {
$$ = RubyLexer.Keyword.NIL.bytes;
}
| keyword_not {
$$ = RubyLexer.Keyword.NOT.bytes;
}
| keyword_or {
$$ = RubyLexer.Keyword.OR.bytes;
}
| keyword_redo {
$$ = RubyLexer.Keyword.REDO.bytes;
}
| keyword_rescue {
$$ = RubyLexer.Keyword.RESCUE.bytes;
}
| keyword_retry {
$$ = RubyLexer.Keyword.RETRY.bytes;
}
| keyword_return {
$$ = RubyLexer.Keyword.RETURN.bytes;
}
| keyword_self {
$$ = RubyLexer.Keyword.SELF.bytes;
}
| keyword_super {
$$ = RubyLexer.Keyword.SUPER.bytes;
}
| keyword_then {
$$ = RubyLexer.Keyword.THEN.bytes;
}
| keyword_true {
$$ = RubyLexer.Keyword.TRUE.bytes;
}
| keyword_undef {
$$ = RubyLexer.Keyword.UNDEF.bytes;
}
| keyword_when {
$$ = RubyLexer.Keyword.WHEN.bytes;
}
| keyword_yield {
$$ = RubyLexer.Keyword.YIELD.bytes;
}
| keyword_if {
$$ = RubyLexer.Keyword.IF.bytes;
}
| keyword_unless {
$$ = RubyLexer.Keyword.UNLESS.bytes;
}
| keyword_while {
$$ = RubyLexer.Keyword.WHILE.bytes;
}
| keyword_until {
$$ = RubyLexer.Keyword.UNTIL.bytes;
}
| modifier_rescue {
$$ = RubyLexer.Keyword.RESCUE.bytes;
}
arg : lhs '=' arg_rhs {
$$ = node_assign($1, $3);
}
| var_lhs tOP_ASGN arg_rhs {
$$ = support.new_op_assign($1, $2, $3);
}
| primary_value '[' opt_call_args rbracket tOP_ASGN arg {
support.value_expr(lexer, $6);
$$ = support.new_ary_op_assign($1, $5, $3, $6);
}
| primary_value call_op tIDENTIFIER tOP_ASGN arg_rhs {
support.value_expr(lexer, $5);
$$ = support.new_attr_op_assign($1, $2, $5, $3, $4);
}
| primary_value call_op tCONSTANT tOP_ASGN arg_rhs {
support.value_expr(lexer, $5);
$$ = support.new_attr_op_assign($1, $2, $5, $3, $4);
}
| primary_value tCOLON2 tIDENTIFIER tOP_ASGN arg_rhs {
support.value_expr(lexer, $5);
$$ = support.new_attr_op_assign($1, $2, $5, $3, $4);
}
| primary_value tCOLON2 tCONSTANT tOP_ASGN arg_rhs {
Integer pos = support.getPosition($1);
$$ = support.new_const_op_assign(pos, support.new_colon2(pos, $1, $3), $4, $5);
}
| tCOLON3 tCONSTANT tOP_ASGN arg_rhs {
Integer pos = lexer.getRubySourceline();
$$ = support.new_const_op_assign(pos, new Colon3Node(pos, support.symbolID($2)), $3, $4);
}
| backref tOP_ASGN arg_rhs {
support.backrefAssignError($1);
}
| arg tDOT2 arg {
support.value_expr(lexer, $1);
support.value_expr(lexer, $3);
boolean isLiteral = $1 instanceof FixnumNode && $3 instanceof FixnumNode;
$$ = new DotNode(support.getPosition($1), support.makeNullNil($1), support.makeNullNil($3), false, isLiteral);
}
| arg tDOT3 arg {
support.value_expr(lexer, $1);
support.value_expr(lexer, $3);
boolean isLiteral = $1 instanceof FixnumNode && $3 instanceof FixnumNode;
$$ = new DotNode(support.getPosition($1), support.makeNullNil($1), support.makeNullNil($3), true, isLiteral);
}
| arg tDOT2 {
support.value_expr(lexer, $1);
boolean isLiteral = $1 instanceof FixnumNode;
$$ = new DotNode(support.getPosition($1), support.makeNullNil($1), NilImplicitNode.NIL, false, isLiteral);
}
| arg tDOT3 {
support.value_expr(lexer, $1);
boolean isLiteral = $1 instanceof FixnumNode;
$$ = new DotNode(support.getPosition($1), support.makeNullNil($1), NilImplicitNode.NIL, true, isLiteral);
}
| arg tPLUS arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| arg tMINUS arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| arg tSTAR2 arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| arg tDIVIDE arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| arg tPERCENT arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| arg tPOW arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| tUMINUS_NUM simple_numeric tPOW arg {
$$ = support.getOperatorCallNode(support.getOperatorCallNode($2, $3, $4, lexer.getRubySourceline()), $1);
}
| tUPLUS arg {
$$ = support.getOperatorCallNode($2, $1);
}
| tUMINUS arg {
$$ = support.getOperatorCallNode($2, $1);
}
| arg tPIPE arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| arg tCARET arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| arg tAMPER2 arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| arg tCMP arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| rel_expr %prec tCMP {
$$ = $1;
}
| arg tEQ arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| arg tEQQ arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| arg tNEQ arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| arg tMATCH arg {
$$ = support.getMatchNode($1, $3);
/* ENEBO
$$ = match_op($1, $3);
if (nd_type($1) == NODE_LIT && TYPE($1->nd_lit) == T_REGEXP) {
$$ = reg_named_capture_assign($1->nd_lit, $$);
}
*/
}
| arg tNMATCH arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| tBANG arg {
$$ = support.getOperatorCallNode(support.method_cond($2), $1);
}
| tTILDE arg {
$$ = support.getOperatorCallNode($2, $1);
}
| arg tLSHFT arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| arg tRSHFT arg {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| arg tANDOP arg {
$$ = support.newAndNode($1, $3);
}
| arg tOROP arg {
$$ = support.newOrNode($1, $3);
}
| keyword_defined opt_nl arg {
$$ = new DefinedNode($1, $3);
}
| arg '?' arg opt_nl ':' arg {
support.value_expr(lexer, $1);
$$ = support.new_if(support.getPosition($1), support.cond($1), $3, $6);
}
| primary {
$$ = $1;
}
relop : tGT {
$$ = $1;
}
| tLT {
$$ = $1;
}
| tGEQ {
$$ = $1;
}
| tLEQ {
$$ = $1;
}
rel_expr : arg relop arg %prec tGT {
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
| rel_expr relop arg %prec tGT {
support.warning(ID.MISCELLANEOUS, lexer.getRubySourceline(), "comparison '" + $2 + "' after comparison");
$$ = support.getOperatorCallNode($1, $2, $3, lexer.getRubySourceline());
}
arg_value : arg {
support.value_expr(lexer, $1);
$$ = support.makeNullNil($1);
}
aref_args : none
| args trailer {
$$ = $1;
}
| args ',' assocs trailer {
$$ = support.arg_append($1, support.remove_duplicate_keys($3));
}
| assocs trailer {
$$ = support.newArrayNode($1.getLine(), support.remove_duplicate_keys($1));
}
arg_rhs : arg %prec tOP_ASGN {
support.value_expr(lexer, $1);
$$ = $1;
}
| arg modifier_rescue arg {
support.value_expr(lexer, $1);
$$ = support.newRescueModNode($1, $3);
}
paren_args : tLPAREN2 opt_call_args rparen {
$$ = $2;
if ($$ != null) $<Node>$.setLine($1);
}
opt_paren_args : none | paren_args
opt_call_args : none
| call_args
| args ',' {
$$ = $1;
}
| args ',' assocs ',' {
$$ = support.arg_append($1, support.remove_duplicate_keys($3));
}
| assocs ',' {
$$ = support.newArrayNode($1.getLine(), support.remove_duplicate_keys($1));
}
// [!null] - ArgsCatNode, SplatNode, ArrayNode, HashNode, BlockPassNode
call_args : command {
support.value_expr(lexer, $1);
$$ = support.newArrayNode(support.getPosition($1), $1);
}
| args opt_block_arg {
$$ = arg_blk_pass($1, $2);
}
| assocs opt_block_arg {
$$ = support.newArrayNode($1.getLine(), support.remove_duplicate_keys($1));
$$ = arg_blk_pass($<Node>$, $2);
}
| args ',' assocs opt_block_arg {
$$ = support.arg_append($1, support.remove_duplicate_keys($3));
$$ = arg_blk_pass($<Node>$, $4);
}
| block_arg {
}
// [!null] - ArgsCatNode, SplatNode, ArrayNode, HashNode, BlockPassNode
command_args : /* none */ {
boolean lookahead = false;
switch (yychar) {
case tLPAREN2: case tLPAREN: case tLPAREN_ARG: case '[': case tLBRACK:
lookahead = true;
}
StackState cmdarg = lexer.getCmdArgumentState();
if (lookahead) cmdarg.pop();
cmdarg.push1();
if (lookahead) cmdarg.push0();
} call_args {
StackState cmdarg = lexer.getCmdArgumentState();
boolean lookahead = false;
switch (yychar) {
case tLBRACE_ARG:
lookahead = true;
}
if (lookahead) cmdarg.pop();
cmdarg.pop();
if (lookahead) cmdarg.push0();
$$ = $2;
}
block_arg : tAMPER arg_value {
$$ = new BlockPassNode(support.getPosition($2), $2);
}
opt_block_arg : ',' block_arg {
$$ = $2;
}
| none_block_pass
// [!null]
args : arg_value { // ArrayNode
int line = $1 instanceof NilImplicitNode ? lexer.getRubySourceline() : $1.getLine();
$$ = support.newArrayNode(line, $1);
}
| tSTAR arg_value { // SplatNode
$$ = support.newSplatNode($2);
}
| args ',' arg_value { // ArgsCatNode, SplatNode, ArrayNode
Node node = support.splat_array($1);
if (node != null) {
$$ = support.list_append(node, $3);
} else {
$$ = support.arg_append($1, $3);
}
}
| args ',' tSTAR arg_value { // ArgsCatNode, SplatNode, ArrayNode
Node node = null;
// FIXME: lose syntactical elements here (and others like this)
if ($4 instanceof ArrayNode &&
(node = support.splat_array($1)) != null) {
$$ = support.list_concat(node, $4);
} else {
$$ = ParserSupport.arg_concat($1, $4);
}
}
mrhs_arg : mrhs {
$$ = $1;
}
| arg_value {
$$ = $1;
}
mrhs : args ',' arg_value {
Node node = support.splat_array($1);
if (node != null) {
$$ = support.list_append(node, $3);
} else {
$$ = support.arg_append($1, $3);
}
}
| args ',' tSTAR arg_value {
Node node = null;
if ($4 instanceof ArrayNode &&
(node = support.splat_array($1)) != null) {
$$ = support.list_concat(node, $4);
} else {
$$ = ParserSupport.arg_concat($1, $4);
}
}
| tSTAR arg_value {
$$ = support.newSplatNode($2);
}
primary : literal
| strings
| xstring
| regexp
| words
| qwords
| symbols {
$$ = $1; // FIXME: Why complaining without $$ = $1;
}
| qsymbols {
$$ = $1; // FIXME: Why complaining without $$ = $1;
}
| var_ref
| backref
| tFID {
$$ = support.new_fcall($1);
}
| keyword_begin {
lexer.getCmdArgumentState().push0();
} bodystmt keyword_end {
lexer.getCmdArgumentState().pop();
$$ = new BeginNode($1, support.makeNullNil($3));
}
| tLPAREN_ARG {
lexer.setState(EXPR_ENDARG);
} rparen {
$$ = null; //FIXME: Should be implicit nil?
}
| tLPAREN_ARG stmt {
lexer.setState(EXPR_ENDARG);
} rparen {
$$ = $2;
}
| tLPAREN compstmt tRPAREN {
if ($2 != null) {
// compstmt position includes both parens around it
$<Node>2.setLine($1);
$$ = $2;
} else {
$$ = new NilNode($1);
}
}
| primary_value tCOLON2 tCONSTANT {
$$ = support.new_colon2(support.getPosition($1), $1, $3);
}
| tCOLON3 tCONSTANT {
$$ = support.new_colon3(lexer.tokline, $2);
}
| tLBRACK aref_args tRBRACK {
Integer position = support.getPosition($2);
if ($2 == null) {
$$ = new ZArrayNode(position); /* zero length array */
} else {
$$ = $2;
}
}
| tLBRACE assoc_list tRCURLY {
$$ = $2;
}
| k_return {
$$ = new ReturnNode($1, NilImplicitNode.NIL);
}
| keyword_yield tLPAREN2 call_args rparen {
$$ = support.new_yield($1, $3);
}
| keyword_yield tLPAREN2 rparen {
$$ = new YieldNode($1, null);
}
| keyword_yield {
$$ = new YieldNode($1, null);
}
| keyword_defined opt_nl tLPAREN2 expr rparen {
$$ = new DefinedNode($1, $4);
}
| keyword_not tLPAREN2 expr rparen {
$$ = support.getOperatorCallNode(support.method_cond($3), lexer.BANG);
}
| keyword_not tLPAREN2 rparen {
$$ = support.getOperatorCallNode(support.method_cond(NilImplicitNode.NIL), lexer.BANG);
}
| fcall brace_block {
support.frobnicate_fcall_args($1, null, $2);
$$ = $1;
}
| method_call
| method_call brace_block {
if ($1 != null &&
$<BlockAcceptingNode>1.getIterNode() instanceof BlockPassNode) {
lexer.compile_error("Both block arg and actual block given.");
}
$$ = $<BlockAcceptingNode>1.setIterNode($2);
$<Node>$.setLine($1.getLine());
}
| tLAMBDA lambda {
$$ = $2;
}
| keyword_if expr_value then compstmt if_tail keyword_end {
$$ = support.new_if($1, support.cond($2), $4, $5);
}
| keyword_unless expr_value then compstmt opt_else keyword_end {
$$ = support.new_if($1, support.cond($2), $5, $4);
}
| keyword_while {
lexer.getConditionState().push1();
} expr_value_do {
lexer.getConditionState().pop();
} compstmt keyword_end {
Node body = support.makeNullNil($5);
$$ = new WhileNode($1, support.cond($3), body);
}
| keyword_until {
lexer.getConditionState().push1();
} expr_value_do {
lexer.getConditionState().pop();
} compstmt keyword_end {
Node body = support.makeNullNil($5);
$$ = new UntilNode($1, support.cond($3), body);
}
| keyword_case expr_value opt_terms case_body keyword_end {
$$ = support.newCaseNode($1, $2, $4);
support.fixpos($<Node>$, $2);
}
| keyword_case opt_terms case_body keyword_end {
$$ = support.newCaseNode($1, null, $3);
}
| keyword_for for_var keyword_in {
lexer.getConditionState().push1();
} expr_value_do {
lexer.getConditionState().pop();
} compstmt keyword_end {
// ENEBO: Lots of optz in 1.9 parser here
$$ = new ForNode($1, $2, $7, $5, support.getCurrentScope(), lexer.getRubySourceline());
}
| k_class cpath superclass {
if (support.isInDef()) {
support.yyerror("class definition in method body");
}
support.pushLocalScope();
$$ = support.isInClass(); // MRI reuses $1 but we use the value for position.
support.setIsInClass(true);
} bodystmt keyword_end {
Node body = support.makeNullNil($5);
$$ = new ClassNode($1, $<Colon3Node>2, support.getCurrentScope(), body, $3, lexer.getRubySourceline());
support.popCurrentScope();
support.setIsInClass($<Boolean>4.booleanValue());
}
| k_class tLSHFT expr {
$$ = new Integer((support.isInClass() ? 0b10 : 0) |
(support.isInDef() ? 0b01 : 0));
support.setInDef(false);
support.setIsInClass(false);
support.pushLocalScope();
} term bodystmt keyword_end {
Node body = support.makeNullNil($6);
$$ = new SClassNode($1, $3, support.getCurrentScope(), body, lexer.getRubySourceline());
support.popCurrentScope();
support.setInDef((($<Integer>4.intValue()) & 0b01) != 0);
support.setIsInClass((($<Integer>4.intValue()) & 0b10) != 0);
}
| k_module cpath {
if (support.isInDef()) {
support.yyerror("module definition in method body");
}
$$ = support.isInClass();
support.setIsInClass(true);
support.pushLocalScope();
} bodystmt keyword_end {
Node body = support.makeNullNil($4);
$$ = new ModuleNode($1, $<Colon3Node>2, support.getCurrentScope(), body, lexer.getRubySourceline());
support.popCurrentScope();
support.setIsInClass($<Boolean>3.booleanValue());
}
| keyword_def fname {
support.isNextBreak = false;
support.pushLocalScope();
$$ = lexer.getCurrentArg();
lexer.setCurrentArg(null);
} {
$$ = support.isInDef();
support.setInDef(true);
} f_arglist bodystmt keyword_end {
Node body = support.makeNullNil($6);
$$ = new DefnNode($1, support.symbolID($2), (ArgsNode) $5, support.getCurrentScope(), body, $7);
if (support.isNextBreak) $<DefnNode>$.setContainsNextBreak();
support.isNextBreak = false;
support.popCurrentScope();
support.setInDef($<Boolean>4.booleanValue());
lexer.setCurrentArg($<ByteList>3);
}
| keyword_def singleton dot_or_colon {
support.isNextBreak = false;
lexer.setState(EXPR_FNAME);
$$ = support.isInDef();
support.setInDef(true);
} fname {
support.pushLocalScope();
lexer.setState(EXPR_ENDFN|EXPR_LABEL); /* force for args */
$$ = lexer.getCurrentArg();
lexer.setCurrentArg(null);
} f_arglist bodystmt keyword_end {
Node body = $8;
if (body == null) body = NilImplicitNode.NIL;
$$ = new DefsNode($1, $2, support.symbolID($5), (ArgsNode) $7, support.getCurrentScope(), body, $9);
if (support.isNextBreak) $<DefsNode>$.setContainsNextBreak();
support.isNextBreak = false;
support.popCurrentScope();
support.setInDef($<Boolean>4.booleanValue());
lexer.setCurrentArg($<ByteList>6);
}
| keyword_break {
support.isNextBreak = true;
$$ = new BreakNode($1, NilImplicitNode.NIL);
}
| keyword_next {
support.isNextBreak = true;
$$ = new NextNode($1, NilImplicitNode.NIL);
}
| keyword_redo {
$$ = new RedoNode($1);
}
| keyword_retry {
$$ = new RetryNode($1);
}
primary_value : primary {
support.value_expr(lexer, $1);
$$ = $1;
if ($$ == null) $$ = NilImplicitNode.NIL;
}
k_class : keyword_class {
$$ = $1;
}
k_else : keyword_else {
$$ = $1;
}
k_module : keyword_module {
$$ = $1;
}
k_return : keyword_return {
if (support.isInClass() && !support.isInDef() && !support.getCurrentScope().isBlockScope()) {
lexer.compile_error("Invalid return in class/module body");
}
$$ = $1;
}
then : term
| keyword_then
| term keyword_then
do : term
| keyword_do_cond
if_tail : opt_else
| keyword_elsif expr_value then compstmt if_tail {
$$ = support.new_if($1, support.cond($2), $4, $5);
}
opt_else : none
| k_else compstmt {
$$ = $2;
}
// [!null]
for_var : lhs
| mlhs {
}
f_marg : f_norm_arg {
$$ = support.assignableInCurr($1, NilImplicitNode.NIL);
}
| tLPAREN f_margs rparen {
$$ = $2;
}
// [!null]
f_marg_list : f_marg {
$$ = support.newArrayNode($1.getLine(), $1);
}
| f_marg_list ',' f_marg {
$$ = $1.add($3);
}
f_margs : f_marg_list {
$$ = new MultipleAsgnNode($1.getLine(), $1, null, null);
}
| f_marg_list ',' tSTAR f_norm_arg {
$$ = new MultipleAsgnNode($1.getLine(), $1, support.assignableInCurr($4, null), null);
}
| f_marg_list ',' tSTAR f_norm_arg ',' f_marg_list {
$$ = new MultipleAsgnNode($1.getLine(), $1, support.assignableInCurr($4, null), $6);
}
| f_marg_list ',' tSTAR {
$$ = new MultipleAsgnNode($1.getLine(), $1, new StarNode(lexer.getRubySourceline()), null);
}
| f_marg_list ',' tSTAR ',' f_marg_list {
$$ = new MultipleAsgnNode($1.getLine(), $1, new StarNode(lexer.getRubySourceline()), $5);
}
| tSTAR f_norm_arg {
$$ = new MultipleAsgnNode(lexer.getRubySourceline(), null, support.assignableInCurr($2, null), null);
}
| tSTAR f_norm_arg ',' f_marg_list {
$$ = new MultipleAsgnNode(lexer.getRubySourceline(), null, support.assignableInCurr($2, null), $4);
}
| tSTAR {
$$ = new MultipleAsgnNode(lexer.getRubySourceline(), null, new StarNode(lexer.getRubySourceline()), null);
}
| tSTAR ',' f_marg_list {
$$ = new MultipleAsgnNode(support.getPosition($3), null, null, $3);
}
block_args_tail : f_block_kwarg ',' f_kwrest opt_f_block_arg {
$$ = support.new_args_tail($1.getLine(), $1, $3, $4);
}
| f_block_kwarg opt_f_block_arg {
$$ = support.new_args_tail($1.getLine(), $1, (ByteList) null, $2);
}
| f_kwrest opt_f_block_arg {
$$ = support.new_args_tail(lexer.getRubySourceline(), null, $1, $2);
}
| f_block_arg {
$$ = support.new_args_tail($1.getLine(), null, (ByteList) null, $1);
}
opt_block_args_tail : ',' block_args_tail {
$$ = $2;
}
| /* none */ {
$$ = support.new_args_tail(lexer.getRubySourceline(), null, (ByteList) null, null);
}
// [!null]
block_param : f_arg ',' f_block_optarg ',' f_rest_arg opt_block_args_tail {
$$ = support.new_args($1.getLine(), $1, $3, $5, null, $6);
}
| f_arg ',' f_block_optarg ',' f_rest_arg ',' f_arg opt_block_args_tail {
$$ = support.new_args($1.getLine(), $1, $3, $5, $7, $8);
}
| f_arg ',' f_block_optarg opt_block_args_tail {
$$ = support.new_args($1.getLine(), $1, $3, null, null, $4);
}
| f_arg ',' f_block_optarg ',' f_arg opt_block_args_tail {
$$ = support.new_args($1.getLine(), $1, $3, null, $5, $6);
}
| f_arg ',' f_rest_arg opt_block_args_tail {
$$ = support.new_args($1.getLine(), $1, null, $3, null, $4);
}
| f_arg ',' {
RestArgNode rest = new UnnamedRestArgNode($1.getLine(), null, support.getCurrentScope().addVariable("*"));
$$ = support.new_args($1.getLine(), $1, null, rest, null, (ArgsTailHolder) null);
}
| f_arg ',' f_rest_arg ',' f_arg opt_block_args_tail {
$$ = support.new_args($1.getLine(), $1, null, $3, $5, $6);
}
| f_arg opt_block_args_tail {
$$ = support.new_args($1.getLine(), $1, null, null, null, $2);
}
| f_block_optarg ',' f_rest_arg opt_block_args_tail {
$$ = support.new_args(support.getPosition($1), null, $1, $3, null, $4);
}
| f_block_optarg ',' f_rest_arg ',' f_arg opt_block_args_tail {
$$ = support.new_args(support.getPosition($1), null, $1, $3, $5, $6);
}
| f_block_optarg opt_block_args_tail {
$$ = support.new_args(support.getPosition($1), null, $1, null, null, $2);
}
| f_block_optarg ',' f_arg opt_block_args_tail {
$$ = support.new_args($1.getLine(), null, $1, null, $3, $4);
}
| f_rest_arg opt_block_args_tail {
$$ = support.new_args($1.getLine(), null, null, $1, null, $2);
}
| f_rest_arg ',' f_arg opt_block_args_tail {
$$ = support.new_args($1.getLine(), null, null, $1, $3, $4);
}
| block_args_tail {
$$ = support.new_args($1.getLine(), null, null, null, null, $1);
}
opt_block_param : none {
// was $$ = null;
$$ = support.new_args(lexer.getRubySourceline(), null, null, null, null, (ArgsTailHolder) null);
}
| block_param_def {
lexer.commandStart = true;
$$ = $1;
}
block_param_def : tPIPE opt_bv_decl tPIPE {
lexer.setCurrentArg(null);
$$ = support.new_args(lexer.getRubySourceline(), null, null, null, null, (ArgsTailHolder) null);
}
| tOROP {
$$ = support.new_args(lexer.getRubySourceline(), null, null, null, null, (ArgsTailHolder) null);
}
| tPIPE block_param opt_bv_decl tPIPE {
lexer.setCurrentArg(null);
$$ = $2;
}
// shadowed block variables....
opt_bv_decl : opt_nl {
$$ = null;
}
| opt_nl ';' bv_decls opt_nl {
$$ = null;
}
// ENEBO: This is confusing...
bv_decls : bvar {
$$ = null;
}
| bv_decls ',' bvar {
$$ = null;
}
bvar : tIDENTIFIER {
support.new_bv($1);
}
| f_bad_arg {
$$ = null;
}
lambda : /* none */ {
support.pushBlockScope();
$$ = lexer.getLeftParenBegin();
lexer.setLeftParenBegin(lexer.incrementParenNest());
} f_larglist {
lexer.getCmdArgumentState().push0();
} lambda_body {
lexer.getCmdArgumentState().pop();
$$ = new LambdaNode($2.getLine(), $2, $4, support.getCurrentScope(), lexer.getRubySourceline());
lexer.setLeftParenBegin($<Integer>1);
support.popCurrentScope();
}
f_larglist : tLPAREN2 f_args opt_bv_decl tRPAREN {
$$ = $2;
}
| f_args {
$$ = $1;
}
lambda_body : tLAMBEG compstmt tRCURLY {
$$ = $2;
}
| keyword_do_lambda bodystmt keyword_end {
$$ = $2;
}
do_block : keyword_do_block do_body keyword_end {
$$ = $2;
}
// JRUBY-2326 and GH #305 both end up hitting this production whereas in
// MRI these do not. I have never isolated the cause but I can work around
// the individual reported problems with a few extra conditionals in this
// first production
block_call : command do_block {
// Workaround for JRUBY-2326 (MRI does not enter this production for some reason)
if ($1 instanceof YieldNode) {
lexer.compile_error("block given to yield");
}
if ($1 instanceof BlockAcceptingNode && $<BlockAcceptingNode>1.getIterNode() instanceof BlockPassNode) {
lexer.compile_error("Both block arg and actual block given.");
}
if ($1 instanceof NonLocalControlFlowNode) {
((BlockAcceptingNode) $<NonLocalControlFlowNode>1.getValueNode()).setIterNode($2);
} else {
$<BlockAcceptingNode>1.setIterNode($2);
}
$$ = $1;
$<Node>$.setLine($1.getLine());
}
| block_call call_op2 operation2 opt_paren_args {
$$ = support.new_call($1, $2, $3, $4, null, (@3.start >> 16));
}
| block_call call_op2 operation2 opt_paren_args brace_block {
$$ = support.new_call($1, $2, $3, $4, $5, (@3.start >> 16));
}
| block_call call_op2 operation2 command_args do_block {
$$ = support.new_call($1, $2, $3, $4, $5, (@3.start >> 16));
}
// [!null]
method_call : fcall paren_args {
support.frobnicate_fcall_args($1, $2, null);
$$ = $1;
}
| primary_value call_op operation2 opt_paren_args {
$$ = support.new_call($1, $2, $3, $4, null, (@3.start >> 16));
}
| primary_value tCOLON2 operation2 paren_args {
$$ = support.new_call($1, $3, $4, null);
}
| primary_value tCOLON2 operation3 {
$$ = support.new_call($1, $3, null, null);
}
| primary_value call_op paren_args {
$$ = support.new_call($1, $2, LexingCommon.CALL, $3, null, (@3.start >> 16));
}
| primary_value tCOLON2 paren_args {
$$ = support.new_call($1, LexingCommon.CALL, $3, null);
}
| keyword_super paren_args {
$$ = support.new_super($1, $2);
}
| keyword_super {
$$ = new ZSuperNode($1);
}
| primary_value '[' opt_call_args rbracket {
if ($1 instanceof SelfNode) {
$$ = support.new_fcall(LexingCommon.LBRACKET_RBRACKET);
support.frobnicate_fcall_args($<FCallNode>$, $3, null);
} else {
$$ = support.new_call($1, lexer.LBRACKET_RBRACKET, $3, null);
}
}
brace_block : tLCURLY brace_body tRCURLY {
$$ = $2;
}
| keyword_do do_body keyword_end {
$$ = $2;
}
brace_body : {
$$ = lexer.getRubySourceline();
} {
support.pushBlockScope();
} opt_block_param compstmt {
$$ = new IterNode($<Integer>1, $3, $4, support.getCurrentScope(), lexer.getRubySourceline());
support.popCurrentScope();
}
do_body : {
$$ = lexer.getRubySourceline();
} {
support.pushBlockScope();
lexer.getCmdArgumentState().push0();
} opt_block_param bodystmt {
$$ = new IterNode($<Integer>1, $3, $4, support.getCurrentScope(), lexer.getRubySourceline());
lexer.getCmdArgumentState().pop();
support.popCurrentScope();
}
case_body : keyword_when args then compstmt cases {
$$ = support.newWhenNode($1, $2, $4, $5);
}
cases : opt_else | case_body
opt_rescue : keyword_rescue exc_list exc_var then compstmt opt_rescue {
Node node;
if ($3 != null) {
node = support.appendToBlock(node_assign($3, new GlobalVarNode($1, support.symbolID(lexer.DOLLAR_BANG))), $5);
if ($5 != null) {
node.setLine($1);
}
} else {
node = $5;
}
Node body = support.makeNullNil(node);
$$ = new RescueBodyNode($1, $2, body, $6);
}
| {
$$ = null;
}
exc_list : arg_value {
$$ = support.newArrayNode($1.getLine(), $1);
}
| mrhs {
$$ = support.splat_array($1);
if ($$ == null) $$ = $1; // ArgsCat or ArgsPush
}
| none
exc_var : tASSOC lhs {
$$ = $2;
}
| none
opt_ensure : keyword_ensure compstmt {
$$ = $2;
}
| none
literal : numeric {
$$ = $1;
}
| symbol {
$$ = support.asSymbol(lexer.getRubySourceline(), $1);
}
| dsym
strings : string {
$$ = $1 instanceof EvStrNode ? new DStrNode($1.getLine(), lexer.getEncoding()).add($1) : $1;
/*
NODE *node = $1;
if (!node) {
node = NEW_STR(STR_NEW0());
} else {
node = evstr2dstr(node);
}
$$ = node;
*/
}
// [!null]
string : tCHAR {
$$ = $1;
}
| string1 {
$$ = $1;
}
| string string1 {
$$ = support.literal_concat($1, $2);
}
string1 : tSTRING_BEG string_contents tSTRING_END {
lexer.heredoc_dedent($2);
lexer.setHeredocIndent(0);
$$ = $2;
}
xstring : tXSTRING_BEG xstring_contents tSTRING_END {
int line = support.getPosition($2);
lexer.heredoc_dedent($2);
lexer.setHeredocIndent(0);
if ($2 == null) {
$$ = new XStrNode(line, null, StringSupport.CR_7BIT);
} else if ($2 instanceof StrNode) {
$$ = new XStrNode(line, (ByteList) $<StrNode>2.getValue().clone(), $<StrNode>2.getCodeRange());
} else if ($2 instanceof DStrNode) {
$$ = new DXStrNode(line, $<DStrNode>2);
$<Node>$.setLine(line);
} else {
$$ = new DXStrNode(line).add($2);
}
}
regexp : tREGEXP_BEG regexp_contents tREGEXP_END {
$$ = support.newRegexpNode(support.getPosition($2), $2, (RegexpNode) $3);
}
words : tWORDS_BEG ' ' word_list tSTRING_END {
$$ = $3;
}
word_list : /* none */ {
$$ = new ArrayNode(lexer.getRubySourceline());
}
| word_list word ' ' {
$$ = $1.add($2 instanceof EvStrNode ? new DStrNode($1.getLine(), lexer.getEncoding()).add($2) : $2);
}
word : string_content {
$$ = $<Node>1;
}
| word string_content {
$$ = support.literal_concat($1, $<Node>2);
}
symbols : tSYMBOLS_BEG ' ' symbol_list tSTRING_END {
$$ = $3;
}
symbol_list : /* none */ {
$$ = new ArrayNode(lexer.getRubySourceline());
}
| symbol_list word ' ' {
$$ = $1.add($2 instanceof EvStrNode ? new DSymbolNode($1.getLine()).add($2) : support.asSymbol($1.getLine(), $2));
}
qwords : tQWORDS_BEG ' ' qword_list tSTRING_END {
$$ = $3;
}
qsymbols : tQSYMBOLS_BEG ' ' qsym_list tSTRING_END {
$$ = $3;
}
qword_list : /* none */ {
$$ = new ArrayNode(lexer.getRubySourceline());
}
| qword_list tSTRING_CONTENT ' ' {
$$ = $1.add($2);
}
qsym_list : /* none */ {
$$ = new ArrayNode(lexer.getRubySourceline());
}
| qsym_list tSTRING_CONTENT ' ' {
$$ = $1.add(support.asSymbol($1.getLine(), $2));
}
string_contents : /* none */ {
ByteList aChar = ByteList.create("");
aChar.setEncoding(lexer.getEncoding());
$$ = lexer.createStr(aChar, 0);
}
| string_contents string_content {
$$ = support.literal_concat($1, $<Node>2);
}
xstring_contents: /* none */ {
ByteList aChar = ByteList.create("");
aChar.setEncoding(lexer.getEncoding());
$$ = lexer.createStr(aChar, 0);
}
| xstring_contents string_content {
$$ = support.literal_concat($1, $<Node>2);
}
regexp_contents: /* none */ {
$$ = null;
}
| regexp_contents string_content {
// FIXME: mri is different here.
$$ = support.literal_concat($1, $<Node>2);
}
string_content : tSTRING_CONTENT {
$$ = $1;
}
| tSTRING_DVAR {
$$ = lexer.getStrTerm();
lexer.setStrTerm(null);
lexer.setState(EXPR_BEG);
} string_dvar {
lexer.setStrTerm($<StrTerm>2);
$$ = new EvStrNode(support.getPosition($3), $3);
}
| tSTRING_DBEG {
$$ = lexer.getStrTerm();
lexer.setStrTerm(null);
lexer.getConditionState().push0();
lexer.getCmdArgumentState().push0();
} {
$$ = lexer.getState();
lexer.setState(EXPR_BEG);
} {
$$ = lexer.getBraceNest();
lexer.setBraceNest(0);
} {
$$ = lexer.getHeredocIndent();
lexer.setHeredocIndent(0);
} compstmt tSTRING_DEND {
lexer.getConditionState().pop();
lexer.getCmdArgumentState().pop();
lexer.setStrTerm($<StrTerm>2);
lexer.setState($<Integer>3);
lexer.setBraceNest($<Integer>4);
lexer.setHeredocIndent($<Integer>5);
lexer.setHeredocLineIndent(-1);
if ($6 != null) $6.unsetNewline();
$$ = support.newEvStrNode(support.getPosition($6), $6);
}
string_dvar : tGVAR {
$$ = new GlobalVarNode(lexer.getRubySourceline(), support.symbolID($1));
}
| tIVAR {
$$ = new InstVarNode(lexer.getRubySourceline(), support.symbolID($1));
}
| tCVAR {
$$ = new ClassVarNode(lexer.getRubySourceline(), support.symbolID($1));
}
| backref
// ByteList:symbol
symbol : tSYMBEG sym {
lexer.setState(EXPR_END);
$$ = $2;
}
// ByteList:symbol
sym : fname
| tIVAR {
$$ = $1;
}
| tGVAR {
$$ = $1;
}
| tCVAR {
$$ = $1;
}
dsym : tSYMBEG xstring_contents tSTRING_END {
lexer.setState(EXPR_END);
// DStrNode: :"some text #{some expression}"
// StrNode: :"some text"
// EvStrNode :"#{some expression}"
// Ruby 1.9 allows empty strings as symbols
if ($2 == null) {
$$ = support.asSymbol(lexer.getRubySourceline(), new ByteList(new byte[] {}));
} else if ($2 instanceof DStrNode) {
$$ = new DSymbolNode($2.getLine(), $<DStrNode>2);
} else if ($2 instanceof StrNode) {
$$ = support.asSymbol($2.getLine(), $2);
} else {
$$ = new DSymbolNode($2.getLine());
$<DSymbolNode>$.add($2);
}
}
numeric : simple_numeric {
$$ = $1;
}
| tUMINUS_NUM simple_numeric %prec tLOWEST {
$$ = support.negateNumeric($2);
}
simple_numeric : tINTEGER {
$$ = $1;
}
| tFLOAT {
$$ = $1;
}
| tRATIONAL {
$$ = $1;
}
| tIMAGINARY {
$$ = $1;
}
// [!null]
var_ref : /*mri:user_variable*/ tIDENTIFIER {
$$ = support.declareIdentifier($1);
}
| tIVAR {
$$ = new InstVarNode(lexer.tokline, support.symbolID($1));
}
| tGVAR {
$$ = new GlobalVarNode(lexer.tokline, support.symbolID($1));
}
| tCONSTANT {
$$ = new ConstNode(lexer.tokline, support.symbolID($1));
}
| tCVAR {
$$ = new ClassVarNode(lexer.tokline, support.symbolID($1));
} /*mri:user_variable*/
| /*mri:keyword_variable*/ keyword_nil {
$$ = new NilNode(lexer.tokline);
}
| keyword_self {
$$ = new SelfNode(lexer.tokline);
}
| keyword_true {
$$ = new TrueNode(lexer.tokline);
}
| keyword_false {
$$ = new FalseNode(lexer.tokline);
}
| keyword__FILE__ {
$$ = new FileNode(lexer.tokline, new ByteList(lexer.getFile().getBytes(),
support.getConfiguration().getRuntime().getEncodingService().getLocaleEncoding()));
}
| keyword__LINE__ {
$$ = new FixnumNode(lexer.tokline, lexer.tokline+1);
}
| keyword__ENCODING__ {
$$ = new EncodingNode(lexer.tokline, lexer.getEncoding());
} /*mri:keyword_variable*/
// [!null]
var_lhs : /*mri:user_variable*/ tIDENTIFIER {
$$ = support.assignableLabelOrIdentifier($1, null);
}
| tIVAR {
$$ = new InstAsgnNode(lexer.tokline, support.symbolID($1), NilImplicitNode.NIL);
}
| tGVAR {
$$ = new GlobalAsgnNode(lexer.tokline, support.symbolID($1), NilImplicitNode.NIL);
}
| tCONSTANT {
if (support.isInDef()) support.compile_error("dynamic constant assignment");
$$ = new ConstDeclNode(lexer.tokline, support.symbolID($1), null, NilImplicitNode.NIL);
}
| tCVAR {
$$ = new ClassVarAsgnNode(lexer.tokline, support.symbolID($1), NilImplicitNode.NIL);
} /*mri:user_variable*/
| /*mri:keyword_variable*/ keyword_nil {
support.compile_error("Can't assign to nil");
$$ = null;
}
| keyword_self {
support.compile_error("Can't change the value of self");
$$ = null;
}
| keyword_true {
support.compile_error("Can't assign to true");
$$ = null;
}
| keyword_false {
support.compile_error("Can't assign to false");
$$ = null;
}
| keyword__FILE__ {
support.compile_error("Can't assign to __FILE__");
$$ = null;
}
| keyword__LINE__ {
support.compile_error("Can't assign to __LINE__");
$$ = null;
}
| keyword__ENCODING__ {
support.compile_error("Can't assign to __ENCODING__");
$$ = null;
} /*mri:keyword_variable*/
// [!null]
backref : tNTH_REF {
$$ = $1;
}
| tBACK_REF {
$$ = $1;
}
superclass : tLT {
lexer.setState(EXPR_BEG);
lexer.commandStart = true;
} expr_value term {
$$ = $3;
}
| /* none */ {
$$ = null;
}
// [!null]
f_arglist : tLPAREN2 f_args rparen {
$$ = $2;
lexer.setState(EXPR_BEG);
lexer.commandStart = true;
}
| {
$$ = lexer.inKwarg;
lexer.inKwarg = true;
lexer.setState(lexer.getState() | EXPR_LABEL);
} f_args term {
lexer.inKwarg = $<Boolean>1;
$$ = $2;
lexer.setState(EXPR_BEG);
lexer.commandStart = true;
}
args_tail : f_kwarg ',' f_kwrest opt_f_block_arg {
$$ = support.new_args_tail($1.getLine(), $1, $3, $4);
}
| f_kwarg opt_f_block_arg {
$$ = support.new_args_tail($1.getLine(), $1, (ByteList) null, $2);
}
| f_kwrest opt_f_block_arg {
$$ = support.new_args_tail(lexer.getRubySourceline(), null, $1, $2);
}
| f_block_arg {
$$ = support.new_args_tail($1.getLine(), null, (ByteList) null, $1);
}
opt_args_tail : ',' args_tail {
$$ = $2;
}
| /* none */ {
$$ = support.new_args_tail(lexer.getRubySourceline(), null, (ByteList) null, null);
}
// [!null]
f_args : f_arg ',' f_optarg ',' f_rest_arg opt_args_tail {
$$ = support.new_args($1.getLine(), $1, $3, $5, null, $6);
}
| f_arg ',' f_optarg ',' f_rest_arg ',' f_arg opt_args_tail {
$$ = support.new_args($1.getLine(), $1, $3, $5, $7, $8);
}
| f_arg ',' f_optarg opt_args_tail {
$$ = support.new_args($1.getLine(), $1, $3, null, null, $4);
}
| f_arg ',' f_optarg ',' f_arg opt_args_tail {
$$ = support.new_args($1.getLine(), $1, $3, null, $5, $6);
}
| f_arg ',' f_rest_arg opt_args_tail {
$$ = support.new_args($1.getLine(), $1, null, $3, null, $4);
}
| f_arg ',' f_rest_arg ',' f_arg opt_args_tail {
$$ = support.new_args($1.getLine(), $1, null, $3, $5, $6);
}
| f_arg opt_args_tail {
$$ = support.new_args($1.getLine(), $1, null, null, null, $2);
}
| f_optarg ',' f_rest_arg opt_args_tail {
$$ = support.new_args($1.getLine(), null, $1, $3, null, $4);
}
| f_optarg ',' f_rest_arg ',' f_arg opt_args_tail {
$$ = support.new_args($1.getLine(), null, $1, $3, $5, $6);
}
| f_optarg opt_args_tail {
$$ = support.new_args($1.getLine(), null, $1, null, null, $2);
}
| f_optarg ',' f_arg opt_args_tail {
$$ = support.new_args($1.getLine(), null, $1, null, $3, $4);
}
| f_rest_arg opt_args_tail {
$$ = support.new_args($1.getLine(), null, null, $1, null, $2);
}
| f_rest_arg ',' f_arg opt_args_tail {
$$ = support.new_args($1.getLine(), null, null, $1, $3, $4);
}
| args_tail {
$$ = support.new_args($1.getLine(), null, null, null, null, $1);
}
| /* none */ {
$$ = support.new_args(lexer.getRubySourceline(), null, null, null, null, (ArgsTailHolder) null);
}
f_bad_arg : tCONSTANT {
support.yyerror("formal argument cannot be a constant");
}
| tIVAR {
support.yyerror("formal argument cannot be an instance variable");
}
| tGVAR {
support.yyerror("formal argument cannot be a global variable");
}
| tCVAR {
support.yyerror("formal argument cannot be a class variable");
}
// ByteList:f_norm_arg [!null]
f_norm_arg : f_bad_arg {
$$ = $1; // Not really reached
}
| tIDENTIFIER {
$$ = support.formal_argument($1);
}
f_arg_asgn : f_norm_arg {
lexer.setCurrentArg($1);
$$ = support.arg_var($1);
}
f_arg_item : f_arg_asgn {
lexer.setCurrentArg(null);
$$ = $1;
}
| tLPAREN f_margs rparen {
$$ = $2;
/* {
ID tid = internal_id();
arg_var(tid);
if (dyna_in_block()) {
$2->nd_value = NEW_DVAR(tid);
}
else {
$2->nd_value = NEW_LVAR(tid);
}
$$ = NEW_ARGS_AUX(tid, 1);
$$->nd_next = $2;*/
}
// [!null]
f_arg : f_arg_item {
$$ = new ArrayNode(lexer.getRubySourceline(), $1);
}
| f_arg ',' f_arg_item {
$1.add($3);
$$ = $1;
}
f_label : tLABEL {
support.arg_var(support.formal_argument($1));
lexer.setCurrentArg($1);
$$ = $1;
}
f_kw : f_label arg_value {
lexer.setCurrentArg(null);
$$ = new KeywordArgNode($2.getLine(), support.assignableKeyword($1, $2));
}
| f_label {
lexer.setCurrentArg(null);
$$ = new KeywordArgNode(lexer.getRubySourceline(), support.assignableKeyword($1, new RequiredKeywordArgumentValueNode()));
}
f_block_kw : f_label primary_value {
$$ = new KeywordArgNode(support.getPosition($2), support.assignableKeyword($1, $2));
}
| f_label {
$$ = new KeywordArgNode(lexer.getRubySourceline(), support.assignableKeyword($1, new RequiredKeywordArgumentValueNode()));
}
f_block_kwarg : f_block_kw {
$$ = new ArrayNode($1.getLine(), $1);
}
| f_block_kwarg ',' f_block_kw {
$$ = $1.add($3);
}
f_kwarg : f_kw {
$$ = new ArrayNode($1.getLine(), $1);
}
| f_kwarg ',' f_kw {
$$ = $1.add($3);
}
kwrest_mark : tPOW {
$$ = $1;
}
| tDSTAR {
$$ = $1;
}
f_kwrest : kwrest_mark tIDENTIFIER {
support.shadowing_lvar($2);
$$ = $2;
}
| kwrest_mark {
$$ = support.INTERNAL_ID;
}
f_opt : f_arg_asgn '=' arg_value {
lexer.setCurrentArg(null);
$$ = new OptArgNode(support.getPosition($3), support.assignableLabelOrIdentifier($1.getName().getBytes(), $3));
}
f_block_opt : f_arg_asgn '=' primary_value {
lexer.setCurrentArg(null);
$$ = new OptArgNode(support.getPosition($3), support.assignableLabelOrIdentifier($1.getName().getBytes(), $3));
}
f_block_optarg : f_block_opt {
$$ = new BlockNode($1.getLine()).add($1);
}
| f_block_optarg ',' f_block_opt {
$$ = support.appendToBlock($1, $3);
}
f_optarg : f_opt {
$$ = new BlockNode($1.getLine()).add($1);
}
| f_optarg ',' f_opt {
$$ = support.appendToBlock($1, $3);
}
restarg_mark : tSTAR2 {
$$ = $1;
}
| tSTAR {
$$ = $1;
}
// [!null]
f_rest_arg : restarg_mark tIDENTIFIER {
if (!support.is_local_id($2)) {
support.yyerror("rest argument must be local variable");
}
$$ = new RestArgNode(support.arg_var(support.shadowing_lvar($2)));
}
| restarg_mark {
// FIXME: bytelist_love: somewhat silly to remake the empty bytelist over and over but this type should change (using null vs "" is a strange distinction).
$$ = new UnnamedRestArgNode(lexer.getRubySourceline(), support.symbolID(CommonByteLists.EMPTY), support.getCurrentScope().addVariable("*"));
}
// [!null]
blkarg_mark : tAMPER2 {
$$ = $1;
}
| tAMPER {
$$ = $1;
}
// f_block_arg - Block argument def for function (foo(&block)) [!null]
f_block_arg : blkarg_mark tIDENTIFIER {
if (!support.is_local_id($2)) {
support.yyerror("block argument must be local variable");
}
$$ = new BlockArgNode(support.arg_var(support.shadowing_lvar($2)));
}
opt_f_block_arg : ',' f_block_arg {
$$ = $2;
}
| /* none */ {
$$ = null;
}
singleton : var_ref {
support.value_expr(lexer, $1);
$$ = $1;
}
| tLPAREN2 {
lexer.setState(EXPR_BEG);
} expr rparen {
if ($3 == null) {
support.yyerror("can't define single method for ().");
} else if ($3 instanceof ILiteralNode) {
support.yyerror("can't define single method for literals.");
}
support.value_expr(lexer, $3);
$$ = $3;
}
// HashNode: [!null]
assoc_list : none {
$$ = new HashNode(lexer.getRubySourceline());
}
| assocs trailer {
$$ = support.remove_duplicate_keys($1);
}
// [!null]
assocs : assoc {
$$ = new HashNode(lexer.getRubySourceline(), $1);
}
| assocs ',' assoc {
$$ = $1.add($3);
}
// Cons: [!null]
assoc : arg_value tASSOC arg_value {
$$ = support.createKeyValue($1, $3);
}
| tLABEL arg_value {
Node label = support.asSymbol(support.getPosition($2), $1);
$$ = support.createKeyValue(label, $2);
}
| tSTRING_BEG string_contents tLABEL_END arg_value {
if ($2 instanceof StrNode) {
DStrNode dnode = new DStrNode(support.getPosition($2), lexer.getEncoding());
dnode.add($2);
$$ = support.createKeyValue(new DSymbolNode(support.getPosition($2), dnode), $4);
} else if ($2 instanceof DStrNode) {
$$ = support.createKeyValue(new DSymbolNode(support.getPosition($2), $<DStrNode>2), $4);
} else {
support.compile_error("Uknown type for assoc in strings: " + $2);
}
}
| tDSTAR arg_value {
$$ = support.createKeyValue(null, $2);
}
operation : tIDENTIFIER {
$$ = $1;
}
| tCONSTANT {
$$ = $1;
}
| tFID {
$$ = $1;
}
operation2 : tIDENTIFIER {
$$ = $1;
}
| tCONSTANT {
$$ = $1;
}
| tFID {
$$ = $1;
}
| op {
$$ = $1;
}
operation3 : tIDENTIFIER {
$$ = $1;
}
| tFID {
$$ = $1;
}
| op {
$$ = $1;
}
dot_or_colon : tDOT {
$$ = $1;
}
| tCOLON2 {
$$ = $1;
}
call_op : tDOT {
$$ = $1;
}
| tANDDOT {
$$ = $1;
}
call_op2 : call_op
| tCOLON2 {
$$ = $1;
}
opt_terms : /* none */ | terms
opt_nl : /* none */ | '\n'
rparen : opt_nl tRPAREN {
$$ = $2;
}
rbracket : opt_nl tRBRACK {
$$ = $2;
}
trailer : /* none */ | '\n' | ','
term : ';'
| '\n'
terms : term
| terms ';'
none : /* none */ {
$$ = null;
}
none_block_pass : /* none */ {
$$ = null;
}
%%
/** The parse method use an lexer stream and parse it to an AST node
* structure
*/
public RubyParserResult parse(ParserConfiguration configuration) throws IOException {
support.reset();
support.setConfiguration(configuration);
support.setResult(new RubyParserResult());
yyparse(lexer, configuration.isDebug() ? new YYDebug() : null);
return support.getResult();
}
}
| Yacc | 5 | GabrielNagy/jruby | core/src/main/java/org/jruby/parser/RubyParser.y | [
"Ruby",
"Apache-2.0"
]
|
#define TORCH_ASSERT_NO_OPERATORS
#include <ATen/AccumulateType.h>
#include <ATen/native/TensorIterator.h>
#include <ATen/native/cuda/Reduce.cuh>
#include <ATen/native/DispatchStub.h>
#include <ATen/native/SharedReduceOps.h>
#include <ATen/AccumulateType.h>
#include <ATen/Dispatch.h>
#include <ATen/native/ReduceOps.h>
namespace at { namespace native {
template <typename scalar_t, typename out_t=scalar_t>
void std_var_kernel_impl(TensorIterator& iter, int32_t correction, bool take_sqrt) {
// reducing unrolling factor to 2 for welford kernel
// This is necessary to lower register usage that leads to register spills.
using accscalar_t = at::acc_type<scalar_t, true>;
using ops_t = WelfordOps<scalar_t, accscalar_t, int32_t, float, thrust::pair<out_t, out_t>>;
gpu_reduce_kernel<scalar_t, out_t, 2>(
iter, ops_t{correction, take_sqrt}, typename ops_t::acc_t{});
}
static void std_var_kernel_cuda(TensorIterator& iter, int64_t correction, bool take_sqrt) {
using limits = std::numeric_limits<int32_t>;
TORCH_CHECK(
correction < limits::max() && correction > limits::min(),
"The correction argument for std and var computation on CUDA must "
"fit within a 32-bit integer, but got ", correction);
const auto input_dtype = iter.input_dtype();
if (input_dtype == kHalf && iter.dtype() == kFloat) {
// type promotion that does cast and reduction in a single kernel
std_var_kernel_impl<at::Half, float>(iter, correction, take_sqrt);
} else if (input_dtype == kBFloat16 && iter.dtype() == kFloat) {
// type promotion that does cast and reduction in a single kernel
std_var_kernel_impl<at::BFloat16, float>(iter, correction, take_sqrt);
} else {
AT_DISPATCH_FLOATING_TYPES_AND2(at::ScalarType::Half, at::ScalarType::BFloat16,
iter.dtype(), "std_cuda", [&]() {
std_var_kernel_impl<scalar_t>(iter, correction, take_sqrt);
});
}
}
template <typename scalar_t, typename acc_t=scalar_t, typename out_t=scalar_t>
void mean_kernel_impl(TensorIterator& iter) {
// returns acc_t for all non-complex dtypes and returns T for c10::complex<T>
using factor_t = typename c10::scalar_value_type<acc_t>::type;
factor_t factor = static_cast<factor_t>(iter.num_output_elements()) / iter.numel();
gpu_reduce_kernel<scalar_t, out_t>(iter, MeanOps<acc_t, factor_t> {factor});
}
static void mean_kernel_cuda(TensorIterator& iter) {
if (iter.dtype() == kHalf) {
mean_kernel_impl<at::Half, float>(iter);
} else if (iter.dtype(1) == kHalf && iter.dtype() == kFloat) {
// type promotion that does cast and reduction in a single kernel
mean_kernel_impl<at::Half, float, float>(iter);
} else if(iter.dtype() == kBFloat16) {
mean_kernel_impl<at::BFloat16, float>(iter);
} else if (iter.dtype(1) == kBFloat16 && iter.dtype() == kFloat) {
// type promotion that does cast and reduction in a single kernel
mean_kernel_impl<at::BFloat16, float, float>(iter);
} else {
AT_DISPATCH_ALL_TYPES_AND_COMPLEX(iter.dtype(), "mean_cuda", [&]() {
mean_kernel_impl<scalar_t>(iter);
});
}
}
REGISTER_DISPATCH(std_var_stub, &std_var_kernel_cuda);
REGISTER_DISPATCH(mean_stub, &mean_kernel_cuda);
}} // namespace at::native
| Cuda | 5 | xiaohanhuang/pytorch | aten/src/ATen/native/cuda/ReduceMomentKernel.cu | [
"Intel"
]
|
REBOL [
Title: "Generates Red/System maths tests"
Author: "Peter W A Wood"
File: %make-maths-auto-test.r
Version: 0.1.3
Tabs: 4
Rights: "Copyright (C) 2011-2015 Peter W A Wood. All rights reserved."
License: "BSD-3 - https://github.com/red/red/blob/origin/BSD-3-License.txt"
]
make-test: func [
test-string [string!]
/setup
test-setup [string!]
/local
rule
char
mold-char
new-test-string
cs
][
cs: complement charset [#"#"]
mold-char: func [
char [char!]
][
join {#"^^(} [copy/part tail to-hex to integer! to char! char -2 {)"}]
]
rule: [
(new-test-string: copy "")
any [
copy char [{#"} thru {"}] (append new-test-string mold-char load char)
|
copy string [some cs] (append new-test-string string)
|
skip
]
]
test-number: test-number + 1
append tests join { --test-- "maths-auto-} [test-number {"^(0A)}]
if setup [append tests test-setup]
append tests " --assert "
;; convert all char! literals to hex format
parse/all test-string rule
;; check if the first value is a byte!
either byte-first? [
append tests reform [expected "= (as integer! (" new-test-string "))^(0A)"]
][
append tests reform [expected "= (" new-test-string ")^(0A)"]
]
]
preprocess: func [
s [string!]
/local
calc
rules
sb
ns
nothing-changed
division-sign
][
calc: func [
a [char!]
op [word!]
b [char!]
/local
res
][
;; Ensure all typecasts are to integer! not char!
a: to integer! a
switch op [
+ [res: a + b]
- [res: a - b]
* [res: a * b]
div-sign [res: to integer! (a / b)]
]
;; adjust the return value to emulate 8-bit arithmetic with overflow
either res >= 0 [
res: res // 256
][
until [
res: res + 256
res > 0
]
]
to char! res
]
rules: [
any [
[set a char! set op word! set b char! (
acc: calc a op b
replace ns join "(" [mold a " " op " " mold b ")"] mold acc
replace ns join "" [mold a " " op " " mold b ] mold acc
nothing-changed: false
)] |
[set a integer! 'div-sign set b integer! (
replace ns join "" [mold a " " op " " mold b ]
join "(to integer! divide "[mold a " " mold b ")"]
)] |
[set p paren! (parse to block! p rules)] |
skip
]
end
]
ns: copy s
replace/all ns " / " " div-sign "
until [
nothing-changed: true
sb: to block! load ns
parse sb rules
nothing-changed
]
ns
]
;; initialisations
tests: copy "" ;; string to hold generated tests
test-number: 0 ;; number of the generated test
make-dir %auto-tests/
file-out: %auto-tests/maths-auto-test.reds
;; tests & data - test formulae, test data, test formulae, test data, etc.
tests-and-data: [
[
"(v * v) * v"
"(v - v) - v"
"(v * v) - v"
"(v - v) * v"
"v * v * v"
"v - v - v"
"v - v * v"
"(v / v) + v"
]
[
[1 1 1]
[2 2 2]
[256 256 256]
[257 257 257]
[255 256 257]
[-256 256 256]
[257 -257 257]
[255 256 -257]
[-256 -256 -256]
[-257 -257 -257]
[-255 -256 -257]
[#"^(02)" #"^(02)" #"^(02)"]
[#"^(07)" #"^(08)" #"^(03)"]
[1 #"^(0A)" 100]
[2 #"^(10)" 256]
[#"^(FD)" #"^(FE)" #"^(FF)"]
[#"^(AA)" 34 #"^(99)"]
]
[
"(v * v) * (v * v)"
"(v - v) - (v - v)"
"(v * v) - (v - v)"
"(v - v) * (v - v)"
"(v - v) - (v * v)"
"(v * v) * (v - v)"
"(v - v) * (v * v)"
"(v * v) - (v * v)"
"v + v + v + v"
"v / v * v / v"
]
[
[1 1 1 1]
[2 2 2 2]
[256 256 256 256]
[257 257 257 257]
[#"^(FF)" 256 257 258]
[#"^(FC)" #"^(FD)" #"^(FE)" #"^(FF)"]
]
[
"((v * v) * (v * v)) * ((v * v) * (v * v))"
"((v - v) * (v * v)) * ((v * v) * (v * v))"
"((v * v) - (v * v)) * ((v * v) * (v * v))"
"((v * v) * (v - v)) * ((v * v) * (v * v))"
"((v * v) * (v * v)) - ((v * v) * (v * v))"
"((v * v) * (v * v)) * ((v - v) * (v * v))"
"((v * v) * (v * v)) * ((v * v) - (v * v))"
"((v * v) * (v * v)) * ((v * v) * (v - v))"
"((v - v) * (v * v)) * ((v * v) * (v * v))"
"((v - v) * (v * v)) * ((v * v) * (v * v))"
"((v - v) - (v * v)) * ((v * v) * (v * v))"
"((v - v) * (v - v)) * ((v * v) * (v * v))"
"((v - v) * (v * v)) - ((v * v) * (v * v))"
"((v - v) * (v * v)) * ((v - v) * (v * v))"
"((v - v) * (v * v)) * ((v * v) - (v * v))"
"((v - v) * (v * v)) * ((v * v) * (v - v))"
"((v * v) - (v * v)) * ((v * v) * (v * v))"
"((v - v) - (v * v)) * ((v * v) * (v * v))"
"((v * v) - (v * v)) * ((v * v) * (v * v))"
"((v * v) - (v - v)) * ((v * v) * (v * v))"
"((v * v) - (v * v)) - ((v * v) * (v * v))"
"((v * v) - (v * v)) * ((v - v) * (v * v))"
"((v * v) - (v * v)) * ((v * v) - (v * v))"
"((v * v) - (v * v)) * ((v * v) * (v - v))"
"((v * v) * (v - v)) - ((v * v) * (v * v))"
"((v - v) * (v - v)) * ((v - v) * (v * v))"
"((v * v) * (v - v)) * ((v * v) - (v * v))"
"((v * v) * (v - v)) * ((v * v) * (v - v))"
"((v * v) * (v - v)) - ((v * v) * (v * v))"
"((v * v) * (v - v)) * ((v - v) * (v * v))"
"((v * v) * (v - v)) * ((v * v) - (v * v))"
"((v * v) * (v - v)) * ((v * v) * (v - v))"
"((v - v) - (v - v)) * ((v * v) * (v * v))"
"((v - v) - (v * v)) - ((v * v) * (v * v))"
"((v - v) - (v * v)) * ((v - v) * (v * v))"
"((v - v) - (v - v)) * ((v * v) - (v * v))"
"((v - v) * (v - v)) - ((v * v) * (v - v))"
"((v - v) * (v * v)) - ((v - v) * (v * v))"
"((v - v) * (v * v)) - ((v * v) - (v * v))"
"((v - v) * (v * v)) - ((v * v) * (v - v))"
"((v - v) * (v * v)) * ((v - v) - (v * v))"
"((v - v) * (v * v)) * ((v - v) * (v - v))"
"((v - v) * (v * v)) * ((v * v) - (v - v))"
"((v * v) - (v - v)) - ((v * v) * (v * v))"
"((v * v) - (v - v)) * ((v - v) * (v * v))"
"((v * v) - (v - v)) * ((v * v) - (v * v))"
"((v * v) - (v - v)) * ((v * v) * (v - v))"
"((v * v) * (v - v)) - ((v - v) * (v * v))"
"((v * v) * (v - v)) - ((v * v) - (v * v))"
"((v * v) * (v - v)) - ((v * v) * (v - v))"
"((v * v) * (v - v)) * ((v - v) - (v * v))"
"((v * v) * (v - v)) * ((v - v) * (v - v))"
"((v * v) * (v * v)) - ((v - v) - (v * v))"
"((v * v) * (v * v)) - ((v - v) * (v - v))"
"((v * v) * (v * v)) - ((v * v) - (v - v))"
"((v * v) * (v * v)) * ((v - v) - (v - v))"
"((v - v) * (v - v)) - ((v - v) * (v * v))"
"((v - v) * (v - v)) - ((v * v) - (v * v))"
"((v - v) * (v - v)) - ((v * v) * (v - v))"
"((v - v) - (v - v)) - ((v * v) * (v * v))"
"((v - v) - (v - v)) * ((v - v) * (v * v))"
"((v - v) - (v - v)) * ((v * v) - (v * v))"
"((v - v) - (v - v)) * ((v * v) * (v - v))"
"((v - v) - (v * v)) * ((v - v) - (v * v))"
"((v - v) - (v * v)) * ((v - v) * (v - v))"
"((v * v) - (v - v)) - ((v - v) * (v * v))"
"((v * v) * (v - v)) - ((v * v) - (v - v))"
"((v * v) * (v - v)) - ((v - v) - (v - v))"
"((v * v) * (v * v)) - ((v - v) - (v - v))"
"((v - v) * (v - v)) - ((v - v) * (v - v))"
"((v - v) - (v - v)) - ((v - v) - (v - v))"
]
[
[1 1 1 1 1 1 1 1]
[256 256 256 256 256 256 256 256]
[257 257 257 257 257 257 257 257]
[-256 -256 -256 -256 -256 -256 -256 -256]
[-257 -257 -257 -257 -257 -257 -257 -257]
[#"^(01)" #"^(02)" #"^(03)" #"^(01)" #"^(02)" #"^(03)" #"^(01)" #"^(02)"]
[1 2 #"^(03)" 4 5 6 7 8]
[#"^(F8)" #"^(F9)" #"^(FA)" #"^(FB)" #"^(FC)" #"^(FD)" #"^(FE)" #"^(FF)"]
]
]
;;;;;;;;;;;;;;;; start of template ;;;;;;;;;;;;;;;;;;;;;;;;;;
template: {
Red/System [
Title: "Red/System auto-generated maths tests"
Author: "Peter W A Wood"
File: %maths-auto-test.reds
License: "BSD-3 - https://github.com/dockimbel/Red/blob/origin/BSD-3-License.txt"
]
comment {
This file is generated by make-maths-auto-test.r
Do not edit this file directly.
}
;;;;;;;;;;;;;;;; end of template ;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;make-length:$LENGTH$
#include %../../../../../quick-test/quick-test.reds
s: declare struct! [
a [integer!]
b [integer!]
c [integer!]
d [integer!]
e [integer!]
f [integer!]
g [integer!]
h [integer!]
]
ident: func [i [integer!] return: [integer!]][i]
~~~start-file~~~ "Auto-generated tests for maths"
===start-group=== "Auto-generated tests for maths"
}
;;;;;;;;;;;;;;;; end of template;;;;;;;;;;;;;;;;;;;;;;;;;;
;; start of executable code
header: copy template
replace header "$LENGTH$" length? read %make-maths-auto-test.r
write/binary file-out header
tests: copy ""
foreach [formulae data] tests-and-data [
foreach test-formula formulae [
foreach test-data data [
test-string: copy test-formula
foreach test-value test-data [
replace test-string "v" mold test-value
]
byte-first?: either char! = type? first test-data [true] [false]
rebol-test-string: preprocess test-string
;; parse the expression and perform the calculation as Red/System would
;; only write a test if REBOL produces a valid result
if attempt [expected: do load rebol-test-string][
expected: to integer! expected
;; test with literal values
make-test test-string
;; if the data contains byte! values don't create the other tests
if not find test-string "#" [
;; test using integer variables
test-setup: copy ""
test-string: copy test-formula
variable-names: copy ["a" "b" "c" "d" "e" "f" "g" "h"]
foreach test-value test-data [
append test-setup join " " [
first variable-names ": " mold test-value "^(0A)"
]
replace test-string "v" first variable-names
variable-names: next variable-names
]
make-test/setup test-string test-setup
;; test using integer/path
test-setup: copy ""
test-string: copy test-formula
variable-names: copy ["a" "b" "c" "d" "e" "f" "g" "h"]
foreach test-value test-data [
append test-setup join " s/" [
first variable-names ": " mold test-value "^(0A)"
]
replace test-string "v" join "s/" [first variable-names]
variable-names: next variable-names
]
make-test/setup test-string test-setup
;; test using function call
test-string: copy test-formula
foreach test-value test-data [
replace test-string "v" join "(ident " [mold test-value ")"]
]
make-test test-string
]
]
]
]
recycle
]
write/append/binary file-out tests
tests: copy ""
;; write file epilog
append tests "^(0A)===end-group===^(0A)^(0A)"
append tests {~~~end-file~~~^(0A)^(0A)}
write/append/binary file-out tests
print ["Number of assertions generated" test-number]
| R | 5 | 0xflotus/red | system/tests/source/units/make-maths-auto-test.r | [
"BSL-1.0",
"BSD-3-Clause"
]
|
server {
server_name localhost;
root /var/www/public;
index index.php;
client_max_body_size 100M;
fastcgi_read_timeout 1800;
location / {
try_files $uri $uri/ /index.php$is_args$args;
}
location ~* \.(js|css|png|jpg|jpeg|gif|ico)$ {
expires max;
log_not_found off;
access_log off;
}
location ~ \.php$ {
try_files $uri =404;
include fastcgi_params;
fastcgi_index index.php;
fastcgi_param SCRIPT_FILENAME $document_root$fastcgi_script_name;
fastcgi_pass php-fpm:9000;
}
}
| ApacheConf | 3 | rekursed/docker-web-stact-for-sf4-yarn | services/nginx/sites/localhost.vhost | [
"MIT"
]
|
module mod
integer i
integer :: x(4)
real, dimension(2,3) :: a
real, allocatable, dimension(:,:) :: b
contains
subroutine foo
integer k
print*, "i=",i
print*, "x=[",x,"]"
print*, "a=["
print*, "[",a(1,1),",",a(1,2),",",a(1,3),"]"
print*, "[",a(2,1),",",a(2,2),",",a(2,3),"]"
print*, "]"
print*, "Setting a(1,2)=a(1,2)+3"
a(1,2) = a(1,2)+3
end subroutine foo
end module mod
| FORTRAN | 4 | iam-abbas/numpy | doc/source/f2py/code/moddata.f90 | [
"BSD-3-Clause"
]
|
# Licensed to the Apache Software Foundation (ASF) under one
# or more contributor license agreements. See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership. The ASF licenses this file
# to you under the Apache License, Version 2.0 (the
# "License"); you may not use this file except in compliance
# with the License. You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
struct CompressedBuffer
data::Vector{UInt8}
uncompressedlength::Int64
end
"""
Arrow.Compressed
Represents the compressed version of an [`ArrowVector`](@ref).
Holds a reference to the original column. May have `Compressed`
children for nested array types.
"""
struct Compressed{Z, A}
data::A
buffers::Vector{CompressedBuffer}
len::Int64
nullcount::Int64
children::Vector{Compressed}
end
Base.length(c::Compressed) = c.len
Base.eltype(c::Compressed{Z, A}) where {Z, A} = eltype(A)
getmetadata(x::Compressed) = getmetadata(x.data)
compressiontype(c::Compressed{Z}) where {Z} = Z
function compress(Z::Meta.CompressionType, comp, x::Array)
GC.@preserve x begin
y = unsafe_wrap(Array, convert(Ptr{UInt8}, pointer(x)), sizeof(x))
return CompressedBuffer(transcode(comp, y), length(y))
end
end
compress(Z::Meta.CompressionType, comp, x) = compress(Z, comp, convert(Array, x))
compress(Z::Meta.CompressionType, comp, v::ValidityBitmap) =
v.nc == 0 ? CompressedBuffer(UInt8[], 0) : compress(Z, comp, view(v.bytes, v.pos:(v.pos + cld(v.ℓ, 8) - 1)))
function makenodesbuffers!(col::Compressed, fieldnodes, fieldbuffers, bufferoffset, alignment)
push!(fieldnodes, FieldNode(col.len, col.nullcount))
@debug 1 "made field node: nodeidx = $(length(fieldnodes)), col = $(typeof(col)), len = $(fieldnodes[end].length), nc = $(fieldnodes[end].null_count)"
for buffer in col.buffers
blen = length(buffer.data) == 0 ? 0 : 8 + length(buffer.data)
push!(fieldbuffers, Buffer(bufferoffset, blen))
@debug 1 "made field buffer: bufferidx = $(length(fieldbuffers)), offset = $(fieldbuffers[end].offset), len = $(fieldbuffers[end].length), padded = $(padding(fieldbuffers[end].length, alignment))"
bufferoffset += padding(blen, alignment)
end
for child in col.children
bufferoffset = makenodesbuffers!(child, fieldnodes, fieldbuffers, bufferoffset, alignment)
end
return bufferoffset
end
function writearray(io, b::CompressedBuffer)
if length(b.data) > 0
n = Base.write(io, b.uncompressedlength)
@debug 1 "writing compressed buffer: uncompressedlength = $(b.uncompressedlength), n = $(length(b.data))"
@debug 2 b.data
return n + Base.write(io, b.data)
end
return 0
end
function writebuffer(io, col::Compressed, alignment)
@debug 1 "writebuffer: col = $(typeof(col))"
@debug 2 col
for buffer in col.buffers
n = writearray(io, buffer)
writezeros(io, paddinglength(n, alignment))
end
for child in col.children
writebuffer(io, child, alignment)
end
return
end
| Julia | 5 | tanmaykm/Arrow.jl | src/arraytypes/compressed.jl | [
"Apache-2.0"
]
|
#! /bin/sh -e
## 06_add_compile_time_defaults.dpatch by <[email protected]>
##
## All lines beginning with `## DP:' are a description of the patch.
## DP: Change a few compile time defaults so that Tor is better integrated on a Debian system
if [ $# -lt 1 ]; then
echo "`basename $0`: script expects -patch|-unpatch as argument" >&2
exit 1
fi
[ -f debian/patches/00patch-opts ] && . debian/patches/00patch-opts
patch_opts="${patch_opts:--f --no-backup-if-mismatch} ${2:+-d $2}"
case "$1" in
-patch) patch -p1 ${patch_opts} < $0;;
-unpatch) patch -R -p1 ${patch_opts} < $0;;
*)
echo "`basename $0`: script expects -patch|-unpatch as argument" >&2
exit 1;;
esac
exit 0
@DPATCH@
diff -urNad tor~/src/or/config.c tor/src/or/config.c
--- tor~/src/or/config.c 2009-09-03 15:05:41.000000000 +0200
+++ tor/src/or/config.c 2009-09-03 15:09:37.662104166 +0200
@@ -12,6 +12,7 @@
#define CONFIG_PRIVATE
#include "or.h"
+#include <pwd.h>
#ifdef MS_WINDOWS
#include <shlobj.h>
#endif
@@ -717,6 +718,9 @@
static void init_libevent(void);
static int opt_streq(const char *s1, const char *s2);
+static int debian_running_as_debiantor();
+static int debian_config_fix_defaults();
+
/** Magic value for or_options_t. */
#define OR_OPTIONS_MAGIC 9090909
@@ -4086,6 +4090,9 @@
char *command_arg = NULL;
char *errmsg=NULL;
+ if (debian_config_fix_defaults() < 0)
+ goto err;
+
if (argv) { /* first time we're called. save command line args */
backup_argv = argv;
backup_argc = argc;
@@ -5304,3 +5311,62 @@
return 0;
}
+/* Checks whether we are running as the debian-tor user.
+ * Returns -1 on error, 2 if we are root, 1 if we are debian-tor, 0 if we are any normal user */
+static int
+debian_running_as_debiantor()
+{
+ struct passwd *pw = NULL;
+ int uid;
+
+ uid = getuid();
+ /* If we run as root we also apply our debian defaults. */
+ if (uid == 0)
+ return 2;
+
+ pw = getpwuid(uid);
+ if (!pw) {
+ log(LOG_WARN, LD_GENERAL, "Could not get passwd information for uid %d.", uid);
+ return -1;
+ }
+ assert(pw->pw_name);
+ if (strcmp(pw->pw_name, "debian-tor") == 0)
+ return 1;
+ else
+ return 0;
+}
+
+static int
+debian_config_fix_defaults()
+{
+ config_var_t *var;
+ static int fixed = 0;
+ int running_as_debian;
+
+ if (fixed) return 0;
+ fixed = 1;
+
+ running_as_debian = debian_running_as_debiantor();
+ if (running_as_debian < 0) return -1;
+ if (!running_as_debian) return 0;
+
+ var = config_find_option(&options_format, "DataDirectory");
+ tor_assert(var);
+ var->initvalue = tor_strdup("/var/lib/tor");
+
+ var = config_find_option(&options_format, "PidFile");
+ tor_assert(var);
+ var->initvalue = tor_strdup("/var/run/tor/tor.pid");
+
+ var = config_find_option(&options_format, "RunAsDaemon");
+ tor_assert(var);
+ var->initvalue = tor_strdup("1");
+
+ if (running_as_debian == 2) {
+ var = config_find_option(&options_format, "User");
+ tor_assert(var);
+ var->initvalue = tor_strdup("debian-tor");
+ };
+
+ return 0;
+}
| Darcs Patch | 5 | cluesblues/Tor | debian/patches/06_add_compile_time_defaults.dpatch | [
"BSD-3-Clause"
]
|
syntax = "proto2";
import "google/protobuf/descriptor.proto";
package third_party.tensorflow.tools.api;
message TFAPIMember {
optional string name = 1;
optional string mtype = 2;
};
message TFAPIMethod {
optional string name = 1;
optional string path = 2;
optional string argspec = 3;
};
message TFAPIModule {
repeated TFAPIMember member = 1;
repeated TFAPIMethod member_method = 2;
};
message TFAPIClass {
repeated string is_instance = 1;
repeated TFAPIMember member = 2;
repeated TFAPIMethod member_method = 3;
};
message TFAPIProto {
// Suppress generation of the proto API's descriptor() method lest it
// conflict with the standard accessor for the field having the same name.
option no_standard_descriptor_accessor = true;
optional google.protobuf.DescriptorProto descriptor = 1;
};
message TFAPIObject {
optional string path = 1;
optional TFAPIModule tf_module = 2;
optional TFAPIClass tf_class = 3;
optional TFAPIProto tf_proto = 4;
};
| Protocol Buffer | 4 | abhaikollara/tensorflow | tensorflow/tools/api/lib/api_objects.proto | [
"Apache-2.0"
]
|
# Copyright 2021 The Google Research Authors.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
#!/bin/bash
# TODO(ereal): fix mutate_*_size_* values. Affects random number generation.
# Nonlinear example with Neural Network as init model:
bazel run -c opt \
--copt=-DMAX_SCALAR_ADDRESSES=5 \
--copt=-DMAX_VECTOR_ADDRESSES=9 \
--copt=-DMAX_MATRIX_ADDRESSES=2 \
:run_search_experiment -- \
--search_experiment_spec=" \
search_tasks { \
tasks { \
scalar_2layer_nn_regression_task {} \
features_size: 4 \
num_train_examples: 1000 \
num_valid_examples: 100 \
num_tasks: 1 \
eval_type: RMS_ERROR \
} \
} \
setup_ops: [VECTOR_GAUSSIAN_SET_OP, MATRIX_GAUSSIAN_SET_OP] \
predict_ops: [] \
learn_ops: [] \
setup_size_init: 2 \
predict_size_init: 1 \
learn_size_init: 4 \
train_budget {train_budget_baseline: NEURAL_NET_ALGORITHM} \
fitness_combination_mode: MEAN_FITNESS_COMBINATION \
population_size: 1000 \
tournament_size: 10 \
initial_population: INTEGRATION_TEST_DAMAGED_NEURAL_NET_ALGORITHM \
max_train_steps: 100000000 \
allowed_mutation_types {
mutation_types: [ALTER_PARAM_MUTATION_TYPE, INSERT_INSTRUCTION_MUTATION_TYPE, REMOVE_INSTRUCTION_MUTATION_TYPE, TRADE_INSTRUCTION_MUTATION_TYPE] \
} \
mutate_prob: 1.0 \
mutate_setup_size_min: 6 \
mutate_setup_size_max: 7 \
mutate_predict_size_min: 3 \
mutate_predict_size_max: 4 \
mutate_learn_size_min: 9 \
mutate_learn_size_max: 10 \
progress_every: 10000 \
" \
--final_tasks=" \
tasks { \
scalar_2layer_nn_regression_task {} \
features_size: 4 \
num_train_examples: 1000 \
num_valid_examples: 100 \
num_tasks: 1 \
eval_type: RMS_ERROR \
param_seeds: [9000] \
data_seeds: [19000] \
} \
" \
--random_seed=100001 \
--select_tasks=" \
tasks { \
scalar_2layer_nn_regression_task {} \
features_size: 4 \
num_train_examples: 1000 \
num_valid_examples: 100 \
num_tasks: 1 eval_type: \
RMS_ERROR param_seeds: [9000] \
data_seeds: [19000] \
} \
"
| Shell | 3 | deepneuralmachine/google-research | automl_zero/run_integration_test_nonlinear.sh | [
"Apache-2.0"
]
|
#!/bin/bash
# The script runs the DST tests.
#
# It's a part of the test process.
set -ex
export PATH="$(yarn bin):$PATH"
export NODE_ENV=test
env TZ=America/Sao_Paulo babel-node --extensions .ts,.js ./test/dst/parseISO/basic.js
env TZ=Australia/Sydney babel-node --extensions .ts,.js ./test/dst/parseISO/sydney.js
env TZ=Pacific/Apia babel-node --extensions .ts,.js ./test/dst/parseISO/samoa.js
env TZ=Asia/Damascus babel-node --extensions .ts,.js ./test/dst/eachDayOfInterval/basic.js
env TZ=America/Santiago babel-node --extensions .ts,.js ./test/dst/addBusinessDays/basic.js
env TZ=Australia/Melbourne ts-node ./test/dst/formatDistanceStrict/melbourne.ts
env TZ=Africa/Cairo ts-node ./test/dst/formatDistanceStrict/cairo.ts | Shell | 3 | arome/date-fns | scripts/test/dst.sh | [
"MIT"
]
|
package com.baeldung.iteratemap
import com.baeldung.find.Person
import org.junit.Test
import static org.junit.Assert.*
class IterateMapUnitTest {
@Test
void whenUsingEach_thenMapIsIterated() {
def map = [
'FF0000' : 'Red',
'00FF00' : 'Lime',
'0000FF' : 'Blue',
'FFFF00' : 'Yellow'
]
map.each { println "Hex Code: $it.key = Color Name: $it.value" }
}
@Test
void whenUsingEachWithEntry_thenMapIsIterated() {
def map = [
'E6E6FA' : 'Lavender',
'D8BFD8' : 'Thistle',
'DDA0DD' : 'Plum',
]
map.each { entry -> println "Hex Code: $entry.key = Color Name: $entry.value" }
}
@Test
void whenUsingEachWithKeyAndValue_thenMapIsIterated() {
def map = [
'000000' : 'Black',
'FFFFFF' : 'White',
'808080' : 'Gray'
]
map.each { key, val ->
println "Hex Code: $key = Color Name $val"
}
}
@Test
void whenUsingEachWithIndexAndEntry_thenMapIsIterated() {
def map = [
'800080' : 'Purple',
'4B0082' : 'Indigo',
'6A5ACD' : 'Slate Blue'
]
map.eachWithIndex { entry, index ->
def indent = ((index == 0 || index % 2 == 0) ? " " : "")
println "$indent Hex Code: $entry.key = Color Name: $entry.value"
}
}
@Test
void whenUsingEachWithIndexAndKeyAndValue_thenMapIsIterated() {
def map = [
'FFA07A' : 'Light Salmon',
'FF7F50' : 'Coral',
'FF6347' : 'Tomato',
'FF4500' : 'Orange Red'
]
map.eachWithIndex { key, val, index ->
def indent = ((index == 0 || index % 2 == 0) ? " " : "")
println "$indent Hex Code: $key = Color Name: $val"
}
}
@Test
void whenUsingForLoop_thenMapIsIterated() {
def map = [
'2E8B57' : 'Seagreen',
'228B22' : 'Forest Green',
'008000' : 'Green'
]
for (entry in map) {
println "Hex Code: $entry.key = Color Name: $entry.value"
}
}
}
| Groovy | 4 | DBatOWL/tutorials | core-groovy-collections/src/test/groovy/com/baeldung/iteratemap/IterateMapUnitTest.groovy | [
"MIT"
]
|
{
"title": "Escoria Demo Game",
"description": "A demo game made using the Escoria framework",
"category_id": "10",
"godot_version": "3.3",
"version_string": "{{ context.release.tag_name }}",
"cost": "MIT",
"download_provider": "GitHub",
"download_commit": "{{ env.GITHUB_SHA }}",
"browse_url": "{{ context.repository.html_url }}",
"issues_url": "https://github.com/godot-escoria/escoria-issues/issues",
"icon_url": "https://github.com/godot-escoria/.github/raw/main/design/escoria-icon.png"
} | Harbour | 2 | ArturM/escoria-demo-game | .asset-template.json.hb | [
"MIT"
]
|
#include "globalDefines.h"
!=========================================================
program main
!=========================================================
use params_module, only : nx, ny, nz
implicit none
integer, parameter :: g = 9.81
real, allocatable, dimension(:,:,:) :: array
integer :: a, b, c
real*8 :: x, y, z
b = 5
c = 7
#ifdef ARRAY_COMP
allocate(array(10,10,10), status=a)
write(c,'(i5.5)') b
#endif
if(x.lt.5.0) then
array(:,:,:) = g
else
array(:,:,:) = x - y
endif
return
!========================================================
end program main
!========================================================
| FORTRAN | 3 | websharks/ace-builds | demo/kitchen-sink/docs/fortran.f90 | [
"BSD-3-Clause"
]
|
var $arr1 <[10] i32>
var $arr2 <[10] i32>
var $arr3 <[10] i32>
func $ArrayAdd () void {
var %i i32
doloop %i (
constval i32 0,
lt i32 i32 (dread i32 %i, constval i32 10),
add i32(dread i32 %i, constval i32 1)){
iassign <* [10] i32>(
array 1 a32 <* [10] i32>(addrof a32 $arr1, dread i32 %i),
add i32(
iread i32 <* [10] i32>(
array 1 a32 <* [10] i32>(addrof a32 $arr2, dread i32 %i)),
iread i32 <* [10] i32>(
array 1 a32 <* [10] i32>(addrof a32 $arr3, dread i32 %i))
))
}
return()
}
# EXEC: %irbuild Main.mpl
# EXEC: %irbuild Main.irb.mpl
# EXEC: %cmp Main.irb.mpl Main.irb.irb.mpl
| Maple | 3 | harmonyos-mirror/OpenArkCompiler-test | test/testsuite/irbuild_test/I0005-mapleall-irbuild-edge-arrayadd/Main.mpl | [
"MulanPSL-1.0"
]
|
Feature: hub help
Scenario: Appends hub help to regular help text
When I successfully run `hub help`
Then the output should contain:
"""
These GitHub commands are provided by hub:
api Low-level GitHub API request interface
"""
And the output should contain "usage: git "
Scenario: Shows help text with no arguments
When I run `hub`
Then the stdout should contain "usage: git "
And the stderr should contain exactly ""
And the exit status should be 1
Scenario: Appends hub commands to `--all` output
When I successfully run `hub help -a`
Then the output should contain "pull-request"
Scenario: Shows help for a hub extension
When I successfully run `hub help hub-help`
Then "man hub-help" should be run
Scenario: Shows help for a hub command
When I successfully run `hub help fork`
Then "man hub-fork" should be run
Scenario: Show help in HTML format
When I successfully run `hub help -w fork`
Then "man hub-fork" should not be run
And "git web--browse PATH/hub-fork.1.html" should be run
Scenario: Show help in HTML format by default
Given I successfully run `git config --global help.format html`
When I successfully run `hub help fork`
Then "git web--browse PATH/hub-fork.1.html" should be run
Scenario: Override HTML format back to man
Given I successfully run `git config --global help.format html`
When I successfully run `hub help -m fork`
Then "man hub-fork" should be run
Scenario: The --help flag opens man page
When I successfully run `hub fork --help`
Then "man hub-fork" should be run
Scenario: The --help flag expands alias first
Given I successfully run `git config --global alias.ci ci-status`
When I successfully run `hub ci --help`
Then "man hub-ci-status" should be run
| Cucumber | 4 | mbbroberg/hub | features/help.feature | [
"MIT"
]
|
"""Device automation exceptions."""
from homeassistant.exceptions import HomeAssistantError
class InvalidDeviceAutomationConfig(HomeAssistantError):
"""When device automation config is invalid."""
class DeviceNotFound(HomeAssistantError):
"""When referenced device not found."""
| Python | 4 | domwillcode/home-assistant | homeassistant/components/device_automation/exceptions.py | [
"Apache-2.0"
]
|
.PHONY: chromad upload all
VERSION ?= $(shell git describe --tags --dirty --always)
all: README.md tokentype_string.go
README.md: lexers/*/*.go
./table.py
tokentype_string.go: types.go
go generate
chromad:
rm -f chromad
(export CGOENABLED=0 GOOS=linux ; cd ./cmd/chromad && go build -ldflags="-X 'main.version=$(VERSION)'" -o ../../chromad .)
upload: chromad
scp chromad [email protected]: && \
ssh [email protected] 'install -m755 ./chromad /srv/http/swapoff.org/bin && service chromad restart'
| Makefile | 3 | wxiaoguang/gitea | vendor/github.com/alecthomas/chroma/Makefile | [
"MIT"
]
|
# If we are about to serve a 5xx we need to restart then in vcl_recv error out to
# get the holding page
if ( resp.status >= 500 && resp.status < 600 && !req.http.ResponseObject ) {
set req.http.ResponseObject = "970";
restart;
}
| VCL | 4 | paliarush/fastly-magento2 | etc/vcl_snippets_error_page/deliver.vcl | [
"BSD-3-Clause"
]
|
(* ****** ****** *)
(*
**
** HX-2018-01:
** For testing
** broadcast-based sessions
** that are dynamically typed
**
*)
(* ****** ****** *)
#include
"share/atspre_staload.hats"
#include
"share\
/atspre_staload_libats_ML.hats"
(* ****** ****** *)
#staload"./../../SATS/basics.sats"
#staload"./../../DATS/basics.dats"
(* ****** ****** *)
extern
fun
myclient
{id:int}
( CH: channel(id)
, prot: protocol(id)
, lines: stream_vt(string)): stream_vt(string)
extern
fun
myclient_optrep
{id:int}
( CH: channel(id)
, prot: protocol(id), lines: stream_vt(string)): void
(* ****** ****** *)
//
#staload UN = $UNSAFE
//
#staload "./mybasis.dats"
//
(* ****** ****** *)
implement
myclient
(CH, prot, lines) = let
//
var prot = prot
//
val x1 =
chanprot_bmsg_recv<int>
(CH, prot)
val x2 =
chanprot_bmsg_recv<int>
(CH, prot)
//
val () =
println! ("x1 = ", x1)
val () =
println! ("x2 = ", x2)
//
val () =
println!
(">>Input your answer:")
//
val-
~stream_vt_cons
(line, lines) = !lines
val y3 =
g0string2int(line)
val () =
chanprot_bmsg_send<int>
(CH, prot, y3)
val () =
println! ("y3 = ", y3)
//
val x4 =
chanprot_bmsg_recv<int>(CH, prot)
//
val () =
println! ("x4 = ", x4)
//
val () =
chanprot_elim_nil(CH, prot)
//
in
//
lines where
{
val () =
if (x4 > 0)
then println!("Correct!") else println!("Incorrect!")
}
//
end // end of [let] // end of [myclient]
(* ****** ****** *)
implement
myclient_optrep
(CH, prot, lines) = let
//
var prot = prot
//
(*
val () =
println!
( "prot = "
, $UN.castvwtp1{prtcl}(prot))
*)
//
val opt =
chanprot_conj_aneg<>(CH, prot)
(*
val
((*void*)) =
println!
("myclient_optrep: opt = ", opt)
*)
//
in
//
if
(opt=0)
then let
val () =
chanprot_elim_nil<>
(CH, prot)
in
free(lines);
println!("It is over!")
end // end of [then]
else let
val-
~Some_vt(P0) =
prtcl_join_uncons(prot)
val lines =
myclient(CH, P0, lines)
in
myclient_optrep(CH, prot, lines)
end // end of [else]
//
end // end of [myclient_optrep]
(* ****** ****** *)
local
#dynload"./mybasis.dats"
#include
"./../../DATS/basics.dats"
in (*in-of-local*)
implement
main0() = () where
{
//
val
prot =
prtcl_optrep(0, myprtcl())
val
[id:int]
prot =
$UN.castvwtp0{protocol()}(prot)
//
val CH =
$UN.cast
{channel(id)}(list0_tuple<int>(1))
//
val ((*void*)) =
myclient_optrep
(CH, prot, lines) where
{
val
lines =
streamize_fileref_line(stdin_ref)
}
//
} (* end of [main0] *)
end // end of [local]
(* ****** ****** *)
(* end of [myclient.dats] *)
| ATS | 3 | ats-lang/ATS-CodeBook | PLAYGROUND/mysession-bucs520-2018-01/TEST/test02/myclient.dats | [
"MIT"
]
|
# From: =?ISO-8859-1?Q?J=FCrgen_Kahrs?= <[email protected]>
# Newsgroups: gnu.utils.bug
# Subject: Re: gawk-3.1.5: syntax error, core dump
# Date: Fri, 23 Jun 2006 18:12:07 +0200
# Lines: 12
# Approved: [email protected]
# Message-ID: <[email protected]>
# References: <[email protected]>
# Reply-To: [email protected]
# NNTP-Posting-Host: lists.gnu.org
# Mime-Version: 1.0
# Content-Type: text/plain; charset=ISO-8859-1
# Content-Transfer-Encoding: 7bit
# X-Trace: news.Stanford.EDU 1151079136 27033 199.232.76.165 (23 Jun 2006 16:12:16 GMT)
# X-Complaints-To: [email protected]
# To: [email protected]
# Envelope-to: [email protected]
# X-Orig-X-Trace: individual.net
# vYX9N7nUUtqHxPyspweN0gZ4Blkl17z/xU01EwbykxB178O8M=
# User-Agent: Thunderbird 1.5 (X11/20060317)
# In-Reply-To: <[email protected]>
# X-BeenThere: [email protected]
# X-Mailman-Version: 2.1.5
# Precedence: list
# List-Id: Bug reports for the GNU utilities <bug-gnu-utils.gnu.org>
# List-Unsubscribe: <http://lists.gnu.org/mailman/listinfo/bug-gnu-utils>,
# <mailto:[email protected]?subject=unsubscribe>
# List-Archive: <http://lists.gnu.org/pipermail/bug-gnu-utils>
# List-Post: <mailto:[email protected]>
# List-Help: <mailto:[email protected]?subject=help>
# List-Subscribe: <http://lists.gnu.org/mailman/listinfo/bug-gnu-utils>,
# <mailto:[email protected]?subject=subscribe>
# Path: news.012.net.il!seanews2.seabone.net!newsfeed.albacom.net!news.mailgate.org!newsfeed.stueberl.de!newsfeed.news2me.com!headwall.stanford.edu!newsfeed.stanford.edu!shelby.stanford.edu!individual.net!not-for-mail
# Xref: news.012.net.il gnu.utils.bug:813
#
# Karel Zak wrote:
#
# > it seems that gawk has problem with "syntax error" reporting:
# >
# > ./gawk '/^include / { system(sprintf("cd /etc; cat %s", [$]2)); skip
# > = 1; } { if (!skip) print $0; skipQuit; }' < /etc/ld.so.conf
#
# This test case can be boiled down to
#
# gawk 'BEGIN {sprintf("%s", $)}'
#
BEGIN { sprintf("%s", $) }
| Awk | 1 | Crestwave/goawk | testdata/gawk/synerr2.awk | [
"MIT"
]
|
{
"cells": [
{
"cell_type": "markdown",
"metadata": {
"colab_type": "text",
"id": "OlDwW4HY8MoU"
},
"source": [
"# Introduction\n"
]
},
{
"cell_type": "markdown",
"metadata": {
"colab_type": "text",
"id": "2pFlZCUv7hM-"
},
"source": [
"\n",
"In this notebook, we will \n",
"- Learn how to use BoostedTrees Classifier for training and evaluating\n",
"- Explore how training can be speeded up for small datasets\n",
"- Will develop intuition for how some of the hyperparameters affect the performance of boosted trees.\n"
]
},
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"colab": {},
"colab_type": "code",
"id": "QGP_iZh-1SX3"
},
"outputs": [],
"source": [
"# We will use some np and pandas for dealing with input data.\n",
"import numpy as np\n",
"import pandas as pd\n",
"# And of course, we need tensorflow.\n",
"import tensorflow as tf\n",
"\n",
"from distutils.version import StrictVersion"
]
},
{
"cell_type": "code",
"execution_count": null,
"metadata": {},
"outputs": [],
"source": [
"tf.__version__"
]
},
{
"cell_type": "markdown",
"metadata": {
"colab_type": "text",
"id": "vfxkZE-MaY0h"
},
"source": [
"# Load dataset\n",
"We will be using the titanic dataset, where the goal is to predict passenger survival given characteristiscs such as gender, age, class, etc."
]
},
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"colab": {},
"colab_type": "code",
"id": "gd995mWZzOTz"
},
"outputs": [],
"source": [
"tf.logging.set_verbosity(tf.logging.INFO)\n",
"tf.set_random_seed(123)\n",
"\n",
"# Load dataset.\n",
"dftrain = pd.read_csv('https://storage.googleapis.com/tf-datasets/titanic/train.csv')\n",
"dfeval = pd.read_csv('https://storage.googleapis.com/tf-datasets/titanic/eval.csv')\n",
"y_train = dftrain.pop('survived')\n",
"y_eval = dfeval.pop('survived')"
]
},
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"colab": {},
"colab_type": "code",
"id": "HPs8YoHMkB7_"
},
"outputs": [],
"source": [
"fcol = tf.feature_column\n",
"CATEGORICAL_COLUMNS = ['sex', 'n_siblings_spouses', 'parch', 'class', 'deck',\n",
" 'embark_town', 'alone']\n",
"NUMERIC_COLUMNS = ['age', 'fare']\n",
"\n",
"def one_hot_cat_column(feature_name, vocab):\n",
" return fcol.indicator_column(\n",
" fcol.categorical_column_with_vocabulary_list(feature_name,\n",
" vocab))\n",
"fc = []\n",
"for feature_name in CATEGORICAL_COLUMNS:\n",
" # Need to one-hot encode categorical features.\n",
" vocabulary = dftrain[feature_name].unique()\n",
" fc.append(one_hot_cat_column(feature_name, vocabulary))\n",
"\n",
"for feature_name in NUMERIC_COLUMNS:\n",
" fc.append(fcol.numeric_column(feature_name,\n",
" dtype=tf.float32))"
]
},
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"colab": {},
"colab_type": "code",
"id": "R_51OufwaY0o"
},
"outputs": [],
"source": [
"# Prepare the input fn. Use the entire dataset for a batch since this is such a small dataset.\n",
"def make_input_fn(X, y, n_epochs=None, do_batching=True):\n",
" def input_fn():\n",
" BATCH_SIZE = len(y) # Use entire dataset.\n",
" dataset = tf.data.Dataset.from_tensor_slices((X.to_dict(orient='list'), y))\n",
" # For training, cycle thru dataset as many times as need (n_epochs=None). \n",
" dataset = dataset.repeat(n_epochs) \n",
" if do_batching:\n",
" dataset = dataset.batch(BATCH_SIZE)\n",
" return dataset\n",
" return input_fn"
]
},
{
"cell_type": "markdown",
"metadata": {
"colab_type": "text",
"id": "DMwL7qlrAdWk"
},
"source": [
"# Training and Evaluating Classifiers"
]
},
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"colab": {},
"colab_type": "code",
"id": "pBhdfNzXjAsT"
},
"outputs": [],
"source": [
"TRAIN_SIZE = len(dftrain)\n",
"params = {\n",
" 'n_trees':10,\n",
" 'center_bias':False,\n",
" 'l2_regularization':1./TRAIN_SIZE # regularization is per instance, so if you are familiar with XGBoost, you need to divide these values by the num of examples per layer\n",
"}\n"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"Exercise: Train a Boosted Trees model using tf.estimator. What are the best results you can get?"
]
},
{
"cell_type": "markdown",
"metadata": {
"colab_type": "text",
"id": "hw4avA1R23dL"
},
"source": [
"Train and evaluate the model. We will look at accuracy first.\n"
]
},
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"colab": {
"base_uri": "https://localhost:8080/",
"height": 852
},
"colab_type": "code",
"id": "GsMoeNiEHlox",
"outputId": "ac640831-a46a-4c6a-b901-6663aa9f2ee9"
},
"outputs": [],
"source": [
"# Training and evaluation input functions.\n",
"n_batches_per_layer = 1 # Use one batch, consisting of the entire dataset to build each layer in the tree.\n",
"DO_BATCHING = True\n",
"\n",
"train_input_fn = make_input_fn(dftrain, y_train, n_epochs=None, do_batching=DO_BATCHING)\n",
"eval_input_fn = make_input_fn(dfeval, y_eval, n_epochs=1, do_batching=DO_BATCHING)\n",
"est = # TODO\n",
"\n",
"est.train(train_input_fn)\n",
"\n",
"# Eval.\n",
"pd.Series(est.evaluate(eval_input_fn))"
]
},
{
"cell_type": "markdown",
"metadata": {
"colab_type": "text",
"id": "eE1xyZrt285E"
},
"source": [
"Exercise #2: Can you get better performance out of the classifier? How do the results compare to using a DNN? Accuracy and AUC?"
]
},
{
"cell_type": "markdown",
"metadata": {
"colab_type": "text",
"id": "fDNzuC0xUstP"
},
"source": [
"# Results"
]
},
{
"cell_type": "markdown",
"metadata": {
"colab_type": "text",
"id": "d_iUYaTq2ZgL"
},
"source": [
"Let's understand how our model is performing."
]
},
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"colab": {
"height": 289
},
"colab_type": "code",
"id": "kgds_rmq2_2t",
"outputId": "931df046-e7fe-4e7e-9680-5106a40265ad"
},
"outputs": [],
"source": [
"pred_dicts = list(est.predict(eval_input_fn))\n",
"probs = pd.Series([pred['probabilities'][1] for pred in pred_dicts])\n",
"\n",
"probs.plot(kind='hist', bins=20, title='predicted probabilities');"
]
},
{
"cell_type": "markdown",
"metadata": {
"colab_type": "text",
"id": "jq-CPquY-bG3"
},
"source": [
"**???** Why are the probabilities right skewed?"
]
},
{
"cell_type": "markdown",
"metadata": {
"colab_type": "text",
"id": "qrvEyh4Q3YgC"
},
"source": [
"Let's plot an ROC curve to understand model performance for various predicition probabilities."
]
},
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"colab": {
"height": 307
},
"colab_type": "code",
"id": "ByhMg-_a3K_q",
"outputId": "f02d1b06-cc0a-43ac-b95e-3e9192a59099"
},
"outputs": [],
"source": [
"from sklearn.metrics import roc_curve\n",
"from matplotlib import pyplot as plt\n",
"\n",
"fpr, tpr, _ = roc_curve(y_eval, probs)\n",
"plt.plot(fpr, tpr)\n",
"plt.title('ROC curve')\n",
"plt.xlabel('false positive rate')\n",
"plt.ylabel('true positive rate')\n",
"plt.xlim(0,)\n",
"plt.ylim(0,);"
]
},
{
"cell_type": "markdown",
"metadata": {
"colab_type": "text",
"id": "9HKAt75V3O8E"
},
"source": [
"**???** What does true positive rate and false positive rate refer to for this dataset?"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"Copyright 2019 Google Inc. Licensed under the Apache License, Version 2.0 (the \"License\"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License"
]
},
{
"cell_type": "code",
"execution_count": null,
"metadata": {},
"outputs": [],
"source": []
}
],
"metadata": {
"colab": {
"collapsed_sections": [],
"name": "ASL_b_boosted_trees_estimator",
"provenance": [],
"version": "0.3.2"
},
"kernelspec": {
"display_name": "Python 2",
"language": "python",
"name": "python2"
},
"language_info": {
"codemirror_mode": {
"name": "ipython",
"version": 2
},
"file_extension": ".py",
"mimetype": "text/x-python",
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython2",
"version": "2.7.13"
}
},
"nbformat": 4,
"nbformat_minor": 2
}
| Jupyter Notebook | 4 | laurenzberger/training-data-analyst | courses/machine_learning/deepdive/supplemental_gradient_boosting/labs/b_boosted_trees_estimator.ipynb | [
"Apache-2.0"
]
|
PREFIX : <http://example/>
PREFIX xsd: <http://www.w3.org/2001/XMLSchema#>
SELECT *
{
?x :r ?v .
FILTER ( ?v > "2006-08-22"^^xsd:date )
}
| SPARQL | 3 | yanaspaula/rdf4j | testsuites/sparql/src/main/resources/testcases-sparql-1.0-w3c/data-r2/open-world/date-3.rq | [
"BSD-3-Clause"
]
|
REBOL [
Title: "Generates Red float! tests"
Author: "Peter W A Wood"
File: %make-float-auto-test.r
Version: 0.1.0
Tabs: 4
Rights: "Copyright (C) 2011-2015 Peter W A Wood. All rights reserved."
License: "BSD-3 - https://github.com/red/red/blob/origin/BSD-3-License.txt"
]
;; initialisations
tests: copy "" ;; string to hold generated tests
test-number: 0 ;; number of the generated test
make-dir %auto-tests/
file-out: %auto-tests/float-auto-test.red
;; create a block of values to be used in the binary ops tests
test-values: [
0.0
-2147483648.0
2147483647.0
-1.0
3.0
-7.0
5.0
123456.7890
1.222090944E+33
9.99999E-45
7.7E18
]
tol: 1e-4
;; create blocks of operators to be applied
test-binary-ops: [
+
-
*
/
; // ;; not implemented fully yet
; "%" ;; not implemented fully yet
]
test-comparison-ops: [
=
<>
<
>
>=
<=
]
test-comparison-values: [
-1E-13
0.0
+1E-13
]
;; create test file with header
append tests "Red [^(0A)"
append tests { Title: "Red auto-generated float! tests"^(0A)}
append tests { Author: "Peter W A Wood"^(0A)}
append tests { File: %float-auto-test.red^(0A)}
append tests { License: "BSD-3 - https://github.com/dockimbel/Red/blob/origin/BSD-3-License.txt"^(0A)}
append tests "]^(0A)^(0A)"
append tests "^(0A)^(0A)comment {"
append tests " This file is generated by make-float-auto-test.r^(0A)"
append tests " Do not edit this file directly.^(0A)"
append tests "}^(0A)^(0A)"
append tests join ";make-length:"
[length? read %make-float-auto-test.r "^(0A)^(0A)"]
append tests "#include %../../../../quick-test/quick-test.red^(0A)^(0A)"
append tests {~~~start-file~~~ "Auto-generated tests for float"^(0A)^(0A)}
append tests {===start-group=== "Auto-generated tests for float"^(0A)^(0A)}
write file-out tests
tests: copy ""
;; binary operator tests - in global context
foreach op test-binary-ops [
foreach operand1 test-values [
foreach operand2 test-values [
;; only write a test if REBOL produces a result
if attempt [
either op = "%" [
expected: to decimal! do reduce [remainder operand1 operand2]
][
expected: to decimal! do reduce [operand1 op operand2]
]
][
;; test with literal values
test-number: test-number + 1
append tests join { --test-- "float-auto-} [test-number {"^(0A)}]
append tests " --assertf~= "
append tests reform [expected " (" operand1 op operand2 ") " tol "^(0A)"]
;; test with variables
test-number: test-number + 1
append tests join { --test-- "float-auto-} [test-number {"^(0A)}]
append tests join " i: " [operand1 "^(0A)"]
append tests join " j: " [operand2 "^(0A)"]
append tests rejoin [" k: i " op " j^(0A)"]
append tests " --assertf~= "
append tests reform [expected " k " tol "^(0A)"]
;; write tests to file
write/append file-out tests
tests: copy ""
]
recycle
]
]
]
;; binary operator tests - inside a function
;; write function spec
tests: {
float-auto-test-func: func [
/local
i [float!]
j [float!]
k [float!]
][
}
write/append file-out tests
tests: copy ""
foreach op test-binary-ops [
foreach operand1 test-values [
foreach operand2 test-values [
;; only write a test if REBOL produces a result
if attempt [expected: do reduce [operand1 op operand2]][
expected: to decimal! expected
;; test with variables inside the function
test-number: test-number + 1
append tests join { --test-- "float-auto-} [test-number {"^(0A)}]
append tests join " i: " [operand1 "^(0A)"]
append tests join " j: " [operand2 "^(0A)"]
append tests rejoin [" k: i " op " j^(0A)"]
append tests " --assertf~= "
append tests reform [expected " k " tol "^(0A)"]
;; write tests to file
write/append file-out tests
tests: copy ""
]
recycle
]
]
]
;; write closing bracket and function call
append tests " ]^(0a)"
append tests "float-auto-test-func^(0a)"
write/append file-out tests
tests: copy ""
;; comparison tests
foreach op test-comparison-ops [
foreach operand1 test-values [
foreach oper2 test-comparison-values [
;; only write a test if REBOL produces a result
if all [
attempt [operand2: operand1 + oper2]
none <> attempt [expected: do reduce [operand1 op operand2]]
][
test-number: test-number + 1
append tests join { --test-- "float-auto-} [test-number {"^(0A)}]
append tests " --assert "
append tests reform [expected " = (" operand1 op operand2 ")^(0A)"]
;; write tests to file
write/append file-out tests
tests: copy ""
]
]
]
]
;; write file epilog
append tests "^(0A)===end-group===^(0A)^(0A)"
append tests {~~~end-file~~~^(0A)^(0A)}
write/append file-out tests
print ["Number of assertions generated" test-number] | R | 5 | 0xflotus/red | tests/source/units/make-float-auto-test.r | [
"BSL-1.0",
"BSD-3-Clause"
]
|
t gpio 43 sw out0
sleep X
t gpio 43 sw out1
t gpio 43 sw out0
d:\autoexec.ash
reboot yes
| AGS Script | 1 | waltersgrey/autoexechack | Hero3Silver/LoopingXsecondsVideo/autoexec.ash | [
"MIT"
]
|
# Android BLE Library
[  ](https://search.maven.org/artifact/no.nordicsemi.android/ble)
An Android library that solves a lot of Android's Bluetooth Low Energy problems.
The [BleManager](https://github.com/NordicSemiconductor/Android-BLE-Library/blob/master/ble/src/main/java/no/nordicsemi/android/ble/BleManager.java)
class exposes high level API for connecting and communicating with Bluetooth LE peripherals.
The API is clean and easy to read.
## Features
**BleManager** class provides the following features:
1. Connection, with automatic retries
2. Service discovery
3. Bonding (optional) and removing bond information (using reflections)
4. Automatic handling of Service Changed indications
5. Device initialization
6. Asynchronous and synchronous BLE operations using queue
7. Splitting and merging long packets when writing and reading characteristics and descriptors
8. Requesting MTU and connection priority (on Android Lollipop or newer)
9. Reading and setting preferred PHY (on Android Oreo or newer)
10. Reading RSSI
11. Refreshing device cache (using reflections)
12. Reliable Write support
13. Operation timeouts (for *connect*, *disconnect* and *wait for notification* requests)
14. Error handling
15. Logging
16. GATT server (since version 2.2)
The library **does not provide support for scanning** for Bluetooth LE devices.
For scanning, we recommend using
[Android Scanner Compat Library](https://github.com/NordicSemiconductor/Android-Scanner-Compat-Library)
which brings almost all recent features, introduced in Lollipop and later, to the older platforms.
### Version 2.3
New features added in version 2.3:
1. `:ble-ktx` module added with support for coroutines and Flow.
1. `.suspend()` methods added in `Request`s.
2. `asFlow()` method added to `ValueChangedCallback`.
3. Connection and bonding state available as Flow.
4. New helper methods to get a `BluetoothGattCharacteristic` with given required properties
and instance id added to `BluetoothGattService`.
2. `JsonMerger` class added, which should help with use cases when a device sends a JSON file in multiple
packets.
3. `:ble-livedata` migrated to Java with some API changes, as sealed classes are no longer available.
4. Support for new `onServicesChanged()` callback, added in API 31 (Android 12).
5. Option to cancel pending Bluetooth LE connection using `ConnectRequest.cancelPendingConnection()`.
When using coroutines use `.suspend()` method in `Request`, instead of `enqueue()` or `await()`.
To register to notifications and indications (or incoming write requests for server) use
```kotlin
setNotificationCallback(characteristic)
.merge(JsonMerger()) // Example of how to use JsonMerger, optional
.asFlow()
```
This is still experimental feature and any feedback is welcome.
### Version 2.2
New features added in version 2.2:
1. GATT Server support. This includes setting up the local GATT server on the Android device, new
requests for server operations:
* *wait for read*,
* *wait for write*,
* *send notification*,
* *send indication*,
* *set characteristic value*,
* *set descriptor value*.
2. New conditional requests:
* *wait if*,
* *wait until*.
3. BLE operations are no longer called from the main thread.
4. There's a new option to set a handler for invoking callbacks. A handler can also be set per-callback.
### Migration to version 2.2
Version 2.2 breaks some API known from version 2.1.1.
Check out [migration guide](MIGRATION.md).
## Importing
#### Maven Central
The library may be found on Maven Central repository.
Add it to your project by adding the following dependency:
```grovy
implementation 'no.nordicsemi.android:ble:{{VERSION}}'
```
The last version not migrated to AndroidX is 2.0.5.
BLE library with Kotlin extension is available in:
```grovy
implementation 'no.nordicsemi.android:ble-ktx:{{VERSION}}'
```
To import the BLE library with set of parsers for common Bluetooth SIG characteristics, use:
```grovy
implementation 'no.nordicsemi.android:ble-common:{{VERSION}}'
```
For more information, read [this](BLE-COMMON.md).
An extension for easier integration with `LiveData` is available after adding:
```grovy
implementation 'no.nordicsemi.android:ble-livedata:{{VERSION}}'
```
This extension adds `ObservableBleManager` with `state` and `bondingState` properties, which
notify about connection and bond state using `androidx.lifecycle.LiveData`.
#### As a library module
Clone this project and add *ble* module as a dependency to your project:
1. In *settings.gradle* file add the following lines:
```groovy
include ':ble'
project(':ble').projectDir = file('../Android-BLE-Library/ble')
```
2. In *app/build.gradle* file add `implementation project(':ble')` inside dependencies.
3. Sync project and build it.
You may do the same with other modules available in this project. Keep in mind, that
*ble-livedata* module requires Kotlin, but no special changes are required in the app.
#### Setting up
The library uses Java 1.8 features. If you're using Android Studio below 4.2, make sure your
*build.gradle* includes the following configuration:
```groovy
compileOptions {
sourceCompatibility JavaVersion.VERSION_1_8
targetCompatibility JavaVersion.VERSION_1_8
}
// For Kotlin projects additionally:
kotlinOptions {
jvmTarget = "1.8"
}
```
## Usage
A `BleManager` instance is responsible for connecting and communicating with a single peripheral.
Multiple manager instances are allowed. Extend `BleManager` with you manager where you define the
high level device's API.
`BleManager` may be used in different ways:
1. In a Service, for a single connection - see [nRF Toolbox](https://github.com/NordicSemiconductor/Android-nRF-Toolbox) -> RSC profile,
2. In a Service with multiple connections - see nRF Toolbox -> Proximity profile,
3. From ViewModel's repo - see [Architecture Components](https://developer.android.com/topic/libraries/architecture/index.html)
and [nRF Blinky](https://github.com/NordicSemiconductor/Android-nRF-Blinky),
4. As a singleton - not recommended, see nRF Toolbox -> HRM.
Please refer to the `examples/ble-gatt-client folder` for a project that illustrates the GATT
server provided as a foreground service. There's a simple UI with a text field to update
with the value of a characteristic that can be read and subscribed to. This characteristic also
demands encryption as an illustration of best-practice.
You can run this client on one device and a complimenting server on another (see the next section).
#### Adding GATT Server support
Starting from version 2.2 you may now define and use the GATT server in the BLE Library.
Please refer to the `examples/ble-gatt-server folder` for a project that illustrates the GATT
server provided as a foreground service. There's a simple UI with a text field to update
the value of a characteristic that can be read and subscribed to. This characteristic also
demands encryption as an illustration of best-practice.
## More examples
Find the simple example here [Android nRF Blinky](https://github.com/NordicSemiconductor/Android-nRF-Blinky).
For an example how to use it from an Activity or a Service, check the base Activity and Service
classes in [nRF Toolbox](https://github.com/NordicSemiconductor/Android-nRF-Toolbox/tree/master/app/src/main/java/no/nordicsemi/android/nrftoolbox/profile).
## Version 1.x
The BLE library v 1.x is no longer supported. Please migrate to 2.x for bug fixing releases.
Find it on [version/1x branch](https://github.com/NordicSemiconductor/Android-BLE-Library/tree/version/1x).
A migration guide is available [here](MIGRATION.md). | Modelica | 4 | al-nordlicht/dictofun | android/app/libs/Android-BLE-Library/moustache/README.mo | [
"Apache-2.0"
]
|
#
# Copyright 2021 Apollo Authors
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
#
# create namespace
kubectl create namespace sre
# dev-env
kubectl apply -f apollo-env-dev/service-mysql-for-apollo-dev-env.yaml --record && \
kubectl apply -f apollo-env-dev/service-apollo-config-server-dev.yaml --record && \
kubectl apply -f apollo-env-dev/service-apollo-admin-server-dev.yaml --record
# fat-env
kubectl apply -f apollo-env-fat/service-mysql-for-apollo-fat-env.yaml --record && \
kubectl apply -f apollo-env-fat/service-apollo-config-server-fat.yaml --record && \
kubectl apply -f apollo-env-fat/service-apollo-admin-server-fat.yaml --record
# uat-env
kubectl apply -f apollo-env-uat/service-mysql-for-apollo-uat-env.yaml --record && \
kubectl apply -f apollo-env-uat/service-apollo-config-server-uat.yaml --record && \
kubectl apply -f apollo-env-uat/service-apollo-admin-server-uat.yaml --record
# prod-env
kubectl apply -f apollo-env-prod/service-mysql-for-apollo-prod-env.yaml --record && \
kubectl apply -f apollo-env-prod/service-apollo-config-server-prod.yaml --record && \
kubectl apply -f apollo-env-prod/service-apollo-admin-server-prod.yaml --record
# portal
kubectl apply -f service-apollo-portal-server.yaml --record
| Shell | 2 | lff0305/apollo | scripts/apollo-on-kubernetes/kubernetes/kubectl-apply.sh | [
"Apache-2.0"
]
|
export { default } from './Snackbar';
export * from './Snackbar';
export { default as snackbarClasses } from './snackbarClasses';
export * from './snackbarClasses';
| TypeScript | 3 | good-gym/material-ui | packages/material-ui/src/Snackbar/index.d.ts | [
"MIT"
]
|
module com.networknt.switcher {
exports com.networknt.switcher;
} | Jasmin | 2 | KellyShao/light-4j | switcher/src/main/java/module-info.j | [
"Apache-2.0"
]
|
-------------------------------------------------------------
--Copyright 2020 Science and Technologies Facilities Council
--Licensed under the MIT License
--Author Aidan Chalk, STFC Hartree Centre
import "regent"
require("defaults")
require("src/neighbour_search/cell_pair_v2/neighbour_search")
sqrt = regentlib.sqrt(float)
cbrt = regentlib.cbrt(float)
--Viscosity parameters
local const_viscosity_beta = 3.0
--Moved to constants.rg
--Cubic spline kernel
--local kernel_gamma = 1.732051
--local kernel_const = 8.0 / 3.0
----Adiabatic index
--local hydro_gamma = 5.0/3.0
--local hydro_gamma_minus_one = hydro_gamma-1.0
__demand(__inline)
task pow_minus_gamma_minus_one(x : float)
var icbrt = 1.0 / cbrt(x)
return icbrt * icbrt
end
--Ideal gas equation
__demand(__inline)
task gas_pressure_from_internal_energy(density : float, u : float)
return hydro_gamma_minus_one * u * density
end
__demand(__inline)
task gas_soundspeed_from_pressure(density : float, P : float)
var density_inv = 1.0 / density
return sqrt(hydro_gamma * P * density_inv)
end
__demand(__inline)
task gas_entropy_from_internal_energy(density : float, u : float)
return hydro_gamma_minus_one * u * pow_minus_gamma_minus_one(density)
end
--3Dimensions, so x^4
terra pow_dimension_plus_one( val : float)
var x2 = val * val
return x2 * x2
end
--TODO: Optimise kernel evaluation (Could use C code?)
--Think this should be cubic spline, 3 Dimension form only.
terra eval_kernel_func( ui : float, wi : &float, wi_dx : &float )
var kernel_gamma_inv = 1.0 / kernel_gamma
var q3 = 0.0
var q2 = 0.0
var q1 = 0.0
var q0 = 0.0
var x = ui * kernel_gamma_inv
var w :float = 0.0
var w_dx : float = 0.0
if ui <= 0.5 then
q3 = 3.
q2 = -3.0
q1 = 0
q0 = 0.5
else
q3 = -1.0
q2 = 3.0
q1 = -3.0
q0 = 1.0
end
w = q3 * x + q2
w_dx = q3
w_dx = w_dx * x + w
w = w * x + q1
w_dx = w_dx * x + w
w = w * x + q0
if (w < 0.0) then w = 0.0 end
if (w_dx > 0.0) then w_dx = 0.0 end
w = w * kernel_constant * kernel_gamma_inv_dim
w_dx = w_dx * kernel_constant * kernel_gamma_inv_dim_plus_one
@wi = w
@wi_dx = w_dx
-- @wi = q3 * x + q2
-- @wi_dx = q3
-- --
-- @wi_dx = @wi_dx * x + @wi
-- @wi = @wi * x + q1
-- --
-- @wi_dx = @wi_dx * x + @wi
-- @wi = @wi * x + q0
end
function reset_density(part1, config)
local kernel = rquote
part1.wcount = 0.0
part1.wcount_dh = 0.0
part1.rho = 0.0
part1.rho_dh = 0.0
part1.div_v = 0.0
part1.rot_v_x = 0.0
part1.rot_v_y = 0.0
part1.rot_v_z = 0.0
end
return kernel
end
function reset_acceleration(part1, config)
local kernel = rquote
part1.accel_x = 0.0
part1.accel_y = 0.0
part1.accel_z = 0.0
part1.u_dt = 0.0
part1.h_dt = 0.0
part1.v_sig = 2.0 * part1.soundspeed
end
return kernel
end
function end_force(part1, config)
local kernel = rquote
part1.h_dt = part1.h * hydro_dimension_inv
end
return kernel
end
function nonsym_density_kernel(part1, part2, r2)
local hydro_dimension = 3.0
local kernel = rquote
var mj = part2.core_part_space.mass
var ir = 1.0 / sqrt(r2)
var r = r2 * ir
var hi_inv = 1.0 / part1.h
var ui = r * hi_inv
var wi : float
var wi_dx : float
eval_kernel_func(ui, &wi, &wi_dx)
part1.rho = (part1.rho + mj * wi)
part1.rho_dh = part1.rho_dh - (mj * (hydro_dimension * wi + ui * wi_dx))
--if(part1.core_part_space.id == int1d(136970)) then
-- format.println("wi = {} wcount = {} ui = {} h = {} p2 = {} x = {} kgi = {} redo = {}", wi, part1.wcount, ui, part1.h, part2.core_part_space.id, ui / kernel_gamma, 1.0 / kernel_gamma, part1.cutoff_update_space.redo)
-- end
part1.wcount = part1.wcount + wi
-- if(part1.core_part_space.id == int1d(136970)) then
-- format.println("wi = {} wcount = {}", wi, part1.wcount)
-- end
part1.wcount_dh = part1.wcount_dh - (hydro_dimension * wi + ui * wi_dx)
var faci = mj * wi_dx * ir
--Compute dvdr
var dv_x = part1.core_part_space.vel_x - part2.core_part_space.vel_x
var dv_y = part1.core_part_space.vel_y - part2.core_part_space.vel_y
var dv_z = part1.core_part_space.vel_z - part2.core_part_space.vel_z
var dx_x = part1.core_part_space.pos_x - part2.core_part_space.pos_x
var dx_y = part1.core_part_space.pos_y - part2.core_part_space.pos_y
var dx_z = part1.core_part_space.pos_z - part2.core_part_space.pos_z
var dvdr = dv_x * dx_x + dv_y * dx_y + dv_z * dx_z
part1.div_v = part1.div_v - (faci * dvdr)
--Compute dv cross r
var curlvr_x = dv_y * dx_z - dv_z * dx_y
var curlvr_y = dv_z * dx_x - dv_x * dx_z
var curlvr_z = dv_x * dx_y - dv_y * dx_x
part1.rot_v_x = part1.rot_v_x + (faci * curlvr_x)
part1.rot_v_y = part1.rot_v_y + (faci * curlvr_y)
part1.rot_v_z = part1.rot_v_z + (faci * curlvr_z)
end
return kernel
end
function density_kernel(part1, part2, r2)
local hydro_dimension = 3.0
local kernel = rquote
var mi = part1.core_part_space.mass
var mj = part2.core_part_space.mass
var ir = 1.0 / sqrt(r2)
var r = r2 * ir
var hi_inv = 1.0 / part1.h
var ui = r * hi_inv
var wi : float
var wi_dx : float
eval_kernel_func(ui, &wi, &wi_dx)
part1.rho = (part1.rho + mj * wi)
part1.rho_dh = part1.rho_dh - (mj * (hydro_dimension * wi + ui * wi_dx))
part1.wcount = part1.wcount + wi
part1.wcount_dh = part1.wcount_dh - (hydro_dimension * wi + ui * wi_dx)
var hj_inv = 1.0 / part2.h
var uj = r * hj_inv
var wj : float
var wj_dx : float
eval_kernel_func(uj, &wj, &wj_dx)
part2.rho = part2.rho + mi * wj
part2.rho_dh = part2.rho_dh - (mi * (hydro_dimension * wj + uj * wj_dx))
part2.wcount = part2.wcount + wj
part2.wcount_dh = part2.wcount_dh - (hydro_dimension * wj + uj * wj_dx)
var faci = mj * wi_dx * ir
var facj = mi * wj_dx * ir
--Compute dvdr
var dv_x = part1.core_part_space.vel_x - part2.core_part_space.vel_x
var dv_y = part1.core_part_space.vel_y - part2.core_part_space.vel_y
var dv_z = part1.core_part_space.vel_z - part2.core_part_space.vel_z
var dx_x = part1.core_part_space.pos_x - part2.core_part_space.pos_x
var dx_y = part1.core_part_space.pos_y - part2.core_part_space.pos_y
var dx_z = part1.core_part_space.pos_z - part2.core_part_space.pos_z
var dvdr = dv_x * dx_x + dv_y * dx_y + dv_z * dx_z
part1.div_v = part1.div_v - (faci * dvdr)
part2.div_v = part2.div_v - (facj * dvdr)
--Compute dv cross r
var curlvr_x = dv_y * dx_z - dv_z * dx_y
var curlvr_y = dv_z * dx_x - dv_x * dx_z
var curlvr_z = dv_x * dx_y - dv_y * dx_x
part1.rot_v_x = part1.rot_v_x + (faci * curlvr_x)
part1.rot_v_y = part1.rot_v_y + (faci * curlvr_y)
part1.rot_v_z = part1.rot_v_z + (faci * curlvr_z)
part2.rot_v_x = part2.rot_v_x + (facj * curlvr_x)
part2.rot_v_y = part2.rot_v_y + (facj * curlvr_y)
part2.rot_v_z = part2.rot_v_z + (facj * curlvr_z)
end
return kernel
end
function nonsym_force_kernel(part1, part2, r2)
local kernel = rquote
var mi = part1.core_part_space.mass
var mj = part2.core_part_space.mass
var rhoi = part1.rho
var rhoj = part2.rho
var pressurei = part1.pressure
var pressurej = part2.pressure
var ir = 1.0 / sqrt(r2)
var r = r2 * ir
--Compute kernel i
var hi_inv = 1.0 / part1.h
var hid_inv = pow_dimension_plus_one(hi_inv)
var ui = r * hi_inv
var wi : float
var wi_dx : float
eval_kernel_func(ui, &wi, &wi_dx)
var wi_dr = hid_inv * wi_dx
--Compute kernel j
var hj_inv = 1.0 / part2.h
var hjd_inv = pow_dimension_plus_one(hj_inv)
var uj = r * hj_inv
var wj : float = wj_array[0]
var wj_dx : float = wj_array[1]
eval_kernel_func(uj, &wj, &wj_dx)
var wj_dr = hjd_inv * wj_dx
--h-gradient terms
var f_i = part1.f
var f_j = part2.f
--Pressure terms
var P_over_rho2_i = pressurei / (rhoi * rhoj) * f_i
var P_over_rho2_j = pressurej / (rhoj * rhoi) * f_j
--Compute soundspeed
var ci = part1.soundspeed
var cj = part2.soundspeed
--Compute dvdr
var dv_x = part1.core_part_space.vel_x - part2.core_part_space.vel_x
var dv_y = part1.core_part_space.vel_y - part2.core_part_space.vel_y
var dv_z = part1.core_part_space.vel_z - part2.core_part_space.vel_z
var dx_x = part1.core_part_space.pos_x - part2.core_part_space.pos_x
var dx_y = part1.core_part_space.pos_y - part2.core_part_space.pos_y
var dx_z = part1.core_part_space.pos_z - part2.core_part_space.pos_z
var dvdr = dv_x * dx_x + dv_y * dx_y + dv_z * dx_z
--Get the balsara term
var balsara_i = part1.balsara
var balsara_j = part2.balsara
--Are particles moving towards each other
var omega_ij = regentlib.fmin(dvdr, 0.0)
var mu_ij = ir * omega_ij
--Compute the signal velocity
var v_sig = ci + cj - const_viscosity_beta * mu_ij
--Construct the viscosity term
var rho_ij = 0.5 * ( rhoi + rhoj)
var visc = -0.25 * v_sig * mu_ij * (balsara_i + balsara_j) / rho_ij
--Add kernel effect
var visc_term = 0.5 * visc * (wi_dr + wj_dr) * ir
var sph_term = (P_over_rho2_i * wi_dr + P_over_rho2_j * wj_dr) * ir
var acceleration = visc_term + sph_term
--Update forces
part1.accel_x = part1.accel_x - ( mj * acceleration * dx_x)
part1.accel_y = part1.accel_y - ( mj * acceleration * dx_y)
part1.accel_z = part1.accel_z - ( mj * acceleration * dx_z)
--Update the signal velocity
part1.h_dt = part1.h_dt - (mj * dvdr * ir / rhoj * wi_dr)
--Get the time derivative for the internal energy
var sph_du_term_i = P_over_rho2_i * dvdr * ir * wi_dr
--viscosity term
var visc_du_term = 0.5 * visc_term * dvdr
--Make the energy equation term
var du_dt_i = sph_du_term_i + visc_du_term
part1.u_dt = part1.u_dt + du_dt_i * mj
end
return kernel
end
function force_kernel(part1, part2, r2)
local kernel = rquote
var mi = part1.core_part_space.mass
var mj = part2.core_part_space.mass
var rhoi = part1.rho
var rhoj = part2.rho
var pressurei = part1.pressure
var pressurej = part2.pressure
var ir = 1.0 / sqrt(r2)
var r = r2 * ir
--Compute kernel i
var hi_inv = 1.0 / part1.h
var hid_inv = pow_dimension_plus_one(hi_inv)
var ui = r * hi_inv
var wi : float
var wi_dx : float
eval_kernel_func(ui, &wi, &wi_dx)
var wi_dr = hid_inv * wi_dx
--Compute kernel j
var hj_inv = 1.0 / part2.h
var hjd_inv = pow_dimension_plus_one(hj_inv)
var uj = r * hj_inv
var wj : float
var wj_dx : float
eval_kernel_func(uj, &wj, &wj_dx)
var wj_dr = hjd_inv * wj_dx
--h-gradient terms
var f_i = part1.f
var f_j = part2.f
--Pressure terms
var P_over_rho2_i = pressurei / (rhoi * rhoj) * f_i
var P_over_rho2_j = pressurej / (rhoj * rhoi) * f_j
--Compute soundspeed
var ci = part1.soundspeed
var cj = part2.soundspeed
--Compute dvdr
var dv_x = part1.core_part_space.vel_x - part2.core_part_space.vel_x
var dv_y = part1.core_part_space.vel_y - part2.core_part_space.vel_y
var dv_z = part1.core_part_space.vel_z - part2.core_part_space.vel_z
var dx_x = part1.core_part_space.pos_x - part2.core_part_space.pos_x
var dx_y = part1.core_part_space.pos_y - part2.core_part_space.pos_y
var dx_z = part1.core_part_space.pos_z - part2.core_part_space.pos_z
var dvdr = dv_x * dx_x + dv_y * dx_y + dv_z * dx_z
--Get the balsara term
var balsara_i = part1.balsara
var balsara_j = part2.balsara
--Are particles moving towards each other
var omega_ij = regentlib.fmin(dvdr, 0.0)
var mu_ij = ir * omega_ij
--Compute the signal velocity
var v_sig = ci + cj - const_viscosity_beta * mu_ij
--Construct the viscosity term
var rho_ij = 0.5 * ( rhoi + rhoj)
var visc = -0.25 * v_sig * mu_ij * (balsara_i + balsara_j) / rho_ij
--Add kernel effect
var visc_term = 0.5 * visc * (wi_dr + wj_dr) * ir
var sph_term = (P_over_rho2_i * wi_dr + P_over_rho2_j * wj_dr) * ir
var acceleration = visc_term + sph_term
--Update forces
part1.accel_x = part1.accel_x - ( mj * acceleration * dx_x)
part1.accel_y = part1.accel_y - ( mj * acceleration * dx_y)
part1.accel_z = part1.accel_z - ( mj * acceleration * dx_z)
part2.accel_x = part2.accel_x + ( mi * acceleration * dx_x)
part2.accel_y = part2.accel_y + ( mi * acceleration * dx_y)
part2.accel_z = part2.accel_z + ( mi * acceleration * dx_z)
--Update the signal velocity
part1.h_dt = part1.h_dt - (mj * dvdr * ir / rhoj * wi_dr)
part2.h_dt = part2.h_dt - (mi * dvdr * ir / rhoi * wj_dr)
--Get the time derivative for the internal energy
var sph_du_term_i = P_over_rho2_i * dvdr * ir * wi_dr
var sph_du_term_j = P_over_rho2_j * dvdr * ir * wj_dr
--viscosity term
var visc_du_term = 0.5 * visc_term * dvdr
--Make the energy equation term
var du_dt_i = sph_du_term_i + visc_du_term
var du_dt_j = sph_du_term_j+ visc_du_term
part1.u_dt = part1.u_dt + du_dt_i * mj
part2.u_dt = part2.u_dt + du_dt_j * mi
end
return kernel
end
| Rouge | 5 | stfc/RegentParticleDSL | src/interactions/MinimalSPH/interactions.rg | [
"MIT"
]
|
// Copyright © 2012-2013, Jakob Bornecrantz. All rights reserved.
// See copyright notice in src/volt/license.d (BOOST ver. 1.0).
module main;
import core.stdc.stdio;
import core.stdc.stdlib;
import watt.process;
import watt.path;
import results;
import list;
import cmd;
int main()
{
auto cmdGroup = new CmdGroup();
bool printOk = true;
bool printImprovments = true;
bool printFailing = true;
bool printRegressions = true;
string compiler = getEnv("VOLT");
if (compiler is null) {
printf("compiler envar not set\n".ptr);
return -1;
}
/// @todo Scan for files
auto tests = testList;
int total;
int passed;
int failed;
int improved;
int regressed;
auto rets = new Result[] (tests.length);
for (size_t i; i < tests.length; i++) {
rets[i] = new Result();
rets[i].runTest(cmdGroup, tests[i], compiler);
}
cmdGroup.waitAll();
for (size_t i; i < tests.length; i++) {
auto ret = rets[i];
total++;
if (ret.ok) {
passed++;
improved += cast(int)!ret.hasPassed;
if (!ret.hasPassed && printImprovments) {
printf("%s: %s, improved!\n".ptr, ret.test.ptr, ret.msg.ptr);
} else if (printOk) {
printf("%s: %s\n".ptr, ret.test.ptr, ret.msg.ptr);
}
} else {
failed++;
regressed += cast(int)ret.hasPassed;
if (ret.hasPassed && printRegressions) {
printf("%s: %s, regressed!\n".ptr, ret.test.ptr, ret.msg.ptr);
} else if (printFailing) {
printf("%s: %s\n".ptr, ret.test.ptr, ret.msg.ptr);
}
}
fflush(stdout);
}
auto xml = fopen("results.xml".ptr, "w+".ptr);
if (xml !is null) {
fprintf(xml, "<testsuites errors=\"%u\" failures=\"%u\" tests=\"%u\">\n".ptr,
regressed, failed - regressed, total);
for (size_t i; i < rets.length; i++) {
rets[i].xmlLog(xml);
}
fprintf(xml, "</testsuites>\n".ptr);
fflush(xml);
fclose(xml);
xml = null;
}
auto rate = cast(float)passed / cast(float)total * 100.f;
printf("Summary: %i tests, %i pass%s, %i failure%s, %.2f%% pass rate, %i regressions, %i improvements.\n".ptr,
total,
passed, (passed == 1 ? "".ptr : "es".ptr),
failed, (failed == 1 ? "".ptr : "s".ptr),
cast(double)rate, regressed, improved);
return regressed ? -1 : 0;
}
| Volt | 4 | JavascriptID/sourcerer-app | src/test/resources/samples/langs/Volt/tesla.volt | [
"MIT"
]
|
describe "lapis.http", ->
local location, options
before_each ->
stack = require "lapis.spec.stack"
stack.push {
HTTP_GET: 1
HTTP_POST: 2
HTTP_PUT: 2
location: {
capture: (_location, _options) ->
location = _location
options = _options
{}
}
}
after_each ->
stack = require "lapis.spec.stack"
stack.pop!
describe "simple", ->
local simple
before_each ->
simple = require("lapis.http").simple
it "should call with string", ->
simple "http://leafo.net"
assert.same "/proxy", location
assert.same {
method: ngx.HTTP_GET
ctx: {}
vars: {
_url: "http://leafo.net/"
}
}, options
it "should call table", ->
simple {
url: "http://leafo.net/lapis"
}
assert.same "/proxy", location
assert.same {
method: ngx.HTTP_GET
ctx: {}
vars: {
_url: "http://leafo.net/lapis"
}
}, options
it "should call with body", ->
simple "http://leafo.net", "gold coins"
assert.same "/proxy", location
assert.same {
method: ngx.HTTP_POST
body: "gold coins"
ctx: {}
vars: {
_url: "http://leafo.net/"
}
}, options
it "should encode form", ->
simple "http://leafo.net/lapis", {
color: "blue's"
}
assert.same "/proxy", location
assert.same {
method: ngx.HTTP_POST
body: "color=blue%27s"
ctx: {
headers: {
"Content-type": "application/x-www-form-urlencoded"
}
}
vars: {
_url: "http://leafo.net/lapis"
}
}, options
it "should set method and body", ->
simple {
url: "http://leafo.net/lapis"
method: "PUT"
body: "yeah"
}
assert.same "/proxy", location
assert.same {
method: ngx.HTTP_PUT
body: "yeah"
ctx: { }
vars: { _url: "http://leafo.net/lapis" }
}, options
describe "request", ->
local request
before_each ->
request = require("lapis.http").request
it "should call with string", ->
request "http://leafo.net"
assert.same "/proxy", location
assert.same {
method: ngx.HTTP_GET
ctx: {}
vars: {
_url: "http://leafo.net/"
}
}, options
| MoonScript | 4 | tommy-mor/lapis | spec/http_spec.moon | [
"MIT",
"Unlicense"
]
|
--TEST--
Bug #79951: Memory leak in str_replace of empty string
--FILE--
<?php
var_dump(str_replace([""], [1000], "foo"));
?>
--EXPECT--
string(3) "foo"
| PHP | 3 | NathanFreeman/php-src | ext/standard/tests/strings/bug79951.phpt | [
"PHP-3.01"
]
|
<div class="col-sm-12 form-section-title">
Provider
</div>
<box-selector ng-model="$ctrl.value" options="$ctrl.options" on-change="($ctrl.onChange)" radio-name="oauth_provider"></box-selector>
| HTML | 2 | kazukitakamatsu/portainer | app/portainer/oauth/components/oauth-providers-selector/oauth-providers-selector.html | [
"Zlib"
]
|
# This file is part of NIT ( http://www.nitlanguage.org ).
#
# Copyright 2013 Matthieu Lucas <[email protected]>
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
# This sample has been implemented to show you how simple is it to play
# with native callbacks (C) through an high level with NIT program.
module callback_monkey
in "C header" `{
#include <stdio.h>
#include <stdlib.h>
typedef struct {
int id;
int age;
} CMonkey;
typedef struct {
MonkeyActionCallable toCall;
Object message;
} MonkeyAction;
`}
in "C body" `{
// Method which reproduce a callback answer
// Please note that a function pointer is only used to reproduce the callback
void cbMonkey(CMonkey *mkey, void callbackFunc(CMonkey*, MonkeyAction*), MonkeyAction *data)
{
sleep(2);
callbackFunc( mkey, data );
}
// Back of background treatment, will be redirected to callback function
void nit_monkey_callback_func( CMonkey *mkey, MonkeyAction *data )
{
// To call a your method, the signature must be written like this :
// <Interface Name>_<Method>...
MonkeyActionCallable_wokeUp( data->toCall, mkey, data->message );
}
`}
# Implementable interface to get callback in defined methods
interface MonkeyActionCallable
fun wokeUp( sender:Monkey, message: Object) is abstract
end
# Defining my object type Monkey, which is, in a low level, a pointer to a C struct (CMonkey)
extern class Monkey `{ CMonkey * `}
new `{
CMonkey *monkey = malloc( sizeof(CMonkey) );
monkey->age = 10;
monkey->id = 1;
return monkey;
`}
# Object method which will get a callback in wokeUp method, defined in MonkeyActionCallable interface
# Must be defined as Nit/C method because of C call inside
fun wokeUpAction( toCall: MonkeyActionCallable, message: Object ) is extern import MonkeyActionCallable.wokeUp `{
// Allocating memory to keep reference of received parameters :
// - Object receiver
// - Message
MonkeyAction *data = malloc( sizeof(MonkeyAction) );
// Incrementing reference counter to prevent from releasing
MonkeyActionCallable_incr_ref( toCall );
Object_incr_ref( message );
data->toCall = toCall;
data->message = message;
// Calling method which reproduce a callback by passing :
// - Receiver
// - Function pointer to object return method
// - Datas
cbMonkey( recv, &nit_monkey_callback_func, data );
`}
end
| Nit | 5 | JavascriptID/sourcerer-app | src/test/resources/samples/langs/Nit/callback_monkey.nit | [
"MIT"
]
|
--TEST--
Bug #38464 (array_count_values() mishandles numeric strings)
--FILE--
<?php
$array = array('-000', ' 001', 1, ' 123', '+123');
var_dump(array_count_values($array));
?>
--EXPECT--
array(5) {
["-000"]=>
int(1)
[" 001"]=>
int(1)
[1]=>
int(1)
[" 123"]=>
int(1)
["+123"]=>
int(1)
}
| PHP | 3 | thiagooak/php-src | ext/standard/tests/array/bug38464.phpt | [
"PHP-3.01"
]
|
//
// Example code - use without restriction.
//
IMPORT $;
MyRec := RECORD
STRING1 value1;
STRING1 value2;
END;
D := DATASET([{'A','B'},
{'B','C'},
{'A','D'},
{'B','B'},
{'A','C'},
{'B','D'},
{'A','B'},
{'C','C'},
{'C','D'},
{'A','A'}],MyRec);
$.DeclareData.MAC_CountFieldValues(D,Value1)
$.DeclareData.MAC_CountFieldValues(D,Value2)
| ECL | 3 | miguelvazq/HPCC-Platform | docs/ECLProgrammersGuide/PRG_Mods/ECL Code Files/RunText.ecl | [
"Apache-2.0"
]
|
#############################################################################
##
## PackageInfo.g for the package `cvec' Max Neunhoeffer
##
## (created from Frank Lübeck's PackageInfo.g template file)
##
SetPackageInfo( rec(
PackageName := "cvec",
Subtitle := "Compact vectors over finite fields",
Version := "2.5.1",
Date := "04/04/2014", # dd/mm/yyyy format
## Information about authors and maintainers.
Persons := [
rec(
LastName := "Neunhoeffer",
FirstNames := "Max",
IsAuthor := true,
IsMaintainer := false,
Email := "[email protected]",
WWWHome := "http://www-groups.mcs.st-and.ac.uk/~neunhoef/",
PostalAddress := Concatenation( [
"School of Mathematics and Statistics\n",
"University of St Andrews\n",
"Mathematical Institute\n",
"North Haugh\n",
"St Andrews, Fife KY16 9SS\n",
"Scotland, UK" ] ),
Place := "St Andrews",
Institution := "University of St Andrews"
),
],
## Status information. Currently the following cases are recognized:
## "accepted" for successfully refereed packages
## "deposited" for packages for which the GAP developers agreed
## to distribute them with the core GAP system
## "dev" for development versions of packages
## "other" for all other packages
##
# Status := "accepted",
Status := "deposited",
## You must provide the next two entries if and only if the status is
## "accepted" because is was successfully refereed:
# format: 'name (place)'
# CommunicatedBy := "Mike Atkinson (St. Andrews)",
#CommunicatedBy := "",
# format: mm/yyyy
# AcceptDate := "08/1999",
#AcceptDate := "",
PackageWWWHome := "http://neunhoef.github.io/cvec/",
README_URL := Concatenation(~.PackageWWWHome, "README"),
PackageInfoURL := Concatenation(~.PackageWWWHome, "PackageInfo.g"),
ArchiveURL := Concatenation("https://github.com/neunhoef/cvec/",
"releases/download/v", ~.Version,
"/cvec-", ~.Version),
ArchiveFormats := ".tar.gz .tar.bz2",
## Here you must provide a short abstract explaining the package content
## in HTML format (used on the package overview Web page) and an URL
## for a Webpage with more detailed information about the package
## (not more than a few lines, less is ok):
## Please, use '<span class="pkgname">GAP</span>' and
## '<span class="pkgname">MyPKG</span>' for specifing package names.
##
AbstractHTML :=
"This package provides an implementation of compact vectors over finite\
fields. Contrary to earlier implementations no table lookups are used\
but only word-based processor arithmetic. This allows for bigger finite\
fields and higher speed.",
PackageDoc := rec(
BookName := "cvec",
ArchiveURLSubset := ["doc"],
HTMLStart := "doc/chap0.html",
PDFFile := "doc/manual.pdf",
SixFile := "doc/manual.six",
LongTitle := "Compact vectors over finite fields",
),
Dependencies := rec(
GAP := ">=4.5.5",
NeededOtherPackages := [
["GAPDoc", ">= 1.2"],
["IO", ">= 4.1"],
["orb", ">= 4.2"],
],
SuggestedOtherPackages := [],
ExternalConditions := []
),
AvailabilityTest := function()
if not "cvec" in SHOW_STAT() and
Filename(DirectoriesPackagePrograms("cvec"), "cvec.so") = fail then
#Info(InfoWarning, 1, "cvec: kernel cvec functions not available.");
return fail;
fi;
return true;
end,
## *Optional*, but recommended: path relative to package root to a file which
## contains as many tests of the package functionality as sensible.
#TestFile := "tst/testall.g",
## *Optional*: Here you can list some keyword related to the topic
## of the package.
Keywords := []
));
| G-code | 4 | JavascriptID/sourcerer-app | src/test/resources/samples/langs/GAP/PackageInfo.g | [
"MIT"
]
|
// EMIT_MIR reify_fn_ptr.main.ConstProp.diff
fn main() {
let _ = main as usize as *const fn();
}
| Rust | 2 | Eric-Arellano/rust | src/test/mir-opt/const_prop/reify_fn_ptr.rs | [
"ECL-2.0",
"Apache-2.0",
"MIT-0",
"MIT"
]
|
export default /* glsl */`
#ifndef FLAT_SHADED // normal is computed with derivatives when FLAT_SHADED
vNormal = normalize( transformedNormal );
#ifdef USE_TANGENT
vTangent = normalize( transformedTangent );
vBitangent = normalize( cross( vNormal, vTangent ) * tangent.w );
#endif
#endif
`;
| JavaScript | 3 | brunnacroches/portifolio-brunna | node_modules/three/src/renderers/shaders/ShaderChunk/normal_vertex.glsl.js | [
"Unlicense"
]
|
*** Setting ***
Library ZipLib
*** Test Case ***
Python Library From a Zip File
${ret} = Kw From Zip ${4}
Should Be Equal ${ret} ${8}
| RobotFramework | 3 | rdagum/robotframework | atest/testdata/test_libraries/library_import_from_archive.robot | [
"ECL-2.0",
"Apache-2.0"
]
|
Lemma transparent_plus_zero: forall n, n + O = n.
intros n; induction n.
- reflexivity.
- simpl; rewrite IHn; trivial.
Defined.
Lemma transparent_plus_S: forall n m, n + S m = S n + m .
intros n; induction n; intros m.
- reflexivity.
- simpl; f_equal; rewrite IHn; reflexivity.
Defined.
| Coq | 4 | LaudateCorpus1/RosettaCodeData | Task/Variadic-function/Coq/variadic-function-6.coq | [
"Info-ZIP"
]
|
/*
This is a very simple test/demo program for librclone's C interface
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <dlfcn.h>
#include "librclone.h"
void testRPC(char *method, char *in) {
struct RcloneRPCResult out = RcloneRPC(method, in);
printf("status: %d\n", out.Status);
printf("output: %s\n", out.Output);
free(out.Output);
}
// noop command
void testNoOp() {
printf("test rc/noop\n");
struct RcloneRPCResult out = RcloneRPC("rc/noop", "{"
" \"p1\": [1,\"2\",null,4],"
" \"p2\": { \"a\":1, \"b\":2 } "
"}");
printf("status: %d\n", out.Status);
printf("output: %s\n", out.Output);
const char *expected =
"{\n"
"\t\"p1\": [\n"
"\t\t1,\n"
"\t\t\"2\",\n"
"\t\tnull,\n"
"\t\t4\n"
"\t],\n"
"\t\"p2\": {\n"
"\t\t\"a\": 1,\n"
"\t\t\"b\": 2\n"
"\t}\n"
"}\n";
if (strcmp(expected, out.Output) != 0) {
fprintf(stderr, "Wrong output.\nWant:\n%s\nGot:\n%s\n", expected, out.Output);
exit(EXIT_FAILURE);
}
if (out.Status != 200) {
fprintf(stderr, "Wrong status: want: %d: got: %d\n", 200, out.Status);
exit(EXIT_FAILURE);
}
free(out.Output);
}
// error command
void testError() {
printf("test rc/error\n");
struct RcloneRPCResult out = RcloneRPC("rc/error",
"{"
" \"p1\": [1,\"2\",null,4],"
" \"p2\": { \"a\":1, \"b\":2 } "
"}");
printf("status: %d\n", out.Status);
printf("output: %s\n", out.Output);
const char *expected =
"{\n"
"\t\"error\": \"arbitrary error on input map[p1:[1 2 \\u003cnil\\u003e 4] p2:map[a:1 b:2]]\",\n"
"\t\"input\": {\n"
"\t\t\"p1\": [\n"
"\t\t\t1,\n"
"\t\t\t\"2\",\n"
"\t\t\tnull,\n"
"\t\t\t4\n"
"\t\t],\n"
"\t\t\"p2\": {\n"
"\t\t\t\"a\": 1,\n"
"\t\t\t\"b\": 2\n"
"\t\t}\n"
"\t},\n"
"\t\"path\": \"rc/error\",\n"
"\t\"status\": 500\n"
"}\n";
if (strcmp(expected, out.Output) != 0) {
fprintf(stderr, "Wrong output.\nWant:\n%s\nGot:\n%s\n", expected, out.Output);
exit(EXIT_FAILURE);
}
if (out.Status != 500) {
fprintf(stderr, "Wrong status: want: %d: got: %d\n", 500, out.Status);
exit(EXIT_FAILURE);
}
free(out.Output);
}
// copy file using "operations/copyfile" command
void testCopyFile() {
printf("test operations/copyfile\n");
testRPC("operations/copyfile",
"{"
"\"srcFs\": \"/tmp\","
"\"srcRemote\": \"tmpfile\","
"\"dstFs\": \"/tmp\","
"\"dstRemote\": \"tmpfile2\""
"}");
}
// list the remotes
void testListRemotes() {
printf("test operations/listremotes\n");
testRPC("config/listremotes", "{}");
}
int main(int argc, char** argv) {
printf("c main begin\n");
RcloneInitialize();
testNoOp();
testError();
/* testCopyFile(); */
/* testListRemotes(); */
RcloneFinalize();
return EXIT_SUCCESS;
}
| C | 4 | database64128/rclone | librclone/ctest/ctest.c | [
"MIT"
]
|
= Dell XPS 13 9370 =
== Battery drain when sleeping ==
The laptop uses the S2 sleep mode by default instead of S3, which leads to
draining a lot of battery during sleep.
Though this is intentional by the manufacturer and might cause lockups when
forced I - @moredread - never had any issues with it.
See https://wiki.archlinux.org/index.php/Dell_XPS_13_(9370)#Power_Management
and https://bugzilla.kernel.org/show_bug.cgi?id=199689#c3 for reference
== Additional resources ==
* Arch linux wiki: [https://wiki.archlinux.org/index.php/Dell_XPS_13_(9370) Dell XPS 13 9370]
| MediaWiki | 0 | pmeiyu/nixos-hardware | dell/xps/13-9370/README.wiki | [
"CC0-1.0"
]
|
module.exports (terms) =
continuation or default () =
terms.module constants.define ['continuation', 'or', 'default'] as (
terms.javascript "function(args){var c=args[args.length-1];if(typeof c === 'function'){return {continuation: c, arguments: Array.prototype.slice.call(args, 0, args.length - 1)};}else{return { continuation: function(error, result) { if (error) { throw error; } else { return result; } }, arguments: args }}}"
)
| PogoScript | 2 | Sotrek/Alexa | Alexa_Cookbook/Workshop/StatePop/4_IOT/tests/node_modules/aws-sdk/node_modules/cucumber/node_modules/pogo/lib/terms/continuationOrDefault.pogo | [
"MIT"
]
|
// build-pass
#![feature(generic_const_exprs)]
#![allow(incomplete_features)]
pub trait Target {
const LENGTH: usize;
}
pub struct Container<T: Target>
where
[(); T::LENGTH]: Sized,
{
_target: T,
}
impl<T: Target> Container<T>
where
[(); T::LENGTH]: Sized,
{
pub fn start(
_target: T,
) -> Container<T> {
Container { _target }
}
}
fn main() {}
| Rust | 3 | ohno418/rust | src/test/ui/const-generics/issues/issue-87964.rs | [
"ECL-2.0",
"Apache-2.0",
"MIT-0",
"MIT"
]
|
DROP TABLE "public"."table50";
| SQL | 0 | eazyfin/graphql-engine | cli/commands/testdata/migrate-squash-test/migrations/1588172670820_create_table_public_table50/down.sql | [
"Apache-2.0",
"MIT"
]
|
<html>
<body>
<script type="text/javascript" charset="utf-8">
const {ipcRenderer} = require('electron')
let echo
let requireError
try {
echo = require('echo')
} catch (error) {
requireError = error
}
if (requireError != null) {
ipcRenderer.send('answer', `Require echo failed: ${requireError.message}`)
} else {
ipcRenderer.send('answer', typeof echo)
}
</script>
</body>
</html>
| HTML | 3 | lingxiao-Zhu/electron | spec-main/fixtures/api/native-window-open-native-addon.html | [
"MIT"
]
|
<% fn 1 -> %>b<% end %>
| HTML+EEX | 0 | keyno63/intellij-elixir | testData/org/elixir_lang/eex/psi/parser/test/Fn1Clause.eex | [
"Apache-2.0"
]
|
# Copyright (C) 2006-2009, Parrot Foundation.
=head1 NAME
Branch
=head1 DESCRIPTION
A sample branch node for Language::AtributeGrammar.
=cut
.namespace [ "Branch" ]
.sub "__onload" :load
.local pmc base
newclass base, "Branch"
addattribute base, "left" # left child
addattribute base, "right" # right child
.return ()
.end
# Local Variables:
# mode: pir
# fill-column: 100
# End:
# vim: expandtab shiftwidth=4 ft=pir:
| Parrot Internal Representation | 4 | winnit-myself/Wifie | examples/tge/branch/lib/Branch.pir | [
"Artistic-2.0"
]
|
{
"@context": {
"@vocab": "http://example.com/",
"@version": 1.1,
"@protected": true,
"@import": "so07-context.jsonld"
},
"protected1": {
"@context": {
"protected1": "http://example.com/something-else",
"protected2": "http://example.com/something-else"
},
"protected1": "error / property http://example.com/protected1",
"protected2": "error / property http://example.com/protected2"
}
}
| JSONLD | 1 | donbowman/rdflib | test/jsonld/1.1/toRdf/so07-in.jsonld | [
"BSD-3-Clause"
]
|
from typing import AsyncGenerator, Generator
import pytest
from fastapi import Depends, FastAPI
from fastapi.testclient import TestClient
app = FastAPI()
class CallableDependency:
def __call__(self, value: str) -> str:
return value
class CallableGenDependency:
def __call__(self, value: str) -> Generator[str, None, None]:
yield value
class AsyncCallableDependency:
async def __call__(self, value: str) -> str:
return value
class AsyncCallableGenDependency:
async def __call__(self, value: str) -> AsyncGenerator[str, None]:
yield value
class MethodsDependency:
def synchronous(self, value: str) -> str:
return value
async def asynchronous(self, value: str) -> str:
return value
def synchronous_gen(self, value: str) -> Generator[str, None, None]:
yield value
async def asynchronous_gen(self, value: str) -> AsyncGenerator[str, None]:
yield value
callable_dependency = CallableDependency()
callable_gen_dependency = CallableGenDependency()
async_callable_dependency = AsyncCallableDependency()
async_callable_gen_dependency = AsyncCallableGenDependency()
methods_dependency = MethodsDependency()
@app.get("/callable-dependency")
async def get_callable_dependency(value: str = Depends(callable_dependency)):
return value
@app.get("/callable-gen-dependency")
async def get_callable_gen_dependency(value: str = Depends(callable_gen_dependency)):
return value
@app.get("/async-callable-dependency")
async def get_async_callable_dependency(
value: str = Depends(async_callable_dependency),
):
return value
@app.get("/async-callable-gen-dependency")
async def get_async_callable_gen_dependency(
value: str = Depends(async_callable_gen_dependency),
):
return value
@app.get("/synchronous-method-dependency")
async def get_synchronous_method_dependency(
value: str = Depends(methods_dependency.synchronous),
):
return value
@app.get("/synchronous-method-gen-dependency")
async def get_synchronous_method_gen_dependency(
value: str = Depends(methods_dependency.synchronous_gen),
):
return value
@app.get("/asynchronous-method-dependency")
async def get_asynchronous_method_dependency(
value: str = Depends(methods_dependency.asynchronous),
):
return value
@app.get("/asynchronous-method-gen-dependency")
async def get_asynchronous_method_gen_dependency(
value: str = Depends(methods_dependency.asynchronous_gen),
):
return value
client = TestClient(app)
@pytest.mark.parametrize(
"route,value",
[
("/callable-dependency", "callable-dependency"),
("/callable-gen-dependency", "callable-gen-dependency"),
("/async-callable-dependency", "async-callable-dependency"),
("/async-callable-gen-dependency", "async-callable-gen-dependency"),
("/synchronous-method-dependency", "synchronous-method-dependency"),
("/synchronous-method-gen-dependency", "synchronous-method-gen-dependency"),
("/asynchronous-method-dependency", "asynchronous-method-dependency"),
("/asynchronous-method-gen-dependency", "asynchronous-method-gen-dependency"),
],
)
def test_class_dependency(route, value):
response = client.get(route, params={"value": value})
assert response.status_code == 200, response.text
assert response.json() == value
| Python | 5 | Aryabhata-Rootspring/fastapi | tests/test_dependency_class.py | [
"MIT"
]
|
module utils;
version (Windows)
enum dllExt = "dll";
else
enum dllExt = "so";
void loadSym(T)(void* handle, ref T val, const char* mangle)
{
version (Windows)
{
import core.sys.windows.winbase : GetProcAddress;
val = cast(T) GetProcAddress(handle, mangle);
}
else
{
import core.sys.posix.dlfcn : dlsym;
val = cast(T) dlsym(handle, mangle);
}
}
| D | 4 | lewis-revill/druntime | test/shared/src/utils.di | [
"BSL-1.0"
]
|
// run-pass
#![allow(dead_code)]
#![allow(stable_features)]
#![feature(issue_5723_bootstrap)]
trait Foo {
fn dummy(&self) { }
}
fn foo<'a, 'b, 'c:'a+'b, 'd>() {
}
pub fn main() { }
| Rust | 3 | Eric-Arellano/rust | src/test/ui/regions/regions-bound-lists-feature-gate-2.rs | [
"ECL-2.0",
"Apache-2.0",
"MIT-0",
"MIT"
]
|
<pre>
DEF: 1
Titel: Det sociala smarta kontraktet
Författare: @DemocracyEarth.
Kommentarer-Sammanfattning: Inga kommentarer än.
Status: Aktiv
Typ: Papper
Skapad: 2017-07-14
Licens: MIT
Ersätter: 0
</pre>
=Det smarta sociala kontraktet.=
Erbjudandets initiala rättigheter är från [http://democracy.earth Democracy Earth Foundation].
==i. Abstrakt.==
I en värld som lyckats med globaliseringen av finansiella tillgångar, samtidigt som de politiska rättigheterna bifogas territorier, måste vi bygga nya modeller för demokratisk styrning som gör det möjligt för mänskligheten att samarbeta och ta itu med pressande globala frågor. Democracy Earth Foundation bygger gratis, öppen källkodsprogramvara för oförstörbart blockchain-baserat beslutsfattande (omröstning) inom institutioner av alla storlekar, från de mest lokala som involverar två personer till de mest globala som involverar oss alla. Ojämn fördelning av möjligheter runt om i världen på grund av den eviga konfrontationen mellan nationella regeringar har lett till snabbare klimatförändringar, ökande ojämlikhet, terrorism och tvångsflyttningar. Demokrati Earth Foundation anser att den teknikstack som innehåller Bitcoin som programmerbara pengar utan centralbanker och Ethereum som möjliggör smarta avtal utan att det behövs domstolar för domstolar kräver ett nytt lager som signalerar oförstörda röster bortom landstaternas territoriella gränser. Detta transnationella nätverk kommer att handla i enlighet med medlemmarnas personliga suveränitet och skydda sina mänskliga rättigheter med kryptering. I vårt Initial Rights Offering erbjuder vi en token som heter '' röst '' som ger deltagande rättigheter till varje människa med beslutsfattande som huvudfunktion. Vårt förslag introducerar kryptografiskt inducerad jämlikhet: så länge som någon kan validera sin självständiga identitet, kommer de att få en motsvarande andel av "röster" som motsvarar andelen av varje aktiv deltagare i nätverket. Vi definierar en "bevisa sin identitet" -process som undviker central auktoritet genom att införa begreppet "uppmanar uppmärksamhet" vilket stimulerar deltagarna att stärka förtroendet för "röst" genom att utföra enkla test som syftar till att upptäcka kopior. Slutligen dras "röster" till giltiga deltagare under en "Universell grundinkomst" -mekanism med målet att hitta en rättjämvikt i den historiska spänningen mellan pengar och politik. Vi söker ingenting mindre än äkta demokratisk styrning för Internetåldern, en av de grundläggande byggstenarna av en uppnå global fred och välstånd som uppstår genom en båge av tekniska innovationer som kommer att förändra vad det innebär att vara mänsklig på jorden.
==ii. Innehåll.==
Denna text är uppbyggd i tre delar, var och en syftar till att tillgodose ett annat läsemål (och som alla kan utgöras av en och samma person.)
* [[#Manifest|Manifest]]: För idealister. Diagnoserar globalt politiskt sammanhang och argumenterar för en paradigmförändring.
* [[#Papper|Papper]]: För byggare. Beskriver byggstenarna för ett system som kan implementeras av någon, var som helst.
* [[#Utförande|Utförande]]: För pragmatister. Anger hur man utför dessa idéer för få genomslag.
Vi har inte för avsikt att denna text förbli fast. Den publiceras under en öppen källkod och vi välkomnar bidrag från någon, eftersom vårt mål är att detta dokument ska vara en levande färdplan för planetstyrning. Demokrati som förmågan att lita på varandra i största möjliga utsträckning är en avgörande kraft som bildar historiens banor. Vårt uppdrag ekar brådskande över hela världen, som omfattar hela mänskligheten: behovet av att göra vårt gemensamma hem en plats för fredlig samexistens. [http://democracy.earth Democracy Earth Foundation] har genomfört [[#Background|omfattande forskning]] på röstsystem, cyberpolitics och blockchain-nätverk; vi står i spetsen för en offentlig konversation angående internet som en planetarisk jurisdiktion.
Genom [https://twitter.com/lsukernik/status/892101885771034628 exempel från Satoshi Nakamoto], Innan vi delar våra idéer i skriftlig form har vi åtagit sig att skriva kod först för att kunna förstå vad som kan göras. För detta ändamål, mer än [https://github.com/DemocracyEarth/sovereign 30,000 rader kod har skrivits sedan oktober 2015], som i sin tur drivit vår forskning, använder fall och de idéer som presenteras här. Detta är vårt förslag.
<div id="Background"></div>
==iii. Bakgrund.==
Vi har banat väg för digital demokrati och författat några av de mest framstående demokratiska programmen med öppen källkod [https://github.com/search?utf8=%E2%9C%93&q=topic%3Ademocracy&type=Repositories as ranked by the GitHub community] inklusive den ursprungliga utformningen av [https://www.youtube.com/watch?v=qNCgfd7dNb0 DemocracyOS],ett enkelt direktdemokratiprojekt som vi skapade under 2012. Vi grundade det första digitala politiska partiet i Amerika, USA [http://partidodelared.org Partido de la Red] (Peers Party) som ställde upp i sitt första val i staden [http://www.wired.co.uk/article/e-voting Buenos Aires in 2013]. Under 2014 delade vi vår erfarenhet i [https://www.ted.com/talks/pia_mancini_how_to_upgrade_democracy_for_the_internet_era TED] Talks nå över 1,2 miljoner tittare. Under 2015 och 2016, Silicon Valley's [http://ycombinator.com Y Combinator] och [http://ffwd.org Fast Forward] finansierade våra ansträngningar att starta [http://democracy.earth Democracy Earth Foundation], en ideell organisation som är engagerad i uppdraget att gränslös styrning.
Vår erfarenhet av att kombinera både de politiska och tekniska utmaningarna av demokratin ledde oss att tänka och designa kring begreppet hur vi skulle kunna bygga ett politiskt parti med smarta avtal, eller snarare en lätt styrelseform som alla kan genomföra till låg kostnad. Vi började utvecklingen av [http://sovereign.software Sovereign], a '''''blockchain liquid democracy''''' som möjliggör direkt omröstning om frågor samt möjligheten att delegera röststyrka på specifika ämnen till kamrater över ett säkert nätverk utan central myndighet. Genom att fungera med symboler som signaleras i blockchain blir alla röster censurbeständiga och omedelbara revisionsrättigheter kan beviljas varje väljare utan att behöva ge tillgång till servrar eller privat infrastruktur, vilket gör systemet öppet och öppet för alla. Vårt arbete drivs av öppen källkodsutveckling och samarbetar med nyckelprojekt som syftar till att säkerställa identitet i decentraliserade miljöer, inklusive insatser från [https://blockstack.org/blockstack_usenix16.pdf Blockstack], [http://civic.com Civic] och [https://whitepaper.uport.me/uPort_whitepaper_DRAFT20170221.pdf Consensys] bland andra.
[[File:/images/sovereign.png|Sovereign.]]
[https://github.com/DemocracyEarth/sovereign Sovereign's codebase] levererar en anpassningsbar mobil och stationär applikation till väljare och organisationer som standardiserar oförstörbart beslutsfattande i en blockchainbaserad demokrati. Vårt mål är att fortsätta bana väg för implementeringar som möjliggör [https://www.usenix.org/legacy/event/sec08/tech/full_papers/adida/adida.pdf cryptographic open-audit voting] och integrera vår programvara med blockkedjor som kan garantera användarnas suveräna rättigheter.
----
<div id="Manifesto"></div>
==1. Manifest.==
<blockquote>
Demokrati är alltid ett pågående arbete, det är aldrig en absolut idé eller det skulle annars vara en totalitär ideologi, precis som resten av dem.
</blockquote>
'''[https://en.wikipedia.org/wiki/Jos%C3%A9_Mujica José Mujica]''', President i Uruguay (2010–2015).
Nuvarande demokratiska system som styr samhällen inom nationernas territoriella domän har blivit stillastående när det gäller deltagande och leder till ökad polarisering. Valkretsar är försedda med skräddarsydda medier som uppfyller sina egna endogamiska övertygelser, drar samhället från varandra eftersom diskurs och faktuell debatt ersätts med en [https://www.wikiwand.com/en/Post-truth_politics post-truth] attityd. Det här är en följd av den drastiska expansionen i kommunikationskanaler, åtföljd av ständigt uppmärksamma spänningar och en genomtänkt analys. Centraliserad informationsdistribution från 20-talet skapade enhetliga berättelser, realiteter och identiteter. Internet har brutit dem. Instanser av politiskt deltagande i de så kallade moderna demokratierna är inte lämpliga för information rikliga sammanhang och har varit oförändrade sedan starten.
[[File:/images/bipartisan-votes-us-congress.png|Bipartisan votes in the U.S. House of Representatives since 1981, source: The Rise of Partisanship (2015).]]
Engagemanget genom de traditionella kanalerna är svagare bland yngre generationer, [http://www.economist.com/news/essays/21596796-democracy-was-most-successful-political-idea-20th-century-why-has-it-run-trouble-and-what-can-be-do often not going out to vote and unlikely to engage in party politics]. Samtidigt ökar onlineaktivismen med sociala medier som blir dominerande arena för politiska konflikter. Detta inkluderar Facebook och Twitter (där skvaller sprids övervägande ''falska nyheter'', ''bots'' and ''trolling'' bland annat kampanjoptimeringar) och framväxande ekokamrar som [http://www.4chan.org/ 4chan.org] där anonymitet ledde till politisk oriktighet eller [https://gab.ai/ gab.ai] konsoliderande av ''alt-right'' gemenskapen i USA. Naturligtvis gör endogamin bara polarisering starkare, och våra tribaliserade samhällen har visat en tendens att fortsätta relativiserande sanning [https://www.nytimes.com/2017/06/01/climate/trump-paris-climate-agreement.html risking the preservation of resources] och överlevnad av kommande generationer.
Demokratiska processer som ses under högstatsval är ofta benägna att bedrägligt beteende med [https://en.wikipedia.org/wiki/Gerrymandering ''gerrymandering''] bli vanligt och en stark koppling mellan vad [https://www.ineteconomics.org/uploads/papers/WP_48_Ferguson_et_al.pdf major political parties spend and the percentage of votes they win]. I utvecklingsländerna tas rösterna bort, brutna och till och med brända av stora partier i hopp om att undertrycka chanserna för mindre konkurrenter.
I det här dokumentet föreslås en lösning som tar itu med både de politiska och tekniska frågorna som försvagar utsikterna för demokrati i världen genom att erbjuda ett alternativ som kan antas direkt av medborgarna och genomföras med hjälp av peer to peer-nätverk. Eftersom internet blir den dominerande kraften i modern politik ser vi ett oumbärligt behov av att utveckla digitalteknik för röstning som kan användas säkert på alla geografiska platser och för samhällen av alla storlekar.
Med internet tillväxt [http://www.bbc.com/news/technology-32884867 nås över 3 miljarder liv] (långt överträffande större religioner och nationer) och utvecklingen av krypterade nätverk som kallas blockkedjor som tillåter oförgängliga transaktioner med tillståndslösa revisioner, finns det ingen anledning att stoppa mänskligheten från att bygga en gränslös commons som kan hjälpa till att forma nästa utvecklingssteg för demokratisk styrning i vilken skala som helst . Även i områden där internetpenetration ligger under 50%, är det digitala gapet inte baserat på socioekonomiska faktorer men det är snarare en generationsdelning. Enligt Rick Falkvinge, grundare av [https://en.wikipedia.org/wiki/Pirate_Party Pirate Party]: “Politiken rör sig vid glacial hastighet: ingenting verkar hända tills plötsligt ett ansträngande ljud får allas uppmärksamhet. Det är långsamt eftersom det ofta tar en generation att dö för nästa att ta över. Och idag lever vi i en värld som har ''offline generation'' ansvarig och ''online generation'' växer upp”.
[[File:/images/age internet.png|Den digitala klyftan är generations mer än socioekonomisk, källa: Pew Internet & American Life Project Surveys April 2000-April 2012.]]
Nya förvaltningsformer måste erkänna den nätverksbaserade förbund som förbinder mänskligheten och gradvis försvaga arv av nationella gränser och dess inneboende oförmåga att hantera pressande globala frågor som klimatförändringar, ökande ojämlikhet, terrorism, automatisering och tvångsflyttningar. Ojämn fördelning av möjligheter runt om i världen på grund av den ständiga konfrontationen mellan de nationella regeringarna ledde till att dessa frågor stod på den globala agendan. Vi tror på den tekniska stacken som inkluderar [http://bitcoin.com/bitcoin.pdf Bitcoin] as programmable money without Central Banks and [http://ethdocs.org/en/latest/index.html Ethereum] Att möjliggöra smarta avtal utan behov av domstolar för domstolar kräver ett nytt lag som signalerar oförstörda röster bortom nationernas gränser. Detta transnationella nätverk kommer att handla i enlighet med medlemmarnas personliga suveränitet och skydda sina mänskliga rättigheter med kryptering.
===1.1 Arv.===
Vi kan överväga val som genomförs av stater, provinser och stadskommuner som demokratier inom vilka vi är reducerade till att vara passiva mottagare av en monolog. Medborgarna kallas in mellan väsentligen långa perioder, under valet, för att ge en grundläggande inmatning: accepterar eller avvisar aktörer i samma system. Detta är bandbredd för arvsystemet som är våra så kallade "moderna demokratier". Under dessa system kan mindre än en procent av befolkningen rösta om lagstiftning eller genomföra budgetar medan resten är lagligt tvungna att lägga ut sina fulla medborgarskapsrättigheter till en företrädande minoritet som så småningom räknar ut hur det förhåller sig.
Tekniken bakom representativa demokratier kan grupperas i två uppsättningar:
* '''Analoga val''': vanligtvis pappersval och röstlådor med myndigheter ansvariga för räkning av röster och rapportering av bedrägligt beteende. Trots att dessa system är stabila i utvecklade länder, drabbas de av allvarlig bristande deltagande. Barriärer implementeras med krav som att registrera sig för att rösta genom en alltför byråkratisk process som slutar blockera en majoritet av disenfranchised väljare. Myndigheterna ger också distrikten genom att utnyttja undersökningsdata i väntan på valresultat. Trots att dessa system är enklare att granska, innebär det också att de är lättare att korrumpera: i utvecklingsländernas "analoga val" "får de avlägsnas av mobb som representerar stora partier som bränner eller" försvinner "röstlådor, hotar revisorer från mindre konkurrenter och låta våld överträffa processen i nyckelområden. I vår erfarenhet av [http://partidodelared.org Partido de la Red] köra för Buenos Aires stads kongress i valet 2013 upptäckte vi att ingen ansträngning spelade upp mer än att ha tillräckliga partrevisorer för att täcka varje distrikt i staden annars skulle rösterna bli stulna. Ju större ett vals territorium är desto mindre sannolikt kan ett analogt system garantera en rättvis process. Vidare innebär höga genomförandekostnader att man begränsar valet till en handfull dagar om året, om det är något, vilket gör demokratin ett undantag snarare än normen om hur regeringar faktiskt blir valda. Dessutom har den traditionella analoga valprocessen formen av en rörledning, där röster navigerar hela tiden, från väljarens händer till en central server. I den rörledningen sammanfattas röster från varje omröstning manuellt på pappersark, som senare skannas och överförs till ett centralt kontor. Där laddas de mottagna arken manuellt till en central server som beräknar röstantalet. I det här schemat hanteras en röst vid varje navigeringsprocess av ett antal olika mänskliga aktörer, vem som helst med vilje eller oavsiktligt kan införa bedrägerier när som helst. Elektroniskt val syftar till att förkorta denna rörledning, med målet att ingen människa kan hantera röster: väljare interagerar med en enhet (t.ex. en elektronisk röstmaskin) som överför de krypterade rösterna till en central server eller till en gemensamt bokförd (t.ex. en blockchain).
[[File:/images/nation-state-voter-turnout.png|Territorial voting.]]
* '''Elektronisk omröstning''': Förslag som levererar lösningar baserade på elektroniska röstmaskiner syftar till att säkra processen genom ett digitalt gränssnitt men med samma logik om få val per år, med nettoeffekten av ny teknik som tjänar samma syfte som gammal röstteknik, dvs att legitimera professionella politiker . Maskiner kan effektivt hjälpa till att undvika [https://en.wikipedia.org/wiki/Clientelism clientelist] tekniker som används för att korrupta ett val men öppna en helt ny attackyta genom att utsätta omröstningar för risken för oupptäckta hack och utländskt ingripande. Experter inom detta område ([https://www.ndi.org/e-voting-guide/examples/constitutionality-of-electronic-voting-germany inklusive högsta domstolen i Tyskland]) rekommenderar att du använder elektroniska röstmaskiner som lämnar ett pappersspår [https://www.amazon.com/Voting-Wars-Florida-Election-Meltdown/dp/0300198248 or any alternative medium] som röstbevisning.Ett annat tillvägagångssätt för säkra och transparenta röstsystem är ansträngningar att göra röstmaskiner [https://www.nytimes.com/2017/08/03/opinion/open-source-software-hacker-voting.html open source and auditable by the public]. Teknik kan också introduceras direkt av medborgare som använder smartphone-appar för att utföra '' parallellröstningstabell '' för att rapportera partiella tal över olika valstationer som skydd mot officiella rapporter. Datasystemen håller i sin natur loggar och kan inte garantera rösträtt. Av denna anledning bör varje loggning av ett digitalt röstningssystem vara offentligt som standard och trustless, som fungerar med en distribuerad ledare som synkroniserar utgångarna i ett gemensamt nätverk. Kort sagt: en blockchain.
Traditionella analoga och elektroniska val är strikt för långsiktiga representativa demokratier med valperiod mellan 4 och 6 år. Men den bakomliggande dynamiken hos dessa system är att tjänstemän är förvalta från toppen och presenteras för medborgarna att legitimera med sin röst. Argumentet att medborgare saknar kunskap och förberedelser för att uppfylla det politiska ansvaret och inte har tillräckligt med tid i sina dagliga liv att engagera sig i offentliga angelägenheter är svag på meriter: oftare kräver inte offentliga tjänstemän insatser från experter på specifika områden för att utarbeta lagstiftning . Tack vare Internet, mobiltelefoner, sociala medier och satelliter, bor vi observerat i en värld full av medborgare som regelbundet deltar i debatt om politiska frågor (om än saknar chanser för verklig inverkan.)
===1.2 Geopolitik.===
En följd av USA: s presidentval av 2016 är att [https://www.theguardian.com/us-news/2016/dec/16/qa-russian-hackers-vladimir-putin-donald-trump-us-presidential-election fear of foreign intervention] har blivit ett ledande hot mot säkerheten i valprocesserna. Men även om röstmaskiner är ett extremt sårbart mål, ([https://blog.horner.tj/post/hacking-voting-machines-def-con-25 defcon 25 had a large selection of voting machines, all of them were exploited]) Utländska attacker har en enklare metod än kapning av röstmaskiner eftersom direkt manipulering av röster som potentiellt kan spåras, är mycket dyrt och svårt att utföra på en skala som är tillräckligt stor för att tillfredsställa en angripare. Ett effektivare tillvägagångssätt är [https://en.wikipedia.org/wiki/2016_Dyn_cyberattack instilling public fear by collapsing internet infrastructure days prior to an election] på ett sätt som kan bidra till att driva favoritism på en kandidat som uppfattas starkare än den andra. Denna typ av cyberattack som kan utlösa ett skift i väljareuppfattningen är nästan omöjligt att spåra som en politisk subversion och avslöjar den inneboende konflikten som en digital commons har med territoriella demokratier.
[[File:/images/hacked-america.png|Impact of DNS cyberattack (October 21, 2016) & Presidential Election (November 6, 2016).]]
Detta hände två veckor före valet i USA 2016 när en botnet samordnade genom ett stort antal saker av internet av saker (IoT) som utfördes en [https://en.wikipedia.org/wiki/Denial-of-service_attack#Distributed_DoS Distributed Denial of Service (DDoS) attack]som drabbade domännamnssystemet (DNS) -leverantören Dyn Inc., som leder till stora webbplatser i USA, inklusive Amazon, Paypal, New York Times och Wall Street Journal bland många andra.
===1.3 Land vs. Cloud.===
<blockquote>
In the near future, electrons and light flow freely, and corporate computer networks eclipse the stars. Despite great advances in computerization, countries and race are not yet obsolete…
</blockquote>
[http://www.imdb.com/title/tt0113568/ '''''Ghost in the shell'''''], graphic novel (1995).
Det 21: a århundradet bevittnar en växande konflikt mellan ''The Land'': regeringar som monopoliserar lagen om territoriella jurisdiktioner genom att begränsa fri rörlighet för fysiska varor och organ. och ''The Cloud'': globala företag som monopoliserar tillgången till användardata som kan spåra och rikta idéer via personlig annonsering. I denna värld är frihet en illusion: våra kroppar hör till regeringar, våra sinnen till företag. Notoriska strider från denna konflikt inkluderar [https://en.wikipedia.org/wiki/FBI%E2%80%93Apple_encryption_dispute ''Apple versus FBI''] fall som begär en jailbreak av en krypterad telefon; eller den historiska tvisten mellan [https://www.washingtonpost.com/news/the-switch/wp/2017/03/06/trumps-new-travel-ban-raises-the-same-silicon-valley-objections/?utm_term=.0854c54536d6 Silicon Valley’s cosmopolitanism seeking flexible visas and Washington D. C.’s nationalism raising migration barriers]. När detta scenario utvecklas spelar kryptering en viktig roll för att skydda de digitala medborgarnas mänskliga rättigheter, eftersom det kan hjälpa dem att bryta sig bort från ''cloud versus land'' fällan.
[[File:/images/the-land.png|The land: monopolies on force.]]
Ursprunget till modern kryptografi går tillbaka till andra världskriget när Alan Turing byggt de första proto-datorerna för att dekryptera nazistiska meddelanden. Sedan dess har kryptering lagts till i USA på samma sätt för traditionella vapen: det ingår i ''Munitions List'' av [https://www.pmddtc.state.gov/regulations_laws/itar.html International Traffic in Arms Regulations] och relaterad programvara och hårdvara måste hantera exportrestriktioner. Och även om kryptering ofta anses vara en rätt skyddad enligt det första ändringsförslaget som hävdar att “code is speech”, Dess defensiva karaktär indikerar att det också måste skyddas under paraplyet i det andra ändringsförslaget, eftersom det har samma resonemang bakom “right to bear arms”, to wit: i en tid där [http://twitter.com/Snowden whistleblowers] avslöjar hur ''Deep State'' spionerar på medborgare över hela världen, krypterad information är den enda realistiska garantin för att någon måste skyddas mot statliga missbruk (och de företag som supportar dem).
[[File:/images/the-cloud.png|The cloud: monopolies on data.]]
Sekretess är en grundläggande egenskap för fritt och rättvist val, eftersom det är en mekanism som hjälper till att undvika tvång från de som befinner sig i makten och förhindrar risken för att val köps och säljs för pengar. Sekretess är den bästa garantin ett medvetet, fritt sinne måste tänka för sig själv. Men på det moderna internet är integritet illusoriskt när du använder Facebook, Google eller någon webbaserad tjänst. Trots att internetmonopol låtsas vara gatekeepers för privatlivets fred, kan Facebook teoretiskt nog förminska någon av sina 2 miljarder registrerade användare om det någonsin skulle vara önskvärt. Google och Facebook håller de största identitetsdatabaserna i världen -- överträffar regeringarna i Indien och Kina -- medan [https://twitter.com/AdrianChen/status/832452637320556544 97% of their reported revenue comes from advertising] allvarligt konditionera den typ av erfarenhet som användare får med sin teknik. Det är i deras företags intresse att samla så mycket information som möjligt för att profilera människor för att vara konkurrenskraftig på uppmärksamhetsmarknaden, och båda företagen filtrerar information som matas till användare med [https://medium.com/@piamancini/future-scenarios-for-algorithmic-accountability-and-governance-17cd436d22a0 algorithms accountable] till ingen annan än sin egen styrelse. Ingen av deras tjänster är verkligen fria: Den personliga suveräniteten är oavsiktligt given till tekniska jättar idag, på samma sätt som de infödda 500 år sedan på den amerikanska kontinenten var distraherade och tittade på sina egna ''selfies'' i glänsande speglar även som europeiska conquistadors svepte bort hela deras livsstil. Ocensurerade, fria och suveräna debatter om mänsklighetens framtid äts av värdelösa ''likes'' som bara hjälper till att upprätthålla dessa företagsenheter. ''Fake news exploits'' (som de användes under amerikanska valet) eller kritiskt innehåll som sprider sig som bränder (som det hände under ''Arab Spring'') visa att alla ansträngningar att stoppa internationellt inflytande på nationell politik är meningslöst eftersom samhällen tillbringar större delen av sin tid online. Enkelt uttryckt är Internet oförenligt med medborgarna.
===1.4 Intelligens.===
<blockquote>
I can’t let you do that, Dave.
</blockquote>
'''HAL 9000''' on ''2001: A Space Odyssey'' (1968).
Den bästa medborgerliga tekniken är teknik som används varje dag. Redan Facebook, Twitter och andra sociala medieplattformar har blivit proxy de viktigaste gränssnitt som medborgarna använder för att påverka den dagliga politiken. Men de osynliga följderna av att ge personuppgifter bort via centrala webbtjänster kan vara många, med relevanta - till och med ödesdigra - konsekvenser för mänsklighetens framtid. Informationsarkitekturen för hur personuppgifter lagras, delas och monetiseras är grundläggande för att förstå suveräniteten i det 21: a århundradet.
Ett begynnande hot är användningen av obegränsad artificiell intelligens (AI) som drivs av användargenererat innehåll utan någon form av offentlig tillsyn. Det var tydligt i en tidigare Blackwater-anställds uppenbarelse till oss om hur data blir vapen: från ett kontor i Dubai kunde han köra och få live-flödet av en drone som flyger över Syrien eller Pakistan, men överraskande beslutet om att döda målet var inte gjord av den mänskliga operatören (eller en övervakande myndighet) utan av en AI som kallade skotten via Internet "åtminstone 90% av tiden". Denna AI tillhandahölls av ett Silicon Valley-företag som ofta "krediteras" med att tillhandahålla intelligens till CIA och ledde till att fånga Osama bin Laden 2011.
Frågan om AI som bestämmer människors livs öde öppnar etiska och moraliska frågor. Så småningom inte ens mänskliga forskare kan förstå hur en AI beter sig, blir ett hot om det är en nyckelkomponent i militärteknik. Enligt författaren Yuval Noah Harari, "Intelligens bryter sönder sig från levande organismer och det kommer inte att monopoliseras av kolväsen för länge." Medvetenhet är den nya politiska gränsen dras, en linje mellan maskiner och människor. Med andra ord: förstå huruvida vi använder maskinerna eller maskinerna använder oss. Hur vi strukturerar mänskliga organisationer - och styr koden som kör dem - definierar vem som är ansvarig. Eftersom kapaciteten för kiselintelligens matchar Moores lagtillväxt, måste mänskligheten som helhet fråga sig hur det kommer att reglera tätheten i denna oförutsedda makt.
===1.5 Decentralisering.===
<blockquote>
Sovereign is he who decides on the exception.
</blockquote>
[https://wikipedia.org/wiki/Carl_Schmitt '''Carl Schmitt'''], political theorist (1888-1985).
Achilles hälen av data hungrig, uppmärksamhet jordbruk internetmonopol är deras behov av en centraliserad informationsarkitektur. De steg som ''superhubs'' i det som brukade vara ett löfte om ett webbformat nätverk genom att implementera de vinnande lösningarna till de ledande användarna online. Men den oavsiktliga konsekvensen har varit ett privatiserat ekosystem: stängd kod, muromgärdade trädgårdar och centralisering av makt i några händer som banar vägen för en full [https://youtu.be/IrSn3zx2GbM?t=10m34s surveillance society] på vad som annars skulle kunna vara en gränslös commons. När Sir Tim Berners-Lee, skapare av ''world wide web'' protocols, protokoll, påpekade de inneboende riskerna med dagens internet, begärde han behovet av att utarbeta [https://www.ted.com/talks/tim_berners_lee_a_magna_carta_for_the_web Magna Carta for the Web]: “Om vi inte har ett öppet, neutralt internet kan vi lita på oss utan att oroa oss för vad som händer vid bakdörren, vi kan inte ha öppen regering, god demokrati, sammankopplade samhällen och kulturskillnad. Det är inte naivt att tro att vi kan få det, men det är naivt att vi bara kan luta oss tillbaka och få det.“
Centralisering är det enda misslyckandet i valet och är oförenligt med demokratin. I vår erfarenhet av att implementera centraliserad digital omröstning för beslut av Partido de la Red upptäckte vi att om ett val är höga insatser (alla eller de flesta medlemmarna har ett partiskt intresse för resultatet) ökar sannolikheten för att systemet blir skadat. Den största risken ligger hos dem som är ansvariga för att kontrollera servrar och databasintegritet. Vi upptäckte i fallet med [https://asamblea.partidodelared.org/topic/58eaf4739b96a611009bc3fc internal elections] hölls i början av 2017 fanns skillnader mellan information som rapporterats av databasrevisorer och loggväljare behölls i sina lokala maskiner: manipulering av röstutsläppsdata, oväsenlig ändring av avstämningsdatum för stängning, raderade protokoll och plötsligt förbud mot registrerade konton bevisades och fördömdes vilket ledde till en generaliserad uppfattning om bedrägerier i hela processen. Centraliserade digitala demokratier utan hänsyn till kryptografisk säkerhet är leksaker som är användbara för lekfulla ändamål men kan vara farliga när de genomförs i reala scenarier under falska händer.
Samtidigt har det traditionella valet en teknik som kallas ''adversarial counting'' när resultatet ligger nära ett slips. Myndigheter av alla inblandade parter deltar i en manuell rösträkning. Men när ett val händer inom en stor befolkning, ''adversarial counting'' minskar kostnaden för subversion, vilket kräver att en angripare mäter endast några få myndigheter från en konkurrerande part för att säkra ett resultat. Vilken typ av system som kräver förtroende från deltagarna löper slutligen risken för att hela strukturen kollapsar om någon myndighet är bedräglig.
[[File:/images/blockchain-permissionless-audit-voting.png|Blockchain democracies enable permissionless audits.]]
Decentralisering är ett krav på demokratiska val. Utan det finns alltid utrymme för korruption. Blockkedjor möjliggör tillförlitliga system genom att erodera behovet av mänsklig auktoritet och öka försvaret av röstintegritet med en gemensam resurs som har scorekeeping som huvudfunktion. Detta medger oöverträffade mönster för valsystem. '''With a blockchain-based democracy votes become censorship resistant and every single voter can audit an election without requiring any kind of access rights to infrastructure.''' Genom att lagra röstdata i en blockchain snarare än i privata servrar eller röstlådor blir revisionsutgifterna abstrakta och förvandlas till en garanterad rättighet för varje deltagare. Röster är inte bara bara åskådare utan också suveräna portvaktare av hela processen. Denna typ av insyn kan inte levereras av traditionella valsystem, analoga eller elektroniska.
===1.6 Suveränitet.===
På dagens internet har röstningen uppstått som huvudinteraktion. Varje gång användare ''like'', ''upvote'', ''heart'', ''link'' eller ''retweet'' innehåll de signalerar en preferens som tjänar en återkopplingsslinga som ger bättre rekommendationer för dem. Men åtgärden går inte längre: det är en ''fake vote'' som saknar institutionella konsekvenser. ''Likes'' i sociala medier fungerar som värdelösa tokens som kan blåsas upp med ett enda klick trots att de sätter priset på reklam dollar. Nätverkseffekter gjorde denna interaktion till en metrik som lyfter fram påverkan av en viss idé inom en folkmassa, ofta ett verktyg för de som befinner sig i makt för att undersöka samhällets behov. Men de finansiella och politiska fördelarna med dessa transaktioner hålls helt av [https://www.nytimes.com/2016/10/16/technology/peter-thiel-donald-j-trump.html network owners].
[[File:/images/web-voting.png|Web voting.]]
Högteknologi som kan fungera i peer-to-peer-nätverk, validera identitet, bevara anonymitet, kryptera data, decentraliserande infrastruktur, med fri (''as in freedom'') öppen källkod kan helt störa det beskrivna landskapet.
Under hela historien var det bara tre typer av suveräner som segrade: ''sovereign tribe'' där en folkmassa följer en ledare ; en ''sovereign king'' loyal only to God; och en ''sovereign republic'' med kontinentala länder som regleras enligt en lag. Blockkedjor som arbetar i cyberspace ger upphov till ett fjärde slag: The ''networked individual''. Det är inte en långsökt möjlighet -- uppnå [https://www.amazon.com/Sovereign-Individual-Mastering-Transition-Information/dp/0684832720 personal sovereignty] är redan en verklighet för dem som driver sina finanser med bitcoin och andra kryptoinnehav. Som investerare [http://twitter.com/naval Naval Ravikant] står det: "Du kan korsa en internationell gräns som bär en miljard dollar i bitcoin helt i ditt huvud." Den här typen av suveräna handlingar är oöverträffad även för samtidiga statschefer .
Den utbredda antagandet av blockkedjor ger upphov till en modell som ursprungligen växte under etablerade institutioners skuggor men i slutändan kommer att göra dem föråldrade. Blockkedjor är automatiserade byråkratier som erbjuder betydande ekonomiska fördelar när det gäller transaktionskostnader, samtidigt som behovet av mellanhänder abstraheras. De möjliggör system för fri association som hjälper till att bryta den politiska och ekonomiska tvång som regeringar och banker ålägger genom att begränsa rösträtten eller begränsa tillgången till kapital. Ett tekniskt avancerat samhälle kan blomstra bortom territoriella domäner varhelst det finns en internetanslutning med digitala medborgare som blir en del av en ny typ av diaspora.
----
Med denna diagnos, i [[#Paper|Section 2]] vi kartlägger de grundläggande byggstenarna för en decentraliserad flytande demokrati. När verktygen är definierade, [[#Execution|Section 3]] föreslår ett genomförande som fokuserar på att göra systemet säkert och inkluderande.
<div id="Paper"></div>
==2. Papper.==
<blockquote>
It is the technology that we do not control the one that is used to control us.
</blockquote>
[https://twitter.com/earlkman '''Emiliano Kargieman'''], space hacker (1975).
En grundprincip för demokrati är rätten att bli hörd. Idag hörs inte större delen av världens befolkning: att ha en röst är en födelseshändelse. Individuella och kollektiva röster stäms politiskt och ekonomiskt av ‘illiquidity’ - De marginaliserade får inga instrument för att sända eller förstärka sin röst. Modern demokrati är födelsebarnet till ''Printing Press Era'':tryckta konstitutionella system som är beroende av blöta kontrakt och hastigheten på posttjänsten. Representativa demokratier är en olycka för informationstekniken från 1700-talet.
[[File:/images/liquid.png|Direct democracy vs. Liquid Democracy.]]
En flytande demokrati bygger på en dynamisk representationsmodell som arbetar med en bottom-up-strategi: medborgarna kan välja fritt inom sin sociala graf (vänner, kollegor, familj) som de vill ha som representanter för en viss uppsättning ämnen. Det är den mest flexibla formen av demokratisk styrning som kan konstrueras med digital teknik, som fungerar som en hybrid som möjliggör direkt eller delegerad röstning när som helst. Det finns få prejudikat för pålitliga bottom-up-miljöer som har lett till auktoritativt innehåll, [https://www.wikipedia.org/ Wikipedia] vara ett banbrytande fall. Men om historien är någon guide, blev den sista tiden civilisationen ställd inför [https://en.wikipedia.org/wiki/Age_of_Enlightenment ett paradigmskifte om encyklopediupplysning] det var just i epoken före uppkomsten av moderna demokratier.
I detta dokument beskrivs genomförandet av en flytande demokrati med [http://github.com/DemocracyEarth/sovereign Sovereign], vår demokratiska styrning ansökan som fungerar med blockchain tokens använder en grundläggande uppsättning smarta kontrakt. Enkelhet i designen och det språk som används för att uttrycka denna design är viktigt för en genuin demokratisk enhet. Ingen teknik kommer någonsin att kunna tillfredsställa demokratiska strävanden om den bara kan förstås av en elit. Som kryptograf [https://en.wikipedia.org/wiki/Ralph_Merkle Ralph Merkle] stated:
<blockquote>
We do not call upon ordinary untrained citizens to perform surgery, fly airplanes, design computers, or carry out the other myriad tasks needed to keep society functioning, what makes governance different? The problem is readily understood: if we give governance to “experts” they will make decisions in their own best interests, not in the best interests of us all.
</blockquote>
===2.1 Token.===
Ett idealvalssystem måste i största möjliga utsträckning tillfredsställa dessa villkor:
* '''Sekretess''': väljaren måste kunna rösta i hemlighet.
* '''Verifierbarhet''': väljaren måste kunna verifiera upprepad omröstning.
* '''Integritet''': Systemet måste kunna verifiera korrekt rösträtt.
På grund av risken för att tvång genom fysiskt våld eller hot i sammanhang som är föremål för politiskt våld, måste ett alternativ som kan skydda tvingade väljare införas:
* '''Motstånd''': väljaren måste kunna överväga egen röst om det behövs.
I arbetet som leds av forskare Hosp & Vora, en [https://pdfs.semanticscholar.org/24d5/5c866a7317dae11d37518b312ee460bc33d3.pdf Information Theory approach was taken to model voting systems] vilket leder till slutsatsen att en naturlig spänning existerar med ett system som syftar till ''perfekt integritet'', ''perfekt rösthemmelighet'' och ''perfekt kontrollerbarhet''. Alla tre kan inte uppnås samtidigt när en motståndare är beräknat obegränsad, kan brute force ett system om obegränsad tid eller minne är tillgängligt. Av denna anledning anser vi att det är oumbärligt att genomföra digitala demokratier med hjälp av blockchains. Med nätverkseffekter som redan finns på plats kan blockkedjor verifiera transaktionsintegritet och förhindra dubbla utgifter för token
. Bitcoin’s [https://en.wikipedia.org/wiki/Proof-of-work_system ''proof of work''] modellen uppnår detta genom att belöna beräkningskapaciteten för att verifiera transaktionsblock (det som ofta hänvisas till ''mining''), vilket leder till ett nätverk “300 gånger kraftfullare än Googles resurser” enligt pionjären [http://twitter.com/balajis Balaji Srinivasan]. Av denna anledning bygger vår design på tokens inom ett blockchain-nätverk som fungerar som ''political cryptocurrency''.
Vad skiljer en röst från pengar (eller i bredare termer: en ''politisk ekonomi'' från en ''finansiell ekonomi'') är den politiska valutan utformad för att garantera deltagande rättigheter under rättvisa förhållanden till alla medlemmar inom en organisation. Rättigheter syftar till att tillfredsställa den övergripande legitimiteten i en institutions styrning. Medan pengar är språket av självintresse, uttrycker rösterna de gemensamma åsikterna om ett samhälle. Politisk valuta är inte strängt menat för handel men för socialt val.
{| class="wikitable"
|-
! scope="col"| Funktion
! scope="col"| Valutor
! scope="col"| Röster
|-
! scope="row"| Verktyg
| Handel.
| Styrning.
|-
! scope="row"| Mining
| Beräkning (t ex bevis för arbete).
| Uppmärksamhet (äkthet t ex bevis på identitet).
|-
! scope="row"| Likviditet
| Knapp.
| Garanterad.
|-
! scope="row"| Signal
| Självintresse.
| Socialt val.
|-
! scope="row"| Värde
| Utrymme (materialvaror).
| Tid (information).
|}
====2.1.1 Implementation.====
Med tanke på att värdet [https://en.wikipedia.org/wiki/Dogecoin kan drivas med minnesförmåga], Demokratiska Earth token som ger rösträtt kommer att märkas med det enskilt viktigaste budskap som någon demokrati kan förmedla: ''röst''.
En ''röst'' token kan implementeras med smart kontraktskod över en mängd olika blockkedjor som tillåter [https://en.wikipedia.org/wiki/Turing_completeness Turing Complete] skript, inklusive Bitcoin. Vår design är blockchain agnostic i erkännande av ett datavetenskapsfält fortfarande i sin spädbarn där betydande innovationer kvarstår att uppfinnas. Ändå arbetar vi med att genomföra ''röst'' token under dessa smarta kontraktsmiljöer:
* '''Ethereum''': Använda en uppsättning av [https://github.com/ethereum/solidity Solidity] smarta kontrakt under [https://theethereum.wiki/w/index.php/ERC20_Token_Standard Ethereum ERC20 token standard].
** '''Rootstock''': Vi vidtar nödvändiga åtgärder för att göra Solidity-koden kompatibel med [http://www.rsk.co/ Rootstock's smart contract interpreter for the Bitcoin blockchain].
* '''Lightning''': Med aktiveringen av [https://en.bitcoin.it/wiki/Segregated_Witness segregated witness] i Bitcoin-protokollet som möjliggör dirigering av betalningskanaler med [http://lightning.network Lightning Network protocol], flytande demokratiedelationer kan kartläggas med hjälp av satoshi-nivåstransaktioner ''röst'' identifierare. Blockchain-uppgörelsekostnaden måste täckas av genomförandeorganisationen.
Dessutom uppmuntras flerkedjiga implementeringar i en anda att söka större experiment och samarbete kring denna teknik.
===2.2 Röstning.===
En ''röst'' token syftar till att vara en standard för digital demokrati att samverka med andra tokens, vilket sätter ett gemensamt språk för styrning av blockchainbaserade organisationer. Inom ramen för flytande demokratier tillåts en rad rösttransaktioner med ''röster'':
* '''Direkt röst''': Själviska väljaren Alice får använda sina tokens för att rösta direkt om frågor som i en direkt demokrati.
* '''Enkel delegering''': Alice kan delegera ''röster'' till Bob. Så länge som Bob har tillgång till dessa tokens kan han använda dem för att rösta på Alice.
* '''Tag Limited Delegation''': Alice kan delegera ''röster'' till Charlie under det angivna villkoret att han bara kan använda dessa tokens på problem som bär en viss tagg. Om delegationen anger det delegerade ''röster'' kan endast användas vid beslut med ''#environment'' tag, då kommer Charlie inte att kunna använda dessa någon annanstans men på de specifika frågorna. Detta leder till en representationsmodell som inte är baserad på territorium utan kunskaper.
* '''Transitiv delegering''': Om Bob får ''röster'' från Alice, Han kan sedan delegera dessa till Frank. Detta genererar en kedja av delegationer som hjälper till att ge specifika spelare i en gemenskap. Om Alice inte vill få tredje part att få rösterna som hon delegerade till Bob kan hon stänga av den transitiva inställningen på delegationskontraktet. Cirkulära delegationer (t ex Alice som mottar de tokens som hon skickade Bob från Frank) är förbjudna sedan den ursprungliga tilldelningen av ''röster'' från en organisation till dess medlemmar bär en underskrift som indikerar vem som är den suveräna ägaren till ''röster''.
* '''Åtsidosätta Röst''': Om Bob redan använde den delegerade ''röster'' Han mottog från Alice men hon har en annan åsikt om en given fråga, eftersom den suveräna ägaren till hennes röster Alice alltid kan åsidosätta Bobs beslut. Voters har alltid det sista ordet på ett visst beslut med sitt ursprungliga ''röster''.
* '''Public Vote''': Ofta refererad till som ''golden rule'' i flytande demokrati, alla delegatörer har rätt att veta hur deras delegat har röstat om ett visst problem med deras ''röster''.På samma sätt är kongressens röster offentliga. På flytande demokratier som konkurrerande delegater på en viss tagg har ett incitament att bygga ett offentligt rykte baserat på deras röstningsrekord för att locka till sig fler delegationer
* '''Hemlig röst''': En metod som kan garantera ''röst'' transaktioner oåtkomliga för väljaren. Detta är oumbärligt i samband med offentliga val som hålls inom stora populationer som har stor risk för tvång. Även om perfekt sekretess på ''röst'' transaktionen uppnås kan användarna fortfarande fingeravtryckas med exponerad metadata. Av denna anledning uppmuntras forskning om integration med blockkedjor avsedda för anonyma transaktioner med beprövad rekord. Detta kan innefatta en gruvavgift för att lösa ''röst'' transaktion som antingen kan subventioneras av genomförandeorganisationen eller direkt betalas av väljare. Vi rekommenderar forskning och integration av hemlighet ''röst'' med dessa blockchains:
** [https://z.cash ZCash]: implementerar avskärmade transaktioner med [https://en.wikipedia.org/wiki/Zero-knowledge_proof zero-knowledge proofs]
** [https://getmonero.org Monero]: använder [https://en.wikipedia.org/wiki/Ring_signature ring signaturer med stealth adresser].
===2.3 Användarupplevelse.===
Användarupplevelse (UX) är en kritisk aspekt av en decentraliserad arkitektur och blir ännu viktigare eftersom de överflödiga lager av centraliserade arkitekturer kondenserar användaren. I en centraliserad internetarkitektur äger användaren inte gränssnittet eller erfarenheten. I en decentraliserad internetarkitektur, användargränssnittet (UI) bör baseras på användarens perspektiv. I den meningen blir transaktionerna gjorda under tre olika synpunkter:
* '''Self''': Använda en offentlig identitet som är relaterad till en individ.
* '''Organization''': I representation av en organisation som utvidgade företrädesrätten till enskilda (t.ex. arbetsplats, klubb, politiskt parti etc.).
* '''Anonym''': Utan någon koppling till en offentlig identitet.
Denna förståelse av ''SELF / ORG / ANON'' skifta form har påverkat vårt gränssnitt och token design högt. Vid en viss tidpunkt kan en suverän användare anta något av dessa lägen för att interagera med decentraliserade organisationer.
====2.3.1 Flytande.====
Suveräna syftar till att göra omedelbar och enkel vätskebevakning. Vilken friktion som helst i processen måste undvikas och delegerings widgeten bör ständigt exponeras på gränssnittet medan du surfar eller tittar på medlemsprofiler. För detta ändamål använder suveräna a ''liquid bar'' som tillåter transaktion av ''röster'' med en enda gest, antingen på mobila eller stationära enheter.
[[File:/images/liquid-mobile-ux.png|Sovereign mobilt gränssnitt som visar beslut, omröstning och flytande röstning.]]
En ''liquid bar'' tillåter dessa åtgärder:
* '''Se tillgängliga ''röster''''': Eftersom en användare i en flytande demokrati kan ha 1 eller flera delegerade ''röster'', Att ha en ständig påminnelse om balansen hjälper användaren att förstå sin nuvarande kraft inom systemet. Om några av ''röster'' delegerades med strikta villkor (e.g. a ''Tag Limited Delegation''), det betyder att en användare inte kommer ha samma mängd ''röster'' tillgänglig för varje fråga.
* '''Se röst ''röst''''': Ett procentvärde med mängden av ''röster'' som för närvarande kastas på andra beslut eller delegeras till andra medlemmar i samhället visas. Användaren kan klicka eller klicka när som helst på det värdet för att se en komplett lista över de problem där han eller hon för närvarande har en ''röst'' och bestämma om du ska behålla dem eller göra en strategisk förändring.
* '''Skjuta ''röst''''': Användaren kan använda sin tumme (eller med musklick) för att skjuta ''liquid bar'' hantera och vid frisläppandet av det kommer han eller hon att bli ombedd att få en bekräftelseförfrågan om att ''rösta'' eller ej.
* '''Tryck för att ''rösta''''': Om användaren inte vill tilldela mer än 1 röst kan han eller hon helt enkelt trycka på ''liquid bar'' hantera en gång och kommer att uppmanas att bekräfta en enda ''röst'' transaktion.
* '''Radera ''votes''''': När som helst så länge pollen fortfarande är öppen kan användaren ta bort hans eller hennes ''röster'' från ett beslut genom att helt enkelt skjuta ''liquid bar'' hantera tillbaka till startpositionen.
Vi ser denna interaktion som ett steg framåt från ''like'' mönster som finns i sociala medier. ''Likes'' gränser röstar till tanklösa klick och kan blåsas upp på viljan. Eftersom ''votes'' fungera som en knapp resurs i systemet, kan de inte genereras på vilja och alltid kräva ett minimum av taktiskt tänkande om hur en användares interaktion påverkar ett visst beslut. ''röster'' har verkliga konsekvenser för användaren som intressent för en decentraliserad organisation ''Likes'' bara tjäna sina kontrollerande företag.
====2.3.2 Delegering.====
En ''liquid bar'' visar också ''röst'' delegationsrelation som en användare har med någon annan medlem i en organisation. Delegationerna går båda vägarna:
* '''Skickade''': En användare måste kunna delegera någon av hans tillgängliga ''röster'' medan du kontrollerar det nuvarande delegerade beloppet (om det finns några).
* '''Mottagna''': En användare måste kunna förstå hur många ''röster'' mottogs från någon annan.
Varje gång en medlemsprofil visas i Sovereign visas den nuvarande delegationsstatusen mellan användaren och medlemmen.
[[File:/images/delegation-relation-votes.png|Vy över omröstningsdelegationsrelation med en annan medlem.]]
====2.3.3 Agora.====
Sovereign har också en debattkomponent vid namn ''Agora''. Debatt är sannolikt lika viktigt som att rösta i någon demokrati. Agoras display ''trådade konversationer'', en framgångsrik design pionjär av [http://reddit.com Reddit] och [http://news.ycombinator.com Hacker News]. Vi anser detta UX mönster som det bästa sättet att engagera sig i tankeväckande konversationer på nätet eftersom de har de mest uppskattade kommentarerna bubbla upp och hjälper till att sortera informationen för en debatt med hjälp av gemenskapens kollektiva intelligens.
Men i motsats till webbaserade applikationer tillåter Sovereign inte vittnesbördsinteraktioner: i stället för att tillåta oändlig ''upp -röster'' eller ''ned-röster'', Om användaren godkänner en kommentar från någon annan i plattformen kommer det att utlösa en omedelbar delegering av en enda ''röst''. Därför tillåter Agoras:
* '''Rösta upp''': Skicka en singel ''röst'' delegering från användaren till den som kommenterat.
* '''Rösta ned''': Om en användare inte håller med någon annans kommentar, en ''ned-röst'' kan antingen hämta en ''röst'' från kommentaren tillbaka till användaren om det fanns en tidigare delegation. Eller om det inte finns någon delegationsrelation bland dem, då en ''ned-röst'' kommer att fungera som en minskning av ''röst'' från kommentaren tillbaka till medel från organisationen som genomför den suveräna förekomsten. Kriterierna för denna typ av minskning kan ställas in i ''konstitutionellt smart kontrakt'' i genomförandeorganisationen.
Detta kommer att göra delegationer oftare över plattformen. Debatter ständigt utsatta för risken för ''röst'' transaktioner innebär att de utsätts för verkliga politiska konsekvenser. Denna mekanism kan hjälpa till att belöna goda argument och bestraffa inverkan av trolling utan att behöva utveckla modererande myndigheter i systemet.
=== 2.4 Pilot ===
<blockquote>
Blockchain could disrupt voting, just as it has currency, and could apply to any democratic government.
</blockquote>
[https://www.oecd.org/gov/innovative-government/embracing-innovation-in-government-colombia.pdf '''The Organization for Economic Cooperation and Development'''], Embracing innovation in government: global trends (2016).
I oktober 2016, efter ett chockerande, nästan universellt oväntat nej till fred i den colombianska folkomröstningen som satte risken för förhandlingar mellan regeringen och de marxistiska narkolarierna, ledde demokratimiljan den suveräna flytande demokratiplatsen i en [http://plebiscitodigital.co/ digital plebiscite] anta en symbolisk röst bland diasporan av 6 miljoner utländska medborgare. I stället för att ge en röstare det binära alternativet möjliggjorde piloten att rösta separat om sju enskilda underteman i det föreslagna fördraget, samt att delegera sina röster till mer kunniga väljare med resultat som avslöjade viktiga nyanser i röstpreferenser som inte fångades in folkomröstningen, inklusive [https://words.democracy.earth/a-digital-referendum-for-colombias-diaspora-aeef071ec014 deal breaker that emerged]: en överväldigande "nej" bland pilotdeltagarna till ett särskilt uttalande av fördraget om politiskt deltagande av FARC.
[[File:/images/colombia-use-case.png|Colombia use case data..]]
Pilotstudien hade [https://www.oecd.org/gov/innovative-government/embracing-innovation-in-government-colombia.pdf additional impact] att öka media och politisk profil av blockchain-aktiverad, decentraliserad flytande demokrati i Colombia; en blockchain-savvy politisk parti har sprungit upp, Partido de la Red Colombia-partiet ("The Net Party"), medan den colombianska regeringens centrum för digital offentlig innovation (CDPI) också undersöker tekniken.
===2.5 Smarta kontrakt.===
När Claude Shannon skrev sin [http://math.harvard.edu/~ctm/home/text/others/shannon/entropy/entropy.pdf foundational 1948 paper on Information Theory], han kunde visa hur kretsar kan utföra logiska funktioner genom att uttrycka ett binärt tillstånd av 1 eller 0 (<code>true</code> or <code>false</code> states). Sedan dess har digital teknik skapat dynamiken i alla slags informationssystem. Med detta i åtanke fokuserade vi på att bygga en effektiv design för en styrningsmaskin som kan fungera med blockkedjor som håller sina mänskliga operatörer som suveräna linjer genom omröstningen. På samma sätt flyttas bitar i datorer som signalerar a <code>true</code> eller <code>false</code> state, ''röst'' signalera ett booleanskt värde för institutionella beslut som ska registreras enligt smarta kontrakt.
''röst'' tokens operera inom de institutionella gränser som skapats av denna uppsättning kontrakt: <code>Organizations</code>, <code>Medlemmar</code>, <code>Frågor</code>, <code>Valsedlar</code> and <code>Budgetar</code>. Det här är byggstenarna som hjälper till att skapa en styrkrets som kan skala för att driva flytande demokratier inom samhällen av alla storlekar.
[[File:/images/vote-liquid-democracy-smart-contracts.png|VOTE Liquid Democracy smart contracts..]]
====2.5.1 <code>Organisationer</code>====
Den enhet eller institution som genomför en suverän förekomst hänvisas till som en <code>Organisation</code>. Denna enhet fungerar som en styrande myndighet som definierar vem som är <code>Medlemmar</code> tillåtas delta i sina beslut och bevilja dem ''röst'' tokens. Eftersom <code>Organisationer</code> kan eistera i ett decentraliserat nätverk, kraven på att en enhet kan fungera med ''röster'' liknar dem som hittades när du skapade en webbplats:
* <code>Domän</code>: Varje organisation måste ha sitt eget domännamn (e.g. ''democracy.earth'' i Hypertext Transfer Protocol eller HTTP). Vissa kan till och med ha en namnrymd som körs som en toppdomän (e.g. ''.earth''). Denna referenskod för en <code>Organisation</code> inom ett öppet nätverk, huruvida det är äldre webben som i HTTP eller nya framväxande nätverk för decentraliserade domäner som [https://blockstack.org Blockstack], är avgörande för att hjälpa till att bygga ett semantiskt skikt som effektivt beskriver <code>Frågor</code> utan risk för att väljare manipulerar taggar i ett slutet system (hänvisas till avsnittet 2.5.4 as ''squatting''). Domännamn hjälper till att beskriva en <code>Fråga</code> samt begränsa omfattningen av ett delegationskontrakt.
* <code>Konstitution</code>: Varje organisation har en ''Konstitution'' som definierar sina grundregler i form av ett smart kontrakt. De ''konstitutionellt smart kontrakt'' beskriver hur <code>Medlemmar</code>, <code>Frågor</code> och ''röster'' refererar i systemet.
=====2.5.1.1 <code>Konstitution</code>=====
Det ''konstitutionellt smarta kontrakt'' bestämmer hur ''röster'' kommer att fördelas till ledamöter bland annat styrelsesbeslut. Tilldelningsvillkor är ett privilegium för organisationen beroende på dess mål: i vissa fall kan det anpassas till finansiella rättigheter (t.ex. aktieägarna i ett företag får en ''röst'' per andel); i andra fall kan det tilldelas baserat på en likvärdig distribution till alla medlemmar (t ex skattebetalare inom en jurisdiktion som var och en får lika mycket ''röster'').
De grundläggande inställningarna som finns på en konstitution är:
* '''Decentraliserat ID''' (eller URL): En identifierare som hjälper till att hänvisa till <code>Organisation</code> var som helst på nätverket och att det är anslutet till en <code>Domän</code>.
* '''Bio''': En grundläggande beskrivning av organisationen inklusive namn, hemsida, adress, jurisdiktion (om tillämpligt).
* '''Finansiering''': Mängden ''röst'' tokens Denna organisation kommer att hantera och hur dessa kommer att fördelas till varje medlem och ge tillgång till <code>Budgetar</code>.
* '''Medlemskap''': Krav på att bli en giltig medlem inom organisationen. Kriteriet definierar väljareregisteret som garanterar en rättvis valprocess av en demokrati och kan granskas av dess medlemmar.
** '''Öppen''': Alla kan fritt ansluta sig till en organisation.
** '''Röstad''': Befintliga medlemmar måste rösta på sökande medlemmar. En procentuell kriterium måste ställas för godkännande.
** '''Avgift''': Organisationen kräver betalning för godkännande av medlemskap.
* '''Innehåll''': Definierar vem som får posta <code>Frågor </code> till organisationen.
** '''Öppen''': Någon (om en medlem eller inte) kan skicka. Endast medlemmar får rösträtt.
** '''Medlemmar''': Endast godkända medlemmar har rätt att posta.
** '''Särskilda medlemmar''':Medlemmar som uppfyller vissa kriterier (t ex minst delegerade ''röster'' eller ''röster'' mottagna under en viss tagg) har rätt att posta.
** '''Anonym''': Definierar om anonymt innehåll får läggas upp.
* '''Moderering''': Beskriver regler som hjälper till att definiera en uppförandekod bland medlemmar i en organisation.
** '''Förbjudna''': En mängd av ''ned-röster'' krävs för att förbjuda en medlem från att delta i organisationen och påföljden som är knuten till den (t ex en tidsperiod)
** '''Uteslutning''':Om en organisation är baserad på ''Godkänd medlemskap godkännande'', en medlem kan få negativa röster från andra medlemmar som signalerar att sådan identitet har skadats eller inte längre är en del av organisationen. Detta kriterium kan fastställas som en minsta procentuell andel.
* '''Röstning''': Den tillåtna <code>Valsedlar</code> att användas för beslut som ska fattas av organisationen och specifika inställningar som ''kvadratisk röstning''.
* '''Reformera''': Kraven på att ändra någon av de regler som anges på en''Konstitution'' (e.g. en särskild majoritet).
Mallar som definierar vanliga metoder för specifika typer av organisationer uppmuntras att förenkla organisationsinställningen. Detta kommer att stödjas och stödjas genom arbete med partnerskapet med demokratijorden [https://aragon.one/ Aragon],vem arbetar med en digital jurisdiktion som kommer att göra decentraliserade organisationer effektiva. Den suveräna kommer att innehålla mallar för företag, politiska partier, fackföreningar, klubbar och kooperativa företag bland andra; Oavsett form som organisationen tar, garanterar Aragons decentraliserade nätverk att ett företag alltid kommer att arbeta, även i samband med skadlig manipulering av fientliga tredje parter eller missbrukande regeringar.
====2.5.2 <code>Medlemmar</code>====
Varje organisation har medlemmar som får rösträtt om organisationens beslut. Medlemskapskriterier definieras i ''konstitutionellt smarta kontrakt'' och är nyckeln till förtroendet i en demokratisk miljö. Bland de vanligaste sätten att invertera ett val är genom väljare registreringsmanipulation. Att säkra denna aspekt med kryptografiska medel samt ett godkännandeprotokoll är kritiskt. När en medlem är godkänd inom en organisation får han eller hon en viss mängd ''röster'' att användas.
All <code>Organisationer</code> som tar ansvaret för att godkänna eller ogilla <code>Medlemmar</code>, bidra med denna uppgift till ''Bevis för identitet'' process som beskrivs på avsnittet 3.3.
Kompatibilitet med decentraliserade identitetsprotokoll uppmuntras för att garantera decentraliserad styrning. De [https://opencreds.github.io/did-spec/ specifikation av DIDs (decentraliserade identifierare som är analoga med webben URIs)], föreslagna av [https://www.w3.org/ W3C] vilket möjliggör självförsörjande verifierbar digital identitet rekommenderas.
====2.5.3 <code>Frågor</code>====
En organisation består av en samling av ''frågor'' var och en beskriver ett beslut som ska fattas av ledamöterna. Medlemskapsegenskaper beskrivna i ''konstitutionellt smarta kontrakt'' definiera medlemmens röst- och posträtter. Ett problem i sin mest grundläggande form har dessa egenskaper:
* <code>Beskrivning</code>: Text av beslutet ska fattas.
* <code>Taggar</code>:Kategorier som beskriver beslutet inom organisationen. Detta hjälper medlemmar att navigera över problem, definiera områden eller grupper inom en organisation och begränsa omfattningen av en delegation av ''röster''.Om genomförandet görs med blockchain-miljöer som används för att hantera en fast taxonomi (som [http://blockstack.org Blockstack]), Ett gemensamt distribuerat språk för taggar baserat på decentraliserade domäner bidrar till att göra den demokratiska miljön mer rättvis eftersom det undviker medlemmar som försöker styra namnkonventioner till egen fördel. Av denna anledning, inom ett öppet nätverk <code>Taggar</code>som beskriver <code>Frågor</code>eller används för att begränsa delegationer, pekar på andra <code>Organisationer</code>. Detta är detaljerat i''Bevis för identitet'' processen.
* <code>Signaturer</code>: Medlemmar som författar förslaget. Det kan förbli anonymt om en organisations styrningsregler tillåter det.
* <code>Valsedel</code>: De presenterade alternativen för väljare att delta i detta beslut.
* <code>Budget</code>: Ett valfritt element som kan innehålla låsta pengar i en cryptocurrency-adress som kan utlösa en åtgärd om ett beslut röstas till stöd.
* <code>Tidsrymd</code>: För den slutliga omgången måste en öppen omröstning också sätta sin räckvidd i tid och definiera vilken typ av beslut som fattas. Det finns två typer av beslut:
** <code>Taktisk</code> (begränsad i tiden): Dessa är kontrakt som mottar ''röster'' tills ett slutdatum är uppfyllt, där en given blockhöjd inom blockchain som implementerar ''röst'' smarta kontrakt kan ställas in som slutlinjen för valprocessen. När alla transaktioner har tagits upp och ett slutresultat tas upp, skickas alla tokens tillbaka till motsvarande väljare och kan användas igen vid framtida beslut.
** <code>Strategisk</code> (obegränsad i tiden): Aldrig slutande öppna omröstningar som ständigt registrerar konsensus i ett beslutsland. ''röster'' kan hämtas av väljare vid vilken tidpunkt som helst, om de anser att de behöver avbryta sin röst till stöd eller avslag på beslut. Men så länge som token är tilldelad för att signalera en preferens på en avtalsröstning utan slutdatum, är det en del av det strategiska beslutet. En gemensam användning för strategiska beslut kan vara medlemmarna som röstar för godkännande av andra medlemmar inom en organisations gemenskap.
====2.5.4 <code>Valsedel</code>====
En fråga kan genomföras med valfri omröstning enligt specifikationerna i ''konstitutionellt smarta kontrakt'' av organisationen.Byggstenarna för en omröstning är dess <code>Gränsnitt</code>, <code>Alternativ</code> och <code>Kriteria</code>.
=====2.5.4.1 <code>Gränsnitt</code>=====
Som standard tillhandahåller Sovereign de mest använda valmekanismerna för val av omröstning. Ytterligare innovation på omröstningsgränssnitt uppmuntras.
* <code>EttVal</code>: Ett val.
* <code>FleraVal</code>: En eller flera val.
* [https://en.wikipedia.org/wiki/Cardinal_voting <code>Cardinal</code>]: En given poäng per alternativ med ett fördefinierat värdeområde.
* [https://en.wikipedia.org/wiki/Ranked_voting <code>Ranked</code>]: Sorterbara alternativ som rankad preferens. [https://en.wikipedia.org/wiki/Arrow%27s_impossibility_theorem Arrow's impossibility theorem] måste beaktas för någon innovation avseende rankade omröstningar. Denna ståndpunkt säger att rangbaserade valsystem inte kan tillgodose rättvisa på tre huvudaspekter samtidigt:
** '''Obegränsad domän''': alla valmöjligheter är tillåtna.
** '''Icke-diktatur''': ingen ensamväljare har befogenhet att alltid bestämma sociala preferenser.
** '''Pareto Effektivitet''': Om varje väljare föredrar ett alternativ till en annan, så måste den resulterande samhällsförmånsordningen.
=====2.5.4.2 <code>Alternativ</code>=====
För att möjliggöra informationsbehandling av ''röster'', röstsedlar bära booleanska värden uttryckta i deras alternativ. Detta låter ''röst'' transaktioner signalera ett ''beslutstillstånd'' som ska fungera som en kraftmodellering av institutionella val för genomförandeorganisationen. Detta gör alla decentraliserade organisationer också till programmerbara institutioner. Alternativ kan då vara:
* <code>True</code>: Det kommer att signalera a <code>true</code> booleanskt värde om det är valt (ofta beskrivet med 'Yes' or 'Positive' label strings).
* <code>False</code>: Signalerar ett<code>false</code> state (e.g. can display 'No' or 'Negative' labels).
* <code>Linked</code>: Alternativet är kopplat till ett annat beslut inom organisationen.
* <code>Kandidat</code>: En medlem eller en lista över <code>Members</code> från organisationen. Detta hjälper till att välja myndigheter inom organisationen eller det kan användas för godkännande av medlemskap.
=====2.5.4.3 <code>Kriterier</code>=====
Slutligen räknar metoder för det slutliga eller löpande resultatet av ett beslut inom en organisation.
* <code>Mångfald</code>: Enkel majoritet vinner beslut.
* <code>Majoritet</code> Minsta procentandel krävs för att vinna beslut.
* [https://en.wikipedia.org/wiki/D%27Hondt_method <code>DHont</code>]: Används i stor utsträckning av regionala val baserat på medlemslistor.
* [https://en.wikipedia.org/wiki/Schulze_method <code>Schulze</code>]: Vanligtvis används av open source communities och Pirate Parties med hjälp av rankade valstämplar.
* [http://ilpubs.stanford.edu:8090/422/1/1999-66.pdf <code>PageRank</code>]: Räknar röstviktningsväljarens rykte i en graf.
====2.5.5 <code>Budget</code>====
Varje <code>Organisation</code> kan ha 1 eller flera krypteringsadresser för att finansiera sina ansträngningar. Sovereigns tillstånd att finansiera en <code>Organisation</code> med Bitcoin och i dess <code>Konstitution</code> definiera kriterier för hur dessa tillgångar distribueras bland <code>Medlemmar</code>:
* '''Procentandel för ''Bevis för identitet''''': Sökande <code>Medlemmar</code> kan skicka in sina ''Bevis för identitet'' bevis för att få godkännande av medlemskap till en <code>Organisation</code>. Om ''röster'' godkänna den nya medlemmen, det stärker rykten för en självständig identitet i det öppna nätverket genom att belöna honom eller henne en bestämd mängd Bitcoin för att tillåta hashing ''Bevis för identitet'' på en blockchain. Några <code>Organisationer</code> kan tillåta en större belöning än andra, effektivt skapa ett ryktepoäng som kan skydda nätverket mot ''Sybils'' eller falska identiteter. Denna process är detaljerad på [[#Executive|Section 3]].
* '''Procentandel för <code>Frågor</code>''': <code>Medlemmar</code> försöker använda resurser från <code>Organisation</code> kan begära dem genom att bifoga en <code>Budget</code> till en <code>Fråga</code>. En <code>Medlem</code> kan begära att använda medel från en pool som är speciellt avsedd för detta. Om det slutliga resultatet av ett beslut når ett visst värde (<code>true</code> or <code>false</code>), Det kan sedan genomdriva det slutgiltiga beslutet genom att låsa upp mynt eller utlösa en transaktion som skickar de begärda tillgångarna till en viss adress.
===2.6 Säkerhet.===
Med SovereignVi strävar efter att tillhandahålla ett lätta styrningsramverk som tillåter alla intressenter i en organisation att delta och genomdriva beslut genom användandet av kryptografi. Men det är viktigt att säga att vi inte syftar till ett demokratiskt system baserat på mob-regel eller [https://en.wikipedia.org/wiki/Majoritarianism ''majoritarism'']. Historien erbjuder tillräckliga exempel på hur en blind majoritet kan hamna i en republiks ambitioner, som ofta sätter demagoger i kraft.
[[File:/images/ideal-democracy.png|Ideal democracy.]]
Vårt huvudsyfte är att leverera ett system som kan garantera största möjliga legitimitet samtidigt som vi ger de mest kunniga rösterna i alla samhällen. Skillnaden mellan faktum och löfte är enkel: Medan politiken utgörs av att upprätthålla den fiktion som bygger förtroende för etablerade institutioner (t ex politiker under kampanjer), ger kryptografiska bevis på händelser en mer tillförlitlig metod för tillförlitlig styrning. Blockchain-transaktionernas oförstörbara karaktär ger incitament för människor att inte ligga, varför organisationer som lagrar röster och beslut i dem blir drivna av fakta snarare än löften. Korruption kan bekämpas i sin rots när vi utvecklar en ny känsla av medborgarskap baserat på digitala nätverk.
Likväl kan flytande demokratier spelas på olika sätt med resultat som domineras av de oavsiktliga följderna av två dynamiker som representerar extrema ändamål av deltagande spektrum:
* '''Brist på delegering''' vilket leder till ''polyopoly'': extrem fragmentering av röststyrkan.
* '''Överflöd av delegationer''' vilket leder till ''monopoly'': extrem koncentration av rösträtten.
Varje utfall påverkar en av de två axlar som mäter kvaliteten på demokratisk styrning. Incitamenten till den politiska ekonomins "ekonomisk" ekonomi är utformad för att hålla en stabil jämvikt som syftar till att garantera högsta legitimitet och faktabaserade beslutsfattande.
För att bli en pålitlig miljö för decentraliserad styrning inom stora samhällen (städer, nationer eller globala skalenden) måste suveräna skyddas mot olika typer av angripare: ''Mobs'', ''Corporations'', ''Sybils'', ''Fakes'' and ''Big Brother''.
====2.6.1 Polyopoly.====
<blockquote>
a.k.a. ''Mobs''
</blockquote>
Bland de mest anmärkningsvärda forskningsprojekten på fältet är [http://www.tdcommons.org/cgi/viewcontent.cgi?article=1092&context=dpubs_series Google Votes]. Detta var en intern implementering gjord för Google-anställda ledd av ingenjören Steve Hardt där han skapade en flytande demokratiprofil som skulle användas på den interna versionen av Google+. Projektet hade följande siffror när det gäller påverkan:
* 15,000 deltagare.
* 371 beslut.
* '''3.6% av delegerade röster''' totalt.
Den lilla andelen i delegationer innebär att Google Votes fungerade mer som en direkt demokrati än en flytande demokrati. Delegationer uppträdde mestadels bland de användare som aktivt satsade på att locka till sig dem (t ex veganer i ett lag som hoppades kunna samla makt för att välja kontorsnacks). Risken för få delegationer är att det öppnar demokratin mot de kända riskerna med mobregeln. Även om detta kan hålla hög legitimitet, blir kvaliteten på de beslut som görs av en organisation mer politisk än faktisk. Kunskapsrika röster som kan hantera specifika problem inom ett samhälle blir misslyckade.
För att öka delegationsfrekvensen sker detta varje gång självstyrande blir validerad. På ''Bevis för identitet'' processen (se avsnitt 3), Användarna kan själva skapa egna ''röster'' så länge som deras individualitet blir godkänd av andra identiteter. Även sedan ''röst'' token operationer i en blockchain behöver delegationerna inte nödvändigtvis ske inom den suveräna applikationen: meddelanden, tweets och e-post kan skickas med röstadresser eller QR-koder som är kopplade till dem som gör det möjligt att sända röstetecknen över flera nätverk.
====2.6.2 Monopoly.====
<blockquote>
a.k.a. ''Corporations''
</blockquote>
När den tyska piratpartiet genomförde [https://en.wikipedia.org/wiki/LiquidFeedback Liquid Feedback], en banbrytande likvärdig demokratiprogramvara som utvecklades under 2009, uppnådde den en deltagande nivå av ~550 medlemsförbund som ledde till [http://www.spiegel.de/international/germany/liquid-democracy-web-platform-makes-professor-most-powerful-pirate-a-818683.html en språkvetenskaplig professor blir den mest inflytelserika medlemmen av partiet]. Martin Haase ansvarade för att översätta alla uppladdade propositioner i systemet till ett neutralt språk för att undvika ideologiska bias, så att han kunde fånga 167 delegationer från andra medlemmar.
Konsekvenserna av att ha en monopoliserande ledare i en flytande demokratimiljö går emot andan i ett ekosystem som syftar till att stimulera mer deltagande. I flytande demokratier ''celebrities'' kan bli extremt inflytelserika att kunna attrahera de flesta delegerade rösterna. En angripare som är villig att subvert ett val kan marknadsföra en tv-stjärna som bär en QR-kod för att få en plötslig tillströmning av delegationer från fans och tittare, som omgående blir en monopoliserande kraft. Monopol är ett hot mot flytande demokratier eftersom de kan avskräcka mindre lyckliga väljare att delta, kapning av legitimiteten för de beslut som fattas.
=====2.6.2.1. Kvadratisk omröstning.=====
En nyckelinställning för ett flytande demokratisystem är att tillåta [http://ericposner.com/quadratic-voting/ quadratic voting] för delegationerna. Kostnaden för Alice att delegera röster till Bob ökar exponentiellt desto mer röster får delegeras. Med kvadratiska delegationer kan Alice bara delegera Bob 1, 2, 4, 8, 16 eller ens 128 wllwe 512 ''röster'' men inget värde däremellan. Detta gör delegationsskatt delegatorn genom att minska möjligheten att delegera till en annan medlem. Denna metod hindrar uppkomsten av monopol inom marknadsdynamiken i flytande demokratier, vilket alltid gör deltagandet av alla medlemmar relevanta. Om vissa organisationer önskar en mer vertikal kommandokedja (t.ex. företag) kan kvadratisk röstning fortfarande vara inaktiverad i ''konstitutionellt smarta kontrakt'' i en Sovereign implementation.
====2.6.3 Sybil Attack.====
<blockquote>
a.k.a. ''Identitetsstöld''
</blockquote>
Den som har förmåga att kontrollera väljareens register över valet kan direkt påverka slutresultatet. Ett klassiskt exempel är att registrera avlidna medlemmar i samhället för att rösta i ett val. På decentraliserade nätverk kallas detta vanligen som [https://en.wikipedia.org/wiki/Sybil_attack sybil attack] (ett namn taget från en [https://www.youtube.com/watch?v=8kPIDt3yu1M homonymous 1976 film] based on a character that suffers a multiple personality syndrome). Sybil noder är de som identifierar sig som oberoende aktörer i nätverket medan de alla är under kontroll av en enda operatör. I decentraliserade miljöer är sybilattacker det vanligaste hotet och av den anledningen anser vi att det är oumbärligt att för ''röster'' att beviljas måste de bli validerade genom ett protokoll (social och algoritmisk) som fungerar som ''Bevis för identitet''.
====2.6.4 Fake news.====
<blockquote>
a.k.a. ''Skvaller''
</blockquote>
Det är ingen slump att kampfältet i moderna demokratier ifrågasätts i media. Nyhetsorganisationer har oöverträffad kapacitet att forma väljareuppfattningen. Över olika jurisdiktioner över hela världen leder regeringarna ett internt krig mellan staten och det största lokala mediakonglomeratet. Detta är playbook bakom Donald Trump och hans kamp mot CNN & New York Times tandem; eller anledningen till att Vladimir Putin investerade betydande resurser för att skapa Ryssland idag för att få ett sätt att presentera alternativa fakta. Styrning av meddelandet tenderar att betyda mer än sanningen själv. Fri media och självständig journalistik är ett grundläggande krav för stabila demokratier. Men om bevis på institutionella fakta är svåra att bevisa är rummet för manipulation större än rummet för sanning att råda över. Traditionella institutioner är hemlighetsfulla och saknar öppenhet även om de är offentliga myndigheter. Blockkedjor gör det möjligt att lagra institutionella fakta som garanterar insyn i organisationer. I det här sammanhanget, ''fake news'' kan bekämpas med en ny institutionell modell som kan lagra ''Hårda löften''.
=====2.6.4.1 Hårda löften=====
Korporationer och offentliga institutioner är benägna att utsättas för korruption, eftersom beslut ofta händer i hemlighet bakom stängda dörrar medan bokföring sker över tiden. Effektivt är organisationer ''beslutstvätt'' genom att koppla bort ansvar från besluten. Bristen på en oförstörbar tidslinje som lagrar finansiella och politiska beslut möjliggör en sådan oförklarlighet. De [https://en.wikipedia.org/wiki/Leviathan_(book) ''Leviathan'' State] är en ineffektiv maskin: även om den proklamerar sig som den suveräna linjalen för en given befolkning genom våld, kan den som är ansvarig för att driva sin byråkrati fortfarande vara skadad vilket gör att hela kortets hus faller ifrån varandra. Detta avstånd mellan faktum och redovisning är källan till skvaller.
Institutionernas byggstenar består av fakta som definierar avtal. Men typen av faktaavtal innehåller en mycket specifik typ: Institutionerna är inte byggda med objektiva fakta som är vetenskapliga, mätbara och oberoende av mänsklig bedömning. men snarare inter-subjektiva fakta som bygger den sociala världen i ett samhälle som fastställer relationerna mellan egendom och rättigheter. Till exempel är tanken att varje röd burk av soda tillhör Coca Cola Corporation inte objektiv men ett inter-subjektivt faktum som alla samhällsmedlemmar har enats om och erkänner de immateriella rättigheter som ett företag har över sin produkt. På så sätt bidrar institutionell verklighet till att skala ekonomiska relationer och minska den information som krävs för att organisationer ska kunna handla.
Byråkratierna som skyddar dessa avtal beror på löften, dvs. “alla pengar som hålls i bankerna kommer att finnas där imorgon”. Men som
[https://twitter.com/aantonop/ Andreas Antonopoulos] framhåller: “Vi är vana vid system med mjuka löften och reversibla transaktioner.” Om regeringen (eller någon annan slags central myndighet) ville konfiskera privata medel som lagras i en bank, kan ingen hindra dem från att bryta det löftet. Detta har varit erfarenheterna av grekiska, argentinska, venezuelanska eller portugisiska medborgare med egna misstänkta regeringar under det senaste decenniet. Blockchain-baserade organisationer å andra sidan erbjuder ett alternativ till ''hårda löften'': avtal lagrade i smarta avtal strängt skyddade av kryptografi som ingen enskild tredje part kan korrumpera. Snarare än att reglera mänskligt beteende efter faktum som regeringens lag garanterar blockblocker genom insyn som standard incitament för ärligt beteende eftersom alla deltagare är medvetna om att institutionella händelser kommer att finnas tillgängliga för öppen granskning.
====2.6.5 Squatting.====
<blockquote>
a.k.a. ''Big brother''
</blockquote>
En flytande demokrati fungerar över domäner. Sätta upp en <code>Organisation</code> inom ett nätverk av delegerbara ''röster'' är analog med att spinna upp en server på webben. Domain squatting är övningen av att uppta övergivna eller oanvända webbadresser i förväntan på vinst. Detta har lett till att en miljard dollar marknad har de vanligaste orden (identifierare) som den bästa typen av digitala fastigheter, e.g. [http://sex.com Sex.com] [https://en.wikipedia.org/wiki/Sex.com#Highest_price_paid_for_domain being the highest price paid domain].
I stor skala växer den flytande demokratins spel så småningom kring <code>Taggar</code>används för att beskriva delegationer och frågor. I ett slutet system, den mest använda <code>Taggar</code> peka på ett minskat universum av relevanta väljare som leder delegationerna i samband med dem. Minskat röstdeltagande ökar förutsägelsen för en demokrati, vilket minskar stunderna öppna för kollektivt beslutsfattande. Demokratin trivs så länge som deltagandet är incitiverat. För att förhindra att detta utnyttjas måste finansiella och politiska intressen anpassas. ''Tag squatting'' kan förhindras om taxonomin används för att göra flytande delegationer och problembeskrivningar fungerar i ett öppet nätverk: <code>Taggar</code> hänvisa till <code>Organisations</code> som är registrerade under ett decentraliserat domännamnssystem, med tanke på att varje <code>Organisation</code> behöver ett domännamn. [Blockstack.org Blockstack's blockchain] specialiserar sig på decentraliserade domännamn som för närvarande hanterar över 70,000 Dentralized IDs (DIDs). Dessa erhålls via a ''Proof of Burn'' process där användare bränner Bitcoin i utbyte mot Blockstack-tokens som tillåter registrering av en ny namnrymd.
Ord definierar politiska idéer. Den sociala berättelsen som bygger på politiken består av att bestämma semantisk avsikt. Kraft definierar teatraliska intryck som präglar våra minnen varje gång vi säger ''vänster'', ''höger'', ''fri'' eller ''lika''. Språk är en arvskod som möjliggör ett omfattande mänskligt samarbete och dess dygder kan inte nekas.
----
Alla dessa strategier angriper kärnan i hur en decentraliserad organisation institutionaliserar sig. Med andra ord: definiera riskerna för hur demokrati Jordan fördelar sig ''röster'' till sina medlemmar i blockchain som en decentraliserad enhet. Av denna anledning detaljerar vi på [[#Execution|Section 3]]en utbyggnadsplan för ''röster'' som väcker starka försvar mot dessa slags attacker och banar vägen för en global demokrati.
<div id="Execution"></div>
==3. Uförande.==
[[File:/images/humans.png|Humans on Earth.]]
Ett pressande faktum som ligger till grund för det som ligger bakom de politiska och ekonomiska utmaningarna under 2000-talet är ökningen av befolkningstillväxten: [https://esa.un.org/unpd/wpp/ United Nations uppskattar att år 2100 överträffar världen 10,000,000,000 människor]. Med andra ord: planetens [https://en.wikipedia.org/wiki/Carrying_capacity kapacitet
] kommer att nås i slutet av detta århundrade.
Ledtrådar om riskerna med att rinner ut resurser finns i öarnas kulturella arv. Ett långt bort land som [https://en.wikipedia.org/wiki/History_of_Easter_Island Easter Island] var under det mesta av sin historia ett slutet system som saknade någon kontakt med resten av världen. Dess befolkning hade inga sätt att överleva annat än sina egna resurser, ständigt inför farorna med hungersnöd, epidemier och inbördeskrig. Trots att dessa trängsel verkar långt borta under en globaliserad ekonomi, är den plötsliga ökningen av mänsklig befolkning under det senaste århundradet drivkraften bakom ökad CO <sub>2</sub> nivåer i atmosfären och kollaps av offentlig infrastruktur som inte kan hantera massiva migreringar. Flyktingar flyr över krig som försöker säkra energiresurser för en framtid som snabbt kommer till oss när taktiken för teknisk innovation accelererar. Även om vissa redan har lagt undan planer på plats, inklusive privata ansträngningar för att nå Mars under de kommande årtiondena (liknar den bibliska berättelsen om Noas Ark), måste det akuta samtalet att skydda mänskligheten som helhet både förstärkas och besvaras.
Fördelning av möjligheter och intelligent samarbete över hela världen kan inte uppnås fredligt om inte varje röst blir hörd utan undantag. Global governance är nästa logiska steg i en värld som redan är ansluten via Internet. Blockkedjor leder till möjligheten att likvida styrelse lägger grunden för en demokrati av kamrater. Tillstånd från etablerade medborgare är inte nödvändigt: medborgare överallt i världen kan omfamna denna förändring med suveräna nätverk.
===3.1 Rättigheter mot Skuld.===
<blockquote>
“What is justice?” the philosopher asked.
“Pay your debts and don’t lie” Kefalos (capital), a wealthy arms manufacturer, replied.
</blockquote>
'''Plato''', ''Republic''. Philosopher (428-348 BC).
Även om politik och ekonomi ofta uppfattas som olika världar, lär historien att pengar betyder kraft och makt betyder röster. För att effektivt främja demokratin är det viktigt att ta itu med båda.
Sammanslutningen av skuld, moral och krig förblir roten till samhällets ekonomiska mentala modeller. Mynt skapades först av de stora imperierna för att finansiera krig genom att möjliggöra inköp av bestämmelser för soldater i avlägsna regioner och belöna dem för seger. Soldater kan tjäna silver och guld från erövrade städer och byta sedan efter det som kejsarna myntade mynt med de ädla metallerna för att skapa marknader. Så småningom skulle imperier också begära att en del av dessa mynt skulle ges tillbaka som en skatt som var inriktad på upprätthållandet av armén. Den moraliska berättelsen var att medborgarna var ''skuldsatt'' till kejsaren för deras säkerhet, för att leva. Skulden utvecklades för att motivera någon form av tvång som upprätthåller krafthierarkierna i länder där som helst. Brist på likviditet är den mest påtagliga och omedelbara barriären för frihet som majoriteten av mänskligheten befinner sig i.
En ''röst'' token kommer att distribueras som en '''Rättighet''' motsätter sig den historiska föreningen av '''Skuld'''och moral, som skapar en ny avelsplats för transaktioner som inte bygger på möjligheten till tvång. Det syftar till att ge ekvivalens till transaktionsföretag, återställa balans och rättvisa som den nya moralstandarden. Demokrati Jordens kärnmotivering möjliggör frihet och personlig suveränitet, en möjlighet som endast kan nås om individer kan säga 'nej' och välj ett alternativt order obehandlat och gratis. Detta kan inte uppnås med inducerad brist som det ofta finns i de flesta kryptotillgångar, utan snarare genom garanterad tillgång till ''röster'' att varje medlem av samhället vänder styrningsrättigheter till ett likvida instrument.
Av denna anledning, [http://democracy.earth Democracy Earth Foundation] kommer att generera en ''Initial Rights Offering'' av ''röst'' tokens utformad för att nå alla på jorden under en process som kommer att erbjuda två mekanismer: kryptofinansiering för alla som är villiga att fördela resurser som stärker utvecklingen av en global demokrati med ''röst'' token; och en rättighetsmekanism som ett inbyggt sätt att få ''röst'' tokens av någon kunna ''mine'' hans eller hennes motsvarande andel av ''röster'' genom en ''Bevis av identitet'' process.
====3.1.1 Initialt rättighetserbjudande.====
Identitet är grunden till personlig suveränitet och kärnan i alla röstsystem. Röster (på vilket system som helst) är giltiga om och endast om medlemskap är verifierat inom en organisation, kan ingen demokrati köra på skadade identiteter. Dagens standardidentitetssystem bygger på centrala myndigheter som tvingar användarna att dela privat information och riskerar identitetsstöld om de blir hackade. Precedents inkluderar [https://gov.uk United Kingdom's Gov.UK] and [https://uidai.gov.in/ India’s Aadhaar],båda som har plågats av rapporter om felaktig säkerhetspraxis som inkluderade läckage äventyrar miljontals integritet.
För att identiteter ska vara självständiga kan de inte ägas eller kontrolleras av regeringar, organisationer eller företag som i sista hand har en prioritet att utvinna värde från sina användare. Vårt tillvägagångssätt med [http://sovereign.software Sovereign] är att det är organisationscentrerat som en teknik, men en organisation kan bli decentraliserad om dess identitetsverifieringsprocess saknar behovet av en auktoritet. I slutändan är varje process som är beroende av decentraliserad identitet en del av en global commons eftersom principen om en självständig identitet gör någon ''Big Brother'' irrelevant. Därför är nyckeln till att bibehålla värdet av ''röst'' token som ett medel för en gränslös demokrati är att effektivt validera alla deltagande identiteter genom en decentraliserad process som kan skapa, uppdatera eller återkalla nycklar. Så här kommer demokratijorden att ge tillgång till ''röster'' som en mänsklig rättighet.
[[File:/images/identity-blockchain.png|Self-sovereign Identity.]]
Vem som helst kan visa sin egen identitet under ett decentraliserat protokoll som kallas ''Bevis av identitet'' (POI) kan fungera med motsvarande andel av ''röster''. Denna mekanism kommer att utlösa en allokering över tiden i den angivna offentliga adressen till identiteten som är tillgänglig via en självhävd plånbok som är kopplad till innehållet och data som används för POI. Om det är tillräckligt ''röster'' validera bevis som används för ''Bevis av identitet'', plånboken befriar en motsvarande mängd av ''röster'' följer reglerna i ''Universal Basic Income'' dynamisk som allokerar tokens hela tiden med hjälp av Bitcoin blockchain som en universell klocka.
===3.2 Bevis av identitet.===
En självständig identitet måste frivilligt genereras av en användare som hävdar det. För detta ändamål måste användaren sända ett bevis på sin identitet som strikt uppfyller kriterier som kan uppfyllas av mänsklig bedömning och kan förhindra en artificiell intelligens från att störa processen. Därför ska beviset vara i ett format som kräver en stor mängd cerebral bandbredd: video. Ett tillfredsställande bevis ska uppfylla alla dessa egenskaper:
* '''Oföränderlig''': Videofilen måste skyddas mot eventuella ändringar när den har använts som en källa för bevis.
* '''Singular''': Thans bevis ska validera en enskild identitet utan att tillåta duplicerade deltagare i nätverket (''replikanter'').
* '''Ansedd''': <code>Organisationer</code> som gör validering av en POI fäster sitt rykte på den beprövade identiteten med dess signatur.
Trots att ett digitalt styrsystem kan dra nytta av det förtroende som redan finns i befintliga nätverk som validerar identiteter (dvs. nationstater), tjänar ett decentraliserat protokoll för att validera identiteter det politiska syftet med personlig suveränitet. Fördelarna med denna offentliga post i en nätverksbaserad commons kan så småningom användas av regeringar eller privata organisationer på olika sätt (t. Ex. Verifiering av ålder eller nationalitet). Här föreslår vi en ny metod för att validera identiteter utan att behöva en enda ''Big Brother''.
En ''Bevis av identitet'' löper ut efter en viss tid för att förhindra Sybil-attacker och se till att endast levande användare deltar i nätverket. För att upprätthålla validiteten hos det offentliga-privata nyckelparet föreslår vi att en period på 1 år är tillräcklig för att skapa ett nytt bevis som uppdaterar den tidigare. På samma sätt som fysiska identiteter kontrolleras genom att jämföra bild till person, måste användarna återskapa deras ''Bevis för identitet'' och sända den för verifiering för att verifiera sin legitimitet. I år kan perioden hänvisas till sammanträdet som ''blockbirth'' av en individ och, om så önskas, firas årligen på samma sätt som nationer firar sin självständighetsdag. Eftersom nyfödda barn är registrerade under denna globala jurisdiktion, ''blockbirths'' get synced with birth dates and will be able to incorruptibly attest for age as well gradually reducing the work of authenticators over time.
====3.2.1 Demo.====
[[File:/images/roma-siri-blockchain-baby.png|Roma Siri's blockchain birth certificate.]]
Det finns ett prejudikat som hjälper till att illustrera hur en ''Bevis av identitet'' fungerar. [https://youtu.be/Irc-VMuUs3c?t=55m20s Enligt NYU professor David Yermack], nyfödda Roma Siri blev den första bebisen att ha ett blockchain giltigt födelseintyg på November 7, 2015. Processen, även om den symboliska den tiden bestod av [https://www.dropbox.com/s/tsi4xo4k6j1jsa6/Blockchain%20Birth%20Certificate%20of%20Roma%20Siri%20-%20Daughter%20of%20Santiago%20Siri%20%28father%29%20and%20Pia%20Mancini%20%28mother%29.MOV?dl=0 en video som visar bebisen Roma som beskrev hennes vitala tecken och inkluderade vittnen om hennes födelse]. När videon filmade, genererades en kryptografisk hash av den digitala filen och kodades in i en Bitcoin-transaktion. Det betyder att oavsett var videon lagras kan den permanenta posten av sin hash på Bitcoin blockchain verifiera att filens data inte var korrumperad och att den existerade när beviset genererades. Med detta oupphörliga bevis blev Roma en blockchain-certifierad global medborgare.
Denna demo fungerar som ett exempel på de steg som måste följas för en decentraliserad ''Bevis av identitet'':
# '''Film bevis''' använder någon tillgänglig smartphone eller kamera.
# '''Hash bevis''' på en blockchain för att garantera obestridlighet av bevis.
# '''Bekräfta bevis''' genom en omröstningsprocess bland kamrater (''Attention Mining'').
====3.2.2 Film bevis.====
Ett bevis kan göras med någon inspelningsansökan så länge den uppfyller kraven i protokollet. En förlängning inte längre än 3 minuter rekommenderas för videon. I det måste användaren följa en serie skriftliga steg för att hjälpa validerare att döma med sin uppmärksamhet:
# '''Ansikte''': Under frontljuset, filmfrontalsexpression (som när man tar en ''selfie'') och varje sida av huvudet utan att ha på sig glasögon, hattar, smink eller masker av något slag.
# '''Namn''': Säg högt följande indikatorer:
## Fullt namn (språkbaserad identitet).
## Fullt efternamn (blod-baserad identitet, dessutom kan det ange information om mor och pappa).
## Nationalitet (territoriell-baserad identitet, det kan innefatta bostadsort eller skattemyndighet).
## Alternativt kan användaren använda ett smeknamn om det är en mer vanlig pekare för sig själv.
# '''Biometrics''' (Optional): Säg högt eller visa på ett tillförlitligt sätt någon av dessa indikatorer. Detta kan vara användbart för specifika användningsfall som födelsecertifikat.
## Födelsedag (dag, månad och år).
## Höjd (tum eller centimeter).
## Vikt (gram eller kilo).
## Kön (man, kvinna, etc).
# '''Vittnen''' (Optional): Tidigare validerade identiteter kan fungera som vittnen för denna identitet. De kan vara fysiskt placerade och visas i videon med fullständiga namn och offentliga nycklar för att stödja en ny identitet.
## Vittnen kan få rätt att återkalla, uppdatera eller annullera detta bevis (t ex vid förlust av privata nycklar eller biologisk död).
## Tvillingar. De som har en tvillingbror eller syster måste ange detta för att förhindra att flagga som en replikant under verifieringsprocessen.
## Certifieringar. Trots att detta skulle falla tillbaka till centralmyndigheten kan äldre rykte från utgivna dokument hjälpa till att göra en videosäkerhet lättare att lita på. Detta kan innehålla ett födelsecertifikat, körkort eller ett nationellt ID så länge det inte innehåller någon känslig information (t.ex. med ett socialt säkerhetsnummer i USA).
# '''Deklaration''': För att garantera att den person som genererar sitt identitetsbevis är medveten om de rättigheter han kommer att få efter att ha godkänt sitt medlemskap i nätverket och inte tvingas av en osynlig angripare, är det obligatoriskt att göra en självständighetsförklaring som också innehåller en ed om de angivna fakta: <blockquote> Jag, (Personligt namn), intygar att jag gör den här videon i enlighet med min personliga suveränitet som jordens medborgare och alla uttalanden som görs är sanna. Jag kommer att vara ensam användare av alla ''röster'' tilldelas på uppdrag av detta bevis och jag agerar utan hot eller tvång mot min fria vilja.</blockquote>
# '''Public Key''': En adress där ''röster'' kommer att tilldelas om identiteten är validerad. Detta kommer att vara [https://github.com/WebOfTrustInfo/ID2020DesignWorkshop/blob/master/topics-and-advance-readings/DID-Whitepaper.md Decentraliserad Identifierare (DID)] som pekar på den här användaren. Om den här identiteten så småningom röstas som skadad eller användaren (eller något listat vittne) återkallar det, då den tilldelade ''röster'' kommer att bli ogiltig för framtida användning.
# '''Timestamp''': Den aktuella blockhöjden för blockchain som används för att hacka den här videon för att förhindra att videoklipp inte är relaterade till det aktuella ögonblicket, blir intressepunktet genererat för att användas som bevis. En manuell tidstämpel kan helt enkelt filma skärmen av en blockchain explorer-applikation som visar det sista blocknumret och den hash som motsvarar den. Eftersom det här kan vara komplicerat för de flesta användare, kan appar som är utformade för att generera detta bevis automatiskt lägga till det här innehållet i videon. Den här informationen när beviset är hashed med en blockchain-transaktion kommer att bekräfta att videon inte modifierades på något sätt av tredje part efter det att det sändes till nätverket.
Trots att denna process kan vara mer komplex än den genomsnittliga anmälningsblanketten som finns i de flesta tillämpningar är det viktigt att påstå att det också är en politisk handling som förklarar oberoende från myndigheter av något slag. Denna video är det personliga manifest som någon kan göra för att bryta sig undan tvång och ett steg mot en gränslös demokrati.
====3.2.3 Hashing.====
När den digitala filen med det självförsörjande beviset har genererats, en [https://en.wikipedia.org/wiki/Cryptographic_hash_function cryptographic hash function] tillämpas på det beräknas. Följande steg i genomförandet gjord av Manuel Araoz och Esteban Ordano med [https://proofofexistence.com ProofofExistence.com], a standard [https://en.wikipedia.org/wiki/SHA-2 SHA-256] digest is recommended. När en hash har genererats kan den kodas i en Bitcoin-transaktion med hjälp av ett [https://en.bitcoin.it/wiki/OP_RETURN OP_RETURN] script som också innehåller en markör som hjälper till att spåra identitetsrelaterade bevis. Vi föreslår att du använder "IDPROOF" (0x494450524f4f46) för det här användningsfallet.
Med tanke på att en genomsnittlig bitcointransaktion består av 226 byte med en miningavgift per augusti 2017 vid 27 120 satoshis är kostnaden för att ha ett bevis direkt på blockchain på $ 1 per bevis. Detta kan vara relativt dyrt för en majoritet av människor, därför rekommenderar vi att skala denna process genom att möjliggöra [https://github.com/aantonop/chainpoint Chainpoint] implementering kan lagra upp till 10 000 bevis per transaktion genom att lägga in hashed-data på en [https://en.wikipedia.org/wiki/Merkle_tree Merkle Tree] och kodar Merkle-roten i OP_RETURN-skriptet istället. Detta kommer också att avsevärt minska minneskraven för Bitcoin blockchain, en offentlig resurs som inte får missbrukas. Alternativt kan virtuella kedjor som körs ovanpå Bitcoin blockchain som fokuserar på identitet och namnområden, t.ex. [http://blockstack.org Blockstack] kan användas för att tillgodose detta användarfall och hanteringen av det privata offentliga nyckelparet.
Alla bevis som går igenom denna process i ett digitalt sammanhang garanteras inte på något sätt skadas. De digitala filer som används som bevis kan lagras var som helst, kopieras utan begränsningar eller till och med förvaras i hemlighet utan att dela den med någon. Så länge det finns en transaktion i blockchain som kan validera den kodade hasen med data i den digitala filen, är beviset giltigt. Bitcoin blockchain erbjuder det starkaste motståndet mot korruption, eftersom den har den största mängden hashkraft i världen som skyddar sin infrastruktur. Med denna mekanism på plats kan Bitcoin blockchain fungera som ett decentraliserat index över självständiga identiteter. Att utnyttja denna kapacitet kommer bara att göra byråkratin för en gränslös demokrati starkare än någon annan regering på jorden.
====3.2.4 Attention Mining.====
<blockquote>
In the blockchain nobody knows you are an AI.
</blockquote>
'''Satoshi Nakamoto'''.
[[File:/images/proof-of-identity.png|Proof of Identity.]]
I datorrumsidentiteter är ingenting annat än pekare: algoritmer saknar medvetenhet om de mönster de är utbildade att känna igen. Identiteter hör strikt till det mänskliga riket (dvs endast en person kan känna igen en annan person). Så snarare än att utnyttja ''distribuerad datorkraft'' att verifiera transaktioner som det händer med de flesta kryptovalutor, ''röster'' använder ''distributed attention power'' för att verifiera självgenererade identitetsbevis. Denna uppmärksamhet tas in av mänskliga deltagare som fungerar som validerare.
Ett välkänt prejudikat för attention mining är CAPTCHA-tester som ofta finns i inloggningen av webbplatser med hög trafik. CAPTCHA är en akronym för ''Helt automatiserat Public Turing-test för att berätta för Datorer och Människor''. Dessa består av enkla visioner som kan utföras av en människa lättare än av en dator. Ett fält [https://www.cs.cmu.edu/~biglou/reCAPTCHA_Science.pdf pioneered by researcher Louis Von Ahn], han använde denna teknik för att hjälpa till att bygga dataset som kan träna maskininlärningsalgoritmer för att läsa ord skrivna på papper. Som en Google-ingenjör skapade Von Ahn ett enkelt test fördelat på alla inloggningssidor som visade två ord som erhölls från skannade bilder. En användare skulle skriva båda orden i ett textfält för att bevisa att han är mänsklig och inte en maskin. Systemet visste redan innebörden av det första ordet (därmed validering av användaren är mänsklig) men det blev utbildat med den andra ingången eftersom den använde denna information i datasetet för teckenigenkänningsalgoritmer. Denna enkla övning har utökats för att träna alla typer av system för mönsterigenkänning och det bidrog till säkerheten för webbplatser, vilket hindrar bots (och botnets) från att intrångas.
Uppmärksamhet kan också validera mänskliga identiteter i ett decentraliserat nätverk, analogt med [https://bitcoin.com/bitcoin.pdf Bitcoin's Proof of Work algorithm (POW)] Används av gruvdriftnoden till tidstämpel-peer-to-peer-transaktioner. I Bitcoin genererar varje gruvarbetare sin egen blockchain-kompatibla proof hash för ett nytt block av transaktioner och sänder det till nätverket. Om 51% av noderna i nätverket accepterar det verifierade blocket, blir det kedjat till blockchain och gruvarbetaren börjar arbeta på nästa transaktionsblock med hjälp av det accepterade blocket som föregående hash. Denna teknik möjliggör monetära transaktioner utan centralbanker. I en demokrati utan centrala regeringar istället för att verifiera krypterade block, tjänar mänsklig uppmärksamhet syftet att rösta på självgenererade identiteter för att ge dem ''röster'' som till sist kan användas för nya verifieringar.
Huvuddelen av forskningen om hur man förhindrar sybilattacker (identitetsförfalskning i peer-to-peer-nätverk) kretsar kring att enheter som krävs för att utföra en uppgift som en sybilattacker inte skulle kunna utföra. Uppmärksamhet gruvdrift kräver validatorer att observera vissa aspekter av ''Bevis av identitet'' videos som bara en person kan känna igen. För att kunna ha en mekanism som förhindrar bots kan systemet skapa modifierade videor för att inducera attacker till fel. Dessa snedvridningar kan skapas genom att beskära vissa sektioner ur en video, blanda den med andra eller snedvrida rösterna för att fungera som en videoversion av ett CAPTCHA-test som syftar till att säkert skilja mellan riktiga mänskliga validatorer och botnät.
====3.2.5 Little Brothers.====
<blockquote>
Who watches the watchmen?
</blockquote>
[https://en.wikipedia.org/wiki/Watchmen '''''Watchmen'''''], graphic novel (1987).
Self-sovereign identiteter kan värderas på två viktiga aspekter som hjälper till att definiera deras rätt att delta i nätverket:
* '''Rykte''': En social indikator på att en viss identitet är att lita på.
* '''Singularitet''': En individuell indikator som certifierar en identitet är unik kopplad till en enda person.
Någon i nätverket kan delta för att verifiera nya självhärskare för att säkra en global demokrati mot hotet om ''Big Brother''. Denna uppgift utförs effektivt när en <code>Organisation</code> beslutar att godkänna en ny <code>Medlem</code>. Genom att utnyttja fördelad uppmärksamhet över flera <code>Organisationer</code> i stället för en all-observing central power, är validatorer i själva verket en armé av [http://groups.csail.mit.edu/mac/classes/6.805/articles/crypto/cypherpunks/little-brother.txt little brothers] vem kan samarbeta med en självständig identitet i nätverket. ''Little brothers'' kan överträffa centraliserade identitetsleverantörer när det gäller noggrannhet eftersom de ständigt stimuleras för att upprätthålla legitimiteten inom nätverket för att hålla ''röster'' som en värdefull tillgång: nätverkets framgång vid detektering ''replikanter''(duplicerade identiteter) bestämmer bristen på '' röst'-token. Legitimiteten för någon demokrati är baserad på upprätthållandet av ett riktigt väljareregister.
=====3.2.5.1 Rykte.=====
Intresset att effektivt validera ett ''Bevis av identitet'' finns bland <code>Organisationer</code> Det måste handla om sökandes identiteter som är villiga att bli <code>Medlemmar</code> kunna använda sina ''röster'' för besluten relaterade till enheten. De som inom en <code>Organisation</code> har rätten att godkänna nya medlemmar äntligen bidra med rykte en <code>Organisation</code> har den sökande identiteten om den är godkänd.
Anmälan av anseende från en <code>Organisation</code> till en godkänd <code>Medlem</code> som tillämpas med dess POI görs genom att helt enkelt underteckna den godkända POI för att intyga att en identitet är giltig <code>Medlem</code>. Medlemskap som är kopplade till en identitet i nätverket kan tolkas av framtida validerare på andra <code>Organisations</code> på vilket som helst önskat sätt. <code>Organisationer</code> i nätverket kan vara så liten som en familj eller så stor som ett multinationellt företag, men i slutändan är de <code>domäner</code> i ett nätverk som kan likna <code>Taggar</code> beskriver attributen för en identitet. Några <code>Organisationer</code> kan existera för mycket specifika kontroller, e.g. an <code>Organisationer</code> under en ''legal.age'' domän som bara verifierar om en POI hör till någon äldre än 18 år som gör något godkänt <code>Medlem</code> av en sådan enhet har en giltig ''legal.age'' signatur på dess POI.
Rykte på en <code>Organisation</code> kan mätas på hur ofta de slutar tillåta [https://en.wikipedia.org/wiki/Replicant ''replikanter''] som <code>Medlemmar</code>. Med andra ord: <code>Organisationer</code> som misslyckas på ''Singularity score'' som används för att värdera individernas individualitet i nätverket, blir mindre trovärdiga än de som effektivt kan inkludera suveräna individer.
=====3.2.5.2 Replikanter.=====
Även om regeringar måste verifiera släktträdet till en potentiell ny medborgare och traditionella företag måste lita på [https://en.wikipedia.org/wiki/Know_your_customer ''Know Your Customer''] praxis (KYC) för att dra en linje mellan sina kunder och resten av världen; En global demokrati har ingen anledning att skapa en skillnad mellan ''oss och dem''. Målet med Democracy Earth Foundation är att skala upp rätten att använda ''röster'' till varje enskild människa: vi är alla ''oss'' (eller ''dem''). Därför den övergripande utmaningen för en framgångsrik decentraliserad ''Bevis av identitet'' dynamiken är att helt enkelt fokusera på att använda den tillgängliga uppmärksamheten i nätverket för att kontrollera ''replikanter'' som begär en andel ''röster''.
''Replikanter'' är identiteter som får ''röster''som duplikat, obehörigt hävdar mer ''röster'' än de förtjänar. Fake POIs kommer sannolikt att hända genom att använda moderna tekniker för 3D-rendering som syftar till att lura det mänskliga ögat (t ex att slå på [https://en.wikipedia.org/wiki/Uncanny_valley uncanny valley] av allmän uppfattning), men det är ett säkert antagande att överväga det[http://www.cv-foundation.org/openaccess/content_cvpr_2014/papers/Taigman_DeepFace_Closing_the_2014_CVPR_paper.pdf Människor kan känna igen ansikten med 98% av noggrannheten] medan [http://www.washington.edu/news/2016/06/23/how-well-do-facial-recognition-algorithms-cope-with-a-million-strangers/ Kapaciteten hos algoritmiska system minskar när den skalas]. Med tanke på att gränsen dras är mellan människor och konstgjorda intelligenser är det vi använder termen ''replikant'' som myntades 1982 i filmen ''Blade Runner'' hänvisar till androider som kan simulera att vara riktiga människor.
=====3.2.5.3 Singularity Score.=====
Att bekräfta en identitet är giltig, verifierare utsätts för två samtidiga POI-videor som kan väljas slumpmässigt från alla indexerade och hashed-videon som finns i blockchain. En ansiktsmatchningsalgoritm som söker likheter mellan ansiktsuttryck kan användas för att optimera testet. Validatorer måste använda ''röster'' att komma överens om huruvida dessa POI-videor hör till samma person eller ej, vilket är det fortsatta resultatet av detta beslut ett ''Singularity score'' för identiteten.
Valideringsprocessen är densamma som i varje suverän röstdynamik: Validatorer kan godkänna genom att lägga en ''röst'' som inkluderar en <code>Röstsedel</code>med en <code>true</code> checked <code>Option</code> on it. Annars måste de lägga en ''vote'' i avvisning med en <code>false</code> checked <code>Option</code>. Alla POI-relaterade beslut är <code>Strategiska</code>: utan slutdatum när tilldelat ''röster'' inverkan i realtid. En validerare kan när som helst åsidosätta ''röst'' värde om det har funnit bevis som ändrar tidigare dom. Också ''röster'' validering av en intressepunkt kan tas bort om identiteten redan har inmatning från tillräckliga validatorer som gör tilldelning av ytterligare ''röster'' redundant.Som med alla suveräna beslut kommer slutresultatet av en POI-relaterad omröstning att hamna på antingen en <code>true</code> or <code>false</code> value. Den som slutar med att bli röstad som en ''replikant''kommer att se hans eller hennes beviljade ''röster'' ej giltiga.
Det <code>Kriteria</code> som används för''Singularity score'' är också föremål för omröstning av varje validerad POI som deltar i nätverket. Demokratierna är alltid ett pågående arbete, ständigt självkorrigerande med en återkopplingsslinga som definierar hur observatörerna observeras. Den tröskel som fastställer den suveräna rätten till ''röst'' måste ständigt anpassa sig till den exponentiella tillväxten av beräkningskapacitet som kan riskera att subverta nätverket. Genom att backas upp med ett decentraliserat identitetsindex med hjälp av en oförgänglig blockchain som upprätthålls med distribuerad uppmärksamhet (dvs en öppen ansiktsbok) ''röst'' token blir en pålitlig enhet för att en digital demokrati ska komma överallt. Att tilldela uppmärksamhet för att säkra nätet ger inte bara medvetandet till ett system som är förblindat för artificiell intelligens, utan ger även deltagarna möjlighet att äga sina identiteter utan att tvingas av en centraliserad kraft som kan tjäna pengar på det utan samtycke. Bevislig uppmärksamhet måste alltid sättas i tjänst för att stärka en global demokrati eftersom det bara är i mänsklig medvetenhet att vi kan definiera vad det innebär att vara mänsklig.
===3.3 Universal Basic Income.===
<blockquote>
Now is the time to make real the promise of democracy.
</blockquote>
'''Martin Luther King Jr.''', Minister and activist (1929-1968).
Förmågan att utveckla en pålitlig self-sovereign Identitetsvalideringsprocessen garanterar inte bara det legitima värdet för ''röster'' att uttrycka socialt val men också etablera berget för den infrastruktur som krävs för att göra en ''Universal Basic Income'' (UBI) mekanism som kan nå alla på jorden. Det symbiotiska förhållandet mellan UBI och demokrati har varit väl underbyggt. Enligt forskning som presenterades vid Basic Income Earth Network (München september 2012), genomförandet av grundinkomst [http://basicincome.org/bien/pdf/munich2012/Choi.pdf kan i hög grad bidra till att förverkliga principerna om demokrati och inrättandet av dess betydelsefulla grund]. Därför för att konsolidera den politiska och ekonomiska logiken som kan skapa en gränslös demokrati, en gång ett ''Bevis av identitet'' Valideras av peers distribueringsmekanismen utlöses för ''röster'' kommer att baseras på tid som en UBI.
Tiden är en värdefull och begränsad tillgång, som därför kan omsättas. Man kan inte köpa, hyra eller hyra mer tid: det har en oelastisk tillgång oavsett hur hög efterfrågan är. [https://books.google.com/books?id=sjlVAAAAcAAJ&pg=PA5&lpg=PA5&dq=what+is+money+man%27s+birthright+time&source=bl&ots=uxfZPDT94J&sig=gWf_LpHeEA-g6ukveZ1-mQI3FE4&hl=es&sa=X&ved=0ahUKEwjgyuHR2ejVAhUK7iYKHUX0AzgQ6AEILjAB#v=onepage&q=what%20is%20money%20man's%20birthright%20time&f=false Tiden är den enda värdet av värdet för att testa all arbetskraft, antingen manuell eller mental, utförs av män och kvinnor]. Och genom att ange tid och använda den som grund för fördelning ''röster'', det likviderar en besittning som varje medlem av en global demokrati har på lika villkor. Likviditet är ett krav på någon demokrati som syftar till att undvika tvång: röster måste kunna höras för att räkna och genom att bevilja ''röster''som en UBI slår vi på att leverera en mänsklig rättighet som effektivt kan bemyndiga individer som måste möta de kommande utmaningarna för automatisering. ''Röster'' beviljas genom tiden som en rätt undviker [https://en.wikipedia.org/wiki/Tragedy_of_the_commons ''tragedy of the commons''] medan det ligger till grund för en styrningsmodell som går utöver skuld och nationstater.
En self-sovereign kan då erhålla ''röster'' på tre olika sätt:
* '''Delegering''': <code>Medlemmar</code> inom en <code>Organisation</code> fungerar som en flytande demokrati kan få delegerade ''röster''.
* '''Tilldelning''': <code>Organisationer</code> kan tilldela ''röster'' till nya deltagare på sina egna villkor. Deltagare kan skapa eller finansiera <code>Organisationer</code> som använder sina egna ''röster''.
* '''Droppa''': När ett ''Bevis av identitet'' blir giltigt, ''röster'' börja droppa in i användarens plånbok över tiden.
====3.3.1 Droppning.====
Den hastighet vid vilken 1 ''röst'' droppas till en verifierad identitet synkroniseras med Bitcoin blockchain. Genom att använda Bitcoins synkroniseringsmekanism som klocka sätter en ofäränderligt konsensus rytmen för hela nätverket. Bitcoin kedjar ett nytt block till blockchain var 10: e minut, vilket innebär att
1 timme = 6 blocks
Antag att den tjänade tiden över hela världen bygger på 8 timmars arbetsdagar,
8 timmar per dag x 5 dagar per vecka x 52 veckor per år = 2,080 timmar per år
Eller i block tid,
2,080 timmar = 12,480 blocks
Och med tanke på att det fastställdes enighet om [https://medium.com/economicsecproj/how-to-reform-welfare-and-taxes-to-provide-every-american-citizen-with-a-basic-income-bc67d3f4c2b8 en ideell grundinkomst är i genomsnitt cirka 10% av en individs intäkter] vi kan definiera det,
10% Intjänad årlig grundinkomst = 208 timmar per år = 1 248 block
Det betyder att de 52.560 blocken som registrerar ett helt verksamhetsår på Bitcoins blockchain, ska totalt 1 248 block redovisas för att belöna en UBI per år. Att synkronisera ''röst'' droppar med Bitcoin som en UBI-mekanism baserad på 10% vinst för varje arbetstid, 1 full enhet av a ''röst'' token ska droppa var ~ 42 timmar (eller ~ 252 block). För att garantera en möjlig delbarhet av ''röst'' token så det kan droppas några sekunder (medan det blir lättare för tolkning av människor och maskiner) ställer vi dropphastigheten på,
1 röst = 250 block
Så får alla giltiga POI totalt:
210 röster per år
[[File:/images/proof-of-identity-dripping.png|Dripping mechanism for mined votes.]]
Därför med beaktande av följande variabler:
* T = Nuvarande blockhöjd (i.e. aktuell tid).
* r = En konstant för ''röst'' fördelningsgrad, ställd till 1 röst varje 250 block i tid.
* Pᵢ = Ett ''Bevis av identitet'' block innehållande dess motsvarande hash för en given identitet (i).
* Sᵢ = ''Singularity score'' uttryckt som <code>true</code> or <code>false</code> Ange för en given identitet (i).
* Vᵢ = Total mängd av ''votes'' för en viss identitet (i).
Sedan ''röst'' en self-sovereign identitet får användas i systemet kan beräknas på vilken nod som helst som kör ett smart kontrakt med formeln:
[[File:/images/ubi-vote-formula.png|Vᵢ = ((T - Pᵢ) / r) * Sᵢ]]
Så länge som ''Proof of Identity'' har validerats av gemenskapen och ett smart kontrakt synkroniseras med en aktiv blockchain-nod, kommer värdet av Vᵢ antingen att vara ett tal som definierar den totala mängden ''röster'' en self-sovereign har rätt att använda på en värdplånbok eller, om POI avvisas (i.e. Sᵢ = <code>false</code>), då blir deltagarens tillgängliga röster noll.
====3.3.2 Jämlikhet====
Den beskrivna droppdynamiken hamnar till nytta av tidiga adoptrar, vilket ofta är fallet med finansinriktade kryptokurvor. Bitcoin till exempel beskrivs ofta som ''cryptographically induced scarcity'' eftersom det är ett instrument som kan mäta förmögenhet när det gäller ekonomiska resurser på grund av sin tokens fasta brist. Men med ''röst'' token Vi bygger ett nätverk av annan natur som syftar till att komplettera finansiella cryptocurrency genom att ha styrning som ett mål. Genom att utfärda ''röster'' som en rättighet som kan beviljas någon så länge som hans eller hennes singular identitet bevisas, ''röst''verkar som politisk klagomål. Så i huvudsak handlar vår strategi om ''cryptographically induced equality'': Det här är grunden för någon verklig demokrati. Av denna anledning introducerar vi en annan variabel till dess ''Universal Basic Income'' dynamik,
* E = Mängd av ''röster'' tilldelad till ''Genesis Identity'' för närvarande blockhöjd (T).
Vi hänvisar till ''Genesis Identity'' som den allra första ''Bevis av identitet'' som godkänns av nätverket. Med den här informationen börjar den nästa validerade identiteten inte nackdelen: den kommer att ha en plånbok med samma mängd ''röster'' än den första deltagaren i nätverket har för närvarande. Eftersom denna regel gäller för varje deltagare garanterar den ''Jämlikhet'' i fråga om deltagande låta alla ha samma mängd suveräna ''röster'' än alla andra, förlängning av UBI-formeln enligt följande:
[[File:/images/ubi-equality-formula.png|Vᵢ = (E + ((T - Pᵢ) / r)) * Sᵢ]]
Med ''Jämlikhet'' variabel, om en andra deltagare Bob fick validerad 1500 blocks efter en första Alice börjar han inte med 0 ''röster'' men snarare få ett initialt belopp som matchar Alice s nuvarande balans (i.e. med en hastighet av 1 ''röst'' per 250 block, det är totalt 6 ''röster''). Bob kommer fortsätta att få ''röster'' droppade på lika villkor med Alice-blocket efter blocket efter det. Om en tredje deltagare Charlie genererar en giltig ''Bevis av identitet'' 1000 block senare, han börjar med motsvarande mängd ''röster'' som Alice och Bob var och en har för närvarande också (dvs totalt 10 ''röster'' var). Med denna inflationsprocess som belönar varje ny deltagare (utspädning av alla befintliga) är alla garanterade en ''jämlik'' andel i nätverkets övergripande deltagande rättigheter. Så länge som ''replikanter'' blir framgångsrikt förbjudna, ''röst'' nätverket är en genuin demokratisk global commons.
[[File:/images/chart-votes-coins-time.png|Vote emission and inflation rate.]]
Även om inflationstakten i början kan verka för aggressiv, är det totala utbudet av ''röster'' är fortfarande inställd på ett maximalt lock baserat på antalet deltagare i nätverket. Som fler deltagare engagerar tenderar den totala inflationen att begränsa 0% sedan nya ''röster'' har minskat inflytande i ekonomin som helhet. I jämförelse med uncapped ''likes'' och ''retweets'' i andra sociala applikationer måste det noteras att från individens subjektivitet tilldelningen av ''röster'' är fortfarande ett beslut baserat på en begränsad resurs som innebär möjlighetskostnader, vilket tvingar ett mer rationellt beteende i stället för impulsiv likhet (dvs trolling).
====3.3.3 Nakamoto Coefficient====
Betydande ansträngningar för att kvantifiera decentralisering görs, inklusive Balaji Srinivasan's arbete med att upprätta en [https://news.21.co/quantifying-decentralization-e39db233c28e ''Nakamoto Coefficient''] definierad som:
<blockquote>
The minimum number of entities in a given subsystem required to get to 51% of the total capacity.
</blockquote>
Betydelsen av att mäta decentralisering är beroende av att hitta en metrik som kan certifiera ett nätverks förmåga att vara censurbeständigt, vilket är en grundläggande egenskap för självhäftiga valutor som Bitcoin. Men i sista hand måste frågan om vem som har kontroll över de enheter som kör ett nätverkssystem tas upp också. Genom att upprätta ett referensnätverk som garanterar en jämlik fördelning av dess token baserat på en ''Bevis av identitet'' mekanism utformad för att förhindra ''replikanter'', Detta ger ett nytt perspektiv som kan bidra till att öka upplösningen av Nakamoto-koefficienten med hjälp av urskiljbar lika tillgång.
Genom att garantera en lika utgångspunkt för varje deltagare, oavsett vilken tid de bestämmer sig för att ansluta sig till nätverket ''röst'' nätverket fungerar som en genuin meritokrati. Det föreslagna ''Jämlikhet'' variabel är helt enkelt en regel för att upprätta en startpunkt och inte på något sätt en permanent pålägg: när som helst, vilken som helst self-sovereign får antingen delegera ''röster'' till någon annan eller använd dem för att starta en <code>Organisation</code> i nätverket. På så sätt kan ''röst'' token kan fungera som en enhet som passar för att främja en våg av entreprenörskap även bland dagens disenfranchised individer utelämnade av de äldre finansiella och politiska systemen. Men eftersom det händer på individnivå fungerar den övergripande statistiken i nätverket själv som en referensram för att effektivt kunna mäta decentralisering ner till varje människa över hela världen och identifiera möjligheter där den behövs när den växer.
Nätets värde ligger inte på den simulerade bristen utan på dess förmåga att registrera oskäliga beslut bland självstyrande på grundval av jämlikhet. Ursprungligen ''röst'' token kan konkurrera med pollare och andra rudimentära simuleringar som syftar till att förutse val, men så småningom kan det bli ett suveränt system som enbart som medborgarskap migrerar på nätet. ''Röster'' fungera som en signal som kan registrera händelser som spelats in på en oförgänglig blockchain som lagrar politisk historia som inte kan raderas eller ändras på något sätt. Framtida generationer blir utsatta för sina förflutna utan mellanhänder.
===3.4 Värde===
Vi tar tre metoder för att definiera värdet av en ''röst'' token:
* '''Status-Quo''': Sociala medier erbjuder en tydlig referens om hur ''likes'' bli värderad online.
* '''Work & Time''': Ett ''Universal Basic Income'' perspektiv erbjuder användbar insikt om hur arbetstiden värderas.
* '''Nation-States''': Traditionella val erbjuder användbar insikt om hur röster värderas idag.
Med dessa referenser diskuterar vi sedan delningen av ''röst'' token och dess genomförande att styra en Democracy Support Fond.
====3.4.1 Status-Quo====
Ett jämförande riktmärke för värdet av ''röst'' token kan hittas på Facebook-nätverket som för närvarande värderar 2 miljarder användare med ett marknadsvärde på ~ 500 miljarder dollar i genomsnitt en uppskattning av '''$250 per användare'''. Democracy Earth Foundation betraktar Facebook's ''like'' funktion som är analog med att använda ''röster'' i ett öppet nätverk. Det är svårt att uppskatta kvantiteten av ''likes'' gjord på denna plattform eftersom det är privat information och råa uppskattningar projekt ''likes'' händer i mängden biljoner på daglig basis.
Marknadsförare som driver Facebook-reklammaskinen pris ''likes'' inom ett område som kan gå från '''$0.10 to as high as $25''' baserat på rykte och popularitet för kontot som används för att fånga användarens uppmärksamhet. I den meningen anser vi att denna prisreferens är relevant för slutanvändare för att ge dem en token som kan vara konkurrenskraftig med ledande sociala medier. Men det måste noteras att till skillnad från ''likes'', ''röster'' direkt bemyndiga innehavare med rätt att delta i någon ekonomisk fördel som kan kopplas till deras användning utan förmedling. Med ''röster'',att dra nytta av användardata kommer inte längre att vara den exklusiva domänen för Facebook-mellanhänder, men istället kommer den att aktiveras av en inbyggd teckengenereringsmekanism som bygger på de principer som fastställts av [http://www.un.org/en/universal-declaration-human-rights/ Universal Declaration of Human Rights]:
<blockquote>
Alla har rätt till yttrandefrihet och yttrandefrihet. Denna rätt inkluderar frihet att hålla åsikter utan störningar och att söka, ta emot och ge information och idéer genom alla medier och oavsett gränser. Alla har rätt till frihet för fredlig församling och förening. Alla har rätt att delta i hans lands regering, direkt eller genom fritt utvalda representanter.
</blockquote>
Med skapandet av Sovereign som ett gränssnitt för blockchainbaserade demokratier som arbetar med ''röst'' tokens, Democracy Earth Foundation's Målet är att leverera en ''Linux moment'' to Facebook: analogt med uppkomsten av operativsystem med öppen källkod i början av 1990-talet blev Linux ett alternativ till monopoliseringsstyrkan i Microsofts Windows som dominerade marknaden för persondatorer och internetservrar. Ett fritt och öppet Internet måste sträva efter skapandet av ett socialt nätverk där ingen enskild enhet kan utöva algoritmisk kontroll över de gemensamma idéerna i utbyte mot användarnas privata information. Och medan Facebook minskar användarens uppmärksamhet för vinst, kommer demokratimiljönätverket att använda samma resurs för att stärka förtroendet hos ''röst'' token med dess
''Bevis av identitet'' process. När vi erkänner det växande politiska inflytandet som sociala medier redan har i världen, är det brådskande att lägga ut ett öppet socialt nätverk som är okänsligt, att suveräna och fria pressar.
====3.4.2 Arbete & Tid====
Kommer från en ''Universal Basic Income'' perspektiv, en användbar referens som värderar tid och arbetskraft är den föreslagna [https://en.wikipedia.org/wiki/Minimum_wage_in_the_United_States minimum wage in the US] baserad på federala, statliga och lokala lagar över hela landet. Från och med juli 2016 har den ställts till '''$7.25 per timme'''.
[[File:/images/minimum-wage-us.png|Minimum wage in the US.]]
För ''röst'' token att effektivt bli ett användbart nätverk som kan indexera UBI på global nivå, måste en förväntan om sin dynamiska prissättning vara 1 ''röst'' enhet som motsvarar 1 timmes arbete. Därigenom förankras det ursprungliga priset på tokenet på:
1 röst = $ 7.25
Så länge nätverket framgångsrikt förbjuder ''replikanter'' och belöningar validerade self-sovereign identiteter som är indexerade på Bitcoin blockchain, då kan något UBI-initiativ lita på nuvarande data för att allokera resurser utan risk för missbruk.
====3.4.3 Nation-States====
Från ett Nation-State perspektiv, en användbar referens kan hittas i kostnaden för genomförandet av nationella val. 2016 Presidential Race i USA hade en total kostnad så hög som [https://www.opensecrets.org/overview/cost.php $ 2,386,733,696]. Trots att den hade den lägsta väljarkonferensen på 20 år, uppskattades totalt [https://en.wikipedia.org/wiki/Voter_turnout_in_the_United_States_presidential_elections ~138,847,000 voters] deltog. Därför kan en enkel beräkning prisa röstetoken som utfärdats av den amerikanska regeringen för denna valprocess på '''$ 17.18 per röst'''. I den andra änden av spektrumet erbjuder utvecklingsländer som Argentina en liknande referens: deras lagstiftning i 2017 hade en beräknad kostnad på [http://www.lanacion.com.ar/2034493-las-paso-costaran-2800-millones-pero-casi-no-definiran-candidatos $ 164,705,882] med totalt [http://www.elintransigente.com/politica/2017/8/13/cuantos-argentinos-votaron-paso-449552.html ~24,500,000 voters], sätter pris på '''$ 6.70 per röst'''. Det ligger inom detta värdeområde att medborgarna investerar resurser för att garantera rösträtt till alla sina medborgare.
[[File:/images/cost-of-us-elections.png|Cost of US Elections.]]
Enligt Facebooks frö-investor Peter Thiel är en tumregel för teknologisk innovation att för att kunna slå ett paradigm för prövningar måste en innovation överträffa uppgiften att göra det tidigare sättet att göra saker [http://zerotoonebook.com/ med åtminstone en faktor av 10] vad gäller kostnad och nytta. Till exempel: den digitala ordbehandlaren blev framgångsrik eftersom den gör vad en skrivmaskin gjorde på ett sätt som kan betraktas minst tio gånger bättre och tio gånger billigare. Detsamma gäller för fax i motsats till posttjänsten; och e-post i motsats till fax. Därför bör övergången från traditionell omröstning till en ny standard för blockchainbaserad omröstning fungera på samma sätt.
En enkel jämförelse visar de strikta begränsningarna val rösterna har i jämförelse med ''röst'' token föreslagna i detta dokument:
* '''Dyr Säkerhet''': Nation-State's ''Bevis av identitet'' kräver flera resurser för att identifiera medborgare under många stadier av sitt liv. Födelsebevis, pass, körkort, nationella ID-kort, social trygghet, bröllopscertifikat, dödsintyg är alla inriktade på att hålla allmänhetens register över medborgarna uppdaterad. Detta är statens ledande funktion och det kan leda till förföljande beteende.
* '''Begränsat verktyg''': När en medborgare rösta under valet kan den inte ändras fram till 4 till 6 år senare när de valda positionerna renoveras. Bara de bland de valda ståndpunkterna (dvs. senatörer och kongresser) får rätt att tillbringa mer röster än övriga medborgare.
* '''Minskad bandbredd''': Medborgarna får välja mellan en handfull alternativ endast en gång vart 2 eller 4 år. Om vi betraktar varje alternativ som en bit på systemet kan traditionella val betraktas som ''8 bitars demokratier'', sådan är den nuvarande bandbredd för deltagande under de flesta regeringar.
För att upprätthålla referenspriset fastställt till minimilönen i USA samtidigt som det kan vara minst ~ 10X effektivare än något traditionellt val,''röst'' Verktyget måste förlängas genom att göra symbolen delbar.
====3.4.4 Delbarhet====
Väntetiden på 250 block för varje ny dropp ''röst'' begränsar den uppfattade tillfredsställelsen som levereras av systemet till var ~ 42 timmar. Denna begränsning är inställd för att binda den ekonomiska logiken hos ''röst'' tokentill sin kapacitet att indexera alla de framgångsrika ''Bevis av identiteter'' till ''Universal Basic Income'' droppar dynamiskt. Men möjligheten att börja interagera med systemet i sig borde inte kräva en lång väntetid: Genom att införa decimalspositioner kan nätverket erbjuda omedelbar tillfredsställelse genom att anpassa droppdynamiken till en minsta del av mänsklig uppmärksamhet.
Med tanke på att,
1 röst = 250 block = 2,500 minuter = 150,000 sekunder
För att hålla kortast möjliga decimalförlängning samtidigt som dropphastigheten anpassas till den minsta spänningen för mänsklig uppmärksamhet, ''röst'' nätverket ska utföra en revolution var 15: e sekund:
15 sekunder = 0.0001 röster
På samma sätt märks den minsta fraktionen av en Bitcoin som 1 satoshi (i.e. 100,000,000 satoshis = 1 bitcoin), vi anser att det är lämpligt att märka minsta fraktionen av en ''röst'' som en ''revolution'' eftersom detta koncept bidrar till att uttrycka den hastighet som nätverket ger politiska rättigheter till,
1 röst = 10,000 revolutioner
Vilket kan också uttryckas som,
1 revolution = 0.0001 röster
Genom att tillåta 4 decimala positioner i token, a ''revolution'' får droppas till ett giltigt ''Bevis av identitet'' i nätverket var 15: e sekund. ''Revolutioner'' ger nästan omedelbar tillgång till politiska rättigheter samtidigt som samma användarskapacitet som ''röster'' med en kostnad som är förhållandevis 10.000X effektivare än Nation-State val:
1 revolution = 0.0001 röster = $ 0.000725
För att identifiera token i tredjepartsprogram, föreslår vi ''VOTE'' och ''VOT'' tickers.
===3.5 Avsluta spelet.===
<blockquote>
“What happened to the governments?” I inquired.
“It is said that they gradually fell into disuse. Elections were called, wars were declared, taxes were levied, fortunes were confiscated, arrests were ordered, and attempts were made at imposing censorship — but no one on the planet paid any attention. The press stopped publishing pieces by those it called its ‘contributors,’ and also publishing their obituaries. Politicians had to find honest work; some became comedians, some witch doctors — some excelled at those occupations…”
</blockquote>
'''Jorge Luis Borges''', ''Utopia of a Tired Man''. Writer (1899–1986).
Till dem som argumenterar för elektronisk röstning online poängerar deras argument med Facebook ''likes'': [https://en.wikipedia.org/wiki/The_medium_is_the_message ''the medium is the message'']. Behovet av att skapa betrodda relationer i digitala miljöer är obligatoriskt som mänskligt samarbete vågar till hela världen. Men generations möjligheten att gemensamt bygga denna möjlighet måste kunna lära av historiens stora lärdomar. Uppkomsten av databehandling går tillbaka till [https://en.wikipedia.org/wiki/History_of_IBM#1880s.E2.80.931924:_The_origin_of_IBM the first tabulating machine built by IBM for the 1890 US census] och sammanräkning av nationella val efter det. De allra första proto-datorerna, byggda av Alan Turing, gjordes som en krigsansträngning som kan slå nazi-kryptering och visar slutligen hur intelligens kan slå våld. Övergången från analog till digital kommunikation började med [https://wheatoncollege.edu/provost/2016/03/21/claude-shannon-and-the-magna-carta-of-the-information-age/ Magna Carta of the Information Age] publicerad av Claude Shannon år 1948 om grunden för digital kod och stora nätverk för överföring av intelligens, en vision som gjordes av Sir Tim Berners-Lee skapande av ''world wide web'' protokoll. När Satoshi Nakamoto publicerade Bitcoin-papperet invigde han den tid som ger upphov till övergången från analog till digital ''institutioner''. Ett oundvikligt språng från att mogna vår gemensamma förståelse för informationssäkerhetens egenskaper. Blockkedjor ger vår värld en ny kanfas för att lägga grundar som ska styra oss alla för att vara värdiga att inte behöva styrning längre. Trots allt [https://en.wikiquote.org/wiki/Alfred_North_Whitehead civilization advances by extending the number of important operations which we can perform without thinking about them]. Den digitala tekniken har visat sig ha en större kapacitet inom räckvidden och kvaliteten på sina meddelanden och när nya generationer växer samman under en global commons, kommer informationsarkitekturer att reglera våra politiska och finansiella relationer utan de fysiska begränsningarna i det förflutna. Bitcoin-experimentets obestridliga framgång som konsekvent slår till och med de mest radikala prognoserna under ett decennium talar mycket om den släppta potentiella mänskligheten har funnit. Status quo kommer alltid att tala från en skeptisk position eftersom stoppande framsteg endast kan komma från en position av komfort. Men precis som Internet inte väntade på anpassningen av gammaldags imperier, kommer blockkedjor inte att bry sig om politiska löften: ett tekniskt avancerat samhälle kan ingå avtal om ömsesidigt samarbete utan att falla tillbaka till medel för tvång och våld. Sådan är den anmärkningsvärda konsekvensen av upplösning av förtroende utan gränser, en verklighet som inte kommer att dyka upp i en enda isolerad del av ett land eller en del av världen, men kommer att fördelas över hela planeten. Den ''nästa Silicon Valley'' ligger inte i ett avlägset land eller på något land alls, men en ny gräns på internet själv stiger som det sanna öppna, fria och suveräna nätverket av peers.
----
==4. Om.==
Democracy Earth Foundation är en ansträngning som möjliggörs av samarbetare, givare och anhängare av alla slag. Vi är ett 501 (c) 3 inte för vinstorganisation från Kalifornien och med närvaro i New York, Paris, Buenos Aires och San Francisco.
===4.1 Team & Medarbetare.===
Santiago Siri, Virgile Deville, Paula Berman, Eduardo Medina, Herb Stephens, Sandra Miller, Dwight Wilson, Mair Williams, Louis Margot-Duclot, Felipe Alvarez, Cyprien Grau, Peter Schurman, Andrew James Benson, Gonzalo Stupenengo, Lucas Isasmendi.
===4.2 Advisory Board.===
Pia Mancini, Alexis Ohanian, Matias Mosse, Ariel Kogan, Ernesto Dal Bó, Kate Courteau, Giorgio Jackson, Julio Coco, Dan Swislow.
===4.3 Individuella givare.===
Ricardo Gorodisch, Matias Mosse, Krishna Bahrat, Wenceslao Casares, Dwight Wilson, Marcos Galperin, Alejandro Estrada, Chris & Hedy Eyre, Kevin Barenblat, Clinton Yara, Tom Preston-Werner, Lloyd Nimetz, Eduardo Medina, Jim D'Amico, Erik Walter, Vivek Krishnappa, Kevin Berk, Micah Rosenbloom, Karén Gyulbudaghyan, Satoshi Nakamoto, Paul Wehrley, Josh Jacobson, Allison Sparks, Ahin Thomas, Ron Hirson, Ken Ettinger, Sharon Goldstein, Shreenath Regunathan, Matt Price, Josh Zaretsky, Heejae Lim, Allison Koblick.
===4.4 Erkännande.===
Det här är några av de sinnen som inspirerade de idéer som uttrycks på detta dokument.
Nick Szabo, Nubis Bruno (Bitex.la), Cesar Hidalgo (MIT), Balajis Srinivasan (21.co & Anderssen Horowitz), Andrea Antonopoulos (Bitcoin Evangelist), Peter Asaro (Stanford), Naval Ravikant (Angel List), Guillermo Rauch (Zeit), Andrew DeSantis (E8), Greg Slepak (Open Turtles), Demian Brener (Zeppelin), Manuel Araoz (Zeppelin), Ralph Merkle, Satoshi Nakamoto (Bitcoin), Vitalik Buterin (Ethereum), Vlad Zamfir (Ethereum), Joseph Lubin (Consensys), Ryan Shea (Blockstack), Muneeb Ali (Blockstack), Luis Cuende (Aragon), Vinny Lingham (Civic), Luke Duncan, David Graeber (London School of Economics), Peter Schurman (One Global Democracy), Jim D'Amico, Federico Ast, Harry Halpin, Guy Standing (University of London), Sebastian Serrano.
===4.5 Supporters.===
Dessa organisationer stödde vårt arbete genom bidrag, partnerskap och erkännande av våra forsknings- och utvecklingsinsatser.
[[File:/images/grants-awards-support-organizations.png|Grants, awards and support from these leading organizations.]]
| MediaWiki | 3 | 1110sillabo/paper | translations/swedish/README_SE.mediawiki | [
"MIT"
]
|
v @_ v
>0"!sknahT" v
^:, <
| Befunge | 0 | wsbky/befunge_interpreter | test/sample/02.befunge | [
"Apache-2.0"
]
|
%%% Copyright © 2014, Université catholique de Louvain
%%% All rights reserved.
%%%
%%% Redistribution and use in source and binary forms, with or without
%%% modification, are permitted provided that the following conditions are met:
%%%
%%% * Redistributions of source code must retain the above copyright notice,
%%% this list of conditions and the following disclaimer.
%%% * Redistributions in binary form must reproduce the above copyright notice,
%%% this list of conditions and the following disclaimer in the documentation
%%% and/or other materials provided with the distribution.
%%%
%%% THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
%%% AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
%%% IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
%%% ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
%%% LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
%%% CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
%%% SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
%%% INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
%%% CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
%%% ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
%%% POSSIBILITY OF SUCH DAMAGE.
%% Explanations related to this file are in
%% https://github.com/francoisfonteyn/thesis_public/blob/master/Thesis.pdf
%% Complete syntax
%% https://github.com/francoisfonteyn/thesis_public/blob/master/Syntax.pdf
functor
import
BootName(newNamed:NewNamedName) at 'x-oz://boot/Name'
export
Compile
define
%% create a new variable named Name
fun {MakeVar Name}
fVar({NewNamedName Name} unit)
end
%% create a new variable named by the concatenation of Name and Index
%% Name : atom
%% Index : positive int
fun {MakeVarIndex Name Index}
fVar({NewNamedName {VirtualString.toAtom Name#Index}} unit)
end
%% create a new variable named by the concatenation of Name1, Index1, Name2 and Index2
%% Name_ : atom
%% Index_ : positive int
fun {MakeVarIndexIndex Name1 Index1 Name2 Index2}
fVar({NewNamedName {VirtualString.toAtom Name1#Index1#Name2#Index2}} unit)
end
%% efficiently puts all the elements in the list List into fAnd's (no fSkip execpt if nil)
%% returns an AST rooted at fAnd(...) if at least 2 elements
%% returns first element is only one
%% returns fSkip(unit) if none
fun {List2fAnds List}
case List
of nil then fSkip(unit)
[] H|nil then H
[] H|T then fAnd(H {List2fAnds T})
end
end
%% returns a fLocal AST node with
%% Decls as declarations
%% Body as body
%% EXCEPTION: if Decls is empty then returns only Body
fun {LocalsIn Decls Body}
if Decls == nil then
Body
else
fLocal({List2fAnds Decls} Body unit)
end
end
%% transforms a non-empty list: [e1 ... e2]
%% into an AST list: fRecord(...)
fun {LogicList2ASTList Fields}
case Fields
of nil then NIL
[] H|T then fRecord(fAtom('|' unit) [H {LogicList2ASTList T}])
end
end
%% --> assigns 3 lists in the same order
%% - Fields: the fields features
%% - Expressions: the fields values
%% - Conditions: the conditions
%% --> assigns ReturnList to true iff a list must be returned and not a record
%% --> assigns Outputs to the number of expressions
proc {ParseExpressions EXPR_LIST ?Fields ?Expressions ?Conditions ?ReturnList ?Outputs}
%% creates a dict of Ints
%% each element is a feature explicitly given by user
fun {CreateIntIndexDict EXPR_LIST}
Dict = {NewDictionary}
in
for forExpression(H _) in EXPR_LIST do
if {Label H} == fColon andthen {Label H.1} == fInt then
{Dictionary.put Dict H.1.1 unit}
end
end
Dict
end
%% Finds the next Int that is not in Dict
%% starting from Wanted
%% Returns the Int that can be used (Int not in Dict)
%% The latter Int has been put in the Dict
fun {FindNextInt Dict Wanted}
if {Dictionary.member Dict Wanted} then
{FindNextInt Dict Wanted+1}
else
{Dictionary.put Dict Wanted unit}
Wanted
end
end
%% Body of ParseExpressions
proc {Aux List Fs Es Cs I N}
case List
of nil then
Fs = nil
Es = nil
Cs = nil
ReturnList = N == 1 andthen {Label EXPR_LIST.1.1} \= fColon
andthen {Label EXPR_LIST.1} \= forFeature
Outputs = N
[] forExpression(Colon C)|T then NF NE NC in
case Colon of fColon(F E) then
Fs = F|NF
Es = E|NE
Cs = C|NC
{Aux T NF NE NC I N+1}
else W in
W = {FindNextInt Dict I}
Fs = fInt(W unit)|NF
Es = Colon|NE
Cs = C|NC
{Aux T NF NE NC W+1 N+1}
end
end
end
Dict = {CreateIntIndexDict EXPR_LIST}
in
{Aux EXPR_LIST Fields Expressions Conditions 1 0}
end
%% same as List.map but with more lists
%% 4 lists as input
%% Fun is the function to apply with 4 arguments
fun {Map4 Fields Expressions Conditions NextVars Fun}
proc {Aux Fs Es Ns Cs ?R}
case Fs#Es#Ns#Cs
of nil#nil#nil#nil then
R = nil
[] (F|TF)#(E|TE)#(N|TN)#(C|TC) then NR in
R = {Fun F E N C}|NR
{Aux TF TE TN TC NR}
end
end
in
{Aux Fields Expressions Conditions NextVars}
end
%% creates a list with all the outputs
%% NextsVar = [fVar('Next1' unit) ... fVar('NextN' unit)]
%% NextsRecord is bound to the same list but with
%% each element put inside a fColon with its feature
proc {CreateNextsForLastLevel Fields ?NextsRecord ?NextsVar}
proc {Unzip XYs ?Xs ?Ys}
case XYs
of nil then
Xs = nil
Ys = nil
[] (X#Y)|XYr then Xr Yr in
Xs = X|Xr
Ys = Y|Yr
{Unzip XYr ?Xr ?Yr}
end
end
in
{Unzip {List.mapInd Fields fun {$ I Field}
Var = {MakeVarIndex 'Next' I}
in
fColon(Field Var)#Var
end}
?NextsRecord ?NextsVar}
end
%% Initiators = the next level initiators as a list
%% Decls = the declarations to make before using Initiators
%% used to initiate the next level (the first in Levels)
%% Levels cannot be empty ! (this should never be needed because checked elsewhere)
%% e.g. [fVar(...)] if forGeneratorInt
%% e.g. [fInt(...)] if forGeneratorInt
%% e.g. [fVar(...)] if forGeneratorC
%% e.g. [fInt(...)] if forGeneratorC
%% e.g. [fVar(...)] if forGeneratorList
%% e.g. [fRecord(...)] if forGeneratorList
%% e.g. unit if no next level
proc {NextLevelInitiators Levels Index ?Initiators ?Decls}
%% Levels.1 == fForComprehensionLevel(...)
%% Levels.1.1 == List of (forPattern(...) orelse forFrom(...) orelse forRecord(...) orelse forFlag(...))
%% Levels.1.1.X.2 == (forGeneratorInt(...) orelse forGeneratorList(...) orelse forGeneratorC(...))
proc {Aux Lvls ?Ini ?Dcl I}
case Lvls
of nil then
Dcl = nil
Ini = nil
[] H|T then NI ND in
case H
of forFlag(_) then % lazy
Ini = NI
Dcl = ND
[] forFrom(_ F) then % for I in {Fun}
Ini = fApply(F nil unit)|NI
Dcl = ND
[] forRecord(_ _ F) then RecVar Feq Init in % for F:I in Record
RecVar = {MakeVarIndexIndex 'Record' I 'At' Index+1}
Feq = fEq(RecVar F unit)
Init = fRecord(fAtom(record unit)
[fApply(fVar('Arity' unit) [RecVar] unit) RecVar])
Ini = Init|NI
Dcl = Feq|ND
[] forPattern(_ F) then
Dcl = ND
case F
of forGeneratorInt(L _ _) then Ini = L|NI % for I in L..H ; S
[] forGeneratorList(L) then Ini = L|NI % for I in L
[] forGeneratorC(B _ _) then Ini = B|NI % for I in B ; C ; S
end
end
{Aux T NI ND I+1}
end
end
in
{Aux Levels.1.1 ?Initiators ?Decls 1}
end
%% WHERE A LOT HAPPENS -----------------------------------------
%% creates all the range for the level containing the RangesList
%% assigns Lazy to [fAtom(lazy pos(...))] if lazy, nil if not
%% RangesList : e.g. [forPattern forFlag forFrom ...]
%% Index : the index of this level
%% Lazy : true if lazy, otherwise false
%% RangesDeeper : all the ranges to declare in signature of deeper levels. Assigned at next instruction
%% RangeListDecl : the declarations needed before testing the condition given by user
%% NewExtraArgsForLists : returns all the ranges of this level generated as list
%% RangesDeclCallNext : all the ranges to call this level
%% RangesConditionList : the list of all conditions to fullfill to keep iterating this level
%% --> for I1 in R1 A in 1..2 I2 in R3 B in 1;B+1 C in 1..3 lazy
%% Ranges : [fVar(C unit) fVar(B unit) fVar(Range3At1 unit) fVar(A unit)
%% fVar(Range1At1 unit)]
%% Lazy : true
%% RangesDeeper : [fVar(C unit) fVar(B unit) fVar(I3 unit) fVar(A unit) fVar(I1 unit)]
%% RangeListDecl : fAnd(fEq(fVar(I2 pos) fVar(Range3AtX.1 unit) unit)
%% fEq(fVar(I1 pos) fVar(Range1AtX.1 unit) unit))
%% NewExtraArgsForLists : [fVar(Range3AtX unit) fVar(Range1AtX unit)]
%% RangesDeclCallNext : [fOpApply('+' [fVar('C' pos) INT1] unit) ...]
%% RangesConditionList : [fOpApply('=<' [fVar('C' pos) fInt(3 unit)] unit) ...}
proc {MakeRanges RangesList Index Result
?Ranges ?Lazy ?RangesDeeper ?RangeListDecl ?NewExtraArgsForLists ?RangesDeclCallNext ?RangesConditionList}
proc {Aux RList ?Ranges ?RangesDeeper IsLazy I ?RangeListDecl
?NewExtraArgsForLists ?RangesDeclCallNext ?RangesConditionList}
%% Acc : arguments of this level
%% AccD : arguments for next levels
%% ListDecl : declarations just after range condition and before user condition
%% ExtraArgs : extra arguments for next levels
%% CallItself : how to call next iteration for this all the ranges of this level
%% Conditions : user conditions
case RList
of nil then
%% end of ranges for this level
%% assign all unbounded variables
Lazy = IsLazy
RangesDeeper = nil
RangeListDecl = nil
NewExtraArgsForLists = nil
RangesDeclCallNext = nil
RangesConditionList = nil
Ranges = nil
[] H|T then
case H
of forPattern(V P) then
case P
of forGeneratorList(_) then Var NR NRD NExtra Dcl Call Cond in
%% A in [1 2 3]
%% ------------
%% Ranges: RangeXatY
%% RangesDeeper: A
%% RangeListDecl: A = RangeXAtY.1
%% NewExtraArgsForLists: RangeXAtY
%% RangeDeclCallNext: RangeXAtY.2
%% RangesConditionList: RangeXAtY \= nil
%% IsLazy: no (keep old value)
Var = {MakeVarIndexIndex 'Range' I 'At' Index}
Ranges = Var|NR
RangesDeeper = V|NRD
NewExtraArgsForLists = Var|NExtra
RangesConditionList = fOpApply('\\='
[Var NIL]
unit)|Cond
RangeListDecl = fEq(V
fOpApply('.' [Var INT1] unit)
unit)|Dcl
RangesDeclCallNext = fOpApply('.'
[Var INT2]
unit)|Call
{Aux T NR NRD IsLazy I+1 Dcl NExtra Call Cond}
[] forGeneratorInt(_ Hi St) then NR NRD Call Cond Var in
%% A in 1..11 ; 2
%% --------------
%% Ranges: A (create a variable if '_' instead of 'A')
%% RangesDeeper: same as Ranges
%% RangeListDecl: ---
%% NewExtraArgsForLists: ---
%% RangeDeclCallNext: A+2 (A+1 is no step given)
%% RangesConditionList: A =< 11
%% IsLazy: no (keep old value)
case V
of fWildcard(_) then Var = {MakeVar 'Wildcard'}
else Var = V
end
Ranges = Var|NR
RangesDeeper = Var|NRD
RangesDeclCallNext = fOpApply('+'
[Var if St == unit then INT1 else St end]
unit)|Call
RangesConditionList = fOpApply('=<' [Var Hi] unit)|Cond
{Aux T NR NRD IsLazy I+1 RangeListDecl NewExtraArgsForLists Call Cond}
[] forGeneratorC(_ Cd St) then NR NRD Call Cond in
%% A in 1 ; A < 12 ; A+2
%% ---------------------
%% Ranges: A
%% RangesDeeper: same as Ranges
%% RangeListDecl: ---
%% NewExtraArgsForLists: ---
%% RangeDeclCallNext: A+2
%% RangesConditionList: A < 12 (nothing if no given)
%% IsLazy: no (keep old value)
RangesDeclCallNext = if St == unit then Cd else St end|Call
Ranges = V|NR
RangesDeeper = V|NRD
RangesConditionList = if St == unit then Cond else Cd|Cond end
{Aux T NR NRD IsLazy I+1 RangeListDecl NewExtraArgsForLists Call Cond}
end
[] forRecord(F V _) then Cond NewDeeper NewListDecl RecordVar ArityVar BRec Call NExtra NR in
%% F:A in 1#2#3
%% ------------
%% Ranges: ArityXAtY#RecordXAtY
%% RangesDeeper: F and A (omit if '_')
%% RangeListDecl: F = ArityXAtY.1 and A = RecordXAtY.F (adapted if '_')
%% NewExtraArgsForLists: ArityXAtY#RecordXAtY
%% RangeDeclCallNext: ArityXAtY.2#RecordXAtY
%% RangesConditionList: ArityXAtY \= nil
%% IsLazy: no (keep old value)
RecordVar = {MakeVarIndexIndex 'Record' I 'At' Index}
ArityVar = {MakeVarIndexIndex 'Arity' I 'At' Index}
BRec = fRecord(fAtom(record unit) [ArityVar RecordVar])
Ranges = BRec|NR
NewExtraArgsForLists = BRec|NExtra
if {Label F} == fWildcard then
if {Label V} == fWildcard then
NewListDecl = RangeListDecl
NewDeeper = RangesDeeper
else
RangeListDecl = fEq(V
fOpApply('.'
[RecordVar
fOpApply('.' [ArityVar INT1] unit)]
unit)
unit)|NewListDecl
RangesDeeper = V|NewDeeper
end
else
if {Label V} == fWildcard then
RangeListDecl = fEq(F fOpApply('.' [ArityVar INT1] unit) unit)|NewListDecl
RangesDeeper = F|NewDeeper
else
RangeListDecl= fEq(F fOpApply('.' [ArityVar INT1] unit) unit)
|fEq(V fOpApply('.' [RecordVar F] unit) unit)|NewListDecl
RangesDeeper = F|V|NewDeeper
end
end
RangesDeclCallNext = fRecord(fAtom(record unit)
[fOpApply('.' [ArityVar INT2] unit) RecordVar])|Call
RangesConditionList = fOpApply('\\=' [ArityVar NIL] unit)|Cond
{Aux T NR NewDeeper IsLazy I+1 NewListDecl NExtra Call Cond}
[] forFrom(V F) then NRDCN NR NRD in
%% A from Fun
%% ----------
%% Ranges: A
%% RangesDeeper: A
%% RangeListDecl: ---
%% NewExtraArgsForLists: ---
%% RangeDeclCallNext: {Fun}
%% RangesConditionList: ---
%% IsLazy: no (keep old value)
RangesDeclCallNext = fApply(F nil unit)|NRDCN
Ranges = V|NR
RangesDeeper = V|NRD
{Aux T NR NRD IsLazy I+1 RangeListDecl NewExtraArgsForLists NRDCN RangesConditionList}
[] forFlag(F) then
%% lazy
%% ----
%% nothing changes except
%% IsLazy: true if was false before, error otherwise
case F
of fAtom(lazy C) then
%% is flag already there ?
if IsLazy then
{Exception.raiseError 'list comprehension'(doubleFlag(lazy C))}
else
{Aux T Ranges RangesDeeper true I+1 RangeListDecl
NewExtraArgsForLists RangesDeclCallNext RangesConditionList}
end
else
{Exception.raiseError 'list comprehension'(unknownFlag(F.1 F.2))}
end
end
end
end
in
{Aux RangesList ?Ranges ?RangesDeeper false 1
?RangeListDecl ?NewExtraArgsForLists ?RangesDeclCallNext ?RangesConditionList}
end
%% creates the call to make for the next iteration on this level
%% RangesDeclCallNext : all the ranges to call this level
%% PreviousIds : previous ids to put in call
%% Name : name of the current level
%% OldExtraArgsForLists : all the ranges of previous level generated as list
%% ----> for A in _.._ ; 2 for B in _;_;B+1
%% > {Level1 A+2} at level 1
%% > {Level2 B+1 A} at level 2
%% ----> for A in R1 for B in R2
%% > {Level1 Range1At1.2} at level 1 (Old = nil, New = [fVar('Range1At1' unit)])
%% > {Level2 Range1At2.2 A Range1At1} at level 2 (Old = [fVar('Range1At1' unit)],
%% New = [fVar('Range1At2' unit)])
fun {MakeNextCallItself RangesDeclCallNext PreviousIds NameVar OldExtraArgsForLists ResultVar}
fApply(NameVar
{List.append RangesDeclCallNext
{List.append PreviousIds {List.append OldExtraArgsForLists [ResultVar]}}}
unit)
end
%% RangesDeeper : all the ranges to call
%% PreviousIds : previous ids to put in call
%% {LevelX {NextLevelInitiators Levels} RangesDeeper PreviousIds ExtraArgsForLists}
fun {MakeNextLevelCall RangesDeeper Levels NextLevelName PreviousIds ExtraArgsForLists ResultVar Index}
Decls
NextInitiators
{NextLevelInitiators Levels Index ?NextInitiators ?Decls}
Apply = fApply(%% function name
NextLevelName
%% args
{List.append NextInitiators
{List.append RangesDeeper
{List.append PreviousIds
{List.append ExtraArgsForLists [ResultVar]}}}}
%% position
unit)
in
{LocalsIn Decls Apply}
end
%% returns a big condition which is conjunction (andthen)
%% of all the conditions that each range requires
%% --> for I1 in R1 A in 1..2 I2 in R3 B in 1;B<5;B+1 C in 1..3
%% gives
%% Range1\=nil andthen A=<2 andthen Range3\=nil andthen B<5 andthen C=<3
fun {MakeRangesCondition RangesConditionList}
case RangesConditionList
of nil then fAtom(true unit)
[] H|nil then H
[] H|T then
case H
of fAtom(true _) then {MakeRangesCondition T}
else fAndThen(H {MakeRangesCondition T} unit)
end
end
end
%% Replaces the last argument of the call (fApply) in the first argument
%% by the new result (the one from this level) because it was the result
%% of the previous level !
fun {SwitchResultInPreviousLevelCall fApply(Name List unit) Result}
Tmp1 = {Reverse List}
Tmp2 = {Reverse Result|Tmp1.2}
in
fApply(Name Tmp2 unit)
end
%%=========================================
%% last level: generates the following code
%%
%% local Next in
%% if {{ This_Level_Condition }} then
%% local {{ Next_1 ... Next_N }} in
%% Next = {{ '#'(field1:Next1 ... fieldN:NextN) }}
%% if {{ Is_Body }} then {{ Body }} end
%% {{ Forall I in Fields_Name }}
%% Result.I = if {{ Condition.I }} then Expression.I|Next_I
%% else Next_I end
%% {{ end Forall }}
%% end
%% else
%% Next = Result
%% end
%% {LevelIndex %% current level
%% {{ Next_Iteration_For_The_Ranges_Of_This_Level }}
%% {{ Previous_Levels_Arguments }}
%% {{ Previous_List_Ranges }}
%% Next}
%% end
fun {CreateLastLevelNextCall Fields Expressions Conditions ResultVar BODY
Condition RangesDeclCallNext PreviousIds NameVar OldExtraArgsForLists}
NextLastVar = {MakeVar 'Next'}
NextsRecord NextVars
{CreateNextsForLastLevel Fields ?NextsRecord ?NextVars}
NextAssignTrue = fEq(NextLastVar fRecord(HASH NextsRecord) unit)
NextAssignFalse = fEq(NextLastVar ResultVar unit)
NextCall = {MakeNextCallItself RangesDeclCallNext PreviousIds NameVar
OldExtraArgsForLists NextLastVar}
Assigns = {Map4 Fields Expressions Conditions NextVars
fun{$ F E C N}
TrueStat = fEq(fOpApply('.' [ResultVar F] unit)
fRecord(fAtom('|' unit) [E N])
unit)
in
if C == unit then %% no condition
TrueStat
else
fBoolCase(C
TrueStat
fEq(fOpApply('.' [ResultVar F] unit) N unit)
unit)
end
end}
TrueStat = fLocal({List2fAnds NextVars}
if BODY == unit then
{List2fAnds {List.append Assigns [NextAssignTrue]}}
else
{List2fAnds {List.append BODY|Assigns [NextAssignTrue]}}
end
unit)
ThisLevelConditionStat = if Condition == unit then
%% no level condition: consider it always true
TrueStat
else
fBoolCase(Condition TrueStat NextAssignFalse unit)
end
in
fLocal(NextLastVar fAnd(ThisLevelConditionStat NextCall) unit)
end
%% returns the next level call
fun {CreateNotLastLevelNextCall NextLevelName Levels Index RangesDeeper
PreviousIds ExtraArgsForLists ResultVar Condition NextCallItself}
NextLevelCallNotLast = {MakeNextLevelCall RangesDeeper Levels NextLevelName
PreviousIds ExtraArgsForLists ResultVar Index}
in
if Condition == unit then NextLevelCallNotLast
else fBoolCase(Condition NextLevelCallNotLast NextCallItself unit)
end
end
%% usefull constants
NIL = fAtom(nil unit)
HASH = fAtom('#' unit)
INT1 = fInt(1 unit)
INT2 = fInt(2 unit)
%%==================================================
%%==================================================
%% the actual exported function called by Unnester
%% returns the AST with the mode fListComprehensions
%% replaced by its transformation
%% Argument : the fListComprehension node
fun {Compile fListComprehension(EXPR_LIST FOR_COMPREHENSION_LIST BODY COORDS)}
%% used to keep track of all the (level) procedures to declare
TopLevelDeclsBuffer = {NewCell nil}
proc {AddTopLevelDecl Value}
TopLevelDeclsBuffer := Value|@TopLevelDeclsBuffer
end
%% returns an AST rooted at fAnd(...)
%% to declare everything inside TopLevelDeclsBuffer (levels, ...)
fun {GetTopLevelDecls}
{List2fAnds @TopLevelDeclsBuffer}
end
%% generates all the levels of the list comprehension recursively
%% starting from a 'fake' level called PreLevel
%% each levels launch the generation the next level if exists
fun {LevelsGenerator}
%%====================================================================================
%% generates the procedure AST for Level numbered Index (name is <Name/'Level'#Index>)
%% puts it in the cell TopLevelDeclsBuffer at key 'Level'#Index
%% returns the name (fVar) of the procedure generated
%% Level : fForComprehensionLevel([...] ... ...)
%% Index : int in [0, infinity]
%% Levels : the list of next levels
%% PreviousIds : list of the previous ranges name in the reverse order
%% CallToPreviousLevel : how this level should call back the previous when done with range --> fApply(...)
fun {LevelGenerator Level Index Levels PreviousIds CallToPreviousLevel OldExtraArgsForLists}
%% the name of the function of this level
NameVar = {MakeVarIndex 'Level' Index}
%% result
ResultVar = {MakeVar 'Result'}
%% nil if not lazy, [fAtom(lazy pos(...))] if lazy
Lazy
%% all the ranges to declare in signature of deeper levels
RangesDeeper
%% the declarations needed before testing the condition given by user
RangeListDecl
%% arguments to add at next level because generator is a list and because of call back to previous level
NewExtraArgsForLists
%% the arguments of this level, with the transformation for next iteration
RangesDeclCallNext
%% the list of all conditions to fulfill to keep iterating this level
RangesConditionList
%% all the ranges to declare in signature of this level
RangesDecl
{MakeRanges Level.1 Index ResultVar ?RangesDecl ?Lazy ?RangesDeeper ?RangeListDecl
?NewExtraArgsForLists ?RangesDeclCallNext ?RangesConditionList}
%% the call (fApply) to this level, one step forward
NextCallItself = {MakeNextCallItself RangesDeclCallNext PreviousIds
NameVar OldExtraArgsForLists ResultVar}
%% concatenation of NewExtraArgsForLists and OldExtraArgsForLists
ExtraArgsForLists = {List.append NewExtraArgsForLists OldExtraArgsForLists}
%% all the conditions to fulfill to keep iterating on this level
RangesCondition = {MakeRangesCondition RangesConditionList}
%% the condition given by the user if any, unit otherwise
Condition = Level.2
%% call to make for next if exists, EXPR|NextCallItself if not
NextLevelCall = if Levels == nil then
{CreateLastLevelNextCall Fields Expressions Conditions ResultVar BODY
Condition RangesDeclCallNext PreviousIds NameVar OldExtraArgsForLists}
else NextLevelName in
NextLevelName = {LevelGenerator Levels.1 Index+1 Levels.2
{List.append RangesDeeper PreviousIds}
NextCallItself ExtraArgsForLists}
{CreateNotLastLevelNextCall NextLevelName Levels Index RangesDeeper
PreviousIds ExtraArgsForLists ResultVar Condition NextCallItself}
end
Procedure =
fProc(
%% name
NameVar
%% arguments
{List.append RangesDecl {List.append PreviousIds {List.append OldExtraArgsForLists [ResultVar]}}}
%% body
local
BodyStat =
local
TrueStat = {LocalsIn RangeListDecl NextLevelCall}
in
case RangesCondition
of fAtom(true _) then TrueStat
else fBoolCase(%% condition of ranges
RangesCondition
%% true
TrueStat
%% false
if Index == 1 then
%% first level so assign Result to nil
{List2fAnds {Map Fields
fun{$ F}
fEq(fOpApply('.' [ResultVar F] unit)
NIL
unit)
end}}
else
%% call previous level
{SwitchResultInPreviousLevelCall CallToPreviousLevel ResultVar}
end
%% position
unit)
end
end
LazyAndBodyStat =
if Lazy then
%% LAZY --------------------
fAnd(if Outputs == 1 then
%%=====================
%% lazy with one output
fApply(fVar('WaitNeeded' unit)
[fOpApply('.' [ResultVar Fields.1] unit)]
unit)
else
%%==========================
%% lazy with several outputs
fOpApplyStatement('Record.waitNeededFirst' [ResultVar] unit)
end
BodyStat) % end of fAnd (because of lazy...)
else
%% not lazy, just body, no waiting
BodyStat
end
in
LazyAndBodyStat
end
%% flags
nil
%% position
COORDS)
in
{AddTopLevelDecl Procedure}
NameVar
end %% end of LevelGenerator
NameVar = {MakeVar 'PreLevel'}
ResultVar = {MakeVar 'Result'}
Level1Var = {LevelGenerator FOR_COMPREHENSION_LIST.1 1 FOR_COMPREHENSION_LIST.2 nil unit nil}
in
%% put PreLevel in TopLevelDeclsBuffer
{AddTopLevelDecl fProc(%% name
NameVar
%% arguments
[ResultVar]
%% body
local
Decls
Initiators
{NextLevelInitiators FOR_COMPREHENSION_LIST 0 ?Initiators ?Decls}
ResultArg = if ReturnList then
[fRecord(HASH [fColon(INT1 ResultVar)])]
else
[ResultVar]
end
ApplyStat = fApply(Level1Var {List.append Initiators ResultArg} unit)
BodyStat = {LocalsIn Decls ApplyStat}
in
if ReturnList then
BodyStat
else RecordMake in
RecordMake = fEq(ResultVar
fApply(fOpApply('.'
[fVar('Record' unit) fAtom('make' unit)]
unit)
[HASH {LogicList2ASTList Fields}]
unit)
unit)
fAnd(RecordMake BodyStat)
end
end
%% flags
nil
%% position
COORDS)
}
%% return name
NameVar
end %% end of LevelsGenerator
%% true iff return list instead of record
ReturnList
%% the fields name of the outputs
Fields
%% the expressions to output (same order as Fields)
Expressions
%% the output-specific conditons (same order as Fields)
Conditions
%% number of outputs
Outputs
{ParseExpressions EXPR_LIST ?Fields ?Expressions ?Conditions ?ReturnList ?Outputs}
%% launch the chain of level generation
PreLevelVar = {LevelsGenerator}
in
%% return the actual tree rooted at fStepPoint
fStepPoint(
fLocal(
%% all the declarations (levels and bounds)
{GetTopLevelDecls}
%% return the resulting list(s)
fApply(PreLevelVar nil COORDS)
%% LC position
COORDS)
%% list comprehension tag
listComprehension
%% keep position of list comprehension
COORDS)
end
end
| Oz | 5 | Ahzed11/mozart2 | lib/compiler/ListComprehension.oz | [
"BSD-2-Clause"
]
|
=head1 NAME
Test::Builder::Test - base class for all Test::Builder test objects
=head1 SYNOPSIS
See L<Test::Builder>. You probably don't need to use this directly.
=head1 DESCRIPTION
This PIR program is a base class for all Test::Builder test objects.
=head1 METHODS
This class provides the following methods:
=over 4
=cut
.namespace [ 'Test'; 'Builder'; 'Test' ]
.sub _initialize :load
.local pmc tbtb_class
newclass tbtb_class, [ 'Test'; 'Builder'; 'Test'; 'Base' ]
addattribute tbtb_class, 'passed'
addattribute tbtb_class, 'number'
addattribute tbtb_class, 'diagnostic'
addattribute tbtb_class, 'description'
addattribute tbtb_class, 'skip'
addattribute tbtb_class, 'todo'
.local pmc tbtp_class
subclass tbtp_class, tbtb_class, ['Test'; 'Builder'; 'Test'; 'Pass']
.local pmc tbtf_class
subclass tbtf_class, tbtb_class, ['Test'; 'Builder'; 'Test'; 'Fail']
.local pmc tbtwr_class
subclass tbtwr_class, tbtb_class, ['Test'; 'Builder'; 'Test'; 'WithReason']
addattribute tbtwr_class, 'reason'
.local pmc tbts_class
subclass tbts_class, tbtwr_class, ['Test'; 'Builder'; 'Test'; 'Skip']
.local pmc tbtt_class
subclass tbtt_class, tbtwr_class, ['Test'; 'Builder'; 'Test'; 'TODO']
.end
=item C<create( args_hash )>
Creates and returns a new test object, based on the arguments in the
C<args_hash> hash. Yes, this is a facade factory. The arguments are:
=over 4
=item C<number>
The number of the test. This is important.
=item C<passed>
An integer representing whether the test passed or failed.
=item C<skip>
An integer representing whether the test is a skip test.
=item C<reason>
The string reason why this is a skip or TODO test.
=item C<todo>
An integer representing whether the test is a TODO test.
=item C<description>
The string description of this test.
=back
The returned object is a subclass of Test::Builder::Test.
=cut
.sub create
.param pmc args
.local pmc test
.local int type_flag
CHECK_TODO:
type_flag = args['todo']
unless type_flag goto CHECK_SKIP
test = new ['Test'; 'Builder'; 'Test'; 'TODO'], args
.return( test )
CHECK_SKIP:
type_flag = args['skip']
unless type_flag goto CHECK_PASS
test = new ['Test'; 'Builder'; 'Test'; 'Skip'], args
.return( test )
CHECK_PASS:
type_flag = args['passed']
unless type_flag goto CHECK_FAIL
test = new ['Test'; 'Builder'; 'Test'; 'Pass'], args
.return( test )
CHECK_FAIL:
test = new ['Test'; 'Builder'; 'Test'; 'Fail'], args
.return( test )
.end
=item C<status()>
Returns a C<Hash> containing information about this test -- mostly the
information you pass to C<create()>.
=item C<report()>
Returns the TAP-compatible string representation of this test.
=cut
.namespace [ 'Test'; 'Builder'; 'Test'; 'Base' ]
.sub init_pmc :vtable :method
.param pmc args
.local pmc passed
.local pmc number
.local pmc diagnostic
.local pmc description
passed = args['passed']
setattribute self, "passed", passed
number = args['number']
unless null number goto SET_NUMBER
number = new 'Integer'
number = 0
SET_NUMBER:
setattribute self, "number", number
diagnostic = args['diagnostic']
unless null diagnostic goto SET_DIAGNOSTIC
diagnostic = new 'String'
set diagnostic, '???'
SET_DIAGNOSTIC:
setattribute self, "diagnostic", diagnostic
description = args['description']
unless null description goto SET_DESCRIPTION
description = new 'String'
set description, ''
SET_DESCRIPTION:
setattribute self, "description", description
.end
.sub passed :method
.local pmc passed
getattribute passed, self, "passed"
.return( passed )
.end
.sub number :method
.local pmc number
getattribute number, self, "number"
.return( number )
.end
.sub diagnostic :method
.local pmc diagnostic
getattribute diagnostic, self, "diagnostic"
.return( diagnostic )
.end
.sub description :method
.local pmc description
getattribute description, self, "description"
.return( description )
.end
.sub status :method
.local pmc passed
.local pmc description
.local pmc status
passed = self.'passed'()
description = self.'description'()
status = new 'Hash'
set status['passed'], passed
set status['description'], description
.end
.sub report :method
.local pmc passed
.local pmc number
.local pmc description
.local string report
.local string number_string
.local string desc_string
passed = self.'passed'()
number = self.'number'()
description = self.'description'()
report = ''
number_string = number
desc_string = description
if passed goto PASSED
set report, 'not '
PASSED:
report = concat report, 'ok '
report = concat report, number_string
unless desc_string goto REPORT
report = concat report, ' - '
report = concat report, desc_string
REPORT:
.return( report )
.end
# no code here
.namespace [ 'Test'; 'Builder'; 'Test'; 'Pass' ]
# no code here either
.namespace [ 'Test'; 'Builder'; 'Test'; 'Fail' ]
.namespace [ 'Test'; 'Builder'; 'Test'; 'WithReason' ]
.sub init_pmc :vtable :method
.param pmc args
.local pmc reason
reason = new 'String'
set reason, ''
.local int is_defined
is_defined = exists args['reason']
unless is_defined goto SET_ATTRIBUTE
reason = args['reason']
SET_ATTRIBUTE:
setattribute self, "reason", reason
.end
.sub reason :method
.local pmc reason
getattribute reason, self, "reason"
.return( reason )
.end
.sub status :method
.local pmc reason
.local pmc status
.local pmc parent_status
parent_status = get_hll_global ['Test'; 'Builder'; 'Test'; 'WithReason'], 'status'
status = parent_status()
reason = self.'reason'()
set status['reason'], reason
.return( status )
.end
.namespace [ 'Test'; 'Builder'; 'Test'; 'Skip' ]
.sub report :method
.local pmc reason
.local pmc number
.local string report
.local string number_string
.local string reason_string
number = self.'number'()
reason = self.'reason'()
report = 'ok '
number_string = number
reason_string = reason
report = concat report, number_string
report = concat report, ' #skip '
report = concat report, reason_string
.return( report )
.end
.sub status :method
.local pmc status
.local pmc parent_status
parent_status = get_hll_global ['Test'; 'Builder'; 'Test'; 'WithReason'], 'status'
status = parent_status()
set status['skip'], 1
.return( status )
.end
.namespace [ 'Test'; 'Builder'; 'Test'; 'TODO' ]
.sub report :method
.local pmc passed
.local pmc reason
.local pmc number
.local string report
passed = self.'passed'()
number = self.'number'()
report = ''
if passed goto PASSED
report = 'not '
PASSED:
report = concat report, 'ok '
$S0 = number
report = concat report, $S0
report = concat report, ' # TODO '
$S0 = self.'reason'()
report = concat report, $S0
if passed goto REPORT
# Build long explanation why
report .= "\n\tFailed (TODO) test '"
$S0 = self.'description'()
report .= $S0
report .= "'"
REPORT:
.return( report )
.end
.sub status :method
.local pmc passed
.local pmc status
.local pmc parent_status
parent_status = get_hll_global ['Test'; 'Builder'; 'Test'; 'WithReason'], 'status'
status = parent_status()
passed = self.'passed'()
set status['TODO'], 1
set status['passed'], 1
set status['really_passed'], 1
.return( status )
.end
=back
=head1 AUTHOR
Please send patches, feedback, and suggestions to the Perl 6 internals mailing
list.
=head1 COPYRIGHT
Copyright (C) 2005-2010, Parrot Foundation.
=cut
# Local Variables:
# mode: pir
# fill-column: 100
# End:
# vim: expandtab shiftwidth=4 ft=pir:
| Parrot Internal Representation | 5 | winnit-myself/Wifie | runtime/parrot/library/Test/Builder/Test.pir | [
"Artistic-2.0"
]
|
#include <ATen/cuda/CUDAContext.h>
#include <cuda_runtime.h>
namespace at { namespace cuda {
/**
Computes ceil(a / b)
*/
template <typename T>
__host__ __device__ __forceinline__ T ATenCeilDiv(T a, T b) {
return (a + b - 1) / b;
}
namespace {
// Threads per block for our apply kernel
// FIXME: use occupancy calculator instead
constexpr uint32_t AT_APPLY_THREADS_PER_BLOCK = 512;
constexpr uint32_t AT_APPLY_BLOCKS_PER_SM = 4;
template <int step = 1>
inline bool getApplyGrid(uint64_t totalElements, dim3& grid, int64_t curDevice, int max_threads_per_block=AT_APPLY_THREADS_PER_BLOCK) {
if (curDevice == -1) return false;
uint64_t numel_per_thread = static_cast<uint64_t>(max_threads_per_block) * static_cast<uint64_t>(step);
uint64_t numBlocks = ATenCeilDiv(totalElements, numel_per_thread);
uint64_t maxGridX = at::cuda::getDeviceProperties(curDevice)->maxGridSize[0];
if (numBlocks > maxGridX)
numBlocks = maxGridX;
grid = dim3(numBlocks);
return true;
}
constexpr int getApplyBlocksPerSM() {
return AT_APPLY_BLOCKS_PER_SM;
}
constexpr int getApplyBlockSize() {
return AT_APPLY_THREADS_PER_BLOCK;
}
inline dim3 getApplyBlock(int max_threads_per_block=AT_APPLY_THREADS_PER_BLOCK) {
return dim3(max_threads_per_block);
}
}
}} // namespace at::cuda
| Cuda | 4 | xiaohanhuang/pytorch | aten/src/ATen/cuda/ApplyGridUtils.cuh | [
"Intel"
]
|
# Copyright 2017-2020 Gentoo Authors
# Distributed under the terms of the GNU General Public License v2
# Auto-Generated by cargo-ebuild 0.3.0
EAPI=7
CRATES="
adler32-1.0.4
aho-corasick-0.6.10
aho-corasick-0.7.6
ansi_term-0.11.0
anymap-0.12.1
arrayvec-0.4.12
assert_cmd-0.4.0
atty-0.2.13
autocfg-0.1.7
backtrace-0.3.40
backtrace-sys-0.1.32
bitflags-1.2.1
block-buffer-0.7.3
block-padding-0.1.4
bstr-0.2.8
byte-tools-0.3.1
byteorder-1.3.2
c2-chacha-0.2.3
cargo-0.30.0
cargo-generate-0.5.0
cc-1.0.46
cfg-if-0.1.10
chrono-0.4.9
clap-2.33.0
clap-verbosity-flag-0.2.0
clicolors-control-0.2.0
clicolors-control-1.0.1
cloudabi-0.0.3
commoncrypto-0.2.0
commoncrypto-sys-0.2.0
console-0.6.2
console-0.9.0
core-foundation-0.6.4
core-foundation-sys-0.6.2
crates-io-0.18.0
crc32fast-1.2.0
crossbeam-channel-0.3.9
crossbeam-deque-0.7.1
crossbeam-epoch-0.7.2
crossbeam-queue-0.1.2
crossbeam-utils-0.5.0
crossbeam-utils-0.6.6
crypto-hash-0.3.4
curl-0.4.25
curl-sys-0.4.23
deunicode-1.0.0
dialoguer-0.1.0
difference-2.0.0
digest-0.8.1
doc-comment-0.3.1
either-1.5.3
encode_unicode-0.3.6
env_logger-0.5.13
escargot-0.2.0
exitfailure-0.5.1
failure-0.1.6
failure_derive-0.1.6
fake-simd-0.1.2
filetime-0.2.7
flate2-1.0.12
float-cmp-0.4.0
fnv-1.0.6
foreign-types-0.3.2
foreign-types-shared-0.1.1
fs2-0.4.3
fuchsia-cprng-0.1.1
generic-array-0.12.3
getrandom-0.1.12
git2-0.7.5
git2-curl-0.8.2
glob-0.2.11
globset-0.4.4
globwalk-0.3.1
heck-0.3.1
hex-0.3.2
home-0.3.4
humantime-1.3.0
idna-0.1.5
ignore-0.4.10
indicatif-0.9.0
itertools-0.8.0
itoa-0.4.4
jobserver-0.1.17
kernel32-sys-0.2.2
lazy_static-0.2.11
lazy_static-1.4.0
lazycell-1.2.1
libc-0.2.65
libgit2-sys-0.7.11
libssh2-sys-0.2.13
libz-sys-1.0.25
liquid-0.19.0
liquid-compiler-0.19.0
liquid-derive-0.19.0
liquid-error-0.19.0
liquid-interpreter-0.19.0
liquid-value-0.19.0
lock_api-0.3.1
log-0.4.8
maplit-1.0.2
matches-0.1.8
memchr-2.2.1
memoffset-0.5.1
miniz_oxide-0.3.3
miow-0.3.3
nodrop-0.1.14
num-integer-0.1.41
num-traits-0.2.8
num_cpus-1.10.1
opaque-debug-0.2.3
openssl-0.10.25
openssl-probe-0.1.2
openssl-src-111.6.0+1.1.1d
openssl-sys-0.9.52
parking_lot-0.9.0
parking_lot_core-0.6.2
percent-encoding-1.0.1
pest-2.1.2
pest_derive-2.1.0
pest_generator-2.1.1
pest_meta-2.1.2
pkg-config-0.3.16
ppv-lite86-0.2.6
predicates-0.5.2
proc-macro-hack-0.5.11
proc-macro2-0.4.30
proc-macro2-1.0.6
proc-quote-0.2.2
proc-quote-impl-0.2.2
quick-error-1.2.2
quicli-0.4.0
quote-0.6.13
quote-1.0.2
rand-0.3.23
rand-0.4.6
rand-0.7.2
rand_chacha-0.2.1
rand_core-0.3.1
rand_core-0.4.2
rand_core-0.5.1
rand_hc-0.2.0
rayon-1.2.0
rayon-core-1.6.0
rdrand-0.4.0
redox_syscall-0.1.56
regex-0.2.11
regex-1.3.1
regex-syntax-0.5.6
regex-syntax-0.6.12
remove_dir_all-0.5.2
rustc-demangle-0.1.16
rustc-workspace-hack-1.0.0
rustc_version-0.2.3
rustfix-0.4.6
ryu-1.0.2
same-file-1.0.5
schannel-0.1.16
scopeguard-0.3.3
scopeguard-1.0.0
semver-0.9.0
semver-parser-0.7.0
serde-1.0.101
serde_derive-1.0.101
serde_ignored-0.0.4
serde_json-1.0.41
sha-1-0.8.1
shell-escape-0.1.4
smallvec-0.6.10
socket2-0.3.11
strsim-0.8.0
structopt-0.2.18
structopt-derive-0.2.18
syn-0.15.44
syn-1.0.5
synstructure-0.12.1
tar-0.4.26
tempfile-2.2.0
tempfile-3.1.0
termcolor-1.0.5
termios-0.3.1
textwrap-0.11.0
thread_local-0.3.6
time-0.1.42
toml-0.4.10
toml-0.5.3
typenum-1.11.2
ucd-trie-0.1.2
ucd-util-0.1.5
unicode-bidi-0.3.4
unicode-normalization-0.1.8
unicode-segmentation-1.3.0
unicode-width-0.1.6
unicode-xid-0.1.0
unicode-xid-0.2.0
url-1.7.2
utf8-ranges-1.0.4
vcpkg-0.2.7
vec_map-0.8.1
walkdir-2.2.9
wasi-0.7.0
winapi-0.2.8
winapi-0.3.8
winapi-build-0.1.1
winapi-i686-pc-windows-gnu-0.4.0
winapi-util-0.1.2
winapi-x86_64-pc-windows-gnu-0.4.0
wincolor-1.0.2
"
inherit cargo
DESCRIPTION="cargo, make me a project"
HOMEPAGE="https://github.com/ashleygwilliams/cargo-generate"
SRC_URI="$(cargo_crate_uris ${CRATES})"
RESTRICT="mirror"
LICENSE="|| ( MIT Apache-2.0 )"
SLOT="0"
KEYWORDS="~amd64"
IUSE=""
DEPEND=""
RDEPEND=""
| Gentoo Ebuild | 3 | gentoo/gentoo-rust | dev-util/cargo-generate/cargo-generate-0.5.0.ebuild | [
"BSD-3-Clause"
]
|
--
-- Portions Copyright (c) 1996-2019, PostgreSQL Global Development Group
--
--
-- SELECT
-- Test int8 64-bit integers.
-- https://github.com/postgres/postgres/blob/REL_12_BETA2/src/test/regress/sql/select.sql
--
create or replace temporary view onek2 as select * from onek;
create or replace temporary view INT8_TBL as select * from values
(cast(trim(' 123 ') as bigint), cast(trim(' 456') as bigint)),
(cast(trim('123 ') as bigint),cast('4567890123456789' as bigint)),
(cast('4567890123456789' as bigint),cast('123' as bigint)),
(cast(+4567890123456789 as bigint),cast('4567890123456789' as bigint)),
(cast('+4567890123456789' as bigint),cast('-4567890123456789' as bigint))
as INT8_TBL(q1, q2);
-- btree index
-- awk '{if($1<10){print;}else{next;}}' onek.data | sort +0n -1
--
SELECT * FROM onek
WHERE onek.unique1 < 10
ORDER BY onek.unique1;
-- [SPARK-28010] Support ORDER BY ... USING syntax
--
-- awk '{if($1<20){print $1,$14;}else{next;}}' onek.data | sort +0nr -1
--
SELECT onek.unique1, onek.stringu1 FROM onek
WHERE onek.unique1 < 20
ORDER BY unique1 DESC;
--
-- awk '{if($1>980){print $1,$14;}else{next;}}' onek.data | sort +1d -2
--
SELECT onek.unique1, onek.stringu1 FROM onek
WHERE onek.unique1 > 980
ORDER BY stringu1 ASC;
--
-- awk '{if($1>980){print $1,$16;}else{next;}}' onek.data |
-- sort +1d -2 +0nr -1
--
SELECT onek.unique1, onek.string4 FROM onek
WHERE onek.unique1 > 980
ORDER BY string4 ASC, unique1 DESC;
--
-- awk '{if($1>980){print $1,$16;}else{next;}}' onek.data |
-- sort +1dr -2 +0n -1
--
SELECT onek.unique1, onek.string4 FROM onek
WHERE onek.unique1 > 980
ORDER BY string4 DESC, unique1 ASC;
--
-- awk '{if($1<20){print $1,$16;}else{next;}}' onek.data |
-- sort +0nr -1 +1d -2
--
SELECT onek.unique1, onek.string4 FROM onek
WHERE onek.unique1 < 20
ORDER BY unique1 DESC, string4 ASC;
--
-- awk '{if($1<20){print $1,$16;}else{next;}}' onek.data |
-- sort +0n -1 +1dr -2
--
SELECT onek.unique1, onek.string4 FROM onek
WHERE onek.unique1 < 20
ORDER BY unique1 ASC, string4 DESC;
--
-- test partial btree indexes
--
-- As of 7.2, planner probably won't pick an indexscan without stats,
-- so ANALYZE first. Also, we want to prevent it from picking a bitmapscan
-- followed by sort, because that could hide index ordering problems.
--
-- ANALYZE onek2;
-- SET enable_seqscan TO off;
-- SET enable_bitmapscan TO off;
-- SET enable_sort TO off;
--
-- awk '{if($1<10){print $0;}else{next;}}' onek.data | sort +0n -1
--
SELECT onek2.* FROM onek2 WHERE onek2.unique1 < 10;
--
-- awk '{if($1<20){print $1,$14;}else{next;}}' onek.data | sort +0nr -1
--
SELECT onek2.unique1, onek2.stringu1 FROM onek2
WHERE onek2.unique1 < 20
ORDER BY unique1 DESC;
--
-- awk '{if($1>980){print $1,$14;}else{next;}}' onek.data | sort +1d -2
--
SELECT onek2.unique1, onek2.stringu1 FROM onek2
WHERE onek2.unique1 > 980;
-- RESET enable_seqscan;
-- RESET enable_bitmapscan;
-- RESET enable_sort;
-- [SPARK-28329] SELECT INTO syntax
-- SELECT two, stringu1, ten, string4
-- INTO TABLE tmp
-- FROM onek;
CREATE TABLE tmp USING parquet AS
SELECT two, stringu1, ten, string4
FROM onek;
-- Skip the person table because there is a point data type that we don't support.
--
-- awk '{print $1,$2;}' person.data |
-- awk '{if(NF!=2){print $3,$2;}else{print;}}' - emp.data |
-- awk '{if(NF!=2){print $3,$2;}else{print;}}' - student.data |
-- awk 'BEGIN{FS=" ";}{if(NF!=2){print $4,$5;}else{print;}}' - stud_emp.data
--
-- SELECT name, age FROM person*; ??? check if different
-- SELECT p.name, p.age FROM person* p;
--
-- awk '{print $1,$2;}' person.data |
-- awk '{if(NF!=2){print $3,$2;}else{print;}}' - emp.data |
-- awk '{if(NF!=2){print $3,$2;}else{print;}}' - student.data |
-- awk 'BEGIN{FS=" ";}{if(NF!=1){print $4,$5;}else{print;}}' - stud_emp.data |
-- sort +1nr -2
--
-- SELECT p.name, p.age FROM person* p ORDER BY age DESC, name;
-- [SPARK-28330] Enhance query limit
--
-- Test some cases involving whole-row Var referencing a subquery
--
select foo.* from (select 1) as foo;
select foo.* from (select null) as foo;
select foo.* from (select 'xyzzy',1,null) as foo;
--
-- Test VALUES lists
--
select * from onek, values(147, 'RFAAAA'), (931, 'VJAAAA') as v (i, j)
WHERE onek.unique1 = v.i and onek.stringu1 = v.j;
-- [SPARK-28296] Improved VALUES support
-- a more complex case
-- looks like we're coding lisp :-)
-- select * from onek,
-- (values ((select i from
-- (values(10000), (2), (389), (1000), (2000), ((select 10029))) as foo(i)
-- order by i asc limit 1))) bar (i)
-- where onek.unique1 = bar.i;
-- try VALUES in a subquery
-- select * from onek
-- where (unique1,ten) in (values (1,1), (20,0), (99,9), (17,99))
-- order by unique1;
-- VALUES is also legal as a standalone query or a set-operation member
VALUES (1,2), (3,4+4), (7,77.7);
VALUES (1,2), (3,4+4), (7,77.7)
UNION ALL
SELECT 2+2, 57
UNION ALL
TABLE int8_tbl;
--
-- Test ORDER BY options
--
CREATE OR REPLACE TEMPORARY VIEW foo AS
SELECT * FROM (values(42),(3),(10),(7),(null),(null),(1)) as foo (f1);
-- [SPARK-28333] NULLS FIRST for DESC and NULLS LAST for ASC
SELECT * FROM foo ORDER BY f1;
SELECT * FROM foo ORDER BY f1 ASC; -- same thing
SELECT * FROM foo ORDER BY f1 NULLS FIRST;
SELECT * FROM foo ORDER BY f1 DESC;
SELECT * FROM foo ORDER BY f1 DESC NULLS LAST;
-- check if indexscans do the right things
-- CREATE INDEX fooi ON foo (f1);
-- SET enable_sort = false;
-- SELECT * FROM foo ORDER BY f1;
-- SELECT * FROM foo ORDER BY f1 NULLS FIRST;
-- SELECT * FROM foo ORDER BY f1 DESC;
-- SELECT * FROM foo ORDER BY f1 DESC NULLS LAST;
-- DROP INDEX fooi;
-- CREATE INDEX fooi ON foo (f1 DESC);
-- SELECT * FROM foo ORDER BY f1;
-- SELECT * FROM foo ORDER BY f1 NULLS FIRST;
-- SELECT * FROM foo ORDER BY f1 DESC;
-- SELECT * FROM foo ORDER BY f1 DESC NULLS LAST;
-- DROP INDEX fooi;
-- CREATE INDEX fooi ON foo (f1 DESC NULLS LAST);
-- SELECT * FROM foo ORDER BY f1;
-- SELECT * FROM foo ORDER BY f1 NULLS FIRST;
-- SELECT * FROM foo ORDER BY f1 DESC;
-- SELECT * FROM foo ORDER BY f1 DESC NULLS LAST;
--
-- Test planning of some cases with partial indexes
--
-- partial index is usable
-- explain (costs off)
-- select * from onek2 where unique2 = 11 and stringu1 = 'ATAAAA';
select * from onek2 where unique2 = 11 and stringu1 = 'ATAAAA';
-- actually run the query with an analyze to use the partial index
-- explain (costs off, analyze on, timing off, summary off)
-- select * from onek2 where unique2 = 11 and stringu1 = 'ATAAAA';
-- explain (costs off)
-- select unique2 from onek2 where unique2 = 11 and stringu1 = 'ATAAAA';
select unique2 from onek2 where unique2 = 11 and stringu1 = 'ATAAAA';
-- partial index predicate implies clause, so no need for retest
-- explain (costs off)
-- select * from onek2 where unique2 = 11 and stringu1 < 'B';
select * from onek2 where unique2 = 11 and stringu1 < 'B';
-- explain (costs off)
-- select unique2 from onek2 where unique2 = 11 and stringu1 < 'B';
select unique2 from onek2 where unique2 = 11 and stringu1 < 'B';
-- but if it's an update target, must retest anyway
-- explain (costs off)
-- select unique2 from onek2 where unique2 = 11 and stringu1 < 'B' for update;
-- select unique2 from onek2 where unique2 = 11 and stringu1 < 'B' for update;
-- partial index is not applicable
-- explain (costs off)
-- select unique2 from onek2 where unique2 = 11 and stringu1 < 'C';
select unique2 from onek2 where unique2 = 11 and stringu1 < 'C';
-- partial index implies clause, but bitmap scan must recheck predicate anyway
-- SET enable_indexscan TO off;
-- explain (costs off)
-- select unique2 from onek2 where unique2 = 11 and stringu1 < 'B';
select unique2 from onek2 where unique2 = 11 and stringu1 < 'B';
-- RESET enable_indexscan;
-- check multi-index cases too
-- explain (costs off)
-- select unique1, unique2 from onek2
-- where (unique2 = 11 or unique1 = 0) and stringu1 < 'B';
select unique1, unique2 from onek2
where (unique2 = 11 or unique1 = 0) and stringu1 < 'B';
-- explain (costs off)
-- select unique1, unique2 from onek2
-- where (unique2 = 11 and stringu1 < 'B') or unique1 = 0;
select unique1, unique2 from onek2
where (unique2 = 11 and stringu1 < 'B') or unique1 = 0;
--
-- Test some corner cases that have been known to confuse the planner
--
-- ORDER BY on a constant doesn't really need any sorting
SELECT 1 AS x ORDER BY x;
-- But ORDER BY on a set-valued expression does
-- create function sillysrf(int) returns setof int as
-- 'values (1),(10),(2),($1)' language sql immutable;
-- select sillysrf(42);
-- select sillysrf(-1) order by 1;
-- drop function sillysrf(int);
-- X = X isn't a no-op, it's effectively X IS NOT NULL assuming = is strict
-- (see bug #5084)
select * from (values (2),(null),(1)) v(k) where k = k order by k;
select * from (values (2),(null),(1)) v(k) where k = k;
-- Test partitioned tables with no partitions, which should be handled the
-- same as the non-inheritance case when expanding its RTE.
-- create table list_parted_tbl (a int,b int) partition by list (a);
-- create table list_parted_tbl1 partition of list_parted_tbl
-- for values in (1) partition by list(b);
-- explain (costs off) select * from list_parted_tbl;
-- drop table list_parted_tbl;
drop table tmp;
| SQL | 5 | OlegPt/spark | sql/core/src/test/resources/sql-tests/inputs/postgreSQL/select.sql | [
"Apache-2.0"
]
|
.my-color{color:red}.my-div{background-color:red;width:150px;height:100px}
| CSS | 2 | ygyg70/quasar | vite-plugin/example/dist/assets/HelloWorld.982a4ecb.css | [
"MIT"
]
|
"""
namespace Foo.Bar
import System
def foo():
print('bar')
foo()
foo()
"""
namespace Foo.Bar
import System
def foo():
print('bar')
end
foo()
foo()
| Boo | 3 | popcatalin81/boo | tests/testcases/parser/wsa/semicolons-1.boo | [
"BSD-3-Clause"
]
|
ID ASATR_DROME Unreviewed; 1262 AA.
AC Q8IMC6; Q8IMC5;
DT 01-MAR-2003, integrated into UniProtKB/TrEMBL.
DT 09-FEB-2010, sequence version 2.
DT 05-OCT-2016, entry version 137.
DE RecName: Full=Tau-tubulin kinase homolog Asator {ECO:0000303|PubMed:19890914};
DE EC=2.7.11.1 {ECO:0000250|UniProtKB:Q5TCY1};
GN Name=Asator {ECO:0000303|PubMed:19890914};
GN ORFNames=CG11533 {ECO:0000312|FlyBase:FBgn0039908};
OS Drosophila melanogaster (Fruit fly).
OC Eukaryota; Metazoa; Ecdysozoa; Arthropoda; Hexapoda; Insecta;
OC Pterygota; Neoptera; Endopterygota; Diptera; Brachycera; Muscomorpha;
OC Ephydroidea; Drosophilidae; Drosophila; Sophophora.
OX NCBI_TaxID=7227 {ECO:0000312|Proteomes:UP000000803};
RN [1] {ECO:0000312|Proteomes:UP000000803}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
RC STRAIN=Berkeley {ECO:0000312|Proteomes:UP000000803};
RX PubMed=10731132; DOI=10.1126/science.287.5461.2185;
RA Adams M.D., Celniker S.E., Holt R.A., Evans C.A., Gocayne J.D.,
RA Amanatides P.G., Scherer S.E., Li P.W., Hoskins R.A., Galle R.F.,
RA George R.A., Lewis S.E., Richards S., Ashburner M., Henderson S.N.,
RA Sutton G.G., Wortman J.R., Yandell M.D., Zhang Q., Chen L.X.,
RA Brandon R.C., Rogers Y.-H.C., Blazej R.G., Champe M., Pfeiffer B.D.,
RA Wan K.H., Doyle C., Baxter E.G., Helt G., Nelson C.R., Miklos G.L.G.,
RA Abril J.F., Agbayani A., An H.-J., Andrews-Pfannkoch C., Baldwin D.,
RA Ballew R.M., Basu A., Baxendale J., Bayraktaroglu L., Beasley E.M.,
RA Beeson K.Y., Benos P.V., Berman B.P., Bhandari D., Bolshakov S.,
RA Borkova D., Botchan M.R., Bouck J., Brokstein P., Brottier P.,
RA Burtis K.C., Busam D.A., Butler H., Cadieu E., Center A., Chandra I.,
RA Cherry J.M., Cawley S., Dahlke C., Davenport L.B., Davies P.,
RA de Pablos B., Delcher A., Deng Z., Mays A.D., Dew I., Dietz S.M.,
RA Dodson K., Doup L.E., Downes M., Dugan-Rocha S., Dunkov B.C., Dunn P.,
RA Durbin K.J., Evangelista C.C., Ferraz C., Ferriera S., Fleischmann W.,
RA Fosler C., Gabrielian A.E., Garg N.S., Gelbart W.M., Glasser K.,
RA Glodek A., Gong F., Gorrell J.H., Gu Z., Guan P., Harris M.,
RA Harris N.L., Harvey D.A., Heiman T.J., Hernandez J.R., Houck J.,
RA Hostin D., Houston K.A., Howland T.J., Wei M.-H., Ibegwam C.,
RA Jalali M., Kalush F., Karpen G.H., Ke Z., Kennison J.A., Ketchum K.A.,
RA Kimmel B.E., Kodira C.D., Kraft C.L., Kravitz S., Kulp D., Lai Z.,
RA Lasko P., Lei Y., Levitsky A.A., Li J.H., Li Z., Liang Y., Lin X.,
RA Liu X., Mattei B., McIntosh T.C., McLeod M.P., McPherson D.,
RA Merkulov G., Milshina N.V., Mobarry C., Morris J., Moshrefi A.,
RA Mount S.M., Moy M., Murphy B., Murphy L., Muzny D.M., Nelson D.L.,
RA Nelson D.R., Nelson K.A., Nixon K., Nusskern D.R., Pacleb J.M.,
RA Palazzolo M., Pittman G.S., Pan S., Pollard J., Puri V., Reese M.G.,
RA Reinert K., Remington K., Saunders R.D.C., Scheeler F., Shen H.,
RA Shue B.C., Siden-Kiamos I., Simpson M., Skupski M.P., Smith T.J.,
RA Spier E., Spradling A.C., Stapleton M., Strong R., Sun E.,
RA Svirskas R., Tector C., Turner R., Venter E., Wang A.H., Wang X.,
RA Wang Z.-Y., Wassarman D.A., Weinstock G.M., Weissenbach J.,
RA Williams S.M., Woodage T., Worley K.C., Wu D., Yang S., Yao Q.A.,
RA Ye J., Yeh R.-F., Zaveri J.S., Zhan M., Zhang G., Zhao Q., Zheng L.,
RA Zheng X.H., Zhong F.N., Zhong W., Zhou X., Zhu S.C., Zhu X.,
RA Smith H.O., Gibbs R.A., Myers E.W., Rubin G.M., Venter J.C.;
RT "The genome sequence of Drosophila melanogaster.";
RL Science 287:2185-2195(2000).
RN [2] {ECO:0000312|Proteomes:UP000000803}
RP GENOME REANNOTATION.
RC STRAIN=Berkeley {ECO:0000312|Proteomes:UP000000803};
RX PubMed=12537572; DOI=10.1186/gb-2002-3-12-research0083;
RA Misra S., Crosby M.A., Mungall C.J., Matthews B.B., Campbell K.S.,
RA Hradecky P., Huang Y., Kaminker J.S., Millburn G.H., Prochnik S.E.,
RA Smith C.D., Tupy J.L., Whitfield E.J., Bayraktaroglu L., Berman B.P.,
RA Bettencourt B.R., Celniker S.E., de Grey A.D.N.J., Drysdale R.A.,
RA Harris N.L., Richter J., Russo S., Schroeder A.J., Shu S.Q.,
RA Stapleton M., Yamada C., Ashburner M., Gelbart W.M., Rubin G.M.,
RA Lewis S.E.;
RT "Annotation of the Drosophila melanogaster euchromatic genome: a
RT systematic review.";
RL Genome Biol. 3:RESEARCH0083.1-RESEARCH0083.22(2002).
RN [3] {ECO:0000312|EMBL:AFA28428.1}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE MRNA].
RA Carlson J., Booth B., Frise E., Park S., Wan K., Yu C., Celniker S.;
RL Submitted (FEB-2012) to the EMBL/GenBank/DDBJ databases.
RN [4] {ECO:0000305}
RP FUNCTION, INTERACTION WITH MTOR, SUBCELLULAR LOCATION, TISSUE
RP SPECIFICITY, DEVELOPMENTAL STAGE, AND DISRUPTION PHENOTYPE.
RX PubMed=19890914; DOI=10.1002/dvdy.22150;
RA Qi H., Yao C., Cai W., Girton J., Johansen K.M., Johansen J.;
RT "Asator, a tau-tubulin kinase homolog in Drosophila localizes to the
RT mitotic spindle.";
RL Dev. Dyn. 238:3248-3256(2009).
CC -!- FUNCTION: Probable serine/threonine protein kinase. {ECO:0000305}.
CC -!- CATALYTIC ACTIVITY: ATP + a protein = ADP + a phosphoprotein.
CC {ECO:0000250|UniProtKB:Q5TCY1}.
CC -!- COFACTOR:
CC Name=Mg(2+); Xref=ChEBI:CHEBI:18420; Evidence={ECO:0000305};
CC -!- SUBUNIT: Interacts with Mtor. {ECO:0000269|PubMed:19890914}.
CC -!- SUBCELLULAR LOCATION: Cytoplasm, cytoskeleton, spindle
CC {ECO:0000269|PubMed:19890914}. Cytoplasm
CC {ECO:0000269|PubMed:19890914}. Note=Found in the cytoplasm during
CC interphase. Localizes to the mitotic spindle in dividing cells.
CC {ECO:0000269|PubMed:19890914}.
CC -!- ALTERNATIVE PRODUCTS:
CC Event=Alternative splicing; Named isoforms=2;
CC Name=E {ECO:0000312|FlyBase:FBgn0039908};
CC IsoId=Q8IMC6-1; Sequence=Displayed;
CC Name=F {ECO:0000312|FlyBase:FBgn0039908};
CC IsoId=Q8IMC6-2; Sequence=?;
CC -!- TISSUE SPECIFICITY: Detected in larval brain.
CC {ECO:0000269|PubMed:19890914}.
CC -!- DEVELOPMENTAL STAGE: Detected at low levels throughout
CC development. Highest expression levels are seen in embryos.
CC {ECO:0000269|PubMed:19890914}.
CC -!- DISRUPTION PHENOTYPE: Embryonic lethal.
CC {ECO:0000269|PubMed:19890914}.
CC -!- SIMILARITY: Belongs to the protein kinase superfamily. CK1 Ser/Thr
CC protein kinase family. {ECO:0000305}.
DR EMBL; AE014135; AAN06495.2; -; Genomic_DNA.
DR EMBL; AE014135; AAN06496.2; -; Genomic_DNA.
DR EMBL; BT133187; AFA28428.1; -; mRNA.
DR RefSeq; NP_726576.2; NM_166765.3.
DR RefSeq; NP_726577.2; NM_166766.3.
DR UniGene; Dm.17798; -.
DR SMR; Q8IMC5; -.
DR STRING; 7227.FBpp0289571; -.
DR PaxDb; Q8IMC5; -.
DR PRIDE; Q8IMC5; -.
DR EnsemblMetazoa; FBtr0300343; FBpp0289572; FBgn0039908.
DR EnsemblMetazoa; FBtr0300344; FBpp0289573; FBgn0039908.
DR GeneID; 43794; -.
DR CTD; 43794; -.
DR FlyBase; FBgn0039908; Asator.
DR eggNOG; KOG1164; Eukaryota.
DR eggNOG; ENOG410XPGP; LUCA.
DR GeneTree; ENSGT00760000119040; -.
DR OrthoDB; EOG091G03H8; -.
DR SignaLink; Q8IMC5; -.
DR GenomeRNAi; 43794; -.
DR Proteomes; UP000000803; Chromosome 4.
DR Bgee; FBgn0039908; -.
DR ExpressionAtlas; Q8IMC5; differential.
DR Genevisible; Q8IMC5; DM.
DR GO; GO:0005737; C:cytoplasm; IDA:FlyBase.
DR GO; GO:0005819; C:spindle; IDA:FlyBase.
DR GO; GO:0005524; F:ATP binding; IEA:InterPro.
DR GO; GO:0004674; F:protein serine/threonine kinase activity; NAS:FlyBase.
DR GO; GO:0006468; P:protein phosphorylation; NAS:FlyBase.
DR InterPro; IPR011009; Kinase-like_dom.
DR InterPro; IPR000719; Prot_kinase_dom.
DR InterPro; IPR017441; Protein_kinase_ATP_BS.
DR Pfam; PF00069; Pkinase; 1.
DR SMART; SM00220; S_TKc; 1.
DR SUPFAM; SSF56112; SSF56112; 1.
DR PROSITE; PS00107; PROTEIN_KINASE_ATP; 1.
DR PROSITE; PS50011; PROTEIN_KINASE_DOM; 1.
PE 1: Evidence at protein level;
KW Alternative splicing; ATP-binding; Complete proteome; Cytoplasm;
KW Cytoskeleton; Nucleotide-binding; Reference proteome; Transferase.
FT CHAIN 1 1262 Tau-tubulin kinase homolog Asator.
FT DOMAIN 173 436 Protein kinase. {ECO:0000255|PROSITE-
FT ProRule:PRU00159}.
FT NP_BIND 179 187 ATP. {ECO:0000255|PROSITE-
FT ProRule:PRU00159}.
FT ACT_SITE 293 293 Proton acceptor. {ECO:0000255|PROSITE-
FT ProRule:PRU00159}.
FT BINDING 202 202 ATP. {ECO:0000255|PROSITE-
FT ProRule:PRU00159}.
FT VAR_SEQ 1 156 Missing (in isoform F).
FT VAR_SEQ 945 967 YRMDIARNVCVRETYSEITHLAR -> SILNKSLPVIIYIY
FT MHAVTFFCF (in isoform F).
FT VAR_SEQ 968 1262 Missing (in isoform F).
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000250; UniProtKB:Q5TCY1; EHE; 11-JAN-2017.
**EV ECO:0000255; PROSITE-ProRule:PRU00159; EHE; 10-JAN-2017.
**EV ECO:0000269; PubMed:19890914; EHE; 10-JAN-2017.
**EV ECO:0000303; PubMed:19890914; EHE; 10-JAN-2017.
**EV ECO:0000305; -; EHE; 11-JAN-2017.
**EV ECO:0000312; EMBL:AFA28428.1; EHE; 10-JAN-2017.
**EV ECO:0000312; FlyBase:FBgn0039908; EHE; 10-JAN-2017.
**EV ECO:0000312; Proteomes:UP000000803; EHE; 10-JAN-2017.
**IS Q8IMC6-3
**ZA EHE, 10-JAN-2017;
**ZZ See related logfile eheASATR.log which updates evidence tag in
**ZZ experimental master. Did not merge the isoforms with only weak
**ZZ transcript support in FlyBase.
**ZZ CURATED.
SQ SEQUENCE 1262 AA; 138828 MW; 48E1EEBAD9D51DE6 CRC64;
MFWHLLCVPN DENASAPDDG NQSCQPSSKQ DQYLSPNRNC QKNLLRLYPP PPSKPPPLVG
AILQTRLLHQ ISPSAIADAD ADLNAVGELL YPNVLQRSAT LPAKHNRLGV RSRVTFKVPS
SNLPAQDSYS HQPRNQVAVA AKDGILVDVK AKESVKMTSE DLLQPGHVVK ERWKVVRKIG
GGGFGEIYEG QDLITREQVA LKVESARQPK QVLKMEVAVL KKLQGKEHVC RFIGCGRNDR
FNYVVMQLQG KNLAELRRAQ PRGAFSLSTT LRLGLQILKA IESIHSVGFL HRDIKPSNFS
VGRLPYNCRR VYMLDFGLAR QYTTGTGEVR CPRAAAGFRG TVRYASINAH RNREMGRHDD
LWSLFYMLVE FVNGQLPWRK IKDKEQVGLT KEKYDHRILL KHLPSDLKQF LEHIQSLTYG
DRPDYAMLIG LFERCMKRRG VKESDPYDWE KVDSTAIGNI SATGNPSIPI KSDYMHGNIT
QMTVAASNAS GTEYIRKRAE IETAHITATD PLNIKEKVDK NCNATSLAQP AKGSGEPMVQ
HGNAANNQNI TSKGLQQQST LTNSQVAIAN IQSAPSMIER EDVQYTKLEE GAPTKFITMK
PNGECDNVDI AAKCIFEQKH VEANDDIVGR ASLSGVEQHY KSQIKKHNSP EIANKQIQRT
GTVTNDKTSE VNRSTEEQKS TFGRLRVLTA PPMSVHDLPS GGGHSHQVSD LSGKQDPYAA
TSNAAPIGIN SSSTKFGSQH GQIFGLAAMP PINRRSATST NLRPSSSASQ RINSGSTIGG
AVGNGSNTAR SSVAGDHSVT QFALIDDENV SALQQVTKGG ALTLASQWKS QFDDSEDTTD
NEWNREHQLQ PNLEQLIKLD ISLPLNEAKP FPQHGVAGTG KLINPPGEAK GRPKRYTLNI
TGIENYEALR ISIPNCWSEP AMGNVLRKGL EPPAVQQAAF DDTVYRMDIA RNVCVRETYS
EITHLARPST SSVLRNRLPS PFKKDSALQL NSTNDSLDKS RHRNSLPNVS VNDIFDDLQM
KLNLDLGSAI QENNCCISGR LEIRVIPKDT SHPDDSVYYD AMGAVKNTPT ANEGHDHSDQ
AVNNCDEMEA TSAVIAFPNK SISKIMSPPG RDATEERTGA SLCSLYSAGV NKLKLNGNTA
PRTQFKKGST DGFGENESEF DFPLLNPSKI PVRQSKCASW AGADFISASK PLESAEVPQE
IPYHPQSDTT YSVIDSIPVR KTTYSIALEC PPNISDLTPG LSYFYCNIVV PLRLFSILLT
ES
//
ID RYA_DROME Unreviewed; 109 AA.
AC G5CKU5; A8Y508; V9I0I4;
DT 14-DEC-2011, integrated into UniProtKB/TrEMBL.
DT 14-DEC-2011, sequence version 1.
DT 07-SEP-2016, entry version 38.
DE RecName: Full=RYamide neuropeptides {ECO:0000303|PubMed:21704020, ECO:0000303|PubMed:21843505};
DE AltName: Full=Neuropeptide Y-like receptor ligand {ECO:0000303|PubMed:21704020, ECO:0000303|PubMed:21843505};
DE Contains:
DE RecName: Full=RYamide-1 {ECO:0000303|PubMed:21704020, ECO:0000303|PubMed:21843505};
DE Contains:
DE RecName: Full=RYamide-2 {ECO:0000303|PubMed:21704020, ECO:0000303|PubMed:21843505};
DE Flags: Precursor;
GN Name=RYa {ECO:0000303|PubMed:21704020, ECO:0000303|PubMed:21843505};
GN Synonyms=NepYr {ECO:0000303|PubMed:21704020};
GN ORFNames=CG40733 {ECO:0000312|FlyBase:FBgn0085512};
OS Drosophila melanogaster (Fruit fly).
OC Eukaryota; Metazoa; Ecdysozoa; Arthropoda; Hexapoda; Insecta;
OC Pterygota; Neoptera; Endopterygota; Diptera; Brachycera; Muscomorpha;
OC Ephydroidea; Drosophilidae; Drosophila; Sophophora.
OX NCBI_TaxID=7227 {ECO:0000312|Proteomes:UP000000803};
RN [1] {ECO:0000312|EMBL:AEP22449.1}
RP NUCLEOTIDE SEQUENCE [MRNA], SYNTHESIS OF RYAMIDE-1 AND RYAMIDE-2,
RP FUNCTION, SUBCELLULAR LOCATION, AND AMIDATION AT TYR-33 AND TYR-63.
RX PubMed=21843505; DOI=10.1016/j.bbrc.2011.07.131;
RA Collin C., Hauser F., Krogh-Meyer P., Hansen K.K.,
RA Gonzalez de Valdivia E., Williamson M., Grimmelikhuijzen C.J.;
RT "Identification of the Drosophila and Tribolium receptors for the
RT recently discovered insect RYamide neuropeptides.";
RL Biochem. Biophys. Res. Commun. 412:578-583(2011).
RN [2] {ECO:0000312|EMBL:BAM66571.1}
RP NUCLEOTIDE SEQUENCE [MRNA], PROTEIN SEQUENCE OF 25-33 AND 54-63,
RP SYNTHESIS OF RYAMIDE-1 AND RYAMIDE-2, FUNCTION, SUBCELLULAR LOCATION,
RP AND AMIDATION AT TYR-33 AND TYR-63.
RX PubMed=21704020; DOI=10.1016/j.bbrc.2011.06.081;
RA Ida T., Takahashi T., Tominaga H., Sato T., Kume K., Ozaki M.,
RA Hiraguchi T., Maeda T., Shiotani H., Terajima S., Sano H., Mori K.,
RA Yoshida M., Miyazato M., Kato J., Murakami N., Kangawa K., Kojima M.;
RT "Identification of the novel bioactive peptides dRYamide-1 and
RT dRYamide-2, ligands for a neuropeptide Y-like receptor in
RT Drosophila.";
RL Biochem. Biophys. Res. Commun. 410:872-877(2011).
RN [3] {ECO:0000312|Proteomes:UP000000803}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
RC STRAIN=Berkeley {ECO:0000312|Proteomes:UP000000803};
RX PubMed=10731132; DOI=10.1126/science.287.5461.2185;
RA Adams M.D., Celniker S.E., Holt R.A., Evans C.A., Gocayne J.D.,
RA Amanatides P.G., Scherer S.E., Li P.W., Hoskins R.A., Galle R.F.,
RA George R.A., Lewis S.E., Richards S., Ashburner M., Henderson S.N.,
RA Sutton G.G., Wortman J.R., Yandell M.D., Zhang Q., Chen L.X.,
RA Brandon R.C., Rogers Y.-H.C., Blazej R.G., Champe M., Pfeiffer B.D.,
RA Wan K.H., Doyle C., Baxter E.G., Helt G., Nelson C.R., Miklos G.L.G.,
RA Abril J.F., Agbayani A., An H.-J., Andrews-Pfannkoch C., Baldwin D.,
RA Ballew R.M., Basu A., Baxendale J., Bayraktaroglu L., Beasley E.M.,
RA Beeson K.Y., Benos P.V., Berman B.P., Bhandari D., Bolshakov S.,
RA Borkova D., Botchan M.R., Bouck J., Brokstein P., Brottier P.,
RA Burtis K.C., Busam D.A., Butler H., Cadieu E., Center A., Chandra I.,
RA Cherry J.M., Cawley S., Dahlke C., Davenport L.B., Davies P.,
RA de Pablos B., Delcher A., Deng Z., Mays A.D., Dew I., Dietz S.M.,
RA Dodson K., Doup L.E., Downes M., Dugan-Rocha S., Dunkov B.C., Dunn P.,
RA Durbin K.J., Evangelista C.C., Ferraz C., Ferriera S., Fleischmann W.,
RA Fosler C., Gabrielian A.E., Garg N.S., Gelbart W.M., Glasser K.,
RA Glodek A., Gong F., Gorrell J.H., Gu Z., Guan P., Harris M.,
RA Harris N.L., Harvey D.A., Heiman T.J., Hernandez J.R., Houck J.,
RA Hostin D., Houston K.A., Howland T.J., Wei M.-H., Ibegwam C.,
RA Jalali M., Kalush F., Karpen G.H., Ke Z., Kennison J.A., Ketchum K.A.,
RA Kimmel B.E., Kodira C.D., Kraft C.L., Kravitz S., Kulp D., Lai Z.,
RA Lasko P., Lei Y., Levitsky A.A., Li J.H., Li Z., Liang Y., Lin X.,
RA Liu X., Mattei B., McIntosh T.C., McLeod M.P., McPherson D.,
RA Merkulov G., Milshina N.V., Mobarry C., Morris J., Moshrefi A.,
RA Mount S.M., Moy M., Murphy B., Murphy L., Muzny D.M., Nelson D.L.,
RA Nelson D.R., Nelson K.A., Nixon K., Nusskern D.R., Pacleb J.M.,
RA Palazzolo M., Pittman G.S., Pan S., Pollard J., Puri V., Reese M.G.,
RA Reinert K., Remington K., Saunders R.D.C., Scheeler F., Shen H.,
RA Shue B.C., Siden-Kiamos I., Simpson M., Skupski M.P., Smith T.J.,
RA Spier E., Spradling A.C., Stapleton M., Strong R., Sun E.,
RA Svirskas R., Tector C., Turner R., Venter E., Wang A.H., Wang X.,
RA Wang Z.-Y., Wassarman D.A., Weinstock G.M., Weissenbach J.,
RA Williams S.M., Woodage T., Worley K.C., Wu D., Yang S., Yao Q.A.,
RA Ye J., Yeh R.-F., Zaveri J.S., Zhan M., Zhang G., Zhao Q., Zheng L.,
RA Zheng X.H., Zhong F.N., Zhong W., Zhou X., Zhu S.C., Zhu X.,
RA Smith H.O., Gibbs R.A., Myers E.W., Rubin G.M., Venter J.C.;
RT "The genome sequence of Drosophila melanogaster.";
RL Science 287:2185-2195(2000).
RN [4] {ECO:0000312|Proteomes:UP000000803}
RP GENOME REANNOTATION.
RC STRAIN=Berkeley {ECO:0000312|Proteomes:UP000000803};
RX PubMed=12537572; DOI=10.1186/gb-2002-3-12-research0083;
RA Misra S., Crosby M.A., Mungall C.J., Matthews B.B., Campbell K.S.,
RA Hradecky P., Huang Y., Kaminker J.S., Millburn G.H., Prochnik S.E.,
RA Smith C.D., Tupy J.L., Whitfield E.J., Bayraktaroglu L., Berman B.P.,
RA Bettencourt B.R., Celniker S.E., de Grey A.D.N.J., Drysdale R.A.,
RA Harris N.L., Richter J., Russo S., Schroeder A.J., Shu S.Q.,
RA Stapleton M., Yamada C., Ashburner M., Gelbart W.M., Rubin G.M.,
RA Lewis S.E.;
RT "Annotation of the Drosophila melanogaster euchromatic genome: a
RT systematic review.";
RL Genome Biol. 3:RESEARCH0083.1-RESEARCH0083.22(2002).
CC -!- FUNCTION: Neuropeptides RYamide-1 and RYamide-2 are ligands for
CC the G-protein coupled receptor RYa-R (PubMed:21843505,
CC PubMed:21704020). May suppress feeding behavior (PubMed:21704020).
CC {ECO:0000269|PubMed:21704020, ECO:0000269|PubMed:21843505}.
CC -!- SUBCELLULAR LOCATION: Secreted {ECO:0000305|PubMed:21704020,
CC ECO:0000305|PubMed:21843505}.
DR EMBL; HQ698845; ADZ15313.1; -; mRNA.
DR EMBL; JN222358; AEP22449.1; -; mRNA.
DR EMBL; AB638268; BAM66571.1; -; mRNA.
DR EMBL; AE013599; EDP28140.3; -; Genomic_DNA.
DR RefSeq; NP_001104382.3; NM_001110912.3.
DR UniGene; Dm.37076; -.
DR UniGene; Dm.39039; -.
DR STRING; 7227.FBpp0302660; -.
DR PaxDb; V9I0I4; -.
DR EnsemblMetazoa; FBtr0310523; FBpp0302660; FBgn0085512.
DR GeneID; 5740597; -.
DR KEGG; dme:Dmel_CG40733; -.
DR CTD; 5740597; -.
DR FlyBase; FBgn0085512; RYa.
DR eggNOG; ENOG410KB8H; Eukaryota.
DR eggNOG; ENOG4110NIA; LUCA.
DR OrthoDB; EOG091G13KS; -.
DR ChiTaRS; NepYr; fly.
DR GenomeRNAi; 5740597; -.
DR Proteomes; UP000000803; Chromosome 2R.
DR GO; GO:0005576; C:extracellular region; IC:FlyBase.
DR GO; GO:0005615; C:extracellular space; IC:FlyBase.
DR GO; GO:0048018; F:receptor agonist activity; IPI:FlyBase.
DR GO; GO:0007166; P:cell surface receptor signaling pathway; IDA:FlyBase.
DR GO; GO:2000252; P:negative regulation of feeding behavior; IDA:FlyBase.
PE 2: Evidence at transcript level;
KW Amidation; Cleavage on pair of basic residues; Complete proteome;
KW Direct protein sequencing; Neuropeptide; Reference proteome; Secreted;
KW Signal.
FT SIGNAL 1 22 {ECO:0000305|PubMed:21704020}.
FT PEPTIDE 25 33 RYamide-1. {ECO:0000269|PubMed:21704020,
FT ECO:0000305|PubMed:21843505}.
FT PROPEP 36 53 {ECO:0000305}.
FT PEPTIDE 54 63 RYamide-2. {ECO:0000269|PubMed:21704020,
FT ECO:0000305|PubMed:21843505}.
FT PROPEP 67 109 {ECO:0000305}.
FT MOD_RES 33 33 Tyrosine amide.
FT {ECO:0000305|PubMed:21704020,
FT ECO:0000305|PubMed:21843505}.
FT MOD_RES 63 63 Tyrosine amide.
FT {ECO:0000305|PubMed:21704020,
FT ECO:0000305|PubMed:21843505}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000269; PubMed:21704020; EHE; 10-JAN-2017.
**EV ECO:0000269; PubMed:21843505; EHE; 10-JAN-2017.
**EV ECO:0000303; PubMed:21704020; EHE; 10-JAN-2017.
**EV ECO:0000303; PubMed:21843505; EHE; 10-JAN-2017.
**EV ECO:0000305; -; EHE; 10-JAN-2017.
**EV ECO:0000305; PubMed:21704020; EHE; 10-JAN-2017.
**EV ECO:0000305; PubMed:21843505; EHE; 10-JAN-2017.
**EV ECO:0000312; EMBL:AEP22449.1; EHE; 10-JAN-2017.
**EV ECO:0000312; EMBL:BAM66571.1; EHE; 10-JAN-2017.
**EV ECO:0000312; FlyBase:FBgn0085512; EHE; 10-JAN-2017.
**EV ECO:0000312; Proteomes:UP000000803; EHE; 12-JAN-2017.
**ZA EHE, 10-JAN-2017;
**ZZ Merged 2 TrEMBL entries. See related logfile eheRYA.log which updates
**ZZ the fly receptor, and TrEMBL entries D6WT67 (RYA_TRICA) and G4WMX4
**ZZ (RYAR_TRICA).
**ZZ CURATED.
SQ SEQUENCE 109 AA; 13167 MW; 5C22387ECBEB53D4 CRC64;
MNECVNKLLH LKFLFYFILG IQKRPVFFVA SRYGRSTTYD ESLKSRRIFI VPRNEHFFLG
SRYGKRSGKY LCLSREINKL IVRKRLRNND KERTPTLSFI TKHFLMRNT
//
ID RYA_TRICA Unreviewed; 128 AA.
AC D6WT67;
DT 10-AUG-2010, integrated into UniProtKB/TrEMBL.
DT 10-AUG-2010, sequence version 1.
DT 07-SEP-2016, entry version 24.
DE RecName: Full=RYamide neuropeptides {ECO:0000303|PubMed:21843505};
DE Contains:
DE RecName: Full=RYamide-1 {ECO:0000303|PubMed:21843505};
DE Contains:
DE RecName: Full=RYamide-2 {ECO:0000303|PubMed:21843505};
DE Flags: Precursor;
GN Name=RYa {ECO:0000303|PubMed:21843505};
GN ORFNames=TC008650 {ECO:0000312|EMBL:EFA05855.1};
OS Tribolium castaneum (Red flour beetle).
OC Eukaryota; Metazoa; Ecdysozoa; Arthropoda; Hexapoda; Insecta;
OC Pterygota; Neoptera; Endopterygota; Coleoptera; Polyphaga;
OC Cucujiformia; Tenebrionidae; Tenebrionidae incertae sedis; Tribolium.
OX NCBI_TaxID=7070 {ECO:0000312|Proteomes:UP000007266};
RN [1] {ECO:0000312|EMBL:AEP22448.1}
RP NUCLEOTIDE SEQUENCE [MRNA], SYNTHESIS OF RYAMIDE-1 AND RYAMIDE-2,
RP FUNCTION, SUBCELLULAR LOCATION, AND AMIDATION AT TYR-44 AND TYR-73.
RX PubMed=21843505; DOI=10.1016/j.bbrc.2011.07.131;
RA Collin C., Hauser F., Krogh-Meyer P., Hansen K.K.,
RA Gonzalez de Valdivia E., Williamson M., Grimmelikhuijzen C.J.;
RT "Identification of the Drosophila and Tribolium receptors for the
RT recently discovered insect RYamide neuropeptides.";
RL Biochem. Biophys. Res. Commun. 412:578-583(2011).
RN [2] {ECO:0000312|Proteomes:UP000007266}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
RC STRAIN=Georgia GA2 {ECO:0000312|Proteomes:UP000007266};
RX PubMed=18362917; DOI=10.1038/nature06784;
RG Tribolium Genome Sequencing Consortium;
RA Richards S., Gibbs R.A., Weinstock G.M., Brown S.J., Denell R.,
RA Beeman R.W., Gibbs R., Beeman R.W., Brown S.J., Bucher G.,
RA Friedrich M., Grimmelikhuijzen C.J., Klingler M., Lorenzen M.,
RA Richards S., Roth S., Schroder R., Tautz D., Zdobnov E.M., Muzny D.,
RA Gibbs R.A., Weinstock G.M., Attaway T., Bell S., Buhay C.J.,
RA Chandrabose M.N., Chavez D., Clerk-Blankenburg K.P., Cree A., Dao M.,
RA Davis C., Chacko J., Dinh H., Dugan-Rocha S., Fowler G., Garner T.T.,
RA Garnes J., Gnirke A., Hawes A., Hernandez J., Hines S., Holder M.,
RA Hume J., Jhangiani S.N., Joshi V., Khan Z.M., Jackson L., Kovar C.,
RA Kowis A., Lee S., Lewis L.R., Margolis J., Morgan M., Nazareth L.V.,
RA Nguyen N., Okwuonu G., Parker D., Richards S., Ruiz S.J.,
RA Santibanez J., Savard J., Scherer S.E., Schneider B., Sodergren E.,
RA Tautz D., Vattahil S., Villasana D., White C.S., Wright R., Park Y.,
RA Beeman R.W., Lord J., Oppert B., Lorenzen M., Brown S., Wang L.,
RA Savard J., Tautz D., Richards S., Weinstock G., Gibbs R.A., Liu Y.,
RA Worley K., Weinstock G., Elsik C.G., Reese J.T., Elhaik E., Landan G.,
RA Graur D., Arensburger P., Atkinson P., Beeman R.W., Beidler J.,
RA Brown S.J., Demuth J.P., Drury D.W., Du Y.Z., Fujiwara H.,
RA Lorenzen M., Maselli V., Osanai M., Park Y., Robertson H.M., Tu Z.,
RA Wang J.J., Wang S., Richards S., Song H., Zhang L., Sodergren E.,
RA Werner D., Stanke M., Morgenstern B., Solovyev V., Kosarev P.,
RA Brown G., Chen H.C., Ermolaeva O., Hlavina W., Kapustin Y.,
RA Kiryutin B., Kitts P., Maglott D., Pruitt K., Sapojnikov V.,
RA Souvorov A., Mackey A.J., Waterhouse R.M., Wyder S., Zdobnov E.M.,
RA Zdobnov E.M., Wyder S., Kriventseva E.V., Kadowaki T., Bork P.,
RA Aranda M., Bao R., Beermann A., Berns N., Bolognesi R., Bonneton F.,
RA Bopp D., Brown S.J., Bucher G., Butts T., Chaumot A., Denell R.E.,
RA Ferrier D.E., Friedrich M., Gordon C.M., Jindra M., Klingler M.,
RA Lan Q., Lattorff H.M., Laudet V., von Levetsow C., Liu Z., Lutz R.,
RA Lynch J.A., da Fonseca R.N., Posnien N., Reuter R., Roth S.,
RA Savard J., Schinko J.B., Schmitt C., Schoppmeier M., Schroder R.,
RA Shippy T.D., Simonnet F., Marques-Souza H., Tautz D., Tomoyasu Y.,
RA Trauner J., Van der Zee M., Vervoort M., Wittkopp N., Wimmer E.A.,
RA Yang X., Jones A.K., Sattelle D.B., Ebert P.R., Nelson D., Scott J.G.,
RA Beeman R.W., Muthukrishnan S., Kramer K.J., Arakane Y., Beeman R.W.,
RA Zhu Q., Hogenkamp D., Dixit R., Oppert B., Jiang H., Zou Z.,
RA Marshall J., Elpidina E., Vinokurov K., Oppert C., Zou Z., Evans J.,
RA Lu Z., Zhao P., Sumathipala N., Altincicek B., Vilcinskas A.,
RA Williams M., Hultmark D., Hetru C., Jiang H., Grimmelikhuijzen C.J.,
RA Hauser F., Cazzamali G., Williamson M., Park Y., Li B., Tanaka Y.,
RA Predel R., Neupert S., Schachtner J., Verleyen P., Raible F., Bork P.,
RA Friedrich M., Walden K.K., Robertson H.M., Angeli S., Foret S.,
RA Bucher G., Schuetz S., Maleszka R., Wimmer E.A., Beeman R.W.,
RA Lorenzen M., Tomoyasu Y., Miller S.C., Grossmann D., Bucher G.;
RT "The genome of the model beetle and pest Tribolium castaneum.";
RL Nature 452:949-955(2008).
RN [3] {ECO:0000312|Proteomes:UP000007266}
RP GENOME REANNOTATION.
RC STRAIN=Georgia GA2 {ECO:0000312|Proteomes:UP000007266};
RX PubMed=19820115; DOI=10.1093/nar/gkp807;
RA Kim H.S., Murphy T., Xia J., Caragea D., Park Y., Beeman R.W.,
RA Lorenzen M.D., Butcher S., Manak J.R., Brown S.J.;
RT "BeetleBase in 2010: revisions to provide comprehensive genomic
RT information for Tribolium castaneum.";
RL Nucleic Acids Res. 38:D437-D442(2010).
CC -!- FUNCTION: Neuropeptides RYamide-1 and RYamide-2 are ligands for
CC the G-protein coupled receptor RYa-R. RYamide-2 is the most potent
CC activator of RYa-R. {ECO:0000269|PubMed:21843505}.
CC -!- SUBCELLULAR LOCATION: Secreted {ECO:0000305|PubMed:21843505}.
DR EMBL; JN200817; AEP22448.1; -; mRNA.
DR EMBL; KQ971354; EFA05855.1; -; Genomic_DNA.
DR RefSeq; NP_001280530.1; NM_001293601.1.
DR UniGene; Tca.19478; -.
DR EnsemblMetazoa; TC008650-RA; TC008650-PA; TC008650.
DR GeneID; 100750223; -.
DR KEGG; tca:100750223; -.
DR Proteomes; UP000007266; Linkage group 7.
PE 2: Evidence at transcript level;
KW Amidation; Cleavage on pair of basic residues; Complete proteome;
KW Neuropeptide; Reference proteome; Secreted; Signal.
FT SIGNAL 1 23 {ECO:0000255}.
FT PROPEP 26 29 {ECO:0000305}.
FT PEPTIDE 32 44 RYamide-1. {ECO:0000305|PubMed:21843505}.
FT PROPEP 47 63 {ECO:0000305}.
FT PEPTIDE 64 73 RYamide-2. {ECO:0000305|PubMed:21843505}.
FT PROPEP 77 128 {ECO:0000305}.
FT MOD_RES 44 44 Tyrosine amide.
FT {ECO:0000305|PubMed:21843505}.
FT MOD_RES 73 73 Tyrosine amide.
FT {ECO:0000305|PubMed:21843505}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000255; -; EHE; 10-JAN-2017.
**EV ECO:0000269; PubMed:21843505; EHE; 10-JAN-2017.
**EV ECO:0000303; PubMed:21843505; EHE; 10-JAN-2017.
**EV ECO:0000305; -; EHE; 10-JAN-2017.
**EV ECO:0000305; PubMed:21843505; EHE; 10-JAN-2017.
**EV ECO:0000312; EMBL:AEP22448.1; EHE; 10-JAN-2017.
**EV ECO:0000312; EMBL:EFA05855.1; EHE; 10-JAN-2017.
**EV ECO:0000312; Proteomes:UP000007266; EHE; 10-JAN-2017.
**ZA EHE, 10-JAN-2017;
**ZZ See related TrEMBL entries G5CKU5 (RYA_DROME) and G4WMX4 (RYAR_TRICA),
**ZZ and logfile eheRYA.log.
**ZZ CURATED.
SQ SEQUENCE 128 AA; 14298 MW; 62DD396A2679FE5C CRC64;
MHARKLIVVL VYILTVLVSV AVSKRYTSEK RVQNLATFKT MMRYGRGGPS PNNKENKVNI
RPRADAFFLG PRYGKRSGWS PNASLVYPVS TPLCGLDEDL SCAYTGISDL YRCTPRKGES
EEFTTSSN
//
ID RYAR_TRICA Unreviewed; 367 AA.
AC G4WMX4;
DT 14-DEC-2011, integrated into UniProtKB/TrEMBL.
DT 14-DEC-2011, sequence version 1.
DT 16-MAR-2016, entry version 20.
DE RecName: Full=RYamide receptor {ECO:0000303|PubMed:21843505};
GN Name=RYa-R {ECO:0000303|PubMed:21843505};
OS Tribolium castaneum (Red flour beetle).
OC Eukaryota; Metazoa; Ecdysozoa; Arthropoda; Hexapoda; Insecta;
OC Pterygota; Neoptera; Endopterygota; Coleoptera; Polyphaga;
OC Cucujiformia; Tenebrionidae; Tenebrionidae incertae sedis; Tribolium.
OX NCBI_TaxID=7070 {ECO:0000312|EMBL:ADZ17181.1};
RN [1] {ECO:0000312|EMBL:ADZ17181.1}
RP NUCLEOTIDE SEQUENCE [MRNA], FUNCTION, AND SUBCELLULAR LOCATION.
RX PubMed=21843505; DOI=10.1016/j.bbrc.2011.07.131;
RA Collin C., Hauser F., Krogh-Meyer P., Hansen K.K.,
RA Gonzalez de Valdivia E., Williamson M., Grimmelikhuijzen C.J.;
RT "Identification of the Drosophila and Tribolium receptors for the
RT recently discovered insect RYamide neuropeptides.";
RL Biochem. Biophys. Res. Commun. 412:578-583(2011).
CC -!- FUNCTION: Receptor for the neuropeptides RYamide-1 and RYamide-2.
CC The activity of this receptor is mediated by G proteins which
CC activate a phosphatidyl-inositol-calcium second messenger system.
CC RYamide-2 is the most potent activator.
CC {ECO:0000269|PubMed:21843505}.
CC -!- SUBCELLULAR LOCATION: Cell membrane {ECO:0000269|PubMed:21843505};
CC Multi-pass membrane protein {ECO:0000255}.
CC -!- SIMILARITY: Belongs to the G-protein coupled receptor 1 family.
CC {ECO:0000305}.
DR EMBL; HQ709383; ADZ17181.1; -; mRNA.
DR RefSeq; NP_001280539.1; NM_001293610.1.
DR UniGene; Tca.18873; -.
DR STRING; 7070.TC001056-PA; -.
DR GeneID; 664001; -.
DR KEGG; tca:664001; -.
DR eggNOG; KOG3656; Eukaryota.
DR eggNOG; ENOG410XRW9; LUCA.
DR KO; K14072; -.
DR GO; GO:0016021; C:integral component of membrane; IEA:UniProtKB-KW.
DR GO; GO:0004983; F:neuropeptide Y receptor activity; IEA:InterPro.
DR InterPro; IPR000276; GPCR_Rhodpsn.
DR InterPro; IPR017452; GPCR_Rhodpsn_7TM.
DR InterPro; IPR000611; NPY_rcpt.
DR Pfam; PF00001; 7tm_1; 1.
DR PRINTS; PR00237; GPCRRHODOPSN.
DR PRINTS; PR01012; NRPEPTIDEYR.
DR PROSITE; PS50262; G_PROTEIN_RECEP_F1_2; 1.
PE 2: Evidence at transcript level;
KW Cell membrane; G-protein coupled receptor; Glycoprotein; Membrane;
KW Receptor; Transducer; Transmembrane; Transmembrane helix.
FT CHAIN 1 367 RYamide receptor.
FT TOPO_DOM 1 35 Extracellular. {ECO:0000305}.
FT TRANSMEM 36 56 Helical; Name=1. {ECO:0000255}.
FT TOPO_DOM 57 66 Cytoplasmic. {ECO:0000305}.
FT TRANSMEM 67 87 Helical; Name=2. {ECO:0000255}.
FT TOPO_DOM 88 113 Extracellular. {ECO:0000305}.
FT TRANSMEM 114 134 Helical; Name=3. {ECO:0000255}.
FT TOPO_DOM 135 143 Cytoplasmic. {ECO:0000305}.
FT TRANSMEM 144 164 Helical; Name=4. {ECO:0000255}.
FT TOPO_DOM 165 212 Extracellular. {ECO:0000305}.
FT TRANSMEM 213 233 Helical; Name=5. {ECO:0000255}.
FT TOPO_DOM 234 258 Cytoplasmic. {ECO:0000305}.
FT TRANSMEM 259 279 Helical; Name=6. {ECO:0000255}.
FT TOPO_DOM 280 282 Extracellular. {ECO:0000305}.
FT TRANSMEM 283 303 Helical; Name=7. {ECO:0000255}.
FT TOPO_DOM 304 367 Cytoplasmic. {ECO:0000305}.
FT CARBOHYD 4 4 N-linked (GlcNAc...).
FT {ECO:0000255|PROSITE-ProRule:PRU00498}.
FT CARBOHYD 8 8 N-linked (GlcNAc...).
FT {ECO:0000255|PROSITE-ProRule:PRU00498}.
FT CARBOHYD 21 21 N-linked (GlcNAc...).
FT {ECO:0000255|PROSITE-ProRule:PRU00498}.
FT CARBOHYD 107 107 N-linked (GlcNAc...).
FT {ECO:0000255|PROSITE-ProRule:PRU00498}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000255; -; EHE; 10-JAN-2017.
**EV ECO:0000255; PROSITE-ProRule:PRU00498; EHE; 10-JAN-2017.
**EV ECO:0000269; PubMed:21843505; EHE; 10-JAN-2017.
**EV ECO:0000303; PubMed:21843505; EHE; 10-JAN-2017.
**EV ECO:0000305; -; EHE; 10-JAN-2017.
**EV ECO:0000312; EMBL:ADZ17181.1; EHE; 10-JAN-2017.
**ZA EHE, 10-JAN-2017;
**ZZ See related TrEMBL entries D6WT67 (RYA_TRICA), P25931 (RYAR_DROME),
**ZZ and logfile eheRYA.log.
**ZZ CURATED.
SQ SEQUENCE 367 AA; 41851 MW; E99D9449EFA565A5 CRC64;
MDANTTRNES FSLDCELVNP NSTLANVYFL SAVYSMYAII FVVALIGNSF VCYIVLSSPP
MRTVTNFFIL NLAIGDVLIT LLCVPFTSVS LLMQYWPFGG ILCPVVNYSQ ALSVFVSAYT
LVAISIDKYM IIMWPLKPRI SKRFATYIIA LVWLIAGITV LPSATFTTLI NDENILGTSA
YEQCDKYICA EEYSKVGQEY GDLYTKVLMF LQYVIPSLVL LFTYTSIGVV IWCHRIPGEA
ENSRDQRIAK NKTKMIKMMV TVVCVYTICW LPYNVLMIFK EHISGSVMVY LYFPLHGLAM
SHACYNPIIY CYMNARFRNG FLQVMMSIPC LRRCNSINDI SKILTCRWKV RRVHLYREIT
RAQPTSA
//
ID CLE38_CAEEL Unreviewed; 382 AA.
AC O45824;
DT 01-JUN-1998, integrated into UniProtKB/TrEMBL.
DT 06-FEB-2013, sequence version 2.
DT 18-JAN-2017, entry version 117.
DE RecName: Full=C-type lectin clec-38 {ECO:0000312|WormBase:T25E12.10};
GN Name=clec-38 {ECO:0000312|WormBase:T25E12.10};
GN ORFNames=T25E12.10 {ECO:0000312|WormBase:T25E12.10};
OS Caenorhabditis elegans.
OC Eukaryota; Metazoa; Ecdysozoa; Nematoda; Chromadorea; Rhabditida;
OC Rhabditoidea; Rhabditidae; Peloderinae; Caenorhabditis.
OX NCBI_TaxID=6239 {ECO:0000312|Proteomes:UP000001940};
RN [1] {ECO:0000312|Proteomes:UP000001940}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
RC STRAIN=Bristol N2 {ECO:0000312|Proteomes:UP000001940};
RX PubMed=9851916; DOI=10.1126/science.282.5396.2012;
RG The C. elegans sequencing consortium;
RT "Genome sequence of the nematode C. elegans: a platform for
RT investigating biology.";
RL Science 282:2012-2018(1998).
RN [2] {ECO:0000305}
RP FUNCTION, TISSUE SPECIFICITY, DEVELOPMENTAL STAGE, DISRUPTION
RP PHENOTYPE, AND MUTAGENESIS OF ASN-369.
RX PubMed=18434533; DOI=10.1523/JNEUROSCI.5542-07.2008;
RA Kulkarni G., Li H., Wadsworth W.G.;
RT "CLEC-38, a transmembrane protein with C-type lectin-like domains,
RT negatively regulates UNC-40-mediated axon outgrowth and promotes
RT presynaptic development in Caenorhabditis elegans.";
RL J. Neurosci. 28:4541-4550(2008).
CC -!- FUNCTION: Plays a role in axon guidance by modulating the unc-40-
CC mediated outgrowth of axons from motor and sensory neurons along
CC the dorsal axis of the body. Also, promotes synaptogenesis in
CC axons which have already reached their targets.
CC {ECO:0000269|PubMed:18434533}.
CC -!- SUBCELLULAR LOCATION: Membrane {ECO:0000255}; Single-pass type II
CC membrane protein {ECO:0000255}.
CC -!- TISSUE SPECIFICITY: Expressed in ventral cord motor neurons, PLM
CC touch neurons, head neurons and the intestine.
CC {ECO:0000269|PubMed:18434533}.
CC -!- DEVELOPMENTAL STAGE: Expressed from embryogenesis to adulthood.
CC Expressed in head neurons and intestine of three-fold stage
CC embryos. {ECO:0000269|PubMed:18434533}.
CC -!- DISRUPTION PHENOTYPE: RNAi-mediated knockdown results in a mild
CC dumpy phenotype whereby animals are shorter and fatter in
CC appearance as compared to wild-type animals.
CC {ECO:0000269|PubMed:18434533}.
DR EMBL; BX284605; CAB04828.2; -; Genomic_DNA.
DR PIR; T25280; T25280.
DR RefSeq; NP_507233.2; NM_074832.2.
DR ProteinModelPortal; O45824; -.
DR SMR; O45824; -.
DR STRING; 6239.T25E12.10; -.
DR PaxDb; O45824; -.
DR EnsemblMetazoa; T25E12.10; T25E12.10; WBGene00012025.
DR GeneID; 188900; -.
DR KEGG; cel:CELE_T25E12.10; -.
DR UCSC; T25E12.10; c. elegans.
DR CTD; 188900; -.
DR WormBase; T25E12.10; CE47844; WBGene00012025; clec-38.
DR eggNOG; KOG4297; Eukaryota.
DR eggNOG; ENOG410XPJ1; LUCA.
DR GeneTree; ENSGT00390000015732; -.
DR HOGENOM; HOG000114689; -.
DR InParanoid; O45824; -.
DR OMA; KVICASG; -.
DR OrthoDB; EOG091G0EGC; -.
DR Proteomes; UP000001940; Chromosome V.
DR Bgee; WBGene00012025; -.
DR GO; GO:0016021; C:integral component of membrane; IEA:UniProtKB-KW.
DR GO; GO:0030246; F:carbohydrate binding; IEA:UniProtKB-KW.
DR Gene3D; 3.10.100.10; -; 2.
DR InterPro; IPR001304; C-type_lectin-like.
DR InterPro; IPR016186; C-type_lectin-like/link.
DR InterPro; IPR018378; C-type_lectin_CS.
DR InterPro; IPR016187; CTDL_fold.
DR Pfam; PF00059; Lectin_C; 2.
DR SMART; SM00034; CLECT; 2.
DR SUPFAM; SSF56436; SSF56436; 2.
DR PROSITE; PS00615; C_TYPE_LECTIN_1; 1.
DR PROSITE; PS50041; C_TYPE_LECTIN_2; 2.
PE 4: Predicted;
KW Complete proteome; Disulfide bond; Glycoprotein; Lectin; Membrane;
KW Neurogenesis; Reference proteome; Repeat; Signal-anchor;
KW Transmembrane; Transmembrane helix.
FT CHAIN 1 382 C-type lectin clec-38. {ECO:0000305}.
FT TRANSMEM 41 61 Helical; Signal-anchor. {ECO:0000255}.
FT DOMAIN 129 250 C-type lectin 1. {ECO:0000255|PROSITE-
FT ProRule:PRU00040}.
FT DOMAIN 264 377 C-type lectin 2. {ECO:0000255|PROSITE-
FT ProRule:PRU00040}.
FT CARBOHYD 108 108 N-linked (GlcNAc...).
FT {ECO:0000255|PROSITE-ProRule:PRU00498}.
FT CARBOHYD 189 189 N-linked (GlcNAc...).
FT {ECO:0000255|PROSITE-ProRule:PRU00498}.
FT DISULFID 150 249 {ECO:0000255|PROSITE-ProRule:PRU00040}.
FT DISULFID 223 241 {ECO:0000255|PROSITE-ProRule:PRU00040}.
FT DISULFID 285 376 {ECO:0000255|PROSITE-ProRule:PRU00040}.
FT DISULFID 348 368 {ECO:0000255|PROSITE-ProRule:PRU00040}.
FT MUTAGEN 369 369 N->K: In ur280; axon guidance defects.
FT {ECO:0000269|PubMed:18434533}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000255; -; HEB; 12-JAN-2017.
**EV ECO:0000255; PROSITE-ProRule:PRU00040; HEB; 03-JAN-2017.
**EV ECO:0000255; PROSITE-ProRule:PRU00498; HEB; 03-JAN-2017.
**EV ECO:0000269; PubMed:18434533; HEB; 03-JAN-2017.
**EV ECO:0000305; -; HEB; 03-JAN-2017.
**EV ECO:0000312; Proteomes:UP000001940; HEB; 03-JAN-2017.
**EV ECO:0000312; WormBase:T25E12.10; HEB; 03-JAN-2017.
**ZA HEB, 04-JAN-2017;
**ZZ Update of unc-40 (G5EF96) mentioned in PMID:18434533 to follow.
**ZZ Related to hb_clec38_related.log.
**ZZ CURATED.
SQ SEQUENCE 382 AA; 42702 MW; C1C7143480FDD255 CRC64;
MAIFYDDPLE RLNQPIKTKS YRKKQVVQRV HVFIFDNWKL ILLGILNLIF LIIAIVFAIL
FFVGSADCAQ LPDYTTSPAS QLTTSAISSR TSEVQTNAIT TTQGTPSNKT STTTPSTSKV
ICASGFTLVG TKCGKLVSSN QPRTEADSIC KGYGGSTLFS VRNEQETRDM LDFVKDSNID
FLWTGLVCNQ TARTSCIWDV KSGTTADYNN FADGFPNVVY GYCIYFIVTG NSAGQWGSEQ
CSQLMNFVCE LPTTIRDPDC KYNYNKNCYI RFDITLTIPQ AQRFCNEKGA DLVSIHSANE
NRFILTIYDI HGQILLGGLA PAVDFIVWLD GSPTTYSNLL YFYDTRSCVL MTVARGGPYD
GDWYTMNCNV QEFFLCKRAI DF
//
ID MEC15_CAEEL Unreviewed; 406 AA.
AC Q22071;
DT 01-NOV-1996, integrated into UniProtKB/TrEMBL.
DT 01-NOV-1996, sequence version 1.
DT 18-JAN-2017, entry version 141.
DE RecName: Full=F-box/WD repeat-containing protein mec-15 {ECO:0000305};
DE AltName: Full=Mechanosensory abnormality protein 15 {ECO:0000312|WormBase:T01E8.4};
GN Name=mec-15 {ECO:0000312|WormBase:T01E8.4};
GN ORFNames=T01E8.4 {ECO:0000312|WormBase:T01E8.4};
OS Caenorhabditis elegans.
OC Eukaryota; Metazoa; Ecdysozoa; Nematoda; Chromadorea; Rhabditida;
OC Rhabditoidea; Rhabditidae; Peloderinae; Caenorhabditis.
OX NCBI_TaxID=6239 {ECO:0000312|Proteomes:UP000001940};
RN [1] {ECO:0000312|Proteomes:UP000001940}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
RC STRAIN=Bristol N2 {ECO:0000312|Proteomes:UP000001940};
RX PubMed=9851916; DOI=10.1126/science.282.5396.2012;
RG The C. elegans sequencing consortium;
RT "Genome sequence of the nematode C. elegans: a platform for
RT investigating biology.";
RL Science 282:2012-2018(1998).
RN [2] {ECO:0000305}
RP FUNCTION, AND DISRUPTION PHENOTYPE.
RX PubMed=8692859;
RA Gu G., Caldwell G.A., Chalfie M.;
RT "Genetic interactions affecting touch sensitivity in Caenorhabditis
RT elegans.";
RL Proc. Natl. Acad. Sci. U.S.A. 93:6577-6582(1996).
RN [3] {ECO:0000305}
RP FUNCTION, TISSUE SPECIFICITY, DEVELOPMENTAL STAGE, AND DISRUPTION
RP PHENOTYPE.
RX PubMed=19652181; DOI=10.1534/genetics.109.105726;
RA Bounoutas A., Zheng Q., Nonet M.L., Chalfie M.;
RT "mec-15 encodes an F-box protein required for touch receptor neuron
RT mechanosensation, synapse formation and development.";
RL Genetics 183:607-617(2009).
RN [4] {ECO:0000305}
RP FUNCTION, SUBCELLULAR LOCATION, TISSUE SPECIFICITY, AND DISRUPTION
RP PHENOTYPE.
RX PubMed=23527112; DOI=10.1371/journal.pone.0059132;
RA Sun Y., Hu Z., Goeb Y., Dreier L.;
RT "The F-box protein MEC-15 (FBXW9) promotes synaptic transmission in
RT GABAergic motor neurons in C. elegans.";
RL PLoS ONE 8:E59132-E59132(2013).
CC -!- FUNCTION: Plays a role in mechanosensory transduction (touch
CC sensitivity), touch receptor neuron development and synapse
CC formation (PubMed:8692859, PubMed:19652181). Regulates expression
CC of the protein snb-1 and the distribution of synaptic vesicles at
CC synapses to promote synaptic transmission at the neuromuscular
CC junctions of GABAergic motor neurons (PubMed:23527112).
CC {ECO:0000269|PubMed:19652181, ECO:0000269|PubMed:23527112,
CC ECO:0000269|PubMed:8692859}.
CC -!- SUBCELLULAR LOCATION: Perikaryon {ECO:0000269|PubMed:23527112}.
CC -!- TISSUE SPECIFICITY: Expressed in several neurons in the head, tail
CC and ventral cord, but absent in touch receptor neurons in adults
CC (PubMed:19652181, PubMed:23527112). Expressed in GABAergic and
CC cholinergic motor neurons (PubMed:23527112).
CC {ECO:0000269|PubMed:19652181, ECO:0000269|PubMed:23527112}.
CC -!- DEVELOPMENTAL STAGE: Expressed in touch receptor neurons and
CC several neurons in the head, tail and ventral cord during larval
CC development. {ECO:0000269|PubMed:19652181}.
CC -!- DISRUPTION PHENOTYPE: Temperature-sensitive phenotype with
CC defective touch receptor neuron sensitivity (PubMed:8692859,
CC PubMed:19652181). Touch receptor neurons and GABAergic motor
CC neurons have mis-localized presynaptic vesicles as indicated by
CC aberrant expression of the protein snb-1 and distorted cell bodies
CC (PubMed:19652181, PubMed:23527112). Reduced rate of inhibitory
CC postsynaptic currents at the neuromuscular junctions of GABAergic
CC motor neurons and increased rate of paralysis in response to
CC acetylcholine esterase inhibition by the drug Aldicarb
CC (PubMed:23527112). {ECO:0000269|PubMed:19652181,
CC ECO:0000269|PubMed:23527112, ECO:0000269|PubMed:8692859}.
DR EMBL; BX284602; CAA88747.1; -; Genomic_DNA.
DR PIR; T24301; T24301.
DR RefSeq; NP_496207.1; NM_063806.6.
DR UniGene; Cel.14496; -.
DR ProteinModelPortal; Q22071; -.
DR STRING; 6239.T01E8.4.1; -.
DR EPD; Q22071; -.
DR PaxDb; Q22071; -.
DR PeptideAtlas; Q22071; -.
DR EnsemblMetazoa; T01E8.4; T01E8.4; WBGene00003177.
DR GeneID; 174587; -.
DR KEGG; cel:CELE_T01E8.4; -.
DR UCSC; T01E8.4; c. elegans.
DR CTD; 174587; -.
DR WormBase; T01E8.4; CE02308; WBGene00003177; mec-15.
DR eggNOG; ENOG410IQD3; Eukaryota.
DR eggNOG; ENOG4111G8F; LUCA.
DR GeneTree; ENSGT00390000006806; -.
DR HOGENOM; HOG000021824; -.
DR InParanoid; Q22071; -.
DR KO; K10265; -.
DR OMA; WCASHEL; -.
DR OrthoDB; EOG091G0AVG; -.
DR PhylomeDB; Q22071; -.
DR Reactome; R-CEL-983168; Antigen processing: Ubiquitination & Proteasome degradation.
DR SignaLink; Q22071; -.
DR Proteomes; UP000001940; Chromosome II.
DR Bgee; WBGene00003177; -.
DR GO; GO:0048666; P:neuron development; IMP:WormBase.
DR GO; GO:1902805; P:positive regulation of synaptic vesicle transport; IMP:WormBase.
DR Gene3D; 2.130.10.10; -; 1.
DR InterPro; IPR001810; F-box_dom.
DR InterPro; IPR015943; WD40/YVTN_repeat-like_dom.
DR InterPro; IPR001680; WD40_repeat.
DR InterPro; IPR017986; WD40_repeat_dom.
DR Pfam; PF12937; F-box-like; 1.
DR Pfam; PF00400; WD40; 1.
DR SMART; SM00256; FBOX; 1.
DR SMART; SM00320; WD40; 4.
DR SUPFAM; SSF50978; SSF50978; 1.
DR SUPFAM; SSF81383; SSF81383; 1.
DR PROSITE; PS50181; FBOX; 1.
DR PROSITE; PS50082; WD_REPEATS_2; 1.
DR PROSITE; PS50294; WD_REPEATS_REGION; 1.
PE 1: Evidence at protein level;
KW Complete proteome; Reference proteome; Repeat; WD repeat.
FT CHAIN 1 406 F-box/WD repeat-containing protein mec-
FT 15. {ECO:0000305}.
FT DOMAIN 6 53 F-box. {ECO:0000255|PROSITE-
FT ProRule:PRU00080}.
FT REPEAT 101 142 WD 1. {ECO:0000255}.
FT REPEAT 156 195 WD 2. {ECO:0000255}.
FT REPEAT 242 279 WD 3. {ECO:0000255}.
FT REPEAT 281 320 WD 4. {ECO:0000255}.
FT REPEAT 365 406 WD 5. {ECO:0000255}.
**
** ################# INTERNAL SECTION ##################
**DR PROSITE; PS00678; WD_REPEATS_1; FALSE_NEG.
**EV ECO:0000255; -; HEB; 04-JAN-2017.
**EV ECO:0000255; PROSITE-ProRule:PRU00080; HEB; 04-JAN-2017.
**EV ECO:0000269; PubMed:19652181; HEB; 05-JAN-2017.
**EV ECO:0000269; PubMed:23527112; HEB; 09-JAN-2017.
**EV ECO:0000269; PubMed:8692859; HEB; 09-JAN-2017.
**EV ECO:0000305; -; HEB; 09-JAN-2017.
**EV ECO:0000312; Proteomes:UP000001940; HEB; 04-JAN-2017.
**EV ECO:0000312; WormBase:T01E8.4; HEB; 04-JAN-2017.
**ZA HEB, 10-JAN-2017;
**ZZ Update of other mec proteins mentioned in PMID:8692859 to follow.
**ZZ CURATED.
SQ SEQUENCE 406 AA; 46173 MW; D3B5F68B370C6F0C CRC64;
MTNAQPTELI SLPSELLCHL FTYLPQRQLI TEIPLVCRRF NTILNDDKFW SRRIRTEQKV
RLPDCELKHP EYEPKKSFYA MHRQRDRWRA WETQTVITAP GHSATVDSVM LFENNNKQFC
LSGSRDRTIR LWSIENARNG EDTEQNPWTV AKDDTAHSGW IWNMAQESTS TNFYTTSWDS
TVKSWHITDN GALQNLNSVN VGSAAQCISC SGNENEVVCT TFAKRVAVID SRTFQVVADH
KLHKRAVIAL AVQGDKIFTS GEDRLMMMVD RRNFSKPVLF EYSPTAYKSC LSLQCNQLLT
STSDGKVKLY DANNFNVLQT YSVGSYTRQS FLEHGAHLIM ARSLKRNYTF SIYSPGTRSQ
QWCASHELAA EPAKFDYSPS SRTLAIGNGD SSILFCLPAS APDQEN
//
ID RAB28_CAEEL Unreviewed; 248 AA.
AC Q9XWR6; I7EVL1;
DT 01-NOV-1999, integrated into UniProtKB/TrEMBL.
DT 01-NOV-1999, sequence version 1.
DT 30-NOV-2016, entry version 117.
DE RecName: Full=Ras-related protein Rab-28 {ECO:0000250|UniProtKB:P51157};
DE Flags: Precursor;
GN Name=rab-28 {ECO:0000312|WormBase:Y11D7A.4};
GN ORFNames=Y11D7A.4 {ECO:0000312|WormBase:Y11D7A.4};
OS Caenorhabditis elegans.
OC Eukaryota; Metazoa; Ecdysozoa; Nematoda; Chromadorea; Rhabditida;
OC Rhabditoidea; Rhabditidae; Peloderinae; Caenorhabditis.
OX NCBI_TaxID=6239 {ECO:0000312|Proteomes:UP000001940};
RN [1] {ECO:0000312|EMBL:AFP33158.1}
RP NUCLEOTIDE SEQUENCE [MRNA] OF 2-24.
RX PubMed=23185324; DOI=10.1371/journal.pone.0049387;
RA Gallegos M.E., Balakrishnan S., Chandramouli P., Arora S.,
RA Azameera A., Babushekar A., Bargoma E., Bokhari A., Chava S.K.,
RA Das P., Desai M., Decena D., Saramma S.D., Dey B., Doss A.L., Gor N.,
RA Gudiputi L., Guo C., Hande S., Jensen M., Jones S., Jones N.,
RA Jorgens D., Karamchedu P., Kamrani K., Kolora L.D., Kristensen L.,
RA Kwan K., Lau H., Maharaj P., Mander N., Mangipudi K., Menakuru H.,
RA Mody V., Mohanty S., Mukkamala S., Mundra S.A., Nagaraju S.,
RA Narayanaswamy R., Ndungu-Case C., Noorbakhsh M., Patel J., Patel P.,
RA Pendem S.V., Ponakala A., Rath M., Robles M.C., Rokkam D., Roth C.,
RA Sasidharan P., Shah S., Tandon S., Suprai J., Truong T.Q.,
RA Uthayaruban R., Varma A., Ved U., Wang Z., Yu Z.;
RT "The C. elegans Rab family: Identification, classification and toolkit
RT construction.";
RL PLoS ONE 7:E49387-E49387(2012).
RN [2] {ECO:0000312|Proteomes:UP000001940}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
RC STRAIN=Bristol N2 {ECO:0000312|Proteomes:UP000001940};
RX PubMed=9851916; DOI=10.1126/science.282.5396.2012;
RG The C. elegans sequencing consortium;
RT "Genome sequence of the nematode C. elegans: a platform for
RT investigating biology.";
RL Science 282:2012-2018(1998).
RN [3] {ECO:0000305}
RP FUNCTION, SUBCELLULAR LOCATION, TISSUE SPECIFICITY, DISRUPTION
RP PHENOTYPE, AND MUTAGENESIS OF THR-49 AND GLN-95.
RX PubMed=27930654; DOI=10.1371/journal.pgen.1006469;
RA Jensen V.L., Carter S., Sanders A.A., Li C., Kennedy J., Timbers T.A.,
RA Cai J., Scheidel N., Kennedy B.N., Morin R.D., Leroux M.R.,
RA Blacque O.E.;
RT "Whole-organism developmental expression profiling identifies rab-28
RT as a novel ciliary GTPase associated with the BBSome and
RT intraflagellar transport.";
RL PLoS Genet. 12:E1006469-E1006469(2016).
CC -!- FUNCTION: GTPase and intraflagellar transport protein which
CC undergoes bidirectional movement along the ciliary axoneme and
CC maintains cilium structure and function in ciliated neurons. May
CC also be required for normal sensory movements including roaming
CC behavior. {ECO:0000269|PubMed:27930654,
CC ECO:0000305|PubMed:27930654}.
CC -!- SUBCELLULAR LOCATION: Cell projection, cilium
CC {ECO:0000269|PubMed:27930654}. Cell projection, cilium membrane
CC {ECO:0000269|PubMed:27930654}. Perikaryon
CC {ECO:0000269|PubMed:27930654}. Note=Recruited to the periciliary
CC membrane by bbs-8. {ECO:0000269|PubMed:27930654}.
CC -!- TISSUE SPECIFICITY: Expressed in amphid and phasmid ciliated
CC neurons. {ECO:0000269|PubMed:27930654}.
CC -!- DISRUPTION PHENOTYPE: No obvious defects in ciliary structure,
CC transport or function. {ECO:0000269|PubMed:27930654}.
CC -!- SIMILARITY: Belongs to the small GTPase superfamily. Rab family.
CC {ECO:0000305}.
DR EMBL; BX284604; CAA21582.1; -; Genomic_DNA.
DR EMBL; JQ235194; AFP33158.1; -; mRNA.
DR PIR; T26461; T26461.
DR RefSeq; NP_501609.1; NM_069208.1.
DR UniGene; Cel.12152; -.
DR ProteinModelPortal; Q9XWR6; -.
DR SMR; Q9XWR6; -.
DR STRING; 6239.Y11D7A.4; -.
DR EPD; Q9XWR6; -.
DR PaxDb; I7EVL1; -.
DR PaxDb; Q9XWR6; -.
DR PeptideAtlas; I7EVL1; -.
DR EnsemblMetazoa; Y11D7A.4; Y11D7A.4; WBGene00004281.
DR GeneID; 189429; -.
DR KEGG; cel:CELE_Y11D7A.4; -.
DR UCSC; Y11D7A.4; c. elegans.
DR CTD; 189429; -.
DR WormBase; Y11D7A.4; CE19030; WBGene00004281; rab-28.
DR eggNOG; KOG0078; Eukaryota.
DR eggNOG; ENOG410XPUI; LUCA.
DR GeneTree; ENSGT00800000124173; -.
DR HOGENOM; HOG000233968; -.
DR InParanoid; Q9XWR6; -.
DR KO; K07915; -.
DR OMA; CFQRIAA; -.
DR OrthoDB; EOG091G11JJ; -.
DR PhylomeDB; Q9XWR6; -.
DR Proteomes; UP000001940; Chromosome IV.
DR Bgee; WBGene00004281; -.
DR GO; GO:0005622; C:intracellular; IEA:GOC.
DR GO; GO:0005525; F:GTP binding; IEA:InterPro.
DR GO; GO:0007264; P:small GTPase mediated signal transduction; IEA:InterPro.
DR Gene3D; 3.40.50.300; -; 1.
DR InterPro; IPR027417; P-loop_NTPase.
DR InterPro; IPR005225; Small_GTP-bd_dom.
DR InterPro; IPR001806; Small_GTPase.
DR Pfam; PF00071; Ras; 1.
DR SUPFAM; SSF52540; SSF52540; 1.
DR TIGRFAMs; TIGR00231; small_GTP; 1.
PE 1: Evidence at protein level;
KW Cell membrane; Cell projection; Cilium; Complete proteome;
KW GTP-binding; Lipoprotein; Membrane; Methylation; Nucleotide-binding;
KW Prenylation; Reference proteome; Transport.
FT CHAIN 1 248 Ras-related protein Rab-28.
FT {ECO:0000305}.
FT PROPEP 246 248 Removed in mature form.
FT {ECO:0000250|UniProtKB:P51157}.
FT NP_BIND 42 50 GTP. {ECO:0000305|PubMed:27930654}.
FT NP_BIND 91 95 GTP. {ECO:0000305|PubMed:27930654}.
FT NP_BIND 152 155 GTP. {ECO:0000250|UniProtKB:P51157}.
FT NP_BIND 182 184 GTP. {ECO:0000250|UniProtKB:P51157}.
FT MOTIF 64 72 Effector region. {ECO:0000305}.
FT MUTAGEN 49 49 T->N: Inactive GDP-bound state. Cilia-
FT related sensory abnormalities and failure
FT to undergo intraflagellar transport.
FT {ECO:0000269|PubMed:27930654}.
FT MUTAGEN 95 95 Q->L: Constitutively active GTP-bound
FT state. Cilia-related sensory
FT abnormalities, but undergoes
FT intraflagellar transport, but at a
FT reduced frequency compared to wild-type.
FT {ECO:0000269|PubMed:27930654}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000250; UniProtKB:P51157; HEB; 10-JAN-2017.
**EV ECO:0000269; PubMed:27930654; HEB; 11-JAN-2017.
**EV ECO:0000305; -; HEB; 11-JAN-2017.
**EV ECO:0000305; PubMed:27930654; HEB; 10-JAN-2017.
**EV ECO:0000312; EMBL:AFP33158.1; HEB; 11-JAN-2017.
**EV ECO:0000312; Proteomes:UP000001940; HEB; 10-JAN-2017.
**EV ECO:0000312; WormBase:Y11D7A.4; HEB; 10-JAN-2017.
**ZA HEB, 11-JAN-2017;
**ZZ No experimental master could be identified for the Effector region in
**ZZ the FT comments and so a curator tag was added.
**ZZ Emailed Wormbase to request gene name updates to the fam-161, rpi-1
**ZZ and maph-9 Wormbase entries.
**ZZ Related to fam-161 (Q9XX47), ccdc-104 (Q95Y36), rpi-1 (Q69Z08),
**ZZ ccdc-149 (Q93635) and maph-9 (Q18452).
**ZZ Related to hb_rab28_related.log.
**ZZ CURATED.
SQ SEQUENCE 248 AA; 27319 MW; 3F17527F9BC58EE2 CRC64;
MTTMGEDEAP ALPKKSPLPE KIDEADVDDD PDDKVIKIVV VGDGASGKTS ICQRFAKESF
DKSYHQTLGL DFFSRRITLP HEMQVLVQVW DIGGQSIAGE MIDKYLTGAN IVFLVYDVTN
SKSFENAVDW LSVVKKNTKS SETPVKLVLM GNKTDLEERR VVSVEAHKNF ATSNDMMPTY
VSAKTGDTVF LTFRQAVAEV LNVGLSRAEV EADIEIVQGS VIEQPKQSDA SYARRSDQSR
STSVCSIT
//
ID F161_CAEEL Unreviewed; 814 AA.
AC Q9XX47;
DT 01-NOV-1999, integrated into UniProtKB/TrEMBL.
DT 01-NOV-1999, sequence version 1.
DT 30-NOV-2016, entry version 96.
DE RecName: Full=Protein fam-161 {ECO:0000305};
GN Name=fam-161 {ECO:0000303|PubMed:27930654};
GN ORFNames=Y38H6C.14 {ECO:0000312|EMBL:CAA20992.1,
GN ECO:0000312|WormBase:Y38H6C.14};
OS Caenorhabditis elegans.
OC Eukaryota; Metazoa; Ecdysozoa; Nematoda; Chromadorea; Rhabditida;
OC Rhabditoidea; Rhabditidae; Peloderinae; Caenorhabditis.
OX NCBI_TaxID=6239 {ECO:0000312|Proteomes:UP000001940};
RN [1] {ECO:0000312|Proteomes:UP000001940}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
RC STRAIN=Bristol N2 {ECO:0000312|Proteomes:UP000001940};
RX PubMed=9851916; DOI=10.1126/science.282.5396.2012;
RG The C. elegans sequencing consortium;
RT "Genome sequence of the nematode C. elegans: a platform for
RT investigating biology.";
RL Science 282:2012-2018(1998).
RN [2] {ECO:0000305}
RP SUBCELLULAR LOCATION, AND TISSUE SPECIFICITY.
RX PubMed=27930654; DOI=10.1371/journal.pgen.1006469;
RA Jensen V.L., Carter S., Sanders A.A., Li C., Kennedy J., Timbers T.A.,
RA Cai J., Scheidel N., Kennedy B.N., Morin R.D., Leroux M.R.,
RA Blacque O.E.;
RT "Whole-organism developmental expression profiling identifies rab-28
RT as a novel ciliary GTPase associated with the BBSome and
RT intraflagellar transport.";
RL PLoS Genet. 12:E1006469-E1006469(2016).
CC -!- INTERACTION:
CC G5EGG0:uso-1; NbExp=3; IntAct=EBI-330289, EBI-311986;
CC -!- SUBCELLULAR LOCATION: Cell projection, cilium
CC {ECO:0000269|PubMed:27930654}. Cytoplasm, cytoskeleton, cilium
CC axoneme {ECO:0000269|PubMed:27930654}. Note=Localizes to the base
CC of the cilium and also to the proximal part of the ciliary
CC axoneme, including the transition zone.
CC {ECO:0000269|PubMed:27930654}.
CC -!- TISSUE SPECIFICITY: Expressed in amphid and phasmid ciliated
CC neurons. {ECO:0000269|PubMed:27930654}.
CC -!- SIMILARITY: Belongs to the FAM161 family. {ECO:0000305}.
DR EMBL; BX284605; CAA20992.1; -; Genomic_DNA.
DR PIR; T26702; T26702.
DR RefSeq; NP_507957.1; NM_075556.3.
DR UniGene; Cel.1854; -.
DR ProteinModelPortal; Q9XX47; -.
DR DIP; DIP-26699N; -.
DR IntAct; Q9XX47; 6.
DR MINT; MINT-1065449; -.
DR STRING; 6239.Y38H6C.14; -.
DR PaxDb; Q9XX47; -.
DR EnsemblMetazoa; Y38H6C.14; Y38H6C.14; WBGene00012626.
DR GeneID; 189695; -.
DR KEGG; cel:CELE_Y38H6C.14; -.
DR UCSC; Y38H6C.14; c. elegans.
DR CTD; 189695; -.
DR WormBase; Y38H6C.14; CE19108; WBGene00012626; fam-161.
DR eggNOG; ENOG410K7I0; Eukaryota.
DR eggNOG; ENOG4110MCV; LUCA.
DR HOGENOM; HOG000017839; -.
DR InParanoid; Q9XX47; -.
DR OMA; TNTFATE; -.
DR OrthoDB; EOG091G0A2Z; -.
DR Proteomes; UP000001940; Chromosome V.
DR Bgee; WBGene00012626; -.
PE 1: Evidence at protein level;
KW Cell projection; Cilium; Coiled coil; Complete proteome; Cytoplasm;
KW Cytoskeleton; Reference proteome.
FT CHAIN 1 814 Protein fam-161. {ECO:0000305}.
FT COILED 606 689 {ECO:0000255}.
FT COMPBIAS 738 812 Ser-rich. {ECO:0000255|PROSITE-
FT ProRule:PRU00016}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000255; -; HEB; 10-JAN-2017.
**EV ECO:0000255; PROSITE-ProRule:PRU00016; HEB; 10-JAN-2017.
**EV ECO:0000269; PubMed:27930654; HEB; 10-JAN-2017.
**EV ECO:0000303; PubMed:27930654; HEB; 10-JAN-2017.
**EV ECO:0000305; -; HEB; 11-JAN-2017.
**EV ECO:0000312; EMBL:CAA20992.1; HEB; 10-JAN-2017.
**EV ECO:0000312; Proteomes:UP000001940; HEB; 11-JAN-2017.
**EV ECO:0000312; WormBase:Y38H6C.14; HEB; 10-JAN-2017.
**ZA HEB, 11-JAN-2017;
**ZZ Related to rab-28 (Q9XWR6), ccdc-104 (Q95Y36), rpi-1 (Q69Z08),
**ZZ ccdc-149 (Q93635) and maph-9 (Q18452).
**ZZ CURATED.
SQ SEQUENCE 814 AA; 90729 MW; 1F8B9725453DABB7 CRC64;
MAPPKDPPVL RNLQATADLL DALQNDPSLL NDEEFIKRLS ILRQKHEETT NFLAKKLGAP
PLPTMMTSSE ITQHRSSYKV TKSSSCHFQD EASPSDYQMP RHLDLKPRSS EVRVPVRAAP
EPPREQSWSQ TEYATLAHNQ SHEALYEDPR HQVHATSSHQ NPRHQSSRHH NIESTAPSQV
SVTSSVQSVA ALSGQNPRQQ VHATPSHQIP RHQSSRTHQN SRQQVPSATS STLQNPRHRT
SSASRHHSTR NATSATVRQI LANASTRHLS SAPHIATSVA MPSGLLLSSS NTKHVASSKS
ENPQFATSSH VVEESFLEDG MSTTREVPTI RDEVVAGDLK LSKNRSKSMH QLSKYTPQVT
VPKPFQLSLR KSTGNTYAKK FMSGLITEKQ KLEEDAKKAL ENTKFRAKPV PKSTYQPTNT
FATEQKYVEA MRKKVAAKAR RKFEVQNEMV RSKSEGNLAS IKPLGYVPPS TYISPIPVKP
NARSRSATMR ATILIQEATT PKGIKSHRAQ SNLTHHLRHG RCTMDASAVS LHRRTSPPDF
EKIHAKITDN FRNTNSKPST VPIPFKFASR SKSATSRHGN CQEQAPKPFK KSTENLPKTS
KNRVPSTHAT QLREELNRAK IELKKSEKSG KNGNFWAEDN KQRISSFLGA RSKTEEDIAM
RTKQKLQQQQ ETTQEYMRQL AEMKQRVLNG PLIMEKQTAL AQEHRLKRKF EERMKSAKGR
GIERVQSQEK QQSIGRRSSE VSGSGTFVVD KGYEESFESE DKSEKSGSST PSESGSGSES
ENESRSSRSS KPKSSKSTSS KSSSSRSTSS SSEA
//
ID CFA36_CAEEL Unreviewed; 685 AA.
AC Q95Y36; A0A0K3ASD3;
DT 01-DEC-2001, integrated into UniProtKB/TrEMBL.
DT 01-DEC-2001, sequence version 1.
DT 18-JAN-2017, entry version 90.
DE RecName: Full=Cilia- and flagella-associated protein 36 {ECO:0000250|UniProtKB:Q96G28};
DE AltName: Full=Coiled-coil domain-containing protein 104 {ECO:0000250|UniProtKB:Q96G28};
GN Name=cfap-36 {ECO:0000312|WormBase:Y108G3AL.3a};
GN Synonyms=ccdc-104 {ECO:0000303|PubMed:27930654,
GN ECO:0000312|WormBase:Y108G3AL.3a};
GN ORFNames=Y108G3AL.3 {ECO:0000312|WormBase:Y108G3AL.3a};
OS Caenorhabditis elegans.
OC Eukaryota; Metazoa; Ecdysozoa; Nematoda; Chromadorea; Rhabditida;
OC Rhabditoidea; Rhabditidae; Peloderinae; Caenorhabditis.
OX NCBI_TaxID=6239 {ECO:0000312|Proteomes:UP000001940};
RN [1] {ECO:0000312|Proteomes:UP000001940}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
RC STRAIN=Bristol N2 {ECO:0000312|Proteomes:UP000001940};
RX PubMed=9851916; DOI=10.1126/science.282.5396.2012;
RG The C. elegans sequencing consortium;
RT "Genome sequence of the nematode C. elegans: a platform for
RT investigating biology.";
RL Science 282:2012-2018(1998).
RN [2] {ECO:0000305}
RP SUBCELLULAR LOCATION, AND TISSUE SPECIFICITY.
RX PubMed=27930654; DOI=10.1371/journal.pgen.1006469;
RA Jensen V.L., Carter S., Sanders A.A., Li C., Kennedy J., Timbers T.A.,
RA Cai J., Scheidel N., Kennedy B.N., Morin R.D., Leroux M.R.,
RA Blacque O.E.;
RT "Whole-organism developmental expression profiling identifies rab-28
RT as a novel ciliary GTPase associated with the BBSome and
RT intraflagellar transport.";
RL PLoS Genet. 12:E1006469-E1006469(2016).
CC -!- SUBCELLULAR LOCATION: Cell projection, cilium
CC {ECO:0000269|PubMed:27930654}. Cytoplasm, cytoskeleton, cilium
CC axoneme {ECO:0000269|PubMed:27930654}. Note=Localizes to the base
CC of the cilium. {ECO:0000269|PubMed:27930654}.
CC -!- ALTERNATIVE PRODUCTS:
CC Event=Alternative splicing; Named isoforms=2;
CC Name=a {ECO:0000312|WormBase:Y108G3AL.3a};
CC IsoId=Q95Y36-1; Sequence=Displayed;
CC Name=b {ECO:0000312|WormBase:Y108G3AL.3b};
CC IsoId=Q95Y36-2; Sequence=?;
CC Note=No experimental confirmation available. {ECO:0000305};
CC -!- TISSUE SPECIFICITY: Expressed in amphid and phasmid ciliated
CC neurons. {ECO:0000269|PubMed:27930654}.
CC -!- SIMILARITY: Belongs to the CFAP36 family. {ECO:0000305}.
DR EMBL; BX284605; CCD74338.1; -; Genomic_DNA.
DR EMBL; BX284605; CTQ86916.1; -; Genomic_DNA.
DR RefSeq; NP_001300217.1; NM_001313288.1.
DR RefSeq; NP_503147.1; NM_070746.4.
DR UniGene; Cel.1470; -.
DR ProteinModelPortal; Q95Y36; -.
DR SMR; Q95Y36; -.
DR STRING; 6239.Y108G3AL.3; -.
DR PaxDb; Q95Y36; -.
DR PeptideAtlas; Q95Y36; -.
DR EnsemblMetazoa; Y108G3AL.3; Y108G3AL.3; WBGene00022435.
DR EnsemblMetazoa; Y108G3AL.3a; Y108G3AL.3a; WBGene00022435.
DR EnsemblMetazoa; Y108G3AL.3b; Y108G3AL.3b; WBGene00022435.
DR GeneID; 190931; -.
DR KEGG; cel:CELE_Y108G3AL.3; -.
DR UCSC; Y108G3AL.3; c. elegans.
DR CTD; 190931; -.
DR WormBase; Y108G3AL.3a; CE29094; WBGene00022435; cfap-36. [Q95Y36-1]
DR WormBase; Y108G3AL.3b; CE50736; WBGene00022435; cfap-36. [Q95Y36-2]
DR eggNOG; KOG4511; Eukaryota.
DR eggNOG; ENOG41116YE; LUCA.
DR GeneTree; ENSGT00390000012785; -.
DR InParanoid; Q95Y36; -.
DR OMA; RHSKDEY; -.
DR OrthoDB; EOG091G09GK; -.
DR Proteomes; UP000001940; Chromosome V.
DR Bgee; WBGene00022435; -.
DR ExpressionAtlas; Q95Y36; baseline.
DR Gene3D; 1.20.1520.10; -; 1.
DR InterPro; IPR023379; ARF-like_2-bdp_dom.
DR Pfam; PF11527; ARL2_Bind_BART; 1.
PE 1: Evidence at protein level;
KW Alternative splicing; Cell projection; Cilium; Coiled coil;
KW Complete proteome; Cytoplasm; Cytoskeleton; Reference proteome.
FT CHAIN 1 685 Cilia- and flagella-associated protein
FT 36. {ECO:0000305}.
FT COILED 197 242 {ECO:0000255}.
FT VAR_SEQ 1 127 Missing (in isoform b). {ECO:0000305}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000250; UniProtKB:Q96G28; HEB; 10-JAN-2017.
**EV ECO:0000255; -; HEB; 10-JAN-2017.
**EV ECO:0000269; PubMed:27930654; HEB; 10-JAN-2017.
**EV ECO:0000303; PubMed:27930654; HEB; 10-JAN-2017.
**EV ECO:0000305; -; HEB; 11-JAN-2017.
**EV ECO:0000312; Proteomes:UP000001940; HEB; 10-JAN-2017.
**EV ECO:0000312; WormBase:Y108G3AL.3a; HEB; 10-JAN-2017.
**EV ECO:0000312; WormBase:Y108G3AL.3b; HEB; 10-JAN-2017.
**IS Q95Y36-3
**ZA HEB, 11-JAN-2017;
**ZZ Related to rab-28 (Q9XWR6), fam-161 (Q9XX47), rpi-1 (Q69Z08), ccdc-149
**ZZ (Q93635) and maph-9 (Q18452).
**ZZ CURATED.
SQ SEQUENCE 685 AA; 75511 MW; FA9A5E134912A8FF CRC64;
MLRRFSKKNK NPEGGSDDAS RKQKKLLSKF LEFITSSIWS IPIASFIESQ SVVFDRQQME
TDVYIMIHKE YSQLIDTLIE CFCEDVGTTP TELVAAIQLF NQKDVSQQYK VALEPLLAAQ
NFNVFVPMMM RKNIELQLQA LQMIEFMCGL IPSVLQLEDG ETLRNMKKLS PEETERYVLI
SVLRHSKDEY DSMQKGSEEL EMMAQNSRIQ REALEQEIRK EEILLQQALD EGARAQNQNQ
NQGTSSTQTD GVNAPLRSVA AMMAATFAID TATSTDDVTY KFLDQSTGTM TSSTGVSVGT
LTNTGVSSGT MTSGVDTGTD ADGTVGRPKS AKRVGSAVGK RSVSKGTPSE DAKKSSGSSS
PDEAEKSKRE RPGTSVKKAI GIVAANSEMS SNGTQMDVPV DEEGTKKRPG TTSKKSIATV
TASPEMSSKT TQMEPEQDGE GKKRPETSKG ANERKYSNAG LEDIVGPKSS PHEEKKSSHP
SSRKGSKATD ENAPATRPPS RKAAGGSHEP RAKTPNQKNK DERPTTRRSS VDKNAPKRND
SVPRERKSSV SHDESKPPKP IGPLRGNKYD GDVVLGRAES PGIDHGPRRK NLNDVNSHLV
DTNRLNSSDV RVRAQYLREQ RDKLLQMKNA ERIKQMTDIQ QNASLERPKT AARAREILDK
DKKEAVAIRK EISDKLKTQI LTLHH
//
ID RPI1_CAEEL Unreviewed; 450 AA.
AC Q69Z08; Q9XUK0;
DT 13-SEP-2004, integrated into UniProtKB/TrEMBL.
DT 13-SEP-2004, sequence version 1.
DT 18-JAN-2017, entry version 86.
DE RecName: Full=Protein rpi-1 {ECO:0000305};
GN Name=rpi-1 {ECO:0000303|PubMed:27930654};
GN ORFNames=W07G1.5 {ECO:0000312|WormBase:W07G1.5b};
OS Caenorhabditis elegans.
OC Eukaryota; Metazoa; Ecdysozoa; Nematoda; Chromadorea; Rhabditida;
OC Rhabditoidea; Rhabditidae; Peloderinae; Caenorhabditis.
OX NCBI_TaxID=6239 {ECO:0000312|Proteomes:UP000001940};
RN [1] {ECO:0000312|Proteomes:UP000001940}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
RC STRAIN=Bristol N2 {ECO:0000312|Proteomes:UP000001940};
RX PubMed=9851916; DOI=10.1126/science.282.5396.2012;
RG The C. elegans sequencing consortium;
RT "Genome sequence of the nematode C. elegans: a platform for
RT investigating biology.";
RL Science 282:2012-2018(1998).
RN [2] {ECO:0000305}
RP SUBCELLULAR LOCATION, AND TISSUE SPECIFICITY.
RX PubMed=27930654; DOI=10.1371/journal.pgen.1006469;
RA Jensen V.L., Carter S., Sanders A.A., Li C., Kennedy J., Timbers T.A.,
RA Cai J., Scheidel N., Kennedy B.N., Morin R.D., Leroux M.R.,
RA Blacque O.E.;
RT "Whole-organism developmental expression profiling identifies rab-28
RT as a novel ciliary GTPase associated with the BBSome and
RT intraflagellar transport.";
RL PLoS Genet. 12:E1006469-E1006469(2016).
CC -!- SUBCELLULAR LOCATION: Cell projection, cilium membrane
CC {ECO:0000305}; Single-pass membrane protein {ECO:0000255}. Cell
CC projection, cilium {ECO:0000269|PubMed:27930654}. Cytoplasm,
CC cytoskeleton, cilium axoneme {ECO:0000269|PubMed:27930654}.
CC Cytoplasm, cytoskeleton {ECO:0000269|PubMed:27930654}.
CC Note=Localizes to the base of the cilium. Localizes to ciliary and
CC cytoplasmic microtubules. {ECO:0000269|PubMed:27930654}.
CC -!- ALTERNATIVE PRODUCTS:
CC Event=Alternative splicing; Named isoforms=2;
CC Name=b {ECO:0000312|WormBase:W07G1.5b};
CC IsoId=Q69Z08-1; Sequence=Displayed;
CC Name=a {ECO:0000312|WormBase:W07G1.5a};
CC IsoId=Q69Z08-2; Sequence=?;
CC Note=No experimental confirmation available. {ECO:0000305};
CC -!- TISSUE SPECIFICITY: Expressed in amphid and phasmid ciliated
CC neurons. {ECO:0000269|PubMed:27930654}.
DR EMBL; BX284602; CAB04937.2; -; Genomic_DNA.
DR EMBL; BX284602; CAH10809.1; -; Genomic_DNA.
DR PIR; T26269; T26269.
DR RefSeq; NP_001022398.1; NM_001027227.3.
DR RefSeq; NP_001022399.1; NM_001027228.3.
DR UniGene; Cel.14196; -.
DR ProteinModelPortal; Q69Z08; -.
DR DIP; DIP-24816N; -.
DR IntAct; Q9XUK0; 2.
DR MINT; MINT-1060581; -.
DR STRING; 6239.W07G1.5b; -.
DR PaxDb; Q69Z08; -.
DR PaxDb; Q9XUK0; -.
DR PeptideAtlas; Q69Z08; -.
DR EnsemblMetazoa; W07G1.5a; W07G1.5a; WBGene00012332.
DR EnsemblMetazoa; W07G1.5b; W07G1.5b; WBGene00012332.
DR GeneID; 189281; -.
DR KEGG; cel:CELE_W07G1.5; -.
DR UCSC; W07G1.5a; c. elegans.
DR CTD; 189281; -.
DR WormBase; W07G1.5a; CE35636; WBGene00012332; rpi-1. [Q69Z08-2]
DR WormBase; W07G1.5b; CE37053; WBGene00012332; rpi-1. [Q69Z08-1]
DR eggNOG; KOG3757; Eukaryota.
DR eggNOG; ENOG410ZE6Q; LUCA.
DR GeneTree; ENSGT00720000109901; -.
DR HOGENOM; HOG000021911; -.
DR InParanoid; Q69Z08; -.
DR OMA; KIYVAAS; -.
DR OrthoDB; EOG091G0LL8; -.
DR Proteomes; UP000001940; Chromosome II.
DR Bgee; WBGene00012332; -.
DR ExpressionAtlas; Q69Z08; baseline.
DR GO; GO:0016021; C:integral component of membrane; IEA:UniProtKB-KW.
DR GO; GO:0005622; C:intracellular; IEA:GOC.
DR GO; GO:0035556; P:intracellular signal transduction; IEA:InterPro.
DR CDD; cd01617; DCX; 1.
DR Gene3D; 3.10.20.230; -; 1.
DR InterPro; IPR003533; Doublecortin_dom.
DR Pfam; PF03607; DCX; 1.
DR SMART; SM00537; DCX; 1.
DR PROSITE; PS50309; DC; 1.
PE 1: Evidence at protein level;
KW Alternative splicing; Cell membrane; Cell projection; Cilium;
KW Complete proteome; Cytoplasm; Cytoskeleton; Membrane;
KW Reference proteome; Transmembrane; Transmembrane helix.
FT CHAIN 1 450 Protein rpi-1. {ECO:0000305}.
FT TRANSMEM 244 264 Helical. {ECO:0000255}.
FT DOMAIN 35 115 Doublecortin. {ECO:0000255|PROSITE-
FT ProRule:PRU00072}.
FT COMPBIAS 356 421 Glu-rich. {ECO:0000255|PROSITE-
FT ProRule:PRU00007}.
FT VAR_SEQ 340 351 Missing (in isoform a). {ECO:0000305}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000255; -; HEB; 11-JAN-2017.
**EV ECO:0000255; PROSITE-ProRule:PRU00007; HEB; 11-JAN-2017.
**EV ECO:0000255; PROSITE-ProRule:PRU00072; HEB; 11-JAN-2017.
**EV ECO:0000269; PubMed:27930654; HEB; 10-JAN-2017.
**EV ECO:0000303; PubMed:27930654; HEB; 10-JAN-2017.
**EV ECO:0000305; -; HEB; 12-JAN-2017.
**EV ECO:0000312; Proteomes:UP000001940; HEB; 10-JAN-2017.
**EV ECO:0000312; WormBase:W07G1.5a; HEB; 10-JAN-2017.
**EV ECO:0000312; WormBase:W07G1.5b; HEB; 10-JAN-2017.
**IS Q69Z08-3
**ZA HEB, 11-JAN-2017;
**ZZ Related to rab-28 (Q9XWR6), fam-161 (Q9XX47), ccdc-104 (Q95Y36),
**ZZ ccdc-149 (Q93635) and maph-9 (Q18452).
**ZZ CURATED.
SQ SEQUENCE 450 AA; 48674 MW; 2EA3D9D5519F3A15 CRC64;
MPTPSTKKKV KKVAEDPLSS SGVSSLSGIS SYNIRKISIY KNGDRYHRGV KFVINPRVIK
DMEPLLNQVN DRIELSHGAK KLYTTDGKIV NSIKELEDGK IYVAASAQFI PMRYGEFAEK
VWKPPSRKHS PIMSSDRIKT ARTRSQDPSK RRQPQNSGSS APTGSGVQRS RSVRTLAEDR
KSRRDANPAR PNVNGASNAP KKFDGARPKA PPARQTIPKP KKILTTSTTN KKPPTPKRKV
SKKVLGAAAA AGVTVVGAAA IGAVAAAKRS TPKPIPTAVS DVSTASSIPI PNVTGAAEIL
EFPEEEKKID MATIHRTPTP PVVASRPATA KAPGTPANRS ATALEAKSVS QQPTPESSEE
EEDEGNGDED DDEEVEDDEE DAGSDEAEEE PSDEEEEDEE TEEEEEEEEE EEEDDDESRV
ETPASRKSSS AVSFSGSTEE DHKKGDEAKK
//
ID CC149_CAEEL Unreviewed; 369 AA.
AC Q93635;
DT 01-FEB-1997, integrated into UniProtKB/TrEMBL.
DT 01-FEB-1997, sequence version 1.
DT 02-NOV-2016, entry version 90.
DE RecName: Full=Coiled-coil domain-containing protein 149 {ECO:0000312|WormBase:F29G6.2};
GN Name=ccdc-149 {ECO:0000303|PubMed:27930654,
GN ECO:0000312|WormBase:F29G6.2};
GN ORFNames=F29G6.2 {ECO:0000312|WormBase:F29G6.2};
OS Caenorhabditis elegans.
OC Eukaryota; Metazoa; Ecdysozoa; Nematoda; Chromadorea; Rhabditida;
OC Rhabditoidea; Rhabditidae; Peloderinae; Caenorhabditis.
OX NCBI_TaxID=6239 {ECO:0000312|Proteomes:UP000001940};
RN [1] {ECO:0000312|Proteomes:UP000001940}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
RC STRAIN=Bristol N2 {ECO:0000312|Proteomes:UP000001940};
RX PubMed=9851916; DOI=10.1126/science.282.5396.2012;
RG The C. elegans sequencing consortium;
RT "Genome sequence of the nematode C. elegans: a platform for
RT investigating biology.";
RL Science 282:2012-2018(1998).
RN [2] {ECO:0000305}
RP SUBCELLULAR LOCATION, AND TISSUE SPECIFICITY.
RX PubMed=27930654; DOI=10.1371/journal.pgen.1006469;
RA Jensen V.L., Carter S., Sanders A.A., Li C., Kennedy J., Timbers T.A.,
RA Cai J., Scheidel N., Kennedy B.N., Morin R.D., Leroux M.R.,
RA Blacque O.E.;
RT "Whole-organism developmental expression profiling identifies rab-28
RT as a novel ciliary GTPase associated with the BBSome and
RT intraflagellar transport.";
RL PLoS Genet. 12:E1006469-E1006469(2016).
CC -!- SUBCELLULAR LOCATION: Cell projection, cilium
CC {ECO:0000269|PubMed:27930654}. Note=Localizes to the base of the
CC cilium. {ECO:0000269|PubMed:27930654}.
CC -!- TISSUE SPECIFICITY: Expressed in amphid and phasmid ciliated
CC neurons, and also pharyngeal, touch receptor and motor neurons.
CC {ECO:0000269|PubMed:27930654}.
CC -!- SIMILARITY: Belongs to the CCDC149 family. {ECO:0000305}.
DR EMBL; BX284606; CAB01752.1; -; Genomic_DNA.
DR PIR; T21556; T21556.
DR RefSeq; NP_509921.1; NM_077520.1.
DR UniGene; Cel.1102; -.
DR ProteinModelPortal; Q93635; -.
DR SMR; Q93635; -.
DR DIP; DIP-24925N; -.
DR IntAct; Q93635; 1.
DR MINT; MINT-1051149; -.
DR STRING; 6239.F29G6.2; -.
DR EPD; Q93635; -.
DR PaxDb; Q93635; -.
DR EnsemblMetazoa; F29G6.2; F29G6.2; WBGene00009258.
DR GeneID; 185121; -.
DR KEGG; cel:CELE_F29G6.2; -.
DR UCSC; F29G6.2; c. elegans.
DR CTD; 185121; -.
DR WormBase; F29G6.2; CE09792; WBGene00009258; ccdc-149.
DR eggNOG; KOG4687; Eukaryota.
DR eggNOG; ENOG410ZRJ8; LUCA.
DR GeneTree; ENSGT00390000015958; -.
DR HOGENOM; HOG000021063; -.
DR InParanoid; Q93635; -.
DR OMA; HSRRANK; -.
DR OrthoDB; EOG091G0CS6; -.
DR PhylomeDB; Q93635; -.
DR Proteomes; UP000001940; Chromosome X.
DR Bgee; WBGene00009258; -.
DR InterPro; IPR019179; Coiled-coil_dom-contain_pr_149.
DR PANTHER; PTHR21682; PTHR21682; 1.
DR Pfam; PF09789; DUF2353; 1.
PE 4: Predicted;
KW Cell projection; Cilium; Coiled coil; Complete proteome;
KW Reference proteome.
FT CHAIN 1 369 Coiled-coil domain-containing protein
FT 149. {ECO:0000305}.
FT COILED 1 249 {ECO:0000255}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000255; -; HEB; 10-JAN-2017.
**EV ECO:0000269; PubMed:27930654; HEB; 10-JAN-2017.
**EV ECO:0000303; PubMed:27930654; HEB; 10-JAN-2017.
**EV ECO:0000305; -; HEB; 12-JAN-2017.
**EV ECO:0000312; Proteomes:UP000001940; HEB; 10-JAN-2017.
**EV ECO:0000312; WormBase:F29G6.2; HEB; 10-JAN-2017.
**ZA HEB, 11-JAN-2017;
**ZZ Related to rab-28 (Q9XWR6), fam-161 (Q9XX47), ccdc-104 (Q95Y36), rpi-1
**ZZ (Q69Z08) and maph-9 (Q18452).
**ZZ CURATED.
SQ SEQUENCE 369 AA; 42086 MW; E6E875D55995A15D CRC64;
MKENNNAEIL ELKKQFTALQ QKCGAKTDTI VRLGQDLEKS ENEKKGLAAR VETLERNLER
SERELQLVCA CQNDMKIKFG TERQDLIEDI EKYKRENQQL RTDRQELLDQ KADLKKDCKT
FRQTIAQFEV EKMGGPVRNS FSTENDEVSK LEAHEKLQAK CKGLESDLRS MLGIKEELLM
ERDEMQRKVA RLSNELSYLL NGDPRRVAED LDSLVAENRF LKAKLNTAEE ESESIKMTLA
KYKQMAEAVN VQTMVNRSPK AGEGDDKPSV AVINMKQIRE LLASHAIELV ESDYRAITTI
LLDLCNDKQM ALAHSRRANK VLGMRLHEVE SKLAVLDIKS RSSSPRHELP RDEDIELVVP
KAVASTSSK
//
ID MAP9_CAEEL Unreviewed; 512 AA.
AC Q18452;
DT 01-NOV-1996, integrated into UniProtKB/TrEMBL.
DT 01-OCT-2001, sequence version 2.
DT 02-NOV-2016, entry version 85.
DE RecName: Full=Protein maph-9 {ECO:0000305};
GN Name=maph-9 {ECO:0000303|PubMed:27930654};
GN ORFNames=C34D4.1 {ECO:0000312|WormBase:C34D4.1};
OS Caenorhabditis elegans.
OC Eukaryota; Metazoa; Ecdysozoa; Nematoda; Chromadorea; Rhabditida;
OC Rhabditoidea; Rhabditidae; Peloderinae; Caenorhabditis.
OX NCBI_TaxID=6239 {ECO:0000312|Proteomes:UP000001940};
RN [1] {ECO:0000312|Proteomes:UP000001940}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
RC STRAIN=Bristol N2 {ECO:0000312|Proteomes:UP000001940};
RX PubMed=9851916; DOI=10.1126/science.282.5396.2012;
RG The C. elegans sequencing consortium;
RT "Genome sequence of the nematode C. elegans: a platform for
RT investigating biology.";
RL Science 282:2012-2018(1998).
RN [2] {ECO:0000305}
RP SUBCELLULAR LOCATION, AND TISSUE SPECIFICITY.
RX PubMed=27930654; DOI=10.1371/journal.pgen.1006469;
RA Jensen V.L., Carter S., Sanders A.A., Li C., Kennedy J., Timbers T.A.,
RA Cai J., Scheidel N., Kennedy B.N., Morin R.D., Leroux M.R.,
RA Blacque O.E.;
RT "Whole-organism developmental expression profiling identifies rab-28
RT as a novel ciliary GTPase associated with the BBSome and
RT intraflagellar transport.";
RL PLoS Genet. 12:E1006469-E1006469(2016).
CC -!- SUBCELLULAR LOCATION: Cell projection, cilium
CC {ECO:0000269|PubMed:27930654}. Cytoplasm, cytoskeleton, cilium
CC axoneme {ECO:0000269|PubMed:27930654}. Note=Localizes to the base
CC of the cilium. {ECO:0000269|PubMed:27930654}.
CC -!- TISSUE SPECIFICITY: Expressed in amphid and phasmid ciliated
CC neurons. {ECO:0000269|PubMed:27930654}.
DR EMBL; BX284604; CCD66597.1; -; Genomic_DNA.
DR PIR; T29291; T29291.
DR RefSeq; NP_501126.1; NM_068725.3.
DR UniGene; Cel.13388; -.
DR ProteinModelPortal; Q18452; -.
DR PaxDb; Q18452; -.
DR EnsemblMetazoa; C34D4.1; C34D4.1; WBGene00016397.
DR GeneID; 177490; -.
DR KEGG; cel:CELE_C34D4.1; -.
DR UCSC; C34D4.1; c. elegans.
DR CTD; 177490; -.
DR WormBase; C34D4.1; CE27742; WBGene00016397; maph-9.
DR eggNOG; ENOG410JQDF; Eukaryota.
DR eggNOG; ENOG410ZPZR; LUCA.
DR HOGENOM; HOG000018059; -.
DR InParanoid; Q18452; -.
DR OMA; EMWKRER; -.
DR OrthoDB; EOG091G0LW1; -.
DR PRO; PR:Q18452; -.
DR Proteomes; UP000001940; Chromosome IV.
DR Bgee; WBGene00016397; -.
DR GO; GO:0000910; P:cytokinesis; IEA:InterPro.
DR GO; GO:0007088; P:regulation of mitotic nuclear division; IEA:InterPro.
DR GO; GO:0051225; P:spindle assembly; IEA:InterPro.
DR InterPro; IPR026106; MAP9.
DR PANTHER; PTHR14739; PTHR14739; 1.
PE 1: Evidence at protein level;
KW Cell projection; Cilium; Coiled coil; Complete proteome; Cytoplasm;
KW Cytoskeleton; Reference proteome.
FT CHAIN 1 512 Protein maph-9. {ECO:0000305}.
FT COILED 267 429 {ECO:0000255}.
FT COMPBIAS 199 419 Lys-rich. {ECO:0000255|PROSITE-
FT ProRule:PRU00012}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000255; -; HEB; 10-JAN-2017.
**EV ECO:0000255; PROSITE-ProRule:PRU00012; HEB; 10-JAN-2017.
**EV ECO:0000269; PubMed:27930654; HEB; 10-JAN-2017.
**EV ECO:0000303; PubMed:27930654; HEB; 10-JAN-2017.
**EV ECO:0000305; -; HEB; 12-JAN-2017.
**EV ECO:0000312; Proteomes:UP000001940; HEB; 10-JAN-2017.
**EV ECO:0000312; WormBase:C34D4.1; HEB; 10-JAN-2017.
**ZA HEB, 11-JAN-2017;
**ZZ Related to rab-28 (Q9XWR6), fam-161 (Q9XX47), ccdc-104 (Q95Y36), rpi-1
**ZZ (Q69Z08) and ccdc-149 (Q93635).
**ZZ CURATED.
SQ SEQUENCE 512 AA; 58751 MW; F1211F2DBE2177A7 CRC64;
MGEYQLHQSR NLSVNQTLDE ILGISRKSET TTTSSGSSGA EKNALNSPIR PPTRHGRESS
GSNEENKDPI QLENGNGSTL SFLTSSSSAT SSTAARRNSD DDFIKKLNDI RRRSLISTMD
ATSTPTTSVP IHFDSPRRES RPCLEIHVEE SPEELSTHAV EITEFHRDLS ENSLGTSTDH
EDPSLTFRVD KELEQSESKK TTKRPASGVK KTLKASISID APKPKPRPRP QTSANLSTKT
IKDKDQEMMQ MSMFGSKLNK PSDAHHKEWL QKKEREIREK KAKEKAAAEQ KAATEKERRE
NSAKLYQRWV QDHDKKAKEL KSKKTQQERK KSENEKTTQD QKLKEAEKNY EMWKRERSKS
VTDIRKKLEQ EEDKKRKKEE EAKNEKIKEA QAAFLAWKRK KEELLNEEAE KLKKEQVQKQ
LEESEKMTRL SLANEAYETW IELKESEREF IADFVLIEAP PIPWLPPSNL IPRQFVRSSN
GNRLRARSQS AKSIAKRSRS RPGTTTSLRP FR
//
ID USO1_DROME Unreviewed; 836 AA.
AC Q9W3N6; Q9NFR8;
DT 01-MAY-2000, integrated into UniProtKB/TrEMBL.
DT 01-MAR-2001, sequence version 2.
DT 06-JUL-2016, entry version 133.
DE RecName: Full=General vesicular transport factor p115 {ECO:0000305};
GN Name=p115 {ECO:0000312|FlyBase:FBgn0040087};
GN ORFNames=CG1422 {ECO:0000312|FlyBase:FBgn0040087};
OS Drosophila melanogaster (Fruit fly).
OC Eukaryota; Metazoa; Ecdysozoa; Arthropoda; Hexapoda; Insecta;
OC Pterygota; Neoptera; Endopterygota; Diptera; Brachycera; Muscomorpha;
OC Ephydroidea; Drosophilidae; Drosophila; Sophophora.
OX NCBI_TaxID=7227 {ECO:0000312|Proteomes:UP000000803};
RN [1] {ECO:0000312|EMBL:CAB72935.1}
RP NUCLEOTIDE SEQUENCE [MRNA], SUBCELLULAR LOCATION, AND DEVELOPMENTAL
RP STAGE.
RX PubMed=11514618;
RA Kondylis V., Goulding S.E., Dunne J.C., Rabouille C.;
RT "Biogenesis of Golgi stacks in imaginal discs of Drosophila
RT melanogaster.";
RL Mol. Biol. Cell 12:2308-2327(2001).
RN [2]
RP NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
RC STRAIN=Berkeley;
RX PubMed=10731132; DOI=10.1126/science.287.5461.2185;
RA Adams M.D., Celniker S.E., Holt R.A., Evans C.A., Gocayne J.D.,
RA Amanatides P.G., Scherer S.E., Li P.W., Hoskins R.A., Galle R.F.,
RA George R.A., Lewis S.E., Richards S., Ashburner M., Henderson S.N.,
RA Sutton G.G., Wortman J.R., Yandell M.D., Zhang Q., Chen L.X.,
RA Brandon R.C., Rogers Y.-H.C., Blazej R.G., Champe M., Pfeiffer B.D.,
RA Wan K.H., Doyle C., Baxter E.G., Helt G., Nelson C.R., Miklos G.L.G.,
RA Abril J.F., Agbayani A., An H.-J., Andrews-Pfannkoch C., Baldwin D.,
RA Ballew R.M., Basu A., Baxendale J., Bayraktaroglu L., Beasley E.M.,
RA Beeson K.Y., Benos P.V., Berman B.P., Bhandari D., Bolshakov S.,
RA Borkova D., Botchan M.R., Bouck J., Brokstein P., Brottier P.,
RA Burtis K.C., Busam D.A., Butler H., Cadieu E., Center A., Chandra I.,
RA Cherry J.M., Cawley S., Dahlke C., Davenport L.B., Davies P.,
RA de Pablos B., Delcher A., Deng Z., Mays A.D., Dew I., Dietz S.M.,
RA Dodson K., Doup L.E., Downes M., Dugan-Rocha S., Dunkov B.C., Dunn P.,
RA Durbin K.J., Evangelista C.C., Ferraz C., Ferriera S., Fleischmann W.,
RA Fosler C., Gabrielian A.E., Garg N.S., Gelbart W.M., Glasser K.,
RA Glodek A., Gong F., Gorrell J.H., Gu Z., Guan P., Harris M.,
RA Harris N.L., Harvey D.A., Heiman T.J., Hernandez J.R., Houck J.,
RA Hostin D., Houston K.A., Howland T.J., Wei M.-H., Ibegwam C.,
RA Jalali M., Kalush F., Karpen G.H., Ke Z., Kennison J.A., Ketchum K.A.,
RA Kimmel B.E., Kodira C.D., Kraft C.L., Kravitz S., Kulp D., Lai Z.,
RA Lasko P., Lei Y., Levitsky A.A., Li J.H., Li Z., Liang Y., Lin X.,
RA Liu X., Mattei B., McIntosh T.C., McLeod M.P., McPherson D.,
RA Merkulov G., Milshina N.V., Mobarry C., Morris J., Moshrefi A.,
RA Mount S.M., Moy M., Murphy B., Murphy L., Muzny D.M., Nelson D.L.,
RA Nelson D.R., Nelson K.A., Nixon K., Nusskern D.R., Pacleb J.M.,
RA Palazzolo M., Pittman G.S., Pan S., Pollard J., Puri V., Reese M.G.,
RA Reinert K., Remington K., Saunders R.D.C., Scheeler F., Shen H.,
RA Shue B.C., Siden-Kiamos I., Simpson M., Skupski M.P., Smith T.J.,
RA Spier E., Spradling A.C., Stapleton M., Strong R., Sun E.,
RA Svirskas R., Tector C., Turner R., Venter E., Wang A.H., Wang X.,
RA Wang Z.-Y., Wassarman D.A., Weinstock G.M., Weissenbach J.,
RA Williams S.M., Woodage T., Worley K.C., Wu D., Yang S., Yao Q.A.,
RA Ye J., Yeh R.-F., Zaveri J.S., Zhan M., Zhang G., Zhao Q., Zheng L.,
RA Zheng X.H., Zhong F.N., Zhong W., Zhou X., Zhu S.C., Zhu X.,
RA Smith H.O., Gibbs R.A., Myers E.W., Rubin G.M., Venter J.C.;
RT "The genome sequence of Drosophila melanogaster.";
RL Science 287:2185-2195(2000).
RN [3] {ECO:0000312|Proteomes:UP000000803}
RP GENOME REANNOTATION.
RC STRAIN=Berkeley {ECO:0000312|Proteomes:UP000000803};
RX PubMed=12537572; DOI=10.1186/gb-2002-3-12-research0083;
RA Misra S., Crosby M.A., Mungall C.J., Matthews B.B., Campbell K.S.,
RA Hradecky P., Huang Y., Kaminker J.S., Millburn G.H., Prochnik S.E.,
RA Smith C.D., Tupy J.L., Whitfied E.J., Bayraktaroglu L., Berman B.P.,
RA Bettencourt B.R., Celniker S.E., de Grey A.D., Drysdale R.A.,
RA Harris N.L., Richter J., Russo S., Schroeder A.J., Shu S.Q.,
RA Stapleton M., Yamada C., Ashburner M., Gelbart W.M., Rubin G.M.,
RA Lewis S.E.;
RT "Annotation of the Drosophila melanogaster euchromatic genome: a
RT systematic review.";
RL Genome Biol. 3:RESEARCH0083.1-RESEARCH0083.22(2002).
RN [4] {ECO:0000312|EMBL:AAL13980.1}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE MRNA].
RA Stapleton M., Brokstein P., Hong L., Agbayani A., Carlson J.,
RA Champe M., Chavez C., Dorsett V., Farfan D., Frise E., George R.,
RA Gonzalez M., Guarin H., Li P., Liao G., Miranda A., Mungall C.J.,
RA Nunoo J., Pacleb J., Paragas V., Park S., Phouanenavong S., Wan K.,
RA Yu C., Lewis S.E., Rubin G.M., Celniker S.;
RL Submitted (OCT-2001) to the EMBL/GenBank/DDBJ databases.
RN [5] {ECO:0000305}
RP FUNCTION, SUBCELLULAR LOCATION, DEVELOPMENTAL STAGE, AND DISRUPTION
RP PHENOTYPE.
RX PubMed=12876273; DOI=10.1083/jcb.200301136;
RA Kondylis V., Rabouille C.;
RT "A novel role for dp115 in the organization of tER sites in
RT Drosophila.";
RL J. Cell Biol. 162:185-198(2003).
CC -!- FUNCTION: Essential for maintaining the architecture of the Golgi
CC stacks and for normal organization of the transitional endoplasmic
CC reticulum (tER). Required for both the formation of the Golgi
CC stacks and the maintenance of the individual cisternae.
CC {ECO:0000269|PubMed:12876273}.
CC -!- SUBCELLULAR LOCATION: Cell membrane {ECO:0000269|PubMed:12876273};
CC Peripheral membrane protein {ECO:0000269|PubMed:12876273}.
CC Cytoplasm {ECO:0000269|PubMed:12876273}. Golgi apparatus, Golgi
CC stack {ECO:0000269|PubMed:11514618, ECO:0000269|PubMed:12876273}.
CC Golgi apparatus, Golgi stack membrane
CC {ECO:0000269|PubMed:11514618, ECO:0000269|PubMed:12876273};
CC Peripheral membrane protein {ECO:0000269|PubMed:11514618,
CC ECO:0000269|PubMed:12876273}. Endoplasmic reticulum
CC {ECO:0000269|PubMed:11514618, ECO:0000269|PubMed:12876273}.
CC Endoplasmic reticulum membrane {ECO:0000269|PubMed:12876273};
CC Peripheral membrane protein {ECO:0000269|PubMed:12876273}.
CC Note=Associates with the tER membrane (PubMed:12876273). Localizes
CC in developing Golgi stacks (PubMed:11514618).
CC {ECO:0000269|PubMed:11514618, ECO:0000269|PubMed:12876273}.
CC -!- DEVELOPMENTAL STAGE: Detected in embryos and larvae (at protein
CC level) (PubMed:12876273). Expressed in larval imaginal disks (at
CC protein level) (PubMed:11514618). {ECO:0000269|PubMed:11514618,
CC ECO:0000269|PubMed:12876273}.
CC -!- DISRUPTION PHENOTYPE: RNAi-mediated knockdown results in a loss of
CC Golgi stacks and affects the organization of the transitional ER
CC (tER) sites. Golgi stacks breakdown and form clusters of vesicles
CC and tubules. The Golgi stacks that are present have an adherent
CC morphology, including a decrease in stack diameter and total
CC cisternae (stacked and single). The tER sites lose their
CC organization and become dispersed throughout the cytoplasm.
CC However, the efficiency of anterograde intracellular transport is
CC not affected. {ECO:0000269|PubMed:12876273}.
CC -!- SIMILARITY: Belongs to the VDP/USO1/EDE1 family. {ECO:0000305}.
CC -!- SEQUENCE CAUTION:
CC Sequence=CAB72935.1; Type=Frameshift; Positions=741, 753; Evidence={ECO:0000305};
DR EMBL; AJ272048; CAB72935.1; ALT_FRAME; mRNA.
DR EMBL; AE014298; AAF46286.2; -; Genomic_DNA.
DR EMBL; AE014298; AHN59463.1; -; Genomic_DNA.
DR EMBL; AY058751; AAL13980.1; -; mRNA.
DR RefSeq; NP_001284992.1; NM_001298063.1.
DR RefSeq; NP_572417.1; NM_132189.3.
DR UniGene; Dm.4686; -.
DR MINT; MINT-278744; -.
DR STRING; 7227.FBpp0071045; -.
DR PaxDb; Q9NFR8; -.
DR PRIDE; Q9NFR8; -.
DR EnsemblMetazoa; FBtr0071089; FBpp0071045; FBgn0040087.
DR EnsemblMetazoa; FBtr0340162; FBpp0309148; FBgn0040087.
DR GeneID; 31698; -.
DR KEGG; dme:Dmel_CG1422; -.
DR UCSC; CG1422-RA; d. melanogaster.
DR CTD; 31698; -.
DR FlyBase; FBgn0040087; p115.
DR eggNOG; KOG0946; Eukaryota.
DR eggNOG; ENOG410XRCG; LUCA.
DR GeneTree; ENSGT00390000017018; -.
DR OMA; YQVNQDY; -.
DR OrthoDB; EOG7K0ZBS; -.
DR Reactome; R-DME-204005; COPII (Coat Protein 2) Mediated Vesicle Transport.
DR Reactome; R-DME-6807878; COPI-mediated anterograde transport.
DR GenomeRNAi; 31698; -.
DR Proteomes; UP000000803; Chromosome X.
DR Bgee; Q9NFR8; -.
DR ExpressionAtlas; Q9NFR8; differential.
DR GO; GO:0005783; C:endoplasmic reticulum; IDA:FlyBase.
DR GO; GO:0012507; C:ER to Golgi transport vesicle membrane; IBA:GO_Central.
DR GO; GO:0000139; C:Golgi membrane; IEA:InterPro.
DR GO; GO:0005795; C:Golgi stack; IDA:FlyBase.
DR GO; GO:0008565; F:protein transporter activity; IBA:GO_Central.
DR GO; GO:0006888; P:ER to Golgi vesicle-mediated transport; IBA:GO_Central.
DR GO; GO:0007030; P:Golgi organization; IMP:FlyBase.
DR GO; GO:0048211; P:Golgi vesicle docking; IBA:GO_Central.
DR GO; GO:0006886; P:intracellular protein transport; IBA:GO_Central.
DR GO; GO:0061025; P:membrane fusion; IBA:GO_Central.
DR GO; GO:0051726; P:regulation of cell cycle; IDA:FlyBase.
DR GO; GO:0045056; P:transcytosis; IBA:GO_Central.
DR GO; GO:0048280; P:vesicle fusion with Golgi apparatus; IEA:InterPro.
DR Gene3D; 1.25.10.10; -; 2.
DR InterPro; IPR011989; ARM-like.
DR InterPro; IPR016024; ARM-type_fold.
DR InterPro; IPR000225; Armadillo.
DR InterPro; IPR006955; Uso1_p115_C.
DR InterPro; IPR024095; Vesicle_P115-like.
DR InterPro; IPR006953; Vesicle_Uso1_P115_head.
DR PANTHER; PTHR10013; PTHR10013; 1.
DR Pfam; PF04871; Uso1_p115_C; 1.
DR Pfam; PF04869; Uso1_p115_head; 1.
DR SMART; SM00185; ARM; 2.
DR SUPFAM; SSF48371; SSF48371; 1.
DR PROSITE; PS50176; ARM_REPEAT; 1.
PE 1: Evidence at protein level;
KW Cell membrane; Coiled coil; Complete proteome; Cytoplasm;
KW Endoplasmic reticulum; Golgi apparatus; Membrane; Reference proteome.
FT CHAIN 1 836 General vesicular transport factor p115.
FT {ECO:0000305}.
FT COILED 663 707 {ECO:0000255}.
FT COILED 744 806 {ECO:0000255}.
FT CONFLICT 455 455 N -> D (in Ref. 1; CAB72935).
FT {ECO:0000305}.
FT CONFLICT 508 508 A -> P (in Ref. 1; CAB72935).
FT {ECO:0000305}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000255; -; KAW; 17-JUN-2016.
**EV ECO:0000269; PubMed:11514618; KAW; 23-JUN-2016.
**EV ECO:0000269; PubMed:12876273; KAW; 23-JUN-2016.
**EV ECO:0000305; -; KAW; 17-JUN-2016.
**EV ECO:0000312; EMBL:AAL13980.1; KAW; 17-JUN-2016.
**EV ECO:0000312; EMBL:CAB72935.1; KAW; 17-JUN-2016.
**EV ECO:0000312; FlyBase:FBgn0040087; KAW; 17-JUN-2016.
**EV ECO:0000312; Proteomes:UP000000803; KAW; 17-JUN-2016.
**ZA KAW, 17-JUN-2016;
**ZZ Resubmission following Ursula's comments. Agreed with all her
**ZZ suggestions, except that no additional papers were added to the entry
**ZZ because Pubmed:20639577 and Pubmed:16256943 use mammallian cell lines
**ZZ not Drosophila cell lines. Removed the lone FT REPEAT and improved the
**ZZ FUNCTION and DISRUPTION PHENOTYPE comments.
**ZZ CURATED.
SQ SEQUENCE 836 AA; 92069 MW; E802308CB3219334 CRC64;
MEFLKSGIKT VLGSTEPGQQ PSAAETVEKL VDRVYSSTLL EDRRDACRAL KALSRKYRIE
VGAQGMPPLV QVLQNDGQDA EIISYALDTL CNVVTSEEFD EEADNPTVSV NVGEQFTEMF
IKTPEHVTLV MGYLDEYDFR VRRAAIQLIT SLISNKTREL QDLILVSPMG VSKLMDLLTD
SREVIRNDVL LLLIELTKGN SNIQKIVAFE NAFDRLFEIV REEGCSDGGI VVEDCLILLL
NLLKNNSSNQ QFFKEGSYIQ RLSPMFELSQ DAEEVGWSPQ KVSNFHCLLQ VVRALVTPSN
QQQVVAACQR VMQKSRLLHA LCEILMSSGV PADILTETIN AVAEVVRGDR DNQDELGRVM
APSSPPRPAI VVLLMSMINE KQLLALRCAV LYCFECFLYR NADGQRAVVQ TLLPSSASDV
SALSTGQLLC TGLFSTDALA NWFSAVALMH SLVENVALKE ELLRVLLATP GGQKPITLLE
QCTNLMQQER YRLQSKVGLL MLLSLWLAHC PGAVKALLET QGTMAYLTAQ LCSNEHDERE
FLVQGMCAFL MGLCIQFNDN SLPGQKREDI SQLIIKRIGQ ESFCSKLAEV SRHEAYSRAC
KQAQIRAKSA GELLLDFEYC KLYKGLEALI AKLVSGFDVD GIELTELTLS SEASALVSQY
KGIIRGMDAQ IQALQQSSKE LEQENAELKE KLGEEQSLKA QLLDQNTLLK AQLGASTGQV
QSAQGAEATP PNEEELNAAR YQANMYFAEN IRLTKELETL RQQLSAEKQS ADAAQDSLAA
MQKDQEDLLE LLADQEAKLT RYEEAGSTNT LPTSNVAPSV PAAGGGSPIP SGTASR
//
id Q9NFR8_DROME Unreviewed; 837 AA.
ac Q9NFR8;
dt 01-OCT-2000, integrated into UniProtKB/TrEMBL.
dt 01-OCT-2000, sequence version 1.
dt 08-JUN-2016, entry version 82.
de SubName: Full=Dp115 protein {ECO:0000313|EMBL:CAB72935.1};
gn Name=p115 {ECO:0000313|FlyBase:FBgn0040087};
gn Synonyms=dp115 {ECO:0000313|EMBL:CAB72935.1};
gn ORFNames=CG1422 {ECO:0000313|FlyBase:FBgn0040087};
os Drosophila melanogaster (Fruit fly).
oc Eukaryota; Metazoa; Ecdysozoa; Arthropoda; Hexapoda; Insecta;
oc Pterygota; Neoptera; Endopterygota; Diptera; Brachycera; Muscomorpha;
oc Ephydroidea; Drosophilidae; Drosophila; Sophophora.
ox NCBI_TaxID=7227;
rn [1] {ECO:0000313|EMBL:CAB72935.1}
rp NUCLEOTIDE SEQUENCE.
rx PubMed=11514618;
ra Kondylis V., Goulding S.E., Dunne J.C., Rabouille C.;
rt "Biogenesis of Golgi stacks in imaginal discs of Drosophila
rt melanogaster.";
rl Mol. Biol. Cell 12:2308-2327(2001).
dr EMBL; AJ272048; CAB72935.1; -; mRNA.
dr ProteinModelPortal; Q9NFR8; -.
dr STRING; 7227.FBpp0071045; -.
dr PaxDb; Q9NFR8; -.
dr PRIDE; Q9NFR8; -.
dr FlyBase; FBgn0040087; p115.
dr eggNOG; KOG0946; Eukaryota.
dr eggNOG; ENOG410XRCG; LUCA.
dr OrthoDB; EOG7K0ZBS; -.
dr PhylomeDB; Q9NFR8; -.
dr Reactome; R-DME-204005; COPII (Coat Protein 2) Mediated Vesicle Transport.
dr Reactome; R-DME-6807878; COPI-mediated anterograde transport.
dr Bgee; Q9NFR8; -.
dr ExpressionAtlas; Q9NFR8; differential.
dr GO; GO:0005783; C:endoplasmic reticulum; IDA:FlyBase.
dr GO; GO:0000139; C:Golgi membrane; IEA:InterPro.
dr GO; GO:0005795; C:Golgi stack; IDA:FlyBase.
dr GO; GO:0008565; F:protein transporter activity; IEA:InterPro.
dr GO; GO:0007030; P:Golgi organization; IMP:FlyBase.
dr GO; GO:0006886; P:intracellular protein transport; IEA:InterPro.
dr GO; GO:0051726; P:regulation of cell cycle; IDA:FlyBase.
dr GO; GO:0048280; P:vesicle fusion with Golgi apparatus; IEA:InterPro.
dr Gene3D; 1.25.10.10; -; 2.
dr InterPro; IPR011989; ARM-like.
dr InterPro; IPR016024; ARM-type_fold.
dr InterPro; IPR000225; Armadillo.
dr InterPro; IPR006955; Uso1_p115_C.
dr InterPro; IPR024095; Vesicle_P115-like.
dr InterPro; IPR006953; Vesicle_Uso1_P115_head.
dr PANTHER; PTHR10013; PTHR10013; 1.
dr Pfam; PF04871; Uso1_p115_C; 1.
dr Pfam; PF04869; Uso1_p115_head; 1.
dr SMART; SM00185; ARM; 2.
dr SUPFAM; SSF48371; SSF48371; 1.
dr PROSITE; PS50176; ARM_REPEAT; 1.
pe 2: Evidence at transcript level;
kw Coiled coil.
ft CHAIN 1 837 Dp115 protein.
ft DOMAIN 353 632 Uso1_p115_head.
ft {ECO:0000259|Pfam:PF04869}.
ft DOMAIN 691 815 Uso1_p115_C. {ECO:0000259|Pfam:PF04871}.
ft COILED 664 705 {ECO:0000256|SAM:Coils}.
ft COILED 755 806 {ECO:0000256|SAM:Coils}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000256; SAM:Coils; -; 10-SEP-2015.
**EV ECO:0000259; Pfam:PF04869; -; 06-NOV-2015.
**EV ECO:0000259; Pfam:PF04871; -; 06-NOV-2015.
**EV ECO:0000313; EMBL:CAB72935.1; -; 23-APR-2004.
**EV ECO:0000313; FlyBase:FBgn0040087; -; 17-JAN-2013.
sq SEQUENCE 837 AA; 92053 MW; 5672460F823BC6F9 CRC64;
MEFLKSGIKT VLGSTEPGQQ PSAAETVEKL VDRVYSSTLL EDRRDACRAL KALSRKYRIE
VGAQGMPPLV QVLQNDGQDA EIISYALDTL CNVVTSEEFD EEADNPTVSV NVGEQFTEMF
IKTPEHVTLV MGYLDEYDFR VRRAAIQLIT SLISNKTREL QDLILVSPMG VSKLMDLLTD
SREVIRNDVL LLLIELTKGN SNIQKIVAFE NAFDRLFEIV REEGCSDGGI VVEDCLILLL
NLLKNNSSNQ QFFKEGSYIQ RLSPMFELSQ DAEEVGWSPQ KVSNFHCLLQ VVRALVTPSN
QQQVVAACQR VMQKSRLLHA LCEILMSSGV PADILTETIN AVAEVVRGDR DNQDELGRVM
APSSPPRPAI VVLLMSMINE KQLLALRCAV LYCFECFLYR NADGQRAVVQ TLLPSSASDV
SALSTGQLLC TGLFSTDALA NWFSAVALMH SLVEDVALKE ELLRVLLATP GGQKPITLLE
QCTNLMQQER YRLQSKVGLL MLLSLWLPHC PGAVKALLET QGTMAYLTAQ LCSNEHDERE
FLVQGMCAFL MGLCIQFNDN SLPGQKREDI SQLIIKRIGQ ESFCSKLAEV SRHEAYSRAC
KQAQIRAKSA GELLLDFEYC KLYKGLEALI AKLVSGFDVD GIELTELTLS SEASALVSQY
KGIIRGMDAQ IQALQQSSKE LEQENAELKE KLGEEQSLKA QLLDQNTLLK AQLGASTGQV
QSAQGAEATP PNEEELNAAR LTRPTCTLPK TFVITKELET LRQQLSAEKQ SADAAQDSLA
AMQKDQEDLL ELLADQEAKL TRYEEAGSTN TLPTSNVAPS VPAAGGGSPI PSGTASR
//
ID POLYP_DROME Unreviewed; 460 AA.
AC Q4V5R4; A0A0B4LG39;
DT 03-OCT-2006, integrated into UniProtKB/TrEMBL.
DT 03-OCT-2006, sequence version 1.
DT 18-JAN-2017, entry version 95.
DE RecName: Full=Glutamate transporter polyphemus {ECO:0000303|PubMed:24210616};
GN Name=polyph {ECO:0000303|PubMed:24210616,
GN ECO:0000312|FlyBase:FBgn0033572};
GN ORFNames=CG12943 {ECO:0000312|FlyBase:FBgn0033572};
OS Drosophila melanogaster (Fruit fly).
OC Eukaryota; Metazoa; Ecdysozoa; Arthropoda; Hexapoda; Insecta;
OC Pterygota; Neoptera; Endopterygota; Diptera; Brachycera; Muscomorpha;
OC Ephydroidea; Drosophilidae; Drosophila; Sophophora.
OX NCBI_TaxID=7227 {ECO:0000312|Proteomes:UP000000803};
RN [1] {ECO:0000312|Proteomes:UP000000803}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
RC STRAIN=Berkeley {ECO:0000312|Proteomes:UP000000803};
RX PubMed=10731132; DOI=10.1126/science.287.5461.2185;
RA Adams M.D., Celniker S.E., Holt R.A., Evans C.A., Gocayne J.D.,
RA Amanatides P.G., Scherer S.E., Li P.W., Hoskins R.A., Galle R.F.,
RA George R.A., Lewis S.E., Richards S., Ashburner M., Henderson S.N.,
RA Sutton G.G., Wortman J.R., Yandell M.D., Zhang Q., Chen L.X.,
RA Brandon R.C., Rogers Y.-H.C., Blazej R.G., Champe M., Pfeiffer B.D.,
RA Wan K.H., Doyle C., Baxter E.G., Helt G., Nelson C.R., Miklos G.L.G.,
RA Abril J.F., Agbayani A., An H.-J., Andrews-Pfannkoch C., Baldwin D.,
RA Ballew R.M., Basu A., Baxendale J., Bayraktaroglu L., Beasley E.M.,
RA Beeson K.Y., Benos P.V., Berman B.P., Bhandari D., Bolshakov S.,
RA Borkova D., Botchan M.R., Bouck J., Brokstein P., Brottier P.,
RA Burtis K.C., Busam D.A., Butler H., Cadieu E., Center A., Chandra I.,
RA Cherry J.M., Cawley S., Dahlke C., Davenport L.B., Davies P.,
RA de Pablos B., Delcher A., Deng Z., Mays A.D., Dew I., Dietz S.M.,
RA Dodson K., Doup L.E., Downes M., Dugan-Rocha S., Dunkov B.C., Dunn P.,
RA Durbin K.J., Evangelista C.C., Ferraz C., Ferriera S., Fleischmann W.,
RA Fosler C., Gabrielian A.E., Garg N.S., Gelbart W.M., Glasser K.,
RA Glodek A., Gong F., Gorrell J.H., Gu Z., Guan P., Harris M.,
RA Harris N.L., Harvey D.A., Heiman T.J., Hernandez J.R., Houck J.,
RA Hostin D., Houston K.A., Howland T.J., Wei M.-H., Ibegwam C.,
RA Jalali M., Kalush F., Karpen G.H., Ke Z., Kennison J.A., Ketchum K.A.,
RA Kimmel B.E., Kodira C.D., Kraft C.L., Kravitz S., Kulp D., Lai Z.,
RA Lasko P., Lei Y., Levitsky A.A., Li J.H., Li Z., Liang Y., Lin X.,
RA Liu X., Mattei B., McIntosh T.C., McLeod M.P., McPherson D.,
RA Merkulov G., Milshina N.V., Mobarry C., Morris J., Moshrefi A.,
RA Mount S.M., Moy M., Murphy B., Murphy L., Muzny D.M., Nelson D.L.,
RA Nelson D.R., Nelson K.A., Nixon K., Nusskern D.R., Pacleb J.M.,
RA Palazzolo M., Pittman G.S., Pan S., Pollard J., Puri V., Reese M.G.,
RA Reinert K., Remington K., Saunders R.D.C., Scheeler F., Shen H.,
RA Shue B.C., Siden-Kiamos I., Simpson M., Skupski M.P., Smith T.J.,
RA Spier E., Spradling A.C., Stapleton M., Strong R., Sun E.,
RA Svirskas R., Tector C., Turner R., Venter E., Wang A.H., Wang X.,
RA Wang Z.-Y., Wassarman D.A., Weinstock G.M., Weissenbach J.,
RA Williams S.M., Woodage T., Worley K.C., Wu D., Yang S., Yao Q.A.,
RA Ye J., Yeh R.-F., Zaveri J.S., Zhan M., Zhang G., Zhao Q., Zheng L.,
RA Zheng X.H., Zhong F.N., Zhong W., Zhou X., Zhu S.C., Zhu X.,
RA Smith H.O., Gibbs R.A., Myers E.W., Rubin G.M., Venter J.C.;
RT "The genome sequence of Drosophila melanogaster.";
RL Science 287:2185-2195(2000).
RN [2] {ECO:0000312|Proteomes:UP000000803}
RP GENOME REANNOTATION.
RC STRAIN=Berkeley {ECO:0000312|Proteomes:UP000000803};
RX PubMed=12537572; DOI=10.1186/gb-2002-3-12-research0083;
RA Misra S., Crosby M.A., Mungall C.J., Matthews B.B., Campbell K.S.,
RA Hradecky P., Huang Y., Kaminker J.S., Millburn G.H., Prochnik S.E.,
RA Smith C.D., Tupy J.L., Whitfield E.J., Bayraktaroglu L., Berman B.P.,
RA Bettencourt B.R., Celniker S.E., de Grey A.D.N.J., Drysdale R.A.,
RA Harris N.L., Richter J., Russo S., Schroeder A.J., Shu S.Q.,
RA Stapleton M., Yamada C., Ashburner M., Gelbart W.M., Rubin G.M.,
RA Lewis S.E.;
RT "Annotation of the Drosophila melanogaster euchromatic genome: a
RT systematic review.";
RL Genome Biol. 3:RESEARCH0083.1-RESEARCH0083.22(2002).
RN [3] {ECO:0000312|EMBL:AAY55008.1}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE MRNA].
RC STRAIN=Berkeley {ECO:0000312|EMBL:AAY55008.1};
RA Stapleton M., Carlson J., Chavez C., Frise E., George R., Pacleb J.,
RA Park S., Wan K., Yu C., Celniker S.;
RL Submitted (MAY-2005) to the EMBL/GenBank/DDBJ databases.
RN [4] {ECO:0000305}
RP FUNCTION, SUBCELLULAR LOCATION, DEVELOPMENTAL STAGE, AND DISRUPTION
RP PHENOTYPE.
RX PubMed=24210616; DOI=10.1016/j.cub.2013.09.061;
RA Gonzalez E.A., Garg A., Tang J., Nazario-Toole A.E., Wu L.P.;
RT "A glutamate-dependent redox system in blood cells is integral for
RT phagocytosis in Drosophila melanogaster.";
RL Curr. Biol. 23:2319-2324(2013).
CC -!- FUNCTION: Glutamate transporter which transports extracellular
CC glutamate into the cells. Regulates the synthesis of antioxidant
CC glutathione and thus the production of intracellular reactive
CC oxygen species (ROS). By regulating ROS production in blood cells,
CC required for bacteria phagocytosis following infection
CC with S.aureus and possibly E.coli. {ECO:0000269|PubMed:24210616}.
CC -!- SUBCELLULAR LOCATION: Cell membrane {ECO:0000269|PubMed:24210616};
CC Multi-pass membrane protein {ECO:0000255}.
CC -!- ALTERNATIVE PRODUCTS:
CC Event=Alternative splicing; Named isoforms=2;
CC Name=A {ECO:0000312|FlyBase:FBgn0033572};
CC IsoId=Q4V5R4-1; Sequence=Displayed;
CC Name=C {ECO:0000312|FlyBase:FBgn0033572};
CC IsoId=Q4V5R4-2; Sequence=?;
CC -!- DEVELOPMENTAL STAGE: Expressed in the hemolymph of larvae and
CC adults. {ECO:0000269|PubMed:24210616}.
CC -!- DISRUPTION PHENOTYPE: RNAi-mediated knockdown in adult blood cells
CC results in decreased survival following infection with S.aureus.
CC Adults infected with S.aureus display decreased phagocytosis,
CC increased bacterial load and increased production of reactive
CC oxygen species (ROS) in the hemolymph. Phagocytosis of latex beads
CC is normal, however flies pre-injected with S.aureus display a
CC significant decrease in subsequent bead phagocytosis. Increased
CC increased survival following infection with L.monocytogenes.
CC Increased extracellular glutamate in the hemolymph. No effect on
CC motor functions, adult weight and no increase in susceptibility to
CC wounding. Induction of the antimicrobial peptides Drs and Dpt in
CC response to S.aureus or E.coli infection is not affected.
CC {ECO:0000269|PubMed:24210616}.
CC -!- MISCELLANEOUS: The name 'polyphemus' derives from the Cyclops in
CC Greek mythology that failed to guard against Odysseus as mutants
CC are unable to defend against microbial infection.
CC {ECO:0000303|PubMed:24210616}.
DR EMBL; AE013599; AAF58727.1; -; Genomic_DNA.
DR EMBL; AE013599; AHN56099.1; -; Genomic_DNA.
DR EMBL; BT022592; AAY55008.1; -; mRNA.
DR RefSeq; NP_001286301.1; NM_001299372.1.
DR RefSeq; NP_610631.1; NM_136787.2.
DR UniGene; Dm.23909; -.
DR ProteinModelPortal; Q4V5R4; -.
DR STRING; 7227.FBpp0087294; -.
DR PaxDb; A0A0B4LG39; -.
DR EnsemblMetazoa; FBtr0088198; FBpp0087294; FBgn0033572.
DR EnsemblMetazoa; FBtr0339474; FBpp0308557; FBgn0033572.
DR GeneID; 36161; -.
DR KEGG; dme:Dmel_CG12943; -.
DR UCSC; CG12943-RA; d. melanogaster.
DR CTD; 36161; -.
DR FlyBase; FBgn0033572; polyph.
DR eggNOG; KOG1304; Eukaryota.
DR eggNOG; COG0814; LUCA.
DR GeneTree; ENSGT00390000011245; -.
DR OMA; LIMYYLF; -.
DR OrthoDB; EOG091G079T; -.
DR PhylomeDB; Q4V5R4; -.
DR Reactome; R-DME-352230; Amino acid transport across the plasma membrane.
DR Reactome; R-DME-428559; Proton-coupled neutral amino acid transporters.
DR GenomeRNAi; 36161; -.
DR Proteomes; UP000000803; Chromosome 2R.
DR Bgee; FBgn0033572; -.
DR ExpressionAtlas; Q4V5R4; differential.
DR GO; GO:0005615; C:extracellular space; IDA:FlyBase.
DR GO; GO:0016021; C:integral component of membrane; IEA:UniProtKB-KW.
DR GO; GO:0015171; F:amino acid transmembrane transporter activity; ISS:FlyBase.
DR GO; GO:0003333; P:amino acid transmembrane transport; ISS:FlyBase.
DR GO; GO:0042742; P:defense response to bacterium; IMP:FlyBase.
DR GO; GO:0032504; P:multicellular organism reproduction; IEP:FlyBase.
DR GO; GO:0006909; P:phagocytosis; IMP:FlyBase.
DR InterPro; IPR013057; AA_transpt_TM.
DR Pfam; PF01490; Aa_trans; 1.
PE 2: Evidence at transcript level;
KW Alternative splicing; Amino-acid transport; Cell membrane;
KW Complete proteome; Membrane; Phagocytosis; Reference proteome;
KW Transmembrane; Transmembrane helix; Transport.
FT CHAIN 1 460 Glutamate transporter polyphemus.
FT TRANSMEM 51 71 Helical. {ECO:0000255}.
FT TRANSMEM 78 98 Helical. {ECO:0000255}.
FT TRANSMEM 139 159 Helical. {ECO:0000255}.
FT TRANSMEM 181 201 Helical. {ECO:0000255}.
FT TRANSMEM 203 223 Helical. {ECO:0000255}.
FT TRANSMEM 241 261 Helical. {ECO:0000255}.
FT TRANSMEM 275 295 Helical. {ECO:0000255}.
FT TRANSMEM 324 344 Helical. {ECO:0000255}.
FT TRANSMEM 368 388 Helical. {ECO:0000255}.
FT TRANSMEM 390 410 Helical. {ECO:0000255}.
FT TRANSMEM 428 448 Helical. {ECO:0000255}.
FT VAR_SEQ 98 100 IAD -> VYS (in isoform C). {ECO:0000305}.
FT VAR_SEQ 101 460 Missing (in isoform C). {ECO:0000305}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000255; -; KAW; 12-JAN-2017.
**EV ECO:0000269; PubMed:24210616; KAW; 12-JAN-2017.
**EV ECO:0000303; PubMed:24210616; KAW; 13-JAN-2017.
**EV ECO:0000305; -; KAW; 13-JAN-2017.
**EV ECO:0000312; EMBL:AAY55008.1; KAW; 22-DEC-2016.
**EV ECO:0000312; FlyBase:FBgn0033572; KAW; 22-DEC-2016.
**EV ECO:0000312; Proteomes:UP000000803; KAW; 12-JAN-2017.
**IS Q4V5R4-3
**ZA KAW, 12-JAN-2017;
**ZZ Merhed with one TrEMBL entry. Mutant data was not added to DISRUPTION
**ZZ PHENOTYPE because it is not a complete knockout (Fig.1a). Gb and eaat1
**ZZ will be curated at a later date because they are TrEMBL entries with
**ZZ multiple characterisation papers.
**ZZ CURATED.
SQ SEQUENCE 460 AA; 52035 MW; 0B088DD47C0F4A97 CRC64;
MEPKSQDQAP NRDDPDLQTE PLTIAQSITS FYMYNPYEKR SVEVPLTNCD AFISLLKCVI
GTGILAMPLA FRCSGFVMGT VMSILLMILL TYSIHLLIAD MTECCRRRRV PQVSMPEAVR
IAYEEGPKWI NCFGRAAGFM TTCVLVFGQF LLCTVYLVFV SKNFKEIGDH YIERYNERYY
VLVACLLLLP LFMIRRLKYL VPLNLISNFL LYAGFALIMY YLFNGLPNIN DREMVTPPVE
WIEFIAIAAF SLTAVGSMLV VEAHMAHPQS YLGLFGVLNL AVLFILLSNM FFGIIGYWRF
GDNVHASITL NIPQDEILSQ FIKVFIASGI FLSYPLNGFV VITVMFSDYE NSEPRGRYRT
LIEYVVRLLF LFLTGAVAIG VPNLAALTEL EGAFSLSNLN LLCPALIDVF LNYNVGYGRL
MWKLIRDILL ILIGLIFGIV GCTVALMQLI RDFQLTLNSM
//
id A0A0B4LG39_DROME Unreviewed; 100 AA.
ac A0A0B4LG39;
dt 01-APR-2015, integrated into UniProtKB/TrEMBL.
dt 01-APR-2015, sequence version 1.
dt 18-JAN-2017, entry version 17.
de SubName: Full=Polyphemus, isoform C {ECO:0000313|EMBL:AHN56099.1};
gn Name=polyph {ECO:0000313|EMBL:AHN56099.1,
gn ECO:0000313|FlyBase:FBgn0033572};
gn ORFNames=CG12943 {ECO:0000313|FlyBase:FBgn0033572},
gn Dmel_CG12943 {ECO:0000313|EMBL:AHN56099.1};
os Drosophila melanogaster (Fruit fly).
oc Eukaryota; Metazoa; Ecdysozoa; Arthropoda; Hexapoda; Insecta;
oc Pterygota; Neoptera; Endopterygota; Diptera; Brachycera; Muscomorpha;
oc Ephydroidea; Drosophilidae; Drosophila; Sophophora.
ox NCBI_TaxID=7227 {ECO:0000313|EMBL:AHN56099.1, ECO:0000313|Proteomes:UP000000803};
rn [1] {ECO:0000313|EMBL:AHN56099.1, ECO:0000313|Proteomes:UP000000803}
rp NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
rc STRAIN=Berkeley {ECO:0000313|Proteomes:UP000000803};
rx PubMed=10731132; DOI=10.1126/science.287.5461.2185;
ra Adams M.D., Celniker S.E., Holt R.A., Evans C.A., Gocayne J.D.,
ra Amanatides P.G., Scherer S.E., Li P.W., Hoskins R.A., Galle R.F.,
ra George R.A., Lewis S.E., Richards S., Ashburner M., Henderson S.N.,
ra Sutton G.G., Wortman J.R., Yandell M.D., Zhang Q., Chen L.X.,
ra Brandon R.C., Rogers Y.H., Blazej R.G., Champe M., Pfeiffer B.D.,
ra Wan K.H., Doyle C., Baxter E.G., Helt G., Nelson C.R., Gabor G.L.,
ra Abril J.F., Agbayani A., An H.J., Andrews-Pfannkoch C., Baldwin D.,
ra Ballew R.M., Basu A., Baxendale J., Bayraktaroglu L., Beasley E.M.,
ra Beeson K.Y., Benos P.V., Berman B.P., Bhandari D., Bolshakov S.,
ra Borkova D., Botchan M.R., Bouck J., Brokstein P., Brottier P.,
ra Burtis K.C., Busam D.A., Butler H., Cadieu E., Center A., Chandra I.,
ra Cherry J.M., Cawley S., Dahlke C., Davenport L.B., Davies P.,
ra de Pablos B., Delcher A., Deng Z., Mays A.D., Dew I., Dietz S.M.,
ra Dodson K., Doup L.E., Downes M., Dugan-Rocha S., Dunkov B.C., Dunn P.,
ra Durbin K.J., Evangelista C.C., Ferraz C., Ferriera S., Fleischmann W.,
ra Fosler C., Gabrielian A.E., Garg N.S., Gelbart W.M., Glasser K.,
ra Glodek A., Gong F., Gorrell J.H., Gu Z., Guan P., Harris M.,
ra Harris N.L., Harvey D., Heiman T.J., Hernandez J.R., Houck J.,
ra Hostin D., Houston K.A., Howland T.J., Wei M.H., Ibegwam C.,
ra Jalali M., Kalush F., Karpen G.H., Ke Z., Kennison J.A., Ketchum K.A.,
ra Kimmel B.E., Kodira C.D., Kraft C., Kravitz S., Kulp D., Lai Z.,
ra Lasko P., Lei Y., Levitsky A.A., Li J., Li Z., Liang Y., Lin X.,
ra Liu X., Mattei B., McIntosh T.C., McLeod M.P., McPherson D.,
ra Merkulov G., Milshina N.V., Mobarry C., Morris J., Moshrefi A.,
ra Mount S.M., Moy M., Murphy B., Murphy L., Muzny D.M., Nelson D.L.,
ra Nelson D.R., Nelson K.A., Nixon K., Nusskern D.R., Pacleb J.M.,
ra Palazzolo M., Pittman G.S., Pan S., Pollard J., Puri V., Reese M.G.,
ra Reinert K., Remington K., Saunders R.D., Scheeler F., Shen H.,
ra Shue B.C., Siden-Kiamos I., Simpson M., Skupski M.P., Smith T.,
ra Spier E., Spradling A.C., Stapleton M., Strong R., Sun E.,
ra Svirskas R., Tector C., Turner R., Venter E., Wang A.H., Wang X.,
ra Wang Z.Y., Wassarman D.A., Weinstock G.M., Weissenbach J.,
ra Williams S.M., WoodageT, Worley K.C., Wu D., Yang S., Yao Q.A., Ye J.,
ra Yeh R.F., Zaveri J.S., Zhan M., Zhang G., Zhao Q., Zheng L.,
ra Zheng X.H., Zhong F.N., Zhong W., Zhou X., Zhu S., Zhu X., Smith H.O.,
ra Gibbs R.A., Myers E.W., Rubin G.M., Venter J.C.;
rt "The genome sequence of Drosophila melanogaster.";
rl Science 287:2185-2195(2000).
rn [2] {ECO:0000313|EMBL:AHN56099.1, ECO:0000313|Proteomes:UP000000803}
rp NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
rc STRAIN=Berkeley {ECO:0000313|Proteomes:UP000000803};
rx PubMed=12537568;
ra Celniker S.E., Wheeler D.A., Kronmiller B., Carlson J.W., Halpern A.,
ra Patel S., Adams M., Champe M., Dugan S.P., Frise E., Hodgson A.,
ra George R.A., Hoskins R.A., Laverty T., Muzny D.M., Nelson C.R.,
ra Pacleb J.M., Park S., Pfeiffer B.D., Richards S., Sodergren E.J.,
ra Svirskas R., Tabor P.E., Wan K., Stapleton M., Sutton G.G., Venter C.,
ra Weinstock G., Scherer S.E., Myers E.W., Gibbs R.A., Rubin G.M.;
rt "Finishing a whole-genome shotgun: release 3 of the Drosophila
rt melanogaster euchromatic genome sequence.";
rl Genome Biol. 3:RESEARCH0079-RESEARCH0079(2002).
rn [3] {ECO:0000313|EMBL:AHN56099.1, ECO:0000313|Proteomes:UP000000803}
rp NUCLEOTIDE SEQUENCE.
rc STRAIN=Berkeley {ECO:0000313|Proteomes:UP000000803};
rx PubMed=12537572; DOI=10.1186/gb-2002-3-12-research0083;
ra Misra S., Crosby M.A., Mungall C.J., Matthews B.B., Campbell K.S.,
ra Hradecky P., Huang Y., Kaminker J.S., Millburn G.H., Prochnik S.E.,
ra Smith C.D., Tupy J.L., Whitfied E.J., Bayraktaroglu L., Berman B.P.,
ra Bettencourt B.R., Celniker S.E., de Grey A.D., Drysdale R.A.,
ra Harris N.L., Richter J., Russo S., Schroeder A.J., Shu S.Q.,
ra Stapleton M., Yamada C., Ashburner M., Gelbart W.M., Rubin G.M.,
ra Lewis S.E.;
rt "Annotation of the Drosophila melanogaster euchromatic genome: a
rt systematic review.";
rl Genome Biol. 3:RESEARCH0083.1-RESEARCH0083.22(2002).
rn [4] {ECO:0000313|EMBL:AHN56099.1, ECO:0000313|Proteomes:UP000000803}
rp NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
rc STRAIN=Berkeley {ECO:0000313|Proteomes:UP000000803};
rx PubMed=12537573;
ra Kaminker J.S., Bergman C.M., Kronmiller B., Carlson J., Svirskas R.,
ra Patel S., Frise E., Wheeler D.A., Lewis S.E., Rubin G.M.,
ra Ashburner M., Celniker S.E.;
rt "The transposable elements of the Drosophila melanogaster euchromatin:
rt a genomics perspective.";
rl Genome Biol. 3:RESEARCH0084.1-RESEARCH0084.20(2002).
rn [5] {ECO:0000313|EMBL:AHN56099.1, ECO:0000313|Proteomes:UP000000803}
rp NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
rc STRAIN=Berkeley {ECO:0000313|Proteomes:UP000000803};
rx PubMed=12537574;
ra Hoskins R.A., Smith C.D., Carlson J.W., Carvalho A.B., Halpern A.,
ra Kaminker J.S., Kennedy C., Mungall C.J., Sullivan B.A., Sutton G.G.,
ra Yasuhara J.C., Wakimoto B.T., Myers E.W., Celniker S.E., Rubin G.M.,
ra Karpen G.H.;
rt "Heterochromatic sequences in a Drosophila whole-genome shotgun
rt assembly.";
rl Genome Biol. 3:RESEARCH0085-RESEARCH0085(2002).
rn [6] {ECO:0000313|EMBL:AHN56099.1, ECO:0000313|Proteomes:UP000000803}
rp NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
rc STRAIN=Berkeley {ECO:0000313|Proteomes:UP000000803};
rx PubMed=16110336; DOI=10.1371/journal.pcbi.0010022;
ra Quesneville H., Bergman C.M., Andrieu O., Autard D., Nouaud D.,
ra Ashburner M., Anxolabehere D.;
rt "Combined evidence annotation of transposable elements in genome
rt sequences.";
rl PLoS Comput. Biol. 1:166-175(2005).
rn [7] {ECO:0000313|EMBL:AHN56099.1, ECO:0000313|Proteomes:UP000000803}
rp NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
rc STRAIN=Berkeley {ECO:0000313|Proteomes:UP000000803};
rx PubMed=17569856; DOI=10.1126/science.1139815;
ra Smith C.D., Shu S., Mungall C.J., Karpen G.H.;
rt "The Release 5.1 annotation of Drosophila melanogaster
rt heterochromatin.";
rl Science 316:1586-1591(2007).
rn [8] {ECO:0000313|EMBL:AHN56099.1, ECO:0000313|Proteomes:UP000000803}
rp NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
rc STRAIN=Berkeley {ECO:0000313|Proteomes:UP000000803};
rx PubMed=17569867; DOI=10.1126/science.1139816;
ra Hoskins R.A., Carlson J.W., Kennedy C., Acevedo D., Evans-Holm M.,
ra Frise E., Wan K.H., Park S., Mendez-Lago M., Rossi F., Villasante A.,
ra Dimitri P., Karpen G.H., Celniker S.E.;
rt "Sequence finishing and mapping of Drosophila melanogaster
rt heterochromatin.";
rl Science 316:1625-1628(2007).
dr EMBL; AE013599; AHN56099.1; -; Genomic_DNA.
dr RefSeq; NP_001286301.1; NM_001299372.1.
dr UniGene; Dm.23909; -.
dr STRING; 7227.FBpp0087294; -.
dr PaxDb; A0A0B4LG39; -.
dr EnsemblMetazoa; FBtr0339474; FBpp0308557; FBgn0033572.
dr GeneID; 36161; -.
dr KEGG; dme:Dmel_CG12943; -.
dr CTD; 36161; -.
dr FlyBase; FBgn0033572; polyph.
dr eggNOG; KOG1304; Eukaryota.
dr eggNOG; COG0814; LUCA.
dr GeneTree; ENSGT00390000011245; -.
dr OrthoDB; EOG091G079T; -.
dr GenomeRNAi; 36161; -.
dr Proteomes; UP000000803; Chromosome 2R.
dr ExpressionAtlas; A0A0B4LG39; differential.
dr GO; GO:0005615; C:extracellular space; IDA:FlyBase.
dr GO; GO:0016021; C:integral component of membrane; IEA:UniProtKB-KW.
dr GO; GO:0015171; F:amino acid transmembrane transporter activity; ISS:FlyBase.
dr GO; GO:0003333; P:amino acid transmembrane transport; ISS:FlyBase.
dr GO; GO:0042742; P:defense response to bacterium; IMP:FlyBase.
dr GO; GO:0032504; P:multicellular organism reproduction; IEP:FlyBase.
dr GO; GO:0006909; P:phagocytosis; IMP:FlyBase.
dr InterPro; IPR013057; AA_transpt_TM.
dr Pfam; PF01490; Aa_trans; 1.
pe 4: Predicted;
kw Complete proteome; Membrane; Reference proteome; Transmembrane;
kw Transmembrane helix.
ft CHAIN 1 100 Polyphemus, isoform C.
ft TRANSMEM 51 69 Helical. {ECO:0000256|SAM:Phobius}.
ft TRANSMEM 76 98 Helical. {ECO:0000256|SAM:Phobius}.
ft DOMAIN 48 98 Aa_trans. {ECO:0000259|Pfam:PF01490}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000256; SAM:Phobius; -; 09-SEP-2015.
**EV ECO:0000259; Pfam:PF01490; -; 06-NOV-2015.
**EV ECO:0000313; EMBL:AHN56099.1; -; 13-FEB-2015.
**EV ECO:0000313; FlyBase:FBgn0033572; -; 05-JUL-2015.
**EV ECO:0000313; Proteomes:UP000000803; -; 18-FEB-2015.
sq SEQUENCE 100 AA; 11182 MW; 23CB5A823A7C26FB CRC64;
MEPKSQDQAP NRDDPDLQTE PLTIAQSITS FYMYNPYEKR SVEVPLTNCD AFISLLKCVI
GTGILAMPLA FRCSGFVMGT VMSILLMILL TYSIHLLVYS
//
ID CBPE_CAEEL Unreviewed; 472 AA.
AC O17754;
DT 01-JAN-1998, integrated into UniProtKB/TrEMBL.
DT 01-JAN-1998, sequence version 1.
DT 02-NOV-2016, entry version 122.
DE RecName: Full=Carboxypeptidase E {ECO:0000303|PubMed:12657671};
DE Short=CPE {ECO:0000303|PubMed:12657671};
DE EC=3.4.17.10 {ECO:0000303|PubMed:12657671, ECO:0000303|PubMed:17564681};
DE AltName: Full=Egg-laying defective protein 21 {ECO:0000303|PubMed:11813735};
DE Flags: Precursor;
GN Name=egl-21 {ECO:0000303|PubMed:11813735,
GN ECO:0000312|WormBase:F01D4.4};
GN ORFNames=F01D4.4 {ECO:0000312|WormBase:F01D4.4};
OS Caenorhabditis elegans.
OC Eukaryota; Metazoa; Ecdysozoa; Nematoda; Chromadorea; Rhabditida;
OC Rhabditoidea; Rhabditidae; Peloderinae; Caenorhabditis.
OX NCBI_TaxID=6239 {ECO:0000312|Proteomes:UP000001940};
RN [1] {ECO:0000312|Proteomes:UP000001940}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
RC STRAIN=Bristol N2 {ECO:0000312|Proteomes:UP000001940};
RX PubMed=9851916; DOI=10.1126/science.282.5396.2012;
RG The C. elegans sequencing consortium;
RT "Genome sequence of the nematode C. elegans: a platform for
RT investigating biology.";
RL Science 282:2012-2018(1998).
RN [2] {ECO:0000305}
RP FUNCTION.
RX PubMed=11813735;
RA Trent C., Tsuing N., Horvitz H.R.;
RT "Egg-laying defective mutants of the nematode Caenorhabditis
RT elegans.";
RL Genetics 104:619-647(1983).
RN [3] {ECO:0000305}
RP FUNCTION, CATALYTIC ACTIVITY, SUBCELLULAR LOCATION, AND TISSUE
RP SPECIFICITY.
RX PubMed=12657671;
RA Jacob T.C., Kaplan J.M.;
RT "The EGL-21 carboxypeptidase E facilitates acetylcholine release at
RT Caenorhabditis elegans neuromuscular junctions.";
RL J. Neurosci. 23:2122-2130(2003).
RN [4] {ECO:0000305}
RP FUNCTION, AND CATALYTIC ACTIVITY.
RX PubMed=17564681; DOI=10.1111/j.1471-4159.2007.04474.x;
RA Husson S.J., Janssen T., Baggerman G., Bogert B., Kahn-Kirby A.H.,
RA Ashrafi K., Schoofs L.;
RT "Impaired processing of FLP and NLP peptides in carboxypeptidase E
RT (EGL-21)-deficient Caenorhabditis elegans as analyzed by mass
RT spectrometry.";
RL J. Neurochem. 102:246-260(2007).
RN [5] {ECO:0000305}
RP FUNCTION.
RX PubMed=17611271; DOI=10.1523/JNEUROSCI.1405-07.2007;
RA Liu T., Kim K., Li C., Barr M.M.;
RT "FMRFamide-like neuropeptides and mechanosensory touch receptor
RT neurons regulate male sexual turning behavior in Caenorhabditis
RT elegans.";
RL J. Neurosci. 27:7174-7182(2007).
RN [6] {ECO:0000305}
RP FUNCTION.
RX PubMed=22275875; DOI=10.1371/journal.pgen.1002464;
RA Hao Y., Hu Z., Sieburth D., Kaplan J.M.;
RT "RIC-7 promotes neuropeptide secretion.";
RL PLoS Genet. 8:E1002464-E1002464(2012).
RN [7] {ECO:0000305}
RP FUNCTION.
RX PubMed=25101962; DOI=10.1371/journal.pgen.1004529;
RA Sharabi K., Charar C., Friedman N., Mizrahi I., Zaslaver A.,
RA Sznajder J.I., Gruenbaum Y.;
RT "The response to high CO2 levels requires the neuropeptide secretion
RT component HID-1 to promote pumping inhibition.";
RL PLoS Genet. 10:E1004529-E1004529(2014).
CC -!- FUNCTION: During FMRFamide-like peptide (FaRPs or FLP) and
CC neuropeptide-like protein (NLP) precursor processing, catalyzes
CC the removal of Arg or Lys residues from the C-terminus following
CC the initial endoprotease cleavage (PubMed:17564681,
CC PubMed:12657671). By processing neuropeptides, modulates basal
CC acetylcholine release at the ventral cord neuromuscular junctions
CC (PubMed:12657671, PubMed:22275875). Involved in egg-laying,
CC defecation and locomotion (PubMed:11813735, PubMed:17564681,
CC PubMed:22275875). By processing FLP neuropeptides, regulates the
CC turning step of male mating behavior (PubMed:17611271). Involved
CC in reducing pharyngeal pumping in response to high CO(2) levels
CC (PubMed:25101962). {ECO:0000269|PubMed:11813735,
CC ECO:0000269|PubMed:12657671, ECO:0000269|PubMed:17564681,
CC ECO:0000269|PubMed:17611271, ECO:0000269|PubMed:22275875,
CC ECO:0000269|PubMed:25101962}.
CC -!- CATALYTIC ACTIVITY: Release of C-terminal arginine or lysine
CC residues from polypeptides. {ECO:0000303|PubMed:12657671,
CC ECO:0000303|PubMed:17564681}.
CC -!- COFACTOR:
CC Name=Zn(2+); Xref=ChEBI:CHEBI:29105;
CC Evidence={ECO:0000250|UniProtKB:P00730};
CC Note=Binds 1 zinc ion per subunit. {ECO:0000250|UniProtKB:P00730};
CC -!- SUBCELLULAR LOCATION: Cell projection, axon
CC {ECO:0000269|PubMed:12657671}. Perikaryon
CC {ECO:0000269|PubMed:12657671}. Cytoplasmic vesicle, secretory
CC vesicle lumen {ECO:0000303|PubMed:12657671}. Note=Predominantly
CC localizes to axons in the nerve ring.
CC {ECO:0000269|PubMed:12657671}.
CC -!- TISSUE SPECIFICITY: Expression is restricted to the nervous
CC system. {ECO:0000269|PubMed:12657671}.
CC -!- SIMILARITY: Belongs to the peptidase M14 family. {ECO:0000305}.
DR EMBL; BX284604; CAB02881.1; -; Genomic_DNA.
DR PIR; T20454; T20454.
DR RefSeq; NP_501935.1; NM_069534.6.
DR UniGene; Cel.17657; -.
DR ProteinModelPortal; O17754; -.
DR SMR; O17754; -.
DR DIP; DIP-26452N; -.
DR IntAct; O17754; 1.
DR MINT; MINT-1076769; -.
DR STRING; 6239.F01D4.4.1; -.
DR MEROPS; M14.033; -.
DR EPD; O17754; -.
DR PaxDb; O17754; -.
DR PeptideAtlas; O17754; -.
DR EnsemblMetazoa; F01D4.4.1; F01D4.4.1; WBGene00001189.
DR EnsemblMetazoa; F01D4.4.2; F01D4.4.2; WBGene00001189.
DR EnsemblMetazoa; F01D4.4.3; F01D4.4.3; WBGene00001189.
DR GeneID; 177940; -.
DR KEGG; cel:CELE_F01D4.4; -.
DR UCSC; F01D4.4.1; c. elegans.
DR CTD; 177940; -.
DR WormBase; F01D4.4; CE09156; WBGene00001189; egl-21.
DR eggNOG; KOG2649; Eukaryota.
DR eggNOG; ENOG410XX0H; LUCA.
DR GeneTree; ENSGT00760000119124; -.
DR HOGENOM; HOG000232185; -.
DR InParanoid; O17754; -.
DR KO; K01294; -.
DR OMA; INLIHNT; -.
DR OrthoDB; EOG091G06A9; -.
DR PhylomeDB; O17754; -.
DR Proteomes; UP000001940; Chromosome IV.
DR Bgee; WBGene00001189; -.
DR GO; GO:0030424; C:axon; IDA:WormBase.
DR GO; GO:0031410; C:cytoplasmic vesicle; IDA:WormBase.
DR GO; GO:0005615; C:extracellular space; IBA:GO_Central.
DR GO; GO:0043025; C:neuronal cell body; IDA:WormBase.
DR GO; GO:0098793; C:presynapse; IEA:GOC.
DR GO; GO:0004180; F:carboxypeptidase activity; IMP:WormBase.
DR GO; GO:0004181; F:metallocarboxypeptidase activity; IBA:GO_Central.
DR GO; GO:0004185; F:serine-type carboxypeptidase activity; IBA:GO_Central.
DR GO; GO:0008270; F:zinc ion binding; IEA:InterPro.
DR GO; GO:0014055; P:acetylcholine secretion, neurotransmission; IMP:WormBase.
DR GO; GO:0030536; P:larval feeding behavior; IMP:UniProtKB.
DR GO; GO:0006518; P:peptide metabolic process; IBA:GO_Central.
DR GO; GO:0016485; P:protein processing; IMP:WormBase.
DR GO; GO:1903998; P:regulation of eating behavior; IMP:UniProtKB.
DR Gene3D; 2.60.40.1120; -; 1.
DR InterPro; IPR008969; CarboxyPept-like_regulatory.
DR InterPro; IPR014766; CarboxyPept_regulatory_dom.
DR InterPro; IPR000834; Peptidase_M14.
DR Pfam; PF00246; Peptidase_M14; 1.
DR PRINTS; PR00765; CRBOXYPTASEA.
DR SMART; SM00631; Zn_pept; 1.
DR SUPFAM; SSF49464; SSF49464; 1.
DR PROSITE; PS00132; CARBOXYPEPT_ZN_1; 1.
PE 1: Evidence at protein level;
KW Carboxypeptidase; Cell projection; Complete proteome;
KW Cytoplasmic vesicle; Glycoprotein; Hydrolase; Metal-binding;
KW Metalloprotease; Protease; Reference proteome; Signal; Zinc.
FT SIGNAL 1 21 {ECO:0000255}.
FT CHAIN 22 472 Carboxypeptidase E. {ECO:0000255}.
FT /FTId=PRO_5004157411.
FT ACT_SITE 329 329 Proton donor/acceptor.
FT {ECO:0000250|UniProtKB:P14384}.
FT METAL 101 101 Zinc; catalytic.
FT {ECO:0000250|UniProtKB:P00730}.
FT METAL 104 104 Zinc; catalytic.
FT {ECO:0000250|UniProtKB:P00730}.
FT METAL 232 232 Zinc; catalytic.
FT {ECO:0000250|UniProtKB:P00730}.
FT CARBOHYD 134 134 N-linked (GlcNAc...).
FT {ECO:0000255|PROSITE-ProRule:PRU00498}.
FT CARBOHYD 385 385 N-linked (GlcNAc...).
FT {ECO:0000255|PROSITE-ProRule:PRU00498}.
FT CARBOHYD 428 428 N-linked (GlcNAc...).
FT {ECO:0000255|PROSITE-ProRule:PRU00498}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000250; UniProtKB:P00730; ROZ; 11-JAN-2017.
**EV ECO:0000250; UniProtKB:P14384; ROZ; 11-JAN-2017.
**EV ECO:0000255; -; ROZ; 11-JAN-2017.
**EV ECO:0000255; PROSITE-ProRule:PRU00498; ROZ; 11-JAN-2017.
**EV ECO:0000269; PubMed:11813735; ROZ; 11-JAN-2017.
**EV ECO:0000269; PubMed:12657671; ROZ; 11-JAN-2017.
**EV ECO:0000269; PubMed:17564681; ROZ; 11-JAN-2017.
**EV ECO:0000269; PubMed:17611271; ROZ; 11-JAN-2017.
**EV ECO:0000269; PubMed:22275875; ROZ; 11-JAN-2017.
**EV ECO:0000269; PubMed:25101962; ROZ; 11-JAN-2017.
**EV ECO:0000303; PubMed:11813735; ROZ; 11-JAN-2017.
**EV ECO:0000303; PubMed:12657671; ROZ; 11-JAN-2017.
**EV ECO:0000303; PubMed:17564681; ROZ; 11-JAN-2017.
**EV ECO:0000305; -; ROZ; 11-JAN-2017.
**EV ECO:0000312; Proteomes:UP000001940; ROZ; 11-JAN-2017.
**EV ECO:0000312; WormBase:F01D4.4; ROZ; 11-JAN-2017.
**ZA ROZ, 11-JAN-2017;
**ZZ Curated following request from a user.
**ZZ Related to Swiss-Prot entries in rzEGL21b.log.
**ZZ Mutants n476 and n576 are not annotated as it is not clear if they are
**ZZ null or not.
**ZZ In PMID:12657671, they showed that the propetide present in mammalian
**ZZ CPEs is not conserved in C.elegans thus I didn't annotated it and I
**ZZ didn't add the keyword ZYMOGEN.
**ZZ In PMID:12657671, they showed that in mutants levels of FaRPs is
**ZZ reduced (by microscopy). In PMID:17564681, they showed that in mutants
**ZZ neuropeptides have an extended C-terminus (K or R residues are still
**ZZ present). As this is indirect evidence for catalytic activity I used
**ZZ an OPI tag instead of an EXP for CC CATALYTIC ACTIVITY.
**ZZ flp-8, flp-10, flp-12, flp-20, egl-3, hid-1, ric-7 and ida-1 are in
**ZZ TrEMBL and will be curated later.
**ZZ PMID:16049479 was not added as shows similar results for acetylcholine
**ZZ release. PMID:18818084 was not added as shows similar egg-laying
**ZZ defects.
**ZZ CURATED.
SQ SEQUENCE 472 AA; 52279 MW; E3B1AFF682075A8B CRC64;
MLHAMRPVLL VAALLAVTAH AFLGFGSGST HKDDAEWGHY HNQAQLEAKL GEINEKCPEI
TTLYEIGQSV EGRPLVVIQF STTPGEHIPT KPEVKLIGNM HGNEPIGREL LLRFAETLCN
GAINNDKEIV QLLNSTSIHI LPSMNPDGFE LALGTEPAQR QWLTGRSNIN GVDLNRDFPD
LDSIFYELQK IGVPKFDHLL SLFEDNVDRQ PETIAVGQWT LSLPFVLSAN FHEGDLVANY
PFDAAIDENS QKTAYSASPD DGTFRWLAKS YADNHAHMSK NDHAPCDGTS QDAFARQGGI
TNGAKWYSVA GGMQDFNYLA TNAMEITLEL SCEKMPEGSQ LPRFWEDNQK SIFEYVWKSH
SGVKGMVVDA MTGEPIKRAV VWIRNGTETV PVKHPVTTWS EGDFYRVLPA GKYEIIVAAE
GYDIAAKNVT VENKVRDSAL VVNFALSPAA DEPSENEQEQ IAELVNEIAR RR
//
ID MEL28_CAEEL Unreviewed; 1784 AA.
AC Q18508;
DT 01-NOV-1996, integrated into UniProtKB/TrEMBL.
DT 05-JUL-2004, sequence version 2.
DT 02-NOV-2016, entry version 114.
DE RecName: Full=Protein mel-28 {ECO:0000305};
DE AltName: Full=Maternal effect lethal protein 28 {ECO:0000305};
GN Name=mel-28 {ECO:0000312|WormBase:C38D4.3};
GN ORFNames=C38D4.3 {ECO:0000312|WormBase:C38D4.3};
OS Caenorhabditis elegans.
OC Eukaryota; Metazoa; Ecdysozoa; Nematoda; Chromadorea; Rhabditida;
OC Rhabditoidea; Rhabditidae; Peloderinae; Caenorhabditis.
OX NCBI_TaxID=6239 {ECO:0000312|Proteomes:UP000001940};
RN [1] {ECO:0000312|Proteomes:UP000001940}
RP NUCLEOTIDE SEQUENCE [LARGE SCALE GENOMIC DNA].
RC STRAIN=Bristol N2 {ECO:0000312|Proteomes:UP000001940};
RX PubMed=9851916; DOI=10.1126/science.282.5396.2012;
RG The C. elegans sequencing consortium;
RT "Genome sequence of the nematode C. elegans: a platform for
RT investigating biology.";
RL Science 282:2012-2018(1998).
RN [2] {ECO:0000305}
RP FUNCTION, SUBCELLULAR LOCATION, TISSUE SPECIFICITY, AND DISRUPTION
RP PHENOTYPE.
RX PubMed=16950114; DOI=10.1016/j.cub.2006.06.067;
RA Galy V., Askjaer P., Franz C., Lopez-Iglesias C., Mattaj I.W.;
RT "MEL-28, a novel nuclear-envelope and kinetochore protein essential
RT for zygotic nuclear-envelope assembly in C. elegans.";
RL Curr. Biol. 16:1748-1756(2006).
RN [3] {ECO:0000305}
RP FUNCTION, SUBCELLULAR LOCATION, AND DISRUPTION PHENOTYPE.
RX PubMed=16950115; DOI=10.1016/j.cub.2006.07.071;
RA Fernandez A.G., Piano F.;
RT "MEL-28 is downstream of the Ran cycle and is required for nuclear-
RT envelope function and chromatin maintenance.";
RL Curr. Biol. 16:1757-1763(2006).
RN [4] {ECO:0000305}
RP FUNCTION, SUBCELLULAR LOCATION, AND DISRUPTION PHENOTYPE.
RX PubMed=26166571; DOI=10.1016/j.celrep.2015.06.046;
RA Sonneville R., Craig G., Labib K., Gartner A., Blow J.J.;
RT "Both chromosome decondensation and condensation are dependent on DNA
RT replication in C. elegans embryos.";
RL Cell Rep. 12:405-417(2015).
RN [5] {ECO:0000305}
RP FUNCTION, SUBCELLULAR LOCATION, DEVELOPMENTAL STAGE, AND MUTAGENESIS
RP OF 409-ASP--PRO-417.
RX PubMed=27341616; DOI=10.1371/journal.pgen.1006131;
RA Gomez-Saldivar G., Fernandez A., Hirano Y., Mauro M., Lai A.,
RA Ayuso C., Haraguchi T., Hiraoka Y., Piano F., Askjaer P.;
RT "Identification of conserved MEL-28/ELYS domains with essential roles
RT in nuclear assembly and chromosome segregation.";
RL PLoS Genet. 12:E1006131-E1006131(2016).
CC -!- FUNCTION: Nuclear envelope protein which has essential roles in
CC assembly of nuclear pore complexes and in chromatin maintenance
CC during the cell cycle (PubMed:16950114, PubMed:16950115,
CC PubMed:26166571, PubMed:27341616). Appears to be a stable
CC structural component of the nuclear envelope during interphase
CC (PubMed:16950114, PubMed:16950115). In dividing cells, localizes
CC to kinetochores during early stages of mitosis and then to
CC chromatin during late mitosis (PubMed:16950114, PubMed:27341616).
CC Important for several mitotic processes including chromosome
CC condensation, kinetochore assembly, chromosome segregation and
CC cell-cycle timing (PubMed:16950114, PubMed:16950115,
CC PubMed:26166571, PubMed:27341616). In postmitotic cells, plays a
CC role in the early steps of nuclear pore complex assembly by
CC recruiting the nucleoporins npp-10 and npp-5 to chromatin
CC (PubMed:16950114, PubMed:16950115). Also involved in meiotic
CC chromosome segregation (PubMed:27341616). May function downstream
CC of the Ran GTPase signaling pathway (PubMed:16950115).
CC {ECO:0000269|PubMed:16950114, ECO:0000269|PubMed:16950115,
CC ECO:0000269|PubMed:26166571, ECO:0000269|PubMed:27341616}.
CC -!- SUBCELLULAR LOCATION: Nucleus {ECO:0000269|PubMed:16950114,
CC ECO:0000269|PubMed:16950115, ECO:0000269|PubMed:27341616}.
CC Nucleus, nucleoplasm {ECO:0000269|PubMed:27341616}. Nucleus
CC envelope {ECO:0000269|PubMed:27341616}. Nucleus inner membrane
CC {ECO:0000269|PubMed:16950114, ECO:0000269|PubMed:16950115}.
CC Nucleus, nuclear pore complex {ECO:0000269|PubMed:16950114}.
CC Chromosome {ECO:0000269|PubMed:16950114,
CC ECO:0000269|PubMed:16950115, ECO:0000269|PubMed:27341616}.
CC Chromosome, centromere, kinetochore {ECO:0000269|PubMed:16950114,
CC ECO:0000269|PubMed:16950115, ECO:0000269|PubMed:27341616}.
CC Note=Has a dynamic expression pattern during the cell cycle
CC (PubMed:16950114, PubMed:27341616). During interphase, localizes
CC to nuclear pore complexes and is also found in the nucleoplasm
CC (PubMed:16950114, PubMed:27341616). During early mitosis,
CC localizes to kinetochores in a hcp-3/CENP-A and hcp-4/CENP-C
CC dependent manner (PubMed:16950114, PubMed:16950115,
CC PubMed:27341616). At later stages of mitosis (anaphase), widely
CC distributed on chromatin (PubMed:16950114, PubMed:27341616).
CC During telophase, localizes again to the reforming nuclear
CC envelope (PubMed:16950114, PubMed:27341616).
CC {ECO:0000269|PubMed:16950114, ECO:0000269|PubMed:16950115,
CC ECO:0000269|PubMed:27341616}.
CC -!- TISSUE SPECIFICITY: Ubiquitously expressed (at protein level).
CC {ECO:0000269|PubMed:16950114}.
CC -!- DEVELOPMENTAL STAGE: Expressed at all stages of development.
CC {ECO:0000269|PubMed:27341616}.
CC -!- DISRUPTION PHENOTYPE: RNAi-mediated knockdown results in embryonic
CC lethality (PubMed:16950114). Impairs assembly of the nuclear pore
CC complex, the integrity of the nuclear envelope and distribution of
CC the integral nuclear envelope proteins lmn-1, lem-2 and emr-1 and
CC the nuclear pore complex proteins npp-9, npp-10 and npp-1
CC (PubMed:16950114, PubMed:16950115). Reduces the recruitment of
CC npp-10 and npp-5 to chromatin (PubMed:16950114). Leads to
CC hypercondensation and mispositioning of chromatin, defects in
CC migration and positioning of the pronuclei, dissociation of
CC centrosomes from chromatin, precocious centrosome separation, as
CC well as defects in kinetochore assembly, spindle assembly,
CC chromosome segregation and chromatin distribution in meiosis and
CC mitosis (PubMed:16950114, PubMed:16950115). Impairs mitotic
CC progression and leads to chromatin bridges (PubMed:16950114,
CC PubMed:16950115). Reduces knl-3 localization to the kinetochores
CC (PubMed:16950115). Suppresses the chromosome-decondensation defect
CC in evl-18/cdc-45 mutant embryos (PubMed:26166571).
CC {ECO:0000269|PubMed:16950114, ECO:0000269|PubMed:16950115,
CC ECO:0000269|PubMed:26166571}.
DR EMBL; BX284603; CAA86316.2; -; Genomic_DNA.
DR PIR; T19823; T19823.
DR RefSeq; NP_497987.2; NM_065586.6.
DR UniGene; Cel.22812; -.
DR ProteinModelPortal; Q18508; -.
DR IntAct; Q18508; 3.
DR MINT; MINT-6668947; -.
DR STRING; 6239.C38D4.3.1; -.
DR EPD; Q18508; -.
DR PaxDb; Q18508; -.
DR PeptideAtlas; Q18508; -.
DR EnsemblMetazoa; C38D4.3; C38D4.3; WBGene00003210.
DR GeneID; 175634; -.
DR KEGG; cel:CELE_C38D4.3; -.
DR UCSC; C38D4.3; c. elegans.
DR CTD; 175634; -.
DR WormBase; C38D4.3; CE36378; WBGene00003210; mel-28.
DR eggNOG; ENOG410JQ8U; Eukaryota.
DR eggNOG; ENOG4111CS3; LUCA.
DR HOGENOM; HOG000021340; -.
DR InParanoid; Q18508; -.
DR OMA; CAFLSTI; -.
DR OrthoDB; EOG091G01JX; -.
DR PRO; PR:Q18508; -.
DR Proteomes; UP000001940; Chromosome III.
DR Bgee; WBGene00003210; -.
DR GO; GO:0000777; C:condensed chromosome kinetochore; IDA:WormBase.
DR GO; GO:0005635; C:nuclear envelope; IDA:WormBase.
DR GO; GO:0005643; C:nuclear pore; IDA:WormBase.
DR GO; GO:0005654; C:nucleoplasm; IDA:WormBase.
DR GO; GO:0000070; P:mitotic sister chromatid segregation; IMP:WormBase.
DR GO; GO:0051292; P:nuclear pore complex assembly; IMP:WormBase.
PE 1: Evidence at protein level;
KW Cell cycle; Cell division; Centromere; Chromosome; Complete proteome;
KW DNA-binding; Kinetochore; Meiosis; Membrane; Mitosis; mRNA transport;
KW Nuclear pore complex; Nucleus; Protein transport; Reference proteome;
KW Translocation; Transport.
FT CHAIN 1 1784 Protein mel-28.
FT DNA_BIND 1630 1642 A.T hook 1. {ECO:0000305}.
FT DNA_BIND 1746 1758 A.T hook 2. {ECO:0000305}.
FT REGION 1 956 Required for nuclear envelope and
FT kinetochore localization.
FT {ECO:0000269|PubMed:27341616}.
FT REGION 566 778 Required for association with mitotic
FT chromosomes.
FT {ECO:0000269|PubMed:27341616}.
FT REGION 846 1071 Important for nuclear localization.
FT {ECO:0000269|PubMed:27341616}.
FT REGION 1239 1601 Chromatin binding.
FT {ECO:0000269|PubMed:27341616}.
FT REGION 1601 1784 Important for nuclear localization.
FT {ECO:0000269|PubMed:27341616}.
FT REGION 1630 1784 Required for chromosome segregation,
FT nuclear growth, nucleoplasmic
FT accumulation and cell cycle timing, but
FT not required for nuclear envelope and
FT kinetochore localization.
FT {ECO:0000269|PubMed:27341616}.
FT COMPBIAS 1110 1347 Glu-rich. {ECO:0000255|PROSITE-
FT ProRule:PRU00007}.
FT MUTAGEN 409 417 DSWYYKRVP->SSWSYKASG: Defects in
FT chromosome segregation in meiosis and
FT mitosis. {ECO:0000269|PubMed:27341616}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000255; PROSITE-ProRule:PRU00007; YVL; 17-NOV-2016.
**EV ECO:0000269; PubMed:16950114; YVL; 08-NOV-2016.
**EV ECO:0000269; PubMed:16950115; YVL; 08-NOV-2016.
**EV ECO:0000269; PubMed:26166571; YVL; 09-NOV-2016.
**EV ECO:0000269; PubMed:27341616; YVL; 17-NOV-2016.
**EV ECO:0000305; -; YVL; 15-DEC-2016.
**EV ECO:0000312; Proteomes:UP000001940; YVL; 10-NOV-2016.
**EV ECO:0000312; WormBase:C38D4.3; YVL; 14-OCT-2016.
**ZA YVL, 14-OCT-2016;
**ZZ Resubmission after restructuring the CC FUNCTION and CC SUBCELLULAR
**ZZ LOCATION comments.
**ZZ Related Swissprot entries have been updated.
**ZZ No addition of PubMed=22238360, PubMed=16094371 and PubMed=10085292 as
**ZZ no relevant data reported.
**ZZ The mel-28(t1684) mutant was not annotated in Disruption Phenotype, as
**ZZ it encodes a premature stop codon at aa. 766 and therefore might
**ZZ retain a large part of the N-terminal region and not be a true null
**ZZ allele.
**ZZ CURATED.
SQ SEQUENCE 1784 AA; 200846 MW; 891F17E3FB674B6B CRC64;
MDNENSSIFK SYQGYECWRG EKQIILKDSI GRQLPYIVNF KKNTCQIFDI EWERVTHSFV
FPEGCALIDA DYFPTEEGKL GILVGVEDPR QSCGAEHFVL ALAVDPDSPA MTITHSLEVP
SKITVVKTLF SSADMADETQ RTVLKLYHRL MTWQHIVAIG CKETQCYLAR LVAVETPSSP
VITVHSEKKY LINLMNAYVS GSVLQYTLDD GAYREYPTAA VYISALSLMP RSRTLLVGLS
MGGILAASLN PSNQMMLLEL RHERLVRKIA PLEPEDDPDK FEYFIATVDC SPRHPIMIQL
WRGSFKTLED VDGEEKYDRP SFSVCLEHKI LFGERWLAVN PIVTERDHMM LTRKRGTEDS
MHNVSQTFGS TSNRNSVLLA YERKKMVIGT EDPNAEPEYI VEAAIFDIDS WYYKRVPGRV
STDGTVLKQC AFLSTIKSNI RSEDVNDIGI LTNEATDVSS FSSMVSDADQ LFYPSALSFE
RVFVAKNTRI DWMKIQNIQD TILNKCAVKL PALIRNPEMI SSVVMAAGLV RKNILSGSPN
SSAAEINELQ LSSDQKVLLN VIVYYGKIEE FCQLASRPDI SDTLKRELAE WALHEAVDYK
RTISDKMVSL FQGRSLALSP LAEESIAQGI KLFRVVYEYL KACSKALKDD RLRNLAHSVI
CMRNHTKLTS QFINFAIIPV DPIRQQRMKD LHSKRKNMAR KNSSSLPVQS VVRKMNRQAP
NAQFWNDIPH DEWYPPTPLD LLECLLNVSI SESIKRELVV QYVIDWISTS PEDSEHSEKQ
LALETIKIMT NQMLNVNLEK IYYILDQGKK ALTSSKTSDD MRALGEKVFS MKDDEISYEK
LWGKDAPMTV TIGKHDLQRF EQRMKMQMEG GKVRLPVLDP ESEILYQMFL FENEKFEAMS
SEAISSNKLL SAFLPGMIKK DGRGRQKTAK EQEIEISVKK MFERKVQNDD EDMPEVFASV
NDKTERKRKS SQFGEDDESS VSSSQYVPPT AKRIQQWKSA VESVANNSSI NSITSPDSHQ
NAEINMMIAT PARYYKRHNE EENVQDGFLS PAGNRPPPVS AHNSILKTAK GGQSASRGRI
RFRADVPRGA DESIEDNGRK GLALNFAILE DEEEETMTIR KSRSMGKHDE EKDSEKNVVD
EMEEVKDQEQ ENDECIESEK TFENQDDFEV LEDTSAPEAA NTENGSETPP MEDTFEVRDD
DVMPPTDETY LSHLQTDKTG ILEEEGEDED IWDGVQRSFE VQMDEDCEAV PTIDVADDLE
SKSEEVNEEE VVESEEVQQD AKEPEKTEKR QEEPEPEVMQ PVIPEEPQNE SLESSIKLQE
ELQEEPDIVP TGDEDTADKV QEQAVEEDRP PSRNTRSSSV QKSTSQVEDR DPKELVEEER
PPSRNTRSAS VQKSSNQEKT SESGEVTEED RPPSRNTRSA SVQKSSSKVK DQKPEELIEE
DRPPSRNTRS ASAQKTVAAN KSVLESEIPS RSASRRTRST SLRNDTVAEP DETSVAMTTR
RRTRATSEVV SKQSSEDDGR STPKTGRTPT KKAAASTSSS RAGSVTRGKK SIIQKMPSPL
EVTMEVQEEE EEEAEEERPA SRSTRSASVK NTTVDPSSSA LASTKRTTSR KRGNSETIDF
NQDDKSAPTT PKRGRPAKKD AGSPKVGSKA RGTKPKSIFE NQEDEEDRSS SPDIEQPATP
TRSSKRTARS RANSESIDDD SKQKTPKKKN AAVNEAGTSK QSRSVTRSRA SSIDVQQEVE
EPTTPKRGRG RPPKTVLENI EEGEEERKET AATPLLRSAR RAKQ
//
ID CBP2_MOROL Unreviewed; 104 AA.
AC C0HKC5;
DT 16-NOV-2016, integrated into UniProtKB/TrEMBL.
DT 16-NOV-2016, sequence version 1.
DT 16-NOV-2016, entry version 1.
DE RecName: Full=Chitin-binding protein 2 {ECO:0000303|Ref.1};
DE Short=Mo-CBP2 {ECO:0000303|Ref.1};
DE Flags: Fragments;
OS Moringa oleifera (Horseradish tree) (Moringa pterygosperma).
OC Eukaryota; Viridiplantae; Streptophyta; Embryophyta; Tracheophyta;
OC Spermatophyta; Magnoliophyta; eudicotyledons; Gunneridae;
OC Pentapetalae; rosids; malvids; Brassicales; Moringaceae; Moringa.
OX NCBI_TaxID=3735 {ECO:0000303|Ref.1};
RN [1] {ECO:0000305}
RP PROTEIN SEQUENCE, FUNCTION, MASS SPECTROMETRY, AND IDENTIFICATION BY
RP MASS SPECTROMETRY.
RC TISSUE=Seed {ECO:0000303|Ref.1};
RA da Silva Neto J.X., Oliveira J.T.A., Vasconcelos I.M.;
RL Submitted (OCT-2016) to UniProtKB.
CC -!- FUNCTION: Chitin-binding protein. Has antifungal activity against
CC C.albicans by increasing cell membrane permeability and production
CC of reactive oxygen species. {ECO:0000269|Ref.1}.
CC -!- MASS SPECTROMETRY: Mass=13163; Method=Electrospray; Range=?-?;
CC Evidence={ECO:0000269|Ref.1};
CC -!- CAUTION: The order of the peptides shown is unknown.
CC {ECO:0000305}.
PE 4: Predicted;
KW Antimicrobial; Chitin-binding; Direct protein sequencing; Fungicide.
FT CHAIN 1 104 Chitin-binding protein 2.
FT {ECO:0000269|Ref.1}.
FT NON_CONS 6 7 {ECO:0000303|Ref.1}.
FT NON_CONS 11 12 {ECO:0000303|Ref.1}.
FT NON_CONS 17 18 {ECO:0000303|Ref.1}.
FT NON_CONS 36 37 {ECO:0000303|Ref.1}.
FT NON_CONS 44 45 {ECO:0000303|Ref.1}.
FT NON_CONS 55 56 {ECO:0000303|Ref.1}.
FT NON_CONS 75 76 {ECO:0000303|Ref.1}.
FT NON_CONS 81 82 {ECO:0000303|Ref.1}.
FT NON_TER 1 1 {ECO:0000303|Ref.1}.
FT NON_TER 104 104 {ECO:0000303|Ref.1}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000269; Ref.1; KLP; 16-NOV-2016.
**EV ECO:0000303; Ref.1; KLP; 09-JAN-2017.
**EV ECO:0000305; -; KLP; 16-NOV-2016.
**SO SUB; DS_NUMBER; DS90436.
**ZA KLP, 16-NOV-2016;
**ZZ Submitters manually checked MS/MS results. Individual peptides map to
**ZZ one or the other MOROL sequence but not all of them. Previous
**ZZ publications by the group mention the name Mo-CBP2 when describing the
**ZZ chromatography peaks but none of those papers characterizes Mo-CBP2.
**ZZ CURATED.
SQ SEQUENCE 104 AA; 11789 MW; DE168A771817742A CRC64;
QPDFQRCPSL RCCQQLRQAV QLTHQQQGQV GPQQVRQQFQ THQRIPAICN LQPMRQAVQL
AHQQQQGQVG PQQVRCCQQL RQAVQSQAAA AGQVGPQQVG HMYR
//
ID PA2B1_AGKPC Unreviewed; 123 AA.
AC C0HKC4;
DT 15-DEC-2016, integrated into UniProtKB/TrEMBL.
DT 15-DEC-2016, sequence version 1.
DT 15-DEC-2016, entry version 1.
DE RecName: Full=Basic phospholipase A2 APC-D49 {ECO:0000303|Ref.1};
DE Short=svPLA2 {ECO:0000250|UniProtKB:P51972};
DE EC=3.1.1.4 {ECO:0000255|PROSITE-ProRule:PRU10035};
DE AltName: Full=Phosphatidylcholine 2-acylhydrolase {ECO:0000250|UniProtKB:P51972};
OS Agkistrodon piscivorus conanti (Florida cottonmouth).
OC Eukaryota; Metazoa; Chordata; Craniata; Vertebrata; Euteleostomi;
OC Lepidosauria; Squamata; Bifurcata; Unidentata; Episquamata;
OC Toxicofera; Serpentes; Colubroidea; Viperidae; Crotalinae;
OC Agkistrodon.
OX NCBI_TaxID=1928342 {ECO:0000303|Ref.1};
RN [1] {ECO:0000305}
RP PROTEIN SEQUENCE, SUBCELLULAR LOCATION, MASS SPECTROMETRY, AND
RP IDENTIFICATION BY MASS SPECTROMETRY.
RC TISSUE=Venom {ECO:0000303|Ref.1};
RA Jia Y., Garza A., Balladares J., Ermolinsky B., Provenzano D.;
RL Submitted (DEC-2016) to UniProtKB.
CC -!- FUNCTION: PLA2 catalyzes the calcium-dependent hydrolysis of the
CC 2-acyl groups in 3-sn-phosphoglycerides.
CC {ECO:0000250|UniProtKB:P51972}.
CC -!- CATALYTIC ACTIVITY: Phosphatidylcholine + H(2)O = 1-
CC acylglycerophosphocholine + a carboxylate. {ECO:0000255|PROSITE-
CC ProRule:PRU10035}.
CC -!- COFACTOR:
CC Name=Ca(2+); Xref=ChEBI:CHEBI:29108;
CC Evidence={ECO:0000250|UniProtKB:P14418};
CC Note=Binds 1 Ca(2+) ion per subunit.
CC {ECO:0000250|UniProtKB:P14418};
CC -!- SUBUNIT: Monomer or homodimer. {ECO:0000250|UniProtKB:P51972}.
CC -!- SUBCELLULAR LOCATION: Secreted {ECO:0000269|Ref.1}.
CC -!- TISSUE SPECIFICITY: Expressed by the venom gland.
CC {ECO:0000305|Ref.1}.
CC -!- PTM: Acylation causes dimerization.
CC {ECO:0000250|UniProtKB:P51972}.
CC -!- MASS SPECTROMETRY: Mass=13967.25; Method=Electrospray; Range=1-
CC 123; Evidence={ECO:0000269|Ref.1};
CC -!- SIMILARITY: Belongs to the phospholipase A2 family. Group II
CC subfamily. D49 sub-subfamily. {ECO:0000305}.
DR PROSITE; PS00119; PA2_ASP; 1.
DR PROSITE; PS00118; PA2_HIS; 1.
PE 4: Predicted;
KW Calcium; Direct protein sequencing; Disulfide bond; Hydrolase;
KW Lipid degradation; Lipid metabolism; Lipoprotein; Metal-binding;
KW Palmitate; Secreted.
FT CHAIN 1 123 Basic phospholipase A2 APC-D49.
FT {ECO:0000269|Ref.1}.
FT ACT_SITE 47 47 {ECO:0000255|PROSITE-ProRule:PRU10035}.
FT ACT_SITE 89 89 {ECO:0000255|PROSITE-ProRule:PRU10036}.
FT METAL 27 27 Calcium; via carbonyl oxygen.
FT {ECO:0000250|UniProtKB:P14418}.
FT METAL 29 29 Calcium; via carbonyl oxygen.
FT {ECO:0000250|UniProtKB:P14418}.
FT METAL 31 31 Calcium; via carbonyl oxygen.
FT {ECO:0000250|UniProtKB:P14418}.
FT METAL 48 48 Calcium. {ECO:0000250|UniProtKB:P14418}.
FT LIPID 7 7 N6-palmitoyl lysine.
FT {ECO:0000250|UniProtKB:P51972}.
FT LIPID 10 10 N6-palmitoyl lysine.
FT {ECO:0000250|UniProtKB:P51972}.
FT DISULFID 26 116 {ECO:0000250|UniProtKB:P51972}.
FT DISULFID 28 44 {ECO:0000250|UniProtKB:P51972}.
FT DISULFID 43 95 {ECO:0000250|UniProtKB:P51972}.
FT DISULFID 49 123 {ECO:0000250|UniProtKB:P51972}.
FT DISULFID 50 88 {ECO:0000250|UniProtKB:P51972}.
FT DISULFID 57 81 {ECO:0000250|UniProtKB:P51972}.
FT DISULFID 75 86 {ECO:0000250|UniProtKB:P51972}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000250; UniProtKB:P14418; KLP; 15-DEC-2016.
**EV ECO:0000250; UniProtKB:P51972; KLP; 19-DEC-2016.
**EV ECO:0000255; PROSITE-ProRule:PRU10035; KLP; 15-DEC-2016.
**EV ECO:0000255; PROSITE-ProRule:PRU10036; KLP; 15-DEC-2016.
**EV ECO:0000269; Ref.1; KLP; 19-DEC-2016.
**EV ECO:0000303; Ref.1; KLP; 19-DEC-2016.
**EV ECO:0000305; -; KLP; 15-DEC-2016.
**EV ECO:0000305; Ref.1; KLP; 19-DEC-2016.
**SO SUB; DS_NUMBER; DS90457.
**ZA KLP, 19-DEC-2016;
**ZZ Related entries: C0HKC1 (PA2HB_AGKPC), C0HKC2 (PA2HB_AGKPL),
**ZZ C0HKC3 (PA2B1_AGKPL), C0HKC4 (PA2B1_AGKPC), kpDS90457.log
**ZZ CURATED.
SQ SEQUENCE 123 AA; 13989 MW; C39986552D990D72 CRC64;
NLFQFEKLIK KMTGKSGMLW YSAYGCYCGW GGQGRPKDAT DRCCFVHDCC YGKVTGCNPK
MDIYTYSVDN GNIVCGGTNP CKKQICECDR AAAICFRDNL KTYDSKTYWK YPKKNCKEES
EPC
//
ID PA2HB_AGKPC Unreviewed; 121 AA.
AC C0HKC1;
DT 15-DEC-2016, integrated into UniProtKB/TrEMBL.
DT 15-DEC-2016, sequence version 1.
DT 15-DEC-2016, entry version 1.
DE RecName: Full=Basic phospholipase A2 homolog {ECO:0000250|UniProtKB:P04361};
DE Short=svPLA2 homolog {ECO:0000250|UniProtKB:P04361};
DE AltName: Full=APC-K-49 {ECO:0000303|Ref.1};
OS Agkistrodon piscivorus conanti (Florida cottonmouth).
OC Eukaryota; Metazoa; Chordata; Craniata; Vertebrata; Euteleostomi;
OC Lepidosauria; Squamata; Bifurcata; Unidentata; Episquamata;
OC Toxicofera; Serpentes; Colubroidea; Viperidae; Crotalinae;
OC Agkistrodon.
OX NCBI_TaxID=1928342 {ECO:0000303|Ref.1};
RN [1] {ECO:0000305}
RP PROTEIN SEQUENCE, SUBUNIT, SUBCELLULAR LOCATION, MASS SPECTROMETRY,
RP AND IDENTIFICATION BY MASS SPECTROMETRY.
RC TISSUE=Venom {ECO:0000303|Ref.1};
RA Jia Y., Garza A., Balladares J., Ermolinsky B., Provenzano D.;
RL Submitted (DEC-2016) to UniProtKB.
CC -!- FUNCTION: Snake venom phospholipase A2 (PLA2) that lacks enzymatic
CC activity, but displays edema-inducing activities.
CC {ECO:0000250|UniProtKB:P04361}.
CC -!- SUBUNIT: Monomer. {ECO:0000269|Ref.1}.
CC -!- SUBCELLULAR LOCATION: Secreted {ECO:0000269|Ref.1}.
CC -!- TISSUE SPECIFICITY: Expressed by the venom gland.
CC {ECO:0000305|Ref.1}.
CC -!- MASS SPECTROMETRY: Mass=13949.23; Method=Electrospray; Range=1-
CC 121; Evidence={ECO:0000269|Ref.1};
CC -!- SIMILARITY: Belongs to the phospholipase A2 family. Group II
CC subfamily. K49 sub-subfamily. {ECO:0000305}.
CC -!- CAUTION: Does not bind calcium as one of the calcium-binding sites
CC is lost (Asp->Lys in position 48, which corresponds to 'Lys-49' in
CC the current nomenclature). {ECO:0000305}.
PE 4: Predicted;
KW Direct protein sequencing; Disulfide bond; Secreted.
FT CHAIN 1 121 Basic phospholipase A2 homolog.
FT {ECO:0000269|Ref.1}.
FT DISULFID 26 115 {ECO:0000250|UniProtKB:P04361}.
FT DISULFID 28 44 {ECO:0000250|UniProtKB:P04361}.
FT DISULFID 43 95 {ECO:0000250|UniProtKB:P04361}.
FT DISULFID 49 121 {ECO:0000250|UniProtKB:P04361}.
FT DISULFID 50 88 {ECO:0000250|UniProtKB:P04361}.
FT DISULFID 57 81 {ECO:0000250|UniProtKB:P04361}.
FT DISULFID 75 86 {ECO:0000250|UniProtKB:P04361}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000250; UniProtKB:P04361; KLP; 16-DEC-2016.
**EV ECO:0000269; Ref.1; KLP; 15-DEC-2016.
**EV ECO:0000303; Ref.1; KLP; 15-DEC-2016.
**EV ECO:0000305; -; KLP; 15-DEC-2016.
**EV ECO:0000305; Ref.1; KLP; 15-DEC-2016.
**SO SUB; DS_NUMBER; DS90457.
**ZA KLP, 15-DEC-2016;
**ZZ Related entries: C0HKC1 (PA2HB_AGKPC), C0HKC2 (PA2HB_AGKPL),
**ZZ C0HKC3 (PA2B1_AGKPL), C0HKC4 (PA2B1_AGKPC), kpDS90457.log
**ZZ CURATED.
SQ SEQUENCE 121 AA; 13961 MW; 497B08243A91CA63 CRC64;
SVLELGKMIL QETGKNAITS YGSYGCNCGW GHRGQPKDAT DRCCFVHKCC YKKLTDCNHK
TDRYSYSWKN KAIICEEKNP CLKEMCECDK AVAICLRENL DTYNKKYKAY FKLKCKKPDT
C
//
ID PA2B1_AGKPL Unreviewed; 151 AA.
AC C0HKC3;
DT 15-DEC-2016, integrated into UniProtKB/TrEMBL.
DT 15-DEC-2016, sequence version 1.
DT 15-DEC-2016, entry version 1.
DE RecName: Full=Basic phospholipase A2 APL-D49 {ECO:0000303|Ref.2};
DE Short=svPLA2 {ECO:0000250|UniProtKB:P51972};
DE EC=3.1.1.4 {ECO:0000255|PROSITE-ProRule:PRU10035};
DE AltName: Full=Phosphatidylcholine 2-acylhydrolase {ECO:0000250|UniProtKB:P51972};
DE Flags: Precursor; Fragment;
OS Agkistrodon piscivorus leucostoma (Western cottonmouth) (Acontias
OS leucostoma).
OC Eukaryota; Metazoa; Chordata; Craniata; Vertebrata; Euteleostomi;
OC Lepidosauria; Squamata; Bifurcata; Unidentata; Episquamata;
OC Toxicofera; Serpentes; Colubroidea; Viperidae; Crotalinae;
OC Agkistrodon.
OX NCBI_TaxID=459671 {ECO:0000303|Ref.2};
RN [1] {ECO:0000305}
RP NUCLEOTIDE SEQUENCE [MRNA].
RC TISSUE=Venom gland {ECO:0000303|PubMed:18502463};
RX PubMed=18502463; DOI=10.1016/j.toxicon.2008.03.028;
RA Jia Y., Cantu B.A., Sanchez E.E., Perez J.C.;
RT "Complementary DNA sequencing and identification of mRNAs from the
RT venomous gland of Agkistrodon piscivorus leucostoma.";
RL Toxicon 51:1457-1466(2008).
RN [2] {ECO:0000305}
RP PROTEIN SEQUENCE OF 29-40, AND SUBCELLULAR LOCATION.
RC TISSUE=Venom {ECO:0000303|Ref.2};
RA Jia Y., Garza A., Balladares J., Ermolinsky B., Provenzano D.;
RL Submitted (DEC-2016) to UniProtKB.
CC -!- FUNCTION: PLA2 catalyzes the calcium-dependent hydrolysis of the
CC 2-acyl groups in 3-sn-phosphoglycerides.
CC {ECO:0000250|UniProtKB:P51972}.
CC -!- CATALYTIC ACTIVITY: Phosphatidylcholine + H(2)O = 1-
CC acylglycerophosphocholine + a carboxylate. {ECO:0000255|PROSITE-
CC ProRule:PRU10035}.
CC -!- COFACTOR:
CC Name=Ca(2+); Xref=ChEBI:CHEBI:29108;
CC Evidence={ECO:0000250|UniProtKB:P14418};
CC Note=Binds 1 Ca(2+) ion per subunit.
CC {ECO:0000250|UniProtKB:P14418};
CC -!- SUBUNIT: Monomer or homodimer. {ECO:0000250|UniProtKB:P51972}.
CC -!- SUBCELLULAR LOCATION: Secreted {ECO:0000269|Ref.2}.
CC -!- TISSUE SPECIFICITY: Expressed by the venom gland.
CC {ECO:0000305|PubMed:18502463}.
CC -!- PTM: Acylation causes dimerization.
CC {ECO:0000250|UniProtKB:P51972}.
CC -!- SIMILARITY: Belongs to the phospholipase A2 family. Group II
CC subfamily. D49 sub-subfamily. {ECO:0000305}.
DR EMBL; EV854875; -; NOT_ANNOTATED_CDS; mRNA.
DR PROSITE; PS00119; PA2_ASP; 1.
DR PROSITE; PS00118; PA2_HIS; 1.
PE 4: Predicted;
KW Calcium; Direct protein sequencing; Disulfide bond; Hydrolase;
KW Lipid degradation; Lipid metabolism; Lipoprotein; Metal-binding;
KW Palmitate; Secreted; Signal.
FT SIGNAL <1 28 {ECO:0000255}.
FT CHAIN 29 151 Basic phospholipase A2 APL-D49.
FT {ECO:0000305|Ref.2}.
FT ACT_SITE 75 75 {ECO:0000255|PROSITE-ProRule:PRU10035}.
FT ACT_SITE 117 117 {ECO:0000255|PROSITE-ProRule:PRU10036}.
FT METAL 55 55 Calcium; via carbonyl oxygen.
FT {ECO:0000250|UniProtKB:P14418}.
FT METAL 57 57 Calcium; via carbonyl oxygen.
FT {ECO:0000250|UniProtKB:P14418}.
FT METAL 59 59 Calcium; via carbonyl oxygen.
FT {ECO:0000250|UniProtKB:P14418}.
FT METAL 76 76 Calcium. {ECO:0000250|UniProtKB:P14418}.
FT LIPID 35 35 N6-palmitoyl lysine.
FT {ECO:0000250|UniProtKB:P51972}.
FT LIPID 38 38 N6-palmitoyl lysine.
FT {ECO:0000250|UniProtKB:P51972}.
FT DISULFID 54 144 {ECO:0000250|UniProtKB:P51972}.
FT DISULFID 56 72 {ECO:0000250|UniProtKB:P51972}.
FT DISULFID 71 123 {ECO:0000250|UniProtKB:P51972}.
FT DISULFID 77 151 {ECO:0000250|UniProtKB:P51972}.
FT DISULFID 78 116 {ECO:0000250|UniProtKB:P51972}.
FT DISULFID 85 109 {ECO:0000250|UniProtKB:P51972}.
FT DISULFID 103 114 {ECO:0000250|UniProtKB:P51972}.
FT NON_TER 1 1 {ECO:0000305}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000250; UniProtKB:P14418; KLP; 15-DEC-2016.
**EV ECO:0000250; UniProtKB:P51972; KLP; 19-DEC-2016.
**EV ECO:0000255; -; KLP; 05-JAN-2017.
**EV ECO:0000255; PROSITE-ProRule:PRU10035; KLP; 15-DEC-2016.
**EV ECO:0000255; PROSITE-ProRule:PRU10036; KLP; 15-DEC-2016.
**EV ECO:0000269; Ref.2; KLP; 19-DEC-2016.
**EV ECO:0000303; PubMed:18502463; KLP; 15-DEC-2016.
**EV ECO:0000303; Ref.2; KLP; 19-DEC-2016.
**EV ECO:0000305; -; KLP; 05-JAN-2017.
**EV ECO:0000305; PubMed:18502463; KLP; 19-DEC-2016.
**EV ECO:0000305; Ref.2; KLP; 05-JAN-2017.
**SO SUB; DS_NUMBER; DS90457.
**ZA KLP, 15-DEC-2016;
**ZZ Proposed signal peptide contains a Met which I initially annotated as
**ZZ the start but this produces a 10aa N-terminus without any signal
**ZZ predictions whereas extending the ORF N-terminally gives an N-terminus
**ZZ with the expected signal prediction.
**ZZ Related entries: C0HKC1 (PA2HB_AGKPC), C0HKC2 (PA2HB_AGKPL),
**ZZ C0HKC3 (PA2B1_AGKPL), C0HKC4 (PA2B1_AGKPC), kpDS90457.log
**ZZ CURATED.
SQ SEQUENCE 151 AA; 17098 MW; 5DC3586754DDB4AA CRC64;
RGLLIPRSGF GRMRTLWIMA VLLLGVEGNL FQFEKLIKKM TGKSGMLWYS AYGCYCGWGG
QGRPKDATDR CCFVHDCCYG KVTGCNPKMD IYTYSVENGN IVCGGTNPCK KQICECDRAA
AICFRDNLKT YDSKTYWKYP KKNCKEESEP C
//
ID PA2HB_AGKPL Unreviewed; 121 AA.
AC C0HKC2;
DT 15-DEC-2016, integrated into UniProtKB/TrEMBL.
DT 15-DEC-2016, sequence version 1.
DT 15-DEC-2016, entry version 1.
DE RecName: Full=Basic phospholipase A2 homolog {ECO:0000250|UniProtKB:P04361};
DE Short=svPLA2 homolog {ECO:0000250|UniProtKB:P04361};
DE AltName: Full=APL-K-49 {ECO:0000303|Ref.2};
OS Agkistrodon piscivorus leucostoma (Western cottonmouth) (Acontias
OS leucostoma).
OC Eukaryota; Metazoa; Chordata; Craniata; Vertebrata; Euteleostomi;
OC Lepidosauria; Squamata; Bifurcata; Unidentata; Episquamata;
OC Toxicofera; Serpentes; Colubroidea; Viperidae; Crotalinae;
OC Agkistrodon.
OX NCBI_TaxID=459671 {ECO:0000303|Ref.2};
RN [1] {ECO:0000305}
RP NUCLEOTIDE SEQUENCE [MRNA].
RC TISSUE=Venom gland {ECO:0000303|PubMed:18502463};
RX PubMed=18502463; DOI=10.1016/j.toxicon.2008.03.028;
RA Jia Y., Cantu B.A., Sanchez E.E., Perez J.C.;
RT "Complementary DNA sequencing and identification of mRNAs from the
RT venomous gland of Agkistrodon piscivorus leucostoma.";
RL Toxicon 51:1457-1466(2008).
RN [2] {ECO:0000305}
RP PROTEIN SEQUENCE OF 1-16, SUBUNIT, AND SUBCELLULAR LOCATION.
RC TISSUE=Venom {ECO:0000303|Ref.2};
RA Jia Y., Garza A., Balladares J., Ermolinsky B., Provenzano D.;
RL Submitted (DEC-2016) to UniProtKB.
CC -!- FUNCTION: Snake venom phospholipase A2 (PLA2) that lacks enzymatic
CC activity, but displays edema-inducing activities.
CC {ECO:0000250|UniProtKB:P04361}.
CC -!- SUBUNIT: Monomer. {ECO:0000269|Ref.2}.
CC -!- SUBCELLULAR LOCATION: Secreted {ECO:0000269|Ref.2}.
CC -!- TISSUE SPECIFICITY: Expressed by the venom gland.
CC {ECO:0000305|PubMed:18502463}.
CC -!- SIMILARITY: Belongs to the phospholipase A2 family. Group II
CC subfamily. K49 sub-subfamily. {ECO:0000305}.
CC -!- CAUTION: Does not bind calcium as one of the calcium-binding sites
CC is lost (Asp->Lys in position 48, which corresponds to 'Lys-49' in
CC the current nomenclature). {ECO:0000305}.
DR EMBL; EV854871; -; NOT_ANNOTATED_CDS; mRNA.
PE 4: Predicted;
KW Direct protein sequencing; Disulfide bond; Secreted.
FT CHAIN 1 121 Basic phospholipase A2 homolog.
FT {ECO:0000305}.
FT DISULFID 26 115 {ECO:0000250|UniProtKB:P04361}.
FT DISULFID 28 44 {ECO:0000250|UniProtKB:P04361}.
FT DISULFID 43 95 {ECO:0000250|UniProtKB:P04361}.
FT DISULFID 49 121 {ECO:0000250|UniProtKB:P04361}.
FT DISULFID 50 88 {ECO:0000250|UniProtKB:P04361}.
FT DISULFID 57 81 {ECO:0000250|UniProtKB:P04361}.
FT DISULFID 75 86 {ECO:0000250|UniProtKB:P04361}.
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000250; UniProtKB:P04361; KLP; 15-DEC-2016.
**EV ECO:0000269; Ref.2; KLP; 15-DEC-2016.
**EV ECO:0000303; PubMed:18502463; KLP; 15-DEC-2016.
**EV ECO:0000303; Ref.2; KLP; 15-DEC-2016.
**EV ECO:0000305; -; KLP; 15-DEC-2016.
**EV ECO:0000305; PubMed:18502463; KLP; 05-JAN-2017.
**SO SUB; DS_NUMBER; DS90457.
**ZA KLP, 15-DEC-2016;
**ZZ Related entries: C0HKC1 (PA2HB_AGKPC), C0HKC2 (PA2HB_AGKPL),
**ZZ C0HKC3 (PA2B1_AGKPL), C0HKC4 (PA2B1_AGKPC), kpDS90457.log
**ZZ CURATED.
SQ SEQUENCE 121 AA; 13961 MW; 497B08243A91CA63 CRC64;
SVLELGKMIL QETGKNAITS YGSYGCNCGW GHRGQPKDAT DRCCFVHKCC YKKLTDCNHK
TDRYSYSWKN KAIICEEKNP CLKEMCECDK AVAICLRENL DTYNKKYKAY FKLKCKKPDT
C
//
ID PUN_PUNGR Unreviewed; 20 AA.
AC C0HKC6;
DT 12-JAN-2017, integrated into UniProtKB/TrEMBL.
DT 12-JAN-2017, sequence version 1.
DT 12-JAN-2017, entry version 1.
DE RecName: Full=Punein {ECO:0000305};
DE Flags: Fragments;
OS Punica granatum (Pomegranate).
OC Eukaryota; Viridiplantae; Streptophyta; Embryophyta; Tracheophyta;
OC Spermatophyta; Magnoliophyta; eudicotyledons; Gunneridae;
OC Pentapetalae; rosids; malvids; Myrtales; Lythraceae; Punica.
OX NCBI_TaxID=22663 {ECO:0000303|Ref.1};
RN [1] {ECO:0000305}
RP PROTEIN SEQUENCE.
RA Tuppo L., Tamburrini M., Ciardiello M.A.;
RT "Identification of a new protein in pomegranate juice.";
RL Submitted (JAN-2017) to UniProtKB.
CC -!- PTM: The N-terminus is blocked. {ECO:0000269|Ref.1}.
DR PROSITE; PS51174; BARWIN_3; 1.
PE 4: Predicted;
KW Direct protein sequencing.
FT CHAIN <1 >20 Punein. {ECO:0000269|Ref.1}.
FT DOMAIN <1 >20 Barwin. {ECO:0000255|PROSITE-
FT ProRule:PRU00527}.
FT NON_CONS 10 11 {ECO:0000303|Ref.1}.
FT NON_TER 1 1 {ECO:0000303|Ref.1}.
FT NON_TER 20 20 {ECO:0000303|Ref.1}.
**
** ################# INTERNAL SECTION ##################
**DR PROSITE; PS00771; BARWIN_1; PARTIAL.
**DR PROSITE; PS00772; BARWIN_2; PARTIAL.
**EV ECO:0000255; PROSITE-ProRule:PRU00527; KLP; 12-JAN-2017.
**EV ECO:0000269; Ref.1; KLP; 12-JAN-2017.
**EV ECO:0000303; Ref.1; KLP; 12-JAN-2017.
**EV ECO:0000305; -; KLP; 12-JAN-2017.
**SO SUB; DS_NUMBER; DS90471.
**ZA KLP, 12-JAN-2017;
**ZZ With the little (sequence) data we have here I did not feel confident
**ZZ enough to either add a FUNCTION comment or annotate Cys-12 as
**ZZ potentially participating in a disulfide bond by similarity to
**ZZ BARW_HORVU.
**ZZ CURATED.
SQ SEQUENCE 20 AA; 2473 MW; 2815431A920735E1 CRC64;
YHYYNPEENH FCATWDASKP
//
ID PMLN_PUNGR Unreviewed; 20 AA.
AC C0HKC0;
DT 16-DEC-2016, integrated into UniProtKB/TrEMBL.
DT 16-DEC-2016, sequence version 1.
DT 16-DEC-2016, entry version 1.
DE RecName: Full=Pommaclein {ECO:0000303|Ref.1};
DE Flags: Fragment;
OS Punica granatum (Pomegranate).
OC Eukaryota; Viridiplantae; Streptophyta; Embryophyta; Tracheophyta;
OC Spermatophyta; Magnoliophyta; eudicotyledons; Gunneridae;
OC Pentapetalae; rosids; malvids; Myrtales; Lythraceae; Punica.
OX NCBI_TaxID=22663 {ECO:0000303|Ref.1};
RN [1] {ECO:0000305}
RP PROTEIN SEQUENCE, TISSUE SPECIFICITY, AND ALLERGEN.
RA Ciardiello M.A., Tuppo L., Tamburrini M.;
RT "Identification of pommaclein in pomegranate arils.";
RL Unpublished observations (DEC-2016).
CC -!- TISSUE SPECIFICITY: Expressed in the arils (at protein level).
CC {ECO:0000269|Ref.1}.
CC -!- ALLERGEN: Possibly causes an allergic reaction in human.
CC {ECO:0000250|UniProtKB:P86888}.
PE 4: Predicted;
KW Allergen; Direct protein sequencing.
FT CHAIN 1 20 Pommaclein. {ECO:0000303|Ref.1}.
FT NON_TER 20 20
**
** ################# INTERNAL SECTION ##################
**EV ECO:0000250; UniProtKB:P86888; KAW; 12-JAN-2017.
**EV ECO:0000269; Ref.1; KAW; 16-DEC-2016.
**EV ECO:0000303; Ref.1; KAW; 16-DEC-2016.
**EV ECO:0000305; -; KAW; 16-DEC-2016.
**SO SUB; DS_NUMBER; DS90451.
**ZA KAW, 16-DEC-2016;
**ZZ Non-confidential submission. According to the authors the fragment
**ZZ sequence is homologous to peamaclein (P86888) from peach and therefore
**ZZ a potential allergen (they are currently investigating this).
**ZZ CURATED.
SQ SEQUENCE 20 AA; 2048 MW; 2190537AE662AEB8 CRC64;
GSSFCDSKCA VRCSKAGVQD
//
| TXL | 4 | kp14/biocuration | tests/SwissProt/contains_lowercase.txl | [
"Unlicense"
]
|
such iota much n
very series is Array dose apply with null {length:n}&
dose map with Number.call Number
wow series
| Dogescript | 0 | erinkeith/dogescript | test/transpile/iota/source.djs | [
"MIT"
]
|
<mat-accordion class="example-headers-align">
<mat-expansion-panel [expanded]="step === 0" (opened)="setStep(0)" hideToggle>
<mat-expansion-panel-header>
<mat-panel-title>
Personal data
</mat-panel-title>
<mat-panel-description>
Type your name and age
<mat-icon>account_circle</mat-icon>
</mat-panel-description>
</mat-expansion-panel-header>
<mat-form-field appearance="fill">
<mat-label>First name</mat-label>
<input matInput>
</mat-form-field>
<mat-form-field appearance="fill">
<mat-label>Age</mat-label>
<input matInput type="number" min="1">
</mat-form-field>
<!-- #docregion action-bar -->
<mat-action-row>
<button mat-button color="primary" (click)="nextStep()">Next</button>
</mat-action-row>
<!-- #enddocregion action-bar -->
</mat-expansion-panel>
<mat-expansion-panel [expanded]="step === 1" (opened)="setStep(1)" hideToggle>
<mat-expansion-panel-header>
<mat-panel-title>
Destination
</mat-panel-title>
<mat-panel-description>
Type the country name
<mat-icon>map</mat-icon>
</mat-panel-description>
</mat-expansion-panel-header>
<mat-form-field appearance="fill">
<mat-label>Country</mat-label>
<input matInput>
</mat-form-field>
<mat-action-row>
<button mat-button color="warn" (click)="prevStep()">Previous</button>
<button mat-button color="primary" (click)="nextStep()">Next</button>
</mat-action-row>
</mat-expansion-panel>
<mat-expansion-panel [expanded]="step === 2" (opened)="setStep(2)" hideToggle>
<mat-expansion-panel-header>
<mat-panel-title>
Day of the trip
</mat-panel-title>
<mat-panel-description>
Inform the date you wish to travel
<mat-icon>date_range</mat-icon>
</mat-panel-description>
</mat-expansion-panel-header>
<mat-form-field appearance="fill">
<mat-label>Date</mat-label>
<input matInput [matDatepicker]="picker" (focus)="picker.open()" readonly>
</mat-form-field>
<mat-datepicker #picker></mat-datepicker>
<mat-action-row>
<button mat-button color="warn" (click)="prevStep()">Previous</button>
<button mat-button color="primary" (click)="nextStep()">End</button>
</mat-action-row>
</mat-expansion-panel>
</mat-accordion>
| HTML | 3 | tungyingwaltz/components | src/components-examples/material/expansion/expansion-steps/expansion-steps-example.html | [
"MIT"
]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.