xszheng2020/the_stack_dedup_python_hits_5 · Datasets at Hugging Face

5d372ec4fe639e2ba424e3b573080c21af24fea5

104

py

Python

modulo-08-django-no-python-basico/aula-03/blog/views.py

leandropinheiroalves/python-bas-to-adv

c1ad02f4f53e12cc1a1d2805fa0b1a3aa13c609f

[ "MIT" ]

null

modulo-08-django-no-python-basico/aula-03/blog/views.py

leandropinheiroalves/python-bas-to-adv

c1ad02f4f53e12cc1a1d2805fa0b1a3aa13c609f

[ "MIT" ]

null

modulo-08-django-no-python-basico/aula-03/blog/views.py

leandropinheiroalves/python-bas-to-adv

c1ad02f4f53e12cc1a1d2805fa0b1a3aa13c609f

[ "MIT" ]

null

from django.shortcuts import render def index(request): return render(request, 'blog/index.html')

17.333333

45

0.75

14

104

5.571429

0.785714

0

0.144231

104

5

46

20.8

0.876404

0

0.144231

0

1

0.333333

false

0

0.333333

1

0

1

0

null

0

1

0

null

0

1

0

1

0

5

5d3c577211b5557a301b8c78825bf971329caa4d

50

py

Python

src/podspy/graph/drawing/__init__.py

jwllee/podspy

a3ab176a83004069a27405acfc42838c135c555d

[ "MIT" ]

1

2019-02-06T09:26:17.000Z

src/podspy/graph/drawing/__init__.py

wailamjonathanlee/podspy

a3ab176a83004069a27405acfc42838c135c555d

[ "MIT" ]

12

2019-01-02T14:31:17.000Z

2019-01-22T18:24:03.000Z

src/podspy/graph/drawing/__init__.py

wailamjonathanlee/podspy

a3ab176a83004069a27405acfc42838c135c555d

[ "MIT" ]

null

#!/usr/bin/env python3 from . import ps_agraph

8.333333

23

0.7

8

50

4.25

1

0

0.02439

0.18

50

5

24

10

0.804878

0.42

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

5d4b8d3a88de0fb0534ef8cd30ba22041fb1abe8

29

py

Python

login.py

Jamielee0602/test_github

35c2f2e9a2b3f4354c3d8ddadec4a4dd4dfdd318

[ "MIT" ]

null

login.py

Jamielee0602/test_github

35c2f2e9a2b3f4354c3d8ddadec4a4dd4dfdd318

[ "MIT" ]

null

login.py

Jamielee0602/test_github

35c2f2e9a2b3f4354c3d8ddadec4a4dd4dfdd318

[ "MIT" ]

null

num1 = 1 num2 = 22 num3 = 333

9.666667

10

0.62069

6

29

3

1

0

0.428571

0.275862

29

3

10

9.666667

0.428571

0

1

0

false

0

1

0

null

0

1

0

1

0

1

0

null

0

5

5d546f83819bf55f498b137a3e529c09ec9392df

56

py

Python

mantisshrimp/parsers/mixins/__init__.py

ramaneswaran/mantisshrimp

d30c056f1f9f26a2ce42da73cfb32d591321f426

[ "Apache-2.0" ]

null

mantisshrimp/parsers/mixins/__init__.py

ramaneswaran/mantisshrimp

d30c056f1f9f26a2ce42da73cfb32d591321f426

[ "Apache-2.0" ]

8

2020-06-16T18:06:42.000Z

2020-09-15T22:35:56.000Z

mantisshrimp/parsers/mixins/__init__.py

ramaneswaran/mantisshrimp

d30c056f1f9f26a2ce42da73cfb32d591321f426

[ "Apache-2.0" ]

null

from mantisshrimp.parsers.mixins.parser_mixins import *

28

55

0.857143

7

56

6.714286

0.857143

0

0.071429

56

1

56

0.903846

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

5372bf29a55c72ec308a23fa0967202295835e9e

94

py

Python

openchat/openchat/__init__.py

inspur-hsslab/iMIX

99898de97ef8b45462ca1d6bf2542e423a73d769

[ "Apache-2.0" ]

23

2021-06-26T08:45:19.000Z

2022-03-02T02:13:33.000Z

openchat/openchat/__init__.py

XChuanLee/iMIX

99898de97ef8b45462ca1d6bf2542e423a73d769

[ "Apache-2.0" ]

null

openchat/openchat/__init__.py

XChuanLee/iMIX

99898de97ef8b45462ca1d6bf2542e423a73d769

[ "Apache-2.0" ]

9

2021-06-10T02:36:20.000Z

2021-11-09T02:18:16.000Z

# from openchat.openchat import OpenChat from .openchat import OpenChat __all__ = [OpenChat]

18.8

40

0.797872

11

94

6.454545

0.363636

0.338028

0.619718

0

0.138298

94

4

41

23.5

0.876543

0.404255

0

1

0

false

0

0.5

0

0.5

0

1

0

null

1

0

1

0

null

0

1

0

5

539b8f93c3fe7952a1a20333ff63bdd00ca6506f

188

py

Python

config.py

Don-1/info3180-project1

8ac5871a3b9ff1682232d15ba5ea125fce5519da

[ "MIT" ]

null

config.py

Don-1/info3180-project1

8ac5871a3b9ff1682232d15ba5ea125fce5519da

[ "MIT" ]

null

config.py

Don-1/info3180-project1

8ac5871a3b9ff1682232d15ba5ea125fce5519da

[ "MIT" ]

null

WTF_CSRF_ENABLED = True SECRET_KEY = 'tyke' SQLALCHEMY_DATABASE_URI = "postgresql://uwpsqxbjlaxvpc:z-lFkC_0QaPfx_12efrqa9ahiQ@ec2-23-21-231-14.compute-1.amazonaws.com:5432/d3h24ba0ni3gjs"

47

143

0.829787

27

188

5.518519

1

0

0.134078

0.047872

188

3

144

62.666667

0.698324

0

0.333333

0.632979

0.611702

0

1

0

false

0

1

0

null

0

1

0

1

null

0

5

53b4f63b7481538a55580d553151525b25c3854f

76

py

Python

uts/uts_17_aut_py/1/E.py

viad00/code_olymp

90f20f9fd075e8967d02baf7554fcf24f4ae089c

[ "MIT" ]

null

uts/uts_17_aut_py/1/E.py

viad00/code_olymp

90f20f9fd075e8967d02baf7554fcf24f4ae089c

[ "MIT" ]

null

uts/uts_17_aut_py/1/E.py

viad00/code_olymp

90f20f9fd075e8967d02baf7554fcf24f4ae089c

[ "MIT" ]

null

from collections import Counter print(Counter(input()).most_common()[0][0])

25.333333

43

0.763158

11

76

5.181818

0.818182

0

0.028169

0.065789

76

2

44

38

0.774648

0

1

0

true

0

0.5

0

0.5

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

53c626d2fb0a8a02b3d765489181284f116e7f9b

99

py

Python

core/manifolds/__init__.py

GuodongQi/FSL-OM

926d486325f8d59dc98dcf829c28dc77e6be6d7e

[ "MIT" ]

1

2021-11-24T02:20:01.000Z

core/manifolds/__init__.py

GuodongQi/FSL-OM

926d486325f8d59dc98dcf829c28dc77e6be6d7e

[ "MIT" ]

1

2021-11-24T02:22:31.000Z

2021-11-27T03:07:35.000Z

core/manifolds/__init__.py

GuodongQi/FSL-OM

926d486325f8d59dc98dcf829c28dc77e6be6d7e

[ "MIT" ]

1

2022-01-15T03:35:09.000Z

from .base import ManifoldParameter from .euclidean import Euclidean from .oblique import Oblique

33

36

0.838384

12

99

6.916667

0.5

0

0.131313

99

3

37

33

0.965116

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

53d5ccf59945139e1cbe99e0c63d48b031e6f1db

224

py

Python

users/models.py

gptakhil/Django-Custom-User-Authentication

a549e52deae759e99bb431da44880a23cb8e6dab

[ "MIT" ]

null

users/models.py

gptakhil/Django-Custom-User-Authentication

a549e52deae759e99bb431da44880a23cb8e6dab

[ "MIT" ]

null

users/models.py

gptakhil/Django-Custom-User-Authentication

a549e52deae759e99bb431da44880a23cb8e6dab

[ "MIT" ]

null

from django.contrib.auth.models import AbstractUser from django.db import models class CustomUser(AbstractUser): name = models.CharField(blank=True, max_length=255) def __str__(self): return self.email

24.888889

55

0.741071

29

224

5.551724

0.758621

0.124224

0

0.016304

0.178571

224

8

56

28

0.858696

0

1

0.166667

false

0

0.333333

0.166667

1

0

1

0

null

0

1

0

null

0

1

0

5

53f7f279a35855f2be7fbe74de1a492f5b03abaa

63

py

Python

src/rxn_network/fireworks/__init__.py

GENESIS-EFRC/reaction-network

1482ac1b6b550a5bc9961e9210e33c86c07f64cf

[ "BSD-3-Clause-LBNL" ]

29

2020-08-04T07:07:04.000Z

2022-02-22T22:09:20.000Z

src/rxn_network/fireworks/__init__.py

GENESIS-EFRC/reaction-network

1482ac1b6b550a5bc9961e9210e33c86c07f64cf

[ "BSD-3-Clause-LBNL" ]

70

2021-02-22T07:01:40.000Z

2022-03-31T20:11:56.000Z

src/rxn_network/fireworks/__init__.py

GENESIS-EFRC/reaction-network

1482ac1b6b550a5bc9961e9210e33c86c07f64cf

[ "BSD-3-Clause-LBNL" ]

3

2021-04-20T09:29:39.000Z

2022-02-02T17:43:52.000Z

from rxn_network.fireworks.core import EnumeratorFW, NetworkFW

31.5

62

0.873016

8

63

6.75

1

0

0.079365

63

1

63

0.931034

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

54d219e80dd4bf9c60e5886e01a1a048177d04dd

49

py

Python

tutorial/feature_detection_description/ORB.py

scotthuang1989/opencv_study

9b6354907609c9841915f6300ee5915a9d80906f

[ "MIT" ]

null

tutorial/feature_detection_description/ORB.py

scotthuang1989/opencv_study

9b6354907609c9841915f6300ee5915a9d80906f

[ "MIT" ]

null

tutorial/feature_detection_description/ORB.py

scotthuang1989/opencv_study

9b6354907609c9841915f6300ee5915a9d80906f

[ "MIT" ]

1

2018-04-16T13:57:14.000Z

""" An efficient alternative to SIFT or SURF """

12.25

40

0.693878

7

49

4.857143

1

0

0.183673

49

3

41

16.333333

0.85

0.816327

0

null

0

null

0

null

0

null

1

null

true

0

null

1

0

null

0

1

0

1

0

null

0

1

0

5

54d663725f1fe5a7e33b6e35738d768cd0b21945

55

py

Python

award/__init__.py

kgullikson88/AWARD_algorithm

ab2849dcd9cee0d0009d88c844919de955a42ce2

[ "MIT" ]

1

2022-03-27T06:09:16.000Z

award/__init__.py

kgullikson88/AWARD_algorithm

ab2849dcd9cee0d0009d88c844919de955a42ce2

[ "MIT" ]

2

2017-07-12T08:03:04.000Z

2020-08-24T09:37:24.000Z

award/__init__.py

kgullikson88/AWARD_algorithm

ab2849dcd9cee0d0009d88c844919de955a42ce2

[ "MIT" ]

null

from .algorithms import DTW_Metric, NaiveRankReduction

27.5

54

0.872727

6

55

7.833333

1

0

0.090909

55

1

55

0.94

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

54effb215f8caba59665c6a70742112aef9514d2

92

py

Python

test_app.py

dev-11/aws-sandbox

bd7ae76d67e912380537e5c290edad777f6e847d

[ "MIT" ]

null

test_app.py

dev-11/aws-sandbox

bd7ae76d67e912380537e5c290edad777f6e847d

[ "MIT" ]

null

test_app.py

dev-11/aws-sandbox

bd7ae76d67e912380537e5c290edad777f6e847d

[ "MIT" ]

1

2020-04-09T13:55:20.000Z

import unittest class ClassTests(unittest.TestCase): def test_01(self): pass

11.5

36

0.684783

11

92

5.636364

0.909091

0

0.028571

0.23913

92

7

37

13.142857

0.857143

0

1

0.25

false

0.25

0

0.75

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

54f037ed062fa99c2da108b9b29a5d4dc07ea0c1

88

py

Python

ontology/logistic_regression/sherlock/listify_circuits_k33_reverse.py

ehbeam/neuro-knowledge-engine

9dc56ade0bbbd8d14f0660774f787c3f46d7e632

[ "MIT" ]

15

2020-07-17T07:10:26.000Z

2022-02-18T05:51:45.000Z

ontology/neural_network/sherlock/listify_circuits_k33_reverse.py

YifeiCAO/neuro-knowledge-engine

9dc56ade0bbbd8d14f0660774f787c3f46d7e632

[ "MIT" ]

2

2022-01-14T09:10:12.000Z

2022-01-28T17:32:42.000Z

ontology/neural_network/sherlock/listify_circuits_k33_reverse.py

YifeiCAO/neuro-knowledge-engine

9dc56ade0bbbd8d14f0660774f787c3f46d7e632

[ "MIT" ]

4

2021-12-22T13:27:32.000Z

2022-02-18T05:51:47.000Z

#!/bin/python import listify_circuits listify_circuits.optimize_circuits(33, 'reverse')

22

49

0.829545

11

88

6.363636

0.727273

0.428571

0

0.024096

0.056818

88

4

49

22

0.819277

0.136364

0

0.092105

0

1

0

true

0

0.5

0

0.5

0

1

0

null

1

0

1

0

null

0

1

0

1

0

5

0733c06001709fb05457e06e5e2a8f62a039f120

80

py

Python

library/downloader/metadata/models/__init__.py

averagecryptopunk/averagecryptopunk

1934387675965c5a9061af91e7bea42d2f98306f

[ "MIT" ]

1

2021-12-06T10:49:03.000Z

library/downloader/metadata/models/__init__.py

averagecryptopunk/averagecryptopunk

1934387675965c5a9061af91e7bea42d2f98306f

[ "MIT" ]

null

library/downloader/metadata/models/__init__.py

averagecryptopunk/averagecryptopunk

1934387675965c5a9061af91e7bea42d2f98306f

[ "MIT" ]

null

from .enums import PunkType, Acccessory from .punk_metadata import PunkMetadata

26.666667

39

0.85

10

80

6.7

0.8

0

0.1125

80

3

40

26.666667

0.943662

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

07558e1b9cdc2b2ef987f9b75807595187b52856

21

py

Python

helloworld.py

EkBalam/evolutionatyComputation

171274bfd5b19b3ec75ffcbbded5b309c628c597

[ "MIT" ]

null

helloworld.py

EkBalam/evolutionatyComputation

171274bfd5b19b3ec75ffcbbded5b309c628c597

[ "MIT" ]

null

helloworld.py

EkBalam/evolutionatyComputation

171274bfd5b19b3ec75ffcbbded5b309c628c597

[ "MIT" ]

null

print('Hello Wordl')

10.5

20

0.714286

3

21

5

1

0

0.095238

21

1

21

0.789474

0

0.52381

0

1

0

true

0

1

0

null

0

1

0

null

0

1

0

1

0

5

4afda406e9c58b09e33969b8c16331cb73a0ad86

56

py

Python

Lib/test/badsyntax_async4.py

pierriko/cpython

e388c43f849b88b3927572f0d5e4125fb909033b

[ "PSF-2.0" ]

70

2015-06-20T17:59:24.000Z

2021-05-03T02:01:49.000Z

Lib/test/badsyntax_async4.py

pierriko/cpython

e388c43f849b88b3927572f0d5e4125fb909033b

[ "PSF-2.0" ]

16

2015-06-11T14:57:43.000Z

2016-12-03T00:22:13.000Z

Lib/test/badsyntax_async4.py

pierriko/cpython

e388c43f849b88b3927572f0d5e4125fb909033b

[ "PSF-2.0" ]

36

2015-05-15T20:30:44.000Z

2020-11-14T19:31:40.000Z

async def foo(): async def foo(): await something()

18.666667

38

0.642857

8

56

4.5

0.625

0.444444

0.611111

0

0.214286

56

2

39

28

0.818182

0

1

0

true

0

1

0

null

1

0

1

0

null

0

1

0

5

ab19c71b174d350183e2cb2bbf357cc7c52eed46

159

py

Python

api/fixtures/user.py

lsmiley/esstools-api-server-django

dec88de7fcc2d07feed3c37831788be1550e5787

[ "MIT" ]

11

2021-07-20T03:09:55.000Z

2022-02-16T21:39:43.000Z

api/fixtures/user.py

lsmiley/esstools-api-server-django

dec88de7fcc2d07feed3c37831788be1550e5787

[ "MIT" ]

8

2021-07-20T02:03:38.000Z

2021-07-20T11:37:36.000Z

api/fixtures/user.py

lsmiley/esstools-api-server-django

dec88de7fcc2d07feed3c37831788be1550e5787

[ "MIT" ]

8

2021-07-20T16:57:08.000Z

2022-03-03T06:40:12.000Z

from api.user.models import User user_data = {"username": "admin", "password": "12345678", "email": "teast@admin.com"} User.objects.create_user(**user_data)

26.5

85

0.716981

22

159

5.045455

0.681818

0.144144

0.216216

0

0.055556

0.09434

159

5

86

31.8

0.715278

0

0.308176

0

1

0

false

0.333333

0

0.333333

0

1

0

null

0

1

0

1

0

null

0

1

0

5

ab3eb05ace63beeaae3f58645633fef34a438499

95

py

Python

python/testData/quickFixes/PyAddImportQuickFixTest/addParenthesesAndTrailingCommaToUpdatedFromImport/main.py

jnthn/intellij-community

8fa7c8a3ace62400c838e0d5926a7be106aa8557

[ "Apache-2.0" ]

2

2019-04-28T07:48:50.000Z

2020-12-11T14:18:08.000Z

python/testData/quickFixes/PyAddImportQuickFixTest/addParenthesesAndTrailingCommaToUpdatedFromImport/main.py

jnthn/intellij-community

8fa7c8a3ace62400c838e0d5926a7be106aa8557

[ "Apache-2.0" ]

173

2018-07-05T13:59:39.000Z

2018-08-09T01:12:03.000Z

python/testData/quickFixes/PyAddImportQuickFixTest/addParenthesesAndTrailingCommaToUpdatedFromImport/main.py

jnthn/intellij-community

8fa7c8a3ace62400c838e0d5926a7be106aa8557

[ "Apache-2.0" ]

2

2020-03-15T08:57:37.000Z

2020-04-07T04:48:14.000Z

from module import foo print(foo, <error descr="Unresolved reference 'bar'">b<caret>ar</error>)

47.5

72

0.757895

15

95

4.8

0.866667

0

0.084211

95

2

72

47.5

0.827586

0

0.270833

0

null

0

0.5

null

0.5

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

ab51a2954232116a4cb386b3bfd57f9c4be4859a

135

py

Python

include/tclap-1.4.0-rc1/tests/test24.py

SpaceKatt/cpp-cli-poc

02ffefea2fc6e999fa2b27d08a8b3be6830b1b97

[ "BSL-1.0" ]

62

2021-09-21T18:58:02.000Z

2022-03-07T02:17:43.000Z

third_party/tclap-1.4.0-rc1/tests/test24.py

Vertexwahn/FlatlandRT

37d09fde38b25eff5f802200b43628efbd1e3198

[ "Apache-2.0" ]

null

third_party/tclap-1.4.0-rc1/tests/test24.py

Vertexwahn/FlatlandRT

37d09fde38b25eff5f802200b43628efbd1e3198

[ "Apache-2.0" ]

null

#!/usr/bin/python import simple_test simple_test.test("test5", ["--aaa", "dilbert", "-b", "asdf", "-c", "fdas", ], expect_fail=True)

22.5

95

0.622222

19

135

4.263158

0.842105

0.246914

0

0.008264

0.103704

135

5

96

27

0.661157

0.118519

0

0.245763

0

1

0

true

0

0.5

0

0.5

0

1

0

null

1

0

1

0

null

0

1

0

1

0

5

db8c43553c3b6cad938e1c37146649631d012ed4

204

py

Python

resources/usr/local/lib/python2.7/dist-packages/bx/intervals/__init__.py

edawson/parliament2

2632aa3484ef64c9539c4885026b705b737f6d1e

[ "Apache-2.0" ]

2

2019-07-29T04:12:46.000Z

2020-06-01T00:35:51.000Z

resources/usr/local/lib/python2.7/dist-packages/bx/intervals/__init__.py

edawson/parliament2

2632aa3484ef64c9539c4885026b705b737f6d1e

[ "Apache-2.0" ]

1

2021-09-11T14:30:32.000Z

resources/usr/local/lib/python2.7/dist-packages/bx/intervals/__init__.py

edawson/parliament2

2632aa3484ef64c9539c4885026b705b737f6d1e

[ "Apache-2.0" ]

2

2016-12-19T02:27:46.000Z

2019-07-29T02:53:54.000Z

""" Tools and data structures for working with genomic intervals (or sets of regions on a line in general) efficiently. """ # For compatiblity with existing stuff from bx.intervals.intersection import *

29.142857

73

0.779412

29

204

5.482759

0.896552

0

0.156863

204

7

74

29.142857

0.924419

0.754902

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

db91b7158c4ee9aa653462fe38e79ed1b553db87

747

py

Python

venv/Lib/site-packages/cffi/lock.py

gilbertekalea/booking.com_crawler

71e52c87cd72a77f80a3e5fc0af0e1a68a5712ae

[ "MIT" ]

9,953

2019-04-03T23:41:04.000Z

2022-03-31T11:54:44.000Z

venv/Lib/site-packages/cffi/lock.py

gilbertekalea/booking.com_crawler

71e52c87cd72a77f80a3e5fc0af0e1a68a5712ae

[ "MIT" ]

713

2015-11-06T10:48:58.000Z

2018-11-27T16:32:18.000Z

lib/python2.7/site-packages/cffi/lock.py

anish03/weather-dash

d517fa9da9028d1fc5d8fd71d77cee829ddee87b

[ "MIT" ]

2,803

2019-04-06T13:15:33.000Z

2022-03-31T07:42:01.000Z

import sys if sys.version_info < (3,): try: from thread import allocate_lock except ImportError: from dummy_thread import allocate_lock else: try: from _thread import allocate_lock except ImportError: from _dummy_thread import allocate_lock ##import sys ##l1 = allocate_lock ##class allocate_lock(object): ## def __init__(self): ## self._real = l1() ## def __enter__(self): ## for i in range(4, 0, -1): ## print sys._getframe(i).f_code ## print ## return self._real.__enter__() ## def __exit__(self, *args): ## return self._real.__exit__(*args) ## def acquire(self, f): ## assert f is False ## return self._real.acquire(f)

24.096774

47

0.610442

94

747

4.457447

0.43617

0.171838

0.190931

0.229117

0.386635

0

0.01105

0.273092

747

30

48

24.9

0.760589

0.547523

0

0.363636

0

1

0

true

0

0.636364

0

0.636364

0

null

0

1

0

null

0

1

0

1

0

1

0

5

dbdde38c2ecc0c32ad746344ac1795534d17b749

75

py

Python

sortingview/workspace/__init__.py

garrettmflynn/sortingview

0bb3df40d5d031ec651c4821f928787bbee71fbb

[ "Apache-2.0" ]

2

2021-11-19T04:51:42.000Z

2022-03-12T23:36:19.000Z

sortingview/workspace/__init__.py

magland/sortingview

0b1be9d55048cd4b8a0b6b6733bd7d35cb440aa7

[ "Apache-2.0" ]

172

2021-05-10T17:39:15.000Z

2022-03-18T21:46:15.000Z

sortingview/workspace/__init__.py

garrettmflynn/sortingview

0bb3df40d5d031ec651c4821f928787bbee71fbb

[ "Apache-2.0" ]

2

2021-08-29T20:13:57.000Z

2022-03-12T23:36:34.000Z

from .workspace import Workspace from .load_workspace import load_workspace

37.5

42

0.88

10

75

6.4

0.4

0.46875

0

0.093333

75

2

42

37.5

0.941176

0

1

0

true

0

1

0

1

0

1

0

null

1

0

1

0

null

0

1

0

1

0

5

9159074dfff6c299102d168d953ff070d75258d7

1,309

py

Python

braidgenerator/decorators/braidword.py

MicheleVidulis/Knots

983fa8e1aa53d24446f1c8b2c848dc176be14ba7

[ "MIT" ]

7

2019-07-06T15:23:25.000Z

2022-01-24T00:57:30.000Z

braidgenerator/decorators/braidword.py

MicheleVidulis/Knots

983fa8e1aa53d24446f1c8b2c848dc176be14ba7

[ "MIT" ]

2

2021-07-23T14:11:04.000Z

2021-07-23T14:34:28.000Z

braidgenerator/decorators/braidword.py

MicheleVidulis/Knots

983fa8e1aa53d24446f1c8b2c848dc176be14ba7

[ "MIT" ]

2

2021-07-23T14:17:24.000Z

2021-11-29T13:04:08.000Z

# Decorator to check params of BraidWord def checkparams_braidword(func: 'func') -> 'func': def wrapper(*args, **kwargs): if len(args) > 1: # args will have self since for class initword = args[1] # Check if type is not list if not isinstance(initword, list): msg = "BraidWord initword argument must be a list." raise TypeError(msg) # Check if any generators are zero elif 0 in initword: msg = ('Braid generators are indexed starting at one. ' 'No zero braid generators allowed.') raise ValueError(msg) else: return func(*args, **kwargs) else: initword = kwargs[list(kwargs.keys())[0]] # Check if type is not list if not isinstance(initword, list): msg = "initword argument must be a list." raise TypeError(msg) # Check if any generators are zero elif 0 in initword: msg = ('Braid generators are indexed starting at one. ' 'No zero braid generators allowed.') raise ValueError(msg) else: return func(*args, **kwargs) return wrapper

39.666667

71

0.52712

144

1,309

4.784722

0.361111

0.040639

0.03193

0.037736

0.716981

0

0.006337

0.39725

1,309

32

72

40.90625

0.86692

0.146677

0

0.68

0

0.218018

0

1

0.08

false

0

0.2

0

null

0

1

0

null

0

5

91597271e2dd8016324f9d6aee14e7c8709f154f

84

py

Python

pypoly/__init__.py

tchaumeny/PyPoly

8e3f244bc5079eede02fc6f26a5d8006acfc7a4e

[ "MIT" ]

5

2015-01-30T13:07:57.000Z

2020-05-26T22:26:32.000Z

pypoly/__init__.py

tchaumeny/PyPoly

8e3f244bc5079eede02fc6f26a5d8006acfc7a4e

[ "MIT" ]

1

2017-08-14T07:41:27.000Z

2017-10-28T03:40:39.000Z

pypoly/__init__.py

tchaumeny/PyPoly

8e3f244bc5079eede02fc6f26a5d8006acfc7a4e

[ "MIT" ]

3

2015-05-19T04:19:50.000Z

2017-10-24T07:28:51.000Z

from _pypoly import * from pypoly.version import __version__ X = Polynomial(0, 1)

14

38

0.761905

12

84

4.916667

0.666667

0.338983

0

0.028571

0.166667

84

5

39

16.8

0.814286

0

1

0

false

0

0.666667

0

0.666667

0

1

0

null

1

0

1

0

null

0

1

0

1

0

5

9163959e941189848d893f02482107fac9570f8e

26

py

Python

src/vitalert/__init__.py

Vitalert/vitalert-python

6ee91063412320cb561634de73ad8522a1453c50

[ "MIT" ]

null

src/vitalert/__init__.py

Vitalert/vitalert-python

6ee91063412320cb561634de73ad8522a1453c50

[ "MIT" ]

null

src/vitalert/__init__.py

Vitalert/vitalert-python

6ee91063412320cb561634de73ad8522a1453c50

[ "MIT" ]

null

from .vita import Vitalert

26

0.846154

4

26

5.5

1

0

0.115385

26

1

26

0.956522

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

5

9182fa1a87989cd085572fe0820be63fbc78b6c5

2,913

py

Python

mesonbuild/linkers/__init__.py

kira78/meson

0ae840656c5b87f30872072aa8694667c63c96d2

[ "Apache-2.0" ]

2

2020-01-17T19:23:16.000Z

2022-02-03T18:28:03.000Z

mesonbuild/linkers/__init__.py

kira78/meson

0ae840656c5b87f30872072aa8694667c63c96d2

[ "Apache-2.0" ]

1

2021-07-27T22:30:20.000Z

mesonbuild/linkers/__init__.py

kira78/meson

0ae840656c5b87f30872072aa8694667c63c96d2

[ "Apache-2.0" ]

null

# Copyright 2012-2021 The Meson development team # 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. from .detect import ( defaults, guess_win_linker, guess_nix_linker, ) from .linkers import ( RSPFileSyntax, StaticLinker, VisualStudioLikeLinker, VisualStudioLinker, IntelVisualStudioLinker, ArLinker, ArmarLinker, DLinker, CcrxLinker, Xc16Linker, CompCertLinker, C2000Linker, AIXArLinker, PGIStaticLinker, NvidiaHPC_StaticLinker, DynamicLinker, PosixDynamicLinkerMixin, GnuLikeDynamicLinkerMixin, AppleDynamicLinker, GnuDynamicLinker, GnuGoldDynamicLinker, GnuBFDDynamicLinker, LLVMDynamicLinker, WASMDynamicLinker, CcrxDynamicLinker, Xc16DynamicLinker, CompCertDynamicLinker, C2000DynamicLinker, ArmDynamicLinker, ArmClangDynamicLinker, QualcommLLVMDynamicLinker, PGIDynamicLinker, NvidiaHPC_DynamicLinker, VisualStudioLikeLinkerMixin, MSVCDynamicLinker, ClangClDynamicLinker, XilinkDynamicLinker, SolarisDynamicLinker, AIXDynamicLinker, OptlinkDynamicLinker, CudaLinker, prepare_rpaths, order_rpaths, evaluate_rpath, ) __all__ = [ # detect.py 'defaults', 'guess_win_linker', 'guess_nix_linker', # linkers.py 'RSPFileSyntax', 'StaticLinker', 'VisualStudioLikeLinker', 'VisualStudioLinker', 'IntelVisualStudioLinker', 'ArLinker', 'ArmarLinker', 'DLinker', 'CcrxLinker', 'Xc16Linker', 'CompCertLinker', 'C2000Linker', 'AIXArLinker', 'PGIStaticLinker', 'NvidiaHPC_StaticLinker', 'DynamicLinker', 'PosixDynamicLinkerMixin', 'GnuLikeDynamicLinkerMixin', 'AppleDynamicLinker', 'GnuDynamicLinker', 'GnuGoldDynamicLinker', 'GnuBFDDynamicLinker', 'LLVMDynamicLinker', 'WASMDynamicLinker', 'CcrxDynamicLinker', 'Xc16DynamicLinker', 'CompCertDynamicLinker', 'C2000DynamicLinker', 'ArmDynamicLinker', 'ArmClangDynamicLinker', 'QualcommLLVMDynamicLinker', 'PGIDynamicLinker', 'NvidiaHPC_DynamicLinker', 'VisualStudioLikeLinkerMixin', 'MSVCDynamicLinker', 'ClangClDynamicLinker', 'XilinkDynamicLinker', 'SolarisDynamicLinker', 'AIXDynamicLinker', 'OptlinkDynamicLinker', 'CudaLinker', 'prepare_rpaths', 'order_rpaths', 'evaluate_rpath', ]

22.937008

74

0.710264

216

2,913

9.476852

0.560185

0.029311

0.012702

0.015633

0.751343

0.71617

0

0.015618

0.20872

2,913

126

75

23.119048

0.872451

0.202197

0

0.336651

0.100389

0

1

0

false

0

0.02

0

0.02

0

null

0

1

0

null

0

5

9184f6744a6e832a09209773e59d669bb5dd8771

1,773

py

Python

tests/3rdparty/object_detection_trainer.py

opencollective/CVTron

fd111d734fed4008ba9d04d18c359dbd441a1897

[ "Apache-2.0" ]

94

2018-03-31T06:32:50.000Z

2020-09-25T10:19:23.000Z

tests/3rdparty/object_detection_trainer.py

opencollective/CVTron

fd111d734fed4008ba9d04d18c359dbd441a1897

[ "Apache-2.0" ]

98

2018-04-02T15:55:25.000Z

2020-04-06T09:35:36.000Z

tests/3rdparty/object_detection_trainer.py

opencollective/CVTron

fd111d734fed4008ba9d04d18c359dbd441a1897

[ "Apache-2.0" ]

18

2018-07-10T22:54:19.000Z

2021-03-23T05:17:39.000Z

# trainer test from cvtron.trainers.detector.object_detection_trainer import ObjectDetectionTrainer # train_config = {'pipeline_config_file':'/media/sfermi/Programming/temp/test/ssd_inception_v2.config', # 'train_dir':'/media/sfermi/Programming/temp/cvtron-objdet/2017', # 'weblog_dir':'/media/sfermi/Programming/temp/test/log', # 'log_every_n_steps':100} # trainer = ObjectDetectionTrainer(train_config, '/media/sfermi/Programming/temp/cvtron-objdet/ssd_v2') # trainer.start() ''' train_config = {'pipeline_config_file':'/media/sfermi/Programming/project/cv/cvtron/cvtron/3rdparty/object_detection/samples/configs/faster_rcnn_resnet101_pets.config', 'train_dir':'/media/sfermi/Programming/temp/pets', 'weblog_dir':'/media/sfermi/Programming/temp/pets/log', 'log_every_n_steps':100, 'fine_tune_ckpt':'/media/sfermi/Programming/temp/pets/model.ckpt', 'data_dir':'/media/sfermi/Programming/temp/pets'} trainer = ObjectDetectionTrainer(train_config, '/media/sfermi/Programming/temp/pets') trainer.start() train_config = {'pipeline_config_file':'/media/sfermi/Programming/temp/vlabel/pipeline.config', 'train_dir':'/media/sfermi/Programming/temp/vlabel', 'weblog_dir':'/media/sfermi/Programming/temp/valbel/log', 'log_every_n_steps':1, 'fine_tune_ckpt':'/media/sfermi/Programming/temp/vlabel/model.ckpt', 'data_dir':'/media/sfermi/Programming/temp/vlabel'} trainer = ObjectDetectionTrainer(train_config, '/media/sfermi/Programming/temp/vlabel') trainer.parse_dataset('/media/sfermi/Programming/temp/vlabel/annotations.json') override_config = { 'num_steps': 300 } trainer.override_train_configs(override_config) trainer.start() '''

41.232558

168

0.736041

212

1,773

5.929245

0.259434

0.148767

0.297534

0.330947

0.752586

0.694511

0.527446

0.371519

0.147176

0.100239

0

0.012755

0.115623

1,773

43

169

41.232558

0.788903

0.230118

0

1

0

true

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

91a4e4ef8d3e1b1d7589e66bf310fb13372b6170

179

py

Python

mnulfi/__init__.py

EiffL/MnuLFI

b3f3c7194ebe2682cda15c30186b84ab0cc77b35

[ "MIT" ]

2

2019-05-03T16:26:38.000Z

2020-10-19T22:32:23.000Z

mnulfi/__init__.py

EiffL/MnuLFI

b3f3c7194ebe2682cda15c30186b84ab0cc77b35

[ "MIT" ]

10

2019-04-22T20:33:07.000Z

2019-10-15T00:18:26.000Z

mnulfi/__init__.py

EiffL/MnuLFI

b3f3c7194ebe2682cda15c30186b84ab0cc77b35

[ "MIT" ]

4

2019-04-02T11:46:12.000Z

2020-02-25T23:32:32.000Z

import os # Path to data files required for cosmos _MNULFI_DATA_DIR=os.path.join(os.path.dirname(os.path.realpath(__file__)), 'data') def dat_dir(): return _MNULFI_DATA_DIR

22.375

82

0.765363

30

179

4.2

0.6

0.190476

0.206349

0

0.122905

179

7

83

25.571429

0.802548

0.212291

0

0.028777

0

1

0.25

false

0

0.25

0.75

0

null

0

1

0

1

0

null

0

1

0

1

0

5

91c4e995398334b68528ee3bab449ec8b9f39c99

1,406

py

Python

test/controllers/user/test_preferences.py

kaeawc/django-auth-example

1a3023fe1b536cd91323156fe0f1a109b2fe7c8c

[ "MIT" ]

null

test/controllers/user/test_preferences.py

kaeawc/django-auth-example

1a3023fe1b536cd91323156fe0f1a109b2fe7c8c

[ "MIT" ]

null

test/controllers/user/test_preferences.py

kaeawc/django-auth-example

1a3023fe1b536cd91323156fe0f1a109b2fe7c8c

[ "MIT" ]

null

# -*- coding: utf-8 -* from test.account import Account from test.account import AccountTestCase class GetUserPreferencesSpec(AccountTestCase): def test_success(self): """ A user should be able to get preferences with valid credentials """ email = Account.create_email() password = Account.create_password() self.signup(email=email, password=password, password_confirmation=password) response = self.login(email=email, password=password) # Check that login worked ok assert response.ok is True, response # Use the logged in session to get user preferences response = self.http_get(u"/preferences") assert response.ok is True, response class EditUserPreferencesSpec(AccountTestCase): def test_success_without_changing(self): """ A user should be able to edit preferences with valid credentials """ email = Account.create_email() password = Account.create_password() self.signup(email=email, password=password, password_confirmation=password) response = self.login(email=email, password=password) # Check that login worked ok assert response.ok is True, response # Use the logged in session to get user preferences response = self.http_post(u"/preferences") assert response.ok is True, response

31.244444

83

0.679943

163

1,406

5.791411

0.306748

0.082627

0.076271

0.110169

0.771186

0.722458

0.633475

0

0.000942

0.244666

1,406

45

84

31.244444

0.887947

0.216216

0

0.6

0

0.022814

0

0.2

1

0.1

false

0.3

0.1

0

0.3

0

null

0

1

0

1

0

null

0

1

0

5

91c8443600a4310c5bc23fdbfe8b047a814525f7

213

py

Python

Darlington/phase-3/python challenge/day 90 solution/qtn1.py

darlcruz/python-challenge-solutions

3e03a420d01177b71750d4d1b84cb3cbbf8c6900

[ "MIT" ]

null

Darlington/phase-3/python challenge/day 90 solution/qtn1.py

darlcruz/python-challenge-solutions

3e03a420d01177b71750d4d1b84cb3cbbf8c6900

[ "MIT" ]

null

Darlington/phase-3/python challenge/day 90 solution/qtn1.py

darlcruz/python-challenge-solutions

3e03a420d01177b71750d4d1b84cb3cbbf8c6900

[ "MIT" ]

null

#program to add the digits of a positive integer repeatedly until the result has a single digit. def add_digits(num): return (num - 1) % 9 + 1 if num > 0 else 0 print(add_digits(48)) print(add_digits(59))

35.5

96

0.70892

39

213

3.794872

0.666667

0.182432

0.189189

0

0.052941

0.201878

213

6

97

35.5

0.817647

0.446009

0

1

0.25

false

0

0.25

0.5

0

null

0

1

0

1

0

null

0

1

0

1

0

1

0

5

37cfc922dc6d9353b0f7d8bf398603ecb00f85a8

33

py

Python

dynastes/models/__init__.py

dynastes-team/dynastes

931b6d9ac83862eb39c2f5144c95b952e9efcd8e

[ "MIT" ]

7

2020-01-18T14:28:04.000Z

2021-11-10T16:46:34.000Z

dynastes/models/__init__.py

veqtor/dynastes

931b6d9ac83862eb39c2f5144c95b952e9efcd8e

[ "MIT" ]

null

dynastes/models/__init__.py

veqtor/dynastes

931b6d9ac83862eb39c2f5144c95b952e9efcd8e

[ "MIT" ]

null

from . import growing_gan_models

16.5

32

0.848485

5

33

5.2

1

0

0.121212

33

1

33

0.896552

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

5

37df7f06e5ae01e623da324b2ae5b4cd1f0394bd

9,432

py

Python

Segmentation_UGSCNN/UG-SCNN/meshcnn/ops.py

Abdulah-Fawaz/Benchmarking-Surface-DL

9693379f26d57f9aabf28b973f40a9f6f627d26f

[ "MIT" ]

2

2021-12-04T07:04:56.000Z

2021-12-13T16:28:50.000Z

Segmentation_UGSCNN/UG-SCNN/meshcnn/ops.py

Abdulah-Fawaz/Benchmarking-Surface-DL

9693379f26d57f9aabf28b973f40a9f6f627d26f

[ "MIT" ]

1

2021-12-21T09:36:11.000Z

2022-01-25T10:26:43.000Z

Segmentation_UGSCNN/UG-SCNN/meshcnn/ops.py

Abdulah-Fawaz/Benchmarking-Surface-DL

9693379f26d57f9aabf28b973f40a9f6f627d26f

[ "MIT" ]

1

2022-02-27T17:38:19.000Z

import math import pickle, gzip import os import torch from torch import nn from torch.nn.parameter import Parameter from meshcnn.utils import sparse2tensor, spmatmul class _MeshConv(nn.Module): def __init__(self, in_channels, out_channels, mesh_file, stride=1, bias=True): assert stride in [1, 2] super(_MeshConv, self).__init__() self.in_channels = in_channels self.out_channels = out_channels if bias: self.bias = Parameter(torch.Tensor(out_channels)) else: self.register_parameter('bias', None) self.ncoeff = 4 self.coeffs = Parameter(torch.Tensor(out_channels, in_channels, self.ncoeff)) self.set_coeffs() # load mesh file pkl = pickle.load(open(mesh_file, "rb")) self.pkl = pkl self.nv = self.pkl['V'].shape[0] G = sparse2tensor(pkl['G']) # gradient matrix V->F, 3#F x #V NS = torch.tensor(pkl['NS'], dtype=torch.float32) # north-south vector field, #F x 3 EW = torch.tensor(pkl['EW'], dtype=torch.float32) # east-west vector field, #F x 3 self.register_buffer("G", G) self.register_buffer("NS", NS) self.register_buffer("EW", EW) def set_coeffs(self): n = self.in_channels * self.ncoeff stdv = 1. / math.sqrt(n) self.coeffs.data.uniform_(-stdv, stdv) if self.bias is not None: self.bias.data.uniform_(-stdv, stdv) class MeshConv(_MeshConv): def __init__(self, in_channels, out_channels, mesh_file, stride=1, bias=True): super(MeshConv, self).__init__(in_channels, out_channels, mesh_file, stride, bias) pkl = self.pkl if stride == 2: self.nv_prev = pkl['nv_prev'] L = sparse2tensor(pkl['L'].tocsr()[:self.nv_prev].tocoo()) # laplacian matrix V->V F2V = sparse2tensor(pkl['F2V'].tocsr()[:self.nv_prev].tocoo()) # F->V, #V x #F else: # stride == 1 self.nv_prev = pkl['V'].shape[0] L = sparse2tensor(pkl['L'].tocoo()) F2V = sparse2tensor(pkl['F2V'].tocoo()) self.register_buffer("L", L) self.register_buffer("F2V", F2V) def forward(self, input): # compute gradient grad_face = spmatmul(input, self.G) grad_face = grad_face.view(*(input.size()[:2]), 3, -1).permute(0, 1, 3, 2) # gradient, 3 component per face laplacian = spmatmul(input, self.L) identity = input[..., :self.nv_prev] grad_face_ew = torch.sum(torch.mul(grad_face, self.EW), keepdim=False, dim=-1) grad_face_ns = torch.sum(torch.mul(grad_face, self.NS), keepdim=False, dim=-1) grad_vert_ew = spmatmul(grad_face_ew, self.F2V) grad_vert_ns = spmatmul(grad_face_ns, self.F2V) feat = [identity, laplacian, grad_vert_ew, grad_vert_ns] out = torch.stack(feat, dim=-1) out = torch.sum(torch.sum(torch.mul(out.unsqueeze(1), self.coeffs.unsqueeze(2)), dim=2), dim=-1) out += self.bias.unsqueeze(-1) return out class MeshConv_transpose(_MeshConv): def __init__(self, in_channels, out_channels, mesh_file, stride=2, bias=True): assert(stride == 2) super(MeshConv_transpose, self).__init__(in_channels, out_channels, mesh_file, stride, bias) pkl = self.pkl self.nv_prev = self.pkl['nv_prev'] self.nv_pad = self.nv - self.nv_prev L = sparse2tensor(pkl['L'].tocoo()) # laplacian matrix V->V F2V = sparse2tensor(pkl['F2V'].tocoo()) # F->V, #V x #F self.register_buffer("L", L) self.register_buffer("F2V", F2V) def forward(self, input): # pad input with zeros up to next mesh resolution ones_pad = torch.ones(*input.size()[:2], self.nv_pad).to(input.device) input = torch.cat((input, ones_pad), dim=-1) # compute gradient grad_face = spmatmul(input, self.G) grad_face = grad_face.view(*(input.size()[:2]), 3, -1).permute(0, 1, 3, 2) # gradient, 3 component per face laplacian = spmatmul(input, self.L) identity = input grad_face_ew = torch.sum(torch.mul(grad_face, self.EW), keepdim=False, dim=-1) grad_face_ns = torch.sum(torch.mul(grad_face, self.NS), keepdim=False, dim=-1) grad_vert_ew = spmatmul(grad_face_ew, self.F2V) grad_vert_ns = spmatmul(grad_face_ns, self.F2V) feat = [identity, laplacian, grad_vert_ew, grad_vert_ns] out = torch.stack(feat, dim=-1) out = torch.sum(torch.sum(torch.mul(out.unsqueeze(1), self.coeffs.unsqueeze(2)), dim=2), dim=-1) out += self.bias.unsqueeze(-1) return out class ResBlock_Mod(nn.Module): def __init__(self, in_chan, neck_chan, out_chan, level, coarsen, mesh_folder): super().__init__() l = level-1 if coarsen else level self.coarsen = coarsen self.conv1 = nn.Conv1d(in_chan, neck_chan, kernel_size=1, stride=1) mesh_file = os.path.join(mesh_folder, "icosphere_{}.pkl".format(l)) self.conv2 = MeshConv(neck_chan, neck_chan, mesh_file=mesh_file, stride=1) self.conv3 = nn.Conv1d(neck_chan, out_chan, kernel_size=1, stride=1) self.conv4 = MeshConv(out_chan, out_chan, mesh_file=mesh_file,stride=1) self.conv5 = nn.Conv1d(out_chan, out_chan, kernel_size=1, stride=1) self.relu = nn.LeakyReLU(inplace=True) self.bn1 = nn.BatchNorm1d(neck_chan) self.bn2 = nn.BatchNorm1d(neck_chan) self.bn3 = nn.BatchNorm1d(out_chan) self.bn4 = nn.BatchNorm1d(out_chan) self.bn5 = nn.BatchNorm1d(out_chan) self.nv_prev = self.conv2.nv_prev self.down = DownSamp(self.nv_prev) self.diff_chan = (in_chan != out_chan) if coarsen: #self.seq1 = nn.Sequential(self.down, self.conv1, self.bn1, self.relu, # self.conv2, self.bn2) self.seq1 = nn.Sequential(self.conv1, self.bn1, self.relu, self.down, self.conv2, self.bn2, self.relu, self.conv3, self.bn3, self.relu, self.conv4, self.bn4, self.relu, self.conv5, self.bn5) else: self.seq1 = nn.Sequential(self.conv1, self.bn1, self.relu, self.conv2, self.bn2, self.relu, self.conv3, self.bn3,self.relu, self.conv4, self.bn4, self.relu, self.conv5, self.bn5) if self.diff_chan or coarsen: self.conv_ = nn.Conv1d(in_chan, out_chan, kernel_size=1, stride=1) self.bn_ = nn.BatchNorm1d(out_chan) if coarsen: self.seq2 = nn.Sequential(self.conv_, self.down, self.bn_, self.relu) else: self.seq2 = nn.Sequential(self.conv_, self.bn_, self.relu) def forward(self, x): if self.diff_chan or self.coarsen: x2 = self.seq2(x) else: x2 = x x1 = self.seq1(x) out = x1 + x2 out = self.relu(out) return out class ResBlock(nn.Module): def __init__(self, in_chan, neck_chan, out_chan, level, coarsen, mesh_folder): super().__init__() l = level-1 if coarsen else level self.coarsen = coarsen mesh_file = os.path.join(mesh_folder, "icosphere_{}.pkl".format(l)) self.conv1 = nn.Conv1d(in_chan, neck_chan, kernel_size=1, stride=1) self.conv2 = MeshConv(neck_chan, neck_chan, mesh_file=mesh_file, stride=1) self.conv3 = nn.Conv1d(neck_chan, out_chan, kernel_size=1, stride=1) self.relu = nn.ReLU(inplace=True) self.bn1 = nn.BatchNorm1d(neck_chan) self.bn2 = nn.BatchNorm1d(neck_chan) self.bn3 = nn.BatchNorm1d(out_chan) self.nv_prev = self.conv2.nv_prev self.down = DownSamp(self.nv_prev) self.diff_chan = (in_chan != out_chan) if coarsen: # self.seq1 = nn.Sequential(self.down, self.conv1, self.bn1, self.relu, # self.conv2, self.bn2, self.relu, # self.conv3, self.bn3) self.seq1 = nn.Sequential(self.conv1, self.down, self.bn1, self.relu, self.conv2, self.bn2, self.relu, self.conv3, self.bn3) else: self.seq1 = nn.Sequential(self.conv1, self.bn1, self.relu, self.conv2, self.bn2, self.relu, self.conv3, self.bn3) if self.diff_chan or coarsen: self.conv_ = nn.Conv1d(in_chan, out_chan, kernel_size=1, stride=1) self.bn_ = nn.BatchNorm1d(out_chan) if coarsen: self.seq2 = nn.Sequential(self.conv_, self.down, self.bn_) else: self.seq2 = nn.Sequential(self.conv_, self.bn_) def forward(self, x): if self.diff_chan or self.coarsen: x2 = self.seq2(x) else: x2 = x x1 = self.seq1(x) out = x1 + x2 out = self.relu(out) return out class DownSamp(nn.Module): def __init__(self, nv_prev): super().__init__() self.nv_prev = nv_prev def forward(self, x): return x[..., :self.nv_prev]

43.465438

115

0.584606

1,287

9,432

4.101787

0.114996

0.031824

0.034097

0.01989

0.77079

0.730441

0.716045

0.710551

0.704679

0.673612

0

0.029074

0.28891

9,432

216

116

43.666667

0.758014

0.066158

0

0.626374

0

0.009567

0

0.010989

1

0.065934

false

0

0.038462

0.005495

0.164835

0

null

0

1

0

null

0

5

37edbdc88380b96b41f6a7a9b650f9c348e34c69

68

py

Python

src/hub/dataload/sources/clingen/__init__.py

erikyao/myvariant.info

a4eaaca7ab6c069199f8942d5afae2dece908147

[ "Apache-2.0" ]

78

2017-05-26T08:38:25.000Z

2022-02-25T08:55:31.000Z

src/hub/dataload/sources/clingen/__init__.py

erikyao/myvariant.info

a4eaaca7ab6c069199f8942d5afae2dece908147

[ "Apache-2.0" ]

105

2017-06-28T17:26:06.000Z

2022-03-17T17:49:53.000Z

src/hub/dataload/sources/clingen/__init__.py

erikyao/myvariant.info

a4eaaca7ab6c069199f8942d5afae2dece908147

[ "Apache-2.0" ]

19

2017-06-12T18:31:54.000Z

2021-11-10T00:04:43.000Z

from .dump import ClingenDumper from .upload import ClingenUploader

22.666667

35

0.852941

8

68

7.25

0.75

0

0.117647

68

2

36

34

0.966667

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

37eddb4d84d57e2fa2280707335210527f0713ce

319

py

Python

trie/exceptions.py

Bhargavasomu/py-trie

e407ff8243ce434a8ed2340c82959c023eff8db2

[ "MIT" ]

4

2019-06-19T05:37:48.000Z

2021-07-09T16:05:57.000Z

trie/exceptions.py

Bhargavasomu/py-trie

e407ff8243ce434a8ed2340c82959c023eff8db2

[ "MIT" ]

null

trie/exceptions.py

Bhargavasomu/py-trie

e407ff8243ce434a8ed2340c82959c023eff8db2

[ "MIT" ]

1

2019-02-27T21:29:16.000Z

class InvalidNibbles(Exception): pass class InvalidNode(Exception): pass class ValidationError(Exception): pass class BadTrieProof(Exception): pass class NodeOverrideError(Exception): pass class InvalidKeyError(Exception): pass class SyncRequestAlreadyProcessed(Exception): pass

11.814815

45

0.742947

28

319

8.464286

0.357143

0.383966

0.455696

0

0.191223

319

26

46

12.269231

0.918605

0

0.5

0

1

0

true

0.5

0

0.5

0

1

0

null

1

0

null

0

1

0

5

532a75403037c20f7e24d740d819abf54b5af143

226

py

Python

accessibility/serializers/__init__.py

codepointtku/respa

bb9cd8459d5562569f976dbc609ec41ceecc8023

[ "MIT" ]

1

2019-12-17T10:02:17.000Z

accessibility/serializers/__init__.py

codepointtku/respa

bb9cd8459d5562569f976dbc609ec41ceecc8023

[ "MIT" ]

38

2020-01-24T11:30:53.000Z

2022-01-28T12:42:47.000Z

accessibility/serializers/__init__.py

digipointtku/respa

a529e0df4d3f072df7801adb5bf97a5f4abd1243

[ "MIT" ]

14

2020-02-26T08:17:34.000Z

2021-09-14T07:57:21.000Z

from .accessibility import ServicePointSerializer, ServiceRequirementSerializer, ServicePointUpdateSerializer __all__ = ( 'ServicePointSerializer', 'ServiceRequirementSerializer', 'ServicePointUpdateSerializer' )

28.25

109

0.823009

10

226

18.2

0.7

0.549451

0.857143

0

0.115044

226

8

110

28.25

0.91

0

0.343612

0

1

0

false

0

0.166667

0

0.166667

0

1

0

1

null

1

0

1

0

null

0

5

72594976f085a6f6f9a6659a2647562a50438216

192

py

Python

qwebirc/engines/__init__.py

bqv/qwebirc

00518f65c76669d68d229bf0fdd622809a27ac3c

[ "BSD-3-Clause" ]

null

qwebirc/engines/__init__.py

bqv/qwebirc

00518f65c76669d68d229bf0fdd622809a27ac3c

[ "BSD-3-Clause" ]

1

2016-10-31T14:58:22.000Z

2016-11-09T08:06:37.000Z

qwebirc/engines/__init__.py

bqv/qwebirc

00518f65c76669d68d229bf0fdd622809a27ac3c

[ "BSD-3-Clause" ]

null

from ajaxengine import AJAXEngine from adminengine import AdminEngine from staticengine import StaticEngine from feedbackengine import FeedbackEngine from authgateengine import AuthgateEngine

32

41

0.895833

20

192

8.6

0.35

0

0.104167

192

5

42

38.4

1

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

725965fa433ed31b1b00fe3c66ae3163ac549116

52

py

Python

pyxb/bundles/opengis/iso19139/gss.py

thorstenb/pyxb

634e86f61dfb73a2900f32fc3d819e9c25365a49

[ "Apache-2.0" ]

null

pyxb/bundles/opengis/iso19139/gss.py

thorstenb/pyxb

634e86f61dfb73a2900f32fc3d819e9c25365a49

[ "Apache-2.0" ]

null

pyxb/bundles/opengis/iso19139/gss.py

thorstenb/pyxb

634e86f61dfb73a2900f32fc3d819e9c25365a49

[ "Apache-2.0" ]

null

from pyxb.bundles.opengis.iso19139.raw.gss import *

26

51

0.807692

8

52

5.25

1

0

0.104167

0.076923

52

1

52

0.770833

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

725ca734efcdb6996b60035647cca0cafc0d74fd

162

py

Python

src/schemas/physical.py

canyoupleasecreateanaccount/pytestLessonsCode

240eac1260fd9e589865f22307c769cc06361111

[ "Apache-2.0" ]

null

src/schemas/physical.py

canyoupleasecreateanaccount/pytestLessonsCode

240eac1260fd9e589865f22307c769cc06361111

[ "Apache-2.0" ]

null

src/schemas/physical.py

canyoupleasecreateanaccount/pytestLessonsCode

240eac1260fd9e589865f22307c769cc06361111

[ "Apache-2.0" ]

1

2022-02-06T14:55:49.000Z

from pydantic import BaseModel, HttpUrl, UUID4 from pydantic.color import Color class Physical(BaseModel): color: Color photo: HttpUrl uuid: UUID4

16.2

46

0.740741

20

162

6

0.55

0.2

0

0.015504

0.203704

162

9

47

18

0.914729

0

1

0

true

0

0.333333

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

725ff97d364a27a24eb02fcf66e6ab419a446104

54

py

Python

pyacc/lexer/__init__.py

hdyuik/pyacc

85f6206388ce29a95e39b659257d45be9df250e5

[ "MIT" ]

2

2019-06-21T23:45:09.000Z

2019-06-23T23:37:50.000Z

pyacc/lexer/__init__.py

hdyuik/compiler

85f6206388ce29a95e39b659257d45be9df250e5

[ "MIT" ]

null

pyacc/lexer/__init__.py

hdyuik/compiler

85f6206388ce29a95e39b659257d45be9df250e5

[ "MIT" ]

null

from .token import TokenType from .lexer import Lexer

27

29

0.814815

8

54

5.5

0.625

0

0.148148

54

2

30

27

0.956522

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

726055421d841c1cb660f0602e00e6b32b6f05a2

253

py

Python

2019/python/aoccpu/decoder.py

orhtej2/adventofcode

d273d28e394f58face0ae9873bfe43a667e427c4

[ "Unlicense" ]

null

2019/python/aoccpu/decoder.py

orhtej2/adventofcode

d273d28e394f58face0ae9873bfe43a667e427c4

[ "Unlicense" ]

null

2019/python/aoccpu/decoder.py

orhtej2/adventofcode

d273d28e394f58face0ae9873bfe43a667e427c4

[ "Unlicense" ]

null

import math def getParameterMode(opcode, position): return math.floor((opcode / math.pow(10, position + 1)) % 10) def decode(opcode): return (opcode % 100, getParameterMode(opcode, 1), getParameterMode(opcode, 2), getParameterMode(opcode, 3))

36.142857

112

0.72332

31

253

5.903226

0.483871

0.480874

0

0.050691

0.142292

253

7

112

36.142857

0.792627

0

1

0.4

false

0

0.2

0.4

1

0

null

1

0

1

0

null

0

1

0

1

0

5

72826e50e8e4b7c015bd8638fa5216ab5e2dd147

142

py

Python

src/pyobo/xrefdb/__main__.py

bgyori/pyobo

f199f62f65fc7faff307b56f979a369202c8ad33

[ "MIT" ]

null

src/pyobo/xrefdb/__main__.py

bgyori/pyobo

f199f62f65fc7faff307b56f979a369202c8ad33

[ "MIT" ]

null

src/pyobo/xrefdb/__main__.py

bgyori/pyobo

f199f62f65fc7faff307b56f979a369202c8ad33

[ "MIT" ]

null

# -*- coding: utf-8 -*- """Entry point for extraction script.""" from .cli import cache_xrefs if __name__ == '__main__': cache_xrefs()

15.777778

40

0.647887

18

142

4.555556

0.888889

0.243902

0

0.008621

0.183099

142

8

41

17.75

0.698276

0.401408

0

0.101266

0

1

0

true

0

0.333333

0

0.333333

0

1

0

null

1

0

1

0

null

0

1

0

1

0

5

72aabdc5d2fbc8d5988aaffa9df68a417661d72f

4,169

py

Python

onnx/backend/test/case/node/split.py

How-Wang/onnx

c940fa3fea84948e46603cab2f86467291443beb

[ "Apache-2.0" ]

1

2022-02-04T07:45:14.000Z

onnx/backend/test/case/node/split.py

How-Wang/onnx

c940fa3fea84948e46603cab2f86467291443beb

[ "Apache-2.0" ]

null

onnx/backend/test/case/node/split.py

How-Wang/onnx

c940fa3fea84948e46603cab2f86467291443beb

[ "Apache-2.0" ]

null

# SPDX-License-Identifier: Apache-2.0 from __future__ import absolute_import from __future__ import division from __future__ import print_function from __future__ import unicode_literals import numpy as np # type: ignore import onnx from ..base import Base from . import expect class Split(Base): @staticmethod def export_1d() -> None: input = np.array([1., 2., 3., 4., 5., 6.]).astype(np.float32) node = onnx.helper.make_node( 'Split', inputs=['input'], outputs=['output_1', 'output_2', 'output_3'], axis=0 ) expected_outputs = [np.array([1., 2.]).astype(np.float32), np.array([3., 4.]).astype(np.float32), np.array([5., 6.]).astype(np.float32)] expect(node, inputs=[input], outputs=[y for y in expected_outputs], name='test_split_equal_parts_1d') split = np.array([2, 4]).astype(np.int64) node = onnx.helper.make_node( 'Split', inputs=['input', 'split'], outputs=['output_1', 'output_2'], axis=0, ) expected_outputs = [np.array([1., 2.]).astype(np.float32), np.array([3., 4., 5., 6.]).astype(np.float32)] expect(node, inputs=[input, split], outputs=[y for y in expected_outputs], name='test_split_variable_parts_1d') @staticmethod def export_2d() -> None: input = np.array([[1., 2., 3., 4., 5., 6.], [7., 8., 9., 10., 11., 12.]]).astype(np.float32) node = onnx.helper.make_node( 'Split', inputs=['input'], outputs=['output_1', 'output_2'], axis=1 ) expected_outputs = [np.array([[1., 2., 3.], [7., 8., 9.]]).astype(np.float32), np.array([[4., 5., 6.], [10., 11., 12.]]).astype(np.float32)] expect(node, inputs=[input], outputs=[y for y in expected_outputs], name='test_split_equal_parts_2d') split = np.array([2, 4]).astype(np.int64) node = onnx.helper.make_node( 'Split', inputs=['input', 'split'], outputs=['output_1', 'output_2'], axis=1, ) expected_outputs = [np.array([[1., 2.], [7., 8.]]).astype(np.float32), np.array([[3., 4., 5., 6.], [9., 10., 11., 12.]]).astype(np.float32)] expect(node, inputs=[input, split], outputs=[y for y in expected_outputs], name='test_split_variable_parts_2d') @staticmethod def export_default_values() -> None: input = np.array([1., 2., 3., 4., 5., 6.]).astype(np.float32) # If axis is not specified, split is applied on default axis 0 node = onnx.helper.make_node( 'Split', inputs=['input'], outputs=['output_1', 'output_2', 'output_3'] ) expected_outputs = [np.array([1., 2.]).astype(np.float32), np.array([3., 4.]).astype(np.float32), np.array([5., 6.]).astype(np.float32)] expect(node, inputs=[input], outputs=[y for y in expected_outputs], name='test_split_equal_parts_default_axis') split = np.array([2, 4]).astype(np.int64) node = onnx.helper.make_node( 'Split', inputs=['input', 'split'], outputs=['output_1', 'output_2'] ) expected_outputs = [np.array([1., 2.]).astype(np.float32), np.array([3., 4., 5., 6.]).astype(np.float32)] expect(node, inputs=[input, split], outputs=[y for y in expected_outputs], name='test_split_variable_parts_default_axis') @staticmethod def export_zero_size_splits() -> None: input = np.array([]).astype(np.float32) # Split emtpy tensor to tensors of size zero split = np.array([0, 0, 0]).astype(np.int64) node = onnx.helper.make_node( 'Split', inputs=['input', 'split'], outputs=['output_1', 'output_2', 'output_3'] ) expected_outputs = [np.array([]).astype(np.float32), np.array([]).astype(np.float32), np.array([]).astype(np.float32)] expect(node, inputs=[input, split], outputs=[y for y in expected_outputs], name='test_split_zero_size_splits')

37.9

144

0.565843

548

4,169

4.133212

0.144161

0.077263

0.139073

0.075055

0.778366

0.758499

0.754967

0.743488

0

0.054786

0.255697

4,169

109

145

38.247706

0.675153

0.03646

0

0.481481

0

0.107677

0.051346

0

1

0.049383

false

0

0.098765

0

0.160494

0.012346

0

null

0

1

0

null

0

5

72e1ba374984c2a3db2af7d5b68d0e69c20fcc75

179

py

Python

aqa_assembly_simulator/helpers/Exceptions.py

johnyob/aqa-assembly-simulator

c885b842ed873c8d1a1a807439d281fc27762ad4

[ "MIT" ]

1

2022-01-10T03:46:34.000Z

aqa_assembly_simulator/helpers/Exceptions.py

johnyob/aqa-assembly-simulator

c885b842ed873c8d1a1a807439d281fc27762ad4

[ "MIT" ]

null

aqa_assembly_simulator/helpers/Exceptions.py

johnyob/aqa-assembly-simulator

c885b842ed873c8d1a1a807439d281fc27762ad4

[ "MIT" ]

null

class AssemblySimulatorVMConfigException(Exception): def __str__(self): return "[ERROR] Error: AssemblySimulatorConfigError, Response: {0}".format(super().__str__())

35.8

101

0.743017

15

179

8.333333

0.866667

0

0.00641

0.128492

179

4

102

44.75

0.794872

0

0.324022

0.162011

0

1

0.333333

false

0

0.333333

1

0

1

0

null

0

1

0

null

0

1

0

1

0

5

f42d3b6c2e72870f9686e5e73de8ef7bb4fa72b5

25,344

py

Python

Code/binarytree.py

nickKearns/cs1.3

da262ce411d67ae93e312e3211b3aade9e253b2d

[ "MIT" ]

null

Code/binarytree.py

nickKearns/cs1.3

da262ce411d67ae93e312e3211b3aade9e253b2d

[ "MIT" ]

5

2020-02-17T23:59:26.000Z

2020-03-10T20:45:22.000Z

Code/binarytree.py

nickKearns/cs1.3

da262ce411d67ae93e312e3211b3aade9e253b2d

[ "MIT" ]

null

#!python class BinaryTreeNode(object): def __init__(self, data): """Initialize this binary tree node with the given data.""" self.data = data self.left = None self.right = None def __repr__(self): """Return a string representation of this binary tree node.""" return 'BinaryTreeNode({!r})'.format(self.data) def is_leaf(self): """Return True if this node is a leaf (has no children).""" # TODO: Check if both left child and right child have no value return self.left is None and self.right is None def is_branch(self): """Return True if this node is a branch (has at least one child).""" # TODO: Check if either left child or right child has a value return self.left is not None or self.right is not None def height(self): """Return the height of this node (the number of edges on the longest downward path from this node to a descendant leaf node). TODO: Best and worst case running time: ??? under what conditions? best and worst case run time are both O(n) because the height function is being called on every node so every node is being checked for its height. This is a recursive call on every node so it is O(n) """ # TODO: Check if left child has a value and if so calculate its height left_height = 0 right_height = 0 if self.left: left_height = self.left.height() + 1 # TODO: Check if right child has a value and if so calculate its height if self.right: right_height = self.right.height() + 1 # Return one more than the greater of the left height and right height return max(left_height, right_height) class BinarySearchTree(object): def __init__(self, items=None): """Initialize this binary search tree and insert the given items.""" self.root = None self.size = 0 if items is not None: for item in items: self.insert(item) def __repr__(self): """Return a string representation of this binary search tree.""" return 'BinarySearchTree({} nodes)'.format(self.size) def is_empty(self): """Return True if this binary search tree is empty (has no nodes).""" return self.root is None def height(self): """Return the height of this tree (the number of edges on the longest downward path from this tree's root node to a descendant leaf node). TODO: Best and worst case running time: ??? under what conditions? run time is always O(n) because the height function is being called on the root node and the time complexity of the node classes height function is O(n) """ # TODO: Check if root node has a value and if so calculate its height if self.root: return self.root.height() def contains(self, item): """Return True if this binary search tree contains the given item. TODO: Best case running time: ??? under what conditions? TODO: Worst case running time: ??? under what conditions? best case run time is O(1) and that would be when the item being searched for is the root node worst case run time is O(n) and that would be when what is being searched for is not in the tree or it is in the last node that is searched """ # Find a node with the given item, if any # node = self._find_node_iterative(item) node = self._find_node_recursive(item, self.root) # Return True if a node was found, or False return node is not None def search(self, item): """Return an item in this binary search tree matching the given item, or None if the given item is not found. TODO: Best case running time: ??? under what conditions? TODO: Worst case running time: ??? under what conditions? best case run time is O(1) and that would be when the item being searched for is the root node worst case run time is O(n) and that would be when what is being searched for is not in the tree or it is in the last node that is searched """ # Find a node with the given item, if any # node = self._find_node_iterative(item) node = self._find_node_recursive(item, self.root) # TODO: Return the node's data if found, or None if node is not None: return node.data else: return None def insert(self, item): """Insert the given item in order into this binary search tree. TODO: Best case running time: ??? under what conditions? TODO: Worst case running time: ??? under what conditions? Best case run time is O(1) and that would be when the tree is empty so the item is placed as the root of the tree Worst case run time is O(h) where h is the height of the tree the entire tree is not traversed to enter the new item. Because of binary search the worst case is that this function searches down the longest section of the tree and inserts the new item there. """ # Handle the case where the tree is empty if self.is_empty(): # TODO: Create a new root node self.root = BinaryTreeNode(item) # TODO: Increase the tree size self.size += 1 return # Find the parent node of where the given item should be inserted # parent = self._find_parent_node_iterative(item) #uncomment for testing find parent node iterative parent = self._find_parent_node_recursive(item, self.root) # TODO: Check if the given item should be inserted left of parent node if item < parent.data: # TODO: Create a new node and set the parent's left child parent.left = BinaryTreeNode(item) # TODO: Check if the given item should be inserted right of parent node elif item > parent.data: # TODO: Create a new node and set the parent's right child parent.right = BinaryTreeNode(item) # TODO: Increase the tree size self.size += 1 def _find_node_iterative(self, item): """Return the node containing the given item in this binary search tree, or None if the given item is not found. Search is performed iteratively starting from the root node. TODO: Best case running time: ??? under what conditions? TODO: Worst case running time: ??? under what conditions? Best case run time is the item being searched for is the root so 1 iteration is required and the run time would be O(1) Worst case is O(h) where h is the height of the tree. Because of binary search this function will cut out more and more of the possibilities and the furthest it could go is the height of the tree """ # Start with the root node node = self.root # Loop until we descend past the closest leaf node while node is not None: # TODO: Check if the given item matches the node's data if item == node.data: # Return the found node return node # TODO: Check if the given item is less than the node's data elif item < node.data: # TODO: Descend to the node's left child node = node.left # TODO: Check if the given item is greater than the node's data elif item > node.data: # TODO: Descend to the node's right child node = node.right # Not found return None def _find_node_recursive(self, item, node): """Return the node containing the given item in this binary search tree, or None if the given item is not found. Search is performed recursively starting from the given node (give the root node to start recursion). TODO: Best case running time: ??? under what conditions? TODO: Worst case running time: ??? under what conditions? Best case run time is the item being searched for is the root so only 1 call is required and there would be no recursive calls so the run time would be O(1) Worst case is O(h) where h is the height of the tree. Because of binary search this function will cut out more and more of the possibilities and the furthest it could go is the height of the tree """ # Check if starting node exists if node is None: # Not found (base case) return None # TODO: Check if the given item matches the node's data elif node.data == item: # Return the found node return node # TODO: Check if the given item is less than the node's data elif item < node.data: # TODO: Recursively descend to the node's left child, if it exists if node.left is not None: return self._find_node_recursive(item, node.left) # TODO: Check if the given item is greater than the node's data else: # TODO: Recursively descend to the node's right child, if it exists return self._find_node_recursive(item, node.right) def _find_parent_node_iterative(self, item): """Return the parent node of the node containing the given item (or the parent node of where the given item would be if inserted) in this tree, or None if this tree is empty or has only a root node. Search is performed iteratively starting from the root node. TODO: Best case running time: ??? under what conditions? TODO: Worst case running time: ??? under what conditions? Best case run time is the item being searched for is the root so 1 iteration is required and the run time would be O(1) Worst case is O(h) where h is the height of the tree. Because of binary search this function will cut out more and more of the possibilities and the furthest it could go is the height of the tree """ # Start with the root node and keep track of its parent node = self.root parent = None # Loop until we descend past the closest leaf node while node is not None: # TODO: Check if the given item matches the node's data if item == node.data: # Return the parent of the found node return parent # TODO: Check if the given item is less than the node's data elif item < node.data: # TODO: Update the parent and descend to the node's left child parent = node node = node.left # TODO: Check if the given item is greater than the node's data elif item > node.data: # TODO: Update the parent and descend to the node's right child parent = node node = node.right # Not found return parent def _find_parent_node_recursive(self, item, node, parent=None): """Return the parent node of the node containing the given item (or the parent node of where the given item would be if inserted) in this tree, or None if this tree is empty or has only a root node. Search is performed recursively starting from the given node (give the root node to start recursion). Best case run time is the item being searched for is the root so only 1 call is required and there would be no recursive calls so the run time would be O(1) Worst case is O(h) where h is the height of the tree. Because of binary search this function will cut out more and more of the possibilities and the furthest it could go is the height of the tree """ # Check if starting node exists if node is None: # Not found (base case) return None # TODO: Check if the given item matches the node's data if item == node.data: # Return the parent of the found node return parent # TODO: Check if the given item is less than the node's data elif item < node.data: # TODO: Recursively descend to the node's left child, if it exists if node.left is not None: return self._find_parent_node_recursive(item, node.left, node) # Hint: Remember to update the parent parameter # TODO: Check if the given item is greater than the node's data elif item > node.data: # TODO: Recursively descend to the node's right child, if it exists if node.right is not None: return self._find_parent_node_recursive(item, node.right, node) # Hint: Remember to update the parent parameter return node def num_children(self, node): if node.left is None and node.right is None: return 0 if node.left is not None and node.right is not None: return 2 else: return 1 def delete(self, item): """Remove given item from this tree, if present, or raise ValueError. TODO: Best case running time: ??? under what conditions? TODO: Worst case running time: ??? under what conditions?""" # TODO: Use helper methods and break this algorithm down into 3 cases # based on how many children the node containing the given item has and # implement new helper methods for subtasks of the more complex cases # node = self._find_node_recursive(item) # parent_node = self._find_parent_node_recursive(item, node) # num_children = self.num_children(node) # if num_children == 0: # if node.data < parent_node.data: # parent_node.left = None # elif node.data > parent_node.data: # parent_node.right = None # elif num_children == 1: def items_in_order(self): """Return an in-order list of all items in this binary search tree.""" items = [] if not self.is_empty(): # Traverse tree in-order from root, appending each node's item self._traverse_in_order_recursive(self.root, items.append) # Return in-order list of all items in tree return items def _traverse_in_order_recursive(self, node, visit): """Traverse this binary tree with recursive in-order traversal (DFS). Start at the given node and visit each node with the given function. TODO: Running time: ??? Why and under what conditions? O(n) although there are a few constant time operations done for each node the time complexity is mostly dependent on the number (n) of nodes in the tree TODO: Memory usage: ??? Why and under what conditions? O(log2(n)) space complexity because python is created a call stack to handle the recursive calls. Therefore a stack is taking up memory usage. The space complexity is O(log2(n)) because the largest the stack can ever be is the height of the longest branch. The way it works recursively is that it travels down to the left as far as it can and then it starts to go back so within the stack there will never be nodes that are on the depth as each other. It will only ever go from node to child node and back. And the height of the tree can be described as log2(n) because the tree grows exponetially with each generation (if it is a well balanced tree) so the way to determine how many nodes would be in a single traversal down the tree would be the opposite of exponential which is logarithm. """ # TODO: Traverse left subtree, if it exists if node.left is not None: self._traverse_in_order_recursive(node.left, visit) # TODO: Visit this node's data with given function visit(node.data) # TODO: Traverse right subtree, if it exists if node.right is not None: self._traverse_in_order_recursive(node.right, visit) def _traverse_in_order_iterative(self, node, visit): """Traverse this binary tree with iterative in-order traversal (DFS). Start at the given node and visit each node with the given function. TODO: Running time: ??? Why and under what conditions? TODO: Memory usage: ??? Why and under what conditions?""" # TODO: Traverse in-order without using recursion (stretch challenge) def items_pre_order(self): """Return a pre-order list of all items in this binary search tree.""" items = [] if not self.is_empty(): # Traverse tree pre-order from root, appending each node's item self._traverse_pre_order_recursive(self.root, items.append) # Return pre-order list of all items in tree return items def _traverse_pre_order_recursive(self, node, visit): """Traverse this binary tree with recursive pre-order traversal (DFS). Start at the given node and visit each node with the given function. TODO: Running time: ??? Why and under what conditions? O(n) although there are a few constant time operations done for each node the time complexity is mostly dependent on the number (n) of nodes in the tree O(log2(n)) space complexity because python is created a call stack to handle the recursive calls. Therefore a stack is taking up memory usage. The space complexity is O(log2(n)) because the largest the stack can ever be is the height of the longest branch. The way it works recursively is that it travels down to the left as far as it can and then it starts to go back so within the stack there will never be nodes that are on the depth as each other. It will only ever go from node to child node and back. And the height of the tree can be described as log2(n) because the tree grows exponetially with each generation (if it is a well balanced tree) so the way to determine how many nodes would be in a single traversal down the tree would be the opposite of exponential which is logarithm. TODO: Memory usage: ??? Why and under what conditions? """ # TODO: Visit this node's data with given function visit(node.data) # TODO: Traverse left subtree, if it exists if node.left is not None: self._traverse_pre_order_recursive(node.left, visit) # TODO: Traverse right subtree, if it exists if node.right is not None: self._traverse_pre_order_recursive(node.right, visit) def _traverse_pre_order_iterative(self, node, visit): """Traverse this binary tree with iterative pre-order traversal (DFS). Start at the given node and visit each node with the given function. TODO: Running time: ??? Why and under what conditions? TODO: Memory usage: ??? Why and under what conditions?""" # TODO: Traverse pre-order without using recursion (stretch challenge) def items_post_order(self): """Return a post-order list of all items in this binary search tree.""" items = [] if not self.is_empty(): # Traverse tree post-order from root, appending each node's item self._traverse_post_order_recursive(self.root, items.append) # Return post-order list of all items in tree return items def _traverse_post_order_recursive(self, node, visit): """Traverse this binary tree with recursive post-order traversal (DFS). Start at the given node and visit each node with the given function. TODO: Running time: ??? Why and under what conditions? O(n) although there are a few constant time operations done for each node the time complexity is mostly dependent on the number (n) of nodes in the tree TODO: Memory usage: ??? Why and under what conditions? O(log2(n)) space complexity because python is created a call stack to handle the recursive calls. Therefore a stack is taking up memory usage. The space complexity is O(log2(n)) because the largest the stack can ever be is the height of the longest branch. The way it works recursively is that it travels down to the left as far as it can and then it starts to go back so within the stack there will never be nodes that are on the depth as each other. It will only ever go from node to child node and back. And the height of the tree can be described as log2(n) because the tree grows exponetially with each generation (if it is a well balanced tree) so the way to determine how many nodes would be in a single traversal down the tree would be the opposite of exponential which is logarithm. """ # TODO: Traverse left subtree, if it exists if node.left is not None: self._traverse_post_order_recursive(node.left, visit) # TODO: Traverse right subtree, if it exists if node.right is not None: self._traverse_post_order_recursive(node.right, visit) # TODO: Visit this node's data with given function visit(node.data) def _traverse_post_order_iterative(self, node, visit): """Traverse this binary tree with iterative post-order traversal (DFS). Start at the given node and visit each node with the given function. TODO: Running time: ??? Why and under what conditions? TODO: Memory usage: ??? Why and under what conditions?""" # TODO: Traverse post-order without using recursion (stretch challenge) def items_level_order(self): """Return a level-order list of all items in this binary search tree.""" items = [] if not self.is_empty(): # Traverse tree level-order from root, appending each node's item self._traverse_level_order_iterative(self.root, items.append) # Return level-order list of all items in tree return items def _traverse_level_order_iterative(self, start_node, visit): """Traverse this binary tree with iterative level-order traversal (BFS). Start at the given node and visit each node with the given function. TODO: Running time: ??? Why and under what conditions? the time complexity of this function is O(n) because each node is only being visited once, which takes constant time. But more accurately the number of constant time visits is equal to the number of nodes we have in our tree so there will always be n visits so the time complexity is O(n) TODO: Memory usage: ??? Why and under what conditions? memory usage depends on the size of the queue so memory usage would be O(n) because the sum of the queue's length over time will only ever have the total number of entries in the tree, which is n """ # TODO: Create queue to store nodes not yet traversed in level-order queue = [] # TODO: Enqueue given starting node queue.append(start_node) # TODO: Loop until queue is empty while len(queue) > 0: # TODO: Dequeue node at front of queue node = queue.pop(0) # TODO: Visit this node's data with given function visit(node.data) # TODO: Enqueue this node's left child, if it exists if node.left is not None: queue.append(node.left) # TODO: Enqueue this node's right child, if it exists if node.right is not None: queue.append(node.right) def test_binary_search_tree(): # Create a complete binary search tree of 3, 7, or 15 items in level-order # items = [2, 1, 3] items = [4, 2, 6, 1, 3, 5, 7] # items = [8, 4, 12, 2, 6, 10, 14, 1, 3, 5, 7, 9, 11, 13, 15] print('items: {}'.format(items)) tree = BinarySearchTree() print('tree: {}'.format(tree)) print('root: {}'.format(tree.root)) print('\nInserting items:') for item in items: tree.insert(item) print('insert({}), size: {}'.format(item, tree.size)) print('root: {}'.format(tree.root)) print('\nSearching for items:') for item in items: result = tree.search(item) print('search({}): {}'.format(item, result)) item = 123 result = tree.search(item) print('search({}): {}'.format(item, result)) print('\nTraversing items:') print('items in-order: {}'.format(tree.items_in_order())) print('items pre-order: {}'.format(tree.items_pre_order())) print('items post-order: {}'.format(tree.items_post_order())) print('items level-order: {}'.format(tree.items_level_order())) if __name__ == '__main__': test_binary_search_tree()

46.248175

128

0.636482

3,750

25,344

4.2496

0.081333

0.024096

0.035768

0.014935

0.78376

0.760417

0.734187

0.706325

0.680723

0.655371

0

0.004136

0.303504

25,344

547

129

46.332724

0.898652

0.616832

0

0.434066

0

0.03441

0

0.078611

0

1

0.164835

false

0

0.346154

0.076923

0

null

0

1

0

1

0

null

0

1

0

5

f468ee9aaf1d321510b5d0960d2381ff4bc33e0c

63

py

Python

src/jobs_done10/__main__.py

prusse-martin/jobs_done10

2433bfda862278c699a0532a3b32c9d7d0acf9e3

[ "MIT" ]

21

2015-11-26T13:27:01.000Z

2022-01-11T03:17:54.000Z

src/jobs_done10/__main__.py

prusse-martin/jobs_done10

2433bfda862278c699a0532a3b32c9d7d0acf9e3

[ "MIT" ]

7

2018-08-31T16:00:52.000Z

2021-11-10T17:57:04.000Z

src/jobs_done10/__main__.py

prusse-martin/jobs_done10

2433bfda862278c699a0532a3b32c9d7d0acf9e3

[ "MIT" ]

7

2016-02-12T18:13:21.000Z

2020-06-09T15:15:24.000Z

from .cli import jobs_done jobs_done(prog_name='jobs_done')

10.5

32

0.777778

11

63

4.090909

0.636364

0.533333

0

0.126984

63

5

33

12.6

0.818182

0

0.147541

0

1

0

true

0

0.5

0

0.5

0

1

0

null

1

0

1

0

null

0

1

0

1

0

5

be587ba5ba5761a195d13335e9b69ad679879acc

49

py

Python

VacationPy/api_keys.py

tylerlvaughn/python-api-challenge

cb24e278c5a8c6ccc69a80881e63ad23172b8152

[ "ADSL" ]

null

VacationPy/api_keys.py

tylerlvaughn/python-api-challenge

cb24e278c5a8c6ccc69a80881e63ad23172b8152

[ "ADSL" ]

null

VacationPy/api_keys.py

tylerlvaughn/python-api-challenge

cb24e278c5a8c6ccc69a80881e63ad23172b8152

[ "ADSL" ]

null

g_key = "AIzaSyBapD8sVxvH-3Xpc_bxcWG0Z4Mb6ueSjuY"

49

0.877551

5

49

8.2

1

0

0.106383

0.040816

49

1

49

0.765957

0

0.78

0

1

0

false

0

1

0

null

0

1

0

1

null

0

5

be7068c0883ca70b6630e889563d42f24684a880

197

py

Python

tmt/__init__.py

navtom/tmt

e133930a85aaa133b32f1e02eee245e7b27b62f3

[ "MIT" ]

null

tmt/__init__.py

navtom/tmt

e133930a85aaa133b32f1e02eee245e7b27b62f3

[ "MIT" ]

null

tmt/__init__.py

navtom/tmt

e133930a85aaa133b32f1e02eee245e7b27b62f3

[ "MIT" ]

null

""" Test Management Tool """ from tmt.base import Tree, Test, Plan, Story, Run, Result from tmt.steps.provision import Guest __all__ = ['Tree', 'Test', 'Plan', 'Story', 'Run', 'Guest', 'Result']

28.142857

69

0.664975

27

197

4.703704

0.592593

0.110236

0.188976

0.267717

0.314961

0

0.147208

197

6

70

32.833333

0.755952

0.101523

0

0.183432

0

1

0

false

0

0.666667

0

0.666667

0

1

0

null

0

1

0

1

0

null

0

1

0

5

be7927973cdcfe2a5d2db6cc6bcd1a509bf0abc2

287

py

Python

swine/input/__init__.py

DeflatedPickle/swine

28b40fff605f7ed9c006e032c11a5ff9c552ebac

[ "MIT" ]

4

2019-07-14T13:39:43.000Z

2021-11-08T15:57:17.000Z

swine/input/__init__.py

SwineEngine/swine

28b40fff605f7ed9c006e032c11a5ff9c552ebac

[ "MIT" ]

1

2018-08-24T13:38:02.000Z

2018-08-28T19:19:55.000Z

swine/input/__init__.py

SwineProject/swine

28b40fff605f7ed9c006e032c11a5ff9c552ebac

[ "MIT" ]

1

2018-07-22T20:53:10.000Z

#!/usr/bin/env python # -*- coding: utf-8 -*- from .empty_controller import EmptyController from .xbox_controller import XBoxController from .playstation_controller import PlayStationController from .gamecube_controller import GameCubeController from .input_manager import InputManager

31.888889

57

0.836237

32

287

7.34375

0.65625

0.27234

0

0.003861

0.097561

287

8

58

35.875

0.903475

0.146341

0

1

0

true

0

1

0

1

0

null

1

0

1

0

null

0

1

0

1

0

1

0

5

fe20f9a28012b6a5cfbbfbb95c9fab52911638bd

296

py

Python

pacos2/discr_impulse.py

jadnohra/PaCoS

0b97cf566d89d99f85c55581beb9ad701395d4fe

[ "MIT" ]

null

pacos2/discr_impulse.py

jadnohra/PaCoS

0b97cf566d89d99f85c55581beb9ad701395d4fe

[ "MIT" ]

null

pacos2/discr_impulse.py

jadnohra/PaCoS

0b97cf566d89d99f85c55581beb9ad701395d4fe

[ "MIT" ]

null

from abc import ABC, abstractmethod from .interfaces import TimeInterval, IClock from .discr_evt_engine import DiscreteEventEngine class IDiscreteImpulse(ABC): @abstractmethod def generate(self, engine: DiscreteEventEngine, clock: IClock ) -> TimeInterval: pass

29.6

65

0.736486

29

296

7.448276

0.62069

0.157407

0

0.206081

296

10

66

29.6

0.919149

0

1

0

1

0.125

false

0.125

0.375

0

0.625

0

1

0

null

0

1

0

null

0

1

0

1

0

5

fe31cd82d51627aff2f9008f4e1e27a4b1279b8a

93

py

Python

pbesa/engine/rational/__init__.py

scottwedge/pbesa

21b161538aa0c508088dc47a3a88413b6fd6504d

[ "MIT" ]

2

2020-10-22T22:23:40.000Z

2021-09-14T01:18:01.000Z

pbesa/engine/rational/__init__.py

scottwedge/pbesa

21b161538aa0c508088dc47a3a88413b6fd6504d

[ "MIT" ]

2

2020-05-27T13:59:42.000Z

2022-03-02T14:58:12.000Z

pbesa/engine/rational/__init__.py

scottwedge/pbesa

21b161538aa0c508088dc47a3a88413b6fd6504d

[ "MIT" ]

1

2020-05-27T13:50:40.000Z

from .ActionExe import ActionExe from .Brain import Brain from .RationalAg import RationalAg

23.25

34

0.83871

12

93

6.5

0.416667

0

0.129032

93

3

35

31

0.962963

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

fe5f22ed5aae68d57c53a88aff1e0ea109422d13

235

py

Python

keras_bert/layers/__init__.py

DanielWeidinger/DocNet

77be87e8f944dc38e415ce15069ebd6cb5212490

[ "MIT" ]

421

2019-05-19T04:09:15.000Z

2022-03-31T07:48:20.000Z

keras_bert/layers/__init__.py

DanielWeidinger/DocNet

77be87e8f944dc38e415ce15069ebd6cb5212490

[ "MIT" ]

32

2019-06-24T15:56:31.000Z

2022-02-10T00:12:43.000Z

keras_bert/layers/__init__.py

DanielWeidinger/DocNet

77be87e8f944dc38e415ce15069ebd6cb5212490

[ "MIT" ]

126

2019-05-19T10:59:55.000Z

2022-03-11T09:22:42.000Z

from .inputs import get_inputs from .embedding import get_embedding, TokenEmbedding, EmbeddingSimilarity from .masked import Masked from .extract import Extract from .pooling import MaskedGlobalMaxPool1D from .conv import MaskedConv1D

33.571429

73

0.855319

28

235

7.107143

0.464286

0.090452

0

0.009569

0.110638

235

6

74

39.166667

0.942584

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

fe5fda0182f08ea07f31e65034755d5820f2e8e7

210

py

Python

BaseStat.py

e-ivanov/monitoring_agent

f0a554dad6c2e8b1eabdc8ae54a9fd6a24f4e1f2

[ "Apache-2.0" ]

null

BaseStat.py

e-ivanov/monitoring_agent

f0a554dad6c2e8b1eabdc8ae54a9fd6a24f4e1f2

[ "Apache-2.0" ]

null

BaseStat.py

e-ivanov/monitoring_agent

f0a554dad6c2e8b1eabdc8ae54a9fd6a24f4e1f2

[ "Apache-2.0" ]

null

import os from abc import abstractmethod import sqlite3 class BaseStat: def __init__(self): pass @abstractmethod def get_threshhold_value(self): """not implemented error"""

11.052632

35

0.666667

23

210

5.826087

0.782609

0

0.006494

0.266667

210

18

36

11.666667

0.863636

0.1

0

1

0.25

false

0.125

0.375

0

0.75

0

1

0

null

0

null

0

1

0

1

0

1

0

5

fe61811680f7a6cf06534745cb77a436277efdc1

101

py

Python

flask_tuktuk/helpers/__init__.py

aromanovich/flask-tuktuk

5b65302654c8c09c512ef48b78609088de1309af

[ "BSD-3-Clause" ]

null

flask_tuktuk/helpers/__init__.py

aromanovich/flask-tuktuk

5b65302654c8c09c512ef48b78609088de1309af

[ "BSD-3-Clause" ]

null

flask_tuktuk/helpers/__init__.py

aromanovich/flask-tuktuk

5b65302654c8c09c512ef48b78609088de1309af

[ "BSD-3-Clause" ]

null

# coding: utf-8 from __future__ import unicode_literals from .util import DotExpandedDict, Attribute

25.25

44

0.831683

13

101

6.076923

0.846154

0

0.011236

0.118812

101

4

44

25.25

0.876404

0.128713

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

fe6fe7dbec6f29644f6a46fd73f249a3a9299c58

63

py

Python

katas/kyu_7/triangular_treasure.py

the-zebulan/CodeWars

1eafd1247d60955a5dfb63e4882e8ce86019f43a

[ "MIT" ]

40

2016-03-09T12:26:20.000Z

2022-03-23T08:44:51.000Z

katas/kyu_7/triangular_treasure.py

akalynych/CodeWars

1eafd1247d60955a5dfb63e4882e8ce86019f43a

[ "MIT" ]

null

katas/kyu_7/triangular_treasure.py

akalynych/CodeWars

1eafd1247d60955a5dfb63e4882e8ce86019f43a

[ "MIT" ]

36

2016-11-07T19:59:58.000Z

2022-03-31T11:18:27.000Z

def triangular(n): return n * (n + 1) / 2 if n >= 0 else 0

21

43

0.52381

13

63

2.538462

0.692308

0

0.093023

0.31746

63

2

44

31.5

0.674419

0

1

0.5

false

0

0.5

1

0

1

0

null

0

1

0

null

0

1

0

1

0

5

fe7412dc6948ac7bfbd7f8f76f5439e900f12f81

69,635

py

Python

bob/euler.py

JashanPruthi/saviour-1

4a276b6970df496c539d81a9c8a946b747d00fdf

[ "MIT" ]

null

bob/euler.py

JashanPruthi/saviour-1

4a276b6970df496c539d81a9c8a946b747d00fdf

[ "MIT" ]

null

bob/euler.py

JashanPruthi/saviour-1

4a276b6970df496c539d81a9c8a946b747d00fdf

[ "MIT" ]

2

2020-07-26T19:38:14.000Z

2020-07-27T17:13:32.000Z

# -*- coding: utf-8 -*- """ Created on Sun Jul 26 03:19:29 2020 @author: Legedith """ def euler_problem(): problems = {1: 'Problem 1: Multiples of 3 and 5:\nIf we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.\n\nFind the sum of all the multiples of 3 or 5 below 1000.\n\n', 2: 'Problem 2: Even Fibonacci numbers:\nEach new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:\n\n1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...\n\nBy considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.\n\n', 3: 'Problem 3: Largest prime factor:\nThe prime factors of 13195 are 5, 7, 13 and 29.\n\nWhat is the largest prime factor of the number 600851475143 ?\n\n', 4: 'Problem 4: Largest palindrome product:\nA palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 Ã— 99.\n\nFind the largest palindrome made from the product of two 3-digit numbers.\n\n', 5: 'Problem 5: Smallest multiple:\n2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.\n\nWhat is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?\n\n', 6: 'Problem 6: Sum square difference:\nThe sum of the squares of the first ten natural numbers is,\n\n12+22+...+102=385\n\nThe square of the sum of the first ten natural numbers is,\n\n(1+2+...+10)2=552=3025\n\nHence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is \n3025âˆ’385=2640\n.\n\nFind the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.\n\n', 7: 'Problem 7: 10001st prime:\nBy listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.\n\nWhat is the 10 001st prime number?\n\n', 8: 'Problem 8: Largest product in a series:\nThe four adjacent digits in the 1000-digit number that have the greatest product are 9 Ã— 9 Ã— 8 Ã— 9 = 5832.\n\n73167176531330624919225119674426574742355349194934\n96983520312774506326239578318016984801869478851843\n85861560789112949495459501737958331952853208805511\n12540698747158523863050715693290963295227443043557\n66896648950445244523161731856403098711121722383113\n62229893423380308135336276614282806444486645238749\n30358907296290491560440772390713810515859307960866\n70172427121883998797908792274921901699720888093776\n65727333001053367881220235421809751254540594752243\n52584907711670556013604839586446706324415722155397\n53697817977846174064955149290862569321978468622482\n83972241375657056057490261407972968652414535100474\n82166370484403199890008895243450658541227588666881\n16427171479924442928230863465674813919123162824586\n17866458359124566529476545682848912883142607690042\n24219022671055626321111109370544217506941658960408\n07198403850962455444362981230987879927244284909188\n84580156166097919133875499200524063689912560717606\n05886116467109405077541002256983155200055935729725\n71636269561882670428252483600823257530420752963450\n\n\nFind the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?\n\n', 9: 'Problem 9: Special Pythagorean triplet:\nA Pythagorean triplet is a set of three natural numbers, a < b < c, for which,\n\na2 + b2 = c2\n\nFor example, 32 + 42 = 9 + 16 = 25 = 52.\n\nThere exists exactly one Pythagorean triplet for which a + b + c = 1000.\nFind the product abc.\n\n', 10: 'Problem 10: Summation of primes:\nThe sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.\n\nFind the sum of all the primes below two million.\n\n', 11: 'Problem 11: Largest product in a grid:\nIn the 20Ã—20 grid below, four numbers along a diagonal line have been marked in red.\n\n08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08\n49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00\n81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65\n52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91\n22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80\n24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50\n32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70\n67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21\n24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72\n21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95\n78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92\n16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57\n86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58\n19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40\n04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66\n88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69\n04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36\n20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16\n20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54\n01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48\n\n\nThe product of these numbers is 26 Ã— 63 Ã— 78 Ã— 14 = 1788696.\n\nWhat is the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20Ã—20 grid?\n\n', 12: 'Problem 12: Highly divisible triangular number:\nThe sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:\n\n1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...\n\nLet us list the factors of the first seven triangle numbers:\n\nÂ\xa01: 1\nÂ\xa03: 1,3\nÂ\xa06: 1,2,3,6\n10: 1,2,5,10\n15: 1,3,5,15\n21: 1,3,7,21\n28: 1,2,4,7,14,28\n\nWe can see that 28 is the first triangle number to have over five divisors.\n\nWhat is the value of the first triangle number to have over five hundred divisors?\n\n', 13: 'Problem 13: Large sum:\nWork out the first ten digits of the sum of the following one-hundred 50-digit numbers.\n\n37107287533902102798797998220837590246510135740250\n46376937677490009712648124896970078050417018260538\n74324986199524741059474233309513058123726617309629\n91942213363574161572522430563301811072406154908250\n23067588207539346171171980310421047513778063246676\n89261670696623633820136378418383684178734361726757\n28112879812849979408065481931592621691275889832738\n44274228917432520321923589422876796487670272189318\n47451445736001306439091167216856844588711603153276\n70386486105843025439939619828917593665686757934951\n62176457141856560629502157223196586755079324193331\n64906352462741904929101432445813822663347944758178\n92575867718337217661963751590579239728245598838407\n58203565325359399008402633568948830189458628227828\n80181199384826282014278194139940567587151170094390\n35398664372827112653829987240784473053190104293586\n86515506006295864861532075273371959191420517255829\n71693888707715466499115593487603532921714970056938\n54370070576826684624621495650076471787294438377604\n53282654108756828443191190634694037855217779295145\n36123272525000296071075082563815656710885258350721\n45876576172410976447339110607218265236877223636045\n17423706905851860660448207621209813287860733969412\n81142660418086830619328460811191061556940512689692\n51934325451728388641918047049293215058642563049483\n62467221648435076201727918039944693004732956340691\n15732444386908125794514089057706229429197107928209\n55037687525678773091862540744969844508330393682126\n18336384825330154686196124348767681297534375946515\n80386287592878490201521685554828717201219257766954\n78182833757993103614740356856449095527097864797581\n16726320100436897842553539920931837441497806860984\n48403098129077791799088218795327364475675590848030\n87086987551392711854517078544161852424320693150332\n59959406895756536782107074926966537676326235447210\n69793950679652694742597709739166693763042633987085\n41052684708299085211399427365734116182760315001271\n65378607361501080857009149939512557028198746004375\n35829035317434717326932123578154982629742552737307\n94953759765105305946966067683156574377167401875275\n88902802571733229619176668713819931811048770190271\n25267680276078003013678680992525463401061632866526\n36270218540497705585629946580636237993140746255962\n24074486908231174977792365466257246923322810917141\n91430288197103288597806669760892938638285025333403\n34413065578016127815921815005561868836468420090470\n23053081172816430487623791969842487255036638784583\n11487696932154902810424020138335124462181441773470\n63783299490636259666498587618221225225512486764533\n67720186971698544312419572409913959008952310058822\n95548255300263520781532296796249481641953868218774\n76085327132285723110424803456124867697064507995236\n37774242535411291684276865538926205024910326572967\n23701913275725675285653248258265463092207058596522\n29798860272258331913126375147341994889534765745501\n18495701454879288984856827726077713721403798879715\n38298203783031473527721580348144513491373226651381\n34829543829199918180278916522431027392251122869539\n40957953066405232632538044100059654939159879593635\n29746152185502371307642255121183693803580388584903\n41698116222072977186158236678424689157993532961922\n62467957194401269043877107275048102390895523597457\n23189706772547915061505504953922979530901129967519\n86188088225875314529584099251203829009407770775672\n11306739708304724483816533873502340845647058077308\n82959174767140363198008187129011875491310547126581\n97623331044818386269515456334926366572897563400500\n42846280183517070527831839425882145521227251250327\n55121603546981200581762165212827652751691296897789\n32238195734329339946437501907836945765883352399886\n75506164965184775180738168837861091527357929701337\n62177842752192623401942399639168044983993173312731\n32924185707147349566916674687634660915035914677504\n99518671430235219628894890102423325116913619626622\n73267460800591547471830798392868535206946944540724\n76841822524674417161514036427982273348055556214818\n97142617910342598647204516893989422179826088076852\n87783646182799346313767754307809363333018982642090\n10848802521674670883215120185883543223812876952786\n71329612474782464538636993009049310363619763878039\n62184073572399794223406235393808339651327408011116\n66627891981488087797941876876144230030984490851411\n60661826293682836764744779239180335110989069790714\n85786944089552990653640447425576083659976645795096\n66024396409905389607120198219976047599490197230297\n64913982680032973156037120041377903785566085089252\n16730939319872750275468906903707539413042652315011\n94809377245048795150954100921645863754710598436791\n78639167021187492431995700641917969777599028300699\n15368713711936614952811305876380278410754449733078\n40789923115535562561142322423255033685442488917353\n44889911501440648020369068063960672322193204149535\n41503128880339536053299340368006977710650566631954\n81234880673210146739058568557934581403627822703280\n82616570773948327592232845941706525094512325230608\n22918802058777319719839450180888072429661980811197\n77158542502016545090413245809786882778948721859617\n72107838435069186155435662884062257473692284509516\n20849603980134001723930671666823555245252804609722\n53503534226472524250874054075591789781264330331690\n\n\n', 14: 'Problem 14: Longest Collatz sequence:\nThe following iterative sequence is defined for the set of positive integers:\n\nn â†’ n/2 (n is even)\nn â†’ 3n + 1 (n is odd)\n\nUsing the rule above and starting with 13, we generate the following sequence:\n\n13 â†’ 40 â†’ 20 â†’ 10 â†’ 5 â†’ 16 â†’ 8 â†’ 4 â†’ 2 â†’ 1\n\nIt can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1.\n\nWhich starting number, under one million, produces the longest chain?\n\nNOTE: Once the chain starts the terms are allowed to go above one million.\n\n', 15: 'Problem 15: Lattice paths:\nStarting in the top left corner of a 2Ã—2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.\n\nHow many such routes are there through a 20Ã—20 grid?\n\n', 16: 'Problem 16: Power digit sum:\n215 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.\n\nWhat is the sum of the digits of the number 21000?\n\n', 17: 'Problem 17: Number letter counts:\nIf the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.\n\nIf all the numbers from 1 to 1000 (one thousand) inclusive were written out in words, how many letters would be used?\n\n\n\n\nNOTE: Do not count spaces or hyphens. For example, 342 (three hundred and forty-two) contains 23 letters and 115 (one hundred and fifteen) contains 20 letters. The use of "and" when writing out numbers is in compliance with British usage.\n\n', 18: 'Problem 18: Maximum path sum I:\nBy starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.\n\n3\n7 4\n2 4 6\n8 5 9 3\n\nThat is, 3 + 7 + 4 + 9 = 23.\n\nFind the maximum total from top to bottom of the triangle below:\n\n75\n95 64\n17 47 82\n18 35 87 10\n20 04 82 47 65\n19 01 23 75 03 34\n88 02 77 73 07 63 67\n99 65 04 28 06 16 70 92\n41 41 26 56 83 40 80 70 33\n41 48 72 33 47 32 37 16 94 29\n53 71 44 65 25 43 91 52 97 51 14\n70 11 33 28 77 73 17 78 39 68 17 57\n91 71 52 38 17 14 91 43 58 50 27 29 48\n63 66 04 68 89 53 67 30 73 16 69 87 40 31\n04 62 98 27 23 09 70 98 73 93 38 53 60 04 23\n\nNOTE: As there are only 16384 routes, it is possible to solve this problem by trying every route. However, Problem 67, is the same challenge with a triangle containing one-hundred rows; it cannot be solved by brute force, and requires a clever method! ;o)\n\n', 19: 'Problem 19: Counting Sundays:\nYou are given the following information, but you may prefer to do some research for yourself.\n\n1 Jan 1900 was a Monday.\nThirty days has September,\nApril, June and November.\nAll the rest have thirty-one,\nSaving February alone,\nWhich has twenty-eight, rain or shine.\nAnd on leap years, twenty-nine.\nA leap year occurs on any year evenly divisible by 4, but not on a century unless it is divisible by 400.\n\nHow many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)?\n\n', 20: 'Problem 20: Factorial digit sum:\nn! means n Ã— (n âˆ’ 1) Ã— ... Ã— 3 Ã— 2 Ã— 1\n\nFor example, 10! = 10 Ã— 9 Ã— ... Ã— 3 Ã— 2 Ã— 1 = 3628800,\nand the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27.\n\nFind the sum of the digits in the number 100!\n\n', 21: 'Problem 21: Amicable numbers:\nLet d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).\nIf d(a) = b and d(b) = a, where a â‰\xa0 b, then a and b are an amicable pair and each of a and b are called amicable numbers.\n\nFor example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.\n\nEvaluate the sum of all the amicable numbers under 10000.\n\n', 22: "Problem 22: Names scores:\nUsing names.txt (right click and 'Save Link/Target As...'), a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for each name, multiply this value by its alphabetical position in the list to obtain a name score.\n\nFor example, when the list is sorted into alphabetical order, COLIN, which is worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the list. So, COLIN would obtain a score of 938 Ã— 53 = 49714.\n\nWhat is the total of all the name scores in the file?\n\n", 23: 'Problem 23: Non-abundant sums:\nA perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number.\n\nA number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if this sum exceeds n.\n\nAs 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number that can be written as the sum of two abundant numbers is 24. By mathematical analysis, it can be shown that all integers greater than 28123 can be written as the sum of two abundant numbers. However, this upper limit cannot be reduced any further by analysis even though it is known that the greatest number that cannot be expressed as the sum of two abundant numbers is less than this limit.\n\nFind the sum of all the positive integers which cannot be written as the sum of two abundant numbers.\n\n', 24: 'Problem 24: Lexicographic permutations:\nA permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are:\n\n012Â\xa0 Â\xa0021Â\xa0 Â\xa0102Â\xa0 Â\xa0120Â\xa0 Â\xa0201Â\xa0 Â\xa0210\n\nWhat is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?\n\n', 25: 'Problem 25: 1000-digit Fibonacci number:\nThe Fibonacci sequence is defined by the recurrence relation:\n\nFn = Fnâˆ’1 + Fnâˆ’2, where F1 = 1 and F2 = 1.\n\nHence the first 12 terms will be:\n\nF1 = 1\nF2 = 1\nF3 = 2\nF4 = 3\nF5 = 5\nF6 = 8\nF7 = 13\nF8 = 21\nF9 = 34\nF10 = 55\nF11 = 89\nF12 = 144\n\nThe 12th term, F12, is the first term to contain three digits.\n\nWhat is the index of the first term in the Fibonacci sequence to contain 1000 digits?\n\n', 26: 'Problem 26: Reciprocal cycles:\nA unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:\n\n1/2\t=Â\xa0\t0.5\n1/3\t=Â\xa0\t0.(3)\n1/4\t=Â\xa0\t0.25\n1/5\t=Â\xa0\t0.2\n1/6\t=Â\xa0\t0.1(6)\n1/7\t=Â\xa0\t0.(142857)\n1/8\t=Â\xa0\t0.125\n1/9\t=Â\xa0\t0.(1)\n1/10\t=Â\xa0\t0.1\n\nWhere 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that 1/7 has a 6-digit recurring cycle.\n\nFind the value of d < 1000 for which 1/d contains the longest recurring cycle in its decimal fraction part.\n\n', 27: 'Problem 27: Quadratic primes:\nEuler discovered the remarkable quadratic formula:\n\nn2+n+41\n\nIt turns out that the formula will produce 40 primes for the consecutive integer values \n0â‰¤nâ‰¤39\n. However, when \nn=40,402+40+41=40(40+1)+41\n is divisible by 41, and certainly when \nn=41,412+41+41\n is clearly divisible by 41.\n\nThe incredible formula \nn2âˆ’79n+1601\n was discovered, which produces 80 primes for the consecutive values \n0â‰¤nâ‰¤79\n. The product of the coefficients, âˆ’79 and 1601, is âˆ’126479.\n\nConsidering quadratics of the form:\n\nn2+an+b\n, where \n|a|<1000\n and \n|b|â‰¤1000\n\n\n\nwhere \n|n|\n is the modulus/absolute value of \nn\n\ne.g. \n|11|=11\n and \n|âˆ’4|=4\n\nFind the product of the coefficients, \na\n and \nb\n, for the quadratic expression that produces the maximum number of primes for consecutive values of \nn\n, starting with \nn=0\n.\n\n', 28: 'Problem 28: Number spiral diagonals:\nStarting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral is formed as follows:\n\n21 22 23 24 25\n20 Â\xa07 Â\xa08 Â\xa09 10\n19 Â\xa06 Â\xa01 Â\xa02 11\n18 Â\xa05 Â\xa04 Â\xa03 12\n17 16 15 14 13\n\nIt can be verified that the sum of the numbers on the diagonals is 101.\n\nWhat is the sum of the numbers on the diagonals in a 1001 by 1001 spiral formed in the same way?\n\n', 29: 'Problem 29: Distinct powers:\nConsider all integer combinations of ab for 2 â‰¤ a â‰¤ 5 and 2 â‰¤ b â‰¤ 5:\n\n22=4, 23=8, 24=16, 25=32\n32=9, 33=27, 34=81, 35=243\n42=16, 43=64, 44=256, 45=1024\n52=25, 53=125, 54=625, 55=3125\n\n\nIf they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:\n\n4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125\n\nHow many distinct terms are in the sequence generated by ab for 2 â‰¤ a â‰¤ 100 and 2 â‰¤ b â‰¤ 100?\n\n', 30: 'Problem 30: Digit fifth powers:\nSurprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:\n\n1634 = 14 + 64 + 34 + 44\n8208 = 84 + 24 + 04 + 84\n9474 = 94 + 44 + 74 + 44\n\nAs 1 = 14 is not a sum it is not included.\n\nThe sum of these numbers is 1634 + 8208 + 9474 = 19316.\n\nFind the sum of all the numbers that can be written as the sum of fifth powers of their digits.\n\n', 31: 'Problem 31: Coin sums:\nIn the United Kingdom the currency is made up of pound (Â£) and pence (p). There are eight coins in general circulation:\n\n1p, 2p, 5p, 10p, 20p, 50p, Â£1 (100p), and Â£2 (200p).\n\nIt is possible to make Â£2 in the following way:\n\n1Ã—Â£1 + 1Ã—50p + 2Ã—20p + 1Ã—5p + 1Ã—2p + 3Ã—1p\n\nHow many different ways can Â£2 be made using any number of coins?\n\n', 32: 'Problem 32: Pandigital products:\nWe shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once; for example, the 5-digit number, 15234, is 1 through 5 pandigital.\n\nThe product 7254 is unusual, as the identity, 39 Ã— 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital.\n\nFind the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through 9 pandigital.\n\nHINT: Some products can be obtained in more than one way so be sure to only include it once in your sum.\n\n', 33: 'Problem 33: Digit cancelling fractions:\nThe fraction 49/98 is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that 49/98 = 4/8, which is correct, is obtained by cancelling the 9s.\n\nWe shall consider fractions like, 30/50 = 3/5, to be trivial examples.\n\nThere are exactly four non-trivial examples of this type of fraction, less than one in value, and containing two digits in the numerator and denominator.\n\nIf the product of these four fractions is given in its lowest common terms, find the value of the denominator.\n\n', 34: 'Problem 34: Digit factorials:\n145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.\n\nFind the sum of all numbers which are equal to the sum of the factorial of their digits.\n\nNote: as 1! = 1 and 2! = 2 are not sums they are not included.\n\n', 35: 'Problem 35: Circular primes:\nThe number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.\n\nThere are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.\n\nHow many circular primes are there below one million?\n\n', 36: 'Problem 36: Double-base palindromes:\nThe decimal number, 585 = 10010010012 (binary), is palindromic in both bases.\n\nFind the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.\n\n(Please note that the palindromic number, in either base, may not include leading zeros.)\n\n', 37: 'Problem 37: Truncatable primes:\nThe number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage: 3797, 797, 97, and 7. Similarly we can work from right to left: 3797, 379, 37, and 3.\n\nFind the sum of the only eleven primes that are both truncatable from left to right and right to left.\n\nNOTE: 2, 3, 5, and 7 are not considered to be truncatable primes.\n\n', 38: 'Problem 38: Pandigital multiples:\nTake the number 192 and multiply it by each of 1, 2, and 3:\n\n192 Ã— 1 = 192\n192 Ã— 2 = 384\n192 Ã— 3 = 576\n\nBy concatenating each product we get the 1 to 9 pandigital, 192384576. We will call 192384576 the concatenated product of 192 and (1,2,3)\n\nThe same can be achieved by starting with 9 and multiplying by 1, 2, 3, 4, and 5, giving the pandigital, 918273645, which is the concatenated product of 9 and (1,2,3,4,5).\n\nWhat is the largest 1 to 9 pandigital 9-digit number that can be formed as the concatenated product of an integer with (1,2, ... , n) where n > 1?\n\n', 39: 'Problem 39: Integer right triangles:\nIf p is the perimeter of a right angle triangle with integral length sides, {a,b,c}, there are exactly three solutions for p = 120.\n\n{20,48,52}, {24,45,51}, {30,40,50}\n\nFor which value of p â‰¤ 1000, is the number of solutions maximised?\n\n', 40: "Problem 40: Champernowne's constant:\nAn irrational decimal fraction is created by concatenating the positive integers:\n\n0.123456789101112131415161718192021...\n\nIt can be seen that the 12th digit of the fractional part is 1.\n\nIf dn represents the nth digit of the fractional part, find the value of the following expression.\n\nd1 Ã— d10 Ã— d100 Ã— d1000 Ã— d10000 Ã— d100000 Ã— d1000000\n\n", 41: 'Problem 41: Pandigital prime:\nWe shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime.\n\nWhat is the largest n-digit pandigital prime that exists?\n\n', 42: "Problem 42: Coded triangle numbers:\nThe nth term of the sequence of triangle numbers is given by, tn = Â½n(n+1); so the first ten triangle numbers are:\n\n1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...\n\nBy converting each letter in a word to a number corresponding to its alphabetical position and adding these values we form a word value. For example, the word value for SKY is 19 + 11 + 25 = 55 = t10. If the word value is a triangle number then we shall call the word a triangle word.\n\nUsing words.txt (right click and 'Save Link/Target As...'), a 16K text file containing nearly two-thousand common English words, how many are triangle words?\n\n", 43: 'Problem 43: Sub-string divisibility:\nThe number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property.\n\nLet d1 be the 1st digit, d2 be the 2nd digit, and so on. In this way, we note the following:\n\nd2d3d4=406 is divisible by 2\nd3d4d5=063 is divisible by 3\nd4d5d6=635 is divisible by 5\nd5d6d7=357 is divisible by 7\nd6d7d8=572 is divisible by 11\nd7d8d9=728 is divisible by 13\nd8d9d10=289 is divisible by 17\n\nFind the sum of all 0 to 9 pandigital numbers with this property.\n\n', 44: 'Problem 44: Pentagon numbers:\nPentagonal numbers are generated by the formula, Pn=n(3nâˆ’1)/2. The first ten pentagonal numbers are:\n\n1, 5, 12, 22, 35, 51, 70, 92, 117, 145, ...\n\nIt can be seen that P4 + P7 = 22 + 70 = 92 = P8. However, their difference, 70 âˆ’ 22 = 48, is not pentagonal.\n\nFind the pair of pentagonal numbers, Pj and Pk, for which their sum and difference are pentagonal and D = |Pk âˆ’ Pj| is minimised; what is the value of D?\n\n', 45: 'Problem 45: Triangular, pentagonal, and hexagonal:\nTriangle, pentagonal, and hexagonal numbers are generated by the following formulae:\n\nTriangle\tÂ\xa0\tTn=n(n+1)/2\tÂ\xa0\t1, 3, 6, 10, 15, ...\nPentagonal\tÂ\xa0\tPn=n(3nâˆ’1)/2\tÂ\xa0\t1, 5, 12, 22, 35, ...\nHexagonal\tÂ\xa0\tHn=n(2nâˆ’1)\tÂ\xa0\t1, 6, 15, 28, 45, ...\n\nIt can be verified that T285 = P165 = H143 = 40755.\n\nFind the next triangle number that is also pentagonal and hexagonal.\n\n', 46: "Problem 46: Goldbach's other conjecture:\nIt was proposed by Christian Goldbach that every odd composite number can be written as the sum of a prime and twice a square.\n\n9 = 7 + 2Ã—12\n15 = 7 + 2Ã—22\n21 = 3 + 2Ã—32\n25 = 7 + 2Ã—32\n27 = 19 + 2Ã—22\n33 = 31 + 2Ã—12\n\nIt turns out that the conjecture was false.\n\nWhat is the smallest odd composite that cannot be written as the sum of a prime and twice a square?\n\n", 47: 'Problem 47: Distinct primes factors:\nThe first two consecutive numbers to have two distinct prime factors are:\n\n14 = 2 Ã— 7\n15 = 3 Ã— 5\n\nThe first three consecutive numbers to have three distinct prime factors are:\n\n644 = 2Â² Ã— 7 Ã— 23\n645 = 3 Ã— 5 Ã— 43\n646 = 2 Ã— 17 Ã— 19.\n\nFind the first four consecutive integers to have four distinct prime factors each. What is the first of these numbers?\n\n', 48: 'Problem 48: Self powers:\nThe series, 11 + 22 + 33 + ... + 1010 = 10405071317.\n\nFind the last ten digits of the series, 11 + 22 + 33 + ... + 10001000.\n\n', 49: 'Problem 49: Prime permutations:\nThe arithmetic sequence, 1487, 4817, 8147, in which each of the terms increases by 3330, is unusual in two ways: (i) each of the three terms are prime, and, (ii) each of the 4-digit numbers are permutations of one another.\n\nThere are no arithmetic sequences made up of three 1-, 2-, or 3-digit primes, exhibiting this property, but there is one other 4-digit increasing sequence.\n\nWhat 12-digit number do you form by concatenating the three terms in this sequence?\n\n', 50: 'Problem 50: Consecutive prime sum:\nThe prime 41, can be written as the sum of six consecutive primes:\n\n41 = 2 + 3 + 5 + 7 + 11 + 13\n\nThis is the longest sum of consecutive primes that adds to a prime below one-hundred.\n\nThe longest sum of consecutive primes below one-thousand that adds to a prime, contains 21 terms, and is equal to 953.\n\nWhich prime, below one-million, can be written as the sum of the most consecutive primes?\n\n', 51: 'Problem 51: Prime digit replacements:\nBy replacing the 1st digit of the 2-digit number *3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all prime.\n\nBy replacing the 3rd and 4th digits of 56**3 with the same digit, this 5-digit number is the first example having seven primes among the ten generated numbers, yielding the family: 56003, 56113, 56333, 56443, 56663, 56773, and 56993. Consequently 56003, being the first member of this family, is the smallest prime with this property.\n\nFind the smallest prime which, by replacing part of the number (not necessarily adjacent digits) with the same digit, is part of an eight prime value family.\n\n', 52: 'Problem 52: Permuted multiples:\nIt can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different order.\n\nFind the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x, contain the same digits.\n\n', 53: 'Problem 53: Combinatoric selections:\nThere are exactly ten ways of selecting three from five, 12345:\n\n123, 124, 125, 134, 135, 145, 234, 235, 245, and 345\n\nIn combinatorics, we use the notation, \n(53)=10\n.\n\nIn general, \n(nr)=n!r!(nâˆ’r)!\n, where \nrâ‰¤n\n, \nn!=nÃ—(nâˆ’1)Ã—...Ã—3Ã—2Ã—1\n, and \n0!=1\n.\n\nIt is not until \nn=23\n, that a value exceeds one-million: \n(2310)=1144066\n.\n\nHow many, not necessarily distinct, values of \n(nr)\n for \n1â‰¤nâ‰¤100\n, are greater than one-million?\n\n', 54: "Problem 54: Poker hands:\nIn the card game poker, a hand consists of five cards and are ranked, from lowest to highest, in the following way:\n\nHigh Card: Highest value card.\nOne Pair: Two cards of the same value.\nTwo Pairs: Two different pairs.\nThree of a Kind: Three cards of the same value.\nStraight: All cards are consecutive values.\nFlush: All cards of the same suit.\nFull House: Three of a kind and a pair.\nFour of a Kind: Four cards of the same value.\nStraight Flush: All cards are consecutive values of same suit.\nRoyal Flush: Ten, Jack, Queen, King, Ace, in same suit.\n\nThe cards are valued in the order:\n2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King, Ace.\n\nIf two players have the same ranked hands then the rank made up of the highest value wins; for example, a pair of eights beats a pair of fives (see example 1 below). But if two ranks tie, for example, both players have a pair of queens, then highest cards in each hand are compared (see example 4 below); if the highest cards tie then the next highest cards are compared, and so on.\n\nConsider the following five hands dealt to two players:\n\nHand\tÂ\xa0\tPlayer 1\tÂ\xa0\tPlayer 2\tÂ\xa0\tWinner\n1\tÂ\xa0\t5H 5C 6S 7S KD\n\nPair of Fives\n\tÂ\xa0\t2C 3S 8S 8D TD\n\nPair of Eights\n\tÂ\xa0\tPlayer 2\n2\tÂ\xa0\t5D 8C 9S JS AC\n\nHighest card Ace\n\tÂ\xa0\t2C 5C 7D 8S QH\n\nHighest card Queen\n\tÂ\xa0\tPlayer 1\n3\tÂ\xa0\t2D 9C AS AH AC\n\nThree Aces\n\tÂ\xa0\t3D 6D 7D TD QD\n\nFlush with Diamonds\n\tÂ\xa0\tPlayer 2\n4\tÂ\xa0\t4D 6S 9H QH QC\n\nPair of Queens\nHighest card Nine\n\tÂ\xa0\t3D 6D 7H QD QS\n\nPair of Queens\nHighest card Seven\n\tÂ\xa0\tPlayer 1\n5\tÂ\xa0\t2H 2D 4C 4D 4S\n\nFull House\nWith Three Fours\n\tÂ\xa0\t3C 3D 3S 9S 9D\n\nFull House\nwith Three Threes\n\tÂ\xa0\tPlayer 1\n\nThe file, poker.txt, contains one-thousand random hands dealt to two players. Each line of the file contains ten cards (separated by a single space): the first five are Player 1's cards and the last five are Player 2's cards. You can assume that all hands are valid (no invalid characters or repeated cards), each player's hand is in no specific order, and in each hand there is a clear winner.\n\nHow many hands does Player 1 win?\n\n", 55: 'Problem 55: Lychrel numbers:\nIf we take 47, reverse and add, 47 + 74 = 121, which is palindromic.\n\nNot all numbers produce palindromes so quickly. For example,\n\n349 + 943 = 1292,\n1292 + 2921 = 4213\n4213 + 3124 = 7337\n\nThat is, 349 took three iterations to arrive at a palindrome.\n\nAlthough no one has proved it yet, it is thought that some numbers, like 196, never produce a palindrome. A number that never forms a palindrome through the reverse and add process is called a Lychrel number. Due to the theoretical nature of these numbers, and for the purpose of this problem, we shall assume that a number is Lychrel until proven otherwise. In addition you are given that for every number below ten-thousand, it will either (i) become a palindrome in less than fifty iterations, or, (ii) no one, with all the computing power that exists, has managed so far to map it to a palindrome. In fact, 10677 is the first number to be shown to require over fifty iterations before producing a palindrome: 4668731596684224866951378664 (53 iterations, 28-digits).\n\nSurprisingly, there are palindromic numbers that are themselves Lychrel numbers; the first example is 4994.\n\nHow many Lychrel numbers are there below ten-thousand?\n\nNOTE: Wording was modified slightly on 24 April 2007 to emphasise the theoretical nature of Lychrel numbers.\n\n', 56: 'Problem 56: Powerful digit sum:\nA googol (10100) is a massive number: one followed by one-hundred zeros; 100100 is almost unimaginably large: one followed by two-hundred zeros. Despite their size, the sum of the digits in each number is only 1.\n\nConsidering natural numbers of the form, ab, where a, b < 100, what is the maximum digital sum?\n\n', 57: 'Problem 57: Square root convergents:\nIt is possible to show that the square root of two can be expressed as an infinite continued fraction.\n\n2=1+12+12+12+â€¦\n\nBy expanding this for the first four iterations, we get:\n\n1+12=32=1.5\n\n\n1+12+12=75=1.4\n\n\n1+12+12+12=1712=1.41666â€¦\n\n\n1+12+12+12+12=4129=1.41379â€¦\n\n\n\nThe next three expansions are \n9970\n, \n239169\n, and \n577408\n, but the eighth expansion, \n1393985\n, is the first example where the number of digits in the numerator exceeds the number of digits in the denominator.\n\nIn the first one-thousand expansions, how many fractions contain a numerator with more digits than the denominator?\n\n', 58: 'Problem 58: Spiral primes:\nStarting with 1 and spiralling anticlockwise in the following way, a square spiral with side length 7 is formed.\n\n37 36 35 34 33 32 31\n38 17 16 15 14 13 30\n39 18 Â\xa05 Â\xa04 Â\xa03 12 29\n40 19 Â\xa06 Â\xa01 Â\xa02 11 28\n41 20 Â\xa07 Â\xa08 Â\xa09 10 27\n42 21 22 23 24 25 26\n43 44 45 46 47 48 49\n\nIt is interesting to note that the odd squares lie along the bottom right diagonal, but what is more interesting is that 8 out of the 13 numbers lying along both diagonals are prime; that is, a ratio of 8/13 â‰ˆ 62%.\n\nIf one complete new layer is wrapped around the spiral above, a square spiral with side length 9 will be formed. If this process is continued, what is the side length of the square spiral for which the ratio of primes along both diagonals first falls below 10%?\n\n', 59: 'Problem 59: XOR decryption:\nEach character on a computer is assigned a unique code and the preferred standard is ASCII (American Standard Code for Information Interchange). For example, uppercase A = 65, asterisk (*) = 42, and lowercase k = 107.\n\nA modern encryption method is to take a text file, convert the bytes to ASCII, then XOR each byte with a given value, taken from a secret key. The advantage with the XOR function is that using the same encryption key on the cipher text, restores the plain text; for example, 65 XOR 42 = 107, then 107 XOR 42 = 65.\n\nFor unbreakable encryption, the key is the same length as the plain text message, and the key is made up of random bytes. The user would keep the encrypted message and the encryption key in different locations, and without both "halves", it is impossible to decrypt the message.\n\nUnfortunately, this method is impractical for most users, so the modified method is to use a password as a key. If the password is shorter than the message, which is likely, the key is repeated cyclically throughout the message. The balance for this method is using a sufficiently long password key for security, but short enough to be memorable.\n\nYour task has been made easy, as the encryption key consists of three lower case characters. Using p059_cipher.txt (right click and \'Save Link/Target As...\'), a file containing the encrypted ASCII codes, and the knowledge that the plain text must contain common English words, decrypt the message and find the sum of the ASCII values in the original text.\n\n', 60: 'Problem 60: Prime pair sets:\nThe primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property.\n\nFind the lowest sum for a set of five primes for which any two primes concatenate to produce another prime.\n\n', 61: 'Problem 61: Cyclical figurate numbers:\nTriangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers are all figurate (polygonal) numbers and are generated by the following formulae:\n\nTriangle\tÂ\xa0\tP3,n=n(n+1)/2\tÂ\xa0\t1, 3, 6, 10, 15, ...\nSquare\tÂ\xa0\tP4,n=n2\tÂ\xa0\t1, 4, 9, 16, 25, ...\nPentagonal\tÂ\xa0\tP5,n=n(3nâˆ’1)/2\tÂ\xa0\t1, 5, 12, 22, 35, ...\nHexagonal\tÂ\xa0\tP6,n=n(2nâˆ’1)\tÂ\xa0\t1, 6, 15, 28, 45, ...\nHeptagonal\tÂ\xa0\tP7,n=n(5nâˆ’3)/2\tÂ\xa0\t1, 7, 18, 34, 55, ...\nOctagonal\tÂ\xa0\tP8,n=n(3nâˆ’2)\tÂ\xa0\t1, 8, 21, 40, 65, ...\n\nThe ordered set of three 4-digit numbers: 8128, 2882, 8281, has three interesting properties.\n\nThe set is cyclic, in that the last two digits of each number is the first two digits of the next number (including the last number with the first).\nEach polygonal type: triangle (P3,127=8128), square (P4,91=8281), and pentagonal (P5,44=2882), is represented by a different number in the set.\nThis is the only set of 4-digit numbers with this property.\n\nFind the sum of the only ordered set of six cyclic 4-digit numbers for which each polygonal type: triangle, square, pentagonal, hexagonal, heptagonal, and octagonal, is represented by a different number in the set.\n\n', 62: 'Problem 62: Cubic permutations:\nThe cube, 41063625 (3453), can be permuted to produce two other cubes: 56623104 (3843) and 66430125 (4053). In fact, 41063625 is the smallest cube which has exactly three permutations of its digits which are also cube.\n\nFind the smallest cube for which exactly five permutations of its digits are cube.\n\n', 63: 'Problem 63: Powerful digit counts:\nThe 5-digit number, 16807=75, is also a fifth power. Similarly, the 9-digit number, 134217728=89, is a ninth power.\n\nHow many n-digit positive integers exist which are also an nth power?\n\n', 64: 'Problem 64: Odd period square roots:\nAll square roots are periodic when written as continued fractions and can be written in the form:\n\nN=a0+1a1+1a2+1a3+â€¦\n\nFor example, let us consider \n23:\n\n23=4+23âˆ’4=4+1123âˆ’4=4+11+23âˆ’37\n\nIf we continue we would get the following expansion:\n\n23=4+11+13+11+18+â€¦\n\nThe process can be summarised as follows:\n\na0=4,123âˆ’4=23+47=1+23âˆ’37\n\n\na1=1,723âˆ’3=7(23+3)14=3+23âˆ’32\n\n\na2=3,223âˆ’3=2(23+3)14=1+23âˆ’47\n\n\na3=1,723âˆ’4=7(23+4)7=8+23âˆ’4\n\n\na4=8,123âˆ’4=23+47=1+23âˆ’37\n\n\na5=1,723âˆ’3=7(23+3)14=3+23âˆ’32\n\n\na6=3,223âˆ’3=2(23+3)14=1+23âˆ’47\n\n\na7=1,723âˆ’4=7(23+4)7=8+23âˆ’4\n\n\n\nIt can be seen that the sequence is repeating. For conciseness, we use the notation \n23=[4;(1,3,1,8)]\n, to indicate that the block (1,3,1,8) repeats indefinitely.\n\nThe first ten continued fraction representations of (irrational) square roots are:\n\n2=[1;(2)]\n, period=\n1\n\n\n3=[1;(1,2)]\n, period=\n2\n\n\n5=[2;(4)]\n, period=\n1\n\n\n6=[2;(2,4)]\n, period=\n2\n\n\n7=[2;(1,1,1,4)]\n, period=\n4\n\n\n8=[2;(1,4)]\n, period=\n2\n\n\n10=[3;(6)]\n, period=\n1\n\n\n11=[3;(3,6)]\n, period=\n2\n\n\n12=[3;(2,6)]\n, period=\n2\n\n\n13=[3;(1,1,1,1,6)]\n, period=\n5\n\nExactly four continued fractions, for \nNâ‰¤13\n, have an odd period.\n\nHow many continued fractions for \nNâ‰¤10000\n have an odd period?\n\n', 65: 'Problem 65: Convergents of e:\nThe square root of 2 can be written as an infinite continued fraction.\n\n2=1+12+12+12+12+...\n\nThe infinite continued fraction can be written, \n2=[1;(2)]\n, \n(2)\n indicates that 2 repeats ad infinitum. In a similar way, \n23=[4;(1,3,1,8)]\n.\n\nIt turns out that the sequence of partial values of continued fractions for square roots provide the best rational approximations. Let us consider the convergents for \n2\n.\n\n1+12=321+12+12=751+12+12+12=17121+12+12+12+12=4129\n\nHence the sequence of the first ten convergents for \n2\n are:\n\n1,32,75,1712,4129,9970,239169,577408,1393985,33632378,...\n\nWhat is most surprising is that the important mathematical constant,\n\ne=[2;1,2,1,1,4,1,1,6,1,...,1,2k,1,...]\n.\n\nThe first ten terms in the sequence of convergents for e are:\n\n2,3,83,114,197,8732,10639,19371,1264465,1457536,...\n\nThe sum of digits in the numerator of the 10th convergent is \n1+4+5+7=17\n.\n\nFind the sum of digits in the numerator of the 100th convergent of the continued fraction for \ne\n.\n\n', 66: 'Problem 66: Diophantine equation:\nConsider quadratic Diophantine equations of the form:\n\nx2 â€“ Dy2 = 1\n\nFor example, when D=13, the minimal solution in x is 6492 â€“ 13Ã—1802 = 1.\n\nIt can be assumed that there are no solutions in positive integers when D is square.\n\nBy finding minimal solutions in x for D = {2, 3, 5, 6, 7}, we obtain the following:\n\n32 â€“ 2Ã—22 = 1\n22 â€“ 3Ã—12 = 1\n92 â€“ 5Ã—42 = 1\n52 â€“ 6Ã—22 = 1\n82 â€“ 7Ã—32 = 1\n\nHence, by considering minimal solutions in x for D â‰¤ 7, the largest x is obtained when D=5.\n\nFind the value of D â‰¤ 1000 in minimal solutions of x for which the largest value of x is obtained.\n\n', 67: "Problem 67: Maximum path sum II:\nBy starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.\n\n3\n7 4\n2 4 6\n8 5 9 3\n\nThat is, 3 + 7 + 4 + 9 = 23.\n\nFind the maximum total from top to bottom in triangle.txt (right click and 'Save Link/Target As...'), a 15K text file containing a triangle with one-hundred rows.\n\nNOTE: This is a much more difficult version of Problem 18. It is not possible to try every route to solve this problem, as there are 299 altogether! If you could check one trillion (1012) routes every second it would take over twenty billion years to check them all. There is an efficient algorithm to solve it. ;o)\n\n", 68: 'Problem 68: Magic 5-gon ring:\nConsider the following "magic" 3-gon ring, filled with the numbers 1 to 6, and each line adding to nine.\n\n\n\n\nWorking clockwise, and starting from the group of three with the numerically lowest external node (4,3,2 in this example), each solution can be described uniquely. For example, the above solution can be described by the set: 4,3,2; 6,2,1; 5,1,3.\n\nIt is possible to complete the ring with four different totals: 9, 10, 11, and 12. There are eight solutions in total.\n\nTotal\tSolution Set\n9\t4,2,3; 5,3,1; 6,1,2\n9\t4,3,2; 6,2,1; 5,1,3\n10\t2,3,5; 4,5,1; 6,1,3\n10\t2,5,3; 6,3,1; 4,1,5\n11\t1,4,6; 3,6,2; 5,2,4\n11\t1,6,4; 5,4,2; 3,2,6\n12\t1,5,6; 2,6,4; 3,4,5\n12\t1,6,5; 3,5,4; 2,4,6\n\nBy concatenating each group it is possible to form 9-digit strings; the maximum string for a 3-gon ring is 432621513.\n\nUsing the numbers 1 to 10, and depending on arrangements, it is possible to form 16- and 17-digit strings. What is the maximum 16-digit string for a "magic" 5-gon ring?\n\n\n\n\n', 69: "Problem 69: Totient maximum:\nEuler's Totient function, Ï†(n) [sometimes called the phi function], is used to determine the number of numbers less than n which are relatively prime to n. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, Ï†(9)=6.\n\nn\tRelatively Prime\tÏ†(n)\tn/Ï†(n)\n2\t1\t1\t2\n3\t1,2\t2\t1.5\n4\t1,3\t2\t2\n5\t1,2,3,4\t4\t1.25\n6\t1,5\t2\t3\n7\t1,2,3,4,5,6\t6\t1.1666...\n8\t1,3,5,7\t4\t2\n9\t1,2,4,5,7,8\t6\t1.5\n10\t1,3,7,9\t4\t2.5\n\nIt can be seen that n=6 produces a maximum n/Ï†(n) for n â‰¤ 10.\n\nFind the value of n â‰¤ 1,000,000 for which n/Ï†(n) is a maximum.\n\n", 70: "Problem 70: Totient permutation:\nEuler's Totient function, Ï†(n) [sometimes called the phi function], is used to determine the number of positive numbers less than or equal to n which are relatively prime to n. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, Ï†(9)=6.\nThe number 1 is considered to be relatively prime to every positive number, so Ï†(1)=1.\n\nInterestingly, Ï†(87109)=79180, and it can be seen that 87109 is a permutation of 79180.\n\nFind the value of n, 1 < n < 107, for which Ï†(n) is a permutation of n and the ratio n/Ï†(n) produces a minimum.\n\n", 71: 'Problem 71: Ordered fractions:\nConsider the fraction, n/d, where n and d are positive integers. If n<d and HCF(n,d)=1, it is called a reduced proper fraction.\n\nIf we list the set of reduced proper fractions for d â‰¤ 8 in ascending order of size, we get:\n\n1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8\n\nIt can be seen that 2/5 is the fraction immediately to the left of 3/7.\n\nBy listing the set of reduced proper fractions for d â‰¤ 1,000,000 in ascending order of size, find the numerator of the fraction immediately to the left of 3/7.\n\n', 72: 'Problem 72: Counting fractions:\nConsider the fraction, n/d, where n and d are positive integers. If n<d and HCF(n,d)=1, it is called a reduced proper fraction.\n\nIf we list the set of reduced proper fractions for d â‰¤ 8 in ascending order of size, we get:\n\n1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8\n\nIt can be seen that there are 21 elements in this set.\n\nHow many elements would be contained in the set of reduced proper fractions for d â‰¤ 1,000,000?\n\n', 73: 'Problem 73: Counting fractions in a range:\nConsider the fraction, n/d, where n and d are positive integers. If n<d and HCF(n,d)=1, it is called a reduced proper fraction.\n\nIf we list the set of reduced proper fractions for d â‰¤ 8 in ascending order of size, we get:\n\n1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8\n\nIt can be seen that there are 3 fractions between 1/3 and 1/2.\n\nHow many fractions lie between 1/3 and 1/2 in the sorted set of reduced proper fractions for d â‰¤ 12,000?\n\n', 74: 'Problem 74: Digit factorial chains:\nThe number 145 is well known for the property that the sum of the factorial of its digits is equal to 145:\n\n1! + 4! + 5! = 1 + 24 + 120 = 145\n\nPerhaps less well known is 169, in that it produces the longest chain of numbers that link back to 169; it turns out that there are only three such loops that exist:\n\n169 â†’ 363601 â†’ 1454 â†’ 169\n871 â†’ 45361 â†’ 871\n872 â†’ 45362 â†’ 872\n\nIt is not difficult to prove that EVERY starting number will eventually get stuck in a loop. For example,\n\n69 â†’ 363600 â†’ 1454 â†’ 169 â†’ 363601 (â†’ 1454)\n78 â†’ 45360 â†’ 871 â†’ 45361 (â†’ 871)\n540 â†’ 145 (â†’ 145)\n\nStarting with 69 produces a chain of five non-repeating terms, but the longest non-repeating chain with a starting number below one million is sixty terms.\n\nHow many chains, with a starting number below one million, contain exactly sixty non-repeating terms?\n\n', 75: 'Problem 75: Singular integer right triangles:\nIt turns out that 12 cm is the smallest length of wire that can be bent to form an integer sided right angle triangle in exactly one way, but there are many more examples.\n\n12 cm: (3,4,5)\n24 cm: (6,8,10)\n30 cm: (5,12,13)\n36 cm: (9,12,15)\n40 cm: (8,15,17)\n48 cm: (12,16,20)\n\nIn contrast, some lengths of wire, like 20 cm, cannot be bent to form an integer sided right angle triangle, and other lengths allow more than one solution to be found; for example, using 120 cm it is possible to form exactly three different integer sided right angle triangles.\n\n120 cm: (30,40,50), (20,48,52), (24,45,51)\n\nGiven that L is the length of the wire, for how many values of L â‰¤ 1,500,000 can exactly one integer sided right angle triangle be formed?\n\n', 76: 'Problem 76: Counting summations:\nIt is possible to write five as a sum in exactly six different ways:\n\n4 + 1\n3 + 2\n3 + 1 + 1\n2 + 2 + 1\n2 + 1 + 1 + 1\n1 + 1 + 1 + 1 + 1\n\nHow many different ways can one hundred be written as a sum of at least two positive integers?\n\n', 77: 'Problem 77: Prime summations:\nIt is possible to write ten as the sum of primes in exactly five different ways:\n\n7 + 3\n5 + 5\n5 + 3 + 2\n3 + 3 + 2 + 2\n2 + 2 + 2 + 2 + 2\n\nWhat is the first value which can be written as the sum of primes in over five thousand different ways?\n\n', 78: 'Problem 78: Coin partitions:\nLet p(n) represent the number of different ways in which n coins can be separated into piles. For example, five coins can be separated into piles in exactly seven different ways, so p(5)=7.\n\nOOOOO\nOOOOÂ\xa0 Â\xa0O\nOOOÂ\xa0 Â\xa0OO\nOOOÂ\xa0 Â\xa0OÂ\xa0 Â\xa0O\nOOÂ\xa0 Â\xa0OOÂ\xa0 Â\xa0O\nOOÂ\xa0 Â\xa0OÂ\xa0 Â\xa0OÂ\xa0 Â\xa0O\nOÂ\xa0 Â\xa0OÂ\xa0 Â\xa0OÂ\xa0 Â\xa0OÂ\xa0 Â\xa0O\n\nFind the least value of n for which p(n) is divisible by one million.\n\n', 79: 'Problem 79: Passcode derivation:\nA common security method used for online banking is to ask the user for three random characters from a passcode. For example, if the passcode was 531278, they may ask for the 2nd, 3rd, and 5th characters; the expected reply would be: 317.\n\nThe text file, keylog.txt, contains fifty successful login attempts.\n\nGiven that the three characters are always asked for in order, analyse the file so as to determine the shortest possible secret passcode of unknown length.\n\n', 80: 'Problem 80: Square root digital expansion:\nIt is well known that if the square root of a natural number is not an integer, then it is irrational. The decimal expansion of such square roots is infinite without any repeating pattern at all.\n\nThe square root of two is 1.41421356237309504880..., and the digital sum of the first one hundred decimal digits is 475.\n\nFor the first one hundred natural numbers, find the total of the digital sums of the first one hundred decimal digits for all the irrational square roots.\n\n', 81: 'Problem 81: Path sum: two ways:\nIn the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by only moving to the right and down, is indicated in bold red and is equal to 2427.\n\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n(131673234103182019634296515063080374642211153769949712195680573252437331)\n\nFind the minimal path sum from the top left to the bottom right by only moving right and down in matrix.txt (right click and "Save Link/Target As..."), a 31K text file containing an 80 by 80 matrix.\n\n', 82: 'Problem 82: Path sum: three ways:\nNOTE: This problem is a more challenging version of Problem 81.\n\nThe minimal path sum in the 5 by 5 matrix below, by starting in any cell in the left column and finishing in any cell in the right column, and only moving up, down, and right, is indicated in red and bold; the sum is equal to 994.\n\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n(131673234103182019634296515063080374642211153769949712195680573252437331)\n\nFind the minimal path sum from the left column to the right column in matrix.txt (right click and "Save Link/Target As..."), a 31K text file containing an 80 by 80 matrix.\n\n', 83: 'Problem 83: Path sum: four ways:\nNOTE: This problem is a significantly more challenging version of Problem 81.\n\nIn the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by moving left, right, up, and down, is indicated in bold red and is equal to 2297.\n\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n(131673234103182019634296515063080374642211153769949712195680573252437331)\n\nFind the minimal path sum from the top left to the bottom right by moving left, right, up, and down in matrix.txt (right click and "Save Link/Target As..."), a 31K text file containing an 80 by 80 matrix.\n\n', 84: 'Problem 84: Monopoly odds:\nIn the game, Monopoly, the standard board is set up in the following way:\n\nGO\tA1\tCC1\tA2\tT1\tR1\tB1\tCH1\tB2\tB3\tJAIL\nH2\tÂ\xa0\tC1\nT2\tÂ\xa0\tU1\nH1\tÂ\xa0\tC2\nCH3\tÂ\xa0\tC3\nR4\tÂ\xa0\tR2\nG3\tÂ\xa0\tD1\nCC3\tÂ\xa0\tCC2\nG2\tÂ\xa0\tD2\nG1\tÂ\xa0\tD3\nG2J\tF3\tU2\tF2\tF1\tR3\tE3\tE2\tCH2\tE1\tFP\n\nA player starts on the GO square and adds the scores on two 6-sided dice to determine the number of squares they advance in a clockwise direction. Without any further rules we would expect to visit each square with equal probability: 2.5%. However, landing on G2J (Go To Jail), CC (community chest), and CH (chance) changes this distribution.\n\nIn addition to G2J, and one card from each of CC and CH, that orders the player to go directly to jail, if a player rolls three consecutive doubles, they do not advance the result of their 3rd roll. Instead they proceed directly to jail.\n\nAt the beginning of the game, the CC and CH cards are shuffled. When a player lands on CC or CH they take a card from the top of the respective pile and, after following the instructions, it is returned to the bottom of the pile. There are sixteen cards in each pile, but for the purpose of this problem we are only concerned with cards that order a movement; any instruction not concerned with movement will be ignored and the player will remain on the CC/CH square.\n\nCommunity Chest (2/16 cards):\nAdvance to GO\nGo to JAIL\nChance (10/16 cards):\nAdvance to GO\nGo to JAIL\nGo to C1\nGo to E3\nGo to H2\nGo to R1\nGo to next R (railway company)\nGo to next R\nGo to next U (utility company)\nGo back 3 squares.\n\nThe heart of this problem concerns the likelihood of visiting a particular square. That is, the probability of finishing at that square after a roll. For this reason it should be clear that, with the exception of G2J for which the probability of finishing on it is zero, the CH squares will have the lowest probabilities, as 5/8 request a movement to another square, and it is the final square that the player finishes at on each roll that we are interested in. We shall make no distinction between "Just Visiting" and being sent to JAIL, and we shall also ignore the rule about requiring a double to "get out of jail", assuming that they pay to get out on their next turn.\n\nBy starting at GO and numbering the squares sequentially from 00 to 39 we can concatenate these two-digit numbers to produce strings that correspond with sets of squares.\n\nStatistically it can be shown that the three most popular squares, in order, are JAIL (6.24%) = Square 10, E3 (3.18%) = Square 24, and GO (3.09%) = Square 00. So these three most popular squares can be listed with the six-digit modal string: 102400.\n\nIf, instead of using two 6-sided dice, two 4-sided dice are used, find the six-digit modal string.\n\n', 85: 'Problem 85: Counting rectangles:\nBy counting carefully it can be seen that a rectangular grid measuring 3 by 2 contains eighteen rectangles:\n\nAlthough there exists no rectangular grid that contains exactly two million rectangles, find the area of the grid with the nearest solution.\n\n', 86: 'Problem 86: Cuboid route:\nA spider, S, sits in one corner of a cuboid room, measuring 6 by 5 by 3, and a fly, F, sits in the opposite corner. By travelling on the surfaces of the room the shortest "straight line" distance from S to F is 10 and the path is shown on the diagram.\n\n\n\n\nHowever, there are up to three "shortest" path candidates for any given cuboid and the shortest route doesn\'t always have integer length.\n\nIt can be shown that there are exactly 2060 distinct cuboids, ignoring rotations, with integer dimensions, up to a maximum size of M by M by M, for which the shortest route has integer length when M = 100. This is the least value of M for which the number of solutions first exceeds two thousand; the number of solutions when M = 99 is 1975.\n\nFind the least value of M such that the number of solutions first exceeds one million.\n\n', 87: 'Problem 87: Prime power triples:\nThe smallest number expressible as the sum of a prime square, prime cube, and prime fourth power is 28. In fact, there are exactly four numbers below fifty that can be expressed in such a way:\n\n28 = 22 + 23 + 24\n33 = 32 + 23 + 24\n49 = 52 + 23 + 24\n47 = 22 + 33 + 24\n\nHow many numbers below fifty million can be expressed as the sum of a prime square, prime cube, and prime fourth power?\n\n', 88: 'Problem 88: Product-sum numbers:\nA natural number, N, that can be written as the sum and product of a given set of at least two natural numbers, {a1, a2, ... , ak} is called a product-sum number: N = a1 + a2 + ... + ak = a1 Ã— a2 Ã— ... Ã— ak.\n\nFor example, 6 = 1 + 2 + 3 = 1 Ã— 2 Ã— 3.\n\nFor a given set of size, k, we shall call the smallest N with this property a minimal product-sum number. The minimal product-sum numbers for sets of size, k = 2, 3, 4, 5, and 6 are as follows.\n\nk=2: 4 = 2 Ã— 2 = 2 + 2\nk=3: 6 = 1 Ã— 2 Ã— 3 = 1 + 2 + 3\nk=4: 8 = 1 Ã— 1 Ã— 2 Ã— 4 = 1 + 1 + 2 + 4\nk=5: 8 = 1 Ã— 1 Ã— 2 Ã— 2 Ã— 2 = 1 + 1 + 2 + 2 + 2\nk=6: 12 = 1 Ã— 1 Ã— 1 Ã— 1 Ã— 2 Ã— 6 = 1 + 1 + 1 + 1 + 2 + 6\n\nHence for 2â‰¤kâ‰¤6, the sum of all the minimal product-sum numbers is 4+6+8+12 = 30; note that 8 is only counted once in the sum.\n\nIn fact, as the complete set of minimal product-sum numbers for 2â‰¤kâ‰¤12 is {4, 6, 8, 12, 15, 16}, the sum is 61.\n\nWhat is the sum of all the minimal product-sum numbers for 2â‰¤kâ‰¤12000?\n\n', 89: 'Problem 89: Roman numerals:\nFor a number written in Roman numerals to be considered valid there are basic rules which must be followed. Even though the rules allow some numbers to be expressed in more than one way there is always a "best" way of writing a particular number.\n\nFor example, it would appear that there are at least six ways of writing the number sixteen:\n\nIIIIIIIIIIIIIIII\nVIIIIIIIIIII\nVVIIIIII\nXIIIIII\nVVVI\nXVI\n\nHowever, according to the rules only XIIIIII and XVI are valid, and the last example is considered to be the most efficient, as it uses the least number of numerals.\n\nThe 11K text file, roman.txt (right click and \'Save Link/Target As...\'), contains one thousand numbers written in valid, but not necessarily minimal, Roman numerals; see About... Roman Numerals for the definitive rules for this problem.\n\nFind the number of characters saved by writing each of these in their minimal form.\n\nNote: You can assume that all the Roman numerals in the file contain no more than four consecutive identical units.\n\n', 90: 'Problem 90: Cube digit pairs:\nEach of the six faces on a cube has a different digit (0 to 9) written on it; the same is done to a second cube. By placing the two cubes side-by-side in different positions we can form a variety of 2-digit numbers.\n\nFor example, the square number 64 could be formed:\n\n\n\n\nIn fact, by carefully choosing the digits on both cubes it is possible to display all of the square numbers below one-hundred: 01, 04, 09, 16, 25, 36, 49, 64, and 81.\n\nFor example, one way this can be achieved is by placing {0, 5, 6, 7, 8, 9} on one cube and {1, 2, 3, 4, 8, 9} on the other cube.\n\nHowever, for this problem we shall allow the 6 or 9 to be turned upside-down so that an arrangement like {0, 5, 6, 7, 8, 9} and {1, 2, 3, 4, 6, 7} allows for all nine square numbers to be displayed; otherwise it would be impossible to obtain 09.\n\nIn determining a distinct arrangement we are interested in the digits on each cube, not the order.\n\n{1, 2, 3, 4, 5, 6} is equivalent to {3, 6, 4, 1, 2, 5}\n{1, 2, 3, 4, 5, 6} is distinct from {1, 2, 3, 4, 5, 9}\n\nBut because we are allowing 6 and 9 to be reversed, the two distinct sets in the last example both represent the extended set {1, 2, 3, 4, 5, 6, 9} for the purpose of forming 2-digit numbers.\n\nHow many distinct arrangements of the two cubes allow for all of the square numbers to be displayed?\n\n', 91: 'Problem 91: Right triangles with integer coordinates:\nThe points P (x1, y1) and Q (x2, y2) are plotted at integer co-ordinates and are joined to the origin, O(0,0), to form Î”OPQ.\n\n\n\n\nThere are exactly fourteen triangles containing a right angle that can be formed when each co-ordinate lies between 0 and 2 inclusive; that is,\n0 â‰¤ x1, y1, x2, y2 â‰¤ 2.\n\n\n\n\nGiven that 0 â‰¤ x1, y1, x2, y2 â‰¤ 50, how many right triangles can be formed?\n\n', 92: 'Problem 92: Square digit chains:\nA number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before.\n\nFor example,\n\n44 â†’ 32 â†’ 13 â†’ 10 â†’ 1 â†’ 1\n85 â†’ 89 â†’ 145 â†’ 42 â†’ 20 â†’ 4 â†’ 16 â†’ 37 â†’ 58 â†’ 89\n\nTherefore any chain that arrives at 1 or 89 will become stuck in an endless loop. What is most amazing is that EVERY starting number will eventually arrive at 1 or 89.\n\nHow many starting numbers below ten million will arrive at 89?\n\n', 93: 'Problem 93: Arithmetic expressions:\nBy using each of the digits from the set, {1, 2, 3, 4}, exactly once, and making use of the four arithmetic operations (+, âˆ’, *, /) and brackets/parentheses, it is possible to form different positive integer targets.\n\nFor example,\n\n8 = (4 * (1 + 3)) / 2\n14 = 4 * (3 + 1 / 2)\n19 = 4 * (2 + 3) âˆ’ 1\n36 = 3 * 4 * (2 + 1)\n\nNote that concatenations of the digits, like 12 + 34, are not allowed.\n\nUsing the set, {1, 2, 3, 4}, it is possible to obtain thirty-one different target numbers of which 36 is the maximum, and each of the numbers 1 to 28 can be obtained before encountering the first non-expressible number.\n\nFind the set of four distinct digits, a < b < c < d, for which the longest set of consecutive positive integers, 1 to n, can be obtained, giving your answer as a string: abcd.\n\n', 94: 'Problem 94: Almost equilateral triangles:\nIt is easily proved that no equilateral triangle exists with integral length sides and integral area. However, the almost equilateral triangle 5-5-6 has an area of 12 square units.\n\nWe shall define an almost equilateral triangle to be a triangle for which two sides are equal and the third differs by no more than one unit.\n\nFind the sum of the perimeters of all almost equilateral triangles with integral side lengths and area and whose perimeters do not exceed one billion (1,000,000,000).\n\n', 95: 'Problem 95: Amicable chains:\nThe proper divisors of a number are all the divisors excluding the number itself. For example, the proper divisors of 28 are 1, 2, 4, 7, and 14. As the sum of these divisors is equal to 28, we call it a perfect number.\n\nInterestingly the sum of the proper divisors of 220 is 284 and the sum of the proper divisors of 284 is 220, forming a chain of two numbers. For this reason, 220 and 284 are called an amicable pair.\n\nPerhaps less well known are longer chains. For example, starting with 12496, we form a chain of five numbers:\n\n12496 â†’ 14288 â†’ 15472 â†’ 14536 â†’ 14264 (â†’ 12496 â†’ ...)\n\nSince this chain returns to its starting point, it is called an amicable chain.\n\nFind the smallest member of the longest amicable chain with no element exceeding one million.\n\n', 96: 'Problem 96: Su Doku:\nSu Doku (Japanese meaning number place) is the name given to a popular puzzle concept. Its origin is unclear, but credit must be attributed to Leonhard Euler who invented a similar, and much more difficult, puzzle idea called Latin Squares. The objective of Su Doku puzzles, however, is to replace the blanks (or zeros) in a 9 by 9 grid in such that each row, column, and 3 by 3 box contains each of the digits 1 to 9. Below is an example of a typical starting puzzle grid and its solution grid.\n\n0 0 3\n9 0 0\n0 0 1\t0 2 0\n3 0 5\n8 0 6\t6 0 0\n0 0 1\n4 0 0\n0 0 8\n7 0 0\n0 0 6\t1 0 2\n0 0 0\n7 0 8\t9 0 0\n0 0 8\n2 0 0\n0 0 2\n8 0 0\n0 0 5\t6 0 9\n2 0 3\n0 1 0\t5 0 0\n0 0 9\n3 0 0\n\t\n\t\n4 8 3\n9 6 7\n2 5 1\t9 2 1\n3 4 5\n8 7 6\t6 5 7\n8 2 1\n4 9 3\n5 4 8\n7 2 9\n1 3 6\t1 3 2\n5 6 4\n7 9 8\t9 7 6\n1 3 8\n2 4 5\n3 7 2\n8 1 4\n6 9 5\t6 8 9\n2 5 3\n4 1 7\t5 1 4\n7 6 9\n3 8 2\n\nA well constructed Su Doku puzzle has a unique solution and can be solved by logic, although it may be necessary to employ "guess and test" methods in order to eliminate options (there is much contested opinion over this). The complexity of the search determines the difficulty of the puzzle; the example above is considered easy because it can be solved by straight forward direct deduction.\n\nThe 6K text file, sudoku.txt (right click and \'Save Link/Target As...\'), contains fifty different Su Doku puzzles ranging in difficulty, but all with unique solutions (the first puzzle in the file is the example above).\n\nBy solving all fifty puzzles find the sum of the 3-digit numbers found in the top left corner of each solution grid; for example, 483 is the 3-digit number found in the top left corner of the solution grid above.\n\n', 97: 'Problem 97: Large non-Mersenne prime:\nThe first known prime found to exceed one million digits was discovered in 1999, and is a Mersenne prime of the form 26972593âˆ’1; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form 2pâˆ’1, have been found which contain more digits.\n\nHowever, in 2004 there was found a massive non-Mersenne prime which contains 2,357,207 digits: 28433Ã—27830457+1.\n\nFind the last ten digits of this prime number.\n\n', 98: "Problem 98: Anagramic squares:\nBy replacing each of the letters in the word CARE with 1, 2, 9, and 6 respectively, we form a square number: 1296 = 362. What is remarkable is that, by using the same digital substitutions, the anagram, RACE, also forms a square number: 9216 = 962. We shall call CARE (and RACE) a square anagram word pair and specify further that leading zeroes are not permitted, neither may a different letter have the same digital value as another letter.\n\nUsing words.txt (right click and 'Save Link/Target As...'), a 16K text file containing nearly two-thousand common English words, find all the square anagram word pairs (a palindromic word is NOT considered to be an anagram of itself).\n\nWhat is the largest square number formed by any member of such a pair?\n\nNOTE: All anagrams formed must be contained in the given text file.\n\n", 99: "Problem 99: Largest exponential:\nComparing two numbers written in index form like 211 and 37 is not difficult, as any calculator would confirm that 211 = 2048 < 37 = 2187.\n\nHowever, confirming that 632382518061 > 519432525806 would be much more difficult, as both numbers contain over three million digits.\n\nUsing base_exp.txt (right click and 'Save Link/Target As...'), a 22K text file containing one thousand lines with a base/exponent pair on each line, determine which line number has the greatest numerical value.\n\nNOTE: The first two lines in the file represent the numbers in the example given above.\n\n", 100: 'Problem 100: Arranged probability:\nIf a box contains twenty-one coloured discs, composed of fifteen blue discs and six red discs, and two discs were taken at random, it can be seen that the probability of taking two blue discs, P(BB) = (15/21)Ã—(14/20) = 1/2.\n\nThe next such arrangement, for which there is exactly 50% chance of taking two blue discs at random, is a box containing eighty-five blue discs and thirty-five red discs.\n\nBy finding the first arrangement to contain over 1012 = 1,000,000,000,000 discs in total, determine the number of blue discs that the box would contain.\n\n'} current = int(input("Enter Problem No. : ")) print(problems[current])

633.045455

5,328

0.757622

13,192

69,635

4.018117

0.150697

0.006754

0.00815

0.004565

0.199502

0.154998

0.121663

0.101119

0.091158

0.077197

0

0.207039

0.154549

69,635

110

5,329

633.045455

0.689009

0.001106

0

0.883495

0.977924

0.147173

0

1

0.009709

false

0.019417

0.009709

0

0.019417

0.009709

0

null

0

1

0

1

0

1

0

null

0

5

fe8f634629d255e2d86bb2ab2cfbae31cc0738ec

2,466

py

Python

Lectures/tex/codes/lecture12.py

josh-gree/NumericalMethods

03cb91114b3f5eb1b56916920ad180d371fe5283

[ "CC-BY-3.0" ]

76

2015-02-12T19:51:52.000Z

2022-03-26T15:34:11.000Z

Lectures/tex/codes/lecture12.py

josh-gree/NumericalMethods

03cb91114b3f5eb1b56916920ad180d371fe5283

[ "CC-BY-3.0" ]

2

2017-05-24T19:49:52.000Z

2018-01-23T21:40:42.000Z

Lectures/tex/codes/lecture12.py

josh-gree/NumericalMethods

03cb91114b3f5eb1b56916920ad180d371fe5283

[ "CC-BY-3.0" ]

41

2015-01-05T13:30:47.000Z

2022-02-15T09:59:39.000Z

import numpy from matplotlib import pyplot def trapezoidal(f, a, b, N): x, dx = numpy.linspace(a, b, N+1, retstep=True) fx = f(x) return dx * ( (fx[0] + fx[-1])/2 + numpy.sum(fx[1:-1]) ) def simpsons(f, a, b, N): x, dx = numpy.linspace(a, b, N+1, retstep=True) fx = f(x) return dx/3 * ( (fx[0] + fx[-1]) + \ 2*numpy.sum(fx[2:-1:2]) + 4*numpy.sum(fx[1:-1:2]) ) def richardson(f, a, b, N): I_h = simpsons(f, a, b, N) I_2h = simpsons(f, a, b, N//2) return (2**4*I_h - I_2h) / (2**4 - 1) if __name__=="__main__": print("Trapezoidal rule") print(trapezoidal(numpy.sin, 0, numpy.pi/2, 2)) print(trapezoidal(numpy.sin, 0, numpy.pi/2, 4)) Npoints = 2**numpy.arange(1,20) dx_all = numpy.pi/2/Npoints errors = numpy.zeros_like(dx_all) for i, N in enumerate(Npoints): I = trapezoidal(numpy.sin, 0, numpy.pi/2, N) errors[i] = abs(I - 1) pyplot.loglog(dx_all, errors, 'kx') pyplot.loglog(dx_all, errors[0]*(dx_all/dx_all[0])**2, 'b-', label=r"$\propto \Delta x^2$") pyplot.legend(loc='upper left') pyplot.xlabel(r"$\Delta x$") pyplot.ylabel("Error") pyplot.show() print("Simpson's rule") print(simpsons(numpy.sin, 0, numpy.pi/2, 2)) print(simpsons(numpy.sin, 0, numpy.pi/2, 4)) Npoints = 2**numpy.arange(1,20) dx_all = numpy.pi/2/Npoints errors = numpy.zeros_like(dx_all) for i, N in enumerate(Npoints): I = simpsons(numpy.sin, 0, numpy.pi/2, N) errors[i] = abs(I - 1) pyplot.loglog(dx_all, errors, 'kx') pyplot.loglog(dx_all, errors[0]*(dx_all/dx_all[0])**4, 'b-', label=r"$\propto \Delta x^4$") pyplot.legend(loc='upper left') pyplot.xlabel(r"$\Delta x$") pyplot.ylabel("Error") pyplot.show() print("Richardson extrapolation") print(richardson(numpy.sin, 0, numpy.pi/2, 4)) print(richardson(numpy.sin, 0, numpy.pi/2, 8)) Npoints = 2**numpy.arange(2, 10) dx_all = numpy.pi/2/Npoints errors = numpy.zeros_like(dx_all) for i, N in enumerate(Npoints): I = richardson(numpy.sin, 0, numpy.pi/2, N) errors[i] = abs(I - 1) pyplot.loglog(dx_all, errors, 'kx') pyplot.loglog(dx_all, errors[0]*(dx_all/dx_all[0])**6, 'b-', label=r"$\propto \Delta x^6$") pyplot.legend(loc='upper left') pyplot.xlabel(r"$\Delta x$") pyplot.ylabel("Error") pyplot.show()

34.732394

64

0.576642

409

2,466

3.396088

0.163814

0.064795

0.069114

0.090713

0.865371

0.827934

0.786897

0.765299

0.62707

0

0.042261

0.23236

2,466

71

65

34.732394

0.691495

0

0.515625

0

0.084718

0

1

0.046875

false

0

0.03125

0

0.125

0.140625

0

null

0

1

0

1

0

null

0

5

fea04ac99d77239581f80a92983b23f68eca255c

1,112

py

Python

dpm/transforms/softplus.py

nextBillyonair/DPM

840ffaafe15c208b200b74094ffa8fe493b4c975

[ "MIT" ]

1

2021-07-20T14:02:55.000Z

dpm/transforms/softplus.py

nextBillyonair/DPM

840ffaafe15c208b200b74094ffa8fe493b4c975

[ "MIT" ]

null

dpm/transforms/softplus.py

nextBillyonair/DPM

840ffaafe15c208b200b74094ffa8fe493b4c975

[ "MIT" ]

null

from .transform import Transform from torch.nn import Parameter from torch.nn.functional import softplus import torch import dpm.utils as utils class Softplus(Transform): def __init__(self, hinge_softness=1.0, learnable=True): super().__init__() if hinge_softness == 0.0: raise ValueError("Hinge Softness cannot be 0") if not isinstance(hinge_softness, torch.Tensor): hinge_softness = torch.tensor(hinge_softness).view(1, -1) self.hinge_softness = hinge_softness.float() if learnable: self.hinge_softness = Parameter(self.hinge_softness) def forward(self, x): return self.hinge_softness * softplus(x / self.hinge_softness) def inverse(self, y): return self.hinge_softness * utils.softplus_inverse(y / self.hinge_softness) def log_abs_det_jacobian(self, x, y): return (-softplus(-x / self.hinge_softness)).sum(-1) # return torch.log(-torch.expm1(-y) + 1e-10) def get_parameters(self): return {'type':'softplus', 'hinge_softness':self.hinge_softness.detach().numpy()}

35.870968

84

0.678957

145

1,112

5.006897

0.344828

0.304408

0.23416

0.082645

0.155647

0.084022

0

0.013652

0.209532

1,112

30

85

37.066667

0.812287

0.03777

0

0.048689

0

1

0.217391

false

0

0.217391

0.173913

0.652174

0

null

1

0

null

0

1

0

1

0

5

feb0999e689101b2820f6e5d8e7ff84407512710

113

py

Python

src/aws_iot/handler/_iot_client.py

janluak/aws-iot

8f3a4d83c40bb950b4f49e8b7afcc3383a30661e

[ "Apache-2.0" ]

null

src/aws_iot/handler/_iot_client.py

janluak/aws-iot

8f3a4d83c40bb950b4f49e8b7afcc3383a30661e

[ "Apache-2.0" ]

null

src/aws_iot/handler/_iot_client.py

janluak/aws-iot

8f3a4d83c40bb950b4f49e8b7afcc3383a30661e

[ "Apache-2.0" ]

null

from os import environ from boto3 import client _iot_client = client("iot", region_name=environ["AWS_REGION"])

18.833333

62

0.778761

17

113

4.941176

0.588235

0.214286

0

0.010101

0.123894

113

5

63

22.6

0.838384

0

0.115044

0

1

0

false

0

0.666667

0

0.666667

0

1

0

null

1

0

1

0

null

0

1

0

1

0

5

2284e6fcf7500c0aa28f9bd0f0598ce99f25ac72

194

py

Python

src/attrbench/suite/dashboard/components/__init__.py

zoeparman/benchmark

96331b7fa0db84f5f422b52cae2211b41bbd15ce

[ "MIT" ]

null

src/attrbench/suite/dashboard/components/__init__.py

zoeparman/benchmark

96331b7fa0db84f5f422b52cae2211b41bbd15ce

[ "MIT" ]

7

2020-03-02T13:03:50.000Z

2022-03-12T00:16:20.000Z

src/attrbench/suite/dashboard/components/__init__.py

zoeparman/benchmark

96331b7fa0db84f5f422b52cae2211b41bbd15ce

[ "MIT" ]

null

from .component import Component from .sample_attributions_component import SampleAttributionsComponent from .sidebar_component import SidebarComponent from .pages import * from .plots import *

32.333333

70

0.860825

21

194

7.809524

0.47619

0.27439

0

0.103093

194

5

71

38.8

0.942529

0

1

0

true

0

1

0

1

0

1

0

null

1

0

1

0

null

0

1

0

1

0

5

229749fd342eb0a7673128facf5112c4152acd77

316

py

Python

tensorflow_riemopt/optimizers/__init__.py

vishalbelsare/tensorflow-riemopt

4814b0c4a8bc74bf98f34ba99440f24ea21ab93b

[ "MIT" ]

33

2021-07-12T14:03:55.000Z

2022-03-30T11:44:11.000Z

tensorflow_riemopt/optimizers/__init__.py

vishalbelsare/tensorflow-riemopt

4814b0c4a8bc74bf98f34ba99440f24ea21ab93b

[ "MIT" ]

2

2021-08-02T18:39:06.000Z

2022-02-14T21:01:22.000Z

tensorflow_riemopt/optimizers/__init__.py

vishalbelsare/tensorflow-riemopt

4814b0c4a8bc74bf98f34ba99440f24ea21ab93b

[ "MIT" ]

5

2020-11-06T05:22:07.000Z

2021-06-15T03:21:58.000Z

from tensorflow_riemopt.optimizers.constrained_rmsprop import ConstrainedRMSprop from tensorflow_riemopt.optimizers.riemannian_adam import RiemannianAdam from tensorflow_riemopt.optimizers.riemannian_gradient_descent import ( RiemannianSGD, ) __all__ = ["ConstrainedRMSprop", "RiemannianAdam", "RiemannianSGD"]

39.5

80

0.860759

29

316

9

0.517241

0.16092

0.241379

0.356322

0.314176

0

0.075949

316

7

81

45.142857

0.893836

0

0.142405

0

1

0

false

0

0.5

0

0.5

0

1

0

null

0

1

0

1

0

null

0

1

0

5

229f2ab370aff1ec0e107e74070272623f7bab15

54

py

Python

llamalogs/__init__.py

llamalogs/llamalogs-py

d2ab260a0f279f6d7ebb16a68a6f1a936b1e880d

[ "MIT" ]

null

llamalogs/__init__.py

llamalogs/llamalogs-py

d2ab260a0f279f6d7ebb16a68a6f1a936b1e880d

[ "MIT" ]

null

llamalogs/__init__.py

llamalogs/llamalogs-py

d2ab260a0f279f6d7ebb16a68a6f1a936b1e880d

[ "MIT" ]

null

from llamalogs.llamaLogs import LlamaLogs as llamalogs

54

0.888889

7

54

6.857143

0.571429

0

0.092593

54

1

54

0.979592

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

22a2c2ac1d2cb2cf26589f26fec7f9746f203d01

47

py

Python

test/pytch/py/project/create_Project.py

Liampobob/pytch-vm

bb2cf19c0736d467daf195635a9de9903aaa1237

[ "MIT" ]

2

2021-11-29T09:47:23.000Z

2022-02-11T15:48:20.000Z

test/pytch/py/project/create_Project.py

Liampobob/pytch-vm

bb2cf19c0736d467daf195635a9de9903aaa1237

[ "MIT" ]

1

2022-02-28T13:50:48.000Z

test/pytch/py/project/create_Project.py

Liampobob/pytch-vm

bb2cf19c0736d467daf195635a9de9903aaa1237

[ "MIT" ]

4

2021-02-12T15:27:33.000Z

2022-03-16T10:26:55.000Z

from pytch import Project project = Project()

11.75

25

0.765957

6

47

6

0.666667

0.777778

0

0.170213

47

3

26

15.666667

0.923077

0

1

0

false

0

0.5

0

0.5

0

1

0

null

1

0

1

0

null

0

1

0

5

22dc9d6b37515d5b0186a97b69acf26a2de5c5c7

24,583

py

Python

contrib/runners/orquesta_runner/tests/unit/test_basic.py

tirkarthi/st2

506125ae8feead052d62303b529f399dba206335

[ "Apache-2.0" ]

null

contrib/runners/orquesta_runner/tests/unit/test_basic.py

tirkarthi/st2

506125ae8feead052d62303b529f399dba206335

[ "Apache-2.0" ]

null

contrib/runners/orquesta_runner/tests/unit/test_basic.py

tirkarthi/st2

506125ae8feead052d62303b529f399dba206335

[ "Apache-2.0" ]

null

# -*- coding: utf-8 -*- # Copyright 2019 Extreme Networks, Inc. # # Licensed under the Apache License, Version 2.0 (the "License"); # you may not use this file except in compliance with the License. # You may obtain a copy of the License at # # http://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an "AS IS" BASIS, # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. # See the License for the specific language governing permissions and # limitations under the License. from __future__ import absolute_import import mock import six from orquesta import statuses as wf_statuses import st2tests # XXX: actionsensor import depends on config being setup. import st2tests.config as tests_config tests_config.parse_args() from tests.unit import base from st2actions.notifier import notifier from st2actions.workflows import workflows from st2common.bootstrap import actionsregistrar from st2common.bootstrap import runnersregistrar from st2common.constants import action as ac_const from st2common.models.db import liveaction as lv_db_models from st2common.persistence import execution as ex_db_access from st2common.persistence import liveaction as lv_db_access from st2common.persistence import workflow as wf_db_access from st2common.runners import base as runners from st2common.runners import utils as runners_utils from st2common.services import action as ac_svc from st2common.services import policies as pc_svc from st2common.services import workflows as wf_svc from st2common.transport import liveaction as lv_ac_xport from st2common.transport import workflow as wf_ex_xport from st2common.transport import publishers from st2tests.mocks import liveaction as mock_lv_ac_xport from st2tests.mocks import workflow as mock_wf_ex_xport TEST_PACK = 'orquesta_tests' TEST_PACK_PATH = st2tests.fixturesloader.get_fixtures_packs_base_path() + '/' + TEST_PACK PACKS = [ TEST_PACK_PATH, st2tests.fixturesloader.get_fixtures_packs_base_path() + '/core' ] @mock.patch.object( publishers.CUDPublisher, 'publish_update', mock.MagicMock(return_value=None)) @mock.patch.object( lv_ac_xport.LiveActionPublisher, 'publish_create', mock.MagicMock(side_effect=mock_lv_ac_xport.MockLiveActionPublisher.publish_create)) @mock.patch.object( lv_ac_xport.LiveActionPublisher, 'publish_state', mock.MagicMock(side_effect=mock_lv_ac_xport.MockLiveActionPublisher.publish_state)) @mock.patch.object( wf_ex_xport.WorkflowExecutionPublisher, 'publish_create', mock.MagicMock(side_effect=mock_wf_ex_xport.MockWorkflowExecutionPublisher.publish_create)) @mock.patch.object( wf_ex_xport.WorkflowExecutionPublisher, 'publish_state', mock.MagicMock(side_effect=mock_wf_ex_xport.MockWorkflowExecutionPublisher.publish_state)) class OrquestaRunnerTest(st2tests.ExecutionDbTestCase): @classmethod def setUpClass(cls): super(OrquestaRunnerTest, cls).setUpClass() # Register runners. runnersregistrar.register_runners() # Register test pack(s). actions_registrar = actionsregistrar.ActionsRegistrar( use_pack_cache=False, fail_on_failure=True ) for pack in PACKS: actions_registrar.register_from_pack(pack) @classmethod def get_runner_class(cls, runner_name): return runners.get_runner(runner_name, runner_name).__class__ @mock.patch.object( runners_utils, 'invoke_post_run', mock.MagicMock(return_value=None)) def test_run_workflow(self): username = 'stanley' wf_meta = base.get_wf_fixture_meta_data(TEST_PACK_PATH, 'sequential.yaml') wf_input = {'who': 'Thanos'} lv_ac_db = lv_db_models.LiveActionDB(action=wf_meta['name'], parameters=wf_input) lv_ac_db, ac_ex_db = ac_svc.request(lv_ac_db) # The main action execution for this workflow is not under the context of another workflow. self.assertFalse(wf_svc.is_action_execution_under_workflow_context(ac_ex_db)) # Assert action execution is running. lv_ac_db = lv_db_access.LiveAction.get_by_id(str(lv_ac_db.id)) self.assertTrue(lv_ac_db.action_is_workflow) self.assertEqual(lv_ac_db.status, ac_const.LIVEACTION_STATUS_RUNNING, lv_ac_db.result) wf_ex_dbs = wf_db_access.WorkflowExecution.query(action_execution=str(ac_ex_db.id)) wf_ex_db = wf_ex_dbs[0] # Check required attributes. self.assertEqual(len(wf_ex_dbs), 1) self.assertIsNotNone(wf_ex_db.id) self.assertGreater(wf_ex_db.rev, 0) self.assertEqual(wf_ex_db.action_execution, str(ac_ex_db.id)) self.assertEqual(wf_ex_db.status, ac_const.LIVEACTION_STATUS_RUNNING) # Check context in the workflow execution. expected_wf_ex_ctx = { 'st2': { 'workflow_execution_id': str(wf_ex_db.id), 'action_execution_id': str(ac_ex_db.id), 'api_url': 'http://127.0.0.1/v1', 'user': username, 'pack': 'orquesta_tests', 'action': 'orquesta_tests.sequential', 'runner': 'orquesta' }, 'parent': { 'pack': 'orquesta_tests' } } self.assertDictEqual(wf_ex_db.context, expected_wf_ex_ctx) # Check context in the liveaction. expected_lv_ac_ctx = { 'workflow_execution': str(wf_ex_db.id), 'pack': 'orquesta_tests' } self.assertDictEqual(lv_ac_db.context, expected_lv_ac_ctx) # Check graph. self.assertIsNotNone(wf_ex_db.graph) self.assertIsInstance(wf_ex_db.graph, dict) self.assertIn('nodes', wf_ex_db.graph) self.assertIn('adjacency', wf_ex_db.graph) # Check task states. self.assertIsNotNone(wf_ex_db.state) self.assertIsInstance(wf_ex_db.state, dict) self.assertIn('tasks', wf_ex_db.state) self.assertIn('sequence', wf_ex_db.state) # Check input. self.assertDictEqual(wf_ex_db.input, wf_input) # Assert task1 is already completed. query_filters = {'workflow_execution': str(wf_ex_db.id), 'task_id': 'task1'} tk1_ex_db = wf_db_access.TaskExecution.query(**query_filters)[0] tk1_ac_ex_db = ex_db_access.ActionExecution.query(task_execution=str(tk1_ex_db.id))[0] tk1_lv_ac_db = lv_db_access.LiveAction.get_by_id(tk1_ac_ex_db.liveaction['id']) self.assertEqual(tk1_lv_ac_db.context.get('user'), username) self.assertEqual(tk1_lv_ac_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) self.assertTrue(wf_svc.is_action_execution_under_workflow_context(tk1_ac_ex_db)) # Manually handle action execution completion. wf_svc.handle_action_execution_completion(tk1_ac_ex_db) # Assert task1 succeeded and workflow is still running. tk1_ex_db = wf_db_access.TaskExecution.get_by_id(tk1_ex_db.id) self.assertEqual(tk1_ex_db.status, wf_statuses.SUCCEEDED) wf_ex_db = wf_db_access.WorkflowExecution.get_by_id(wf_ex_db.id) self.assertEqual(wf_ex_db.status, wf_statuses.RUNNING) # Assert task2 is already completed. query_filters = {'workflow_execution': str(wf_ex_db.id), 'task_id': 'task2'} tk2_ex_db = wf_db_access.TaskExecution.query(**query_filters)[0] tk2_ac_ex_db = ex_db_access.ActionExecution.query(task_execution=str(tk2_ex_db.id))[0] tk2_lv_ac_db = lv_db_access.LiveAction.get_by_id(tk2_ac_ex_db.liveaction['id']) self.assertEqual(tk2_lv_ac_db.context.get('user'), username) self.assertEqual(tk2_lv_ac_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) self.assertTrue(wf_svc.is_action_execution_under_workflow_context(tk2_ac_ex_db)) # Manually handle action execution completion. wf_svc.handle_action_execution_completion(tk2_ac_ex_db) # Assert task2 succeeded and workflow is still running. tk2_ex_db = wf_db_access.TaskExecution.get_by_id(tk2_ex_db.id) self.assertEqual(tk2_ex_db.status, wf_statuses.SUCCEEDED) wf_ex_db = wf_db_access.WorkflowExecution.get_by_id(wf_ex_db.id) self.assertEqual(wf_ex_db.status, wf_statuses.RUNNING) # Assert task3 is already completed. query_filters = {'workflow_execution': str(wf_ex_db.id), 'task_id': 'task3'} tk3_ex_db = wf_db_access.TaskExecution.query(**query_filters)[0] tk3_ac_ex_db = ex_db_access.ActionExecution.query(task_execution=str(tk3_ex_db.id))[0] tk3_lv_ac_db = lv_db_access.LiveAction.get_by_id(tk3_ac_ex_db.liveaction['id']) self.assertEqual(tk3_lv_ac_db.context.get('user'), username) self.assertEqual(tk3_lv_ac_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) self.assertTrue(wf_svc.is_action_execution_under_workflow_context(tk3_ac_ex_db)) # Manually handle action execution completion. wf_svc.handle_action_execution_completion(tk3_ac_ex_db) # Assert workflow is completed. wf_ex_db = wf_db_access.WorkflowExecution.get_by_id(wf_ex_db.id) self.assertEqual(wf_ex_db.status, wf_statuses.SUCCEEDED) lv_ac_db = lv_db_access.LiveAction.get_by_id(str(lv_ac_db.id)) self.assertEqual(lv_ac_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) ac_ex_db = ex_db_access.ActionExecution.get_by_id(str(ac_ex_db.id)) self.assertEqual(ac_ex_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) # Check post run is invoked for the liveaction. self.assertTrue(runners_utils.invoke_post_run.called) self.assertEqual(runners_utils.invoke_post_run.call_count, 1) # Check workflow output. expected_output = {'msg': '%s, All your base are belong to us!' % wf_input['who']} self.assertDictEqual(wf_ex_db.output, expected_output) # Check liveaction and action execution result. expected_result = {'output': expected_output} self.assertDictEqual(lv_ac_db.result, expected_result) self.assertDictEqual(ac_ex_db.result, expected_result) def test_run_workflow_with_unicode_input(self): wf_meta = base.get_wf_fixture_meta_data(TEST_PACK_PATH, 'sequential.yaml') wf_input = {'who': '薩諾斯'} lv_ac_db = lv_db_models.LiveActionDB(action=wf_meta['name'], parameters=wf_input) lv_ac_db, ac_ex_db = ac_svc.request(lv_ac_db) wf_ex_db = wf_db_access.WorkflowExecution.query(action_execution=str(ac_ex_db.id))[0] # Process task1. query_filters = {'workflow_execution': str(wf_ex_db.id), 'task_id': 'task1'} tk1_ex_db = wf_db_access.TaskExecution.query(**query_filters)[0] tk1_ac_ex_db = ex_db_access.ActionExecution.query(task_execution=str(tk1_ex_db.id))[0] tk1_lv_ac_db = lv_db_access.LiveAction.get_by_id(tk1_ac_ex_db.liveaction['id']) self.assertEqual(tk1_lv_ac_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) wf_svc.handle_action_execution_completion(tk1_ac_ex_db) tk1_ex_db = wf_db_access.TaskExecution.get_by_id(tk1_ex_db.id) self.assertEqual(tk1_ex_db.status, wf_statuses.SUCCEEDED) # Process task2. query_filters = {'workflow_execution': str(wf_ex_db.id), 'task_id': 'task2'} tk2_ex_db = wf_db_access.TaskExecution.query(**query_filters)[0] tk2_ac_ex_db = ex_db_access.ActionExecution.query(task_execution=str(tk2_ex_db.id))[0] tk2_lv_ac_db = lv_db_access.LiveAction.get_by_id(tk2_ac_ex_db.liveaction['id']) self.assertEqual(tk2_lv_ac_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) wf_svc.handle_action_execution_completion(tk2_ac_ex_db) tk2_ex_db = wf_db_access.TaskExecution.get_by_id(tk2_ex_db.id) self.assertEqual(tk2_ex_db.status, wf_statuses.SUCCEEDED) # Process task3. query_filters = {'workflow_execution': str(wf_ex_db.id), 'task_id': 'task3'} tk3_ex_db = wf_db_access.TaskExecution.query(**query_filters)[0] tk3_ac_ex_db = ex_db_access.ActionExecution.query(task_execution=str(tk3_ex_db.id))[0] tk3_lv_ac_db = lv_db_access.LiveAction.get_by_id(tk3_ac_ex_db.liveaction['id']) self.assertEqual(tk3_lv_ac_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) wf_svc.handle_action_execution_completion(tk3_ac_ex_db) tk3_ex_db = wf_db_access.TaskExecution.get_by_id(tk3_ex_db.id) self.assertEqual(tk3_ex_db.status, wf_statuses.SUCCEEDED) # Assert workflow is completed. wf_ex_db = wf_db_access.WorkflowExecution.get_by_id(wf_ex_db.id) self.assertEqual(wf_ex_db.status, wf_statuses.SUCCEEDED) lv_ac_db = lv_db_access.LiveAction.get_by_id(str(lv_ac_db.id)) self.assertEqual(lv_ac_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) ac_ex_db = ex_db_access.ActionExecution.get_by_id(str(ac_ex_db.id)) self.assertEqual(ac_ex_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) # Check workflow output. wf_input_val = wf_input['who'].decode('utf-8') if six.PY2 else wf_input['who'] expected_output = {'msg': '%s, All your base are belong to us!' % wf_input_val} self.assertDictEqual(wf_ex_db.output, expected_output) # Check liveaction and action execution result. expected_result = {'output': expected_output} self.assertDictEqual(lv_ac_db.result, expected_result) self.assertDictEqual(ac_ex_db.result, expected_result) def test_run_workflow_action_config_context(self): wf_meta = base.get_wf_fixture_meta_data(TEST_PACK_PATH, 'config-context.yaml') wf_input = {} lv_ac_db = lv_db_models.LiveActionDB(action=wf_meta['name'], parameters=wf_input) lv_ac_db, ac_ex_db = ac_svc.request(lv_ac_db) # Assert action execution is running. lv_ac_db = lv_db_access.LiveAction.get_by_id(str(lv_ac_db.id)) self.assertEqual(lv_ac_db.status, ac_const.LIVEACTION_STATUS_RUNNING, lv_ac_db.result) wf_ex_db = wf_db_access.WorkflowExecution.query(action_execution=str(ac_ex_db.id))[0] self.assertEqual(wf_ex_db.status, ac_const.LIVEACTION_STATUS_RUNNING) # Assert task1 is already completed. query_filters = {'workflow_execution': str(wf_ex_db.id), 'task_id': 'task1'} tk1_ex_db = wf_db_access.TaskExecution.query(**query_filters)[0] tk1_ac_ex_db = ex_db_access.ActionExecution.query(task_execution=str(tk1_ex_db.id))[0] tk1_lv_ac_db = lv_db_access.LiveAction.get_by_id(tk1_ac_ex_db.liveaction['id']) self.assertEqual(tk1_lv_ac_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) self.assertTrue(wf_svc.is_action_execution_under_workflow_context(tk1_ac_ex_db)) # Manually handle action execution completion. wf_svc.handle_action_execution_completion(tk1_ac_ex_db) # Assert workflow is completed. wf_ex_db = wf_db_access.WorkflowExecution.get_by_id(wf_ex_db.id) self.assertEqual(wf_ex_db.status, wf_statuses.SUCCEEDED) lv_ac_db = lv_db_access.LiveAction.get_by_id(str(lv_ac_db.id)) self.assertEqual(lv_ac_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) ac_ex_db = ex_db_access.ActionExecution.get_by_id(str(ac_ex_db.id)) self.assertEqual(ac_ex_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) # Verify config_context works self.assertEqual(wf_ex_db.output, {'msg': 'value of config key a'}) def test_run_workflow_with_action_less_tasks(self): wf_meta = base.get_wf_fixture_meta_data(TEST_PACK_PATH, 'action-less-tasks.yaml') wf_input = {'name': 'Thanos'} lv_ac_db = lv_db_models.LiveActionDB(action=wf_meta['name'], parameters=wf_input) lv_ac_db, ac_ex_db = ac_svc.request(lv_ac_db) # Assert action execution is running. lv_ac_db = lv_db_access.LiveAction.get_by_id(str(lv_ac_db.id)) self.assertEqual(lv_ac_db.status, ac_const.LIVEACTION_STATUS_RUNNING, lv_ac_db.result) wf_ex_db = wf_db_access.WorkflowExecution.query(action_execution=str(ac_ex_db.id))[0] self.assertEqual(wf_ex_db.status, ac_const.LIVEACTION_STATUS_RUNNING) # Assert task1 is already completed. query_filters = {'workflow_execution': str(wf_ex_db.id), 'task_id': 'task1'} tk1_ex_db = wf_db_access.TaskExecution.query(**query_filters)[0] tk1_ac_ex_dbs = ex_db_access.ActionExecution.query(task_execution=str(tk1_ex_db.id)) self.assertEqual(len(tk1_ac_ex_dbs), 0) self.assertEqual(tk1_ex_db.status, wf_statuses.SUCCEEDED) # Assert task2 is already completed. query_filters = {'workflow_execution': str(wf_ex_db.id), 'task_id': 'task2'} tk2_ex_db = wf_db_access.TaskExecution.query(**query_filters)[0] tk2_ac_ex_db = ex_db_access.ActionExecution.query(task_execution=str(tk2_ex_db.id))[0] tk2_lv_ac_db = lv_db_access.LiveAction.get_by_id(tk2_ac_ex_db.liveaction['id']) self.assertEqual(tk2_lv_ac_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) # Manually handle action execution completion. wf_svc.handle_action_execution_completion(tk2_ac_ex_db) # Assert task3 is already completed. query_filters = {'workflow_execution': str(wf_ex_db.id), 'task_id': 'task3'} tk3_ex_db = wf_db_access.TaskExecution.query(**query_filters)[0] tk3_ac_ex_db = ex_db_access.ActionExecution.query(task_execution=str(tk3_ex_db.id))[0] tk3_lv_ac_db = lv_db_access.LiveAction.get_by_id(tk3_ac_ex_db.liveaction['id']) self.assertEqual(tk3_lv_ac_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) # Manually handle action execution completion. wf_svc.handle_action_execution_completion(tk3_ac_ex_db) # Assert task4 is already completed. query_filters = {'workflow_execution': str(wf_ex_db.id), 'task_id': 'task4'} tk4_ex_db = wf_db_access.TaskExecution.query(**query_filters)[0] tk4_ac_ex_dbs = ex_db_access.ActionExecution.query(task_execution=str(tk4_ex_db.id)) self.assertEqual(len(tk4_ac_ex_dbs), 0) self.assertEqual(tk4_ex_db.status, wf_statuses.SUCCEEDED) # Assert task5 is already completed. query_filters = {'workflow_execution': str(wf_ex_db.id), 'task_id': 'task5'} tk5_ex_db = wf_db_access.TaskExecution.query(**query_filters)[0] tk5_ac_ex_db = ex_db_access.ActionExecution.query(task_execution=str(tk5_ex_db.id))[0] tk5_lv_ac_db = lv_db_access.LiveAction.get_by_id(tk5_ac_ex_db.liveaction['id']) self.assertEqual(tk5_lv_ac_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) # Manually handle action execution completion. wf_svc.handle_action_execution_completion(tk5_ac_ex_db) # Assert workflow is completed. wf_ex_db = wf_db_access.WorkflowExecution.get_by_id(wf_ex_db.id) self.assertEqual(wf_ex_db.status, wf_statuses.SUCCEEDED) lv_ac_db = lv_db_access.LiveAction.get_by_id(str(lv_ac_db.id)) self.assertEqual(lv_ac_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) ac_ex_db = ex_db_access.ActionExecution.get_by_id(str(ac_ex_db.id)) self.assertEqual(ac_ex_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) # Check workflow output. expected_output = {'greeting': '%s, All your base are belong to us!' % wf_input['name']} expected_output['greeting'] = expected_output['greeting'].upper() self.assertDictEqual(wf_ex_db.output, expected_output) # Check liveaction and action execution result. expected_result = {'output': expected_output} self.assertDictEqual(lv_ac_db.result, expected_result) self.assertDictEqual(ac_ex_db.result, expected_result) @mock.patch.object( pc_svc, 'apply_post_run_policies', mock.MagicMock(return_value=None)) def test_handle_action_execution_completion(self): wf_meta = base.get_wf_fixture_meta_data(TEST_PACK_PATH, 'subworkflow.yaml') lv_ac_db = lv_db_models.LiveActionDB(action=wf_meta['name']) lv_ac_db, ac_ex_db = ac_svc.request(lv_ac_db) lv_ac_db = lv_db_access.LiveAction.get_by_id(str(lv_ac_db.id)) self.assertEqual(lv_ac_db.status, ac_const.LIVEACTION_STATUS_RUNNING, lv_ac_db.result) # Identify the records for the main workflow. wf_ex_db = wf_db_access.WorkflowExecution.query(action_execution=str(ac_ex_db.id))[0] tk_ex_dbs = wf_db_access.TaskExecution.query(workflow_execution=str(wf_ex_db.id)) self.assertEqual(len(tk_ex_dbs), 1) # Identify the records for the tasks. t1_ac_ex_db = ex_db_access.ActionExecution.query(task_execution=str(tk_ex_dbs[0].id))[0] t1_wf_ex_db = wf_db_access.WorkflowExecution.query(action_execution=str(t1_ac_ex_db.id))[0] self.assertEqual(t1_ac_ex_db.status, ac_const.LIVEACTION_STATUS_RUNNING) self.assertEqual(t1_wf_ex_db.status, wf_statuses.RUNNING) # Manually notify action execution completion for the tasks. # Assert policies are not applied in the notifier. t1_t1_ex_db = wf_db_access.TaskExecution.query(workflow_execution=str(t1_wf_ex_db.id))[0] t1_t1_ac_ex_db = ex_db_access.ActionExecution.query(task_execution=str(t1_t1_ex_db.id))[0] notifier.get_notifier().process(t1_t1_ac_ex_db) self.assertFalse(pc_svc.apply_post_run_policies.called) t1_tk_ex_dbs = wf_db_access.TaskExecution.query(workflow_execution=str(t1_wf_ex_db.id)) self.assertEqual(len(t1_tk_ex_dbs), 1) workflows.get_engine().process(t1_t1_ac_ex_db) self.assertTrue(pc_svc.apply_post_run_policies.called) pc_svc.apply_post_run_policies.reset_mock() t1_t2_ex_db = wf_db_access.TaskExecution.query(workflow_execution=str(t1_wf_ex_db.id))[1] t1_t2_ac_ex_db = ex_db_access.ActionExecution.query(task_execution=str(t1_t2_ex_db.id))[0] notifier.get_notifier().process(t1_t2_ac_ex_db) self.assertFalse(pc_svc.apply_post_run_policies.called) t1_tk_ex_dbs = wf_db_access.TaskExecution.query(workflow_execution=str(t1_wf_ex_db.id)) self.assertEqual(len(t1_tk_ex_dbs), 2) workflows.get_engine().process(t1_t2_ac_ex_db) self.assertTrue(pc_svc.apply_post_run_policies.called) pc_svc.apply_post_run_policies.reset_mock() t1_t3_ex_db = wf_db_access.TaskExecution.query(workflow_execution=str(t1_wf_ex_db.id))[2] t1_t3_ac_ex_db = ex_db_access.ActionExecution.query(task_execution=str(t1_t3_ex_db.id))[0] notifier.get_notifier().process(t1_t3_ac_ex_db) self.assertFalse(pc_svc.apply_post_run_policies.called) t1_tk_ex_dbs = wf_db_access.TaskExecution.query(workflow_execution=str(t1_wf_ex_db.id)) self.assertEqual(len(t1_tk_ex_dbs), 3) workflows.get_engine().process(t1_t3_ac_ex_db) self.assertTrue(pc_svc.apply_post_run_policies.called) pc_svc.apply_post_run_policies.reset_mock() t1_ac_ex_db = ex_db_access.ActionExecution.get_by_id(t1_ac_ex_db.id) notifier.get_notifier().process(t1_ac_ex_db) self.assertFalse(pc_svc.apply_post_run_policies.called) tk_ex_dbs = wf_db_access.TaskExecution.query(workflow_execution=str(wf_ex_db.id)) self.assertEqual(len(tk_ex_dbs), 1) workflows.get_engine().process(t1_ac_ex_db) self.assertTrue(pc_svc.apply_post_run_policies.called) pc_svc.apply_post_run_policies.reset_mock() t2_ex_db_qry = {'workflow_execution': str(wf_ex_db.id), 'task_id': 'task2'} t2_ex_db = wf_db_access.TaskExecution.query(**t2_ex_db_qry)[0] t2_ac_ex_db = ex_db_access.ActionExecution.query(task_execution=str(t2_ex_db.id))[0] self.assertEqual(t2_ac_ex_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED) notifier.get_notifier().process(t2_ac_ex_db) self.assertFalse(pc_svc.apply_post_run_policies.called) tk_ex_dbs = wf_db_access.TaskExecution.query(workflow_execution=str(wf_ex_db.id)) self.assertEqual(len(tk_ex_dbs), 2) workflows.get_engine().process(t2_ac_ex_db) self.assertTrue(pc_svc.apply_post_run_policies.called) pc_svc.apply_post_run_policies.reset_mock() # Assert the main workflow is completed. lv_ac_db = lv_db_access.LiveAction.get_by_id(str(lv_ac_db.id)) self.assertEqual(lv_ac_db.status, ac_const.LIVEACTION_STATUS_SUCCEEDED)

50.271984

99

0.735183

3,667

24,583

4.515408

0.076357

0.054354

0.029714

0.036719

0.807042

0.759331

0.740428

0.720981

0.697669

0.676229

0

0.013748

0.171501

24,583

488

100

50.375

0.799234

0.098971

0

0.529412

0

0.050036

0.004121

0

0.282353

1

0.020588

false

0

0.076471

0.002941

0.102941

0

null

0

1

0

1

0

null

0

5

22e0b2059d0115125ee88f485bde4473b1630338

269

py

Python

amnesia/modules/content_type/validation/__init__.py

silenius/amnesia

ba5e3ac79a89da599c22206ad1fd17541855f74c

[ "BSD-2-Clause" ]

4

2015-05-08T10:57:56.000Z

2021-05-17T04:32:11.000Z

amnesia/modules/content_type/validation/__init__.py

silenius/amnesia

ba5e3ac79a89da599c22206ad1fd17541855f74c

[ "BSD-2-Clause" ]

6

2019-12-26T16:43:41.000Z

2022-02-28T11:07:54.000Z

amnesia/modules/content_type/validation/__init__.py

silenius/amnesia

ba5e3ac79a89da599c22206ad1fd17541855f74c

[ "BSD-2-Clause" ]

1

2019-09-23T14:08:11.000Z

# -*- coding: utf-8 -*- from marshmallow import Schema from marshmallow.fields import Integer from marshmallow.fields import String class ContentTypeSchema(Schema): id = Integer(dump_only=True) name = String() icon = String() description = String()

19.214286

38

0.710037

31

269

6.129032

0.612903

0.236842

0.221053

0.284211

0

0.004587

0.189591

269

13

39

20.692308

0.866972

0.078067

0

1

0

false

0

0.375

0

1

0

null

1

0

null

0

1

0

1

0

5

22eeb868a5a54684c242d66a584d4a24ffcce575

48

py

Python

Lib/test/test_compiler/testcorpus/75_classderef.py

diogommartins/cinder

79103e9119cbecef3b085ccf2878f00c26e1d175

[ "CNRI-Python-GPL-Compatible" ]

1,886

2021-05-03T23:58:43.000Z

2022-03-31T19:15:58.000Z

Lib/test/test_compiler/testcorpus/75_classderef.py

diogommartins/cinder

79103e9119cbecef3b085ccf2878f00c26e1d175

[ "CNRI-Python-GPL-Compatible" ]

70

2021-05-04T23:25:35.000Z

2022-03-31T18:42:08.000Z

Lib/test/test_compiler/testcorpus/75_classderef.py

diogommartins/cinder

79103e9119cbecef3b085ccf2878f00c26e1d175

[ "CNRI-Python-GPL-Compatible" ]

52

2021-05-04T21:26:03.000Z

2022-03-08T18:02:56.000Z

def foo(bar): class Foo: call(bar)

9.6

17

0.5

7

48

3.428571

0.714286

0

0.375

48

4

18

12

0.8

0

1

0.333333

false

0

0.666667

0

1

0

null

0

1

0

null

0

1

0

1

0

5

a3c5844f14684a43226416e2bebfbaa36c1dd117

80

py

Python

konfuzio_sdk/__init__.py

atraining/document-ai-python-sdk

ea2df68af0254053da7e6f4c6e2c2df6d7911233

[ "MIT" ]

9

2021-05-07T16:08:53.000Z

2022-02-17T16:46:40.000Z

konfuzio_sdk/__init__.py

atraining/document-ai-python-sdk

ea2df68af0254053da7e6f4c6e2c2df6d7911233

[ "MIT" ]

17

2021-05-03T11:34:05.000Z

2022-03-06T09:53:58.000Z

konfuzio_sdk/__init__.py

atraining/document-ai-python-sdk

ea2df68af0254053da7e6f4c6e2c2df6d7911233

[ "MIT" ]

5

2021-05-28T14:42:10.000Z

2022-02-28T09:35:04.000Z

"""Relative import of all settings.""" from .settings_importer import * # NOQA

26.666667

40

0.725

10

80

5.7

0.8

0

0.15

80

2

41

40

0.838235

0.475

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

a3c783c3203734fa4a381ce7cf5a0b0ade63f05e

8,008

py

Python

examples/server/tests/test_views.py

malaman/django-angular

d73cb90a3d3212bc29839f33a516c5e2892872a2

[ "MIT" ]

null

examples/server/tests/test_views.py

malaman/django-angular

d73cb90a3d3212bc29839f33a516c5e2892872a2

[ "MIT" ]

null

examples/server/tests/test_views.py

malaman/django-angular

d73cb90a3d3212bc29839f33a516c5e2892872a2

[ "MIT" ]

3

2017-08-29T09:59:36.000Z

2021-02-05T05:01:04.000Z

# -*- coding: utf-8 -*- import json import warnings from django.test import TestCase from django.test.client import RequestFactory from django.core.serializers.json import DjangoJSONEncoder from django.http import HttpResponse from django.views.generic import View from djangular.views.mixins import JSONResponseMixin, allow_remote_invocation, allowed_action class JSONResponseView(JSONResponseMixin, View): @allow_remote_invocation def method_allowed(self, in_data=None): return {'success': True} @allow_remote_invocation def method_echo(self, in_data=None): return {'success': True, 'echo': in_data} def method_forbidden(self, in_data=None): """ decorator @allow_remote_invocation is missing """ return {'success': True} @allowed_action def deprecated_action(self, in_data): return {'success': True} class DummyView(View): def get(self, request, *args, **kwargs): return HttpResponse('GET OK') def post(self, request, *args, **kwargs): return HttpResponse(request.POST.get('foo')) class DummyResponseView(JSONResponseMixin, DummyView): pass class JSONResponseMixinTest(TestCase): def setUp(self): self.factory = RequestFactory() self.data = {'foo': 'bar'} def test_post_method_echo(self): request = self.factory.post('/dummy.json', data=json.dumps(self.data, cls=DjangoJSONEncoder), content_type='application/json; charset=utf-8;', HTTP_DJNG_REMOTE_METHOD='method_echo', HTTP_X_REQUESTED_WITH='XMLHttpRequest') response = JSONResponseView().post(request) self.assertIsInstance(response, HttpResponse) self.assertEqual(response.status_code, 200) out_data = json.loads(response.content.decode('utf-8')) self.assertTrue(out_data['success']) self.assertDictEqual(out_data['echo'], self.data) def test_csrf_exempt_dispatch(self): request = self.factory.post('/dummy.json') response = JSONResponseView.as_view()(request) self.assertIsInstance(response, HttpResponse) self.assertEqual(response.status_code, 405) self.assertEqual(response.content.decode('utf-8'), 'This view can not handle method POST') def test_post_method_undefined(self): request = self.factory.post('/dummy.json', data=json.dumps(self.data, cls=DjangoJSONEncoder), content_type='application/json; charset=utf-8;', HTTP_X_REQUESTED_WITH='XMLHttpRequest') response = JSONResponseView().post(request) self.assertIsInstance(response, HttpResponse) self.assertEqual(response.status_code, 405) self.assertEqual(response.content.decode('utf-8'), 'This view can not handle method POST') def test_post_method_not_callable(self): request = self.factory.post('/dummy.json', data=json.dumps(self.data, cls=DjangoJSONEncoder), content_type='application/json; charset=utf-8;', HTTP_DJNG_REMOTE_METHOD='no_such_method', HTTP_X_REQUESTED_WITH='XMLHttpRequest') response = JSONResponseView().post(request) self.assertIsInstance(response, HttpResponse) self.assertEqual(response.status_code, 405) self.assertEqual(response.content.decode('utf-8'), 'This view can not handle method POST') def test_post_method_is_forbidden(self): request = self.factory.post('/dummy.json', data=json.dumps(self.data, cls=DjangoJSONEncoder), content_type='application/json; charset=utf-8;', HTTP_DJNG_REMOTE_METHOD='method_forbidden', HTTP_X_REQUESTED_WITH='XMLHttpRequest') response = JSONResponseView().post(request) self.assertIsInstance(response, HttpResponse) self.assertEqual(response.status_code, 403) self.assertEqual(response.content.decode('utf-8'), "Method 'JSONResponseView.method_forbidden' has no decorator '@allow_remote_invocation'") def test_post_deprecated_action(self): with warnings.catch_warnings(record=True) as w: data = {'foo': 'bar', 'action': 'deprecated_action'} request = self.factory.post('/dummy.json', data=json.dumps(data, cls=DjangoJSONEncoder), content_type='application/json; charset=utf-8;', HTTP_X_REQUESTED_WITH='XMLHttpRequest') response = JSONResponseView().post(request) self.assertIsInstance(response, HttpResponse) self.assertEqual(response.status_code, 200) out_data = json.loads(response.content.decode('utf-8')) self.assertTrue(out_data['success']) self.assertEqual(str(w[0].message), "Using the keyword 'action' inside the payload is deprecated. Please use 'djangoRMI' from module 'ng.django.forms'") def test_get_method_forbidden_ok(self): request = self.factory.get('/dummy.json', HTTP_X_REQUESTED_WITH='XMLHttpRequest') response = JSONResponseView().get(request, invoke_method='method_forbidden') self.assertIsInstance(response, HttpResponse) self.assertEqual(response.status_code, 200) out_data = json.loads(response.content.decode('utf-8')) self.assertTrue(out_data['success']) def test_get_deprecated_action(self): with warnings.catch_warnings(record=True) as w: request = self.factory.get('/dummy.json', HTTP_X_REQUESTED_WITH='XMLHttpRequest') response = JSONResponseView().get(request, action='method_forbidden') self.assertIsInstance(response, HttpResponse) self.assertEqual(response.status_code, 200) out_data = json.loads(response.content.decode('utf-8')) self.assertTrue(out_data['success']) self.assertEqual(str(w[0].message), "Using the keyword 'action' in URLresolvers is deprecated. Please use 'invoke_method' instead") def test_get_method_forbidden_fail(self): request = self.factory.get('/dummy.json', HTTP_DJNG_REMOTE_METHOD='method_forbidden', HTTP_X_REQUESTED_WITH='XMLHttpRequest') response = JSONResponseView().get(request) self.assertIsInstance(response, HttpResponse) self.assertEqual(response.status_code, 403) self.assertEqual(response.content.decode('utf-8'), "Method 'JSONResponseView.method_forbidden' has no decorator '@allow_remote_invocation'") def test_get_method_not_callable(self): request = self.factory.get('/dummy.json', HTTP_DJNG_REMOTE_METHOD='no_such_method', HTTP_X_REQUESTED_WITH='XMLHttpRequest') response = JSONResponseView().get(request) self.assertEqual(response.status_code, 405) self.assertEqual(response.content.decode('utf-8'), "This view can not handle method GET") def test_get_method_allowed(self): request = self.factory.get('/dummy.json', HTTP_DJNG_REMOTE_METHOD='method_allowed', HTTP_X_REQUESTED_WITH='XMLHttpRequest') response = JSONResponseView().get(request) self.assertIsInstance(response, HttpResponse) self.assertEqual(response.status_code, 200) out_data = json.loads(response.content.decode('utf-8')) self.assertTrue(out_data['success']) def test_post_pass_through(self): request = self.factory.post('/dummy.json', data=self.data) response = DummyResponseView().post(request) self.assertIsInstance(response, HttpResponse) self.assertEqual(response.status_code, 200) self.assertEqual(response.content.decode('utf-8'), 'bar') def test_get_pass_through(self): request = self.factory.get('/dummy.json') response = DummyResponseView.as_view()(request) self.assertIsInstance(response, HttpResponse) self.assertEqual(response.status_code, 200) self.assertEqual(response.content.decode('utf-8'), 'GET OK')

46.289017

164

0.687937

906

8,008

5.900662

0.131347

0.049383

0.090348

0.07052

0.788814

0.768238

0.749532

0.719791

0.711747

0.703517

0

0.009339

0.197677

8,008

172

165

46.55814

0.822724

0.008492

0

0.601399

0

0.006993

0.160308

0.015412

0

0.286713

1

0.13986

false

0.020979

0.055944

0.034965

0.265734

0

null

0

1

0

null

0

5

432246e5357171a08683f27746d90904334e91ca

148

py

Python

selenible/drivers/edge.py

wtnb75/selenible

9a73c1c6b31f281992904cb63a4f7516e49d9e42

[ "MIT" ]

2

2020-04-24T16:38:09.000Z

2021-01-28T12:21:37.000Z

selenible/drivers/edge.py

wtnb75/selenible

9a73c1c6b31f281992904cb63a4f7516e49d9e42

[ "MIT" ]

21

2018-05-14T14:31:45.000Z

2019-07-18T03:44:16.000Z

selenible/drivers/edge.py

wtnb75/selenible

9a73c1c6b31f281992904cb63a4f7516e49d9e42

[ "MIT" ]

3

2018-11-29T07:01:02.000Z

2019-04-21T17:13:57.000Z

from selenium import webdriver from . import Base class Edge(Base): def boot_driver(self): return webdriver.Edge(**self.browser_args)

18.5

50

0.722973

20

148

5.25

0.7

0

0.189189

148

7

51

21.142857

0.875

0

1

0.2

false

0

0.4

0.2

1

0

1

0

null

0

1

0

null

0

1

0

5

4a59fe6e9a23a1d1af7b48badc3873937c0aa6c0

922

py

Python

torchdistill/core/forward_proc.py

AhmedHussKhalifa/torchdistill

071089765f95aa09da9573039ac2bd54f47cea1e

[ "MIT" ]

576

2020-11-26T03:20:50.000Z

2022-03-31T16:42:49.000Z

torchdistill/core/forward_proc.py

AhmedHussKhalifa/torchdistill

071089765f95aa09da9573039ac2bd54f47cea1e

[ "MIT" ]

24

2020-12-02T12:16:44.000Z

2022-02-17T16:14:49.000Z

torchdistill/core/forward_proc.py

AhmedHussKhalifa/torchdistill

071089765f95aa09da9573039ac2bd54f47cea1e

[ "MIT" ]

60

2020-11-26T03:27:04.000Z

2022-03-30T09:49:00.000Z

PROC_FUNC_DICT = dict() def register_forward_proc_func(func): PROC_FUNC_DICT[func.__name__] = func return func @register_forward_proc_func def forward_batch_only(model, sample_batch, targets=None, supp_dict=None): return model(sample_batch) @register_forward_proc_func def forward_batch_target(model, sample_batch, targets, supp_dict=None): return model(sample_batch, targets) @register_forward_proc_func def forward_batch_supp_dict(model, sample_batch, targets, supp_dict=None): return model(sample_batch, supp_dict) @register_forward_proc_func def forward_batch4sskd(model, sample_batch, targets=None, supp_dict=None): c, h, w = sample_batch.size()[-3:] sample_batch = sample_batch.view(-1, c, h, w) return model(sample_batch) def get_forward_proc_func(func_name): if func_name not in PROC_FUNC_DICT: return forward_batch_only return PROC_FUNC_DICT[func_name]

26.342857

74

0.778742

140

922

4.707143

0.2

0.183612

0.194234

0.174507

0.608498

0.5478

0.497724

0.291351

0.172989

0

0.003769

0.136659

922

34

75

27.117647

0.824121

0

0.272727

0

1

0.272727

false

0

0.136364

0.590909

0

null

0

1

0

null

0

1

0

1

0

5

4a6cf1f4b64129f3c7b92b1532484fdef2837e21

40,624

py

Python

plivo.py

ankitpopli1891/plivo-python

5ec49443b08ec05d002025d3383e44ea8a3d2fd5

[ "MIT" ]

3

2015-06-24T16:46:46.000Z

2015-06-30T01:16:28.000Z

plivo.py

ankitpopli1891/plivo-python

5ec49443b08ec05d002025d3383e44ea8a3d2fd5

[ "MIT" ]

null

plivo.py

ankitpopli1891/plivo-python

5ec49443b08ec05d002025d3383e44ea8a3d2fd5

[ "MIT" ]

null

import base64 import hmac from hashlib import sha1 import requests import plivoxml as XML try: import json except ImportError: import simplejson as json PLIVO_VERSION = "v1" class PlivoError(Exception): pass def validate_signature(uri, post_params, signature, auth_token): for k, v in sorted(post_params.items()): uri += k + v return base64.encodestring(hmac.new(auth_token, uri, sha1).digest()).strip() == signature class RestAPI(object): def __init__(self, auth_id, auth_token, url='https://api.plivo.com', version=PLIVO_VERSION): self.version = version self.url = url.rstrip('/') + '/' + self.version self.auth_id = auth_id self.auth_token = auth_token self._api = self.url + '/Account/%s' % self.auth_id self.headers = {'User-Agent':'PythonPlivo'} self.Call = Call(self) self.Number = Number(self) self.Account = Account(self) self.SubAccount = SubAccount(self) self.Application = Application(self) self.Carrier = Carrier(self) self.Message = Message(self) self.Pricing = Pricing(self) self.EndPoint = EndPoint(self) self.Recording = Recording(self) self.Conference = Conference(self) self.ConferenceMember = ConferenceMember(self) def _request(self, method, path, data={}): path = path.rstrip('/') + '/' if method == 'POST': headers = {'content-type': 'application/json'} headers.update(self.headers) r = requests.post(self._api + path, headers=headers, auth=(self.auth_id, self.auth_token), data=json.dumps(data)) elif method == 'GET': r = requests.get(self._api + path, headers=self.headers, auth=(self.auth_id, self.auth_token), params=data) elif method == 'DELETE': r = requests.delete(self._api + path, headers=self.headers, auth=(self.auth_id, self.auth_token), params=data) elif method == 'PUT': headers = {'content-type': 'application/json'} headers.update(self.headers) r = requests.put(self._api + path, headers=headers, auth=(self.auth_id, self.auth_token), data=json.dumps(data)) content = r.content if content: try: if isinstance(content, bytes): content = content.decode() response = json.loads(content) except ValueError: response = content else: response = content return (r.status_code, response) @staticmethod def get_param(params, key): try: return params[key] except KeyError: raise PlivoError("missing mandatory parameter %s" % key) ## Accounts ## def get_account(self, params=None): if not params: params = {} return self._request('GET', '', data=params) def modify_account(self, params=None): if not params: params = {} return self._request('POST', '', data=params) def get_subaccounts(self, params=None): if not params: params = {} return self._request('GET', '/Subaccount/', data=params) def create_subaccount(self, params=None): if not params: params = {} return self._request('POST', '/Subaccount/', data=params) def get_subaccount(self, params=None): if not params: params = {} subauth_id = params.pop("subauth_id") return self._request('GET', '/Subaccount/%s/' % subauth_id, data=params) def modify_subaccount(self, params=None): if not params: params = {} subauth_id = params.pop("subauth_id") return self._request('POST', '/Subaccount/%s/' % subauth_id, data=params) def delete_subaccount(self, params=None): if not params: params = {} subauth_id = params.pop("subauth_id") return self._request('DELETE', '/Subaccount/%s/' % subauth_id, data=params) ## Applications ## def get_applications(self, params=None): if not params: params = {} return self._request('GET', '/Application/', data=params) def create_application(self, params=None): if not params: params = {} return self._request('POST', '/Application/', data=params) def get_application(self, params=None): if not params: params = {} app_id = params.pop("app_id") return self._request('GET', '/Application/%s/' % app_id, data=params) def modify_application(self, params=None): if not params: params = {} app_id = params.pop("app_id") return self._request('POST', '/Application/%s/' % app_id, data=params) def delete_application(self, params=None): if not params: params = {} app_id = params.pop("app_id") return self._request('DELETE', '/Application/%s/' % app_id, data=params) ## Numbers ## def get_numbers(self, params=None): if not params: params = {} return self._request('GET', '/Number/', data=params) def search_numbers(self, params=None): raise PendingDeprecationWarning("This API is deprecated. Consider " "using get_number_group_details") if not params: params = {} return self._request('GET', '/AvailableNumber/', data=params) def search_phone_numbers(self, params=None): if not params: params = {} return self._request('GET', '/PhoneNumber/', data=params) def get_number(self, params=None): if not params: params = {} number = params.pop("number") return self._request('GET', '/Number/%s/' % number, data=params) def rent_number(self, params=None): raise PendingDeprecationWarning("This API is deprecated. Consider " "using rent_from_number_group") if not params: params = {} number = params.pop("number") return self._request('POST', '/AvailableNumber/%s/' % number, data=params) def buy_phone_number(self, params=None): if not params: params = {} number = params.pop("number") return self._request('POST', '/PhoneNumber/%s/' % number, data=params) def unrent_number(self, params=None): if not params: params = {} number = params.pop("number") return self._request('DELETE', '/Number/%s/' % number, data=params) def add_carrier_number(self, params=None): if not params: params = {} return self._request('POST', '/Number/', data=params) def modify_number(self, params=None): if not params: params = {} number = params.pop("number") return self._request('POST', '/Number/%s/' % number, data=params) def link_application_number(self, params=None): if not params: params = {} number = params.pop("number") return self._request('POST', '/Number/%s/' % number, data=params) def unlink_application_number(self, params=None): if not params: params = {} number = params.pop("number") params = {'app_id':''} return self._request('POST', '/Number/%s/' % number, data=params) def get_number_group(self, params=None): if not params: params = {} return self._request('GET', '/AvailableNumberGroup/', data=params) def get_number_group_details(self, params=None): if not params: params = {} group_id = params.pop('group_id') return self._request('GET', '/AvailableNumberGroup/%s/' % group_id, data=params) def rent_from_number_group(self, params=None): if not params: params = {} group_id = params.pop('group_id') return self._request('POST', '/AvailableNumberGroup/%s/' % group_id, data=params) ## Calls ## def get_cdrs(self, params=None): if not params: params = {} return self._request('GET', '/Call/', data=params) def get_cdr(self, params=None): if not params: params = {} call_uuid = params.pop('call_uuid') return self._request('GET', '/Call/%s/' % call_uuid, data=params) def get_live_calls(self, params=None): if not params: params = {} params['status'] = 'live' return self._request('GET', '/Call/', data=params) def get_live_call(self, params=None): if not params: params={} params['status'] = 'live' call_uuid = params.pop('call_uuid') return self._request('GET', '/Call/%s/' % call_uuid, data=params) def make_call(self, params=None): if not params: params = {} return self._request('POST', '/Call/', data=params) def hangup_all_calls(self, params=None): if not params: params = {} return self._request('DELETE', '/Call/', data=params) def transfer_call(self, params=None): if not params: params = {} call_uuid = params.pop('call_uuid') return self._request('POST', '/Call/%s/' % call_uuid, data=params) def hangup_call(self, params=None): if not params: params = {} call_uuid = params.pop('call_uuid') return self._request('DELETE', '/Call/%s/' % call_uuid, data=params) def record(self, params=None): if not params: params = {} call_uuid = params.pop('call_uuid') return self._request('POST', '/Call/%s/Record/' % call_uuid, data=params) def stop_record(self, params=None): if not params: params = {} call_uuid = params.pop('call_uuid') return self._request('DELETE', '/Call/%s/Record/' % call_uuid, data=params) def play(self, params=None): if not params: params = {} call_uuid = params.pop('call_uuid') return self._request('POST', '/Call/%s/Play/' % call_uuid, data=params) def stop_play(self, params=None): if not params: params = {} call_uuid = params.pop('call_uuid') return self._request('DELETE', '/Call/%s/Play/' % call_uuid, data=params) def speak(self, params=None): if not params: params = {} call_uuid = params.pop('call_uuid') return self._request('POST', '/Call/%s/Speak/' % call_uuid, data=params) def stop_speak(self, params=None): if not params: params = {} call_uuid = params.pop('call_uuid') return self._request('DELETE', '/Call/%s/Speak/' % call_uuid, data=params) def send_digits(self, params=None): if not params: params = {} call_uuid = params.pop('call_uuid') return self._request('POST', '/Call/%s/DTMF/' % call_uuid, data=params) ## Calls requests ## def hangup_request(self, params=None): if not params: params = {} request_uuid = params.pop('request_uuid') return self._request('DELETE', '/Request/%s/' % request_uuid, data=params) ## Conferences ## def get_live_conferences(self, params=None): if not params: params = {} return self._request('GET', '/Conference/', data=params) def hangup_all_conferences(self, params=None): if not params: params = {} return self._request('DELETE', '/Conference/', data=params) def get_live_conference(self, params=None): if not params: params = {} conference_name = params.pop('conference_name') return self._request('GET', '/Conference/%s/' % conference_name, data=params) def hangup_conference(self, params=None): if not params: params = {} conference_name = params.pop('conference_name') return self._request('DELETE', '/Conference/%s/' % conference_name, data=params) def hangup_member(self, params=None): if not params: params = {} conference_name = params.pop('conference_name') member_id = params.pop('member_id') return self._request('DELETE', '/Conference/%s/Member/%s/' % (conference_name, member_id), data=params) def play_member(self, params=None): if not params: params = {} conference_name = params.pop('conference_name') member_id = params.pop('member_id') return self._request('POST', '/Conference/%s/Member/%s/Play/' % (conference_name, member_id), data=params) def stop_play_member(self, params=None): if not params: params = {} conference_name = params.pop('conference_name') member_id = params.pop('member_id') return self._request('DELETE', '/Conference/%s/Member/%s/Play/' % (conference_name, member_id), data=params) def speak_member(self, params=None): if not params: params = {} conference_name = params.pop('conference_name') member_id = params.pop('member_id') return self._request('POST', '/Conference/%s/Member/%s/Speak/' % (conference_name, member_id), data=params) def deaf_member(self, params=None): if not params: params = {} conference_name = params.pop('conference_name') member_id = params.pop('member_id') return self._request('POST', '/Conference/%s/Member/%s/Deaf/' % (conference_name, member_id), data=params) def undeaf_member(self, params=None): if not params: params = {} conference_name = params.pop('conference_name') member_id = params.pop('member_id') return self._request('DELETE', '/Conference/%s/Member/%s/Deaf/' % (conference_name, member_id), data=params) def mute_member(self, params=None): if not params: params = {} conference_name = params.pop('conference_name') member_id = params.pop('member_id') return self._request('POST', '/Conference/%s/Member/%s/Mute/' % (conference_name, member_id), data=params) def unmute_member(self, params=None): if not params: params = {} conference_name = params.pop('conference_name') member_id = params.pop('member_id') return self._request('DELETE', '/Conference/%s/Member/%s/Mute/' % (conference_name, member_id), data=params) def kick_member(self, params=None): if not params: params = {} conference_name = params.pop('conference_name') member_id = params.pop('member_id') return self._request('POST', '/Conference/%s/Member/%s/Kick/' % (conference_name, member_id), data=params) def record_conference(self, params=None): if not params: params = {} conference_name = params.pop('conference_name') return self._request('POST', '/Conference/%s/Record/' % conference_name, data=params) def stop_record_conference(self, params=None): if not params: params = {} conference_name = params.pop('conference_name') return self._request('DELETE', '/Conference/%s/Record/' % conference_name, data=params) ## Recordings ## def get_recordings(self, params=None): if not params: params = {} return self._request('GET', '/Recording/', data=params) def get_recording(self, params=None): if not params: params = {} recording_id = params.pop('recording_id') return self._request('GET', '/Recording/%s/' % recording_id, data=params) def delete_recording(self, params=None): if not params: params = {} recording_id = params.pop('recording_id') return self._request('DELETE', '/Recording/%s/' % recording_id, data=params) ## Endpoints ## def get_endpoints(self, params=None): if not params: params = {} return self._request('GET', '/Endpoint/', data=params) def create_endpoint(self, params=None): if not params: params = {} return self._request('POST', '/Endpoint/', data=params) def get_endpoint(self, params=None): if not params: params = {} endpoint_id = params.pop('endpoint_id') return self._request('GET', '/Endpoint/%s/' % endpoint_id, data=params) def modify_endpoint(self, params=None): if not params: params = {} endpoint_id = params.pop('endpoint_id') return self._request('POST', '/Endpoint/%s/' % endpoint_id, data=params) def delete_endpoint(self, params=None): if not params: params = {} endpoint_id = params.pop('endpoint_id') return self._request('DELETE', '/Endpoint/%s/' % endpoint_id, data=params) ## Incoming Carriers ## def get_incoming_carriers(self, params=None): if not params: params = {} return self._request('GET', '/IncomingCarrier/', data=params) def create_incoming_carrier(self, params=None): if not params: params = {} return self._request('POST', '/IncomingCarrier/', data=params) def get_incoming_carrier(self, params=None): if not params: params = {} carrier_id = params.pop('carrier_id') return self._request('GET', '/IncomingCarrier/%s/' % carrier_id, data=params) def modify_incoming_carrier(self, params=None): if not params: params = {} carrier_id = params.pop('carrier_id') return self._request('POST', '/IncomingCarrier/%s/' % carrier_id, data=params) def delete_incoming_carrier(self, params=None): if not params: params = {} carrier_id = params.pop('carrier_id') return self._request('DELETE', '/IncomingCarrier/%s/' % carrier_id, data=params) ## Outgoing Carriers ## def get_outgoing_carriers(self, params=None): if not params: params = {} return self._request('GET', '/OutgoingCarrier/', data=params) def create_outgoing_carrier(self, params=None): if not params: params = {} return self._request('POST', '/OutgoingCarrier/', data=params) def get_outgoing_carrier(self, params=None): if not params: params = {} carrier_id = params.pop('carrier_id') return self._request('GET', '/OutgoingCarrier/%s/' % carrier_id, data=params) def modify_outgoing_carrier(self, params=None): if not params: params = {} carrier_id = params.pop('carrier_id') return self._request('POST', '/OutgoingCarrier/%s/' % carrier_id, data=params) def delete_outgoing_carrier(self, params=None): if not params: params = {} carrier_id = params.pop('carrier_id') return self._request('DELETE', '/OutgoingCarrier/%s/' % carrier_id, data=params) ## Carrier Routings ## def get_outgoing_carrier_routings(self, params=None): if not params: params = {} return self._request('GET', '/OutgoingCarrierRouting/', data=params) def add_outgoing_carrier_routings(self, params=None): if not params: params = {} return self._request('POST', '/OutgoingCarrierRouting/', data=params) def get_outgoing_carrier_routing(self, params=None): if not params: params = {} routing_id = params.pop('routing_id') return self._request('GET', '/OutgoingCarrierRouting/%s/' % routing_id, data=params) def modify_outgoing_carrier_routing(self, params=None): if not params: params = {} routing_id = params.pop('routing_id') return self._request('POST', '/OutgoingCarrierRouting/%s/' % routing_id, data=params) def delete_outgoing_carrier_routing(self, params=None): if not params: params = {} routing_id = params.pop('routing_id') return self._request('DELETE', '/OutgoingCarrierRouting/%s/' % routing_id, data=params) ## Pricing ## def pricing(self, params=None): if not params: params = {} return self._request('GET', '/Pricing/', data=params) ## Outgoing Carriers ## ## To be added here ## ## Message ## def send_message(self, params=None): if not params: params = {} return self._request('POST', '/Message/', data=params) def get_messages(self, params=None): if not params: params = {} return self._request('GET', '/Message/', data=params) def get_message(self, params=None): if not params: params = {} message_uuid = params.pop('message_uuid') return self._request('GET', '/Message/%s/' % message_uuid, data=params) class PlivoResponse(object): def __init__(self, rest_api=None, response=None): "Create a response class from json and httpresponse" if response: self.status_code = response[0] self.json_data = response[1] if rest_api: self.rest_api = rest_api @classmethod def get_objects_from_response(cls, rest_api=None, response=None): objects = response[1]['objects'] return_objects = [] for obj in objects: response_tuple = (response[0], obj) return_objects.append(cls(response=response_tuple, rest_api=rest_api)) return return_objects def __getattr__(self, k): if k in self.json_data: return self.json_data[k] else: raise AttributeError(k) def __repr__(self): return "Status: %s \nData: %s"%(self.status_code, self.json_data) class Call(PlivoResponse): def send(self, src, to, answer_url, **optional_params): if not optional_params: optional_params = {} optional_params.update({ 'from': src, 'to': to, 'answer_url': answer_url, }) return Call(response=self.rest_api.make_call(optional_params), rest_api=self.rest_api) def get(self, call_uuid, status=None, **optional_params): if not optional_params: optional_params = {} if status == 'live': optional_params['status'] = 'live' optional_params['call_uuid'] = call_uuid return Call(response=self.rest_api.get_cdr(optional_params), rest_api=self.rest_api) def get_all(self, status=None, **optional_params): if not optional_params: optional_params = {} if status == 'live': optional_params['status'] = 'live' return Call.get_objects_from_response( response=self.rest_api.get_cdrs(optional_params), rest_api=self.rest_api ) def hang(self, call_uuid=None): if not call_uuid: call_uuid = self.call_uuid optional_params = {} if not call_uuid: call_uuid = self.call_uuid optional_params['call_uuid'] = call_uuid return Call(response=self.rest_api.hangup_call(optional_params), rest_api=self.rest_api) def transfer(self, call_uuid, **optional_params): if not call_uuid: call_uuid = self.call_uuid if not optional_params: optional_params = {} optional_params['call_uuid'] = call_uuid return Call(response=self.rest_api.transfer_call(optional_params), rest_api=self.rest_api) class Number(PlivoResponse): def add(self, numbers, carrier, region, **optional_params): optional_params.update({ 'numbers': numbers, 'carrier': carrier, 'region': region }) return Number( response=self.rest_api.add_carrier_number(optional_params), rest_api=self.rest_api, ) def edit(self, number, **optional_params): optional_params.update({ 'number': number, }) return Number(response=self.rest_api.modify_number(optional_params), rest_api=self.rest_api) def get(self, number, **optional_params): ''' Get Details of a number ''' if not optional_params: optional_params = {} optional_params['number'] = number return Number(response=self.rest_api.get_number(optional_params), rest_api=self.rest_api) def get_all(self, **optional_params): ''' Get details of all numbers ''' return Number.get_objects_from_response( response=self.rest_api.get_numbers(optional_params), rest_api=self.rest_api ) def search(self, country_iso, **optional_params): ''' Search numbers ''' optional_params['country_iso'] = country_iso return Number.get_objects_from_response( response=self.rest_api.get_number_group(optional_params), rest_api=self.rest_api ) def rent(self, group_id, **optional_params): ''' Rent Number ''' optional_params['group_id'] = group_id return Number( response=self.rest_api.rent_from_number_group(optional_params), rest_api=self.rest_api ) class Account(PlivoResponse): def get(self, **optional_params): return Account(response=self.rest_api.get_account(optional_params), rest_api=self.rest_api) def modify(self, **optional_params): return Account(response=self.rest_api.modify_account(optional_params), rest_api=self.rest_api) class SubAccount(PlivoResponse): def create(self, name, enabled, **optional_params): optional_params['name'] = name optional_params['enabled'] = enabled return SubAccount(response=self.rest_api.create_subaccount(optional_params), rest_api=self.rest_api) def get(self, subauth_id=None, **optional_params): if not subauth_id: subauth_id = self.auth_id optional_params['subauth_id'] = subauth_id return SubAccount(response=self.rest_api.get_subaccount(optional_params), rest_api=self.rest_api) def get_all(self, **optional_params): return SubAccount.get_objects_from_response( response=self.rest_api.get_subaccounts(optional_params), rest_api=self.rest_api ) def modify(self, enabled, subauth_id=None, **optional_params): if not subauth_id: subauth_id = self.auth_id optional_params['subauth_id'] = subauth_id optional_params['enabled'] = enabled return SubAccount(response=self.rest_api.modify_subaccount(optional_params), rest_api=self.rest_api) def delete(self, subauth_id=None, **optional_params): if not subauth_id: subauth_id = self.auth_id optional_params['subauth_id'] = subauth_id return SubAccount(response=self.rest_api.delete_subaccount(optional_params), rest_api=self.rest_api) class Application(PlivoResponse): def create(self, app_name, answer_url, **optional_params): '''create an application''' optional_params.update({ 'app_name': app_name, 'answer_url': answer_url, }) return Application(response=self.rest_api.create_application(optional_params), rest_api=self.rest_api) def get(self, app_id=None, **optional_params): ''' get details of an application''' if not app_id: app_id = self.app_id optional_params['app_id'] = app_id return Application(response=self.rest_api.get_application(optional_params), rest_api=self.rest_api) def get_all(self, **optional_params): ''' get details of all applications ''' return Application.get_objects_from_response( response=self.rest_api.get_applications(optional_params), rest_api=self.rest_api ) def modify(self, app_id=None, **optional_params): ''' Modify an application ''' if not app_id: app_id = self.app_id optional_params['app_id'] = app_id return Application(response=self.rest_api.modify_application(optional_params), rest_api=self.rest_api) def delete(self, app_id=None, **optional_params): ''' Delete an application ''' if not app_id: app_id = self.app_id optional_params['app_id'] = app_id return Application(response=self.rest_api.delete_application(optional_params), rest_api=self.rest_api) class Carrier(PlivoResponse): def create(self, name, ip_set, **optional_params): optional_params.update({ 'name': name, 'ip_set': ip_set }) return Carrier(response=self.rest_api.create_incoming_carrier(optional_params), rest_api=self.rest_api) def get(self, carrier_id=None, **optional_params): if not carrier_id: carrier_id = self.carrier_id optional_params['carrier_id'] = carrier_id return Carrier(response=self.rest_api.get_incoming_carrier(optional_params), rest_api=self.rest_api) def get_all(self, **optional_params): return Carrier.get_objects_from_response( response=self.rest_api.get_incoming_carriers(optional_params), rest_api=self.rest_api ) def modify(self, carrier_id=None, **optional_params): if not carrier_id: carrier_id = self.carrier_id optional_params['carrier_id'] = carrier_id return Carrier(response=self.rest_api.modify_incoming_carrier(optional_params), rest_api=self.rest_api) def delete(self, carrier_id=None, **optional_params): if not carrier_id: carrier_id = self.carrier_id optional_params['carrier_id'] = carrier_id return Carrier(response=self.rest_api.delete_incoming_carrier(optional_params), rest_api=self.rest_api) class Message(PlivoResponse): def send(self, src, dst, text, url, message_type="sms", method="POST", **optional_params): optional_params.update({ 'src': src, 'dst': dst, 'text': text, 'type': message_type, 'url': url, 'method': method, }) return Message(response=self.rest_api.send_message(optional_params), rest_api=self.rest_api) def get(self, message_uuid=None, **optional_params): if not message_uuid: if type(self.message_uuid) == list: message_uuid = self.message_uuid[0] else: message_uuid = self.message_uuid optional_params['message_uuid'] = message_uuid return Message(response=self.rest_api.get_message(optional_params), rest_api=self.rest_api) def get_all(self, **optional_params): return Message.get_objects_from_response( response=self.rest_api.get_messages(optional_params), rest_api=self.rest_api ) class Pricing(PlivoResponse): def get(self, country_iso, **optional_params): optional_params['country_iso'] = country_iso return Pricing(response=self.rest_api.pricing(optional_params), rest_api=self.rest_api) class EndPoint(PlivoResponse): def create(self, username, password, alias, **optional_params): optional_params.update({ 'username': username, 'password': password, 'alias': alias }) return EndPoint(response=self.rest_api.create_endpoint(optional_params), rest_api=self.rest_api) def get(self, endpoint_id=None, **optional_params): if not endpoint_id: endpoint_id = self.endpoint_id optional_params['endpoint_id'] = endpoint_id return EndPoint(response=self.rest_api.get_endpoint(optional_params), rest_api=self.rest_api) def get_all(self, **optional_params): return EndPoint.get_objects_from_response( response=self.rest_api.get_endpoints(optional_params), rest_api=self.rest_api ) def modify(self, endpoint_id=None, **optional_params): if not endpoint_id: endpoint_id = self.endpoint_id optional_params['endpoint_id'] = endpoint_id return EndPoint(response=self.rest_api.modify_account(optional_params), rest_api=self.rest_api) def delete(self, endpoint_id=None, **optional_params): if not endpoint_id: endpoint_id = self.endpoint_id optional_params['endpoint_id'] = endpoint_id return EndPoint(response=self.rest_api.delete_endpoint(optional_params), rest_api=self.rest_api) class Recording(PlivoResponse): def get(self, recording_id, **optional_params): optional_params['recording_id'] = recording_id return Recording(response=self.rest_api.get_recording(optional_params), rest_api=self.rest_api) def get_all(self, **optional_params): return Recording.get_objects_from_response( response=self.rest_api.get_recordings(optional_params), rest_api=self.rest_api ) class Conference(PlivoResponse): @classmethod def get_conference_objects_from_response(cls, rest_api=None, response=None): objects = response[1]['conferences'] return_objects = [] for conference_name in objects: response_tuple = (response[0], {'conference_name': conference_name} ) return_objects.append(cls(response=response_tuple, rest_api=rest_api)) return return_objects def create(self, src, to, answer_url, **optional_params): if not optional_params: optional_params = {} optional_params.update({ 'from': src, 'to': to, 'answer_url': answer_url, }) return Conference(response=self.rest_api.make_call(optional_params), rest_api=self.rest_api) def get_all(self, **optional_params): return Conference.get_conference_objects_from_response( response=self.rest_api.get_live_conferences(optional_params), rest_api=self.rest_api ) def get(self, conference_name=None, **optional_params): if not conference_name: conference_name = self.conference_name optional_params['conference_name'] = conference_name return Conference( response=self.rest_api.get_live_conference(optional_params), rest_api=self.rest_api ) def hang_all(self, **optional_params): return Conference( response=self.rest_api.hangup_all_conferences(optional_params), rest_api=self.rest_api ) def hang(self, conference_name=None, **optional_params): if not conference_name: conference_name = self.conference_name optional_params['conference_name'] = conference_name return Conference( response=self.rest_api.hangup_conference(optional_params), rest_api=self.rest_api ) def record(self, conference_name=None, **optional_params): if not conference_name: conference_name = self.conference_name optional_params.update({ 'conference_name': conference_name, }) return Conference( response=self.rest_api.record_conference(optional_params), rest_api=self.rest_api ) def stop_record(self, conference_name=None, **optional_params): if not conference_name: conference_name = self.conference_name optional_params.update({ 'conference_name': conference_name, }) return Conference( response=self.rest_api.stop_record_conference(optional_params), rest_api=self.rest_api ) class ConferenceMember(PlivoResponse): def get(self, conference_name=None, **optional_params): if not conference_name: conference_name = self.conference_name optional_params['conference_name'] = conference_name return ConferenceMember( response=self.rest_api.get_live_conference(optional_params), rest_api=self.rest_api ) def create(self, src, to, answer_url, **optional_params): if not optional_params: optional_params = {} optional_params.update({ 'from': src, 'to': to, 'answer_url': answer_url, }) return ConferenceMember( response=self.rest_api.make_call(optional_params), rest_api=self.rest_api ) def hangup(self, member_id, conference_name=None, **optional_params): if not conference_name: conference_name = self.conference_name optional_params.update({ 'conference_name': conference_name, 'member_id': member_id, }) return ConferenceMember( response=self.rest_api.hangup_member(optional_params), rest_api=self.rest_api ) def kick(self, member_id, conference_name=None, **optional_params): if not conference_name: conference_name = self.conference_name optional_params.update({ 'conference_name': conference_name, 'member_id': member_id, }) return ConferenceMember( response=self.rest_api.kick_member(optional_params), rest_api=self.rest_api ) def mute(self, member_id, conference_name=None, **optional_params): if not conference_name: conference_name = self.conference_name optional_params.update({ 'conference_name': conference_name, 'member_id': member_id, }) return ConferenceMember( response=self.rest_api.mute_member(optional_params), rest_api=self.rest_api ) def unmute(self, member_id, conference_name=None, **optional_params): if not conference_name: conference_name = self.conference_name optional_params.update({ 'conference_name': conference_name, 'member_id': member_id, }) return ConferenceMember( response=self.rest_api.unmute_member(optional_params), rest_api=self.rest_api ) def deaf(self, member_id, conference_name=None, **optional_params): if not conference_name: conference_name = self.conference_name optional_params.update({ 'conference_name': conference_name, 'member_id': member_id, }) return ConferenceMember( response=self.rest_api.deaf_member(optional_params), rest_api=self.rest_api ) def undeaf(self, member_id, conference_name=None, **optional_params): if not conference_name: conference_name = self.conference_name optional_params.update({ 'conference_name': conference_name, 'member_id': member_id, }) return ConferenceMember( response=self.rest_api.undeaf_member(optional_params), rest_api=self.rest_api ) def speak(self, call_uuid, text, member_id, conference_name=None, **optional_params): if not conference_name: conference_name = self.conference_name optional_params.update({ 'conference_name': conference_name, 'member_id': member_id, 'call_uuid': call_uuid, 'text': text, }) return ConferenceMember( response=self.rest_api.speak_member(optional_params), rest_api=self.rest_api ) def play(self, url, member_id, conference_name=None, **optional_params): ''' Start playing sound to member(s) ''' if not conference_name: conference_name = self.conference_name optional_params.update({ 'conference_name': conference_name, 'member_id': member_id, 'url': url, }) return ConferenceMember( response=self.rest_api.play_member(optional_params), rest_api=self.rest_api ) def stop_play(self, member_id, conference_name=None, **optional_params): ''' Stop stop_playing sound to member(s) ''' if not conference_name: conference_name = self.conference_name optional_params.update({ 'conference_name': conference_name, 'member_id': member_id, }) return ConferenceMember( response=self.rest_api.stop_play_member(optional_params), rest_api=self.rest_api )

37.510619

116

0.622538

4,734

40,624

5.095057

0.043937

0.052529

0.052902

0.059204

0.837148

0.783168

0.743657

0.704768

0.664594

0.611692

0

0.000468

0.262899

40,624

1,082

117

37.545287

0.805036

0.013243

0

0.510441

0

0.086601

0.013921

0

1

0.174014

false

0.00348

0.009281

0.011601

0.37239

0

null

0

1

0

1

0

null

0

5

4ac730e573e079cdd7f373106f1e7cbf69432bcb

185

py

Python

application/domain/transactions/__init__.py

chaotism/fastapi-purser

c83a063e953efdf95fddf95828f5fa2d75933363

[ "MIT" ]

null

application/domain/transactions/__init__.py

chaotism/fastapi-purser

c83a063e953efdf95fddf95828f5fa2d75933363

[ "MIT" ]

null

application/domain/transactions/__init__.py

chaotism/fastapi-purser

c83a063e953efdf95fddf95828f5fa2d75933363

[ "MIT" ]

null

from .entities import Transaction from .servicies import TransactionService from .repositories import TransactionRepository, MotorTransactionRepository from .types import TransactionID

37

75

0.881081

17

185

9.588235

0.647059

0

0.091892

185

4

76

46.25

0.970238

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

435e4cfd9bbbdc29a3449f725545603fec7f1be0

9,275

py

Python

ckan/tests/lib/test_datapreview.py

robin-NEC/ckan

71a82c4b0bb499fd3a6d1ccfd038b2231f50f92a

[ "BSD-3-Clause" ]

1

2021-10-01T12:47:19.000Z

ckan/tests/lib/test_datapreview.py

robin-NEC/ckan

71a82c4b0bb499fd3a6d1ccfd038b2231f50f92a

[ "BSD-3-Clause" ]

1

2022-03-12T01:09:04.000Z

ckan/tests/lib/test_datapreview.py

robin-NEC/ckan

71a82c4b0bb499fd3a6d1ccfd038b2231f50f92a

[ "BSD-3-Clause" ]

2

2018-01-21T17:03:08.000Z

2019-07-23T08:49:52.000Z

# encoding: utf-8 import pytest from ckan.common import config import ckan.plugins as p import ckan.lib.datapreview as datapreview from ckan.tests import helpers, factories def test_compare_domains(): """ see https://en.wikipedia.org/wiki/Same_origin_policy """ compare = datapreview.compare_domains assert compare(["http://www.okfn.org", "http://www.okfn.org"]) assert compare( ["http://www.okfn.org", "http://www.okfn.org", "http://www.okfn.org"] ) assert compare( [ "http://www.OKFN.org", "http://www.okfn.org", "http://www.okfn.org/test/foo.html", ] ) assert compare(["http://okfn.org", "http://okfn.org"]) assert compare(["www.okfn.org", "http://www.okfn.org"]) assert compare(["//www.okfn.org", "http://www.okfn.org"]) assert not compare(["http://www.okfn.org", "https://www.okfn.org"]) assert not compare(["http://www.okfn.org:80", "http://www.okfn.org:81"]) assert not compare(["http://www.okfn.org", "http://www.okfn.de"]) assert not compare(["http://de.okfn.org", "http://www.okfn.org"]) assert not compare(["http://de.okfn.org", "http:www.foo.com"]) assert not compare(["httpö://wöwöwö.ckan.dö", "www.ckän.örg"]) assert compare(["www.ckän.örg", "www.ckän.örg"]) assert not compare( [ "http://Server=cda3; Service=sde:sqlserver:cda3; ", "http://www.okf.org", ] ) class MockDatastoreBasedResourceView(p.SingletonPlugin): p.implements(p.IResourceView) def info(self): return { "name": "test_datastore_view", "title": "Test Datastore View", "requires_datastore": True, } @pytest.mark.ckan_config( "ckan.plugins", "image_view recline_view webpage_view test_datastore_view" ) @pytest.mark.usefixtures("with_plugins") class TestDatapreviewWithWebpageView(object): def test_no_config(self): default_views = datapreview.get_default_view_plugins() assert sorted( [view_plugin.info()["name"] for view_plugin in default_views] ) == sorted(datapreview.DEFAULT_RESOURCE_VIEW_TYPES) @pytest.mark.ckan_config("ckan.views.default_views", "") def test_empty_config(self): default_views = datapreview.get_default_view_plugins() assert default_views == [] @pytest.mark.ckan_config("ckan.views.default_views", "image_view") def test_in_config(self): default_views = datapreview.get_default_view_plugins() assert sorted( [view_plugin.info()["name"] for view_plugin in default_views] ) == ["image_view"] @pytest.mark.ckan_config("ckan.views.default_views", "test_datastore_view") def test_in_config_datastore_view_only(self): default_views = datapreview.get_default_view_plugins( get_datastore_views=True ) assert sorted( [view_plugin.info()["name"] for view_plugin in default_views] ) == ["test_datastore_view"] @pytest.mark.ckan_config("ckan.views.default_views", "test_datastore_view") def test_in_config_datastore_view_only_with_get_datastore_views(self): default_views = datapreview.get_default_view_plugins() assert default_views == [] @pytest.mark.ckan_config( "ckan.views.default_views", "image_view test_datastore_view" ) def test_both_plugins_in_config_only_non_datastore(self): default_views = datapreview.get_default_view_plugins() assert sorted( [view_plugin.info()["name"] for view_plugin in default_views] ) == ["image_view"] @pytest.mark.ckan_config( "ckan.views.default_views", "image_view test_datastore_view" ) def test_both_plugins_in_config_only_datastore(self): default_views = datapreview.get_default_view_plugins( get_datastore_views=True ) assert sorted( [view_plugin.info()["name"] for view_plugin in default_views] ) == ["test_datastore_view"] @pytest.mark.ckan_config("ckan.plugins", "image_view test_datastore_view") @pytest.mark.usefixtures("non_clean_db", "with_plugins") class TestDatapreview(object): def test_get_view_plugins(self): view_types = ["image_view", "not_there", "test_datastore_view"] view_plugins = datapreview.get_view_plugins(view_types) assert len(view_plugins) == 2 assert view_plugins[0].info()["name"] == "image_view" assert view_plugins[1].info()["name"] == "test_datastore_view" @pytest.mark.ckan_config("ckan.views.default_views", "") def test_add_views_to_dataset_resources(self): # New resources have no views dataset_dict = factories.Dataset( resources=[ { "url": "http://some.image.png", "format": "png", "name": "Image 1", }, { "url": "http://some.image.png", "format": "png", "name": "Image 2", }, ] ) context = {"user": helpers.call_action("get_site_user")["name"]} created_views = datapreview.add_views_to_dataset_resources( context, dataset_dict, view_types=["image_view"] ) assert len(created_views) == 2 assert created_views[0]["view_type"] == "image_view" assert created_views[1]["view_type"] == "image_view" @pytest.mark.ckan_config("ckan.views.default_views", "") def test_add_views_to_dataset_resources_no_type_provided(self): # New resources have no views dataset_dict = factories.Dataset( resources=[ { "url": "http://some.image.png", "format": "png", "name": "Image 1", }, { "url": "http://some.image.png", "format": "png", "name": "Image 2", }, ] ) # Change default views config setting config["ckan.views.default_views"] = "image_view" context = {"user": helpers.call_action("get_site_user")["name"]} created_views = datapreview.add_views_to_dataset_resources( context, dataset_dict, view_types=[] ) assert len(created_views) == 2 assert created_views[0]["view_type"] == "image_view" assert created_views[1]["view_type"] == "image_view" @pytest.mark.ckan_config("ckan.views.default_views", "") def test_add_views_to_resource(self): resource_dict = factories.Resource( url="http://some.image.png", format="png" ) context = {"user": helpers.call_action("get_site_user")["name"]} created_views = datapreview.add_views_to_resource( context, resource_dict, view_types=["image_view"] ) assert len(created_views) == 1 assert created_views[0]["view_type"] == "image_view" @pytest.mark.ckan_config("ckan.views.default_views", "") def test_add_views_to_resource_no_type_provided(self): resource_dict = factories.Resource( url="http://some.image.png", format="png" ) # Change default views config setting config["ckan.views.default_views"] = "image_view" context = {"user": helpers.call_action("get_site_user")["name"]} created_views = datapreview.add_views_to_resource( context, resource_dict ) assert len(created_views) == 1 assert created_views[0]["view_type"] == "image_view" @pytest.mark.ckan_config("ckan.views.default_views", "image_view") def test_default_views_created_on_package_create(self): dataset_dict = factories.Dataset( resources=[ { "url": "http://some.image.png", "format": "png", "name": "Image 1", }, { "url": "http://some.image.png", "format": "png", "name": "Image 2", }, ] ) for resource in dataset_dict["resources"]: views_list = helpers.call_action( "resource_view_list", id=resource["id"] ) assert len(views_list) == 1 assert views_list[0]["view_type"] == "image_view" @pytest.mark.ckan_config("ckan.views.default_views", "image_view") def test_default_views_created_on_resource_create(self): dataset_dict = factories.Dataset( resources=[{"url": "http://not.for.viewing", "format": "xxx"}] ) resource_dict = { "package_id": dataset_dict["id"], "url": "http://some.image.png", "format": "png", } new_resource_dict = helpers.call_action( "resource_create", **resource_dict ) views_list = helpers.call_action( "resource_view_list", id=new_resource_dict["id"] ) assert len(views_list) == 1 assert views_list[0]["view_type"] == "image_view"

32.43007

79

0.595472

1,057

9,275

4.939451

0.117313

0.073549

0.034476

0.040222

0.768244

0.767861

0.745451

0.728596

0.683777

0

0.004428

0.269542

9,275

285

80

32.54386

0.766199

0.02221

0

0.469194

0

0.235593

0.042504

0

0.180095

1

0.075829

false

0

0.023697

0.004739

0.118483

0

null

0

1

0

null

0

5

4364b29fa219872000b437b34ccf9ecb3c31a416

28

py

Python

src/models/__init__.py

websurfer01/wildfire-augury

d0685002960ebf2380a23825349747374c3babef

[ "BSD-3-Clause" ]

1

2021-08-30T23:38:14.000Z

src/models/__init__.py

websurfer01/wildfire-augury

d0685002960ebf2380a23825349747374c3babef

[ "BSD-3-Clause" ]

null

src/models/__init__.py

websurfer01/wildfire-augury

d0685002960ebf2380a23825349747374c3babef

[ "BSD-3-Clause" ]

null

from .station import Station

28

0.857143

4

28

6

0.75

0

0.107143

28

1

28

0.96

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

5

43694adde3274a9b7cee17dd6159ef598161622a

141

py

Python

iris_validation/interface/__init__.py

FilomenoSanchez/iris-validation

a7bbb28dfe239527c32914229e69e007a519e0dd

[ "MIT" ]

null

iris_validation/interface/__init__.py

FilomenoSanchez/iris-validation

a7bbb28dfe239527c32914229e69e007a519e0dd

[ "MIT" ]

1

2021-11-18T11:58:59.000Z

2021-11-18T12:00:08.000Z

iris_validation/interface/__init__.py

FilomenoSanchez/iris-validation

a7bbb28dfe239527c32914229e69e007a519e0dd

[ "MIT" ]

null

23.5

69

0.794326

17

141

6.470588

0.941176

0

0.033333

0.148936

141

5

70

28.2

0.883333

0.48227

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

437c05bfe41b57aca9d108beb58bf86a1ac8f996

166

py

Python

mrmap/MrMap/management/commands/__init__.py

SvenTUM/mrmap

307e120d0d846645b56fb8f4a7a979857c860c15

[ "MIT" ]

null

mrmap/MrMap/management/commands/__init__.py

SvenTUM/mrmap

307e120d0d846645b56fb8f4a7a979857c860c15

[ "MIT" ]

null

mrmap/MrMap/management/commands/__init__.py

SvenTUM/mrmap

307e120d0d846645b56fb8f4a7a979857c860c15

[ "MIT" ]

null

""" Author: Michel Peltriaux Organization: Spatial data infrastructure Rhineland-Palatinate, Germany Contact: michel.peltriaux@vermkv.rlp.de Created on: 28.05.19 """

23.714286

71

0.795181

21

166

6.285714

0.904762

0.227273

0

0.04

0.096386

166

7

72

23.714286

0.84

0.945783

0

null

0

null

0

null

0

null

1

null

true

0

null

1

0

null

1

0

1

0

1

0

null

0

1

0

5

4393ee21d774b84e0baca491bd7885ac7e1e4f53

202

py

Python

{{ cookiecutter.repo_name }}/tests/test_model_testing.py

simplybusiness/cookiecutter-data-science

523048a0f1aa0dea5d851e52a495bff55a816c71

[ "MIT" ]

null

{{ cookiecutter.repo_name }}/tests/test_model_testing.py

simplybusiness/cookiecutter-data-science

523048a0f1aa0dea5d851e52a495bff55a816c71

[ "MIT" ]

null

{{ cookiecutter.repo_name }}/tests/test_model_testing.py

simplybusiness/cookiecutter-data-science

523048a0f1aa0dea5d851e52a495bff55a816c71

[ "MIT" ]

null

import os os['PIPELINE_ENGINE'] = 'local' from {{cookiecutter.project_name_normalized}}_pipeline import model_testing def test_model_testing(self): data = model_testing() assert not data.empty

25.25

75

0.777228

27

202

5.518519

0.703704

0.241611

0

0.128713

202

8

76

25.25

0.846591

0

0.098522

0

0.166667

0

null

0

0.333333

null

0

1

0

null

1

0

1

0

null

0

1

0

1

0

5

43a0f9938e4c03b19ab0085175d2d49504cd02c4

92

py

Python

crossincode.com/Python_Getting_Started/input.py

zeroonegit/python

919f8bb14ae91e37e42ff08192df24b60135596f

[ "MIT" ]

1

2017-03-30T00:43:40.000Z

crossincode.com/Python_Getting_Started/input.py

QuinceySun/Python

919f8bb14ae91e37e42ff08192df24b60135596f

[ "MIT" ]

null

crossincode.com/Python_Getting_Started/input.py

QuinceySun/Python

919f8bb14ae91e37e42ff08192df24b60135596f

[ "MIT" ]

null

print('Who do you think I am?') input() print('How old are you?') input() print('Oh, yes!')

15.333333

31

0.630435

17

92

3.411765

0.764706

0.344828

0

0.152174

92

5

32

18.4

0.74359

0

0.4

0

0.5

0

1

0

true

0

0.6

1

0

null

1

0

1

0

null

0

1

0

1

0

5

43bb85112961a8e5b9ea6077338ba42a98d0f5b2

265

py

Python

onmt/__init__.py

rikkarikka/old-opennmt

e490a8056f89461070402f79948f69fb7b3ea796

[ "MIT" ]

null

onmt/__init__.py

rikkarikka/old-opennmt

e490a8056f89461070402f79948f69fb7b3ea796

[ "MIT" ]

null

onmt/__init__.py

rikkarikka/old-opennmt

e490a8056f89461070402f79948f69fb7b3ea796

[ "MIT" ]

null

import onmt.Constants import onmt.Models from onmt.cnn_class import CNN_Text from onmt.Translator import Translator from onmt.Dataset import Dataset from onmt.Optim import Optim from onmt.Dict import Dict from onmt.Beam import Beam from onmt.Sampler import Sampler

26.5

38

0.845283

43

265

5.162791

0.325581

0.252252

0

0.120755

265

9

39

29.444444

0.95279

0

1

0

true

0

1

0

1

0

null

1

0

1

0

null

0

1

0

1

0

1

0

5

43bbb6da5069f090628f0f9becea243099e9e742

199

py

Python

format/jpg/parameterizer.py

peitaosu/Cardiff

4c9c836ab3f2b73c9d020443fb505828b307bccc

[ "MIT" ]

5

2017-08-31T03:17:51.000Z

2020-10-25T05:50:23.000Z

format/jpg/parameterizer.py

peitaosu/Cardiff

4c9c836ab3f2b73c9d020443fb505828b307bccc

[ "MIT" ]

4

2021-03-18T20:21:59.000Z

2022-03-11T23:15:48.000Z

format/jpg/parameterizer.py

peitaosu/Cardiff

4c9c836ab3f2b73c9d020443fb505828b307bccc

[ "MIT" ]

null

from format.util import parameterize_image_diff def parameterize(file_diff): """print formatted diff data args: file_diff (JPG_DIFF) """ parameterize_image_diff(file_diff)

18.090909

47

0.713568

25

199

5.36

0.56

0.179104

0.313433

0

0.211055

199

10

48

19.9

0.853503

0.286432

0

1

0.333333

false

0

0.333333

0

0.666667

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

43c9f3583b8b09f5c796c96832baeb364365cdec

105

py

Python

core/srcluslib/__init__.py

booktay/srclus

61e4cb745e3120ff0392a1064ca8239a0d457911

[ "MIT" ]

null

core/srcluslib/__init__.py

booktay/srclus

61e4cb745e3120ff0392a1064ca8239a0d457911

[ "MIT" ]

null

core/srcluslib/__init__.py

booktay/srclus

61e4cb745e3120ff0392a1064ca8239a0d457911

[ "MIT" ]

null

from . import corpus from . import model from . import utility __all__ = ["corpus", "model", "utility"]

17.5

40

0.695238

13

105

5.307692

0.461538

0.434783

0

0.171429

105

5

41

21

0.793103

0

0.171429

0

1

0

false

0

0.75

0

0.75

0

1

0

null

1

0

1

0

null

0

1

0

1

0

5

78dd4e38e9decd9070cbb5bcf63913f86f9718c8

68

py

Python

mindefuse/strategy/knuth/score_count/parallel/__init__.py

sinistro14/mindefuse

c7371a81731d0b9a03d3ef18f91c336e4135c17d

[ "MIT" ]

null

mindefuse/strategy/knuth/score_count/parallel/__init__.py

sinistro14/mindefuse

c7371a81731d0b9a03d3ef18f91c336e4135c17d

[ "MIT" ]

1

2019-08-22T19:51:12.000Z

mindefuse/strategy/knuth/score_count/parallel/__init__.py

sinistro14/mindefuse

c7371a81731d0b9a03d3ef18f91c336e4135c17d

[ "MIT" ]

null

#!/usr/bin/env python3.7 from .parallel_score import ParallelScore

17

41

0.794118

10

68

5.3

1

0

0.032787

0.102941

68

3

42

22.666667

0.836066

0.338235

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

60248bde6c853f84d7eeec9da382ae67ed73a321

572

py

Python

src/simmate/calculators/vasp/inputs/all.py

sionab/simmate

6dedea7310829aae425bf3393e7923e454a0129f

[ "BSD-3-Clause" ]

null

src/simmate/calculators/vasp/inputs/all.py

sionab/simmate

6dedea7310829aae425bf3393e7923e454a0129f

[ "BSD-3-Clause" ]

null

src/simmate/calculators/vasp/inputs/all.py

sionab/simmate

6dedea7310829aae425bf3393e7923e454a0129f

[ "BSD-3-Clause" ]

null

# -*- coding: utf-8 -*- # This file sets up a shortcut for importing so that you can do... # from simmate.calculators.vasp.inputs.all import Incar, Poscar, Kpoints, Potcar # instead of what's written below. You should only use this shortcut if you are # using ALL of the classes below or if you are running some quick interactive test. from simmate.calculators.vasp.inputs.incar import Incar from simmate.calculators.vasp.inputs.kpoints import Kpoints from simmate.calculators.vasp.inputs.potcar import Potcar from simmate.calculators.vasp.inputs.poscar import Poscar

47.666667

83

0.79021

89

572

5.078652

0.52809

0.121681

0.243363

0.287611

0.353982

0

0.002024

0.136364

572

11

84

52

0.912955

0.571678

0

1

0

true

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

603ee2b06784eb42360f087adcdd4cfc92c147fe

101

py

Python

concon/usb_driver/linux/__init__.py

calcite/concon

0bcc627c2859bbf788ae988406004cc16678b06a

[ "MIT" ]

null

concon/usb_driver/linux/__init__.py

calcite/concon

0bcc627c2859bbf788ae988406004cc16678b06a

[ "MIT" ]

2

2017-09-15T10:06:21.000Z

2018-05-11T12:03:44.000Z

concon/usb_driver/linux/__init__.py

calcite/concon

0bcc627c2859bbf788ae988406004cc16678b06a

[ "MIT" ]

1

2017-09-13T12:27:39.000Z

""" Support for USB HID access on Linux. Uses ``pyusb`` library. """ from .usb_driver_linux import *

20.2

60

0.70297

15

101

4.6

0.866667

0

0.158416

101

4

61

25.25

0.811765

0.594059

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

6053c5191a78c6edb81f3aacfd2ad58e8e4c8629

339

py

Python

test/src/lib/idol/py_data/codegen/all/target/optional_service.py

lyric-com/idol

285005e9ddaa92b2284b7e9c28cd12f1e34746ec

[ "MIT" ]

null

test/src/lib/idol/py_data/codegen/all/target/optional_service.py

lyric-com/idol

285005e9ddaa92b2284b7e9c28cd12f1e34746ec

[ "MIT" ]

2

2020-03-24T18:03:10.000Z

2020-03-31T10:41:56.000Z

test/src/lib/idol/py_data/codegen/all/target/optional_service.py

lyric-com/idol

285005e9ddaa92b2284b7e9c28cd12f1e34746ec

[ "MIT" ]

null

# DO NOT EDIT # This file was generated by idol_data, any changes will be lost when idol_data is rerun again from ....all.target.optional_method import OptionalMethod from dataclasses import field, dataclass @dataclass class AllTargetOptionalServiceDataclass(object): optional: OptionalMethod = field(default_factory=OptionalMethod)

33.9

94

0.817109

43

339

6.348837

0.790698

0.058608

0

0.126844

339

9

95

37.666667

0.922297

0.306785

0

1

0

1

0

true

0

0.4

0

0.8

0

null

0

1

0

1

0

null

0

1

0

1

0

1

0

5

607af27f337056c963871e78ff816a4411ced745

86

py

Python

backend/apps/projects/api/utils/__init__.py

wuchaofan1654/tester

ff38d42e06cbdfa04882e8e95ada2dd93e6609f2

[ "MIT" ]

null

backend/apps/projects/api/utils/__init__.py

wuchaofan1654/tester

ff38d42e06cbdfa04882e8e95ada2dd93e6609f2

[ "MIT" ]

null

backend/apps/projects/api/utils/__init__.py

wuchaofan1654/tester

ff38d42e06cbdfa04882e8e95ada2dd93e6609f2

[ "MIT" ]

null

# -*- coding: utf-8 -*- """ Create by sandy at 16:57 23/12/2021 Description: ToDo """

14.333333

35

0.604651

14

86

3.714286

1

0

0.183099

0.174419

86

5

36

17.2

0.549296

0.883721

0

null

0

null

0

null

0

0.2

null

1

null

true

0

null

1

0

null

0

1

0

1

0

null

0

1

0

1

0

5

608827b66130f705a911566041d81ede738c77cd

544

py

Python

source/python/_tests/test_instance_types.py

sandeep-gh/pyboost_ipc

8e26106f1ea93085acc9fa2f68bb048da53cc8e7

[ "MIT" ]

8

2016-02-03T11:21:05.000Z

2021-08-05T13:17:21.000Z

source/python/_tests/test_instance_types.py

sandeep-gh/pyboost_ipc

8e26106f1ea93085acc9fa2f68bb048da53cc8e7

[ "MIT" ]

10

2015-07-20T21:46:55.000Z

2015-08-03T12:45:31.000Z

source/python/_tests/test_instance_types.py

sandeep-gh/pyboost_ipc

8e26106f1ea93085acc9fa2f68bb048da53cc8e7

[ "MIT" ]

4

2016-02-04T12:30:15.000Z

2020-04-21T12:00:31.000Z

from pyboost_ipc import anonymous_instance, unique_instance from pyboost_ipc_tests import receive_object_name_or_instance_type import pytest def test_anonymous_instance(): assert receive_object_name_or_instance_type(anonymous_instance) == 'anonymous' def test_unique_instance(): assert receive_object_name_or_instance_type(unique_instance) == 'unique' def test_str(): assert receive_object_name_or_instance_type('Name') == 'Name' with pytest.raises(Exception) as e: assert receive_object_name_or_instance_type(None)

34

82

0.818015

75

544

5.44

0.32

0.159314

0.208333

0.232843

0.477941

0.401961

0.220588

0

0.115809

544

15

83

36.266667

0.848233

0

0.042279

0

0.363636

1

0.272727

true

0

0.272727

0

0.545455

0

null

0

1

0

null

0

1

0

1

0

5

6099a5ccfd7d13c251448018f852bdd0cb90b6ef

72

py

Python

gpu_utils/__init__.py

SliMM/gpu-utils

b0a6d608620ec580bcd3b618e0591714998da8fb

[ "MIT" ]

10

2019-03-07T17:26:35.000Z

2022-02-19T10:49:34.000Z

gpu_utils/__init__.py

SliMM/gpu-utils

b0a6d608620ec580bcd3b618e0591714998da8fb

[ "MIT" ]

2

2019-03-07T15:42:08.000Z

2021-07-05T18:49:18.000Z

gpu_utils/__init__.py

SliMM/gpu-utils

b0a6d608620ec580bcd3b618e0591714998da8fb

[ "MIT" ]

1

2021-02-22T01:33:19.000Z

from ._version import __version__ from .utils import gpu_init, get_gpus

24

37

0.833333

11

72

4.818182

0.727273

0

0.125

72

2

38

36

0.84127

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

60c8629bf300083f947b17eb6905fd0d3fe37e3f

25,485

py

Python

tests/test_gpt_exact_match.py

krunt/lean_transformer

90abdb87bb08566eaba0a45bc29ec6a3220333ac

[ "MIT" ]

11

2022-03-15T07:32:59.000Z

2022-03-31T13:10:09.000Z

tests/test_gpt_exact_match.py

krunt/lean_transformer

90abdb87bb08566eaba0a45bc29ec6a3220333ac

[ "MIT" ]

10

2022-03-15T06:27:53.000Z

2022-03-25T18:53:19.000Z

tests/test_gpt_exact_match.py

krunt/lean_transformer

90abdb87bb08566eaba0a45bc29ec6a3220333ac

[ "MIT" ]

1

2022-03-18T20:27:42.000Z

import json import os.path import pytest import torch from lean_transformer.models.gpt import LeanGPTConfig, LeanGPTModel from tqdm import trange HERE = os.path.abspath(os.path.dirname(__file__)) + "/" @pytest.mark.forked def test_gpt_forward_backward(filename: str = HERE + "gpt_test_data.pth"): """ tests the correctness model outputs, loss and gradients for a small GPT model with all the features: - rotary embeddings - sandwich norm (pre + post layernorm) - parameter sharing with adapters - pixelated butterfly - reversible stem :note: see generate_gpt_test_data below for the training procedure and references """ torch.manual_seed(1337) torch.set_num_threads(1) torch.use_deterministic_algorithms(True) atol, rtol = 1e-4, float("inf") test_data = convert_from_legacy(torch.load(filename)) config = LeanGPTConfig(**json.loads(test_data["config"])) model = LeanGPTModel(config).train(False) report = model.load_state_dict(test_data["state"]) assert not report.missing_keys and not report.unexpected_keys, f"Checkpoint keys mismatch: {report}" model.zero_grad() output = model(**test_data["batch"]) output.loss.backward() assert torch.allclose(output["loss"], test_data["loss"], rtol=rtol, atol=atol), "Loss does not match reference" assert torch.allclose(output["logits"], test_data["logits"], rtol=rtol, atol=atol), "Logits do not match reference" for name, param in model.named_parameters(): assert param.grad is not None, f"Param {name} has no grad" if test_data["grads"][name].norm() != 0: assert param.grad.norm().item() != 0, f"param {name} has zero gradients" assert torch.allclose(param.grad, test_data["grads"][name], rtol=rtol, atol=atol), \ f"Grad w.r.t. {name} does not match reference" def convert_from_legacy(test_data: dict): config = json.loads(test_data['config']) if 'block_size' in config: config['weight_layout'] = f"pixelfly(block_size={config.pop('block_size')})" config["post_layer_norm"] = config.pop("sandwich_norm", False) config.update(out_proj_bias=True, tie_embedding_hidden_mapping=True) test_data['config'] = json.dumps(config) # add layout parameter def update_names(d): d = {name.replace(".shared_matrix.", ".matrix."): x for name, x in d.items()} d = {name.replace(".dense_qkv", ".qkv_proj"): x for name, x in d.items()} d = {name.replace(".dense_out", ".out_proj"): x for name, x in d.items()} d = {name.replace(".dense_i2h", ".i2h_proj"): x for name, x in d.items()} d = {name.replace(".dense_h2o", ".h2o_proj"): x for name, x in d.items()} d = {name.replace("attention.layer_norm", "attention.pre_layer_norm"): x for name, x in d.items()} d = {name.replace("ffn.layer_norm", "ffn.pre_layer_norm"): x for name, x in d.items()} d = {name.replace(".sandwich_norm", ".post_layer_norm"): x for name, x in d.items()} return d test_data["state"] = update_names(test_data["state"]) test_data["grads"] = update_names(test_data["grads"]) for name, param in LeanGPTModel(LeanGPTConfig(**config)).state_dict().items(): if name.endswith('.layout'): assert name not in test_data["state"] test_data["state"][name] = param else: assert name in test_data["state"] return test_data def generate_gpt_test_data( filename: str = HERE + "gpt_test_data.pth", num_steps: int = 250, loss_threshold: float = 1.0 ): torch.manual_seed(1337) torch.set_num_threads(1) torch.use_deterministic_algorithms(True) config_json = b"""{ "architectures": ["LeanGPTForPretraining"], "model_type": "lean_gpt", "num_hidden_layers": 8, "num_hidden_groups": 4, "num_inner_groups": 2, "num_attention_heads": 4, "vocab_size": 10000, "hidden_size": 256, "intermediate_size": 1024, "embedding_size": 64, "block_size": 8, "lowrank_dim": 60, "adapter_dim": 4, "share_large_matrices": true, "reversible": true, "hidden_act": "gelu_new", "hidden_act_gated": true, "sandwich_norm": true, "position_embedding_type": "rotary", "hidden_dropout_prob": 0, "classifier_dropout_prob": 0.0, "attention_probs_dropout_prob": 0, "layer_norm_eps": 1e-12, "type_vocab_size": 2, "pad_token_id": 0, "bos_token_id": 2, "eos_token_id": 3 }""" batch = { "input_ids": torch.tensor( [ [ 610, 6245, 133, 25, 7106, 11, 2329, 11, 290, 9552, 6127, 198, 198, 24, 25, 1129, 3001, 6185, 642, 9502, 628, 628, 198, 198, 4342, 318, 644, 468, 587, 1016, 319, 428, 1285, 379, 1438, 397, 3880, 3799, 13, 628, 628, 198, 198, 3952, 352, 13, 20, 13, 16, 350, 7474, 198, 198, 5962, 572, 11, 356, 1392, 4296, 352, 13, 20, 13, 16, ], [ 357, 2288, 8, 2817, 13, 198, 198, 38, 13, 41, 13, 5498, 11, 371, 13, 35, 13, 2644, 11, 8687, 13, 5416, 13, 360, 7632, 357, 1113, 8, 4353, 4790, 13, 198, 198, 7841, 1548, 6060, 4912, 11, 564, 251, 4832, 286, 2142, 1548, 3123, 447, 251, 11, 6554, 13, 8687, 13, 449, 13, 327, 513, 357, 1113, 8, 352, 13, 198, 198, 44, ], [ 5694, 3414, 326, 262, 8545, 561, 1441, 329, 257, 2368, 1622, 286, 511, 2277, 905, 13, 564, 250, 6385, 2486, 1839, 302, 12, 4300, 11, 340, 691, 2331, 3148, 326, 356, 561, 1577, 7383, 1222, 350, 6213, 1194, 1622, 11, 447, 251, 2329, 5694, 1182, 286, 2656, 8300, 290, 3227, 8758, 2770, 805, 531, 13, 256, 9999, 9999, 9999, 9999, 9999, 9999, 9999, 9999, ], [ 1722, 262, 2431, 4378, 276, 3371, 5896, 11, 4662, 278, 4671, 287, 3162, 3751, 645, 5895, 286, 7163, 848, 1612, 625, 4581, 290, 360, 2260, 198, 198, 1212, 2708, 318, 517, 621, 362, 812, 1468, 198, 198, 1212, 2708, 318, 517, 621, 362, 812, 1468, 198, 198, 464, 1294, 1230, 319, 3217, 2318, 260, 992, 3812, 663, 717, 8325, 287, 517, 621, 1440, 812, ], ] ), "attention_mask": torch.tensor( [ [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ], [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ], [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, ], [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ], ] ), "labels": torch.tensor( [ [ 610, 6245, 133, 25, 7106, 11, 2329, 11, 290, 9552, 6127, 198, 198, 24, 25, 1129, 3001, 6185, 642, 9502, 628, 628, 198, 198, 4342, 318, 644, 468, 587, 1016, 319, 428, 1285, 379, 1438, 397, 3880, 3799, 13, 628, 628, 198, 198, 3952, 352, 13, 20, 13, 16, 350, 7474, 198, 198, 5962, 572, 11, 356, 1392, 4296, 352, 13, 20, 13, 16, ], [ 357, 2288, 8, 2817, 13, 198, 198, 38, 13, 41, 13, 5498, 11, 371, 13, 35, 13, 2644, 11, 8687, 13, 5416, 13, 360, 7632, 357, 1113, 8, 4353, 4790, 13, 198, 198, 7841, 1548, 6060, 4912, 11, 564, 251, 4832, 286, 2142, 1548, 3123, 447, 251, 11, 6554, 13, 8687, 13, 449, 13, 327, 513, 357, 1113, 8, 352, 13, 198, 198, 44, ], [ 5694, 3414, 326, 262, 8545, 561, 1441, 329, 257, 2368, 1622, 286, 511, 2277, 905, 13, 564, 250, 6385, 2486, 1839, 302, 12, 4300, 11, 340, 691, 2331, 3148, 326, 356, 561, 1577, 7383, 1222, 350, 6213, 1194, 1622, 11, 447, 251, 2329, 5694, 1182, 286, 2656, 8300, 290, 3227, 8758, 2770, 805, 531, 13, 256, -100, -100, -100, -100, -100, -100, -100, -100, ], [ 1722, 262, 2431, 4378, 276, 3371, 5896, 11, 4662, 278, 4671, 287, 3162, 3751, 645, 5895, 286, 7163, 848, 1612, 625, 4581, 290, 360, 2260, 198, 198, 1212, 2708, 318, 517, 621, 362, 812, 1468, 198, 198, 1212, 2708, 318, 517, 621, 362, 812, 1468, 198, 198, 464, 1294, 1230, 319, 3217, 2318, 260, 992, 3812, 663, 717, 8325, 287, 517, 621, 1440, 812, ], ] ), } torch.manual_seed(1337) torch.set_num_threads(1) torch.use_deterministic_algorithms(True) device = "cuda:0" if torch.cuda.is_available() else "cpu" config = LeanGPTConfig(**json.loads(config_json)) model = LeanGPTModel(config).to(device).train(True) train_batch = {key: value.to(device) for key, value in batch.items()} # overfit to a given batch opt = torch.optim.Adam(model.parameters(), lr=0.01) for step in trange(num_steps): opt.zero_grad() output = model(**train_batch) output.loss.backward() opt.step() if step % 10 == 0: print(f"step={step}, loss={output.loss.item()}") if step == num_steps - 1: print(f"step={step}, loss={output.loss.item()}") assert output.loss.item() < loss_threshold, "Training loss is unexpectedly high" # compute reference outputs, loss and gradients model = model.cpu().train(False) model.zero_grad(set_to_none=True) output = model(**batch) output.loss.backward() for name, param in model.named_parameters(): assert param.grad is not None, f"Param {name} has no grad" test_data = dict( config=config_json, state=model.state_dict(), batch=batch, logits=output.logits, loss=output.loss, grads={name: param.grad.data.clone() for name, param in model.named_parameters()}, ) torch.save(test_data, filename)

26.354705

119

0.230449

1,605

25,485

3.558879

0.238006

0.086134

0.128151

0.169468

0.494398

0.478992

0.451681

0.440476

0.435924

0

0.260437

0.703944

25,485

966

120

26.381988

0.49662

0.016049

0

0.862217

0

0.065551

0.011864

0

0.010764

1

0.004306

false

0

0.006459

0

0.012917

0.002153

0

null

0

1

0

1

0

1

0

1

0

null

0

5

60d8f81b25a9563bfb9f9787a9039c8d2ecfea31

62,624

py

Python

appengine/monorail/api/v3/api_proto/hotlists_prpc_pb2.py

xswz8015/infra

f956b78ce4c39cc76acdda47601b86794ae0c1ba

[ "BSD-3-Clause" ]

null

appengine/monorail/api/v3/api_proto/hotlists_prpc_pb2.py

xswz8015/infra

f956b78ce4c39cc76acdda47601b86794ae0c1ba

[ "BSD-3-Clause" ]

7

2022-02-15T01:11:37.000Z

2022-03-02T12:46:13.000Z

appengine/monorail/api/v3/api_proto/hotlists_prpc_pb2.py

NDevTK/chromium-infra

d38e088e158d81f7f2065a38aa1ea1894f735ec4

[ "BSD-3-Clause" ]

null

# Generated by the pRPC protocol buffer compiler plugin. DO NOT EDIT! # source: api/v3/api_proto/hotlists.proto import base64 import zlib from google.protobuf import descriptor_pb2 # Includes description of the api/v3/api_proto/hotlists.proto and all of its transitive # dependencies. Includes source code info. FILE_DESCRIPTOR_SET = descriptor_pb2.FileDescriptorSet() FILE_DESCRIPTOR_SET.ParseFromString(zlib.decompress(base64.b64decode( 'eJzkvQ18XFd1L8rMaKTRkSwdjZ3YHsfJiZzEliONvxKSOCRBlmRbji2JkZwQeEQ+mjmSJh7NiD' 'kjKwrwCm0phX5cCgTC5auXj0IoNOWjvH5xuRT6enu5F9r3aGl/oZTXD0KB5tIALY9L27f+a6+9' 'zz4zI9tAUu57Lz9+WLPOPuvsvfbaa6+19lprOx8NnGv81fKBC0cO0D/zq/Vao3ZgudaolMNGmO' 'ef2Z6VWrVW98uV/IUjuRtaWi8GfmOtHszXFh4IivqlnLdUqy1VggP8a2Ft8cBiOaiU5lf88Ly0' '2NXcIlhZbWzIw2vkIb6m3lwIlv0L5VpdGuy0GtSDsLZWLwbq0eDdzraxOnUqOKnGUQhevBaEje' 'wRp0tGtiPhJfb1HN6Wt0aWl9bHUl8eTRZ0y8HjzsCJoNGE6ZDTUfVXAkbTfWw3vfC90e3OFdSX' 'fLG+sLaUL9ZWDuh3uOngexPOtrOrpdZenbm8Xl3iIxpH9rlOzxp/hkm9I8koc3lFrbymdf44aH' 'qGWqjhOuodANDT7acJlaCebAQroe7szU7nql8Pqo3LG7o0zu5yulf9pWA+LD8UcJfShQwAs/Q7' 'u9PJ1OqloD6/sLEjBayFLv59bCO723H4vUbtfFDd0cEPGdMcAIN1Z0drR8PVWjUMsnknXQaAOp' 'oiCuxoR1S8UVDNsjc4/dXgwca89b0kf28LwDPmm59OODsLQd2vnm9HnybG2Jw0IDo3zR53tsjc' 'zasOJ6nD3ceu/d7oLmdn23fxRbzfu2z1IDvs9Df8+lJAQ6iF5Ua5VmVqblET3KeezcijwQ8mnC' 'tHS6WncY6POJ3lMCQMMoBd/NoVztb4a5NoU5Cm2b2bdLqlv69isq/ULgQ/5i4P/kzC2RXryUSp' '3KjVN2OBy5AN2ZucrkAhkY7k+K1tTjb+1tkwqBd008Ep56oTfmM5qAuy8Hitzi2kI3mnY41+Sk' 'cuhpLbDT7P2b0JPllSB52M3hlkVbUVVQXT6vBXOp2MxpY95WyJieXstbG324nsXNsPDD4rO+44' 'kVTOXh1r1SKuN8VCPYqJ5KYetRPXm+KadLaMB5UgwnWpTl3ZIpMnsP8RKt9xm8Va9roYtk3Ec+' '76S7RSE0mfuMfJtgqx7A2x1zeVchfp+ozT3yRVsntiSNvLnItg5J42r/uWnm4iGC6C9wXOtnar' 'OLtvc8zxhX4R3KvOFW1XUnYozhMXWb25/ZfTVM/nsewL3Ga97NQfP8/pdtPus9zXJ92E80Qi08' 'u/soe/mPDGaqsb9fLScsM7fPDwQW9uOfDGluu1lfLaije61limYea90UrF40ahRxpWUL8QlPKO' 'R1/2aoteY7kcekrt8oq1UuDRzyWiVb0alLyFDc/3js2Oj4SNjUrgeJVyMaCO0kt+wyv6VW8h8B' 'Zra9WSV64SMPBOT45NTM1OeIvlCmGve37D8ZYbjdXw6IEDpeBCUKmtBtQlITgEFwGqI+r7BwR9' 'eGAhLDlOJpN0u2ig2+ivjNtNf+0FMNNj/k5lnuX20N8H+e+E20t/7+e/k+4W+vt6/jvl9tHfQ/' 'x3h9tPf+9xHktkOunlK+jHBTeRm/D0lHigD3WDBlSsrJWC0POJeisBkbIUetUgKBFZFmlkK37V' 'XypXl8ybeefwC7z9+/dPT52+zxsbPX3aq68WQ+/eybmT3rmwQbp1eNR7yejpmZOjL52dGz12eu' 'Jl56i5o5qtl+kLaw3d8pxHO5tXrTVoxvzSRt5xetFhGuMVbsZ1nVcn+WeSxnC1m3Tvyn034elv' 'TE3PeYWJ0fH7HE/JYhoD9XzdE3FOyLyCXyY6H3U8D83nj0+fnRr3yovECCuBt1S+EFR1a0+2Ka' '9U4/4EDzIKenH0NH9lfuL5k7Nzs3jbNy9hOMwQIe2LHjZHr7YuHAUwNirg8Cs8PoU1ZLSTU/eM' 'np4cnx8tnDh7ZmJqTiE+pzsPNPVzzKXoJg3G1aQg6lztdrpbLUiSIFfQ3EeQFEFucm+PKJhw9x' 'IFb9uEgoWAbKJqyJ2uqyVNozh5aUrGX9B0oW6DiLxmeLQzE4Uzk7Ozk9NT8+MTU5MTLe/W9TvE' 'h7V1QtWoeRfKNJtoZGZ0E7qhjZpNbVqpuRCUF/xKuWRRMMHE6CT+iiBJgmRpxUSQFEHy7s3ONx' 'ICSroHmQcfb0tBtfuGEXNcimpPL62UQXRZ1AKach3rG0ZVyEtwhbRFWuUWkcAxB2Nspihgs1mS' 'iHSQ2ew3NZFS7q1EpFO597YlklI5fmxEKvHn40Qyg4FkvTU2YMjXW2nAN1gQjO+Qe9z5iF5XHe' '4xGvA9uXcmL7aufI+HQRsR5Ky99est5TIJokyBH+dCiyxO7HxxIdpu+QFX8wrsIFofI1pfaUGS' 'BNnhHrAgKYIcdQvOP2tap90zROt7c9/YhNZQAC3m2kvEBYkvl8lqoA2MJtCkztjM/vQjUliwWV' '8DKvogk15/dTnY2Evfa9Q3sOOa1y46HeeaDFLeM8pVpjg+oHcUZa2fAypqwL4rPC7Wqg2/XBVK' 'cbeFIU+2rJA0zdoZmrUdFiRJkJx7xIKkCHKnO+s8nBJQp/t8mrXn5X461W7WSMMOedtWHfDDsF' 'Ys+9hMeHNV/BVNy2VLjqaFEs3t0zSj0BeauIc5vWk++XPRhPql0v8ss9lJs/l8ms0rLEiSINvd' 'EQuSIsit7hnnzXo2u9wir8GfbTubygAJL2cyF0l//3/7dNZ5uP+zzGgXzWgxtj67aEaLsfXZRT' 'Na5PX5mJaqGXeFZvSFubdvIlXVjGr9mOa0vFRVRPsxbeOK6ryThqtBsUx6TAnIdBeZsy5nO/Or' 'GxGGaITCUS0bs6Zhhui8QnTOWZAkQa5yb7EgKYIcc+91/qNWjbrdNaJzkPtgW9VImczKDgPX+Q' 'sV8+1QWaI+2xMgiE+m2soC/V1bvBTp9Stxum/KrWhus6g17G4a9hoNe5cFSRJkt3ubBUkRZNz1' 'nefRBv4s9yVkeb48QabnMU88BdTzMCQVgq3LmBNNzE/q31TwII32gl+uMBUa/tJR7zBsww62fl' '5CtuFVzk8n+Cdsw58guo7mGuwX0KxGfFJk7ISv2apaWaMGZNOrExx+jZ8oR0FgW5EkuGhCFgKH' 'LGZGGmNOpo70gvY59KPbgiQI4rgDFiRFkG0scjUkQ5Ar3ec6V0SQzFszPKgd7p3ONOtKr0wQHV' '8DOt7Vlo6Ru+6SRNwChAplxt3pHOWfIOKrEtT7VyfcydwNTBFlzcbXLy++Rr0cQOg5A/pdUsz4' '7YwFSgDU7W6xQCmAXKLHNgPKAJTFZ086V0ZQRYGfTRC3DdutM+/IoG2ne8IpsMr470CYN27OYD' 'Gf6GXRBnbPv0swh83zT9DmlzC61yfIrrnbZjJSMM+BTOeUKYVlQ+uHZVS5RNtVeXGjmXzEdcpU' 'KwkBk8I7/IluC5QACNwTgVIAgX22GVAGoCvRt0kmYNIm4OsiAiYjAr5eEfAmgSbchxO8o+/hoW' 'k7RYzDzbpMQk29t8sCMaqr3L0WKAXQfvdGC5QBaNi9x/Q3oftL8Lw755xl3f8tmNoPJdht1W5q' 'm93FF5/dm9Xswsh7C2b3GmeKf2J234ZxvAOze5RJENc1hr315XJxGRIiVG7EYq1SCYrYzEEobW' 'IMaHy0Gt4WrYaUTObbsBr6LVAKoCyZm9sMKAPQNnRFTWbKnsy3R5OZiibzHWoyv5IQcMJ9N759' 'Ze7zCR7Liv9geWVtxauuyX4hioRayWSbKvGn3YEr/obAvcVgnV6gjafqqGHTfrAGaTq56K1Vzb' 'Y57NHOtFKjyTl08OBBwS5CU1CxH9buDGPCasErt6uftKktYFdnLPr9Yi0ga5IXFOAWlRNEZR5p' 'lwXiwWdkyaSE/96tlsxjSYEl3fcrCr0tqYZO8oy0OaJMsbay4hMpaP5ZZ1WLGgs8Wtd81MuLWu' 'YdBgze3zuyl3pMjEmKiXpzmIZ/gbZ0pTp6Ya3eUK/TSxP5pby3l9SAejg8orSBvdwijHDDiRhN' 'G7f1SAdCL5bLS8vDaElzo95mEB5RizZzFJ8W7oXxUpbrHhunou8o7rdIDbv7/XGGBp+9Hww9YI' 'FSAIHU39fMmHJ/He/tyH0t4Y2y48BjxwEoUwzIGChpK2CVSFWu0TDONS/rc16RVCIa0ky9doGk' 'quJFayNSxF1bCCEjaNniM1CK7iXq4Ee56jdogoZZs6pBycIQaVIbULdWFVae2zbfhqbgEN82is' 'rPi74oZSx6UXwiamgW3VJEt1+P0w3i59dBt60WiKl0pbvduZtAHe7HIPd+F3Lvdk8fmaB3LfJO' '6NJO2h1R0g6qw8ewIjznVv4Jafeb6NK1ub3M/IovjMIcKcOR1jug36S+8bs2qBOgHvdKC5QAaD' 'ttnxEoBdA11IvXJwSWcH8HqHbnXgHOEKZQclbOW0LMpU8MEfmbzrVMO2IdZMLB8swaZiuurZQb' 'DTA/5jwQtb6ZU0JrhJApvxNNWIfIlN/BhO2wQCmAdtEIsYWk3U9iwv4IE3Yn01S0QyMytCcpst' 'jaztlNas7gZPkk5uxa5w7+iTn7FHr1+wn3QG4IPGH52ERBO2kraMpnxB1Oy4b0qWhYaZmlT0Xq' 'WVpm6VORepaWDelT2KPoy3kbio3n02rjudKC8jb1+2qbekVSHiTc/4Jv/1d0/huJuOtTKRcw5k' 'qihbN0pTE1WcUsuRyvhDW7Uq6qyTeN6UeoWdlfbCj5vOEt+8QlCwFJAfUFkbr3whOhGr/QH/YW' 'hr3isEdcErxoGA0hy19IP4svYpHQYr0fGZbO1INwrcJWYgxZwMiKL7ImgJheEcEGpQHqEQGaFl' 'b7L6D2NRYoBdCgu8dQH+oTga4DQfM2FHPyGdD+bjMnRq/6r2pOXpeQB0n3c+jOydzLSUngAfL2' 'AjHp6ZFqzmLamc2ulR7alloIGuug9UGyqkvevj2Rzc/UGfH26F0twGcY7ZBFJOwyn4tzKZjnc9' 'HiS8su8zm1+CJQBqDdFjMm9cA/B7EzwQplp/snWKdPbK5QktxpOu6/mIiV5Qov2p9guV7tnOCf' 'WK5fwDj+HArlkUsuV79UstyfjZqQpFMW7hciknTKwv1CpEl2ysL9QqRJdsrC/QL24j/XmmSnvU' 'T/LNIkO6MF/edqQZcEmnAfx6f/giyz3Ex8FCGGMRm5ZLWXTzn5MJgYEWmEsr8q1eKcNUQsjcej' 'pdEpS+PxaGl0ytJ4HEPcYYFSAIERthlQBqDd6PMJM2qzCL4YH7Usmb8AdML5bErASfcramP63d' 'Qll4aZtstaGC9UK2OPpYNzeMFaHUSpyOEwyRPHEOpF+diGwurbInGhOiuONuu2PsbaWiMkBcUx' '0Q+0LfBGObXpBPm0QVZHKj59q3mstjvEoXVBm5unjluoAffcChKYlIUObbW1b0rq+6UH1kK2Kb' 'FzV9uJWn34PWwtEK3Cmj6jcwHRtbbotGMwiJWvxNcQePsrkVjpFLHyFcVN9xKoy/0GZMV3ICtO' 'tJcVXmsQz2UoZPDQfkNt7if5J6TFk+jeNyEtbrqMzZ1dn5HaJkPtEnHxZDTULhEXT0biokvExZ' 'ORuOgScfEkxMU3tbjossXFf48WTlckLr6pxEVRoAn3KXz62xAX05uLi+YTgbg6gPUQLtfWSH9j' '41H2bdN3SIunImnRJdLiqUhadIm0eCqSFl0iLZ6KpEWXSIunIC2+raVFly0tvhUftEiLbytpcR' '9BM+73wCM/lSQembwcHpFwrMvgEviXvwcu2eOc4p/gku9j3P8CLnn25XKJ7Q8XKmaET74f8UlG' '+OT7kT6YET75fqQPZoRPvg/C/ovmk4zNJ/8ckSwT8cm/KD7xBZpwX56kT/9k0j2RO9OGTxAo1s' 'omMSfaxbgkI1zCH7FBaYA0l2SESwiUdXdaoBRAV7m7zSDAJS9HdA11+LgZsuGSVyRjQxYu+UlA' 'x50XELTb/dkkccnPg0tObcIlbYPlLsYm4qmEP56wZ9zrnBn+CTZ5DQb+c6Duc9qzCZ8HrC/XQu' 't0YZ22br/KrLMYkKkrxOwWZmGcGQuUAEgzS7cwC4E0s3QLs7wG9P05Tblum1no0Tb3qN0alPs5' 'RbkXEtRxfykpwYC5uyND+OkhnQPvKkh3vdPPP0G612GYHo/JEXv3dREbOWLvvg5slLVACYC2ih' '/UEWK8DjxzzUInhzYecf55j3OZiSjx7JUfIa3EvGvyVRplIl7DX1mVBte19IgPOuP9GXxlh9Ol' 'Y4Szdqy4BIPf4PSWyuFqxd+Y52echaCC+HvkwRTaHXTSfMaiciaO5TYJ7sZ7qmH2UBRm3sFh5t' 'svFWOe3e10hWsrK359Y0c66oeGZa93ekpBWKyXVzl0v9PuagTPHnf6S8GiT9bdfLFWWVuphju6' 'OH58dyzIVW1pcMuMcatCn7ylfobZ006/NmNX6+ULfnFjR4Y+2Xd4T7ugbP3vjGpa6FuO/R485f' 'TFW2SvcXadnJ47PTk7Nz9TmLxndOy++bNTszMTY5PHJyfG3Wdle5wufjA34SayjtM5c/bY6ckx' 'N3n00NdG85vE+Gev0GLhwEuMEV562eDvJp0ea7duywuHnDSzkDDBrs2SE748mi6oltntTgfUyC' 'j3I1VgAPgFOl5dpdFchF9SBdUQqUTqxG8enM4M0C6VaE4vA/U1R70DKI+p1ggUYxT476MTXxs9' 'dpHEluz1bcl1gDW0Ay/BP/jdNuL5L3c5GZJBz3LvdRPO7yUzvfzj/+sBz4fvo+Gwn45Q0YopVw' 'N2w/LshCzYRTKGbDDVgworAgtrIZqGZNAoATXsBfml/LDZxvIqltoxsdS9Vix1rxVLHcVJJyRO' 'WsVSuwaecgfo77wzlumQ8OmjtA3d7I3y9jmiYnz1SZmSA5tsOLdFx9YIae53+vhXl3sl7Sw73Q' '7eNeh35m0ZAzqQ0QfbVxEkm7um/U5uBybos+M0v5KJnUFfxVu1fQZ9Fe/UZYEkOLZ6Inefd86W' '5GLBLtYQeOGt+o1GgFMh5griknOL8KGv1+rn5xfKD9GU5AsT81ocTY2emZifGZ2bmyhMnbM6CD' '3s6lgHE/z5butIPMGxyztIL4sgGYLkSDG4IoIoNeJqGssx5/d0KEDSHSTs17kHco8lLko0dd5P' 'czaNf0PmeQmh1S3CoAGbFmymdpdh9dIwc6VtuOB0a3p8ep8W6kdvOXj4yNBRL75j89kazrSWYY' 'eblbW4Bla3aASLdTBGI0zRINGoz4KkCDJAekjWQDIE2UpjzztbIxiUqj2sU11hAZl017HquiDg' 'FIeH+7lCG53cppvQAs5UY8+0kC5OHNNr5CXsZYUqgqQJ0mOFSKQ4NjtrzX6K+walPIJkCHK1e8' '6MNKVGutf13PudIQF2uEP0sefmdnqzav/ffOHAjT8UozmOToaI5q4FSRFkK8mWCJIhyBXuXYa4' 'HZq4Q+529w623lTc6o2EfDx31DuD88FS0CAuIRawlA7dt9W1+motvMgaTwu2jAVJEKTb6hiCMG' '+kHuywIBmC7HTHTFfTuqs3klk86twj4E53hJAfzB33puWQUIs5UW48UYlggq1Tt6tWMIQEyvEb' 'iGGyut1J0zESm/tO/lYPhxNpSIIgV7k3WpAUQfLuAec4QyCND7mIyk7lbvJED/Iq2IA4tvoSRy' 'yH9deVQD7kdpHcudFAIHGPuB3udbntaosy59RrVRzm0HC22Y0JBZpf0wRNEhQu+7MWNOHeTC3d' '3Kg3Xa2ooBAVcQRZou30pqWGhdUamR37WEIQ9zRBkwTto83mDguadG+hlv25IW+0ulGrBpg6YF' '4PFi7nUxgDEDRDgXYLiaY+gXS5t9EEXW+msIumGRDXgiQIMkCmVgRJEWQPGbL/Cy+8u5ROlJsi' 'YbQK1aYq5+K8QizPJHWbd18I00tN/i1qJ04w/oy7lXucoP4+l3o3JjtxQu3EGnQko6OjjvNOvO' 'eirhfIO2F5HRZ13KxUHRV13OzGOijqOO/Gtwok4Z5EAgUtQRWGpcbX6hApq5BQ63vYXE/Gvpdg' 'bHrjSMjmetJsHAnZXE+SWDtFi2xrBIM4nWRn1xUWkAXGKQKPIC1GwZPuFH30TqTFNM0W+kdSwU' 'xYPHAVP0sBtO+Qnet12iPLHPSqQiTuUVEh2uHLZ9SH4KKY8vbxWXX5oWYxOUR7tV9Up3s4/gNe' 'nxZv+cVryltNaMd4+1URBDiW1W76Fb/EbHSuNY/0nEVkCPOpGJExZVOxScVuOsWTGkEyBMnSln' 'BFBFHUnCLaP8e5U8Apd4aQF9zDueH2rMamDn605zlsqDOx7mFDnYnxQIq/YvMANtQZ6kfBPWR4' 'QLbU5xnlQQO51wUCH3AmBNzhznEE8c3MsbC+FINaffTW/TDutI9vbYyGRMUch5RFkARBEFEWQV' 'IE2S97REJ24TnaJV5geml24Tn3gPt8VuITPHH38CI+wk7GERPAQb1i/vQrsjNzKNJao+0iSwua' 'jAVJEMSef2y/92D+jf/n5TnnUq6crCPGEzVorUaiNQXdev9LnC1cE+OYIMle7eTI6j89Pn9s4u' 'ToPZPThSZfQK+TmZ6Zm5yeGj3tJvCrMPG8s5MFepbM9js902fnZs7OzSOr001l+xxncsr87shu' 'cbonz5w5y+mcbvroOacvPoTs7vYVO6ZZtwl3vDXjpfb1Hd6Zj8aYj3W/sGXR/nls1ekjI9Jqfi' 'wbaz+Dz8wkXjAqLZZqFVrW+Vp96cBSUFXeLPWI3g2Z6H6V7Hmf+3O79fc7kx0nRmcmT/3JlWSM' 'wxqcImP8P3aQMd7PxvhHOmLG+KHbvBOM1zt9egxhRqeVbVsiMaMjw0ZXSQgF+smwdw9ZGJB/h/' 'MHlegalEeDQ7c73kZtjU0DBGivhYEOYqEvBA8Wg1WWk0SL1UrZrxaDyB8uOEik3ScYagtIFSCJ' 'V6QOa4EhzWCxI/DbY7OdrPb19XWiKzrKVDMmulj6I9RZeuFstUImd5QyCMfBKnWlyPtqxV9nZ8' 'BSPZCo16q3TkKcw63C2mJj3a8HjkdWZaNeXlhrxKikO0ajtRsQnWhXHxyd9SZnB71jo7OTs8MO' 'pxcTi3r3jhYKo1NzkxOz3nTBG5ueGp8ET9Ov497o1H3e3ZNT47QJlDnMK3gQ21HIySKgH7tHZo' 'Mg9nn4G6zQp6IHRlqDi1l5S3hvQtRJiDlklwT8JStl4Z/WERFXsCMCLoSt4nLYyinbcErAmfB8' 'cUqovwG9kv4aZKgjfwO6nf46wlD9N/7aYdwaCfkb0J0Gw3Xm7y5S7WGLJJzHU6TYPMvdR5LraO' '6zKW8Utkd5qeobTSoigAqgMmbrPj35wzhSXiW5WCMVlojcKOaHHEy5XvPaOc8JdxMP+kRzZCWA' '7STIkneyO2gbf+E+SxLEZckQNdCy6UW34+XZBozLkP//Ml62RJl6v1k0ja/V1bgbjQoQqnVxCa' 'yRPGyP1LgVwXZELnZCXjZ2q8/D6gXvEt3R4ph6Q3ptF9sdu8ig2SO/Oniy9bNO+tVjniXo13Xu' 'YfmVol83u7c538DOBfuKZWDuL5JkKND0lmix076j5YnhC2YaldGlOGYfllKgpn1YZ6zwIweL3M' 'iQclVHNMClolNI/VCzF8kBj1izhrY+ElEIOMQRxIRl//5SLeBslv37xZUS75bmRzJTCdPiIrw7' '5UYYVBZvp3+ZdxFIBt9uGH8TphjEqE8vFRH+ve7RxkBirVYB79K3ShV5h0cFLp+Ci1j1LKiurV' 'D3CAP1TOJbOXBBwpub/T29oDZboWlSxY7xL2WBIjzzMO061QvIIRDFRBnfTGL6UJj3xmuxLYN1' 'lLRlmCbdqywIjFJEYL47IaAEJ2r3516f8GZl5fsVMk01aWTqeF5WVS/yCKrFxoQgWMkPaEduRF' 'rqd4bVfia+Lytdi0eysrpM2n/I8SyrhIeMAM7YMR1PSD9tCMx/WJyf0kNJunfwUD6c8MZbe6/5' 'TnOQcHQg8QZmOjF3ZAvQ5FFHI+UwRLRwQ3O/MC6tUXALYnHW6hydW6rRhqeMFRUcQ5tYUK9Dfq' '6Fa0zZc81JV+eGrJFiRu6IjVQNDCN9eVJAKbJKocL+97YjtcTzJQdbtkKfeUGq81Vakbz8uCoI' 'Jzku0wYur0C10LFIehUuo5Gyx3AAUfcUEWUBY8XxhslQXrWEsU4ry5AHZoGOpRQi8+dgOLIxWQ' 'xsMsGcAQ22WBDY6rC2/oNmiA62gwdyr21LJhYoPySVtNjC7DNpirW6oh1Ty7yl8ge5tAq/qabG' 'GkeHGPq9FiRJkH7XdX5Fj0Plu7u5h9uPY2VlrQE97JLD0KsvwLCLQXwmTaKc5zsmgV+xgVZLLa' '81x1JzkK01GJUYnnR7LAgSw/vc/sgEelfKuaRZk+1v2lYHzzgDx0nkjJuGs0Eje6vTAQVZqnpd' '18b2sN9gW6HAbwz+TYeztc3TtqeZO5wu0o/Pk0IjpfX0T7K1nFKwGpDiVy2iCGCKHlqQ7I3OwO' 'raAmnJ81Yzh5qlC656MB413uv0rwf+ebtpDzftA9hqOOb0ioI139hYDfhQvOew1zL65pH3yFtz' '9FJ21OnG/qEwpDeh3wS1aMaSwWuCokvShXZ0MoK9LQhm1fNmHPo9Gkp38GCDlGUcw6uz9evbW5' 'DNKKL3ss92umpiX2b4rPeqtowgNmhBN85OOq5i8nmci86Xq4u1Hd2M4JrWgXDDMWo3Sc0KfWHs' 'd/ZKpzPcqDb8B3f0MofIr8Hf6nT6L4fFbnfSvEK5jt5l00C9Eydi5w9JxFGnp8q1exRHpC6Tpx' 'z1UitLdfxQLPV8p990aZ7jVIU3D1yqJ/kJ/V4BrxX6gthvVN6rVYPaIi2vYmVHZhMqTaNJC5Vq' 'ClqsZG+LWK1rE045oxZZC7eddfr04byMrJs7kb/kyArymhrYlrr9M7vHMQAVd+OwFOrVQMTc5B' '5y+uLkyW5z0hzOzFyYLqgfWddJkZCRSqf4M/vcaMApHvANrTMaw9w87twtzpbYAC7304Mvda5o' 'i5qYZNsameO09ZBiAI5Vn9rxRNcmPHfWbq2wFLautQL3d2e+2uW+nP5LDn6y09nWbs20Xb60/F' 'WCHhMpXZBftCLSFX8hqHDsSt/hGy9rVeZP45WCejN7p9MhIhoY9l8eBqylAr+HErb4V/GGimfJ' 'AMCxWDknw8ukFOitzfwGY+ngJzZcmOGJsQTIXvnsNU6PWlWkcgQPsvRMF9RCmwQEn38gpLUsrM' 'mfAIA/f0uz4L649zBaS7RVKm1iXpsXOwYIQabQp8DTAh38WNLpYMHS7/TM3TczMT8+fRauywQ8' 'mww4fnp6dM5Nmt+TU3PPvslNmRfOKkCH3eDIYTdNDNurEEw+f2KcWnTGIdSmC+5Shhybnj7tZg' 'zO2bnC5NQJt9vgPFGYPjvjOgbDmYnZ2dETE26PaXHsvrmJWbc31i36xBbziYmps6RnZQecLeoT' 'uhP9TSDqqRt1RGEZiAGoRXZwzEkzGxK7950ePTZxet5yGhuY5Tq2YDMTo3MESw0WnW3tBGrbJW' 'TxQnITXmBczbww+NdJZ2ubTaXtR+5y0oqX1TY71HZ3Ys5u2Wr5PVvVSG2iagBFC8O+qEX4q/3x' '2ZezPzLsB9sE0m02gdudgRZEly2Mfyrh7NiMOJcQicmYSLy9mYLXbj4JLXP93oRzZXuVsm0f7n' 'Q6VS0Ame/WvesMP26ebHnL3u1Tm+mFqjctPX110rmiLfK2Hd3tOGyMKtVJSeJuhrDwgpRlu1Hr' 'ZnjuKBA3uDXqaAd39OpNRtrCmAcdt1gpB9XGfNgge26FjFfeajJH04t+JQwK/erxrH6KN5SFb7' '3RGXtDPTZvDP5St9NjKeDZa53eB/wL/rw2qhQlegCbEcPqoLONm9AY6UPFih+GTLQMN83i2TQe' 'jekn2ZudrfzGCu1N5dVKMA8zL+Qtx/RsAC3OSAP0KCS1cDe/thRUAyT7z5MxTG3nya6fX/bD5R' '3bgOBYckeisBMNT0i7CW42Wi2dpEbZo86VjEV5t+eLy0Hx/PxaY/HWHbvs73MPZ7nNGJqcpRbZ' 'WacXk7FSfoj6XKvzHtrXRjRZFMxPywtnyP44mp6dmZgYL/RoLMdxDOc4SzVD4B7FUEs1TV4iVr' 'Goxky2qRhj4Q43Rqxi8YRqIDwe0nq4IiKW/eJAyyibX6Uvrm60vpiNfXF1o/m1W5xtq8urre/t' 't9/LUpPmF69ny7wewA1S2rHdbm49yOaJ/YvzQRXek3nkjPnhjmu4cUejvkZWRLE4wQ9H+Vl2vz' 'NQW3igqDhyntAslh/ccR2Ttx8PmB9nGJwdItzhsl9fZZEc0mQEO65XTRV8SoOxIsL18mJDY9yr' 'VgTDBNs+xwUlYh/ex836CG5/lzYDtIw+OqQUNwJGX7zJuRKNSND5Jb/hW62HuTXIfkYexvpZX1' 'vYMIw1ovoJmGatZ0w5Hzzq9Np8n+12FOeTQkJK0Nj0ONSXF0yQLkJq1OnJuYn5wtmpuckzE27K' 'UuxPdWRucPdCa+iLW2rZ5zjbtVslDBrz6zi7oQW54qvN0fDPNmk1GzTupTbHuUn2tHNNtUYCgA' 'SHXy/NRw6teb9IDBnW1EZosFxVrc1K42iHGJWmTeyb2ox9Sbte8VeJfxv1DdbPM4UMASbw+9/E' 'TDqFQhXpUwib7DyFsI2uUwjD6D6FjCdn8K9STq+twcMgKvIelpD8h4vp+/kxbG5HO5W6XFBvQr' 'EA+wVKPckU5Ff2hNP5QMi4Oxl3O2+ghfvULCPvPjU7PzVdODN6uiCvZ3c6HRX/oY34Nsigy50W' 'wgCXXXzzYdAzuDwOOGmmF/I7xMB4VjbjdIxNF7BEaE0o6PzM5MQYrZLBm51ORQQsH0MGekn9FB' 'wJ/fTsmWMTBTfZMvmDIa1LSzP/tzHP/1PC6bE0bahIXBhw3q+U/VBYw2HQKCCXO3X/RouGlsvg' '2xOO26zqNnUz8ePs5uBbE05fXL9t6t61P9bufTnpbIlptZfbuxc7A+VSsLJaa8CdPs9RwzsGWW' 'i0uhljX8hPRu+dxmtHt06OT5yZmZ6bmOKkq7unpu+dKrjlpmbP4LKfcdzmTmW3O+26RSt7q9M/' 'NU27JG2VE8ePT4zNzSpPiGk9F1vgg/8+5Wxt0xMS4x2S44fej1xO7/PQImbIuBSTh7QjKY1XJg' '1fWeXKsOmP4MrJNOxkVejoBTjptTsKhk5HwdVPJqsN07oaLPlNrSHMUwVXPzGtSaMp1dag/al2' '2DsShR4FM01Er4/8YL2knDFMNdnr9PtLS3Ug14iUpdJnwNwwd8rJaDpg8wYl5leV+Z2Ea6yqH9' 'JHy+F85NZP0vNMoaccGpfo4HtJhYkfS5A1k6nUihzTImdi+y5xkpE/Le0L5s3cZxNORoNpu+1Y' '9RvLjC59LOkmCvwbcNIJq8wCAsdvzGsl8EtsBtVWVhADrOdV4GMCxulYA2kysbbqsixXPzCNjz' 'o7NV4EZ5KJVYpe6mR3x3ZpMC7P9buDf5zAZWjKcCsZYp1xnCj8T8jVysot7+VHzUsFC0FuxXGi' 'J5uSjfYpOXPig0tl6jsKBAsPDpmFYKlcFU+y+qEdMh3GIXPsfyUTLgqM1N095ja5G8KTiReMtM' 'ZGRrnAtP+H1vHr6sJ3E4l3JlMnZo69P5lTEY75GU2MQrAoBQ9P/dYTSafb3es+y/3FLjfhvL8/' '08u/soc/2evN6EiQYxIJMiLBkntDDxaFx+JBonaUju3EoisP3qqjKyerxby3SYbjxRMPdTjKiI' 'SjHECB3MCEGJY5wLDEcTPlqs6QBGShXEWSEPoVDqs4y1pd31jieCu1EgfJAMMwx7hwWCBKjNnF' '4PTBO6fNISagiNgAFSrI0ZBkex2VUMz9TR3jFBA7Z5OjJuoBh3Vy9DeXSCxqijk4nS8XAwmy0Z' 'k69hdVnILVHfoeGZPlFY6xb98J+phFC90JGmNprRhE/XCijvxI/XB0aFSpVlzDyvX1JB1AmBmH' 'chKnkJ1PW3pEah0Ia8WXYr/Rg5qSINCGVcrW5q1qLXoWqpo8ocPlthkV8nEkbELXcaPlR1BOf6' 'VOrNDO6ymaEHeWqHe6nKGjc29V/Ku588YEWHKqAwfKNlCi0ASXIqBs7uTkrDc7fXzu3tHChEd/' 'zxSm76F9etw7dh89nPDGpmfuK0yeODnnnZw+PT5RmPVGp8YRCUt6+7Gzc9OFWcdEz+IJomInnj' '9TmJjlkNnJMzOnUWY7CqQd9ianxk6fHSetf9gjDCgh7XinJ8+QKT3uzU0P82db30PI7ZmJwthJ' '+jl6bJIs7/v4g8cn56bwsePTBccb9WZGC3OTY2dPjxa8mbOFmenZCQ8jG5+cHTs9Slb6eJ6+T9' '/0Ju5BHerZk7hSKDZQxyMtZqIgAb9mmN6xCeolQiDxKR7n+GSBlBsMKPprjIhHHTw97HgcDk9/' 'ET1I76Ee3TcsSGcnnneWWtFDb3z0zOgJGt2+S1GFJmbsbGGCq2cTKWbPHpudm5w7OzfhnZieHm' 'diz04U7pkcm5i93Ts9PcsEOzs7QR0ZH50b5U8TDiIXPae/j52dnWTCTU7NTRQKZ/ncZYhm+V6i' 'DPVylN4dZwpPT2G04JWJ6cJ9QAs68AwMe/eenCB4AURlao2CDDDqxubsZvRBIiINKRqnNzVx4v' 'TkCdIdJ/B4GmjunZydGKIJm5xFg0n+MPHAfQhYxYcxUdQvR/1tse4wz6c3edwbHb9nEj2X1sQB' 's5PCLky2sZNC87xz+PGkZLcf9c6TIKhVnxsJdm/f3Qzy7vHrJX+I1vkxP1QB4zUSQmWESbZsQC' 'rK2VvYoOazfvUBWtEnloMVf91vDHungsVFbzzwqyqeiyUNxy5zrVqJZVbCKcpXx465oKQgJ6+L' 'gDPZ8mpP5tZcHVbdfWKDdYI96TrVUOW2l8pkpKAGGBfhahOg5Bgpgpr1SiYicAVbKITlPqTCmz' 'Z1pRBBpCHyHWVlhyQ7foj26h0cMH4j/TUugejqb0CH6a9hCS5XfwM6Qn8dkkB09Tf+ytNftzD0' 'evkb0AP017USiK7+BvQg/XUNQ6+RvwG9if66ynk5Usu61Y9cw4u0EiGaTtHSnm51MxmJUyQkBF' 'KLzKgoIwtgC8fzK0tIKFtewZ1e1b0ND7nqXmmNA9EXarUGbRr+6qq69ajCqaW3SqL//aoMtGYm' 'ZF/QlNR54iTIsnmWZoOGvqtBwiZlyh3FCoiEJI0/5OB4XRHgVi7BrjMnn8V5kvusTP0OhsRrzN' '/m9rhXx/L7b3Ov4Yurovz+29wb3L3OIQ4yvIPG9AIa0x5vXHg35AwRRGk3Apsv81GC5B3UsV3O' 'c0z2453IyhocVuyLHXNYlWVAiDMS6YialurSqAeBnQbZwe/HEyPvNFnfOjHyTjfL9wFFiZF3uj' 'vdnDNiEiPvIixXD+7msg/e4GKtRj3CP/kFvz6oEhLsbMgOfiGeH3lX7LMqF1Qnm+v8yLs42fwW' 'k954TOrlTmlNQSaUF5auoiwCIpYpqK6GiucOHot1IMn3IGU5UjvKHTzGkdpzJiVwHGyRG/c4tC' 'JKyVeRhFE/pFuiS5m4QaWOscYWSxTsYLzx1MFx6p0bSx0cdwfcwVjq4Lh7PTHXy0zq3wnCckNu' 'pbl3cHteXt9ISh7HHQYs6UfYRIAsXykvSZoGh+pa8e6xlEHVARuSJog9DKyCEybfWCcRnnD3uN' 'c7t5ncwFOEZRjJ0SjwXFsdUUnltoi3N4JYRmAHv2xDOgnSw/eDRDmCp9xdVh4jcgRPcR5jn0A6' '3bsJy4hpgYz5u2N4O7mNXv4JyZi/m7hlnwVJEeRGktsab5d7mrDkTYsuwns6hhcp2qcJ77UWJE' 'GQQb7qTUNSBBmm/mm8GQ75jfBmCO+ZGN4M4T1DeK+xIAgU9iy8Gb4vysbb7U4Tlj2mRTfhnY7h' '7Sa801x1OoIkCLLdogwuIpl2ryXe/SedqOy4ZwnNgdxXEroADWKjzQU7OqQotq/qRNAg0jEs+8' 'zKvQv9xaCyoSvvNVRCSIO2dfmM3pqXfRQwXvLqa1UkCNHusFYtqg9z8vOirBC9r5ANPaKSqa1e' 'lc0VnVgarN2ILQzziTNWQotDHaLg2RgFHaLgWaLgTguSIEjO3W9BUgQZoRk+J5Ae9z5I4NyMqp' 'vPoa5GGFnbiHq8tiprX5f3J1oMcrPDg6xvqR9HBq2e9lBP74v1tIeW5n0xmdlDPb2PqztGkBRB' 'dpHQHuIo+hfRlvcy2vJ2xbY8XTkOrg/Z6iB+X0Rb3XZmPnXVx/0mATkpm9f9pkNJ2bzuNx3SV3' 'XcbzYvfVPH/bx5abwJ9xxh2W9aYHc6F8OLCzXOmcWi79M4R4vleguSIsg+Wj4ab9L1zSJMyqbj' 'x/BCsPgxvOiNbxZhUjYd3yxC9Ru3fN1oWmC7KMbwpghv0Qi5pGwXRZqGGywI8AzRuDXeDrdkhF' 'xS5HcphheniSUj5JIiv0tGyCVFfpdYyCkIMiwXCct5NxVB6K1F2gR2OJ6BYH6X3A5392AvnACV' 'tbDMm+I2uwX1CG16m6Bpgm5xs03QBEG30jfi0BRBUWvU/nLCXSasu+jLEw+2/zJ4Yrnly9Ball' 'u+nGB8W4nn4tAUQcF3WQuadB8grAdiLTETD7R8C7zyAH1rsAmaIOgemsU4NEVQiAc9t2m3EuNF' 'bIyV2NxiY6wYsaMgCYLkLF7ExliJ8WKnW4XcNi2wMVZjeDu5jc3j2BirxOP7LUiKIHZ/u9xVqC' '6mBTbG1RhebIyrsf5iY1yl/l5rQVIEuY5W6a8lhDwJvujrQTeVe0vC43g7SEntwEQ1ErnXI8x7' 'hTZQO++GnU8Q8JJvxymWchSgKjobtYrvIBYpZyGWRoST3YUespor/mreMUslwT12SAx6BoKlcu' 'EiS0Vr9hdiTKS1+wsxhtUa/oXYUtFa/oXYUlGa/vpFlopW7tdbvoylst7y5QTjs5eKVvTXYyI6' '425ABTQTC31mI8YO0Gc2iB12WJAEQXaKXqcgKYJAr3tlQkDd7ktRESe3Fs2JdbOMvvaidc6tFM' 'uW6YVjQeXNsm+Ts/9ZFQgiPkOqVz7qPfSol8bG0030emlsK4Me9VK+giCCpAgy6F6nrk9yf4L2' '1p9JuAneP1N8w1mGNt5CRl+m9IoE55iP6puUUJA1JEUm0BoWm8JIH4RNXg+KtaUqKrkgryzP2f' 'naVImuSupQWG1QJ0DYJew7ll6Bcv9HYncsEejZ7m1cVwgGziuBZ2fujDfG4Y2qepkqQugV16if' 'K1Evq9FKC01FRbO+7J72K+w0esK/RepOpyS/l0EDFigJ0BXU6mbe/l6NMtJPotT49TF9JdIbOV' '3PzLy52eXV6payLP+E++I1GNyjCdoEBzQMpXoTbpfb4zzfgDBLv5Cg1bMtN+YdVKnZmi8hXpCW' 'CdcVFwDD4/WgXFfPiAI0lcgUho8pxNG4w2VXDGb6IOPubwInAUbR8a0WOOH+ItpujbVNaHBfEz' 'gJMMrWvNQCJ3H/GaHILSEX23tBeekFJEjJtiT1vJT3vCk5+TWyteGfxyVTtL4aAclfLpdpxcB7' '5UUSk/olS3WtlM8HyBiNdSqpbmlr7qt0C321h5vChWxE9lhbrKHXtVIMWa2vUxSzh9uBO9Ketu' 'EeOfyDDbdD3fDWPFzo3A+3DjeNi/k63CtibbHhM9htAicBRnU9G0Wn+6ZWFNjb39SKArfXvqkV' 'RZf7CNpmY22xjTN4SxM4CTByiW0UGffNrfMG0f/m1nmDj/XNat6eSFjwbtzfhiX3x7hyZWmkFH' 'ANEWSY61ABWnIn6rW1VbZQuCyKiV1hewm7Q2RV6cT7I3nvZG0dF40NK/f3EYernQTmJC3U1dLD' 'hr48gYui1ZR45s1liT+8zvYqm5kqbRux3A15qG+LR8WT81XU/lOQJh7BFvL2Vh7BVaFvB49sdQ' '5bYAcX2HW4Vw7u9k4H1aXGcnvCxFDBVH1H6/w7Gb7Ebytxyz4L3OO+UxF+K198QWS7YMrxxPHC' 'sHxna897CO87Vc9tpuh139XKmr2E4l2tTNFLKN4Fpoiz5hbcTdcs/raoW+yaWXMLoXg3WDO+xv' 'rc96Dt9ljbPkLB4IEmcBLgbaQJ2Sj63V9pRdFPKH6lFUU/ofgVhWLYArvue5kWg9shX8KYWFL+' 'dRuJS7jf20okl3C/VxHJxj3gvu8HwD1AuN/XinuAcL9P4dbbZcL9VWyXv25vlwkF7SK98oABYb' 'v8IFMol9t0u4x6oZXdD8alTkJ2wQ9i648mQKm7vxafAK21/lorCuyCv9aKIuk+1ooCmB9rRSGt' 'gaKfgRjgh6OrPPVdbx9uvustDZC+QkHf9fbhBHs+7LveCAS9WiNPuB9JcDGS6AK1DgWK37z2kQ' 'R7be2b1z6CZbc9dvMagXLUUY086X403nNskR+NI8c28tE4cvTqo0B+pQVKAYSev0PfUpdSF97t' 'zP1Cgq+X0wmVYIIwaEi4A1xxWnUnKG2y1Hahpqs0cuiDftPhzTV61xxtVdlGNCl9w56dEAirL0' 'oYtG6sS7XeyZfSd/L1WyC+k88l7o9AKXVN3w7nt5MC63A/AVRe7n1JdshrhxmXKEVxGw4ako6X' 'w1hkBRfnhGPNU/fwqSeOujspVLEavrc3vxdXUeLlxbVKZWME2TRcD4bem8ah5noZBdPGbrxxBA' 'qIFxZrOKBzvPpaRRQTHY1BKnvJfNbbV87TtxfL9bAhVzMhPV31WOvQ6LcTjYrnwa8jYkxdpRm1' '05dgDuNwGRuyXPtcqyHkRqdFDFkT0aGpZ4PSANkLBlLnE1gwuyxQCqCryeR6hWY7ua7vmtwqz0' 'NkhVyc9nKzmmTygqSTILUq6lG5EJWcVpakX+X6s2HEnNZ44Lv5VHw8adUvezxQ5viCwJwF4msE' 'd5Nl9lHNWJ3q9rvrcu9UjEW8hKQdzU/GAx9zszdQwrWuC4qaOmVooy+iBa6FWq0S+CDNIDJ3Br' 'FUBjn2d1BaqIDN5u/ogkr8GTxha3AfljHZYP6qohYO29f9jSH9MSjRTYjGTHvVLRW0xi29O+/w' 'Dh2+lVlNGulS4Sq6YeioCmIYIbtD6fB3RfTujN8aqECxWwM7RBm2bg1UIHNr4Ks0S3W5n1XXfl' '7A+mT5A/eB1GnFyZ2q58Up3JpP7PNsmqq9oReVUnDU0Z1nH6XEL6ZXsXD8hsVYcLJ9Nj6qLhrV' 'Z+PyGfr5ZyGfr7JAKYBwMvrPelQZ9/NqVF9PeKdmp6esJaE7pW5QM4WcUQJnYaP1aD8vYstR9+' 'Ms+6qp7w2aNPZB8QyouskavxQ6U4/2Sslox1St5bLRtmgro042rc61or781q54xP2n/hVR+4sv' 'nXMgL1Gih55UxvzQXqTwUH0+TssM0fLzcQ6BofL5uNCBk+rzEDqe2Ui73T/lNWrawF30p3HkOH' 'f7UyDfboESAO2w2A8eoz9V7PexboE57t8n2Af27m4mNK3USJb5Ysh4g/oIbjCvbu81T6I7XU1Z' 'sXID5olfPB/VifJgLtRLXLFS32Cuj3vkOuB49QCWpFFfpFiSubevUgPn18yyQDAHF02s8E3QlZ' 'LuXlGcSXIxsPSGkXOSkhSZtHkSclkWW+gpc4orYQ3iWG05aJSLg+q5rjXV0j8E95Bc54hSXnL7' 'uPaxdMkMUb20FDS4DB6qjnvmE+oLQ3lvVkOkU6G5jLDpOFJqP6JLJXUerzNoWVaOzky2Q2a0HC' 'kpry5pRRW5QTIwKzJSDr2yFQ9lXw63zJp2HuqyVfThMKD9DCNSwcXDmCjMAe4zpE0kYCM6jpe+' 'T6Jd5sjMmrGmse7YYHZidbWC6FOqWDA4bZ2Gq2NN1f1adUSHRvyMXYmIpQt1SQAYNSU1iJmjjv' 'CxEdqpOCDJCh9SR6pMFhIKIU0Kx02s07RDgLeMqXlyaZRhbdgL4CrGCfTSsihgmDtdGs9hDaeJ' 'DnOyPAOOW+UKdiqcAzeF6bCrRuTkpUHtxZoMKnI/ZWxTUL1Ut6xCmUR9WPSEWUNmIipD1jQIMA' 'b7Ng438XWouRDCWq2Rir80bHdvg7AjHm7DTKMTIWG99Fy80MU5S8Li5Pzv40LQIQn793H9Gg6J' 'v4d+fY0FSgEEv/l1rAn+A7y834aXd1vMy6vHp69+/gfl1O3P6Kufn4rsm7RYZtYViPp+56fidw' 'nDMnsqssz0/c5PRZaZupr5W5HM1xcVf6v5ouJOgLTM1xcVfyuS+fqi4m8pmY8j+E73nzDcX8Ld' 'bTvt4VYjQyIf3Z/7TwkON+vP6PtzvxuNuVPG/N34JbEY83fjl8RizN+Nxqyvxv1uNGZ1re33En' 'xKad9A+73mG2g7AUK9VPsG2u/h2uWh2A2030vwSaVGnlT3Kkavwaj6fhw51OHvR3em6wtJv5/g' '8BX7QlICIX7lI3wmzmfcP43r6F6VdFO5tyfbHCxqvVq5ca0jQPHrtjtWRA5xuekMEXPU9gCx6f' 'yQq5/qlAclLEp8EWyxoVSbi1a0Up/0G7yTc/VCOevzwrXisn7EstKqDcoxNmIUeOruV46yKVcb' 'Rw47JA5WSGM197+qMICfxqVQu5xrDQg89spkm9PNK+wmNHfcqLcJnAZ4i3hVInACYBxwxsEpgH' 'HCaX8+4f5MUo44N/s8+PJnWj8PT8nPtH4+oVDilDMOTgGMBfDBhLBWCrdR4oqXtofTm/JQ/EEz' 'LznQWnltx6vdGn7CVQ8VXwX0bcpbjsVceiXAxfHzydgSgovj53EN41UWKAHQbvdGC8QjxeUxNQ' 'F1uK9NsiF6f9SDqNObnsfWA6XGtz1yddqdueo+dOhP2qA0QLbkglvgtUljw3WKW+C1SRaouIOk' 'y30DLsN8c7IlkFf1XJ8SKvmajy4bfgMuuVRavrps+OGkEa1dwuQPRx3U1wg/HHVQXyP8cNKIVn' '2N8MNJI1rVFcBvTBpHn76u941x5GDfNyaNraev631j0jj69HW9BNKOvi4WrY8kOTpat8FsPhJH' 'DtH6SJKvFIpACYCuEpncJaKVQIiQviGDqgVvBWn/A0h7ZYy0UnUkH13K+9YkX/Ten9GX8r4tom' 'ZGqPm2+M2zoObb4jfPgppvi6ipL9t9W0RNdVHu25Mcj2Bfa/v25mttOwHqkVtL9bW2BLqWRmdf' 'a0sgxCRo5En3l5Mc+6LbgJq/HEcOav5ykqNfIlACIIS/RKAUQIh/wblOt/tuUPPDoOZgU/gdEq' 'ql1HyMsrAh353kMIL+jL7H9j0RZbuFsu+J+qdvpn1PRFl9M+17Isrqm2nfoyj77xMCS7iPJtlt' '8LMJEr8czY/0DxXYz540lgTs3AhC5Sps60NbR7VwMuTaFuMzbjWppauy6BZhJtRawxF1fzHLj8' 'YHijXzaHygCTWGrCy2bpllAl0jq72bZ/n9wDRo2mCW3x9HDm/j++PIQaD3A/luC5QCyKOJ18hT' '7geA6XrTBoL6A3HkENQfSHLETARKALRTWLZbBDWBcP3TSQF1uI8B0y25W7xJnRXOVcKVpe2pEl' 'QwLFVRJw3XSTtRFzo0LhuUBkhr8N0igR/DBZCeBUoBtEfUYwXKAHS9+2wL1AXQQfdm0/e0+6H2' 'fZcC2S19F3hr3+GE/VC872mF3u47rIYPxfsOJ+yH4n3HBXAfivc9TX3/kOr7hxAE5bh/grX7Ry' 'k3cXjKu+NH/8/xpH6Cc/iPtngT8E6Y+OYorF7ltGI7XfYvGKM5HPT8hsrntteh4z3ABmN0f4u1' 'XSubjxNnaYnRtqx9EyUvrCBNFeXty0gMo2nBzi2XMoqf06MttKEuIFU4oIGSrV9eXauw9W+8hv' 'Y9FzqQCIjaBxL5YUsgUeDtF9JYuGSUVlutg2wErIeIm0glErGboAzpEtaazHDWpDjmKnKXa41s' 'BccC1bBBFrHycHBkFh6oquCm1LvdyejUBHcE8C0urUUt8rYrmKUdz6cRlnL8VazXwpB9P60k8O' '4N1EmMdQ8O+/Bq3mpNzYJy0lo0WueTm4BkbBll0S1f1TBIpbhjtUb95Y/yHIaqawtBUHUU3VSE' 'BVESbSzsEP1MdnWliQ681NE1zCvx2Ta3fNZCdauFSnkOjzrefnbj6IaqZ+wo1qF7bJWZiC9MMS' '5bUPftKNdzHenNtfoSceVDkomO+3L5lGiV9HMO+qjobwwzISXYULp880H6D1hQhx/uoNvwnz4s' 'ktMu3EnEGc8hX2+AhQBQyb5yIuB7XXhmGTX3wgg16UH+IqNekBSmcFnIz8NXWU2c1WCw4Us4pF' 'BpQw22+Rpl6OrByAp8cLquwchSpbbgV0bMDI7UgyVkh29YiaQ8+JrW2a1wWhOUO4sAmg2dao6h' 'c8o3bh1Wyj+nWwLPNF9FTFbByJi3WllbKleHeCixV9aDhbDcwCHlYnQp4ZAkdtRxrlKtAVlVbl' 'GiqaywPKqtM9mx1qr8RChPi/isXCqB58w+/HKtyrRqHlKe01RUqCOssKBlnqTcARDhKNog4G6p' '6cWxyRpfiWuJi3BtYSQWEslHYmpF6OUdqrxMknyK7TjRP/Ss22KwOLwftKwDkCjonpoWU3L6DM' '/7Wr3KN2LIVqDkB2QCX3gpGqhhRPgP11aFM/w16j6tLnUhih9yCrEc/mgeUaorPH9/kuTbJDnN' 'yGHd9XHs2Xtyf5sgishViKdo3j0pnweRVYfKQphJ9kablBwHUe/F9yu9IxlV8Yu8ER7b0CeXw1' 'bajUaM9RviOHthLXLJ1BYbEHPlquVFMQ7S2PvGm1pFCBjGzsf3ijcWqM26Xy+F2skiSrLSTRzR' '0R+P1BVHdPTHI+3SER39cWiXV1ugFEBwdn07KbCE+9dAdWPur5K4CadRr1VaT73XkcBLrMnUZX' 'ra1JQCD/mm1CTccM5Nmbra9SwqQNMLe4GwEWn2+4a0HQO1fx2ubpzaVDeslEFr91D6gNlO4z0h' 'Tm1TuVScaJAQOiwBWxIfjfMZg2YbfXboxFLLNT9L/EOZOlKSPVjtJppkXGFVIbOmENbHX8enEN' 'bHX8enMKFmJyv2oyPWx18nOdXn0ZTAku7Xger23JtSGKyqtqkHZRYFq1oya1xuhQYQnSnRwlz1' '+c88iKWSqZXogDoZUV2E0LAcLvBuLmu87Sw4crBCDLHGcRVQvXS4CJQTvqumLSU1CZl4Kh6Ew/' 'XbVa6lD5jozJZ31Zd0VKZj8S4OfC2OvBQr2pzoXBYrSg6rnj5YXF+PzzsMma9HloYjhuHXYWns' 'sUApgG4Qx4wCZQAaco9aoC6AbnJv49A+h197Et+byO1SaqOIV/taIat/sC2fjPcP0fxPxvsH2/' 'JJ9G/EAvGHDrqHLVAGoCPuOIfQCUi1u8kdc/5Oi6AO9x/xyTtzX0hK0IQ5LLYY+PDFOdhYEg4r' 'XOvqEIQvdsR4ob3yaSO83I1GsLLKWhhfRoudSO09Pp9jnp07PnKrw6El1JkXr/EhM/sS5HY9uZ' 'XMkwKnVk0E1alSzWjj1MrwpW8lOoiyqHgSFUxXG2H08fi3Q32cKXOHoIkqaS/q+jQZXKTT8rcr' '0IMk99Wa3w5NbBuUBsieX1jp/4j5vcECpQAaEr+vI1Y6gYbdOyxQF0C3uM9xZhiEbInv4Xv/is' 'OU53im2pcRr3JE267khLYPcQGxGYPKtSCcXaQLTBoQ1IH/AS9+3+BN5itR9QXGA8xi0Q1DaJX9' 'ilbu1ZGAQUVfYGTdTeAkwL3uFue0BU64/4y22VynqowweICD/6NaXtOrfAuyCRYXIaikig7rNt' 'g0vi1N4CTAiJi3v510/yXJQbu32IMuwcIBowqDni43AlMZqokz7I9gLIzPbQLzZxDw3y8TnXZf' 'nsKWY2YeLhQGORaoEyB9oumIC4VAO8Rf4ogLhUB7LcEGFwqBbMEGFwqBINj+VouNTvdV+OBg7v' '9MRvrfiVqT9kdLlgtH/SDaHwmhmio4NtyCVPZ9uw5VvOAWq9gjHA2FAim2GmXURz7e91CwbhgO' 'K11qK69etaKY7Lf4Xk7mn1Y1R9DwaV17LM19ib2sk+aNeLJEBsLjXhWfWYTHvSoVU1VwvEwg7S' 'hVoBRA17jXOl/oEFiX+0bmm9zvd3izKllCao9rLSKM+5OQHAYFRF8We5fnDUot8kHzigr25fAE' 'XfoL4pq0RdR+LBdhkHiFmTEv3Agb7JmZ43iFuv0lri6CIB+f7wG2t5qwpRvePlMmKLrUWtmlqA' 'DknWge1HogTiI2/c4jpra2aDQn+RKEe5R4wqfGfp2aSyIF+7Sa6yc6bT6mqLGuAllUJJCV4kJj' 'WfQvqItFlZiQjjvKARHfUm2KKmN7c5LSPlirIyZICTgT+klshkBRxB5zIYhSIO4J5WlAuGMrG6' 'hcGoeN9HKxDJ+iCj4hk5ijaNbsjQ3hjm+McynCHd+Yim1sOKkjkK1YIdyRQLZi1UXy541x+dOl' 'OBfyR4vAjPsmfC/a/BAl+KZ4FxAl+KZ4F3C89SZ04XoLlAJoH+n0EYjR30gbaQTqAujZJHR1F7' 'rdR+JSGLGEj8S7gNzTR+JdwDnQI3EqIJbwkTgVuqkLj8Sp0I0krzgVHPfN+F7UTUTyvDneBUTy' 'vDneBdjzb0YXrrNAKYD2SuSHAmUA2m+NEHctE+hm6tU/akdAj/sOfPBw7m8S3mQY1Y6xmP4ux1' 'MX/IHda0p8kslNij6EfgOpWBKbCH0kIOGP9lFSmPGCy32qtCI31JWclp7PLsJyw+wRWvtAQJe6' 'Zvd23RzvO14l8MOGHZ/JKWFaKeEv6SEotbMS8wOgiMc74qRGFY93xEmNbKt3gNQ5C5QCaLecgy' 'tQBiDPPWSBugC60T3o/KQmda/7rhSfubzYU/c2hDoWjw8c+RIH4xCQomLt6ruJD5tdrgFHaKqa' 'bEst+iGQjd14ozXsXhr2u+LD7qVhvys+bM4QS5nTGgVKAbTHWnq9NOx3ge+fbYG6ADrk3uw8rI' 'e9xX0fPjiU+ynL1VTTLkmvKGamujZCZBtfaao8qWxnwrtgveK0G2uTZpJXQlVFEWpxalFiC1Hi' 'fXFKbCFKvC++NSPR7X3YmvdYoBRAWO6nBdTn/iow7cvd7pn7KJj4Ld28Xfck1PkaoqFYPeujnv' '1qvGd91LNfjfcM+XO/ip4NWqAUQKh89Qat6PW7H0pxNMlPJi2/nDeL2zvsTZrXHefhtnrsoP2O' '6dBujoSiuSF1D+tqb36vMpz4hvmwiPMcXblWBV3V9NTqFJDwQLixslCrwEmnDH6JpG5Edlpo32' 'o7rEIkuYvm0EWi5dUpkXOxz5ivRPTsx6FlnMT9OLSMkxj5hR9KxbyA/Ti0TLnXEj+8QjO46/6G' 'mv3ViL9Xl1cvl6/RtIVPnDb8PC5zh3BXMsE3rPG4NJ7fiI/HpfH8Rnw8yGn8jTjLuDSe31As80' 'k9ngH3t1McB/9Ygo0xa1rY5xPdZ26yjCDA2o7D9NqJut0y2eZRXGdnjdvOUcCSAs80UIzWVDA0' 'nbDoQf+qQdigNEA2PZCH+dspE9KkQCmAEBL73zQ9su4ngCqf+50fgR76MhtDGKd1Pi9JmMiFat' 'PGMcS5LNpkkQUWp00WWWBx2mSRBQba7LNAKYBudEec39e02ep+WomXj1yKNnpWEce3RvbCD88q' 'Ekr9QzELf7pV5G4lmnw6TpOtRJNPx2mylWjy6bg82Eo0+bSSBz8hoG3uH6a4ukj1h6ou4pgTqn' 'ilaa0YDE7r0AN9ZGWXIuEO0GD+MD6YbWTw/2HKlCJRoARAuhSJAqUAQimSV6sJTrv/LcW5pQ/9' 'yLVIfvhxKXUZhUuoM7pwiSOFSxg0YIGSAKFwiTr66nY/hxH0CZZuwvI5EGKLvNLNWFpASQ1CzE' 'mP+3+k3Ge5b+hwE4wVWiFBMu6VzuNp/g0P2t+m2A/7h2nsAmxiWYehUSLOIe1YQiu7lsFiLIvS' 'XJduFRNHC3PCNQINmUi4UOaafMZ52YTdEfRkP+J4VYosRAfkZaUlRgV7VcmUozhq3xt6SFNy4C' '0lK5JzTeE/XQzWcZIe+I21eiD3zGOmsfez3s4ZDKWmIsUmwUZ7+YMHfS4nHAs/8Ezz47Wa9xJV' 'KF3W/iY3YHl3MLVvV20tFrwJE7DiP8hPXhaPBA+saBFYKCrYAmTQ3VO5G7dbBA0llpab2lPlcD' 'plnPnZ3uc4PT1uuAvY9Nda/e2qSCwrNzoiZkGixEN1SBSyXdScHMSfPGbSR8QC0se/SjCqiKXG' 'OscQNOrloqnuz7MfoFJjUTwlZnOJZRsq8cHMTRLlbyOJokBpgLTV0COe37+F1bDXAqUA2i+ebw' 'XKAKQ93wrUBRA8308mBJZwv4YPHs99MeGNq6NGpVlZ7h7xxul7zbzBknXwNOjpu810sDSRmGvn' 'LxJ/NnS2tzpK0Jh0CJBOGWX55XO1SmIkUo5NvVdR0GRJ05opB/XbvWqwLp4ftc78C7Wy5iQ5g7' 'M6OWiRGIeaX4uTGIeaX4uTOKHo4roHLFAKoMMixxUoA9BN7oQF6gLoLnfc+QdN4qT7TXzwUO4v' 'I9NfL4pnzPq3Vt4PaPKLxe9ctslvLRZNBpyXfTNOZfjjvxmnMrjvm5HVr0ApgHbLBqpAGYCuIR' 'M/AnUBtJ+mR+0T3e5T+NpW3n16ePd5Ct/qlVfU7tMCSmqQfo3b9JkudjMjtICSGqRfYwAqHuk2' 'SfVaHGRavatTxpFyX93hoojqL3VCAzNpg5o7lLSJR6BYqq6/yhk7G0r8yazDObyqc0t1DqWBKN' 'HvAfKcu4MN3Pw27PG1RPjzTsDn1VK9wzt0uxNpViU777NSq50PuSqURicdPuOvcvgzXz6odxV7' 'Z9EXFcb3kqiFX/GkW975YEM60dLEdFis0zu8w9LsZeofI8jjHWoaneNNNtVG4gDQ5VotVMLbcv' 'aoedHdv4PVDrO+FnAlDPYIn4QPu04wN+XYIjZeeUK6DC0Fz2iMqiaIZNgogltHtaMzk6zwcRZU' 'SyUnPpjVgWJc0R6RKOVF8faZjMv2Sa+ctDU9N3FUV9MW17UxAZruL6DNl8NjtKrFXKUK/zraQa' 'Ay7AWBCGcd0FheiTnJ1VmGGFt6M5QITHtTxHE/LxMblAbIliU47ieQKwkKCsTrC/XbbxAp8XPA' 's2VwO4dn4JBx3hyx0sbnmAWdQktbVgB9CyipQdcK+p9X6LOMvupXa/N+OI/PRJg70MhGg3PsFl' 'BSgwoylg73tR1PZylFxqmx2qBOgHos8cv5SB3GflGgFEC6lCL8ua/veKZKKfawRUL4tUXSIxYJ' 'gwYsUBIgWCSwJXrdN3aQLfEP2paAq5UgGXeb8ytJ/g1b4i0d7HB4Q5KpyneLRtyvT2U5ivHGG5' 'tDO8To8KMocmeTEiUSt0w2OqbIxNOtY3WQBqTtNX2K5RhSoerAutaR4oY5osCNPIhCeWqkQUhR' 'cvQGW3mA2FJSz+obpKAFe+F+rLMfm3MsSwGngHO09xrsDH2Qd63iil5RS98SMYoCdQKkU7d6RS' '0lkC6j1CtqKYF2ygbfK2opgXZJWE6vqKUEusEd5npcfB+G+1Z8710dUo9L35FBUNTjus6AMIlv' '70CJr1y/cfSscDV2Dg8wrZAJhXbN4CTAW8hu3WqBE+4vd5joBgPU4EwTOAkwFquNIum+s8NUhD' 'NAFJXrMLELEZhbI3bhLzRvJtxHQYFduc8kZcVz7QhhAglIkSg6VTRAy/jVOkrmYRMSfZhjt1m+' 'IdMIxqOxM1sYVnERjL68V/BFIaGPaewwy3BXlfbzoFCxrmkVReIFii2VgSQ5uX69TpsrV8Ln+p' 'S8VZm49kpzvb+FSm0h703qKh3DahfR56zYQBrqUhsuxMFHtxLDyaaAnBkrolnl4TTPcWZVnKU5' 'syraVHplyh/FpnKlBUoBBJZ+W1pgSfdjQHUk93Npnit1h7CJYhPXWBAF/86yIqWIZnyKkplRk9' 'IzUhzE3k/hozC3zDE98N6zb/IWeAk3ArKZKjwdi+UHdcErx9tHj55907C3Jv+G8i83YoD8NYR6' 'RVapWT0QcxGwowreCcvwHNrjUZFn2gzkiSAtsaYKsMBeKHNUmQqAAwsvI/5RQsN80pBIUYqq80' 'jZG3Hge4uVmjI3VPpG9Fl4vFhybuCpuaXYWEEyCDbiY6YtYbY6L5lCjlFvrGeDKtB7UFc147iZ' 'YNm/UK7VrSwmFj5qrhzPXKbM6ewxzc3cedJQrpuYcDdlEWoy2Xb0hopJVUHsBMaRjUo+QMRFno' 'yE5fwk+MAoUL1ijH0szusITPpYh3G69opsIlBWdtleMcY+1sH56hEoA9BuCaHsFWOMQPvcQ0Z8' 'J9z/Dd/7T7b4TihoF0nVYQOC+P6tDg5M2y5+bSskQyVDXmG3JiS/FRfNupbib3Vw4FneAifc31' 'W4dzLuFk4Nm7An9BtbmsBJgJuxJ91PbII9Sguw0aA/n2jFLoiA/aleIWnK/VIHx7t/uVdHIFkJ' 'UAvGJKv4D5UrG3d53mn/oQ19UG3OqUWlGgEddcl4ldoDX4sUKFrX4asqBtyyPDknjxUV9bVhJZ' 'fKXClO2u0No3JpLH0lSV76h8wDMQyUrqpipdQGoDymsppiWEWQFxsqqyXCx52VkoFc3U+5nrQL' 'VFIcMHyf8/cw2iabCX65xXoQqFMTtvRMwR5W6BDPtISY+DrIu2HS6+LlpBqmjphWYHXemwmldc' 'wmFTusgeEYri0tBaGuERXzCvp84x00v3KgSrL5bFsCT6w/scJjXJi7VhfXtCUwFshSPx8Eqm4i' '6iksYy6II8SbIDfHxCI/yy1iSQdie74K5+Uey4VTSP1blKM4uHWt8yaa5dsdPnuV4HSul8XObN' 'yN41vZ00S342t1TAMUFLAayvSM4CIdcxGOY32sbPfHunZLdfh2jipr6OhV/TFgYxGPsSu/okl9' 'Uh9kdi6u1VVOKO9kFVU3Ko4QTF+uorYb545x4SQEckvNEsWWREXbF95svbf6GorLQfG8qcOk1T' 'eVAujwBknzH0uyUhksZZQhpCGBLSbDSbVuEae8b0hrdLHV7fC36wHSohRDckUo8RvElyLOIfhG' 'Ul4CsZ5ZRyfVAAPGJbE6l6imIzvb4GTDRxJCayqoVa3vclVVBZPNjy+cxetMmGFsDIFvVM/Vtf' 'pqTcX0gDCOXhlQYqrNO654ppnc4UXp7ZhzBFNiqyE3P5UbNsX1cY4Va2jNjZaW8W4warmLdr/K' 'Ntov3SjztcaxrrDjdj+nBOx3LtYsLpu0PFNlxmIOxWUo3ch0FYpbWgLcLF+Kawlws3wprhHDD/' 'KlDlM9tlfcLATabikOyKr4EpTk/RaoCyDUTPp6QmAd7t90sGP8z+2YOIizZ8wtrs8qwh/OKe6p' 'srGXFQcn5dA1ATr0cG1QGiCbvtCd/qbDuMR7xdvyNx3GJa5AGYC0S1yBugCCS/yYgNLuE/jecO' '7QD36lnkaLkPkn4r1OK8R2rxEy/0ScKxAy/wS4YqcFygCUk0MqBeoC6HpilIKAOt2vP62eLsaJ' 'jKb4KDrVh3osqiI8/OuRp0uBUgBpTxdC+J58xjxdvezpejLydPWKp+vJyNPVK56uJ5Wn62oGdb' 'vfVI7HfrlyruQ9wEqfoMVxyDcjF2OvHIe0gJIaBAfaFvdbcKD939qBhgi9bykHWoF/Qnf/ztM6' 'VVvE1/SdaKq2iK/pO9FUbRE74DvRVG0RX9N3oqlCjOF3n7Gp2sJT9d1oqrbIVH03mqotMlXfjZ' 'ySfe7/AE1/MS00RWzh/+jgjOEi/wRN/xW99nIFFd4Qj/PR0Q4+jvHhgF9Vt6eLA1LdG8U3kzai' '9C5H10jmbvUJkf81InKfnDP/a7Sq+4TI/4pVvcsCpQBCgeqvJgSWcF+ZZin+p5EUlyJfz+DZps' 'rsfGZlOAcGWGSD04jHaoPSANlkSyiKaBHeJ04jAmkR3idnxwTSIrxPzo4JBBF+LYO63VelL3qg' '0MdL+1Vps477ZGm3gJIaVJCPJd3XpJ/OtdsnjobXxOkDef6atFm7fWIHvyZt1m6fOBoIpNcuon' 'B/If1Mrd0+XruEX6/dPlm7DBqwQEmA9Nrtd1+bprX7Vr12EbRKkAw9/l6Cf3NFNbUUvtq0FJSp' '+IwvCPWdZ/q836rsJ5PfLzLl4Wjy+0WmPBwtjn6RKQ9Hi6NfZMrD0eLol0OCh6PF0S+HBA+rxV' 'EQUMJ95Gll4X5Z4o/ER4G6ao9ELNwvS/yRiIX7ZYk/ErEwopzf8oyxcD+z8FsiFu4XFn5LxML9' 'wsJviVjYdd8OFv51zcKIU357muPrvpji32DhR9Ocp2IFq0S5888g/8pHnmnm1albeecwLVJY50' 'c9VbLNFMU55OlqOEcO63Jv0RUvSo3eG3pGkS7MjCHqYLFOey0O4clIvBeVemqV2hK4je9Kq5GB' 'JpZraF3IVSPLnNi2cgHxfRxG4KF+EWfi6VLFyvnDOWVchHyBM9jQrBQUy+K+0Wd9M+JIAqJjqj' 'iKsLcri/TRiL1dWaSPRovUlUX6aLRIXVmkj6ZNNo4ri5RAOhvHlUVKIGTjFASUcD/wtC5SVxbp' 'B+KjwCL9QLRIXVmkH4gWqSuL9APRIkXo/mPP2CJ1eZE+Fi1SVxbpY9EidWWRPhYt0gH3w1ikn9' 'OLFMHzH8YivcL58xT/xiL9uFqkX7QjytjF9gwHlOEbz3w8meSc//9thQ7ICv14xNsDskI/Hq3Q' 'AVmhH49W6ICs0I9HK3RAVujHoxU6ICv042qFfjvBMBy2/x4++L+n3VQ8RFF8tqVgRJVxGGHH+T' '7UPoAnleb45NzcDNZ0xa8WgyHFGKVgZbUGr9kw19SrKnfXXaotMrxLnJPb7BmLvKEnJubAOAuq' 'ygJ9ydEsoUKgZ85az6PPGeesPnFoOpibmZ6dM4RW4QQ07i53O5/bKxCW1qfSbod7FZ/RGCCutk' 'mbO7UicBJgVKYdssAJ99Nou2Nwmwp5Qlqh6aUTw5DQjbc2gZMAX0nfe44FTrq/z20H99pUVgVF' 'dcVELkyjpiuMfwsd4/f7msCMFnGJWWGShPsHYIj/nJbaGgMic/8gzpeQuX+QNhV2B2Q8BLpKoj' 'sGROYSSBddGRDbh5B3So7jgNg+/xm9uI53jgHu1mee1p1jQCyUz8RHAQvlM9HOMSCU+ky0cwyI' 'hfKZaOdAktNnn7GdY4B3js9GO8eA7ByfjXaOAdk5Pqt2jl/A1pB1/wxbxzdo68h9P+mNGrevOb' 'KHmPKNPyGiqjngMUSU5FcViI9jel9VGNBDktKJ6pYGXZjAhPEdPTojBShVTSm7+HutVtEFdEMR' 'tnyuxzUb0cFx64IRzkUN87HE/aYulKuxK0nUG6oon5xxqP5FaI8eFRT7hpSMIkzqDp6mZmO11Y' '252r6hITnc5OI8vMzO2jUvTWFMXVVT1YNDatefpfk2g88l+TfK9n8JbPN/Qdb+torssQtexEpp' 'RkeKXC1V6vqYuVRVqZek2AbOh0q1xogukVXS8fXlcD4q6FNWV9x45cVF620bZdWqp+ntKwXEFL' 'pkj7oGDRMW4wSErYXNwaKoLzFBMzD8Eu+Fg4u12uCwitF50TD9XvDr+QX/IYKhMwx68dqDpon3' 'MqtHjofX8/vknaE8WsqKzkpJfyKpI1dhZk1J/7+EqBtkUWeAtPoZ3NsETgO8RYRwBE4AvM3d3Q' 'ROAYzqx/YHE+6XgXlPrC2E5pdbPwin0ZfVUo6DGQnS3uLgFMAoiNfPYIzur8BFu4UKamR/Fcm1' 'rHhN/wpybasFSgC0TaRKVkZDIIR48EWHWR7KV4BqLy46nIufc7fn0GHM/voycR3WB0fbsLJZOx' '9AlNQdbFeq9jHXmfVDr7RWVwFacmQ3ITlKcvWhEgsSPyw3KUZDA1m/Eh8tSPqVtAloyQo5v5I2' 'WbhZISWBrqd9TZMy6T4BTEOmDbaIJ+LI+SgljhxUegLIr7NAKYBQJEgjT7lfBaZ9pg0O2b4aR4' '5Dtq+mTSSlAiUAGpBkeAViXKhTr5F3uH8HTFGbDg1yLFAaILvnOGH6u7RJrlSgFEA2h6Xdr6VN' 'tXAGIG8mjjytWtk9x0HQ19Dz3RYoBZCuFp7lDffrwHSDacPnM3HkKN/z9XjP+XwGPb/WAqUAQs' 'H5L4J9t7rfwg747U7aAR/wJqpFfzWUes3lqspik4zHNQl11zcMqphZqSiIyAAJYkM990rQVM7d' 'W/etYk1kqJx7OitkR73hmDR0XG0oyIv9lvLXvHKAf0MUvKPTRfn6b7m04Z+uSW3gclRs3PdWy4' 'GKz4ijpSexapEYMBK36iR6V2tVFTnq2+fbUaVuk7hlUbUcSnFauUMqutSKfkyOT/BliSW5YTDA' 'EWw8QzWqkiAlG8srZfoqcNUq5j4wqRI7TJYBbr6SfEI1BJORsmluI2gr9fHokU4veZnjnQ44Db' 'NWO49C0VxXPArdjsbN2C+G6n7JVbn/fvMP/nf//Xjoy8OFIv9DtPAWPW9puezAHjUVsk2ZLuqP' 'mk+VthOukobpcUkuL/6fvV963gv94fIQ/ePdNOwdHPYO0/97L+J2EOfry7VK68Dy8uJC04vD3k' '14Fy9W/IWgQuafjH5IvVIcLrW8crN+RV3Hqsgk7YPhxZb2h3R7VU+Z6CmNl4aXWxofMY1VKeJ9' 'h4b09UMg0wgtA002iXMx1yyYGGkJmmqQXb8o18VKTAgXzfRsplcXYkoh7nJjyMpZXNNBaapqI6' 'e10DKT8OdQ1aj3PHgZVLhVUC1WahLpYmKfVSKj0sUQB2UzOUeDNsr1qJIzh0YXz3v7VmthWF6o' 'mIr17DrR4UyRDmdV11dqLFdXVkm4EhZkyLWOOuWKv5hq5hhxMDJfBg0V2aVigoW5zlhVUSuPaT' 'ij+2KYOLJSTRIovqUJqqKBQx0OrKhj0c++NYiv71yts5mPD6tC8mb4XCRP7uzwVmohe21qCxfK' 'tbVQE1ffnKvGVhoUuvpLCBXT5bh1BXe7+Lg9DfG7jXBDMarOyuUGVnnzNqOOs+reUC1vHdimUq' '24prZwFSJ/lAoubRWvqB4Ju1jjCXBH6WK8nqdNQG3TqQBEYFkIaCtkNhJdr5kyKv08XPbrylRq' 'Ko+vA9VUWW9+hwd5SsVTqbgwv92I7WGGtRVd3bipJTAbQxUhrJ6+FoxRwAik3vptFpE3uFSvra' '0OinnOQpLv5PaVhMLIrNsOzMqMXVMVFQeOOBqIog2zrG4IbWjBpyLxgVTqWpbrbCGTkmsCZs0d' 'V0SosajonLqHjZN0RNu2lpHoxbR3L/gLKkCWBl9eqrKjkevjsx+WPlnT5YEsR4mqIIRk7mGo4p' 'wRogLLEUpnvlJUpe08daVVEYF5UcVgThUSlXyrGCCsiNigToC0AbJVDBACbZOA8q1igBAIN9Vk' 'GQQb+ZeB6VudEj2+Vcw8gsLM+9kuA4P685udZF8N557qtC9YkYseUK9ceHkzLU5XIZBr6xxDAL' '7jwUpmEc+15YeWCyyVxJNyjRyy6CsRCjVS5fzjrvC2PdC1qSCupBaouCwjPYvXuLXCkQVC6Fkj' '4J3xCO+Mt/A26kSC+6iSz5Ugr+s5YJL3HaEN9cABfk9n1uZ5VPtuGTL6BDUAStMA+/K+6DE3OB' 'SFf+rF3WaIsY+rqhY2CW/iXpp9uZk+sZfv8G5COHG1pZnqfyvyw3Hk7S5m8nQ68GFB3fb2JlZL' 'WtAfaqsMcltJL44khqoSwWwRXbVt9t1adEOqeG0mF6HbSjSXYqKKj9hRxYwtk4+ZN6zRtHnHFb' '5oB9hn6sIaye/o5aJ0PS3MOH9Jn5+ulIu1Sq06JOkNWy3nCq/F3iZwGmB9ReFWy7lC4K3iUd9q' 'OVcIDI96HJwB+Cr3Rmd7HEz2Oz3Y7e53vpC0niTcTyix8Mmkzlpe5pt3lJcBwd6BuitlrW7Uta' 'Nyw0GFBMKw/E1DXVupDuNqzBI/iPTfYSvG2Q/DNRSd4N0d14UbREPD/KrCY671wZmVJKeRgK9F' 'O46aJU6kkxy94gaxQxRFDpyKUxVKc1AFlA8F9dqIOmKBAmOi/HEvCO8261Jjwy8RUx3izECIOD' 'mvKpVDkkQbZX3R9ZpKxLZnAq6XT7TOMtwvn2id5YSaiOZZhhvmE62zjGOBT7TOcoJn+RNqlt/f' 'az1Jut9EV4Zyb+g1V33MsomLnXSSTNO4t9RU2rZWga7273M9vQ3YvyuivLOCVI6O81hL4MuqlY' 'yOVpL4CvgFHdKuL6zSi8jWJVDIhot7y57LRwat30WiJ+3EQXGN0znRLFR1kFFqkbnPUV62prfU' 'vm/aq2Pahrjq+WZxY3rwR9GhCunSBJzHRdbo97zpECNAEgk2VH+p7q8uc7dNA2ZM1QFHE2sfTq' 'WgqNEIqipHo1EbUocEKr9Cr7u82mYNbk6c0U5sXCSKCmXNg6lFFIs2aKWbROaJqXIwzRlRy9Er' 'krRkV3263Txc8evnsaLUEcKBA0PKjgv5Qu6ADQ7RMJVerOkwrGkIfmhIgTpmGlz9RHxTDs870S' 'UzGl2rFGYbkis5gzFqURau8kiQ7kaCZCpYZ5ow50oqd5QGztcXqmuq9KU6sc2Kax8ZxwXv52My' 'fJtx4Xp3vE0fwynfBi2B1Y7abn9c8B+ih0duvyjah/RXR6tiCoASLW0uguPFaw8Kjkth0i2tG+' 'XXFmhtEFypHIJgXBaG4RN1N1x9yboeHQyvmQAxE3W/zFk5mkUElfqqp9+3byivK1G0UPGr5xXT' '69Ug6c5Kq2Q0MGHyl+5etLS8w/m2c6Ka3eHdrGZlv3fMZmxDLVYH96v7SHjY3mkZq2bvUJpoJh' 'cFJu/tP3BRzGK20Jv/T3tfAxxXdpWZ121Zree/57bs0bTt8RvNeCzNSC1L9jhjeSaZtiTbPSNL' 'mpZkxzMZpJbUkjsjdYvulj2OMVAENgUMVAJkqzaVLEmgCgjZXdgNhGUh7GQrWUgIWaiFkAopsl' 'QCm2yo/AGbTCXsnu+c+/det/wzCSxszcSx+513373nnvt37vklPBE/Vn0Qm1jykhA9YUZFWZyE' 'S7Hu12MHF0ckaj64OCrRVqP7sWAP4M7g/hg4CTBE/HsccDL4Kmp+MFIWov6vNjcIcf9XmxuEyP' '+raPBwDMx19wS9kQa3BF9DzUORsls0eHsM3AZwvEGoAb6GBvtj4CTAR4NB/ysQqHcG39wKi/X2' 'wINtiM3hKjvtqtwVL5fXabQbV+FYFPX/E6EBIrpFBe06407OZtswZ7Yb/ahery6Wi0YFaXKSmV' 'Z8V3JvbSF0whzmhDk/CaatNZRXH0Xi24iQHfEaqc+p4G7/Oj/ikvmtrRyo9Q3wLMsZyyh9ttVF' 'aMHSDPDPpef5MIpRgoWL+rDytURHh1mjRRTJCMU3307FV3/L3qw71c36W7hZ73VAHkD7VCTpTs' 'VLEwh5P9MMws3626jpJ9rVzbpT3ay/jZt1p/8znoGh0z/Yziz0D7gXa7Y0jp63cRWK2w0nCyRb' '3IuygJkBLQsrxnm2rFZiZEVMxvPTYIUUHu1mkltwG8Ca/7RgD2DNf1pwEmDNf1pwCmDNfzpg4j' 'TpBfjPGeeFF7wJmNyfeW2cQjyfOOeA3McUC9iaUrEegsN+U3MPwWG/qd0sYwtmLDqDQzFwEmBk' 'DP8+B5wI3oyaD2ZW4hjzhUVYj2UI4mhskd7HiDejc1klYeD1b31NHCWvWGHEeoZ9683NPcMW/O' 'bmsQN934yx64qBkwBDYf1Zd7omgxdQ9f7MR72m+apMIG+nZ6H4W9+kZ1yLhLkqVfSzo6rG7rRe' 'rDecSzss/67g5sUZk3pUilYJeaIv3LxpPMZV9gsn2BsjHw6UF5rJhwPlhWby4UB5AeTbFwMzoR' 'C+5N3T/t2SqGOguF4egEkOZqVMyrSvcnjQq4zK5zGg83kMWHsbKd39/oSfLqgKrPAknfa3QHLT' '5YVeT0eBf6e7/PZ1bAG1SlciTBJYP6YP+j6kHxKhrSvJ33QAwjKZ9ON+O20mVO21ri30bufQA1' 'mLY7a59ew5KV3Qn6X3+VvXVzdqxdWuNq5cPaUzfkrHDO3aym/Mc/czfruqJ32Xv+dcfnpmsnBp' 'bnZiempsJH8mPzYavIoQv3uykD+bn8iNj1+am85PnB0fm5vKzcyMFSYCj3rceWZ2ZrYwNnd+dn' 'wmb94kus/4uzXeBX1QtSQakWbxcnl1iQVhRDcmDUMQBW941U/r4ZszJ176YDaeh4UJqayVun42' 'RdVsGzrYiooGm8LuWhw0XPH3mNaspDJ9oEVzqyXd2jtTNNjbhu65+ZgVTD9Grcr19X5KQ9OHmh' 'pRYWOddrzbaMfUeLri7ySW0Sl+eocuz8K/Ke/pnHq5UkUQvyzxvgO0azAGA/KKPqvzKnLMpk85' 'v7/hee9JbDmbm8o/8Z5xvyPYRTzVmxOB538QkcrwlB76D1tC2JvVkJs6HDo6eFIZMofj4yNg28' 'fLi3TRLy2J/J43jdw6eF79pi+8IKG7iM0/GvawBke96u4lzh5SIJ1E2smpzNpC5HYLOacQLFZh' 'zWsjHas66JJ0SdVQXWDmChKVdR2dQRcjnt4XuTFSuA4PDFy9epXICkSZcqtSrD4wnh8Zm5ge6y' 'dk6YPZCruvG9f2hWs61zHuYqvFqyxtX6mpYIcwOJIwVEh5vdy4ylf0JWT3LRMPGKGSRqxcjxSA' 'DqwSduemw/x0d3g6N52f7vPDi/mZc5OzM+HFXKGQm5jJj02Hk4VwZHJiND+Tn5ygpzNhbuJS+G' 'R+YrRPu/KXnoeUqc7mz2zxu+SE4dbNG0cXnazIRIRcgRKIL/4c8aeusk1XiGficFhKIdPUIwSY' 'AG+ym+bPHvoJBm8P/X7QR2qevfTrEAqkDqnfgO6jX69j6Db1G9C76Fc3Q331G9Au+pVlqP6NX3' 'fTryMM9dRvQDOmhvvNb/BSrwpCmuavT7UTboeI9zyZmQITbdeGsBJL5mJRDPXStMw7MuHR8D7T' 'tD09+8yzhOB21E50OBC0E8MjT1u5tXvUk0dPh+hOI08IJns8eIQx7CYMHyAMv5/zLh2mb0Yztd' 'vG0G5/VgceVQiabOmn0AfbBbsX2T7A7Lub+tCtnrYwPvrdVnraRjdPeQKuvcGj6gmZJV4bjHCP' 'eqhHfdSj76E3ieAhquFopvAyehQneiuMwVL2EMaH1dNWbu+QevLoKVQYg0N7iP434P9kmILPwd' 's9wvN/eXSv/PYhSEPZHyBiybvs4qWCQYXN2Oh+RfuhL5E9aokigThHPUK1vskR7hKFqsK2qBX6' 'yukNgazLK71ikmTuo3VRmuvmoKGmDW6t2Kcuxg7WfSaroWJ09IZpSrHOx8rqhv1oUN2Z6jrtFi' 'aY7sBAmKeptaiwiASTXhaJoK1asMo6345K0u96M6JGuSvR3gnL64oINwauIxvcDbceyD+f3Fig' '/pQaHM9HalL6LlUHIXedjsWQ1e9NtSg79B7nqNbV9BIv7IQPBnrDYff6xkJ9YyFrz1xOBs706b' 'aFmYm0E2nYrSjUg4DaJCN7feC6+nVjoIGqCMD/3uiOfgfBwZzCZHG1urGkkV0rVhAyKo7XlNTa' 'qhZGkTj+WnGRMWyBi/PZDf3zholyLIGCWyyGS8W1VTVnRQrHJm1iGMcfm4GS0M39d0DbOGENhv' '0vl6rfFaLeCU3pWK6ulZBWlMPmKFKIeY61HpLOYCobFZojor0mEe5XoZORM9n5sqZkj5st5vHq' 'Siw49h2vgtXqygqMpmOU0TV/d1YCNUKP9Pc/vVVw+/1arq7C1GXguvz4LvbqDFd4W52KI/GddY' 'lY6GJFeU5Sne7jd7F7k061t9XJm6H1nXV4ocyBzXKLi9WNCqaGAswVBXKbvVZfxTt6OlL7bXX1' 'lgj9Q+3c8a3b7N1HbrEjHNFYbLqB32oH/6e3G/T/M1rm/f/frN/+f+YLU1wIlldLz5chVogxrR' 'GG3JhLalWSNCvhlZQneOQjZU0OOyPFBkgy9+pqefFaWIIXlTUsbM0cTF9GDd8BZ1BeqBVr1+K0' '5GpfBltQv8xu7wPX8WP5u7/0X8Zp8N1FqWl5/2Pt1zcZpzvcrP+hx+gfri1NfNa6QkTzdi9IBR' 'l/hR8hIninFySCX/KCZGY6zBnRQNkmVhDBPvsGYFmzUXI/hoEtFSETMKFjzTJV3VEa1leptqmp' '9mAnu/ELiD2rPEQCyHTyDOjeqNRLjW4TS22vWxR2zZ6JD2DBCYChZ/wBB+wFP4ey3Zk3qGwvCj' 'OtHlyFk8SSUiSJxAAShNXiRoUtHGBfuLF4uU8khG5ud3VvUcEpEB88hB6rFkPX0ygcjIETAMNT' '7394DjwR/CIXznzMiyKMrc7BUrTvLJeeyofVqxWRjLKCXGwO2dbcVziFPdpqhlVsCPYu0Vw31a' 'WIJGW9hmi1DZ0Jns2nFkpsemui0FYhwLbWNE03u2xvlCIYFO5kVwzMfYey8ctJMy1+DdMynflM' 'MkoNiQ2P6NoqfmxcnOIbeQqfXTcGrhs1Cr6dE+EIVzrf/GZe1+vbBHcgB0Mh0tfpPFT+DicKuT' 'luwnmsF8QciJ+2G4vPlRrzarOLOPw2YyJNipOaKiLoKDF4GeHvB57J9T9d7H/js8/QX/TzaP/J' 'Zx8aYPooXanYyEp6uEq4sb6OcAEIkLJ4uYgzvVSTCa6K4/I9VazTWufsyD2z+MBkS+4Vuq0Vny' '+vbawZA/1l39ZWl6iJKkhMYzMq03wcPHrUbA9iW8BDnnJAHkAdKpWltikgEMK4/26bWegf9Ti9' '16+3GdfOrJo0q5InKspymOUeM3thKZ8u6quZhnpGJ6Z14mOda2ZjdTVWqxAQrMyC0T5QzZIFVa' 'f4Yv9+aT0+vJLiyaR1WC2vKGcfFdKlrATdUk4ffjOlNYQZglnZtIozcD3sHug2TzdCdcZqwGPh' 'eJ6WeW48/L7wQrFWZs2PKmOeHwu7r3ebgt03usNTTVaOOLVuWw7VuuhzlerV1dLSSul0Ebqq6+' 'Z5DubVzEnOqHgXypsHdgU1eJ058n9tP5AfrdvkKJZhrMjRdLlcIm5g8fI1Xh0IGcibJhvJFBt9' 'iMvdtIGJBbnO2+1bcxqDkfKlZBtW3cPuXsc1AEg5+RhlWnHaYG0JYNcAdBE8l11QG0DaQVufKw' 'RKq5i/2hCFQMjB9WOeOU/+AFV1Za7FVoXKEVmJiaaVroJjx8fl1hXGXOVKyS+HVcmO0meDTSnL' 'fPFH7kb5bqdjMD75g+jixrr9AyzuPQ4oCRDi8Xxii4Ilgz/Hd/syv70l1o3b5kpaMSXxq8HAAN' 'eZr2DhNsyi0jcGh2dg27g67aNVTppitwtVjcSFFTM653qnD1WeIOwSFWEc+GvdWhyLl39TWVpd' 'j59Bscod7lJzoBZy82t0OVoTvVeQuYYC3WhRe8t94M6qUoYmw5uzMC3uF3qSJVNbZUp1OCAPIN' '9ZY0mZeJ3BXv8dCQXbEnwe33VmfkzlimKzFtkANurWKjyyavokpyCN9xHd7yOSy7vhBKU50kyT' 'I3qbcvacCtsPqFk9L+3P+9aj8rlH6uFIYZRPH58NA+rDAwPPGfVRtlwdWKrS3two1p+rD0iU9n' '77vh+2FRJUqd/cquKAfsfVecDSFQawn48ucRi/fh5LfJcDSgKUplX/Lb1RtQVflCX+RWF8W3ZW' 'M2Pz/097G06rwTRbfTOXc/M737xWsWqKtOn+pxyQB1CHMx85vIfMx+eYrl/2lG1L5plw1CgkxS' 'b0ZhpoHUtB58pr2KMK/k58p3BOJlwaPWkOprqcz1jyCX1T2PM/85rZ89DkW9E6Y+2ga+2Ebyae' '2ViwV1CzpynEmamA20P4TKtt0NplvXzV5o1no7uGp7jTb9pR0kmSvmm5U09xp98U7vQLiZTOjv' 'QvEnwMfzLRglKsfWcLMzia6XSkm9HPdwnohkdA9I9lq6PXuTvmRVww7wy3bwRuJqLH884xZgwA' 'ImNjtGq08Sppd7lUL5S+d6NEPKyishogJb97LBy8oxGydne3rXq7oYKKGPKDV2JipxwQ019zGZ' '7ilQhEXMbCVsl6539t0D8UN75k5WWDiKAsNXfFLOK6T/kdM7oMzC3rpUVEc2GDwmRBP6Y7/TZE' 'FK+zOWFbQR5O/4jn73Hs4XSlp3eaKrVV3FCzVZzFEe7kzERXLL7rC2wGlzw7dfq9iXvEuC07pe' '34LpZWV5/EB7BorD/xlQG/I7iHtpKf8gLP//3tqe38lB56cbuJoKnDZxIPb2J+LhUbRXGap4tf' 'ZUVfv/2Ibd3RR7RtXb6yiHwxuDPhXd1EEs3ajXupdKW0Wl3HXVp1GWOuMzb1LwgSA2ycYgzMOM' 'RCZUlblKhJDAjdlyCiAF7am48WiDIf8pG8EtZhmjcDm29y/mmG365DGyoGgyqngbirrZUaev96' 'MIZYPR4LiG98tVJDZ2QSb+VFTTEf8gWOzcxc9SpVJf5/tkVl4WLRofYWV4s09JqHbEYCNyZLC4' '2EisVn8fAtIt8RHjo8XyzqEH0yAGsjthJaA9NbLq5at0BjBulYF+pwOejUhLIvcpkmd25VqvZd' 'XTl9+KxT4KqqtboOMcKcGufqXKqyJIzjEq7B81do0kC0glr5ivIZVA7f2vrRGKAZ+8L1GtITwk' 'yygYQ/xrSQL/3n8tPh9OSZmYu5wlhIv6cKkxfyo2Oj4elL9HIsHJmcukRM7LmZ8Nzk+OhYYTrM' 'TYzCDnKmkD89OzNZmPaN7STewCZy7HVThbFpNpjMn58az1Nt1oyyL8xPjIzPjhI73BdSDUg97d' 'NF/jxd5UfDmck+brb5Oxhcnh8rjJyjx9zpPN38L3GDZ/IzE2jszGQB3rRTucJMfmR2PFcIp2YL' 'U5PTYyF6NpqfHhnP5c+PjRLXOkFthmMXxiZmwulzxJxHO+qHkxcnxgrK3NN0Mzw9RljmTo+PoS' 'nu52i+MDYygw7ZXyNEPEJwnO7ibBpOv4geY9SdXOFSn6p0euypWSpFL8PR3PncWepdz62oQgMz' 'MlsYOw+siRTTs6enZ/IzszNj4dnJyVEm9vRY4UJ+ZGz6VDg+Oc0Em50eI0RGczM5bprqIHLRe/' 'p9epZuJCBcfoIuJIXZKZi19tIoXyTKEJY5+naUKTw5gd5iroxNFi6hWtCBR6AvvHhujOAFEJWp' 'lQMZkCV0ZMYtRg0SEalLtp/hxNjZ8fzZsYmRMbyeRDUX89NjvTRgedyWUCfIfDFHjc5yrzFQhJ' 'cvv52p28fjGebPhLnRC3lgrkrTDJjOq+nCZBs5p2ieFaPZkE6TLjZdhQnoKTZdPax+A3qfYz57' 'nzGfvZ9+5ZX5rPwG9DBMLpVJrPwG9AH6NaDMZ+U3fh1xTG2PGFNbGG3eq8xn5fdnD7IO5M2eOg' 'MznzhI09ycwlHPdsmJiv2N3nNEEpVgVGflY/gbObqixNVZ5Sx4iJdT63NS8rL56oZ8pxgFCWMD' 'Gao5OvQLnAzgGvhZgrrK7qiEYxviYm2kncoFbr2Ku0ojnJ0ZCdfKSxXe2jlnarGygfNgsC8cPP' 'nqo316x6b9b5XuXLSnna2VVqq0Q1cM9kosKaGKlFlmi1ILxcXnaJuUoHbX4KdPxGBHfKQnLFc2' 'GsqV+sRR0z/E8s7Cx3XddplKdNfXSgiB1B2yJ08RxxK8ftd9VSxssKiS8+JxekUOVK0D+aiTXW' 'KGF8Nnho73X0YYCjj7woGea3+25+bcB8ZzgEv2ahlujdkdmPRDI3L06NHBfv4zc/ToMP95Gl0/' 'Sf/1Dw71HxucGTo2/PBJ+pM9qf97Ohuevsa6MjqdFhsmnhEuY6gdCcRpstQ3auoqdbXEUY9Vql' '4ZX+XR/kzhzIgfHjt27KTtC1wByqXGMjOLteVF/B8lso3nG71g3UpOZtbwPiPWtWx/ODgMd+91' 'Gi5nLXCDtOLzrwvnQZme3vmsFkObQoYPVZcoy0fXS405NcA9/PnE7Ph4b2/Lcjzfe472OlLncO' 'hWOK0gEehaqbq8VLzm4CYJ5rmBK0jue0W1GCn+QONKX8gInXq5XbqSbVzB0816JIWIB1kkpmaQ' 'Zk+kh8c27eHFcuXYUDh/ttSYZodHvM7V4fkzEx2IM/nxsRk6iMPlhkJjs28eWG5oTGfpkDpxnB' 'BGpLXHwp6eHoH0LjeyS1fP0cYxSpMGX/WGjz4aHhvqDb8v5Hfj1av61SkrSs0B36Xq1TpXqXQ9' 'zh5Gl1ddQHapwRPNy8jUhs8HTxw/fvzVx04ctduGioAxWyk/r2uhzSxeS/blDWaP9J9IIUQZ4M' 'HCf710DXLQucUMRj0gl67nsFMPT4DeyAQ4vukEQN7jcF4GMqtCe6DIeRjf1J0JwJkR1hgKndCm' 'H9xkmtN3BpqtlK6eRsjwUq2nFx2bVhRSTQhheq2gBWUmpO+0F6PnqqR0XXWbKdCb5WDkjIulwc' 'O3oEG+gqBqjSxdYp1uKyidEVcJ/UiZm/bUIn7rLlNtWdo0xjDZBNbT6/Q82ntVGA89m/T0xKY9' '1bFbFJ8RTl2jS0dF97XlQPX0xmchLfwRO+70Hnv9E9PEb56XjHYEyFcEItd3sc9y6MTuCvUo46' 'LkPFqthgPojs4faSprM7xyNdaTofs6+IYb/dfX6PZ2mf6l7fnGzHUc3jeGrxMPQX/TMr3xTPY6' '2CUs2RvPPt3tq8Bu8jXrpCQilVKXw1etLmFkiQtYKq8gLIAkHlYt9YXcFHH00hg9ozXR3HCTNv' 'rTumhvcGxfreraoHdUKjbFx4H/U1uKVuziIF+phhvrzCboTyU4qgAHW3N7CKKP9qsRLVj308Qf' 'bSxDNV123FVKPA+YE+3pJgawu/dUBOoLwyhegIgPIZIwmQx1vpwjpLi2ClCkhJQF3GRPsW5agw' '+hDzR6JaIoXYcrRgAZm0oSANJtSqeb0H7d1EXwdOBwFln+z/Ej0Sa+VTF6VB/qTXhwrFX2FO9t' 'imPcPXR08NU4HQYfnjk6OHzs6PDgw9mjg0Q+md10yODZHC/iXM4luf1qxfLND/fBc/TVWbWATE' 'r6PgmY5LBqxXCUFZHsqC9cnonPYPPZIOpREfzzEq2nRjU/PTnNi6yntwWDml2rvpF21CKvrlKl' 'f3ZatBwXSwsDFpUB47w3cHa1ulBcnZuUlA0DQGjAaaRX533JojOy0/TxOheUwnlwjCB6Vv+Y1x' '1CVyWFM3qrAlI3dZE6NU+7xjJ/6vSIsM6uy86GvgwNKIM9Zruzlxtrq/fxL/1tLwtffDORdSMQ' 'xYRHDl/qP7zWf3hp5vC54cPnhw9PZw8vP32ELhbl50qIHsfXHBDIjhLnoUdtT1SXijxZj9QJVy' 'KNZmrOyGa1pB7pwHm2x3ddbt9AXzL2+NHP94XiepkHREPlFiG4DjTXzf3UDRweGqU/ftjLGZG0' '/6+O5wHLnXVeIHQ9dEKamD1fhVsw9IfrqjH8ezN0OLv9d2m926uCHxd95k96YcFec/UCoCYw75' 'nQNIqLLqvlt+a1wvPKJutmdyO/1eXoabGrQlr3mE0Q49gesQn6cXRkV8Qm6MdFp/g/dd+84K2i' 'n/oT5Laq9FdKK3I3jtywi/omictl6xv2hPrQXDolI6PIK21lLFWtN0wM4orbJletPlTmdHJpp0' 'HCZVlLFOL0UxfJPvV/vyWNoPR4a5RGnnQ/5dhNQenxVtZMGaXHp97l+fdDBXrlGKbsnDjal+v1' 'jdKcTggjqo9tdD5WEWMre+VYRitK8CWrleYWStTlsg5Skdk82kXmVkqW7hdSfrsKM4YADZDm6g' 'AN+J0+6bexZQcrU3YO3ZN1MMvmgfqIhJybRqnTyc/mkgX5It2v4j0k+cu7I1+qJrPQidj4GSp6' 'HYfB6Cjox/QjfocKflWqSYSL05mXcp1+GlquxdrCxgqLDmbpXEPztnD6cX+bJPKZQ785Bsa2oU' 'xTqAVzaAr+vnwDaLrP31WuLNDcWZpTOrmudsaAS+5U71SshvSjfooYvVqVZl5XiouFL+UO+vuj' 'iOZUkQuYnwXzRXrE94nklSUO89XVoeJKtCJbThdTCNvP0mf8bRJ8TGrxuZZDrWsx5aQa98PM33' 'i+bwsglAgiKjjzwzynj9/RHNHTg2ZbnTgenh5bCvwb4UDWSkvlooQDkWnQwRBMlPR9/o7G5Y21' 'hQrVPbdRK6twJ9sNcLZWTt/tp66US1f5vQQ9acczXt3rb6crcGW1Wlzi1zyShW0aRkUyDb/DEB' 'foyIJzut3BkAn0+yE/TReXuWptbqm02ijO8X6jgpjsojeTtVHAeZjT+/2OKtUkZSQGTIoA/LL7' 'YX8Ld3CXvy0agWUbrc7J85CRBx7ejo5NjxTyLNoOEsNTX8yd9/dGJ5dezMdbGf1gLGDqg39vDO' 'iIcgPX1a8b3b9Eo87BVATpQb9NgtZw30/vfynX5e+LtqfiCi8XpCS0ry4d5IEWhs8qHpYRqh3h' 'rsg8GTWv1Zy25VHn+uViXc8Ieeh+206/jWdXy40L+uGNtTVibhQm+tFuack73tJO+VvxY6POmM' 'RXJ3+bneYCTD98myioT9InEO6FjdhuZxczZdNDfhvbnKvt60CLNvGR7CZSNP1qP7W4CKlXrU6z' 'PHnLz9oXF/FQTz/sb+UQyfUuiWtzsMVn4ygg36nC6ZzvW5NRtXXd2+LTEV1IPnc+Sg/722Wxyb' 'Gtdq7oJLFTs7Bt2fyup8/5e9dKtZXS0hyiDs/JkVorLXdtY5LtbcaEmPVCWr7J0ycahpo4+ClV' 'Va3Yiupd2xmdzWpS30xWNKieHvP3MBSOWk49O25Wz279ha0mdoTtvPMj7DU0NkjOIRXsur0KOv' 'gT/p4wYN39NakguE0M5BuuYdrfawZ6zq1r9+3Vtcd8fd5Wet5Py8KK1Ji+vRoD+dSp7kl/Ny+d' 'SG17bq+2XfylU1nWD+xZOsesZ1cn1bVDlbcvR/Au3e378BpQJffakh0AS5n9/lbe9+pd+xBeTN' '4rUOYnPH9ndG2lH2OuSSBq/z70Uu6An2k6L6QM9nD7RWzHTtzZjp2Z9327S2D/5n1CbdDy8B22' 'sOhvc3ZahEBTO7O0oTfd76yRK36H2SPpuN+CDVXR8q5N9u4CF/rO2h0+9cXcI/6eaOVy1N17y2' 'O9+0E/4LJ1GI+NcDB1kEfCqmvyyFN30U+ZrS/rt3ENqoNdL+X2tsShIMXSh/2dpecbcyaGYE0d' 'tDsIaiIV1rp/u83fEeF4Wx7Xo/52zQcj9ppUdfrel3L7/btbc880X4Vptc90enXII869JC+TTc' 'fJlqTTyz3Wdw71RgYqgrx5ksln5tmwn4IOgneNttvbNdrpA94thqj5EoQNwq/elC1QJYnLVSyR' 'cxsRSNNBmrr9g7T7V2kfifYwfcjfn5uCFU1ufG56JjczOz3XxKNOTM7MTY+BRw387RNjY6PTc4' 'WxC/mxi0EivdVPTOSCJG0CgcDo1VOzY9Mz9PEWmgs7FZTqLgDWlt7hd6COufzEmclga3q7nxIE' '6GU7N0CtGUhq+Nkv5p6+6RUrferWvHDR/YDA+vnGg4/7vl2qdA/aNzpWyF/IgQWPEYIQHXvd1H' 'h+JA9KpPwthdnxsSDx4Hl/dxNbmd7r7wY1x2J1+P7W3MhM/sIY1UCEHR0bHwNREqhueip3Pkie' 'Tj8dxIUIT/zvH/A7glTwquDPEHzvzxOp7fyUHvozL2IgOHSUZdgjl2vVtfLGWpjbaFyu1urZTS' 'wFZ+slk9U3kmOvrmK7KSFweHp6tL/euIY8UioOnpK6iLhyGZdkbfSg4uNJhD6Y0DZuZZJIgEq/' 'tG/D7C3Ul/yhKzoQ76qNEqXXm7gmyTizMFuCnxLGkJHSjd3XSXX7QngT9SmjXVk2fU74e5ai27' 'uxMrTxicCdbOSy3USO22Z+I2bdTvrdy789joV4H/9OBAHD/x27OXAAujcEXuZdCVcmWLShxDnQ' '/jXXd04sQOvK7EQ4a9/X4eI5YTMcJ4nwIyo3AhFidn2pKL5XkmHeSJt1WnrMDB+GSVOzM3OTE+' 'OXHLP2OnvVGdG/UEolSLjKmgRJFbdgnbd8nTsZ52EI11Y4fDU4KYXOaH5VMpEhnPYV2pkgaOUM' 'AM83LCBsFFeGw8FBjswmctUulka+1vhTH0C60CCZ6be5+Wwah00qPOn7geMnjRB72/xzETfpe4' 'ItQWfmOFeqk63rURFXxVl2Qlk2ajvlpUWodsa8qFHXrhg0QVDIUB+O+FCHVDLI3IvQcXqEdKMS' '2bGsxtutzFMfbotBYQ62kxo+H3F77uaOnaQmdM2xRNqV0tWIW7p2uWjVNHDubuqdNIPeCU2xHI' '4gTCIN0wlqmFesm62geIvxekSPl0T2PsKBvY8bCMarF37OGSfhonJlMc2oCOSd7lepNv4uDvUI' 'igxfUWiSoHCW+4+eA/aCfqogzPy8p/yHVAJDiYzp7BvKV2+ptMo5hnvYjLqiHnvVcvHDjXUIo+' 'BI7nZEf+XWB+WkiMDrl+kKYvzUfTcPCGfds6sr0iMEXwTye2NQdGlfsD8GTRL0nuCQf9KBJoIB' 'nkyHw2lkqG9FcROZOtY4/JAGmkgPeg4Q6XfFoEmCYjr9a5f0yWCIKshkftSLrXzpvYpw4qR341' 'j6RgsY5nMTuSOIM7hUlox59iRilXqxIqom2nvLKxURlnHhfnEEcH5nn4daKdZFxLAeauoijoMh' 'jnIfhaI3XcHdHItdQ7cExzlEwePcwdlCXsypeWZxxIAyLdUI1Xk997BmGPG5VxGguzeGF1zHjj' 'fhBS+n44RXVwyaJChCBeQdaFtwglfbw1G8aIYzRg02k5RRaMIuhkybqiwO9QgaX4LwyjrBS/C8' 'A90aPMIBLU42IaNFu3eEEFI0P9KEELI0P0II3RWDJgmKSBhvTSiwFzxOG12eNrq/94Q9cRI/KG' 'fWslhSYhjd5FTASkufgT4L8LKcRHepyjF7xLwEXrFwzlCWdhsILGx1AIr1Wi3LGlgqSVw/YgXq' 'Okd0n5OVra65tOLaQnllo7qhOJ6rulHo14hX0jcKxhq5RzUfssmOfdzu2B4TxafB/F4DwY49wq' 'v3WUUlcRdwHQ6KIax4Gv1lDmIqjoKCeR8Ajv0tu9Jppt1NOWcHUXuVjUSGVjuWjUQWpPYtG+EF' '+QueA/aCMxzk5Ke8CNpyaAqBmP7gj6/WJL9ZCdSTl5rX7M7VJbNld5/P8ZUbtibOsNRvk0UZhx' 'Cht6kCW27/eNjP/053x/oKPeWZpr563IFtwcEYNElQREiZdKCJ4Bx9f3fmlDP4eg6bFMGWxzNs' 'KVxKRdgeQwn7xrkmlEDTc4RSZwyaJOhdtBvtZGh78CQtq4lgi1KxtqfemTKgAcO0PcVK6EMmsF' 'GEE7BpwQJH4f0UO7BZiEcQOBlaSJIg8DF8yHBp0/TNE5n94j7rur43N4FDFsX3OBBU0Ekzy0KS' 'BEE0AQtJEeSeIK8Ct0i+uHekqIvTwaHgnP+AYedmqfIgs68182sqxDaJklsdiEcQ8L0WkiQIGM' 'YHTTQAusMHezMZqR3LfNOO4rS7GKElNsOLRMvAgaDGPTTWrzVO3pfom9cHW4h9bzloRb6jbt4s' 'DrNLkWZxkF2iZtMOJEmQvcE+ThkjkBRB7qKGk5yCSMFSP5sKnqYZOmrIvkWT/RkC9/s540P9Pd' 'TmXDCUkUAGbLXBF2XNU9uQAzpahuKeNVJtNCKoZL8D8QhygC6QFpIkyIPBQw4kRc1uDQYNhm0a' 'wzkazKP+swq8NSjiHMqcN2EcjC8yYqnosYTjwhpt3PrCLken2xFhW7krDvY4JYsRsuOELBLZux' 'xIkiDgHSwkRZCDNH/3WohgX6TZftafUuD2YJEqXwoKmdcwfc3eHkGtOZUShxWxEfYdhNsJ4cUI' 'woiMvshe3xaSJAicvi0kRVhsDZ4ys6RdZskSEXvKf0oBU8EyVT2VyYU5uqvrnZCvtjrXCkafsz' 'ArhHVw9UiPHHxTtDSWOTSJhWwlCDZKC/EIspeYcgtJEgQJciwEyN0fTBqSpzTJl4PDwYQ/ocAd' 'wWVqrkxT+lHuhXvVUJeSpTvpQAd14HKkAx3Ugct80FqIR5B9dPBYSJIg9wcPOJAUYeXO+A7dgT' 'LP+L+ho44e6sGrguuBl/m8F56HxEQZDjm3Zs3pILONTXFAU6XMLFVNhFm1DZ43nJx0mCYfi0us' 'DFDuXbxMaIU78pI+3aJErFIc3ZpKjSgXNQ6fRVMD05VlIg2pHjPENoF5rRLAMSItuKtjEIe08W' 'lVD9pox36an3AEbhDND2aeiMgtrHJBubGb03xDyzC4tIuBlWYEum5qDbV3OZAEQbDCH1UQL7hK' 'JXZl+pyQW1c5R60hNGdEr0QkCro+T33vQhIE2RHs9N/pKVAieCMV2ZZ5wQsvmPrpmKj288K3O6' '4MuiSOxTTQ4WDozseDjFwW8EwWwTjsIwfAyaxslJfYZgpl+1m5V8+uLd1Hl+x+akRiIyL4Dd0n' 'G6VaP+qqW4xBgzeqk1ZDgHIH9WqKD6cfhPPbW+H89niYs2HJihEWV8UX0CRqOQsetgEjfhD2Z2' 'n/iZSOF/FDsFF7kxeMZ05I9BTVH50ZXGVwbxWSizGKxmL4oeZYDD+EWAw7I7EYCLSbkOg0oBRA' 'e4DGky4UGyjBtgZP+L9t4za8gDb2ZH454UydZvxKOv+ptqoH6VS8Bc72ToOvDjquYtgPxyZmz8' '/NXJoaEw+Jx16DAj38tteHw+jmL6dnCvKSgPxSaAOvzUL0K80HH6nHwziNQs7f1AL/jgjetPOB' 'NggVI1Bl/zlbGG+FSCQWwwvRQfKEpu4ggdF8QQapX4ESwU/is3OZA+E5FRnNrlrlmJ217YCx4A' '+2OyAPoB10N7agJEC4GFtQCqADdMjvsyDZxwl+MDjDkg+Pv32LTIURYZqU9Sfrt/qNH7gSQmNP' 'ZxNQtfuagGRc3MEc/OlbohQCg/qWKIWS0jootE6gRPA2LNb/g8U6H44qF3vlkV8rwsUIt9SVvh' 'BBb/haulwq4krO1v4I1wHc2apYRaTZZC0PHZPFDGq+TYxJA35sD/4lsP5XHl109ggEdx8LfJaB' 'SR1Z9OcRWTQPFwMRRF7jza5f+9jbSGoxse5m58xuXb3EE/Vp++8xIBNP9N20nDNBNHqcis9pSt' 'IAcNk4mKOMgq+JgpMA4wbYFQGnAL4bDbbF32BfeRf2lQmWqus3KizoE5nQTHFLheg0dzHAzY0/' '3BkDc3276P4WBScBPqCij1pwCmDc5DJRsEz9n/P4Ovc69Y7jdSaCf4MxHN10DCWN/W0cEM7weV' 'I35Ob3GhCG773o4t7Mdh47rtmhg97/3xsdN30GvBfjFsTASYBxxxt0wF7wPhkDu81IL1rT31P0' 'f1+U/npbe1+U/npre1+U/p6i//ui9Pdc+r9P6H9JvUsEvwr6/wboP7Yp/UXrf4cDABr8KgZgr/' '+bnoGpyKtbgn3QIGh5woaJYSiVMzMqVzRkfwUHipiiKlGOFuD5aueGzF8f89bVXHE+otcfLS3r' 'TOBlpyGfh4OTG4tNfFGll1bf9zpDlEiZIKLu1EikTCBRBFGMgjmYKO5XQw7YCz4gU+OgmRqKBq' '3nRkLNjQ9E50ZCzY0PROdGQs2ND0TnRkLNjQ9E50bCnRsfkLnxevUuGfwW5saHMDfObTo3WBam' 'eLrKHUwPrP3f8lhKep8BYXZ8EN38HeKgMtt4fqABhxpJNQwfjA5DUg3DBz3WpkTBSYDTKueqBa' 'fQTIqYsq4oGNvq7+CYzPsnnDde8KKM271m3JzOtx67pBq7F6Njl1Rj92J07JJq7F6Mjl1Sjd2L' '0bFLumP3ooxdlt+BjB8W/5SDraVM+iKyW5cnin7YMgt6Un/Yxh/TE/rDEn/sv3oK5gW/57HM7N' 'c8miMLtXJpWYtDY2taUkQjxqVSAmiPT1Cxf7m4KExhg7XiM5Ojkz36qjJ84uQjj/QOi74jL9n0' '6qYVlYFVfC3RHoJEIAMrIpFx0KMsE2H1ihJZIZgQcaLFyuI1hwTgKH8vSgJPegeJngUlAcJ2/6' 'ACJYKPeSwfvbtZPhqnM9hJLr3HAXkAdapwqwJKAoQ5YEEpgDD++yxIxv5jMvbHFDwZfBwtnM50' 'C3uifH1b7bMWMYSt5M92OCAPoJ3UVQviysGkWFAKoLuDnEEsqRH7OFjixxVvAtnnJ9DCH9FaoD' 'Wk1zYNXDVcVJYbrVCDxPMT0YHBrfITNoKhgJIAdSq1hoBSAO1Di0kXigX+3zyWe+5zoIzzH3os' '+FxV8LbgjyV45DMWYauWkgDBVv3tzHYWO3BxHUi8GK6VTDxrlDQMsukEZKTc3jYH5AG03ekqpK' 'R/LF3NK9DW4JP4rDvzSJizkeRZoUZILpbKVziyerVhgpLV4zIJXftWGqdP2iDBAuL6tzkzAdJP' 'Au11pijEn5+UwPMDCtQefAo13Zu5J2QD2XrYSmThNN5OjX8q2ng7Nf4pz6RJF5AH0L7ggANKAn' 'QoCP1TCpQKPo2aejMPhiM2wLMjnGySpjqIQBz56SgikEd+Gojc7YA8gDLB/Q4oCdCRoIctBwDq' 'CD6DmnoyPSLAEU7KFX5sOhgQKn4migakip+J0gNixc+AHt0OKAnQ4eCI/x69VfvBZ1HVA5m3eE' 'gkGZERinMAwttUNRPEkZgbEelZvaR8+BX3xLEWazKcNnf2IpYEnYVqPa/XyrxPq2NomaMp15jN' '2mArrbrTYZ9699loh33q3WfR4dABJQG6Lzjsn1agbcFf4LOBzKC+RKsMA1rVzDlxSzbvBAe3jF' 'J7G1H7L6KNbyN8/sJjzbwFeQB1Br0OKAlQX5D1zyjQ9uBzqKk/87DGBx0XH33bOIiqvSAcDB2c' 'thNOn4vitJ1w+lwUp+2E0+eA0xEHlATowaBPcTGJ1I7gL1HTX3nBkDoclB5HLwkwMcoTZ8nBYQ' 'c1yF/ud0AeQAecBndQg38pDVpQCq1BmL3PgmSj/SuPpdmPK/jO4Ato4YvATYSprHTH5qUDVUTx' 'ZJcNF8udhOUXoljuJCy/ACwfcEBJgHqDhxxQCu26WO7UWH5RsNSzbFfwJbTw18AyeztYShzICJ' '67CM8vRfHcRXh+KUrNXYTnl6LU3EV4/nUUz10az78WPJ9Q8AARdRPBV4DnidZ4Fh2hgGVhW+Ab' 'EL5fjuIbSMjeA4SJBSUBOh6ccEApYODiG2h8vyL46vNrd/A1tPB14Pvw5nRVPMxN0d1N6H4tiu' '5uQvdrQDfrgJIADQbHHFAKCLjo7tbofl3QvaDg6eBv0cLfAd3Tm6MryVPE4jMSEXSz4y9NuP9t' 'FPc04f63wL3fASUBOhoMOaAUsHFxT2vc/05wP6vge4JvoIUn1bwwOTaitnYt5NBxZPcQc/SNKF' '+2h5D9Bviyux1QEqADwT0OKAXQIbp57bMgQfYbYCDyZr11Bi+hhTHa1aPICmsD1pGFoXAcqm3C' 'P3YSni9F8ewkPF+yyQEElARon8PadhKeL4G1tWxip8bzJZz6I/5P6bN1b/BtNPH3NKUy3x9OsZ' '+SKDnWa1UEBo8yHixLxZ7fE9Hf9qqE45voaFTQctbOcFX9Wk9c7y9WlvpXcJjajtP9UbByQW0A' 'bXO4yb1Ei2/jetzlgJIA7VdmMwJKAXQPenjUkGOvJsffY+4N+MvMrr4pEbwq+AnEDr/A4peSst' 'Eyekk2ADI6VCPQKVfCnmJ5PbtUujIwNHiid3NLqx1oR1pqC/b5T/Ejbr0/IrGwH49oAyXX000U' 'gXJli+gAd+sqqRWudI8DSgAEs7yHFchDqHS6O2XulzQPupcjjuLeMUrVNXn6w5QDSgC0LdhO7G' 'Ob0lj8KMrsJPaxZeXI37RQKlW00azTADDjjzscENe3nS568wqUDF5IsIZx8hYNLK8WV1ZU6qr1' '4hqu6cXnhNNaLEmcSpjFKzcOBw9cJbmNrQ4oARC0hNN8eXsrZs3PYNaMhNMqvY14BsB3izXxFe' '3fwCZiML3cTLkgugU0S9WmaGoP8yOmyE8nOChJbyjOYia5ztWKFh6qFi+X2C5ZFo8WO/20jf+t' 'RU4/nTApCLS4iUAQN/0OdoctwdvRs/egZ/8WkVB05hazHHhxwBwOlob0j/Jm4D1CRJrntTOTH+' 'YaCFIJC7kKSxnmuY551tDMRz3U5sPzs9MzygKA4zNdE8jE5AwHPvLVu82ldaAiLttvBxUDf4Qf' 'QcV3gA7vhNRjoFnCZHvW3AUh5xZFzndYcm5R5HxHwiiotihyEggKKgtKoemtdE50WhAu9QRtD8' '75/8lTYC94Nxo4kPklj6M16djw2HkRarSGW7LMKTEzDBcGBoeOHWfFVjFcKlZWkHrShsX31cDB' 'wPEIh3UqN0pHjMwzKrV69dBRSK10xrRYxGr601y/vgox8kSfd0fp40mPOpTqUUBJgKB6fBu63R' 'b8QkJ5RmV+2NtEhecYj6rj6btx8GzmeYJJhHPhFzCJxBimLdUe/CL69su0g7Oar03UfBb4fu5N' 'Ch4vvwLgf0kEyczPeuFUFWbNZbbv4rNFqSU0Rq7yQPxvhGtky19EGCM2jKndQMydBp/SEcFI9m' 'aUYOMxIsOmnd2tsaYO/wqm417aZzUIK+ffJ4Itwf2ZJyNHlBkOwfVWh9VGPXpa7XVboIa5jUMx' 'cAJgmEo97oC94P0JdsF5iMim68aGf63UkE3fmK9ohGLtebqObTFwAmBYVz7lgBPBrydY//aozi' '+BfQIBdnHzZGt6VsQ0jBEcdkuRrcHZRCm53ZbQCa40iIG5LUhqXQSSwW8wshoBQ3nlPOLE+nWu' '6TdFAMcMV7o1Bk4AjBPujAPeEvxmgu2MhaU1LGGNjptrRopo+04bjhAm1iq2Za6pMwZOAAwR7V' 'kH3Bb8FsrelRly7AtRvWGfJdsUGhKJiSMfcevHQuaq0jFwAmDYnJ5ywFuDD3LZzAOxZkFm2RXL' 'FYklJmIPt07IGPnzHTFwAmBoIc474PbgP6Ps7swjrXqoHpdue1AhY+QKt8fACYB30WT7HgecCj' '4k0zrfqnEbQzAq+WFnJY3YTbGBoPFDzXMcjpkfkjl+mMHYYD6SYM1PZzQdjHIP2K2L0Yz4iD1c' '2tTG8ZGEUfi0qcP3I0LqUwrkBb+Lzz6aoIvOkeYmtH7B8Vt3WsWR9rvRVj2psUOJM9vUkUYg+C' 'J0GlAKoAzaPepCcer/HniB83wp0VC+lHw0wZeSRxU8Efw+mv44jH96jDS/biJCrtQQ4LXhbgoO' '6li4/L0LagNIX6ba1F70+2D+9jugJEBwJes0oBRAIXA560LRm48D6zMss2vjjz8hLMzhm2hzWu' 'ALhQ5/GTggD6DdinsQENcP7uFhBdoS/CE++yMM8L1WSDgvLc6z2GUVDCgzjqamLdQef7jfAXkA' 'HVDScQElAYJ0vNOAUgD1osWjZhCNPuaPZBBfo+BtwX9HI38C7B6M6pAcEYyyutQ4O2i26RpSDs' 'gDSPPwAkoClFb+WAJKAdSJpo+6UIzZH8uY7XOgjPyfCPJTCr41+FM0/Skg/6hYKWKtR4awhVqi' 'WUhgEIVZ+p9Gu4Nd808tDy2gJEDaVlFAKYD2ABlLdWOd/ilBfETB24NPo5EjdHrYWArKTG3ejW' 'Qxj7shdadcU4maHFyh2/l0dAVBt/PphNFltKl999MJo8sQUBKgw8EDJrjgex/zw3iwPwkDsVas' 'P7dZSqV7/Q5G/zyV4TBbxcZlhFBJcpgtPGyeOMl8eKeJkxgtYHVHiZNePKUSJ/3NK4mTXkmc9E' 'ripFcSJ72SOOmVxEn/yImTdDKk+0wypPudZEj3m2RIh51kSIdNMqQHnGRI8lsnTtKpl46Y1Es9' 'Tpom+f3+Phb9fNVTZ2Dm5/rCeXMIz0cTJ7GMgvb0a2sL1VVtK8/p0OmIWbZh2vWJwG+Gw+7lbL' 'E7DlnILiEv+DkEa5lfjjVkksPWq7TX1ap0gVPu7oRdUUlhF3TO3LrecrVLvIkMRBWL2/n80ryp' '1o0b5Fs3epTOLnAmCu5/CGbCccuC7QXvefDmqm8sKGK4QWuc+Pd0zG3YSEYrKLvOcb6r7HWuFa' 'oq2r0YaNgi2RgOq/WqTvSp7Fk47D6HvGf1Vr1UombpMOqVXEDy9Xn+GoknxAQKhxe9vggHazfV' 'MccwUI6b2iZX+AJteuXm0PbR+34n/IA4LEln+FI6lee45/DoVtEy4JFWNxF+inQ2qfPDIsEcZT' 'TYvxLF4Y21OC5dKVc3qAJVKixHrJ1aYFysq4PaJLxftglLi+FwODSknxbcXLNL9GrQPj6Pkia5' 'rP5xDYWO+S7wjRxXRt/ZIXZkVz1IITQ1zOHpeJco2jzfd41n7BtpMxMOX6nhlaMfpp1Sayupps' 'xwJaUEnSR9MEbUD+moXt9o9A77L7/rN0waXToAaZmWnEzAWroC8sL58HnO9qC4Rr6+rlfrZW0N' 'VPRlA1CeVJx4AVPO7Dc6IYGqVu0IrJSKriGVbsSuKZkCovBZXdXE5MwSsRaWnQLEfReXlPxVz8' 'de7aWptKmqpzwJYeqqxJeQ5hdrZZriaPqaGhMoLtb7V8HKN01ETswA+3pZZ8TDzLTslNOe7tVS' 'mS7cDdOKqVqC85Tj1fqKaY1UrJdRvVGiPjv0YrcmyM6IE92gm7FC1zCyZiszEijU3qo3am+SQF' 'yIQME8q5N622VCs9iHaiWLmkZJzXRiX1dLxRrsmBUnzSucKIZKmV8uM69KjLeaBAph2n+ySCXk' 'c4gz4CgEKNENatE4iTZ1y4S5r7tZVaC8k8D4vEqp7nrLLVYioYWTmuZ1Xi7OWJabt/m6mXV1Zb' 'KmzRSX1WQq1lZKDZf0OI5WqirXHCgpAdjESAobbwR1swvLJdV44RmJltmQW+/HPm8tNAxXlKUN' 'aF8PNyqN6gZCMWVl/RrsypxwRZ8sVd/kLBczfhUsTsfC02eFOCXXY+jRKjXnu+ydV9xDho8LvY' 'E070q2O0pvFad9nw2tIlOOtbQ0B5EK0hjOlp6nqS6qw2gLQiMZH5tp3e4bfkuseDD0ZqnqaN4l' 'kfCbdsn5+DYZO3abRqypJjPCMgOFEn4LUjTAEdhQM/qsca1VI9RwMPE3o0U8c89K+UopUlJV0O' 'JQjp5F0VO41SG8OBw+M/isc0xxdEPdzzto52jLqoecqplS5SbSloW3UOztM+Bvu/vA5i52P6u/' 'asQYgoU7Q+lmfe8LhyLdD8uguZU+YNtVogaVeIp3fqyoGmDir6GUpO5+59tJjJ3AMNi8LFXipG' 'ptCZKJKgu1zIF5ROtV48yKQ7kN5GYSiyR7ClAzzTyO1tEatzORmtjJRheJyqIkB4rjY9mBqrtZ' '9RmKFHUrPh+PRfhHq9Vj912FllObgzUbMixVfcW16GqlQ3WzCy4Jj24WdGQCRTieqp69Qq9WfI' '7fktFxqoxwOta6yGV0og6Air+ulxQB6rTFrxXD0hWVRkcJxDCZ1krFitrnzAWopKODGS4Jklmm' '3GURV9ck1yNe0Z1hVW0tvqK09muWvUcGT2ZBuaZHyBrLQ11fuVqsNNwjmhNead4aEtbyYonxVU' 'ci7k+CI/OJnA1NXer8CPH6lDCMI1dWQlomMKZjCwZOg6uE8hH2TZ1oyBfsbsBmCvEJb4/Eeosz' '0bJcQgy93iRDsXZfcPne54hxY1asNavTYqPyDX+gWIjLVY4J4tzemMG5LxxRDgaKV8HxcW5mZk' 'pYTLng8DNwUPZI8aNFsTVsFhKZnGbtq1Geys2MnDPcKVU2NTsTWcx1qq9Od29usU7zstIoL1Jn' 'elCQhbp8uGoJp7g/0FRSvg/qXszX5jF9baZmHC7O5lHsa1qb0dSJ9O2qTr6r8hXKvYZF4jbEGt' '/9YX5ZzEpDdRHeUr8klgB9xBxdJPPaAFtmgEeo9S9S8VV8pGTv7GkB4xmZhJia+nzV7iAxybSd' 'QoZPNvdg/W6qVuWYmuboQWBw0fg9Fg6e0tCpy7hXrvPfj4VDpyK3Xl0Xf2oqUjRSnoic8iZSpX' 'pfXFpCcsdIrTwacpUtxrmYeYXxPC/u1WqVt9k68aSmayhq0NBiJ3ZydZHpjpfg3nVHcJAZwTZB' 'QF9PCSOwkmnBO7tu3TSMwrF2keWnL95M9DqBLXOyUtLTsx4TSTXgxeecQlUUrYdvwCJgz5KVDR' 'pqfUibZaxul/GZEZ8M0zyfVPIp2xNuJKSV1JiTnw6fokZRje7xU/bN9MaCrol4Rp3tigqdPBXj' 'ZG6oHcUZabFXvvmIOoOIGiZrNy/uIOF8ZU9B1UvEuxNVSk+37XK3ScuHjbbXiYithGlKvKG2Tz' 'ui4YVSzWjbVD9jHJrKPI/rkFyf1c55mXccK75g1Nw7iG8OCyV9vIK2ZCuXkFHmAqIEtRK1HJdf' 'vg3M5ycu5Mbzo3O5wtlZyP/n7XEHlHiT4tN2jZgPZVqtkxF+VZIR2kiJX/fYiuIe8dF1RKQyIJ' 'o+u4253Bb5JJot8OvWdl7b2n0dtvN3OaAkQJlgv1FWfyzt748rq0tr641rm+mp2/22Mbw/faO1' 'Mtrnt1oRnb1NRTQ3eUdK6B/b7adY7XwsCF7RQb+ig35FB/2KDvoVHfQrOuh/TB30mNIVy2+td9' 'aa6fuNZhp654eUZlp+ax201kw/YDTTRxzN9BGjmW7WQX9LcpYco4cg8+UETXFOikzrms9Sw5ny' 'UXCtusGMYa3UjwMHt4Mr1fKS0jJgG9xgCz6+TEW+5234GtLGsxCfmqFzmkquuqpEiY+OwNkist' 'DcFYfTdlUvJigy4WK5NlFgaimSPpW0JOJMtWpZ0tr6Yni6WOuJJ3RipqNXcWjEgLZ+fyrKNfO9' '1txIiia/xjyXnucrLNOCCyot2/z1G/NOApRjiA6nuan/C9Ra/dM='))) _INDEX = { f.name: { 'descriptor': f, 'services': {s.name: s for s in f.service}, } for f in FILE_DESCRIPTOR_SET.file } HotlistsServiceDescription = { 'file_descriptor_set': FILE_DESCRIPTOR_SET, 'file_descriptor': _INDEX[u'api/v3/api_proto/hotlists.proto']['descriptor'], 'service_descriptor': _INDEX[u'api/v3/api_proto/hotlists.proto']['services'][u'Hotlists'], }

79.270886

92

0.884517

2,473

62,624

22.390214

0.94905

0.001517

0.001535

0.000939

0.003142

0.002456

0.001517

0

0.152831

0.062676

62,624

789

93

79.371356

0.790473

0.003753

0

1

0.002564

0.907252

0.905713

0

1

0

1

0

false

0

0.003846

0

0.003846

0

1

null

0

1

0

1

null

1

0

5

88065f98bbae7e170c3501e1b7cfc6e064114fc9

120

py

Python

odoo-13.0/addons/l10n_do/models/__init__.py

VaibhavBhujade/Blockchain-ERP-interoperability

b5190a037fb6615386f7cbad024d51b0abd4ba03

[ "MIT" ]

1

2019-12-19T01:53:13.000Z

odoo-13.0/addons/l10n_do/models/__init__.py

VaibhavBhujade/Blockchain-ERP-interoperability

b5190a037fb6615386f7cbad024d51b0abd4ba03

[ "MIT" ]

null

odoo-13.0/addons/l10n_do/models/__init__.py

VaibhavBhujade/Blockchain-ERP-interoperability

b5190a037fb6615386f7cbad024d51b0abd4ba03

[ "MIT" ]

null

24

73

0.75

17

120

5.235294

0.823529

0.247191

0

0.04717

0.116667

120

4

74

30

0.792453

0.708333

0

1

0

true

0

1

0

1

0

1

0

null

1

0

1

0

null

0

1

0

1

0

5

8807f6e1a5cfa20cce7b0df1364a8eb50a99db89

62

py

Python

gaesecure/models.py

adamalton/django-gae-secure

78b6d9a3671b266c90aeb24dffa461d3f14db30b

[ "MIT" ]

1

2016-03-13T05:12:32.000Z

gaesecure/models.py

adamalton/django-gae-secure

78b6d9a3671b266c90aeb24dffa461d3f14db30b

[ "MIT" ]

null

gaesecure/models.py

adamalton/django-gae-secure

78b6d9a3671b266c90aeb24dffa461d3f14db30b

[ "MIT" ]

null

from gaesecure.patches import apply_patches apply_patches()

12.4

43

0.83871

8

62

6.25

0.625

0.48

0

0.112903

62

4

44

15.5

0.909091

0

1

0

true

0

0.5

0

0.5

0

1

0

null

1

0

1

0

null

0

1

0

1

0

5

718a211ecc402e92a02ce53cf3dc6f3cf34fc4b6

39

py

Python

python/testData/copyPaste/SingleLine.src.py

jnthn/intellij-community

8fa7c8a3ace62400c838e0d5926a7be106aa8557

[ "Apache-2.0" ]

2

2018-12-29T09:53:39.000Z

2018-12-29T09:53:42.000Z

python/testData/copyPaste/SingleLine.src.py

Cyril-lamirand/intellij-community

60ab6c61b82fc761dd68363eca7d9d69663cfa39

[ "Apache-2.0" ]

173

2018-07-05T13:59:39.000Z

2018-08-09T01:12:03.000Z

python/testData/copyPaste/SingleLine.src.py

Cyril-lamirand/intellij-community

60ab6c61b82fc761dd68363eca7d9d69663cfa39

[ "Apache-2.0" ]

2

2020-03-15T08:57:37.000Z

2020-04-07T04:48:14.000Z

<selection> print "foo" </selection>

19.5

26

0.666667

4

39

6.5

0.75

0

0.153846

39

2

27

19.5

0.787879

0

0.075

0

null

0

null

0.5

1

0

null

0

1

0

null

0

1

0

1

0

5

7199a575c7b60be943be4d17336543c7236715a9

290

py

Python

swig/python/gdal-utils/scripts/gdalcompare.py

FeU-aKlos/gdal

bba6781133815248c9329842d365f8812b74c33f

[ "Apache-2.0" ]

3,100

2015-01-02T10:33:40.000Z

2022-03-31T02:06:51.000Z

swig/python/gdal-utils/scripts/gdalcompare.py

FeU-aKlos/gdal

bba6781133815248c9329842d365f8812b74c33f

[ "Apache-2.0" ]

3,496

2015-01-06T16:53:30.000Z

2022-03-31T20:18:51.000Z

swig/python/gdal-utils/scripts/gdalcompare.py

FeU-aKlos/gdal

bba6781133815248c9329842d365f8812b74c33f

[ "Apache-2.0" ]

2,036

2015-01-08T20:22:12.000Z

2022-03-31T10:24:08.000Z

#!/usr/bin/env python3 import sys # import osgeo_utils.gdalcompare as a convenience to use as a script from osgeo_utils.gdalcompare import * # noqa from osgeo_utils.gdalcompare import main from osgeo.gdal import deprecation_warn deprecation_warn('gdalcompare') sys.exit(main(sys.argv))

24.166667

68

0.803448

44

290

5.181818

0.522727

0.131579

0.276316

0.219298

0.27193

0

0.003922

0.12069

290

11

69

26.363636

0.890196

0.32069

0

0.056701

0

1

0

true

0

0.666667

0

0.666667

0

null

0

1

0

null

0

1

0

1

0

1

0

5

71d0ce58e6223fb101d0db33858d927d366437ba

342

py

Python

exercicios-Python/ex008.py

pedrosimoes-programmer/exercicios-python

150de037496d63d76086678d87425a8ccfc74573

[ "MIT" ]

null

exercicios-Python/ex008.py

pedrosimoes-programmer/exercicios-python

150de037496d63d76086678d87425a8ccfc74573

[ "MIT" ]

null

exercicios-Python/ex008.py

pedrosimoes-programmer/exercicios-python

150de037496d63d76086678d87425a8ccfc74573

[ "MIT" ]

null

valorM = float(input('\33[1;31mDigite o valor desejado, em metros: \33[m')) #print('O valor desejado em centímetros ficaria: {} e em milímetros: {}'.format(valorM*100, valorM*1000)) print('\33[4;33m{}Km \n {}Hm \n {}dam \n {:.0f}dm \n {:.0f}cm \n {:.0f}mm\33[m'.format(valorM/1000, valorM/100, valorM/10, valorM*10, valorM*100, valorM*1000))

85.5

159

0.666667

61

342

3.737705

0.508197

0.118421

0.197368

0.140351

0

0.137705

0.108187

342

3

160

114

0.609836

0.304094

0

0.5

0.510549

0

1

0

false

0

0.5

0

null

0

1

0

1

0

1

0

1

0

null

0

1

0

5

71d65af9250c0bee4dbc7461cd3ee683a355c6e6

256

py

Python

inferno/extensions/criteria/__init__.py

vzinche/inferno

91b22dfcd1b6a9ec415f0bbb6ae66caea42f4034

[ "Apache-2.0" ]

null

inferno/extensions/criteria/__init__.py

vzinche/inferno

91b22dfcd1b6a9ec415f0bbb6ae66caea42f4034

[ "Apache-2.0" ]

null

inferno/extensions/criteria/__init__.py

vzinche/inferno

91b22dfcd1b6a9ec415f0bbb6ae66caea42f4034

[ "Apache-2.0" ]

null

from .set_similarity_measures import * from .elementwise_measures import * from .core import * from .regularized import * from .metric_learning import * __all__ = ['set_similarity_measures', 'elementwise_measures','core','regularized', 'metric_learning']

32

101

0.792969

29

256

6.586207

0.37931

0.209424

0.219895

0

0.101563

256

7

102

36.571429

0.830435

0

0.285156

0.089844

0

1

0

false

0

0.833333

0

0.833333

0

1

0

null

1

0

1

0

null

0

1

0

5

e0a88196b9a2d66ba76dce0142f803ce24190b6d

104

py

Python

alcpack/__init__.py

amitkpal/alcpack

21b0497f412eabe22ac9b500b5cc557df427c24c

[ "Apache-2.0" ]

2

2019-07-30T17:29:09.000Z

2021-01-31T04:58:05.000Z

alcpack/__init__.py

amitkpal/alcpack

21b0497f412eabe22ac9b500b5cc557df427c24c

[ "Apache-2.0" ]

null

alcpack/__init__.py

amitkpal/alcpack

21b0497f412eabe22ac9b500b5cc557df427c24c

[ "Apache-2.0" ]

null

#!/usr/in/env python3 ## from .alcscript import local_complementation, path_category, alc_function

11.555556

73

0.769231

13

104

5.923077

1

0

0.011111

0.134615

104

8

74

13

0.844444

0.192308

0

1

0

true

0

1

0

1

0

1

0

null

0

1

0

null

0

1

0

1

0

1

0

5

e0b763abdc95e92239ee8e42cb2b59c519b88286

170

py

Python

Cashier/admin.py

carag-matthew/YCCM_Cafe

2261fd0f6ded18163ae74004c3673a77603b5cda

[ "MIT" ]

null

Cashier/admin.py

carag-matthew/YCCM_Cafe

2261fd0f6ded18163ae74004c3673a77603b5cda

[ "MIT" ]

5

2017-10-15T17:14:42.000Z

2017-10-17T06:16:51.000Z

Cashier/admin.py

carag-matthew/Half-POS

2261fd0f6ded18163ae74004c3673a77603b5cda

[ "MIT" ]

null

from django.contrib import admin from Cashier.models import Product, ProductMod # Register your models here. admin.site.register(Product) admin.site.register(ProductMod)

28.333333

46

0.829412

23

170

6.130435

0.565217

0.12766

0.241135

0

0.094118

170

6

47

28.333333

0.915584

0.152941

0

1

0

true

0

0.5

0

0.5

0

1

0

null

0

1

0

1

0

null

0

1

0

1

0

5

e0c6f26cd16128f8052720ce4d6cdbefd9793838

208

py

Python

busy_beaver/models/kv_store.py

ZaxR/busy-beaver

ffe1250d0156f71d1053f37c8070ca0dd888348f

[ "MIT" ]

null

busy_beaver/models/kv_store.py

ZaxR/busy-beaver

ffe1250d0156f71d1053f37c8070ca0dd888348f

[ "MIT" ]

null

busy_beaver/models/kv_store.py

ZaxR/busy-beaver

ffe1250d0156f71d1053f37c8070ca0dd888348f

[ "MIT" ]

null

from simplekv.db.sql import SQLAlchemyStore from .. import db from ..adapters.key_value_store import KeyValueStore store = SQLAlchemyStore(db.engine, db.metadata, 'kv_store') kv_store = KeyValueStore(store)

29.714286

59

0.807692

28

208

5.857143

0.5

0.219512

0

0.100962

208

6

60

34.666667

0.877005

0

0.038462

0

1

0

false

0

0.6

0

0.6

0

1

0

null

1

0

1

0

null

0

1

0

1

0

5

e0e6b88d0bd746e7c46f96f06f7688e2b8be8f29

319

py

Python

moto/opsworks/__init__.py

jonnangle/moto-1

40b4e299abb732aad7f56cc0f680c0a272a46594

[ "Apache-2.0" ]

3

2020-08-04T20:29:41.000Z

2020-11-09T09:28:19.000Z

moto/opsworks/__init__.py

jonnangle/moto-1

40b4e299abb732aad7f56cc0f680c0a272a46594

[ "Apache-2.0" ]

17

2020-08-28T12:53:56.000Z

2020-11-10T01:04:46.000Z

moto/opsworks/__init__.py

jonnangle/moto-1

40b4e299abb732aad7f56cc0f680c0a272a46594

[ "Apache-2.0" ]

2

2017-03-02T05:59:52.000Z

2020-09-03T13:25:44.000Z

from __future__ import unicode_literals from .models import opsworks_backends from ..core.models import base_decorator, deprecated_base_decorator opsworks_backend = opsworks_backends["us-east-1"] mock_opsworks = base_decorator(opsworks_backends) mock_opsworks_deprecated = deprecated_base_decorator(opsworks_backends)

39.875

71

0.871473

40

319

6.475

0.425

0.247104

0.243243

0.239382

0

0.003378

0.0721

319

7

72

45.571429

0.871622

0

0.028213

0

1

0

false

0

0.5

0

0.5

0

null

1

0

1

0

null

0

1

0

5