content stringlengths 6 1.03M | input_ids listlengths 4 535k | ratio_char_token float64 0.68 8.61 | token_count int64 4 535k |
|---|---|---|---|
<filename>Exercises/Tutorial_5_Oxygen.jl<gh_stars>1-10
using Pkg, LsqFit, Plots, Optim
x = [ 3.08, 4.61, 6.77, 10.15, 12.31, 15.38, 18.77, 22.77, 25.85, 30.15, 36.00, 45.23, 51.69, 61.85, 75.38, 87.08, 110.5]
y = [2.21, 3.59, 6.08, 10.50, 14.09, 19.34, 28.45, 40.33, 50.00, 60.50, 69.89, 80.11, 83.98, 88.95, 93.37, 95.... | [
27,
34345,
29,
3109,
2798,
2696,
14,
51,
44917,
62,
20,
62,
46,
5431,
5235,
13,
20362,
27,
456,
62,
30783,
29,
16,
12,
940,
198,
3500,
350,
10025,
11,
406,
31166,
31805,
11,
1345,
1747,
11,
30011,
198,
198,
87,
796,
685,
513,
13... | 1.892054 | 667 |
ts = time()
println("The system time is (in ISO 8601 format):")
println(strftime(" %F %T %Z", ts))
| [
912,
796,
640,
3419,
198,
198,
35235,
7203,
464,
1080,
640,
318,
357,
259,
19694,
9849,
486,
5794,
2599,
4943,
198,
35235,
7,
2536,
31387,
7203,
220,
220,
220,
4064,
37,
4064,
51,
4064,
57,
1600,
40379,
4008,
198
] | 2.641026 | 39 |
function fib(n)
if n <= 1
return n
end
return fib(n - 2) + fib(n - 1)
end
for i in 0:24
fib(i)
end | [
8818,
12900,
7,
77,
8,
198,
197,
361,
299,
19841,
352,
198,
197,
197,
7783,
299,
198,
197,
437,
198,
197,
7783,
12900,
7,
77,
532,
362,
8,
1343,
12900,
7,
77,
532,
352,
8,
198,
437,
198,
198,
1640,
1312,
287,
657,
25,
1731,
19... | 1.944444 | 54 |
<reponame>psv2/AARMBEM-C.jl
using Documenter;
push!(LOAD_PATH, "../src/");
using SharedArrays, SpecialFunctions, Distributed, Printf
using DelimitedFiles, LinearAlgebra
include("../src/AARMBEMC_ReadCMDARGS.jl");
include("../src/E1func.jl");
include("../src/GenericMatrixVectorUtils.jl");
include("../src/MolData.jl");
in... | [
27,
7856,
261,
480,
29,
862,
85,
17,
14,
32,
1503,
10744,
3620,
12,
34,
13,
20362,
198,
3500,
16854,
263,
26,
198,
14689,
0,
7,
35613,
62,
34219,
11,
366,
40720,
10677,
14,
15341,
198,
3500,
39403,
3163,
20477,
11,
6093,
24629,
27... | 2.368148 | 1,350 |
<reponame>Wikunia/hakank
#=
Set covering in Julia ConstraintSolver.jl
Placing of firestations, from Winston "Operations Research", page 486
Model created by <NAME>, <EMAIL>
See also my Julia page: http://www.hakank.org/julia/
=#
using ConstraintSolver, JuMP
using Cbc, GLPK
const CS = ConstraintSolver
include... | [
27,
7856,
261,
480,
29,
33010,
39934,
14,
43573,
962,
198,
2,
28,
198,
220,
5345,
9505,
287,
22300,
1482,
2536,
2913,
50,
14375,
13,
20362,
628,
220,
1345,
4092,
286,
2046,
301,
602,
11,
422,
21400,
366,
18843,
602,
4992,
1600,
2443... | 1.710053 | 1,890 |
<gh_stars>10-100
using BenchmarkTools
using CatViews
import Base.Cartesian: @ntuple
A = randn(5000,5000)
x = CatView( @ntuple 500 (n)->randn(10) )
@benchmark ($A)*($x)
| [
27,
456,
62,
30783,
29,
940,
12,
3064,
198,
3500,
25187,
4102,
33637,
198,
3500,
5181,
7680,
82,
198,
11748,
7308,
13,
43476,
35610,
25,
2488,
429,
29291,
198,
198,
32,
796,
43720,
77,
7,
27641,
11,
27641,
8,
198,
87,
796,
5181,
7... | 2.375 | 72 |
# This file is auto-generated by AWSMetadata.jl
using AWS
using AWS.AWSServices: sso
using AWS.Compat
using AWS.UUIDs
"""
get_role_credentials(account_id, role_name, x-amz-sso_bearer_token)
get_role_credentials(account_id, role_name, x-amz-sso_bearer_token, params::Dict{String,<:Any})
Returns the STS short-te... | [
2,
770,
2393,
318,
8295,
12,
27568,
416,
30865,
9171,
14706,
13,
20362,
198,
3500,
30865,
198,
3500,
30865,
13,
12298,
5432,
712,
1063,
25,
264,
568,
198,
3500,
30865,
13,
40073,
198,
3500,
30865,
13,
52,
27586,
82,
198,
198,
37811,
... | 2.751592 | 1,884 |
<reponame>mostlysimilar/QualitativeAudioFeatures.jl
using Makie, MakieThemes, Colors
AbstractPlotting.set_theme!(ggthemr(:earth))
using SampledSignals, DSP, LinearAlgebra, PortAudio
using Observables
using FileIO: load, save, loadstreaming, savestreaming
import LibSndFile
function getTestSampleBuf()
wav_dir = "../... | [
27,
7856,
261,
480,
29,
29471,
38610,
14,
46181,
12464,
21206,
23595,
13,
20362,
198,
3500,
15841,
494,
11,
15841,
494,
464,
6880,
11,
29792,
198,
23839,
43328,
889,
13,
2617,
62,
43810,
0,
7,
1130,
18855,
81,
7,
25,
16442,
4008,
19... | 2.679648 | 796 |
<reponame>Fypsilonn/MPIMeasurements.jl
using MPIMeasurements
# define Positions
positions = loadTDesign(8,36,42Unitful.mm,[16.0,0.0,0.0]Unitful.mm)
# create Scanner
scanner = MPIScanner("BrukerScanner.toml")
#scanner = MPIScanner("DummyScanner.toml")
robot = getRobot(scanner)
safety = getSafety(scanner)
gauss = getGa... | [
27,
7856,
261,
480,
29,
37,
88,
862,
33576,
77,
14,
7378,
3955,
68,
5015,
902,
13,
20362,
198,
3500,
4904,
3955,
68,
5015,
902,
198,
198,
2,
8160,
18574,
1756,
198,
1930,
1756,
796,
3440,
51,
23067,
7,
23,
11,
2623,
11,
3682,
26... | 2.486068 | 323 |
<filename>src/grape_tools.jl
"""
Initialise all the storage arrays that will be used in a GRAPE optimisation
"""
function init_GRAPE(X, n_timeslices, n_ensemble, A, n_controls)
# states
states = [similar(X) .* 0.0 for i = 1:n_timeslices+1, j = 1:n_ensemble]
# costates
costates = [similar(X) .* 0.0 for i... | [
27,
34345,
29,
10677,
14,
70,
13484,
62,
31391,
13,
20362,
198,
37811,
198,
24243,
786,
477,
262,
6143,
26515,
326,
481,
307,
973,
287,
257,
10863,
45721,
6436,
5612,
198,
37811,
198,
8818,
2315,
62,
10761,
45721,
7,
55,
11,
299,
62... | 2.397226 | 793 |
@doc raw"""
ItemkNN(k::Int64, shrink::Float64, weighting::Union{Nothing,Symbol}, weighting_at_inference::Bool, normalize::Bool, normalize_similarity::Bool)
Item-based k-nearest neighborhood algorithm with cosine similarity.
The model first computes the item-to-item similarity matrix
```math
s_{ij} = \frac{\bm r_i... | [
31,
15390,
8246,
37811,
198,
220,
220,
220,
9097,
74,
6144,
7,
74,
3712,
5317,
2414,
11,
22085,
3712,
43879,
2414,
11,
3463,
278,
3712,
38176,
90,
18465,
11,
13940,
23650,
5512,
3463,
278,
62,
265,
62,
259,
4288,
3712,
33,
970,
11,
... | 2.404468 | 1,701 |
# Tue 13 Nov 2012 04:13:36 PM EST
#
# NeHe Tut 8 - Implement lights and rotate an alpha-blended, textured cube
#
# Q - quit
# B - turn texture alpha-blending on/off
# L - turn lights on/off
# F - change texture filter (linear, nearest, mipmap)
# PageUp/Down - move camera closer/further away from cube
# Up/Down - increa... | [
2,
30030,
1511,
5267,
2321,
8702,
25,
1485,
25,
2623,
3122,
17160,
198,
2,
198,
2,
3169,
1544,
22792,
807,
532,
48282,
7588,
290,
23064,
281,
17130,
12,
2436,
1631,
11,
2420,
1522,
23441,
198,
2,
198,
2,
1195,
532,
11238,
198,
2,
... | 2.005148 | 3,691 |
<filename>S/SuiteSparse/SuiteSparse_GPU/build_tarballs.jl
# This is an experimental build of SuiteSparse.
using BinaryBuilder, Pkg
name = "SuiteSparse_GPU"
version = v"5.8.1"
# Collection of sources required to build SuiteSparse
sources = [
GitSource("https://github.com/DrTimothyAldenDavis/SuiteSparse.git",
... | [
27,
34345,
29,
50,
14,
5606,
578,
50,
29572,
14,
5606,
578,
50,
29572,
62,
33346,
14,
11249,
62,
18870,
21591,
13,
20362,
198,
2,
770,
318,
281,
11992,
1382,
286,
26264,
50,
29572,
13,
198,
198,
3500,
45755,
32875,
11,
350,
10025,
... | 2.294225 | 2,199 |
<gh_stars>0
using Base.Test
import ArchGDAL; const AG = ArchGDAL
@testset "Testing StyleTable Methods" begin
AG.createstylemanager() do sm
@test AG.initialize!(sm) == true
@test AG.npart(sm) == 0
@test AG.initialize!(sm, "PEN(w:2px,c:#000000,id:\"mapinfo-pen-2,ogr-pen-0\")") == true
... | [
27,
456,
62,
30783,
29,
15,
198,
3500,
7308,
13,
14402,
198,
11748,
5579,
45113,
1847,
26,
1500,
13077,
796,
5579,
45113,
1847,
198,
198,
31,
9288,
2617,
366,
44154,
17738,
10962,
25458,
1,
2221,
198,
220,
220,
220,
13077,
13,
20123,
... | 1.785668 | 1,549 |
<gh_stars>0
# Licensed to the Apache Software Foundation (ASF) under one
# or more contributor license agreements. See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership. The ASF licenses this file
# to you under the Apache License, Version 2.0 (the
# "License"); y... | [
27,
456,
62,
30783,
29,
15,
198,
2,
49962,
284,
262,
24843,
10442,
5693,
357,
1921,
37,
8,
739,
530,
198,
2,
393,
517,
18920,
5964,
11704,
13,
220,
4091,
262,
28536,
2393,
198,
2,
9387,
351,
428,
670,
329,
3224,
1321,
198,
2,
51... | 2.373052 | 7,830 |
<reponame>StevenWhitaker/PERK.jl
function test_complex_1()
Random.seed!(0)
f = x -> [exp(-30 / x), exp(-30 / x)]
xtrue = 100
y = f(xtrue)
T = 1
xDists = Uniform(10, 500)
noiseDist = Normal(0, 0.01)
signalModels = f
λ = 2.0^-1.5
kernel = GaussianKernel(λ * y)
ρ = 2.0^-20
... | [
27,
7856,
261,
480,
29,
28292,
43617,
3110,
14,
18973,
42,
13,
20362,
198,
8818,
1332,
62,
41887,
62,
16,
3419,
628,
220,
220,
220,
14534,
13,
28826,
0,
7,
15,
8,
198,
220,
220,
220,
277,
796,
2124,
4613,
685,
11201,
32590,
1270,
... | 1.961568 | 3,929 |
<reponame>terasakisatoshi/juliaExer
using LinearAlgebra, Statistics
import MPI, LinearAlgebra
function montecarlo(mc_eval::Function, mc_monitor::Function,
comm::MPI.Comm, # MPI communicator
n_evals::Integer, # total number of evaluations
n_returns::Integer, ... | [
27,
7856,
261,
480,
29,
353,
292,
27321,
265,
13704,
14,
73,
43640,
3109,
263,
198,
3500,
44800,
2348,
29230,
11,
14370,
198,
198,
11748,
4904,
40,
11,
44800,
2348,
29230,
198,
198,
8818,
937,
660,
7718,
5439,
7,
23209,
62,
18206,
3... | 2.085782 | 1,259 |
<reponame>oschulz/Bijectors.jl<filename>test/bijectors/ordered.jl
import Bijectors: OrderedBijector
@testset "OrderedBijector" begin
b = OrderedBijector()
# Length 1
x = randn(1)
y = b(x)
test_bijector(b, hcat(x, x), hcat(y, y), zeros(2))
# Larger
x = randn(5)
xs = hcat(x, x)
test... | [
27,
7856,
261,
480,
29,
418,
354,
37314,
14,
23286,
752,
669,
13,
20362,
27,
34345,
29,
9288,
14,
8482,
752,
669,
14,
24071,
13,
20362,
198,
11748,
8436,
752,
669,
25,
14230,
1068,
23286,
752,
273,
198,
198,
31,
9288,
2617,
366,
3... | 1.918033 | 244 |
function updateDatastream!(
mb :: ModelBlock,
clock :: ModelClock,
)
cdatam = mb.co.cdatam
datastream = mb.tmpfi.datastream
cfg = mb.ev.config
if cdatam != nothing
interpData!(cdatam, clock.time, datastream)
if cfg["MLD_scheme"] == "datastream"
mb.fi... | [
8818,
4296,
27354,
459,
1476,
0,
7,
198,
220,
220,
220,
285,
65,
220,
220,
220,
7904,
9104,
12235,
11,
198,
220,
220,
220,
8801,
7904,
9104,
44758,
11,
198,
8,
198,
220,
220,
220,
269,
19608,
321,
220,
220,
220,
220,
796,
285,
6... | 1.800643 | 311 |
fit = perc_pos_to_num_tests_scale(model; lookback = 150)
θs = model |> flatten_chain
## Project PCR test results from the infection projections
sampled_PCRs = map((inf, θ) -> generate_PCR_predictions(inf, θ, model, fit; M_PCR = 150), infections, θs)
sampled_pos_tests = [sample[:, 1] for sample in sampled_PCRs]
sampl... | [
198,
11147,
796,
583,
66,
62,
1930,
62,
1462,
62,
22510,
62,
41989,
62,
9888,
7,
19849,
26,
804,
1891,
796,
6640,
8,
198,
138,
116,
82,
796,
2746,
930,
29,
27172,
268,
62,
7983,
198,
198,
2235,
4935,
45154,
1332,
2482,
422,
262,
... | 2.326519 | 1,712 |
#####
##### Smolyak implementation details
#####
####
#### Block sizes and shuffling
####
"""
$(SIGNATURES)
Length of each block `b`.
!!! note
Smolyak grids use “blocks” of polynomials, each indexed by ``b == 0, …, B`, with an
increasing number of points in each.
"""
@inline __block_length(b::Int) = b ≤ 1 ?... | [
4242,
2,
198,
4242,
2,
2439,
3366,
461,
7822,
3307,
198,
4242,
2,
198,
198,
4242,
198,
4242,
9726,
10620,
290,
32299,
1359,
198,
4242,
198,
198,
37811,
198,
3,
7,
46224,
47471,
8,
198,
198,
24539,
286,
1123,
2512,
4600,
65,
44646,
... | 2.181818 | 1,749 |
# IF THIS SMALL FUNCTION IS PLACED IN THE STARTUP.JL
# FILE, IT WILL BE LOADED ON STARTUP. THE REST OF
# THIS EXAMPLE IS IN ALL UPPERCASE.
function RUNUPPERCASECODE(CO)
COD = replace(lowercase(CO), "date" => "Date")
for E in Meta.parse(COD, 1) eval(E) end
end
CODE = """BEGIN
USING DATES;
CENTEROBJECT(X, N) =... | [
2,
16876,
12680,
9447,
7036,
29397,
4177,
2849,
3180,
9297,
2246,
1961,
3268,
3336,
33303,
8577,
13,
41,
43,
198,
2,
45811,
11,
7283,
17682,
9348,
17579,
2885,
1961,
6177,
33303,
8577,
13,
3336,
30617,
3963,
198,
2,
12680,
7788,
2390,
... | 1.914158 | 897 |
<reponame>jarbus/GeometricFlux.jl
abstract type MessagePassing <: GraphNet end
"""
message(mp::MessagePassing, x_i, x_j, e_ij)
Message function for the message-passing scheme,
returning the message from node `j` to node `i` .
In the message-passing scheme. the incoming messages
from the neighborhood of `i` will ... | [
27,
7856,
261,
480,
29,
9491,
10885,
14,
10082,
16996,
37,
22564,
13,
20362,
198,
397,
8709,
2099,
16000,
14478,
278,
1279,
25,
29681,
7934,
886,
198,
198,
37811,
198,
220,
220,
220,
3275,
7,
3149,
3712,
12837,
14478,
278,
11,
2124,
... | 2.667049 | 871 |
########### Defines the parameters & plot for Fig 1 b,d,f,h,j ###########
bi = 1.0; # set the birth rate of infected individuals as a constant 1.0
# import required variables/modules common to all simulations
include("../Model_scripts/fig1params.jl")
include("../Model_scripts/Functions.jl")
# now that we have all the r... | [
7804,
21017,
2896,
1127,
262,
10007,
1222,
7110,
329,
12138,
352,
275,
11,
67,
11,
69,
11,
71,
11,
73,
1303,
7804,
2235,
198,
8482,
796,
352,
13,
15,
26,
1303,
900,
262,
4082,
2494,
286,
14112,
3925,
355,
257,
6937,
352,
13,
15,
... | 3.06986 | 501 |
#
# Basic definitions
#
function check_data_type(data)
if typeof(data) <: Array && length(data) > 0
if keytype(data[1]) == String && valtype(data[1]) <: Any
return true
end
end
return false
end
function stan(
model::Stanmodel,
data=Void,
ProjDir=pwd();
summary=true,
diagnostics=false,... | [
2,
198,
2,
14392,
17336,
198,
2,
198,
198,
8818,
2198,
62,
7890,
62,
4906,
7,
7890,
8,
198,
220,
611,
2099,
1659,
7,
7890,
8,
1279,
25,
15690,
11405,
4129,
7,
7890,
8,
1875,
657,
198,
220,
220,
220,
611,
1994,
4906,
7,
7890,
5... | 2.065491 | 7,940 |
<gh_stars>1-10
using Plots
##------------------------------------------------------------------------------
# Ch 7.1 Principles of Regression
# Julia code to fit data points using a straight line
N = 50
x = rand(N)
a = 2.5 # true parameter
b = 1.3 # true parame... | [
27,
456,
62,
30783,
29,
16,
12,
940,
198,
3500,
1345,
1747,
201,
198,
201,
198,
2235,
10097,
26171,
201,
198,
201,
198,
2,
609,
767,
13,
16,
34200,
286,
3310,
2234,
201,
198,
2,
22300,
2438,
284,
4197,
1366,
2173,
1262,
257,
3892,... | 2.059188 | 5,322 |
<gh_stars>1-10
# Represents a static order of an ITensor
@eval struct Order{N}
(OrderT::Type{<:Order})() = $(Expr(:new, :OrderT))
end
@doc """
Order{N}
A value type representing the order of an ITensor.
""" Order
"""
Order(N) = Order{N}()
Create an instance of the value type Order representing
the order of a... | [
27,
456,
62,
30783,
29,
16,
12,
940,
198,
198,
2,
1432,
6629,
257,
9037,
1502,
286,
281,
7283,
22854,
198,
31,
18206,
2878,
8284,
90,
45,
92,
198,
220,
357,
18743,
51,
3712,
6030,
90,
27,
25,
18743,
30072,
3419,
796,
29568,
3109,
... | 2.451392 | 9,484 |
#=
Discrete Decision Processes
@author : <NAME>, <NAME>, <NAME>
@date: 24/Sep/2015
References
----------
http://quant-econ.net/jl/ddp.html
Notes
-----
1. This currently implements:
a. Value Iteration,
b. Policy Iteration, and
c. Modified Policy Iteration
For:
a. Dense Matrices
b. State-Actio... | [
2,
28,
198,
15642,
8374,
26423,
10854,
274,
198,
198,
31,
9800,
1058,
1279,
20608,
22330,
1279,
20608,
22330,
1279,
20608,
29,
198,
198,
31,
4475,
25,
1987,
14,
19117,
14,
4626,
198,
198,
19927,
198,
35937,
198,
198,
4023,
1378,
40972... | 2.286353 | 10,061 |
# This file is a part of Julia. License is MIT: https://julialang.org/license
using SHA
using Test
const VERBOSE = false
# Define some data we will run our tests on
lorem = "Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim v... | [
2,
770,
2393,
318,
257,
636,
286,
22300,
13,
13789,
318,
17168,
25,
3740,
1378,
73,
377,
498,
648,
13,
2398,
14,
43085,
198,
198,
3500,
25630,
198,
3500,
6208,
198,
198,
9979,
33310,
33,
14058,
796,
3991,
198,
198,
2,
2896,
500,
6... | 1.940707 | 6,645 |
<reponame>UnofficialJuliaMirrorSnapshots/Kuber.jl-87e52247-8a1b-5e01-9430-8fbcac83a23a<filename>src/api/model_IoK8sApiCoreV1PreferredSchedulingTerm.jl
# This file was generated by the Julia Swagger Code Generator
# Do not modify this file directly. Modify the swagger specification instead.
mutable struct IoK8sApiCor... | [
27,
7856,
261,
480,
29,
3118,
16841,
16980,
544,
27453,
1472,
43826,
20910,
14,
42,
18478,
13,
20362,
12,
5774,
68,
4309,
23753,
12,
23,
64,
16,
65,
12,
20,
68,
486,
12,
5824,
1270,
12,
23,
69,
15630,
330,
5999,
64,
1954,
64,
27... | 2.701266 | 790 |
<gh_stars>0
# test to see that deleteHybridizationUpdate undoes all attributes
# prompted by Cecile finding cases when containRoot was not updated
# <NAME> 2015
if !isdefined(:individualtest) individualtest = false; end
if(individualtest)
include("../src/types.jl")
include("../src/functions.jl")
const DEB... | [
27,
456,
62,
30783,
29,
15,
198,
2,
1332,
284,
766,
326,
12233,
21217,
10236,
1634,
10260,
3318,
3028,
477,
12608,
198,
2,
12053,
416,
23367,
576,
4917,
2663,
618,
3994,
30016,
373,
407,
6153,
198,
2,
1279,
20608,
29,
1853,
198,
198... | 2.900577 | 3,118 |
<filename>src/promote.jl
Base.promote_rule(::Type{PT}, ::Type{PS}) where {PT<:APL, PS<:APL} = promote_type(polynomialtype(PT), polynomialtype(PS))
Base.promote_rule(::Type{PT}, ::Type{PT}) where {PT<:APL} = PT
promote_rule_constant(::Type{T}, ::Type{RationalPoly{NT, DT}}) where {T, NT, DT} = RationalPoly{promote_type(... | [
27,
34345,
29,
10677,
14,
16963,
1258,
13,
20362,
198,
14881,
13,
16963,
1258,
62,
25135,
7,
3712,
6030,
90,
11571,
5512,
7904,
6030,
90,
3705,
30072,
810,
1391,
11571,
27,
25,
2969,
43,
11,
6599,
27,
25,
2969,
43,
92,
796,
7719,
... | 2.293644 | 1,243 |
################################################################################
#
# Line enumeration
#
################################################################################
# Iterate over the lines in K^n, that is, over the points of projective
# space P^(n-1)(K).
#
# Important: In the prime case, this mu... | [
29113,
29113,
14468,
198,
2,
198,
2,
220,
6910,
27056,
341,
198,
2,
198,
29113,
29113,
14468,
198,
198,
2,
40806,
378,
625,
262,
3951,
287,
509,
61,
77,
11,
326,
318,
11,
625,
262,
2173,
286,
1628,
425,
198,
2,
2272,
350,
61,
7,... | 1.951773 | 9,559 |
__precompile__()
module Reduce
using ForceImport, SyntaxTree, LinearAlgebra
!isdefined(Reduce,:linefilter!) && (linefilter! = SyntaxTree.linefilter)
# This file is part of Reduce.jl. It is licensed under the MIT license
# Copyright (C) 2017 <NAME>
include(joinpath(@__DIR__,"../deps/svn.jl"))
struct PSL <: Base.A... | [
834,
3866,
5589,
576,
834,
3419,
198,
21412,
44048,
198,
3500,
5221,
20939,
11,
26375,
897,
27660,
11,
44800,
2348,
29230,
198,
0,
271,
23211,
7,
7738,
7234,
11,
25,
1370,
24455,
8133,
11405,
357,
1370,
24455,
0,
796,
26375,
897,
2766... | 2.522361 | 4,338 |
<reponame>fingolfin/BinaryBuilderBase.jl<filename>test/platforms.jl<gh_stars>0
using Test
using Pkg, Pkg.PlatformEngines, Pkg.BinaryPlatforms, Pkg.Artifacts
using BinaryBuilderBase
using BinaryBuilderBase: abi_agnostic, get_concrete_platform, march
@testset "Supported Platforms" begin
all = supported_platforms()
... | [
27,
7856,
261,
480,
29,
28825,
4024,
259,
14,
33,
3219,
32875,
14881,
13,
20362,
27,
34345,
29,
9288,
14,
24254,
82,
13,
20362,
27,
456,
62,
30783,
29,
15,
198,
3500,
6208,
198,
3500,
350,
10025,
11,
350,
10025,
13,
37148,
7936,
1... | 2.352645 | 7,733 |
struct BitsIntBool
a::Int
b::Bool
end
struct BitsCharFloat32Float64
a::Char
b::Float32
c::Float64
end
@testset "Multi-field bits types" begin
@test begin
b = JlrsReflect.reflect([BitsIntBool])
sb = JlrsReflect.StringWrappers(b)
sb[BitsIntBool] === """#[repr(C)]
... | [
7249,
44733,
5317,
33,
970,
198,
220,
220,
220,
257,
3712,
5317,
198,
220,
220,
220,
275,
3712,
33,
970,
198,
437,
198,
198,
7249,
44733,
12441,
43879,
2624,
43879,
2414,
198,
220,
220,
220,
257,
3712,
12441,
198,
220,
220,
220,
275... | 1.986767 | 529 |
using Sigma
using AbstractDomains
a = flip(1)
omegatron = Sigma.abstract_omega(1)
omegatron = HyperBox([Interval(0.501,.51)])
b = convert(Sigma.DRealRandVar{Bool},a)
@show call(b,omegatron)
| [
3500,
31669,
198,
3500,
27741,
24510,
1299,
198,
198,
64,
796,
14283,
7,
16,
8,
198,
462,
70,
23484,
796,
31669,
13,
397,
8709,
62,
462,
4908,
7,
16,
8,
198,
462,
70,
23484,
796,
15079,
14253,
26933,
9492,
2100,
7,
15,
13,
33548,
... | 2.448718 | 78 |
using LSH
using Base.Test
# A basic test for LSHTable with a dummy hash function
# To be explicit, we're constructing a test with the following
# parameters to make sure the basic plumbing work (this is not
# supposed to be useful)
#
# - T𝒫 === Int
# - H === DummyHash
# - RH === Uint32
# - DK === Uint32
const P = u... | [
3500,
406,
9693,
198,
3500,
7308,
13,
14402,
198,
198,
2,
317,
4096,
1332,
329,
30948,
6535,
540,
351,
257,
31548,
12234,
2163,
198,
198,
2,
1675,
307,
7952,
11,
356,
821,
30580,
257,
1332,
351,
262,
1708,
198,
2,
10007,
284,
787,
... | 2.745614 | 228 |
module TimeIt
if VERSION >= v"0.7.0"
using Printf
end
export @timeit
macro timen(ex, n)
quote
local t0 = time_ns()
for i = 1:$(esc(n))
local val = $(esc(ex))
end
local t1 = time_ns()
(t1 - t0) / 1.e9
end
end
macro timeit(ex)
quote
local val... | [
21412,
3862,
1026,
198,
198,
361,
44156,
2849,
18189,
410,
1,
15,
13,
22,
13,
15,
1,
198,
220,
220,
220,
1262,
12578,
69,
198,
437,
198,
198,
39344,
2488,
2435,
270,
198,
198,
20285,
305,
4628,
268,
7,
1069,
11,
299,
8,
198,
220... | 1.678523 | 731 |
# # Example 02: Indentation experiment
# This script provides an example of fitting of a force-indentation curve.
# First import the packages.
using RHEOSafm
using RHEOS
using Plots
using Plots.PlotMeasures
gr();
# next import the .txt file obtained from the JPK software
input_file = joinpath(@__DIR__, "assets", "A... | [
2,
1303,
17934,
7816,
25,
1423,
298,
341,
6306,
198,
198,
2,
770,
4226,
3769,
281,
1672,
286,
15830,
286,
257,
2700,
12,
521,
298,
341,
12133,
13,
220,
198,
2,
3274,
1330,
262,
10392,
13,
198,
3500,
371,
13909,
2640,
1878,
76,
198... | 3.133423 | 742 |
<reponame>JuliaIO/Zarr.jl
# Defines different storages for zarr arrays. Currently only regular files (DirectoryStore)
# and Dictionaries are supported
abstract type AbstractStore end
#Define the interface
"""
storagesize(d::AbstractStore)
This function shall return the size of all data files in a store.
"""
functi... | [
27,
7856,
261,
480,
29,
16980,
544,
9399,
14,
57,
3258,
13,
20362,
198,
198,
2,
2896,
1127,
1180,
336,
273,
1095,
329,
1976,
3258,
26515,
13,
16888,
691,
3218,
3696,
357,
43055,
22658,
8,
198,
2,
290,
360,
2867,
3166,
389,
4855,
1... | 2.692839 | 1,159 |
type Raster
dataset::GDALDatasetH
width::Cint
height::Cint
nband::Cint # number of raster bands
end
function Base.show(io::IO, raster::Raster)
if raster.dataset == C_NULL
print(io, "Closed Raster Dataset")
else
dptr = _getdatasetdriver(raster.dataset)
driverstring = "$(d... | [
4906,
371,
1603,
198,
220,
220,
220,
27039,
3712,
45113,
1847,
27354,
292,
316,
39,
198,
220,
220,
220,
9647,
3712,
34,
600,
198,
220,
220,
220,
6001,
3712,
34,
600,
198,
220,
220,
220,
299,
3903,
3712,
34,
600,
1303,
1271,
286,
3... | 2.035088 | 798 |
@doc """
`push!{T, V}(X::NullableVector{T}, v::V)`
Insert `v` at the end of `X`, which registers `v` as a present value.
""" ->
function Base.push!{T, V}(X::NullableVector{T}, v::V)
push!(X.values, v)
push!(X.isnull, false)
return X
end
@doc """
`push!{T, V}(X::NullableVector{T}, v::Nullable{V})`
Insert ... | [
31,
15390,
37227,
198,
63,
14689,
0,
90,
51,
11,
569,
92,
7,
55,
3712,
35067,
540,
38469,
90,
51,
5512,
410,
3712,
53,
8,
63,
198,
198,
44402,
4600,
85,
63,
379,
262,
886,
286,
4600,
55,
47671,
543,
28441,
4600,
85,
63,
355,
2... | 2.247102 | 4,055 |
<filename>src/device/gcn/hostcall.jl
export HostCall, hostcall!
const SENTINEL_COUNTER = Ref{Int}(2)
const SENTINEL_LOCK = ReentrantLock()
const DEFAULT_HOSTCALL_LATENCY = 0.01
"""
HostCall{S,RT,AT}
GPU-compatible struct for making hostcalls.
"""
struct HostCall{S,RT,AT}
signal::S
host_sentinel::Int
... | [
27,
34345,
29,
10677,
14,
25202,
14,
70,
31522,
14,
4774,
13345,
13,
20362,
198,
39344,
14504,
14134,
11,
2583,
13345,
0,
198,
198,
9979,
311,
3525,
1268,
3698,
62,
34,
19385,
5781,
796,
6524,
90,
5317,
92,
7,
17,
8,
198,
9979,
31... | 2.078431 | 5,559 |
<reponame>pazzo83/QuantLib.jl
# QuantLib Time module
module Time
using Dates
import Dates.adjust
# Date helper funcs
within_next_week(d1::Date, d2::Date) = d2 >= d1 && d2 <= d1 + Dates.Day(7)
within_next_week(t1::Float64, t2::Float64) = t1 <= t2 && t2 <= t1 + (1.0/52.0)
within_previous_week(d1::Date, d2::Date) = d2 ... | [
27,
7856,
261,
480,
29,
79,
8101,
78,
5999,
14,
24915,
25835,
13,
20362,
198,
2,
16972,
25835,
3862,
8265,
198,
21412,
3862,
198,
198,
3500,
44712,
198,
198,
11748,
44712,
13,
23032,
198,
198,
2,
7536,
31904,
1257,
6359,
198,
33479,
... | 2.992687 | 547 |
<filename>src/QuadForm/Basic.jl<gh_stars>0
export ambient_space, rank, gram_matrix, inner_product, involution,
islocal_square, isequivalent, isrationally_equivalent, quadratic_space,
hermitian_space, diagonal, invariants, hasse_invariant, witt_invariant, orthogonal_basis, fixed_field
####################... | [
27,
34345,
29,
10677,
14,
4507,
324,
8479,
14,
26416,
13,
20362,
27,
456,
62,
30783,
29,
15,
198,
39344,
25237,
62,
13200,
11,
4279,
11,
14599,
62,
6759,
8609,
11,
8434,
62,
11167,
11,
1876,
1009,
11,
198,
220,
220,
220,
220,
220,... | 2.389075 | 5,986 |
<filename>src/haversine.jl
"""
Haversine(radius=6_371_000)
The haversine distance between two locations on a sphere of given `radius`, whose
default value is 6,371,000, i.e., the Earth's (volumetric) mean radius in meters; cf.
[NASA's Earth Fact Sheet](https://nssdc.gsfc.nasa.gov/planetary/factsheet/earthfact.html... | [
27,
34345,
29,
10677,
14,
3099,
690,
500,
13,
20362,
198,
37811,
198,
220,
220,
220,
9398,
690,
500,
7,
42172,
28,
21,
62,
38056,
62,
830,
8,
198,
198,
464,
387,
690,
500,
5253,
1022,
734,
7064,
319,
257,
16558,
286,
1813,
4600,
... | 2.341871 | 898 |
# Solver
function check(model::Z3Model)
result = model.ptr[:check]()
if result == z3[:sat]
model.status = :Feasible
elseif result == z3[:unsat]
model.status = :Infeasible
else
model.status = :Unknown
end
return model.status
end
function get_unsat_core(model::Z3Model)
... | [
2,
4294,
332,
198,
8818,
2198,
7,
19849,
3712,
57,
18,
17633,
8,
198,
220,
220,
220,
1255,
796,
2746,
13,
20692,
58,
25,
9122,
60,
3419,
198,
220,
220,
220,
611,
1255,
6624,
1976,
18,
58,
25,
49720,
60,
198,
220,
220,
220,
220,
... | 2.008602 | 930 |
<reponame>Ybakman/Knet.jl<filename>src/ops.jl<gh_stars>0
# The entry format is (cudaname, julianame, kernelcode)
# With single name entries cudaname=julianame and kernelcode=name(xi,yi).
# I commented out functions if I don't know the Julia equivalent.
binary_ops = [
("add","+","xi+yi"),
("sub","-","xi-yi"),
... | [
27,
7856,
261,
480,
29,
56,
65,
461,
805,
14,
42,
3262,
13,
20362,
27,
34345,
29,
10677,
14,
2840,
13,
20362,
27,
456,
62,
30783,
29,
15,
198,
2,
383,
5726,
5794,
318,
357,
66,
463,
272,
480,
11,
474,
377,
666,
480,
11,
9720,
... | 2.106512 | 1,812 |
module GL2017Replication
export hello, domath
export compute_steady_state!,initilize!,aggregate! ,EGM!, compute_distribution!
export calibrate!, calibrate_terminal,load_parameters_iss!
export transition!, EGM_trans!
export ModelGL,TransGL
export describe, print_params,print_status
export plots_figure_1,plots_figure_3... | [
21412,
10188,
5539,
39232,
3299,
628,
198,
39344,
23748,
11,
2401,
776,
198,
39344,
24061,
62,
28044,
88,
62,
5219,
28265,
15003,
346,
1096,
28265,
9460,
49373,
0,
837,
7156,
44,
28265,
24061,
62,
17080,
3890,
0,
198,
39344,
33801,
378,... | 3.183099 | 142 |
export FixedVariablesSet
struct FixedVariablesIdeal{V<:AbstractVariable, T<:Number, MT<:AbstractMonomialLike} <: AbstractPolynomialIdeal
substitutions::Union{Nothing, Dict{V, T}}
end
function Base.convert(::Type{FixedVariablesIdeal{V, T, MT}}, ideal::FixedVariablesIdeal{V, T, MT}) where {V<:AbstractVariable, T<:Nu... | [
39344,
10832,
23907,
2977,
7248,
198,
198,
7249,
10832,
23907,
2977,
7390,
2287,
90,
53,
27,
25,
23839,
43015,
11,
309,
27,
25,
15057,
11,
19308,
27,
25,
23839,
44,
6326,
498,
7594,
92,
1279,
25,
27741,
34220,
26601,
498,
7390,
2287,
... | 2.497852 | 1,862 |
<reponame>sebastian-engel/Flux.jl<filename>src/onehot.jl
import Base: *
struct OneHotVector <: AbstractVector{Bool}
ix::UInt32
of::UInt32
end
Base.size(xs::OneHotVector) = (Int64(xs.of),)
Base.getindex(xs::OneHotVector, i::Integer) = i == xs.ix
Base.getindex(xs::OneHotVector, ::Colon) = OneHotVector(xs.ix, xs.o... | [
27,
7856,
261,
480,
29,
325,
65,
459,
666,
12,
1516,
417,
14,
37,
22564,
13,
20362,
27,
34345,
29,
10677,
14,
505,
8940,
13,
20362,
198,
11748,
7308,
25,
1635,
198,
198,
7249,
1881,
21352,
38469,
1279,
25,
27741,
38469,
90,
33,
97... | 2.46875 | 1,440 |
<gh_stars>1-10
using SimulatedNeuralMoments, Flux, MCMCChains, StatsPlots, DelimitedFiles
using BSON:@save
using BSON:@load
# get the things to define the structure for the model
include("JDlib.jl") # contains the functions for the DSGE model
function main()
lb, ub = PriorSupport()
# fill in the structure that define... | [
27,
456,
62,
30783,
29,
16,
12,
940,
198,
3500,
3184,
4817,
8199,
1523,
29252,
658,
11,
1610,
2821,
11,
13122,
9655,
1925,
1299,
11,
20595,
3646,
1747,
11,
4216,
320,
863,
25876,
198,
3500,
347,
11782,
25,
31,
21928,
198,
3500,
347,... | 3.078091 | 461 |
using CSV, DataFrames, Distributed, Dates, LinearAlgebra, Jevo, Distributions, DelimitedFiles
using SharedArrays, TimerOutputs
# Get date to append to output file
date = Dates.format(Dates.today(), "yyyy_mm_dd")
# Get number of workers
if length(ARGS) == 1
addprocs(parse(Int64, ARGS[1]))
elseif length(ARGS) > 1
... | [
3500,
44189,
11,
6060,
35439,
11,
4307,
6169,
11,
44712,
11,
44800,
2348,
29230,
11,
449,
1990,
78,
11,
46567,
507,
11,
4216,
320,
863,
25876,
198,
3500,
39403,
3163,
20477,
11,
5045,
263,
26410,
82,
198,
2,
3497,
3128,
284,
24443,
... | 2.089286 | 1,232 |
# Licensed to the Apache Software Foundation (ASF) under one
# or more contributor license agreements. See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership. The ASF licenses this file
# to you under the Apache License, Version 2.0 (the
# "License"); you may not u... | [
2,
49962,
284,
262,
24843,
10442,
5693,
357,
1921,
37,
8,
739,
530,
198,
2,
393,
517,
18920,
5964,
11704,
13,
220,
4091,
262,
28536,
2393,
198,
2,
9387,
351,
428,
670,
329,
3224,
1321,
198,
2,
5115,
6634,
9238,
13,
220,
383,
7054,... | 2.918294 | 1,383 |
<filename>test/integration/devtools/jl_hot_reload/jldvhr002_hot_restart.jl
using Dash
app = dash()
app.layout = html_div(id="before-reload-content") do
html_h3("Hot restart"),
dcc_input(id="input", value="initial"),
html_div(id="output")
end
callback!(app, Output("output","children"), Input("input","value... | [
27,
34345,
29,
9288,
14,
18908,
1358,
14,
7959,
31391,
14,
20362,
62,
8940,
62,
260,
2220,
14,
73,
335,
85,
11840,
21601,
62,
8940,
62,
2118,
433,
13,
20362,
198,
3500,
16189,
198,
198,
1324,
796,
14470,
3419,
198,
1324,
13,
39786,
... | 2.34728 | 239 |
# using Dates
# using DelimitedFiles
# using CSV
# using Plots
using Dates
#calculates the potential Evaporation based on the equation by Hargreaves-Samani
function epot_hargreaves(Temp_min::Float64, Temp::Float64, Temp_max::Float64, KT::Float64, Radiation::Float64)
#Radiation in mm/day
# KT 0.162 for interio... | [
2,
1262,
44712,
198,
2,
1262,
4216,
320,
863,
25876,
198,
2,
1262,
44189,
198,
2,
1262,
1345,
1747,
198,
3500,
44712,
198,
198,
2,
9948,
3129,
689,
262,
2785,
4319,
499,
6944,
1912,
319,
262,
16022,
416,
367,
853,
260,
3080,
12,
1... | 2.563278 | 2,892 |
<filename>examples/Kernel.jl
# In this example, we write a simple method to speed up the matrix-vector
# product of a matrix defined by sampling an asymptotically
# smooth kernel such as:
#
# K(x-y) ∼ (x-y)^α as x-y → ∞.
#
# The kernel is sampled through two vectors x and y:
#
# K(x_i-y_j), for 1 ≤ i,j ≤ N
#
# Exampl... | [
27,
34345,
29,
1069,
12629,
14,
42,
7948,
13,
20362,
198,
2,
554,
428,
1672,
11,
356,
3551,
257,
2829,
2446,
284,
2866,
510,
262,
17593,
12,
31364,
198,
2,
1720,
286,
257,
17593,
5447,
416,
19232,
281,
355,
4948,
457,
313,
1146,
1... | 2.203877 | 1,496 |
<reponame>JuliaPackageMirrors/Robotlib.jl
using Robotlib
h = 0.004032;
dh = DHYuMi()
xi = DH2twistsPOE(dh)
pathopen = "/work/fredrikb/extRosetta/base2rob2xyz.csv"
pathsave = "/tmp/fredrikb/log.mat"
data = orcalog2mat(pathopen, pathsave)
data = readmat(pathsave)
ds = 1
q = getData("robot_1.*posRawAb... | [
27,
7856,
261,
480,
29,
16980,
544,
27813,
27453,
5965,
14,
14350,
313,
8019,
13,
20362,
198,
3500,
16071,
8019,
198,
71,
796,
657,
13,
405,
1821,
2624,
26,
628,
198,
34985,
796,
23809,
40728,
41541,
3419,
198,
29992,
796,
23809,
17,
... | 1.760148 | 542 |
<gh_stars>0
# primer81.jl
# inicjalizujemo podatke u grafu
include("labyrinth.jl")
include("primer81BFS.jl")
nbRows = 5;
nbColumns = 5;
G = emptyLabyrinth(nbRows, nbColumns)
defineNodesType!(G,[1 2 3 5 6 8 10 11 12 13 14 15 17 21 22 23 24 25],'P'); #PUT
defineNodesType!(G, [4 7 9 16 18 19 20], 'Z'); #ZID ... | [
27,
456,
62,
30783,
29,
15,
198,
2,
33270,
6659,
13,
20362,
201,
198,
2,
287,
291,
73,
282,
528,
23577,
41903,
24573,
265,
365,
334,
7933,
20942,
201,
198,
17256,
7203,
23912,
21324,
13,
20362,
4943,
201,
198,
17256,
7203,
19795,
26... | 2.28481 | 316 |
#!/usr/bin/env julia
using Pkg
using MPI
using Documenter
using ICI_simulateur: Parallelisation, City, Population, Simulateur, Save
######################## Calcul du temps reel ##################################
deb = time() ;
################################################################################
| [
2,
48443,
14629,
14,
8800,
14,
24330,
474,
43640,
198,
198,
3500,
350,
10025,
198,
3500,
4904,
40,
198,
3500,
16854,
263,
220,
198,
3500,
12460,
40,
62,
14323,
5039,
333,
25,
42945,
5612,
11,
2254,
11,
20133,
11,
3184,
5039,
333,
11... | 4.57971 | 69 |
__precompile__()
"""
This is a package I use to handle numerical-model parameters,
thus the name. However, it should be useful otherwise too.
It has two main features:
- keyword type constructors with default values, and
- unpacking and packing of composite types and dicts.
The macro `@with_kw` which decorates a type... | [
834,
3866,
5589,
576,
834,
3419,
198,
198,
37811,
198,
1212,
318,
257,
5301,
314,
779,
284,
5412,
29052,
12,
19849,
10007,
11,
198,
26239,
262,
1438,
13,
2102,
11,
340,
815,
307,
4465,
4306,
1165,
13,
198,
1026,
468,
734,
1388,
3033... | 2.113228 | 9,344 |
# SPGL
export spgl1, project, SpotFunForward, snr
"""
# INFO
Use:
x, r, g, info = spgl1(A::AbstractArray, b::AbstractVector{ETb};
x::AbstractVector{ETx}=Array{ETb,1}(),
tau::AbstractFloat=NaN,
sigma::AbstractFloat=NaN,
... | [
2,
6226,
8763,
198,
198,
39344,
599,
4743,
16,
11,
1628,
11,
15899,
24629,
39746,
11,
3013,
81,
198,
198,
37811,
198,
2,
24890,
220,
198,
220,
220,
220,
5765,
25,
198,
220,
220,
220,
220,
220,
220,
220,
2124,
11,
374,
11,
308,
1... | 2.140653 | 10,046 |
<reponame>tpgillam/advent_2021
using Statistics
include("common.jl")
example = "16,1,2,0,4,2,7,1,2,14"
get_locations(input::AbstractString) = map(x -> parse(Int64, x), split(input, ","))
fuel_cost(locations::AbstractVector{Int64}, x::Real) = sum(abs.(locations .- x))
function get_best_cost(locations::AbstractVecto... | [
27,
7856,
261,
480,
29,
83,
6024,
359,
321,
14,
324,
1151,
62,
1238,
2481,
198,
3500,
14370,
198,
198,
17256,
7203,
11321,
13,
20362,
4943,
198,
198,
20688,
796,
366,
1433,
11,
16,
11,
17,
11,
15,
11,
19,
11,
17,
11,
22,
11,
1... | 2.467961 | 515 |
using Combinatorics
const data = parse.(Int, readlines())
function solve_1()
n = 150
dp = fill(0, (n + 1,))
dp[1] = 1
for d in data
for i in n+1:-1:1
if i+d <= n+1
dp[i+d] += dp[i]
end
end
end
dp[end]
end
function solve_2()
n = 150
... | [
3500,
955,
8800,
1352,
873,
198,
198,
9979,
1366,
796,
21136,
12195,
5317,
11,
1100,
6615,
28955,
198,
198,
8818,
8494,
62,
16,
3419,
198,
220,
220,
220,
299,
796,
6640,
198,
220,
220,
220,
288,
79,
796,
6070,
7,
15,
11,
357,
77,
... | 1.589074 | 421 |
<filename>test/test-amrvw-basics.jl
using Test
import AMRVW
const A = AMRVW
using LinearAlgebra
# test polynomials
p4 = [24.0, -50.0, 35.0, -10.0, 1.0]
p5 = [-120.0, 274.0, -225.0, 85.0, -15.0, 1.0]
p6 = [720.0, -1764.0, 1624.0, -735.0, 175.0, -21.0, 1.0]
pc = [0.0 + 1.0im, -1.0 + 0.0im, 0.0 + 0.0im, 0.0 + 0.0im, 0.0... | [
27,
34345,
29,
9288,
14,
9288,
12,
321,
81,
85,
86,
12,
12093,
873,
13,
20362,
198,
3500,
6208,
198,
11748,
3001,
49,
30133,
198,
9979,
317,
796,
3001,
49,
30133,
198,
3500,
44800,
2348,
29230,
628,
198,
2,
1332,
745,
6213,
296,
8... | 1.656659 | 4,663 |
<reponame>Hua-Zhou/PolrGWAS
__precompile__()
module OrdinalGWAS
using LinearAlgebra
using CSV, DataFrames, Distributions, Reexport
using SnpArrays, VCFTools, VariantCallFormat, BGEN
using MathOptInterface
const MOI = MathOptInterface
@reexport using OrdinalMultinomialModels
export ordinalgwas
include("gwas.jl")
en... | [
27,
7856,
261,
480,
29,
39,
6413,
12,
57,
15710,
14,
8017,
81,
33191,
1921,
198,
834,
3866,
5589,
576,
834,
3419,
198,
198,
21412,
14230,
1292,
33191,
1921,
198,
198,
3500,
44800,
2348,
29230,
198,
3500,
44189,
11,
6060,
35439,
11,
... | 2.927273 | 110 |
<reponame>CGRG-lab/FileTools.jl<gh_stars>0
"""
`movefiles(flist::Vector, newdir::AbstractString)` move all items in `flist`to the `newdir` directory, preseving their original names.
"""
function movefiles(flist::Vector, newdir::AbstractString)
for item in flist
newpath = joinpath(newdir, basename(item))
... | [
27,
7856,
261,
480,
29,
34,
10761,
38,
12,
23912,
14,
8979,
33637,
13,
20362,
27,
456,
62,
30783,
29,
15,
198,
198,
37811,
198,
63,
21084,
16624,
7,
2704,
396,
3712,
38469,
11,
649,
15908,
3712,
23839,
10100,
8,
63,
1445,
477,
370... | 2.610294 | 136 |
export FiniteOperator
struct FiniteOperator{AT<:AbstractMatrix,T<:Number,DS,RS} <: Operator{T}
matrix::AT
domainspace::DS
rangespace::RS
end
FiniteOperator(M::AbstractMatrix{<:Number},ds::Space,rs::Space) =
FiniteOperator{typeof(M),eltype(M),typeof(ds),typeof(rs)}(M,ds,rs)
FiniteOperator(M::Abstr... | [
39344,
4463,
578,
18843,
1352,
628,
628,
198,
7249,
4463,
578,
18843,
1352,
90,
1404,
27,
25,
23839,
46912,
11,
51,
27,
25,
15057,
11,
5258,
11,
6998,
92,
1279,
25,
35946,
90,
51,
92,
198,
220,
220,
220,
17593,
3712,
1404,
198,
22... | 2.209059 | 861 |
<gh_stars>10-100
abstract type LinearSolver end
# residual
function r!(r, z, θ, κ)
@warn "residual not defined"
nothing
end
# residual Jacobian wrt z
function rz!(rz, z, θ)
@warn "residual Jacobian wrt z not defined"
nothing
end
# residual Jacobian wrt θ
function rθ!(rθ, z, θ)
@warn "residual Jac... | [
27,
456,
62,
30783,
29,
940,
12,
3064,
198,
397,
8709,
2099,
44800,
50,
14375,
886,
198,
198,
2,
29598,
198,
8818,
374,
0,
7,
81,
11,
1976,
11,
7377,
116,
11,
7377,
118,
8,
198,
220,
220,
220,
2488,
40539,
366,
411,
312,
723,
... | 1.802304 | 4,254 |
<reponame>nathanaelbosch/ProbNumDiffEq.jl
using ProbNumDiffEq
using Test
using Plots
using LinearAlgebra
using OrdinaryDiffEq
using Statistics
using DiffEqProblemLibrary.ODEProblemLibrary: importodeproblems;
importodeproblems();
import DiffEqProblemLibrary.ODEProblemLibrary:
prob_ode_linear, prob_ode_2Dlinear, prob... | [
27,
7856,
261,
480,
29,
77,
776,
2271,
417,
39565,
354,
14,
2964,
65,
33111,
28813,
36,
80,
13,
20362,
198,
3500,
30873,
33111,
28813,
36,
80,
198,
3500,
6208,
198,
3500,
1345,
1747,
198,
3500,
44800,
2348,
29230,
198,
3500,
14230,
... | 2.063341 | 1,784 |
<filename>test/runtests.jl
using SafeTestsets, Test
files = [
"multivariate_normal_tests.jl",
"blocking_tests.jl",
"optimization_tests.jl",
"utility_tests.jl"
]
for f in files
include(f)
end
@safetestset "gaussian tests" begin
include("gaussian_tests.jl")
end
@safetestset "lognormal race tes... | [
27,
34345,
29,
9288,
14,
81,
2797,
3558,
13,
20362,
198,
3500,
19978,
51,
3558,
1039,
11,
6208,
198,
198,
16624,
796,
685,
198,
220,
220,
220,
366,
16680,
42524,
62,
11265,
62,
41989,
13,
20362,
1600,
198,
220,
220,
220,
366,
41938,... | 2.463576 | 151 |
module BatchUtils
using ...Concepts
abstract type BatchingStrategy end
abstract type SequentialScan <: BatchingStrategy end
abstract type SampleWithReplacement <: BatchingStrategy end
abstract type SampleWithoutReplacement <: BatchingStrategy end
export BatchFactory,
next,
reset,
has_next,
init... | [
21412,
347,
963,
18274,
4487,
198,
198,
3500,
2644,
3103,
984,
82,
198,
198,
397,
8709,
2099,
347,
19775,
13290,
4338,
886,
198,
397,
8709,
2099,
24604,
1843,
33351,
220,
220,
220,
220,
220,
220,
220,
220,
220,
220,
1279,
25,
347,
1... | 2.683673 | 490 |
using Test
using StatsBase
using CircleFit
@testset "Analytic Fits" begin
@testset "Pratt" begin
include("pratt.jl")
end
@testset "Taubin" begin
include("taubin.jl")
end
@testset "Kasa" begin
include("kasa.jl")
end
@testset "GRAF" begin
include("graf.jl")
... | [
3500,
6208,
198,
3500,
20595,
14881,
198,
3500,
16291,
31805,
628,
198,
31,
9288,
2617,
366,
37702,
13370,
376,
896,
1,
2221,
198,
220,
220,
220,
2488,
9288,
2617,
366,
6836,
1078,
1,
2221,
198,
220,
220,
220,
220,
220,
220,
220,
22... | 2.180791 | 177 |
## from Juno
# Super-simple pandoc interface.
function pandoc(infn, infmt::AbstractString, outfmt::AbstractString, args::AbstractString...)
cmd = String["pandoc",
"--from=$(infmt)",
"--to=$(outfmt)"]
for arg in args
push!(cmd, arg)
end
read(pipeline(in... | [
2235,
422,
49458,
198,
198,
2,
3115,
12,
36439,
19798,
420,
7071,
13,
198,
8818,
19798,
420,
7,
10745,
77,
11,
1167,
16762,
3712,
23839,
10100,
11,
503,
69,
16762,
3712,
23839,
10100,
11,
26498,
3712,
23839,
10100,
23029,
198,
220,
22... | 2.215613 | 269 |
export get_invite,
delete_invite
"""
get_invite(c::Client, invite::AbstractString; kwargs...} -> Invite
Get an [`Invite`](@ref) to a [`Guild`](@ref).
More details [here](https://discordapp.com/developers/docs/resources/invite#get-invite).
"""
get_invite(c::Client, invite::AbstractString; kwargs...) = Response... | [
39344,
651,
62,
16340,
578,
11,
198,
220,
220,
220,
12233,
62,
16340,
578,
198,
198,
37811,
198,
220,
220,
220,
651,
62,
16340,
578,
7,
66,
3712,
11792,
11,
14037,
3712,
23839,
10100,
26,
479,
86,
22046,
986,
92,
4613,
10001,
578,
... | 2.603524 | 227 |
using SupplyChainOptimization
function parse_simple_data(file_name)
lines = readlines(file_name)
m = match(r"(?<facility_count>\d+)\s+(?<customer_count>\d+)\s+0", lines[2])
facility_count = parse(Int, m[:facility_count])
customer_count = parse(Int, m[:customer_count])
sc = SupplyChain()
produc... | [
3500,
22663,
35491,
27871,
320,
1634,
198,
198,
8818,
21136,
62,
36439,
62,
7890,
7,
7753,
62,
3672,
8,
198,
220,
220,
220,
3951,
796,
1100,
6615,
7,
7753,
62,
3672,
8,
198,
220,
220,
220,
285,
796,
2872,
7,
81,
18109,
30,
27,
3... | 2.339693 | 1,887 |
# ---------------------------------------------------------------------------- #
#
# divido.jl
#
# Mesh data structures for FEM and lattice structures
#
# divido
# Fall 2017 / Spring 2018
#
# <NAME>
#
# ---------------------------------------------------------------------------- #
__precompile__()
"""
d... | [
2,
16529,
10541,
1303,
198,
2,
198,
2,
220,
220,
13576,
78,
13,
20362,
198,
2,
198,
2,
220,
220,
47529,
1366,
8573,
329,
376,
3620,
290,
47240,
501,
8573,
198,
2,
198,
2,
220,
220,
13576,
78,
198,
2,
220,
220,
7218,
2177,
1220,
... | 3.09322 | 236 |
<filename>src/layer/tconv2d.jl
module TConv2DM
include("../tools/glorotuniform.jl")
using .GlorotUniform
using LoopVectorization
mutable struct TConv2D
save_layer::Any
load_layer::Any
activate::Any
initialize::Any
update::Any
input_shape::Tup... | [
27,
34345,
29,
10677,
14,
29289,
14,
83,
42946,
17,
67,
13,
20362,
198,
21412,
309,
3103,
85,
17,
23127,
201,
198,
220,
220,
220,
2291,
7203,
40720,
31391,
14,
70,
4685,
313,
403,
6933,
13,
20362,
4943,
201,
198,
220,
220,
220,
12... | 1.808918 | 5,584 |
<filename>test/test_patterns.jl
module TestPatterns
using Test
using ReTest: and, or, not, interpolated, reachable, depth, pass, fail, iter
import ReTest
struct MockTestset
id
marks
parent
iter
MockTestset() = new(rand(1:typemax(Int)), ReTest.Marks(), nothing, 1)
end
ReTest.tsdepth(::MockTestset... | [
27,
34345,
29,
9288,
14,
9288,
62,
33279,
82,
13,
20362,
198,
21412,
6208,
47546,
82,
198,
3500,
6208,
198,
198,
3500,
797,
14402,
25,
290,
11,
393,
11,
407,
11,
39555,
515,
11,
3151,
540,
11,
6795,
11,
1208,
11,
2038,
11,
11629,
... | 1.842216 | 1,426 |
<reponame>TemplierPaul/juNEAT.jl<filename>src/species.jl
export Species, add!, renew!, belongs_to_species, find_species!, compute_fitness_mean!, compute_fitness_max!
mutable struct Species
id::Int64
age::Int64
members::Array{NEATIndiv}
previous_members::Array{NEATIndiv}
dist_threshold::Float64
... | [
27,
7856,
261,
480,
29,
12966,
489,
959,
12041,
14,
14396,
12161,
1404,
13,
20362,
27,
34345,
29,
10677,
14,
35448,
13,
20362,
198,
39344,
28540,
11,
751,
28265,
6931,
28265,
14448,
62,
1462,
62,
35448,
11,
1064,
62,
35448,
28265,
240... | 2.352587 | 1,662 |
<filename>src/intervals/special.jl
# This file is part of the IntervalArithmetic.jl package; MIT licensed
## Definitions of special intervals and associated functions
## Empty interval:
"""`emptyinterval`s are represented as the interval [∞, -∞]; note
that this interval is an exception to the fact that the lower boun... | [
27,
34345,
29,
10677,
14,
3849,
12786,
14,
20887,
13,
20362,
198,
2,
770,
2393,
318,
636,
286,
262,
4225,
2100,
3163,
29848,
13,
20362,
5301,
26,
17168,
11971,
198,
198,
2235,
45205,
286,
2041,
20016,
290,
3917,
5499,
198,
198,
2235,
... | 2.800199 | 1,006 |
const wall_rebound = [
v -> v[1] == 1 ? - rot * v : rot * v,
v -> v[2] == 1 ? - rot * v : rot * v,
v -> v[2] == -1 ? rot * v : - rot * v,
v -> v[2] == -1 ? - rot * v : rot * v ]
function step!(sq :: SquareParticles, pc, bc)
n = sq.n
ϵ = sq.ϵ
tempsp, i1, i2 = dt_min_position(pc)... | [
9979,
3355,
62,
260,
7784,
796,
685,
198,
220,
220,
220,
410,
4613,
410,
58,
16,
60,
6624,
220,
352,
5633,
532,
5724,
1635,
410,
1058,
220,
220,
5724,
1635,
410,
11,
198,
220,
220,
220,
410,
4613,
410,
58,
17,
60,
6624,
220,
352... | 1.547064 | 1,073 |
<reponame>martinbiel/ProgressiveHedgingSolvers.jl
struct SerialExecution{T <: AbstractFloat,
A <: AbstractVector,
S <: LQSolver} <: AbstractExecution
subproblems::Vector{SubProblem{T,A,S}}
function SerialExecution(::Type{T}, ::Type{A}, ::Type{S}) where {T <: Abstra... | [
27,
7856,
261,
480,
29,
13822,
259,
65,
8207,
14,
2964,
19741,
39,
276,
2667,
36949,
690,
13,
20362,
198,
7249,
23283,
23002,
1009,
90,
51,
1279,
25,
27741,
43879,
11,
198,
220,
220,
220,
220,
220,
220,
220,
220,
220,
220,
220,
22... | 2.250692 | 1,807 |
<reponame>ascheinb/Oceananigans.jl
using Test
using Printf
using Random
using Statistics
using LinearAlgebra
using Logging
using CUDA
using JLD2
using FFTW
using OffsetArrays
using SeawaterPolynomials
using Oceananigans
using Oceananigans.Architectures
using Oceananigans.Grids
using Oceananigans.Operators
using Ocean... | [
27,
7856,
261,
480,
29,
292,
2395,
259,
65,
14,
46607,
272,
34090,
13,
20362,
198,
3500,
6208,
198,
3500,
12578,
69,
198,
3500,
14534,
198,
3500,
14370,
198,
3500,
44800,
2348,
29230,
198,
3500,
5972,
2667,
198,
198,
3500,
29369,
5631... | 2.453387 | 1,491 |
# an AbstractIndex is a thing that can be used to look up ordered things by name, but that
# will also accept a position or set of positions or range or other things and pass them
# through cleanly.
abstract type AbstractIndex end
struct Index <: AbstractIndex # an OrderedDict would be nice here...
lookup::Dict{... | [
2,
281,
27741,
15732,
318,
257,
1517,
326,
460,
307,
973,
284,
804,
510,
6149,
1243,
416,
1438,
11,
475,
326,
198,
2,
481,
635,
2453,
257,
2292,
393,
900,
286,
6116,
393,
2837,
393,
584,
1243,
290,
1208,
606,
198,
2,
832,
3424,
... | 2.380237 | 3,127 |
validate(square) = (square < 1 || square > 64) && throw(DomainError("Invalid square"))
"""Calculate the number of grains on square `square`."""
function on_square(square)
validate(square)
Int128(2)^(square-1)
end
"""Calculate the total number of grains after square `square`."""
function total_after(square)
... | [
12102,
378,
7,
23415,
8,
796,
357,
23415,
1279,
352,
8614,
6616,
1875,
5598,
8,
11405,
3714,
7,
43961,
12331,
7203,
44651,
6616,
48774,
198,
198,
37811,
9771,
3129,
378,
262,
1271,
286,
21824,
319,
6616,
4600,
23415,
63,
526,
15931,
1... | 2.944 | 125 |
# This file was generated, do not modify it. # hide
surrogate = Deterministic()
mach = machine(surrogate, Xs, ys; predict=ŷ)
fit!(mach)
predict(mach, X[test[1:5], :]) | [
2,
770,
2393,
373,
7560,
11,
466,
407,
13096,
340,
13,
1303,
7808,
198,
11793,
3828,
378,
796,
45559,
49228,
3419,
198,
76,
620,
796,
4572,
7,
11793,
3828,
378,
11,
1395,
82,
11,
331,
82,
26,
4331,
28,
88,
136,
224,
8,
198,
198,... | 2.470588 | 68 |
<filename>deps/build.jl
using BinaryProvider # requires BinaryProvider 0.3.0 or later
dependencies = [
"build_Zlib.v1.2.11.jl",
"build_libpng.v1.0.0.jl",
"build_libjpeg.v9.0.0-b.jl",
"build_libtiff.v4.0.9.jl"
]
for elem in dependencies
# it's a bit faster to run the build in an anonymous module i... | [
27,
34345,
29,
10378,
82,
14,
11249,
13,
20362,
198,
3500,
45755,
29495,
1303,
4433,
45755,
29495,
657,
13,
18,
13,
15,
393,
1568,
628,
198,
45841,
3976,
796,
685,
198,
220,
220,
220,
366,
11249,
62,
57,
8019,
13,
85,
16,
13,
17,
... | 2.229762 | 2,063 |
@testset "indexing" begin
@on_device threadIdx().x
@on_device blockDim().x
@on_device blockIdx().x
@on_device gridDim().x
@on_device threadIdx().y
@on_device blockDim().y
@on_device blockIdx().y
@on_device gridDim().y
@on_device threadIdx().z
@on_device blockDim().z
@on_dev... | [
31,
9288,
2617,
366,
9630,
278,
1,
2221,
198,
220,
220,
220,
2488,
261,
62,
25202,
4704,
7390,
87,
22446,
87,
198,
220,
220,
220,
2488,
261,
62,
25202,
2512,
29271,
22446,
87,
198,
220,
220,
220,
2488,
261,
62,
25202,
2512,
7390,
... | 2.043867 | 3,693 |
export ExtensionCost_Constant,
ExtensionCost_Zero
# -------------------------------------------
# Extension
# -------------------------------------------
@inline dflow!(::AbstractExtensionCost, args...) = nothing
@inline flowdψ(::AbstractExtensionCost, args...) = 0.0
"No extension cost"
struct ExtensionCost_Zero... | [
39344,
27995,
13729,
62,
3103,
18797,
11,
198,
220,
220,
220,
27995,
13729,
62,
28667,
198,
198,
2,
20368,
32284,
198,
2,
27995,
198,
2,
20368,
32284,
198,
198,
31,
45145,
288,
11125,
0,
7,
3712,
23839,
11627,
3004,
13729,
11,
26498,
... | 2.614365 | 905 |
<filename>test/types.jl<gh_stars>0
using AssemblyCalculus: Neuron, empty_synapses, num_synapses
using AssemblyCalculus: NeuralArea, num_neurons, random_firing!, winners!, change_in_assembly
using AssemblyCalculus: Stimulus, rand_stim, zero_stim
using AssemblyCalculus: getneuron, globalindex, select, neuron_attrib_graph... | [
27,
34345,
29,
9288,
14,
19199,
13,
20362,
27,
456,
62,
30783,
29,
15,
198,
3500,
10006,
9771,
17576,
25,
3169,
44372,
11,
6565,
62,
28869,
45903,
11,
997,
62,
28869,
45903,
198,
3500,
10006,
9771,
17576,
25,
47986,
30547,
11,
997,
... | 1.975995 | 5,124 |
<gh_stars>0
module GLU
#Autogenerated, hopefully stays that way!
import GetC.@getCFun
const libGLU = @windows? "glu32" : "libGLU"
typealias GLenum Cuint
typealias GLboolean Cuchar
typealias GLbitfield Cuint
typealias GLvoid Void
typealias GLbyte Cuchar
typealias GLshort Cshort
typealias GLint Cint
typealias GLubyte ... | [
27,
456,
62,
30783,
29,
15,
198,
21412,
10188,
52,
198,
2,
16541,
519,
877,
515,
11,
11481,
14768,
326,
835,
0,
198,
198,
11748,
3497,
34,
13,
31,
1136,
22495,
403,
198,
198,
9979,
9195,
8763,
52,
796,
2488,
28457,
30,
366,
70,
... | 2.030034 | 7,891 |
<reponame>ssikdar1/DrWatson.jl
export savename, @savename, @dict, @ntuple, @strdict, parse_savename
export ntuple2dict, dict2ntuple
"""
savename([prefix,], c [, suffix]; kwargs...)
Create a shorthand name, commonly used for saving a file or as a figure title,
based on the
parameters in the container `c` (`Dict`, `... | [
27,
7856,
261,
480,
29,
824,
1134,
27455,
16,
14,
6187,
54,
13506,
13,
20362,
198,
39344,
473,
574,
480,
11,
2488,
82,
4005,
480,
11,
2488,
11600,
11,
2488,
429,
29291,
11,
2488,
2536,
11600,
11,
21136,
62,
82,
4005,
480,
198,
393... | 2.640884 | 5,973 |
workspace()
using PDFParser
function add!(dict, value)
if haskey(dict, value)
dict[value] += 1
else
dict[value] = 1
end
end
function test()
root = "C:/Users/hshindo/Dropbox/research/pdfparsing/data/pmc"
dicts = Dict{String,Dict{String,Int}}()
for dir in readdir(root)
pr... | [
5225,
10223,
3419,
198,
3500,
14340,
5837,
28198,
198,
198,
8818,
751,
0,
7,
11600,
11,
1988,
8,
198,
220,
220,
220,
611,
468,
2539,
7,
11600,
11,
1988,
8,
198,
220,
220,
220,
220,
220,
220,
220,
8633,
58,
8367,
60,
15853,
352,
... | 1.657296 | 747 |
__precompile__()
"""
MMD Kernels
"""
module Kernels
export expect, RBFKernel, loss
abstract type AbstractKernel end
struct RBFKernel <: AbstractKernel
sigmas::Vector{Float64}
matrix::Matrix{Float64}
end
function RBFKernel(nqubits::Int, sigmas::Vector{Float64}, isbinary::Bool)
basis = collect(0:(1<<... | [
834,
3866,
5589,
576,
834,
3419,
198,
198,
37811,
198,
220,
220,
220,
337,
12740,
509,
44930,
198,
37811,
198,
21412,
509,
44930,
198,
198,
39344,
1607,
11,
17986,
26236,
7948,
11,
2994,
198,
198,
397,
8709,
2099,
27741,
42,
7948,
886... | 2.371608 | 479 |
<filename>script/3_PowerSimulations_examples/10_market_bid_cost.jl
#jl #! format: off
# # Time-varying bid problems with [PowerSimulations.jl](https://github.com/NREL-SIIP/PowerSimulations.jl)
# **Originally Contributed by**: <NAME>
# ## Introduction
# PowerSimulations.jl supports the construction of Operations prob... | [
27,
34345,
29,
12048,
14,
18,
62,
13434,
8890,
5768,
62,
1069,
12629,
14,
940,
62,
10728,
62,
14065,
62,
15805,
13,
20362,
198,
2,
20362,
1303,
0,
5794,
25,
572,
198,
2,
1303,
3862,
12,
85,
560,
278,
8406,
2761,
351,
685,
13434,
... | 3.290832 | 949 |
### A Pluto.jl notebook ###
# v0.14.5
using Markdown
using InteractiveUtils
# ╔═╡ 54e259b0-23ba-4605-8236-c8ff05889aba
using Plots
# ╔═╡ 9d4250e3-4b5d-4af7-86b7-57da81bda6d4
using BenchmarkTools
# ╔═╡ 7d206253-167e-42e0-9181-3cfe94a83b43
using QuadGK
# ╔═╡ eaa38687-7ffc-487d-9f55-e671939ec4f4
# ╔═╡ 29c80c8a-afa1... | [
21017,
317,
32217,
13,
20362,
20922,
44386,
198,
2,
410,
15,
13,
1415,
13,
20,
198,
198,
3500,
2940,
2902,
198,
3500,
21365,
18274,
4487,
198,
198,
2,
2343,
243,
242,
28670,
22880,
94,
7175,
68,
25191,
65,
15,
12,
1954,
7012,
12,
... | 1.993641 | 4,875 |
"""
Handles Ajax communication logic.
"""
module WebThreads
import HTTP, Distributed, Logging, Dates
import Genie, Genie.Renderer
const MESSAGE_QUEUE = Dict{UInt,Vector{String}}()
const ClientId = UInt # session id
const ChannelName = String
mutable struct ChannelClient
client::UInt
channels::Vector{ChannelNam... | [
37811,
198,
12885,
829,
46362,
6946,
9156,
13,
198,
37811,
198,
21412,
5313,
16818,
82,
198,
198,
11748,
14626,
11,
4307,
6169,
11,
5972,
2667,
11,
44712,
198,
11748,
49405,
11,
49405,
13,
49,
437,
11882,
628,
198,
9979,
337,
1546,
40... | 3.011547 | 2,598 |
# Tests for Revenue Russell DEA Models
@testset "RevenueRussellDEAModel" begin
# Test using Book data
X = [1; 1; 1; 1; 1; 1; 1; 1];
Y = [7 7; 4 8; 8 4; 3 5; 3 3; 8 2; 6 4; 1.5 5];
P = [1 1; 1 1; 1 1; 1 1; 1 1; 1 1; 1 1; 1 1];
# Revenue Russell
revenuerddf = dearevenuerddf(X, Y, P, :ERG)
@... | [
2,
30307,
329,
20197,
11563,
28647,
32329,
198,
31,
9288,
2617,
366,
3041,
4080,
46325,
7206,
2390,
375,
417,
1,
2221,
628,
220,
220,
220,
1303,
6208,
1262,
4897,
1366,
198,
220,
220,
220,
1395,
796,
685,
16,
26,
352,
26,
352,
26,
... | 2.155445 | 1,203 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.