hexsha stringlengths 40 40 | size int64 38 969k | ext stringclasses 1
value | lang stringclasses 1
value | max_stars_repo_path stringlengths 4 106 | max_stars_repo_name stringlengths 8 104 | max_stars_repo_head_hexsha stringlengths 40 40 | max_stars_repo_licenses listlengths 1 4 | max_stars_count int64 1 38.8k ⌀ | max_stars_repo_stars_event_min_datetime stringlengths 24 24 ⌀ | max_stars_repo_stars_event_max_datetime stringlengths 24 24 ⌀ | max_issues_repo_path stringlengths 4 106 | max_issues_repo_name stringlengths 8 104 | max_issues_repo_head_hexsha stringlengths 40 40 | max_issues_repo_licenses listlengths 1 4 | max_issues_count int64 1 53.3k ⌀ | max_issues_repo_issues_event_min_datetime stringlengths 24 24 ⌀ | max_issues_repo_issues_event_max_datetime stringlengths 24 24 ⌀ | max_forks_repo_path stringlengths 4 106 | max_forks_repo_name stringlengths 8 104 | max_forks_repo_head_hexsha stringlengths 40 40 | max_forks_repo_licenses listlengths 1 4 | max_forks_count int64 1 6.24k ⌀ | max_forks_repo_forks_event_min_datetime stringlengths 24 24 ⌀ | max_forks_repo_forks_event_max_datetime stringlengths 24 24 ⌀ | content stringlengths 38 969k | avg_line_length float64 6.33 6.5k | max_line_length int64 15 269k | alphanum_fraction float64 0.18 0.91 | test_functions listlengths 1 212 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
f7005682f45127ca851469ce7a4ea680c9da5dc4 | 49 | jl | Julia | AE/test/runtests.jl | foldfelis/ML101.jl | b4b217ac4af88ba460ec26c5c8a1ce322edae64a | [
"MIT"
] | 6 | 2021-02-23T05:48:18.000Z | 2021-02-23T11:52:24.000Z | AE/test/runtests.jl | foldfelis/ML101.jl | b4b217ac4af88ba460ec26c5c8a1ce322edae64a | [
"MIT"
] | 5 | 2021-02-22T21:59:07.000Z | 2021-05-05T07:29:55.000Z | AE/test/runtests.jl | foldfelis/ML101.jl | b4b217ac4af88ba460ec26c5c8a1ce322edae64a | [
"MIT"
] | 1 | 2021-02-28T07:04:06.000Z | 2021-02-28T07:04:06.000Z | using AE
using Test
@testset "AE.jl" begin
end
| 7 | 22 | 0.714286 | [
"@testset \"AE.jl\" begin\n\nend"
] |
f702b1e015efb351ee28034b390c3e7d1c8857bc | 7,933 | jl | Julia | src/OrthoPolynomials.jl | OpenLibMathSeq/Sequences | e53c1f30b7bf81669805f21d408d407b727615b5 | [
"MIT"
] | 6 | 2019-06-25T08:54:44.000Z | 2021-11-07T04:52:29.000Z | src/OrthoPolynomials.jl | OpenLibMathSeq/Sequences | e53c1f30b7bf81669805f21d408d407b727615b5 | [
"MIT"
] | 3 | 2019-04-30T19:07:41.000Z | 2019-06-04T15:51:34.000Z | src/OrthoPolynomials.jl | PeterLuschny/IntegerSequences.jl | 1b9440bc8b86e3ae74fd26ee48fba412befbbdb5 | [
"MIT"
] | 4 | 2019-04-30T17:00:10.000Z | 2020-02-08T11:32:39.000Z | # This file is part of IntegerSequences.
# Copyright Peter Luschny. License is MIT.
(@__DIR__) ∉ LOAD_PATH && push!(LOAD_PATH, (@__DIR__))
module OrthoPolynomials
using Nemo, Triangles
export ModuleOrthoPolynomials
export OrthoPoly, InvOrthoPoly
export T053121, T216916, T217537, T064189, T202327, T111062, T099174
ex... | 23.680597 | 268 | 0.577209 | [
"@testset \"OrthoPoly\" begin\n\n @test isa(OrthoPoly(10, n -> 1, n -> n + 1)[end], fmpz)\n @test isa(InvOrthoPoly(10, n -> 1, n -> n + 1)[end], fmpz)\n @test RowSums(T217537(8)) == L217924(8)\n\n if data_installed()\n\n T = [\n T066325,\n T049310... |
f702dea5779e5262fac4b7f8e161329cc0c3f6d4 | 2,303 | jl | Julia | test/runtests.jl | felipenoris/SplitIterators.jl | 6ad384e290feed1339e94ff169b58922a3785359 | [
"MIT"
] | 2 | 2021-08-22T14:45:30.000Z | 2022-03-19T19:34:46.000Z | test/runtests.jl | felipenoris/SplitIterators.jl | 6ad384e290feed1339e94ff169b58922a3785359 | [
"MIT"
] | null | null | null | test/runtests.jl | felipenoris/SplitIterators.jl | 6ad384e290feed1339e94ff169b58922a3785359 | [
"MIT"
] | null | null | null |
using Test
import SplitIterators
@testset "split 11 by 3" begin
x = collect(1:11)
for (i, part) in enumerate(SplitIterators.split(x, 3))
if i == 1
@test part == collect(1:4)
elseif i == 2
@test part == collect(5:8)
elseif i == 3
@test part == colle... | 21.933333 | 138 | 0.539731 | [
"@testset \"split 11 by 3\" begin\n x = collect(1:11)\n\n for (i, part) in enumerate(SplitIterators.split(x, 3))\n if i == 1\n @test part == collect(1:4)\n elseif i == 2\n @test part == collect(5:8)\n elseif i == 3\n @test part == collect(9:11)\n el... |
f7065123fa9d24e80182de827c92598269a8c321 | 122 | jl | Julia | test/runtests.jl | Teslos/MyExample.jl | 014079e8dd99a63c1ff8340d1d9ed670ed8e91ad | [
"MIT"
] | null | null | null | test/runtests.jl | Teslos/MyExample.jl | 014079e8dd99a63c1ff8340d1d9ed670ed8e91ad | [
"MIT"
] | null | null | null | test/runtests.jl | Teslos/MyExample.jl | 014079e8dd99a63c1ff8340d1d9ed670ed8e91ad | [
"MIT"
] | null | null | null | using MyExample
using Test
#2x + 3y
@testset "MyExample.jl" begin
@test my_f(2,1) == 7
@test my_f(2,3) == 13
end
| 13.555556 | 29 | 0.622951 | [
"@testset \"MyExample.jl\" begin\n @test my_f(2,1) == 7\n @test my_f(2,3) == 13\nend"
] |
f7071fefba07848f0e49c2ef170c0eb46f03133d | 1,564 | jl | Julia | test/Ocean/SplitExplicit/test_coriolis.jl | ErikQQY/ClimateMachine.jl | ad128d457dd877bf21b5bcd845d6c3fa42de3f8a | [
"Apache-2.0"
] | 256 | 2020-05-06T08:03:16.000Z | 2022-03-22T14:01:20.000Z | test/Ocean/SplitExplicit/test_coriolis.jl | ErikQQY/ClimateMachine.jl | ad128d457dd877bf21b5bcd845d6c3fa42de3f8a | [
"Apache-2.0"
] | 1,174 | 2020-05-06T16:19:51.000Z | 2022-02-25T17:51:13.000Z | test/Ocean/SplitExplicit/test_coriolis.jl | ErikQQY/ClimateMachine.jl | ad128d457dd877bf21b5bcd845d6c3fa42de3f8a | [
"Apache-2.0"
] | 45 | 2020-05-08T02:28:36.000Z | 2022-03-14T22:44:56.000Z | #!/usr/bin/env julia --project
using Test
include("hydrostatic_spindown.jl")
ClimateMachine.init()
const FT = Float64
#################
# RUN THE TESTS #
#################
@testset "$(@__FILE__)" begin
include("../refvals/hydrostatic_spindown_refvals.jl")
# simulation time
timeend = FT(15 * 24 * 3600) ... | 20.578947 | 77 | 0.555627 | [
"@testset \"$(@__FILE__)\" begin\n\n include(\"../refvals/hydrostatic_spindown_refvals.jl\")\n\n # simulation time\n timeend = FT(15 * 24 * 3600) # s\n tout = FT(24 * 3600) # s\n timespan = (tout, timeend)\n\n # DG polynomial order\n N = Int(4)\n\n # Domain resolution\n Nˣ = Int(5)\n N... |
f70bd5fdbd81a3e0a966c69edae9271ec76b4c57 | 396 | jl | Julia | test/runtests.jl | hendri54/CollegeEntry | bcbd6434fdd7f66944075b0b85efbfd8f6e6ac29 | [
"MIT"
] | null | null | null | test/runtests.jl | hendri54/CollegeEntry | bcbd6434fdd7f66944075b0b85efbfd8f6e6ac29 | [
"MIT"
] | null | null | null | test/runtests.jl | hendri54/CollegeEntry | bcbd6434fdd7f66944075b0b85efbfd8f6e6ac29 | [
"MIT"
] | null | null | null | using CollegeEntry, ModelObjectsLH, ModelParams
using Test, TestSetExtensions
include("test_helpers.jl")
@testset "All" begin
include("helpers_test.jl")
include("admissions_test.jl");
include("admission_prob_test.jl");
include("student_rankings_test.jl")
include("entry_test.jl");
include("entr... | 24.75 | 47 | 0.719697 | [
"@testset \"All\" begin\n include(\"helpers_test.jl\")\n include(\"admissions_test.jl\");\n include(\"admission_prob_test.jl\");\n include(\"student_rankings_test.jl\")\n include(\"entry_test.jl\");\n include(\"entry_decisions_test.jl\")\n include(\"entry_results_test.jl\")\nend"
] |
f70c3ff4968c391bb44e7f54b612f4bd73c46365 | 1,192 | jl | Julia | test/GLMesh.jl | cvdlab/ViewerGL.js | ae28d7808699f9c34add4ad265b68a84bfa14842 | [
"MIT"
] | 4 | 2019-07-25T23:07:18.000Z | 2021-09-05T18:38:20.000Z | test/GLMesh.jl | cvdlab/ViewerGL.js | ae28d7808699f9c34add4ad265b68a84bfa14842 | [
"MIT"
] | null | null | null | test/GLMesh.jl | cvdlab/ViewerGL.js | ae28d7808699f9c34add4ad265b68a84bfa14842 | [
"MIT"
] | 31 | 2019-10-09T14:09:51.000Z | 2022-03-31T14:52:35.000Z | using Test
using LinearAlgebraicRepresentation
Lar = LinearAlgebraicRepresentation
using ViewerGL
GL = ViewerGL
@testset "GLMesh.jl" begin
# function GLMesh()
@testset "GLMesh" begin
@test
@test
@test
@test
end
# function GLMesh(primitive)
@testset "GLMesh" begin
@test
... | 16.108108 | 64 | 0.589765 | [
"@testset \"GLMesh.jl\" begin\n\n # function GLMesh()\n @testset \"GLMesh\" begin\n @test\n @test\n @test\n @test\n end\n\n # function GLMesh(primitive)\n @testset \"GLMesh\" begin\n @test\n @test\n @test\n @test\n end\n\n # function releaseGpuResources(mesh::GL... |
f70ccf8b21eeac0bbd8a4ce08b4cb71e0206dba4 | 3,529 | jl | Julia | test/knr/testknr.jl | UnofficialJuliaMirrorSnapshots/SimilaritySearch.jl-053f045d-5466-53fd-b400-a066f88fe02a | 70c46490431ca7d0e5cf41052bc36afc4ba3c8fa | [
"Apache-2.0"
] | null | null | null | test/knr/testknr.jl | UnofficialJuliaMirrorSnapshots/SimilaritySearch.jl-053f045d-5466-53fd-b400-a066f88fe02a | 70c46490431ca7d0e5cf41052bc36afc4ba3c8fa | [
"Apache-2.0"
] | null | null | null | test/knr/testknr.jl | UnofficialJuliaMirrorSnapshots/SimilaritySearch.jl-053f045d-5466-53fd-b400-a066f88fe02a | 70c46490431ca7d0e5cf41052bc36afc4ba3c8fa | [
"Apache-2.0"
] | null | null | null | using SimilaritySearch
using SimilaritySearch.SimilarReferences
using Test
function test_vectors(create_index, dist::Function, ksearch, nick)
@testset "indexing vectors with $nick and $dist" begin
n = 1000 # number of items in the dataset
m = 100 # number of queries
dim = 3 # vector's di... | 32.081818 | 151 | 0.597053 | [
"@testset \"indexing vectors\" begin\n # NOTE: The following algorithms are complex enough to say we are testing it doesn't have syntax errors, a more grained test functions are required\n ksearch = 10\n σ = 127\n κ = 3\n\n for dist in [\n l2_distance, # 1.0 -> metric, < 1.0 if dist is not a m... |
f70e234e93c6e69904c72f38c7eaec1a83d715df | 1,759 | jl | Julia | test/rountines.jl | UnofficialJuliaMirror/YaoBlocks.jl-418bc28f-b43b-5e0b-a6e7-61bbc1a2c1df | 703091b543e95e6e4a3d7fe451c29ce0dd423c73 | [
"Apache-2.0"
] | null | null | null | test/rountines.jl | UnofficialJuliaMirror/YaoBlocks.jl-418bc28f-b43b-5e0b-a6e7-61bbc1a2c1df | 703091b543e95e6e4a3d7fe451c29ce0dd423c73 | [
"Apache-2.0"
] | null | null | null | test/rountines.jl | UnofficialJuliaMirror/YaoBlocks.jl-418bc28f-b43b-5e0b-a6e7-61bbc1a2c1df | 703091b543e95e6e4a3d7fe451c29ce0dd423c73 | [
"Apache-2.0"
] | null | null | null | using Test, YaoBlocks, LuxurySparse, YaoBase
using YaoBlocks.ConstGate
import YaoBlocks: u1mat, unmat, cunmat, unij!
@testset "dense-u1mat-unmat" begin
nbit = 4
mmm = Rx(0.5) |> mat
m1 = u1mat(nbit, mmm, 2)
m2 = linop2dense(v -> instruct!(v, mmm, 2), nbit)
m3 = unmat(nbit, mmm, (2,))
@test m1 ≈... | 30.327586 | 92 | 0.529847 | [
"@testset \"dense-u1mat-unmat\" begin\n nbit = 4\n mmm = Rx(0.5) |> mat\n m1 = u1mat(nbit, mmm, 2)\n m2 = linop2dense(v -> instruct!(v, mmm, 2), nbit)\n m3 = unmat(nbit, mmm, (2,))\n @test m1 ≈ m2\n @test m1 ≈ m3\n\n # test control not\n ⊗ = kron\n res = mat(I2) ⊗ mat(I2) ⊗ mat(P1) ⊗ m... |
f712c2d65d4c6d110cc2b0191f55497c456cc7a7 | 945 | jl | Julia | Projects/Projet_Optinum/test/runtests.jl | faicaltoubali/ENSEEIHT | 6db0aef64d68446b04f17d1eae574591026002b5 | [
"Apache-2.0"
] | null | null | null | Projects/Projet_Optinum/test/runtests.jl | faicaltoubali/ENSEEIHT | 6db0aef64d68446b04f17d1eae574591026002b5 | [
"Apache-2.0"
] | null | null | null | Projects/Projet_Optinum/test/runtests.jl | faicaltoubali/ENSEEIHT | 6db0aef64d68446b04f17d1eae574591026002b5 | [
"Apache-2.0"
] | null | null | null | using Markdown
using Test
using LinearAlgebra
using TestOptinum
using Optinum
include("../src/Algorithme_De_Newton.jl")
include("../src/Gradient_Conjugue_Tronque.jl")
include("../src/Lagrangien_Augmente.jl")
include("../src/Pas_De_Cauchy.jl")
include("../src/Regions_De_Confiance.jl")
#TestOptinum.cacher_stacktrace()
... | 27.794118 | 70 | 0.812698 | [
"@testset \"Test SujetOptinum\" begin\n\t# Tester l'algorithme de Newton\n\ttester_algo_newton(affiche,Algorithme_De_Newton)\n\n\t# Tester l'algorithme du pas de Cauchy\n\ttester_pas_de_cauchy(affiche,Pas_De_Cauchy)\n\n\t# Tester l'algorithme du gradient conjugué tronqué\n\ttester_gct(affiche,Gradient_Conjugue_Tron... |
f71360a2dafb0db950b40e740ced0cc7c4d67b27 | 1,820 | jl | Julia | test/test_returning_original.jl | TheRoniOne/Cleaner | 7279c8e8e92a9763ed72f8614f9a77ddbd40fade | [
"MIT"
] | 16 | 2021-08-20T10:07:04.000Z | 2022-02-07T18:09:40.000Z | test/test_returning_original.jl | TheRoniOne/Cleaner | 7279c8e8e92a9763ed72f8614f9a77ddbd40fade | [
"MIT"
] | 2 | 2021-08-17T06:09:49.000Z | 2022-02-06T01:36:49.000Z | test/test_returning_original.jl | TheRoniOne/Cleaner | 7279c8e8e92a9763ed72f8614f9a77ddbd40fade | [
"MIT"
] | null | null | null | using Test
using Cleaner:
materializer,
compact_table_ROT,
compact_columns_ROT,
compact_rows_ROT,
delete_const_columns_ROT,
polish_names_ROT,
reinfer_schema_ROT,
row_as_names_ROT,
rename_ROT,
drop_missing_ROT,
add_index_ROT
using DataFrames: DataFrame
@testset "ROT functions... | 31.37931 | 88 | 0.590659 | [
"@testset \"ROT functions are working as expected\" begin\n testRM1 = DataFrame(;\n A=[missing, missing, missing], B=[1, missing, 3], C=[\"x\", \"\", \"z\"]\n )\n\n @test compact_columns_ROT(testRM1) isa DataFrame\n @test compact_rows_ROT(testRM1) isa DataFrame\n @test compact_table_ROT(testRM... |
f7139c61b9baf05db45b88230b03c8047a37b777 | 2,615 | jl | Julia | test/testProductReproducable.jl | dehann/iSAM.jl | 61869753a76717b1019756d09785a784fdafe3ab | [
"MIT"
] | null | null | null | test/testProductReproducable.jl | dehann/iSAM.jl | 61869753a76717b1019756d09785a784fdafe3ab | [
"MIT"
] | null | null | null | test/testProductReproducable.jl | dehann/iSAM.jl | 61869753a76717b1019756d09785a784fdafe3ab | [
"MIT"
] | null | null | null | # test for conv and product repeatability
using Test
using Statistics
using IncrementalInference
##
@testset "forward backward convolutions and products sequence" begin
fg = initfg()
addVariable!(fg, :a, ContinuousScalar)
addVariable!(fg, :b, ContinuousScalar)
addVariable!(fg, :c, ContinuousScalar)
addVariable!(f... | 25.144231 | 83 | 0.676482 | [
"@testset \"forward backward convolutions and products sequence\" begin\n\nfg = initfg()\n\naddVariable!(fg, :a, ContinuousScalar)\naddVariable!(fg, :b, ContinuousScalar)\naddVariable!(fg, :c, ContinuousScalar)\naddVariable!(fg, :d, ContinuousScalar)\naddVariable!(fg, :e, ContinuousScalar)\n\naddFactor!(fg, [:a], P... |
f7153aaee71132dc4b60ff01c3f91af6c17752a3 | 5,750 | jl | Julia | test/runtests.jl | burmecia/OpenAIGym.jl | 087bec95d13ca85216a0eaa7d47f50cda2867367 | [
"MIT"
] | 86 | 2017-02-24T20:25:05.000Z | 2022-03-31T04:50:07.000Z | test/runtests.jl | burmecia/OpenAIGym.jl | 087bec95d13ca85216a0eaa7d47f50cda2867367 | [
"MIT"
] | 31 | 2017-08-06T17:27:08.000Z | 2020-08-05T16:05:07.000Z | test/runtests.jl | burmecia/OpenAIGym.jl | 087bec95d13ca85216a0eaa7d47f50cda2867367 | [
"MIT"
] | 30 | 2017-03-20T22:06:01.000Z | 2021-09-24T04:38:33.000Z | using OpenAIGym
using PyCall
using Test
"""
`function time_steps(env::GymEnv{T}, num_eps::Int) where T`
run through num_eps eps, recording the time taken for each step and
how many steps were made. Doesn't time the `reset!` or the first step of each
episode (since higher chance that it's slower/faster than the rest, ... | 33.430233 | 105 | 0.488348 | [
"@testset \"Gym Basics\" begin\n\n pong = GymEnv(:Pong, :v4)\n pongnf = GymEnv(:PongNoFrameskip, :v4)\n pacman = GymEnv(:MsPacman, :v4)\n pacmannf = GymEnv(:MsPacmanNoFrameskip, :v4)\n cartpole = GymEnv(:CartPole)\n bj = GymEnv(:Blackjack)\n\n allenvs = [pong, pongnf, pacman, pacmannf, cartpole... |
f7183b3be5ea2b30e86fc2f42f90233e708e517b | 2,245 | jl | Julia | test/runtests.jl | maarten-keijzer/AdaptiveWindow.jl | 5bd90a475110ac5f6dd88226286455da0f8d87bf | [
"MIT"
] | 1 | 2022-01-04T13:50:24.000Z | 2022-01-04T13:50:24.000Z | test/runtests.jl | maarten-keijzer/AdaptiveWindow.jl | 5bd90a475110ac5f6dd88226286455da0f8d87bf | [
"MIT"
] | null | null | null | test/runtests.jl | maarten-keijzer/AdaptiveWindow.jl | 5bd90a475110ac5f6dd88226286455da0f8d87bf | [
"MIT"
] | null | null | null |
using AdaptiveWindows
using Test
@testset verbose=true "Adaptive Mean" begin
@testset "Mean Computation " begin
m = AdaptiveMean(δ = 1e-9)
r = randn(1000)
fit!(m, r)
m1 = sum(r) / length(r)
m2 = value(m)
@test m1 ≈ m2
ad = AdaptiveMean()
# This... | 23.385417 | 69 | 0.50245 | [
"@testset verbose=true \"Adaptive Mean\" begin\n\n @testset \"Mean Computation \" begin\n m = AdaptiveMean(δ = 1e-9)\n\n r = randn(1000)\n\n fit!(m, r)\n\n m1 = sum(r) / length(r)\n m2 = value(m)\n\n @test m1 ≈ m2\n ad = AdaptiveMean()\n\n # This should not... |
f71fdd500cffb77f7512f74f826a1a508b234e8f | 34,448 | jl | Julia | test/runtests.jl | bkamins/Statistics.jl | 81a1cdd6c2105d3e50f76375630bbed4744e67c1 | [
"MIT"
] | null | null | null | test/runtests.jl | bkamins/Statistics.jl | 81a1cdd6c2105d3e50f76375630bbed4744e67c1 | [
"MIT"
] | null | null | null | test/runtests.jl | bkamins/Statistics.jl | 81a1cdd6c2105d3e50f76375630bbed4744e67c1 | [
"MIT"
] | null | null | null | # This file is a part of Julia. License is MIT: https://julialang.org/license
using Statistics, Test, Random, LinearAlgebra, SparseArrays
using Test: guardseed
Random.seed!(123)
@testset "middle" begin
@test middle(3) === 3.0
@test middle(2, 3) === 2.5
let x = ((floatmax(1.0)/4)*3)
@test middle(x... | 40.102445 | 175 | 0.536054 | [
"@testset \"middle\" begin\n @test middle(3) === 3.0\n @test middle(2, 3) === 2.5\n let x = ((floatmax(1.0)/4)*3)\n @test middle(x, x) === x\n end\n @test middle(1:8) === 4.5\n @test middle([1:8;]) === 4.5\n\n # ensure type-correctness\n for T in [Bool,Int8,Int16,Int32,Int64,Int128,UI... |
f720458e4c141a29498437c4c4276797a74a93c1 | 1,913 | jl | Julia | test/runtests.jl | JuliaGeo/GDAL.jl | 3838e938642712cf8a98c52df5937dcfdb19221e | [
"MIT"
] | 61 | 2018-07-30T12:45:24.000Z | 2022-03-31T20:23:46.000Z | test/runtests.jl | JuliaGeo/GDAL.jl | 3838e938642712cf8a98c52df5937dcfdb19221e | [
"MIT"
] | 67 | 2018-06-11T15:59:17.000Z | 2022-03-02T21:42:54.000Z | test/runtests.jl | JuliaGeo/GDAL.jl | 3838e938642712cf8a98c52df5937dcfdb19221e | [
"MIT"
] | 14 | 2018-12-03T22:05:51.000Z | 2021-09-30T10:58:04.000Z | using GDAL
using Test
@testset "GDAL" begin
# drivers
# before being able to use any drivers, they must be registered first
GDAL.gdalallregister()
version = GDAL.gdalversioninfo("--version")
n_gdal_driver = GDAL.gdalgetdrivercount()
n_ogr_driver = GDAL.ogrgetdrivercount()
@info """$versio... | 33.561404 | 79 | 0.679038 | [
"@testset \"GDAL\" begin\n\n # drivers\n # before being able to use any drivers, they must be registered first\n GDAL.gdalallregister()\n\n version = GDAL.gdalversioninfo(\"--version\")\n n_gdal_driver = GDAL.gdalgetdrivercount()\n n_ogr_driver = GDAL.ogrgetdrivercount()\n @info \"\"\"$version\... |
f7215512da0154c3cb3b231e83d4d4e0ca40097a | 2,666 | jl | Julia | test/test_fileio.jl | chenspc/OWEN.jl | 842c8672dbc001180d980430e20652101929f32f | [
"MIT"
] | null | null | null | test/test_fileio.jl | chenspc/OWEN.jl | 842c8672dbc001180d980430e20652101929f32f | [
"MIT"
] | 2 | 2019-11-13T23:18:11.000Z | 2020-02-08T16:40:57.000Z | test/test_fileio.jl | chenspc/OWEN.jl | 842c8672dbc001180d980430e20652101929f32f | [
"MIT"
] | 1 | 2020-02-08T10:46:07.000Z | 2020-02-08T10:46:07.000Z | using Kahuna
using Test
@testset "kahuna_read" begin
@testset ".dm3 files" begin
@test 2 + 2 == 4
end
@testset ".dm4 files" begin
@test 2 + 2 == 4
end
@testset ".hdf5/.h5 files" begin
@test 2 + 2 == 4
end
@testset ".mat files" begin
# matfile = "test/samp... | 33.746835 | 127 | 0.594524 | [
"@testset \"kahuna_read\" begin\n\n @testset \".dm3 files\" begin\n @test 2 + 2 == 4\n end\n\n @testset \".dm4 files\" begin\n @test 2 + 2 == 4\n end\n\n @testset \".hdf5/.h5 files\" begin\n @test 2 + 2 == 4\n end\n\n @testset \".mat files\" begin\n # matfile = \"tes... |
f7262dc1d65caed99f539aa39adc09adecee3524 | 1,713 | jl | Julia | test/simple_runner_tests.jl | grahamstark/ScottishTaxBenefitModel.jl | 42ca32a100c862c58bbcd98f6264f08d78453b5c | [
"MIT"
] | null | null | null | test/simple_runner_tests.jl | grahamstark/ScottishTaxBenefitModel.jl | 42ca32a100c862c58bbcd98f6264f08d78453b5c | [
"MIT"
] | null | null | null | test/simple_runner_tests.jl | grahamstark/ScottishTaxBenefitModel.jl | 42ca32a100c862c58bbcd98f6264f08d78453b5c | [
"MIT"
] | null | null | null | using Test
using CSV
using DataFrames
using StatsBase
using BenchmarkTools
using ScottishTaxBenefitModel
using ScottishTaxBenefitModel.GeneralTaxComponents
using ScottishTaxBenefitModel.STBParameters
using ScottishTaxBenefitModel.Runner: do_one_run!
using ScottishTaxBenefitModel.RunSettings: Settings, MT_Routing
using... | 32.320755 | 85 | 0.725044 | [
"@testset \"basic run timing\" begin\n for mt in instances( MT_Routing )\n println( \"starting run using $mt routing\")\n @time basic_run( print_test=true, mtrouting = mt )\n end\n # @benchmark frames = \n # print(t)\nend"
] |
f727f80483dbefe80bf5db5ac82e2786aea040ee | 1,036 | jl | Julia | test/runtests.jl | mauro3/course-101-0250-00-L6Testing.jl | c7d47e770d5eabbf7f28784f9a9bd279a3042af8 | [
"MIT"
] | 1 | 2022-03-01T09:48:55.000Z | 2022-03-01T09:48:55.000Z | test/runtests.jl | mauro3/course-101-0250-00-L6Testing.jl | c7d47e770d5eabbf7f28784f9a9bd279a3042af8 | [
"MIT"
] | null | null | null | test/runtests.jl | mauro3/course-101-0250-00-L6Testing.jl | c7d47e770d5eabbf7f28784f9a9bd279a3042af8 | [
"MIT"
] | 1 | 2021-11-02T10:16:55.000Z | 2021-11-02T10:16:55.000Z | using Test, ReferenceTests, BSON
include("../scripts/car_travels.jl")
## Unit tests
@testset "update_position" begin
@test update_position(0.0, 10, 1, 1, 200)[1] ≈ 10.0
@test update_position(0.0, 10, 1, 1, 200)[2] == 1
@test update_position(0.0, 10, -1, 1, 200)[1] ≈ -10.0
@test update_position(0.0, 1... | 28.777778 | 65 | 0.642857 | [
"@testset \"update_position\" begin\n @test update_position(0.0, 10, 1, 1, 200)[1] ≈ 10.0\n @test update_position(0.0, 10, 1, 1, 200)[2] == 1\n\n @test update_position(0.0, 10, -1, 1, 200)[1] ≈ -10.0\n @test update_position(0.0, 10, -1, 1, 200)[2] == 1\n\n @test update_position(0.0, 10, -1, 1, 200)[1... |
f72e3f7fe6055a37c495d6361bfec1323eaa14a6 | 89 | jl | Julia | test/runtests.jl | Shoram444/MPThemes.jl | 86a6699f70a3b7f77d6ae6a248b285cb46f26852 | [
"MIT"
] | null | null | null | test/runtests.jl | Shoram444/MPThemes.jl | 86a6699f70a3b7f77d6ae6a248b285cb46f26852 | [
"MIT"
] | null | null | null | test/runtests.jl | Shoram444/MPThemes.jl | 86a6699f70a3b7f77d6ae6a248b285cb46f26852 | [
"MIT"
] | null | null | null | using MPThemes
using Test
@testset "MPThemes.jl" begin
# Write your tests here.
end
| 12.714286 | 28 | 0.730337 | [
"@testset \"MPThemes.jl\" begin\n # Write your tests here.\nend"
] |
f72eb56564b1565aeb3c77581bcff74072f7b438 | 14,033 | jl | Julia | test/runtests.jl | Physics-Simulations/UncValue.jl | 0597853fc2951732d2c8e5cc1625e075de08b7b5 | [
"Apache-2.0"
] | null | null | null | test/runtests.jl | Physics-Simulations/UncValue.jl | 0597853fc2951732d2c8e5cc1625e075de08b7b5 | [
"Apache-2.0"
] | null | null | null | test/runtests.jl | Physics-Simulations/UncValue.jl | 0597853fc2951732d2c8e5cc1625e075de08b7b5 | [
"Apache-2.0"
] | null | null | null | using Test
using Statistics
include("../src/UncValue.jl")
using ..UncValue
a = Value(3.1415, 0.0012)
b = Value(2.7182818, 3.4e-6)
c = Value(36458.246, 25.64)
@testset "constructor" begin
@test a.x == 3.1415
@test a.σ == 0.0012
@test_throws ErrorException Value(4.1, -2.4)
d = Value(5.248)
@test ... | 21.326748 | 77 | 0.481579 | [
"@testset \"constructor\" begin\n @test a.x == 3.1415\n @test a.σ == 0.0012\n\n @test_throws ErrorException Value(4.1, -2.4)\n\n d = Value(5.248)\n @test d.x == 5.248\n @test d.σ == 0\n\n d = Value(8.0, 1)\n @test typeof(d.x) == typeof(d.σ)\n\n d = Value(8, 0.2)\n @test typeof(d.x) == ... |
f72f043be09d590c6643ffb83677e3fd865d1d0f | 47,300 | jl | Julia | stdlib/SparseArrays/test/sparsevector.jl | ninjin/julia | 2d589cca94c502a696fc5e234835560e28b9efd3 | [
"Zlib"
] | null | null | null | stdlib/SparseArrays/test/sparsevector.jl | ninjin/julia | 2d589cca94c502a696fc5e234835560e28b9efd3 | [
"Zlib"
] | null | null | null | stdlib/SparseArrays/test/sparsevector.jl | ninjin/julia | 2d589cca94c502a696fc5e234835560e28b9efd3 | [
"Zlib"
] | null | null | null | # This file is a part of Julia. License is MIT: https://julialang.org/license
module SparseVectorTests
using Test
using SparseArrays
using LinearAlgebra
using Random
### Data
spv_x1 = SparseVector(8, [2, 5, 6], [1.25, -0.75, 3.5])
@test isa(spv_x1, SparseVector{Float64,Int})
x1_full = zeros(length(spv_x1))
x1_ful... | 37.039937 | 139 | 0.525666 | [
"@testset \"basic properties\" begin\n x = spv_x1\n @test eltype(x) == Float64\n @test ndims(x) == 1\n @test length(x) == 8\n @test size(x) == (8,)\n @test size(x,1) == 8\n @test size(x,2) == 1\n @test !isempty(x)\n\n @test count(!iszero, x) == 3\n @test nnz(x) == 3\n @test SparseAr... |
f730d51ff329e5659dc3f251a93b3a0a168c5381 | 1,610 | jl | Julia | test/primitive/math_gate.jl | yihong-zhang/YaoBlocks.jl | 9bd8f309b5c258968fb5ce4c2f12fc5e854d8b68 | [
"Apache-2.0"
] | null | null | null | test/primitive/math_gate.jl | yihong-zhang/YaoBlocks.jl | 9bd8f309b5c258968fb5ce4c2f12fc5e854d8b68 | [
"Apache-2.0"
] | null | null | null | test/primitive/math_gate.jl | yihong-zhang/YaoBlocks.jl | 9bd8f309b5c258968fb5ce4c2f12fc5e854d8b68 | [
"Apache-2.0"
] | null | null | null | using Test, YaoArrayRegister, YaoBlocks, BitBasis
function toffli(b::BitStr)
t = @inbounds b[1] ⊻ (b[3] & b[2])
return @inbounds bit_literal(t, b[2], b[3])
end
"""
pshift(n::Int) -> Function
return a peridoc shift function.
"""
pshift(n::Int) = (b::Int, nbit::Int) -> mod(b+n, 1<<nbit)
pshift(n::Float64) ... | 31.568627 | 75 | 0.642236 | [
"@testset \"test toffli\" begin\n g = mathgate(toffli; nbits=3)\n check_truth(b1, b2) = apply!(ArrayReg(b1), g) == ArrayReg(b2)\n @test check_truth(bit\"000\", bit\"000\")\n @test check_truth(bit\"001\", bit\"001\")\n @test check_truth(bit\"010\", bit\"010\")\n @test check_truth(bit\"011\", bit\"0... |
f734da2f58ca1f6ada84ab9f502fd62d59c0226b | 3,542 | jl | Julia | test/runtests.jl | andLaing/NReco | 376b272cc0fe480295c07a54166dbf69e456a95f | [
"MIT"
] | null | null | null | test/runtests.jl | andLaing/NReco | 376b272cc0fe480295c07a54166dbf69e456a95f | [
"MIT"
] | 7 | 2021-09-09T16:28:35.000Z | 2021-11-19T17:17:07.000Z | test/runtests.jl | andLaing/NReco | 376b272cc0fe480295c07a54166dbf69e456a95f | [
"MIT"
] | 1 | 2021-09-01T09:29:39.000Z | 2021-09-01T09:29:39.000Z | using NReco
using ATools
using Test
using DataFrames
using Distributions
using Statistics
using Logging
using DataFrames
#using StatsModels
# Lower function verbosity
logger = global_logger(SimpleLogger(stdout, Logging.Warn))
fname = "testdata/n3-window-1m-LXe-20mm-1-20.h5"
pdf = NReco.read_abc(fname)
dconf = NReco.... | 38.5 | 90 | 0.616036 | [
"@testset \"util\" begin\n @test NReco.select_by_index(sxyz,\n \"sensor_id\", 0) == NReco.select_by_column_value(sxyz, \"sensor_id\", 0)\n\n wevt = NReco.select_event(wfm, 4995000)\n @test mean(wevt.time) ≈ 42.39652f0\n @test NReco.select_by_column_value(wevt, \"sensor_id\", 1783).sensor_id[1] == 178... |
f73aa376c1505d72bbbd394595028887abf04dd4 | 2,096 | jl | Julia | test/test-partial.jl | JobJob/Partial.jl | 7b2853c614b21ef2b89c700fa75db5c9d1efe60e | [
"MIT"
] | 1 | 2019-11-01T17:28:10.000Z | 2019-11-01T17:28:10.000Z | test/test-partial.jl | JobJob/Partial.jl | 7b2853c614b21ef2b89c700fa75db5c9d1efe60e | [
"MIT"
] | null | null | null | test/test-partial.jl | JobJob/Partial.jl | 7b2853c614b21ef2b89c700fa75db5c9d1efe60e | [
"MIT"
] | null | null | null | using Test
@testset "Quite partial to it really" begin
add3 = @p(3 + _)
@test add3(7) == 10
add4r = @p(_ + 4)
@test add4r(7) == 11
lt10 = @partial _ < 10
@test lt10(7) == true
@test lt10(27) == false
gt10 = @p(10 < _)
@test gt10(17) == true
@test gt10(7) == false
fn_of7_and_10 = @p _(7,10)
@... | 23.288889 | 62 | 0.59208 | [
"@testset \"Quite partial to it really\" begin\n add3 = @p(3 + _)\n @test add3(7) == 10\n add4r = @p(_ + 4)\n @test add4r(7) == 11\n\n lt10 = @partial _ < 10\n @test lt10(7) == true\n @test lt10(27) == false\n\n gt10 = @p(10 < _)\n @test gt10(17) == true\n @test gt10(7) == false\n\n fn_of7_and_10 = @p _(... |
f73b2208bf8dde34eed198d7565342859f8c432d | 11,102 | jl | Julia | julia/test/runtests.jl | magland/FMM3D | 49284e2270e164ac1c05478b74c3ccf5f1d3c9de | [
"Apache-2.0"
] | 71 | 2019-06-03T21:22:37.000Z | 2022-03-03T01:15:45.000Z | julia/test/runtests.jl | magland/FMM3D | 49284e2270e164ac1c05478b74c3ccf5f1d3c9de | [
"Apache-2.0"
] | 14 | 2019-08-22T19:58:36.000Z | 2022-02-08T19:01:06.000Z | julia/test/runtests.jl | magland/FMM3D | 49284e2270e164ac1c05478b74c3ccf5f1d3c9de | [
"Apache-2.0"
] | 23 | 2019-09-13T21:30:35.000Z | 2022-02-26T12:34:42.000Z | using FMM3D
using Test
using Random
using LinearAlgebra
@testset "testing Helmholtz utilities" begin
n = 1000
nt = 1100
sources = randn(3,n)
targets = randn(3,nt)
charges = randn(n) + im*randn(n)
dipvecs = randn(3,n) + im*randn(3,n)
zk = 2.1
vals1c = h3ddir(zk,sources,targets,charges=... | 38.818182 | 83 | 0.647721 | [
"@testset \"testing Helmholtz utilities\" begin\n\n n = 1000\n nt = 1100\n sources = randn(3,n)\n targets = randn(3,nt)\n charges = randn(n) + im*randn(n)\n dipvecs = randn(3,n) + im*randn(3,n)\n zk = 2.1\n\n vals1c = h3ddir(zk,sources,targets,charges=charges,\n pgt=2,thre... |
f73b80024cd7d4ea135105c3bba9a1f6640b5291 | 1,492 | jl | Julia | test/runtests.jl | anubhavpcjha/lolPackage | 5a1649076dba63c3dcef0bf9a7dadec1a6be755a | [
"MIT"
] | null | null | null | test/runtests.jl | anubhavpcjha/lolPackage | 5a1649076dba63c3dcef0bf9a7dadec1a6be755a | [
"MIT"
] | null | null | null | test/runtests.jl | anubhavpcjha/lolPackage | 5a1649076dba63c3dcef0bf9a7dadec1a6be755a | [
"MIT"
] | null | null | null | using lolPackage
using Test
#TEST 1 WITH DERIVATIVES
f(x)=x^2
fprime(x)=2*x
@test Newtonsroot1(f,fprime,xiv=0.1)[1]≈0.0 atol=0.00001
f(x)=x^2-16
fprime(x)=2*x
@test Newtonsroot1(f,fprime,xiv=3.1)[1]≈4.0 atol=0.00001
f(x)=(x-2)^2
fprime(x)=2*(x-2)
@test Newtonsroo... | 22.953846 | 76 | 0.577748 | [
"@testset \"BigFloat\" begin\n @test Newtonsroot1(f,xiv=1.0)[1]≈2.0 atol=0.00001\n @test Newtonsroot1(f,xiv=1.0)[1]≈a atol=0.00001\n end",
"@testset \"maxiter\" begin\n @test a≈4.851651954097909e8 atol=0.000001 \n @test b==nothing\n end"
] |
f741fd5e32a0c3dbe2a6ade881ffd5908885f136 | 1,284 | jl | Julia | test/rank_by_stability.jl | Durzot/MT_NMF | a3e3c2fb4a23cc09e78e1ad1e324787c6017a4fc | [
"MIT"
] | null | null | null | test/rank_by_stability.jl | Durzot/MT_NMF | a3e3c2fb4a23cc09e78e1ad1e324787c6017a4fc | [
"MIT"
] | null | null | null | test/rank_by_stability.jl | Durzot/MT_NMF | a3e3c2fb4a23cc09e78e1ad1e324787c6017a4fc | [
"MIT"
] | null | null | null | using Distributions
using VariantsNMF
using Test
#### simulate
V = get_one_simulated_V()
V = round.(V .* 100)
@testset "nmf_MU" begin
#### params for rank selection
rs_params = RSParams(
K_min = 1,
K_max = 10,
n_iter = 50,
pert_meth = :multinomial,
seed ... | 24.692308 | 59 | 0.561526 | [
"@testset \"nmf_MU\" begin\n #### params for rank selection\n rs_params = RSParams(\n K_min = 1,\n K_max = 10,\n n_iter = 50,\n pert_meth = :multinomial,\n seed = 123\n )\n\n #### nmf algorithm\n nmf_global_params = NMFParams(\n init ... |
f747730293c3fc3d56a4caca670cbd8c766fef15 | 333 | jl | Julia | test/runtests.jl | NHDaly/SimpleMock.jl | 5e79a57f5987f6d54fb7338eb424826ad4e10eac | [
"MIT"
] | 12 | 2020-06-17T23:17:23.000Z | 2022-02-16T02:23:01.000Z | test/runtests.jl | NHDaly/SimpleMock.jl | 5e79a57f5987f6d54fb7338eb424826ad4e10eac | [
"MIT"
] | 10 | 2019-09-23T06:43:26.000Z | 2020-04-20T17:53:49.000Z | test/runtests.jl | NHDaly/SimpleMock.jl | 5e79a57f5987f6d54fb7338eb424826ad4e10eac | [
"MIT"
] | 3 | 2019-11-28T06:12:59.000Z | 2020-02-08T10:39:16.000Z | using Base: JLOptions
using Test: @test, @testset, @test_broken, @test_logs, @test_throws
using Suppressor: @capture_err, @suppress
using SimpleMock
@testset "SimpleMock.jl" begin
@testset "Mock type" begin
include("mock_type.jl")
end
@testset "mock function" begin
include("mock_fun.jl")... | 19.588235 | 67 | 0.690691 | [
"@testset \"SimpleMock.jl\" begin\n @testset \"Mock type\" begin\n include(\"mock_type.jl\")\n end\n @testset \"mock function\" begin\n include(\"mock_fun.jl\")\n end\nend"
] |
f747edbb78daf49b533e6e6c02b4b91157cb7990 | 6,275 | jl | Julia | lib/ClimaCorePlots/test/runtests.jl | CliMA/ClimaCore.jl | e28309249a4c0dea0e8bb897b4dc9ebc376fa94e | [
"Apache-2.0"
] | 32 | 2021-07-19T20:14:46.000Z | 2022-03-26T00:18:43.000Z | lib/ClimaCorePlots/test/runtests.jl | CliMA/ClimaCore.jl | e28309249a4c0dea0e8bb897b4dc9ebc376fa94e | [
"Apache-2.0"
] | 543 | 2021-07-06T18:21:05.000Z | 2022-03-31T20:39:02.000Z | lib/ClimaCorePlots/test/runtests.jl | CliMA/ClimaCore.jl | e28309249a4c0dea0e8bb897b4dc9ebc376fa94e | [
"Apache-2.0"
] | 1 | 2021-09-27T16:54:21.000Z | 2021-09-27T16:54:21.000Z | ENV["GKSwstype"] = "nul"
using Test
using IntervalSets
import Plots
import ClimaCore
import ClimaCorePlots
OUTPUT_DIR = mkpath(get(ENV, "CI_OUTPUT_DIR", tempname()))
@testset "spectral element 2D cubed-sphere" begin
R = 6.37122e6
domain = ClimaCore.Domains.SphereDomain(R)
mesh = ClimaCore.Meshes.Equian... | 32.512953 | 78 | 0.69753 | [
"@testset \"spectral element 2D cubed-sphere\" begin\n R = 6.37122e6\n\n domain = ClimaCore.Domains.SphereDomain(R)\n mesh = ClimaCore.Meshes.EquiangularCubedSphere(domain, 6)\n grid_topology = ClimaCore.Topologies.Topology2D(mesh)\n quad = ClimaCore.Spaces.Quadratures.GLL{5}()\n space = ClimaCore... |
f748d0d5332b45ec25a7812dc2b8a3c93a7a5872 | 1,030 | jl | Julia | test/integration/sequential/trained_weights/MNIST.WK17a_linf0.1_authors.jl | UnofficialJuliaMirror/MIPVerify.jl-e5e5f8be-2a6a-5994-adbb-5afbd0e30425 | 727a3fc020c03a949b501fbe4c684dca717b5b37 | [
"MIT"
] | null | null | null | test/integration/sequential/trained_weights/MNIST.WK17a_linf0.1_authors.jl | UnofficialJuliaMirror/MIPVerify.jl-e5e5f8be-2a6a-5994-adbb-5afbd0e30425 | 727a3fc020c03a949b501fbe4c684dca717b5b37 | [
"MIT"
] | null | null | null | test/integration/sequential/trained_weights/MNIST.WK17a_linf0.1_authors.jl | UnofficialJuliaMirror/MIPVerify.jl-e5e5f8be-2a6a-5994-adbb-5afbd0e30425 | 727a3fc020c03a949b501fbe4c684dca717b5b37 | [
"MIT"
] | null | null | null | using Test
using MIPVerify
using MIPVerify: LInfNormBoundedPerturbationFamily
using MIPVerify: get_example_network_params, read_datasets, get_image, get_label
@isdefined(TestHelpers) || include("../../../TestHelpers.jl")
@testset "MNIST.WK17a_linf0.1_authors" begin
nn = get_example_network_params("MNIST.WK17a_linf... | 35.517241 | 110 | 0.670874 | [
"@testset \"MNIST.WK17a_linf0.1_authors\" begin\n nn = get_example_network_params(\"MNIST.WK17a_linf0.1_authors\")\n mnist = read_datasets(\"mnist\")\n\n test_cases = [\n (1, NaN),\n (2, NaN),\n (9, 0.0940014207),\n (248, 0),\n ]\n\n for test_case in test_cases\n (i... |
f749e35e681fa741105c428224ace6bae42fd785 | 26,953 | jl | Julia | test/periods.jl | JeffreySarnoff/DatesPlus.jl | bb263be7983efba2d2da2de40b39a915713ef04d | [
"MIT"
] | 1 | 2022-03-26T06:13:53.000Z | 2022-03-26T06:13:53.000Z | test/periods.jl | JeffreySarnoff/DatesPlus.jl | bb263be7983efba2d2da2de40b39a915713ef04d | [
"MIT"
] | null | null | null | test/periods.jl | JeffreySarnoff/DatesPlus.jl | bb263be7983efba2d2da2de40b39a915713ef04d | [
"MIT"
] | null | null | null | # This file is a part of Julia. License is MIT: https://julialang.org/license
module PeriodsTest
using Dates
using Test
@testset "basic arithmetic" begin
@test -DatesPlus.Year(1) == DatesPlus.Year(-1)
@test DatesPlus.Year(1) > DatesPlus.Year(0)
@test (DatesPlus.Year(1) < DatesPlus.Year(0)) == false
@... | 50.379439 | 192 | 0.610878 | [
"@testset \"basic arithmetic\" begin\n @test -DatesPlus.Year(1) == DatesPlus.Year(-1)\n @test DatesPlus.Year(1) > DatesPlus.Year(0)\n @test (DatesPlus.Year(1) < DatesPlus.Year(0)) == false\n @test DatesPlus.Year(1) == DatesPlus.Year(1)\n @test DatesPlus.Year(1) != 1\n @test DatesPlus.Year(1) + Dat... |
f74d5b33bbb3f7745f0f41c3edfe083921144872 | 6,805 | jl | Julia | src/MINLPTests.jl | jump-dev/MINLPTests.jl | 9dc2b751de7470dcb4d9a726e11339a8e0bf745c | [
"MIT"
] | 3 | 2020-07-04T22:02:43.000Z | 2021-04-16T15:49:34.000Z | src/MINLPTests.jl | jump-dev/MINLPTests.jl | 9dc2b751de7470dcb4d9a726e11339a8e0bf745c | [
"MIT"
] | 14 | 2020-06-14T16:44:08.000Z | 2022-03-27T01:32:27.000Z | src/MINLPTests.jl | jump-dev/MINLPTests.jl | 9dc2b751de7470dcb4d9a726e11339a8e0bf745c | [
"MIT"
] | 2 | 2020-07-24T16:22:09.000Z | 2020-07-25T02:23:53.000Z | module MINLPTests
using JuMP
using Test
###
### Default tolerances that are used in the tests.
###
# Absolute tolerance when checking the objective value.
const OPT_TOL = 1e-6
# Absolute tolerance when checking the primal solution value.
const PRIMAL_TOL = 1e-6
# Absolue tolerance when checking the dual solution v... | 25.679245 | 78 | 0.653784 | [
"@testset \"$(directory)\" begin\n models = _list_of_models(directory, exclude, include)\n @testset \"$(model_name)\" for model_name in models\n if debug\n println(\"Running $(model_name)\")\n end\n getfield(MINLPTests, model_name)(\n opti... |
f74f8bc643ba5b89eb387d157c45840ceeb54cf2 | 2,271 | jl | Julia | aoc2019/day03/day03_test.jl | bfontaine/advent-of-code | fb0f8ff33064640125e8e0471939657f112a92d2 | [
"MIT"
] | 1 | 2019-01-27T00:32:32.000Z | 2019-01-27T00:32:32.000Z | aoc2019/day03/day03_test.jl | bfontaine/advent-of-code | fb0f8ff33064640125e8e0471939657f112a92d2 | [
"MIT"
] | null | null | null | aoc2019/day03/day03_test.jl | bfontaine/advent-of-code | fb0f8ff33064640125e8e0471939657f112a92d2 | [
"MIT"
] | null | null | null | #!/usr/bin/env julia
using Test
include("day03.jl")
using .Wires: parse_wire, parse_direction, gen_segment, problem1, problem2
@testset "parse_direction" begin
for direction = ["U0", "L0", "R0", "D0"]
@test (0,0) == parse_direction(direction)
end
@test (1,0) == parse_direction("R1")
@test (0,1) == parse... | 31.541667 | 90 | 0.547336 | [
"@testset \"parse_direction\" begin\n for direction = [\"U0\", \"L0\", \"R0\", \"D0\"]\n @test (0,0) == parse_direction(direction)\n end\n\n @test (1,0) == parse_direction(\"R1\")\n @test (0,1) == parse_direction(\"U1\")\n @test (-1,0) == parse_direction(\"L1\")\n @test (0,-1) == parse_direction(\"D1\")\n\... |
f74fdd87f724ed5dd3ac1565760e11d30c7b4b91 | 2,548 | jl | Julia | test/runtests.jl | ianshmean/SnoopCompile.jl | 77856274a05f90a93bd9136ab6caef106ccebe96 | [
"MIT"
] | null | null | null | test/runtests.jl | ianshmean/SnoopCompile.jl | 77856274a05f90a93bd9136ab6caef106ccebe96 | [
"MIT"
] | null | null | null | test/runtests.jl | ianshmean/SnoopCompile.jl | 77856274a05f90a93bd9136ab6caef106ccebe96 | [
"MIT"
] | null | null | null | if VERSION >= v"1.2.0-DEV.573"
include("snoopi.jl")
end
using SnoopCompile
using JLD
using SparseArrays
using Test
# issue #26
logfile = joinpath(tempdir(), "anon.log")
@snoopc logfile begin
map(x->x^2, [1,2,3])
end
data = SnoopCompile.read(logfile)
pc = SnoopCompile.parcel(reverse!(data[2]))
@test length(pc[... | 28.311111 | 124 | 0.648744 | [
"@static if VERSION >= v\"1.2.0-DEV.573\"\n @testset \"timesum\" begin\n loadSnoop = SnoopCompile.@snoopi using MatLang\n @test typeof(timesum(loadSnoop)) == Float64\n end\nend"
] |
f7503dc26338531e7f7300f9f2472f66d4066976 | 1,444 | jl | Julia | test/testBasicCSM.jl | KristofferC/IncrementalInference.jl | 708e62902104a8971a7cf1228abf01bbc2f0dac0 | [
"MIT"
] | null | null | null | test/testBasicCSM.jl | KristofferC/IncrementalInference.jl | 708e62902104a8971a7cf1228abf01bbc2f0dac0 | [
"MIT"
] | null | null | null | test/testBasicCSM.jl | KristofferC/IncrementalInference.jl | 708e62902104a8971a7cf1228abf01bbc2f0dac0 | [
"MIT"
] | null | null | null | # IIF #485 --
# using Revise
using Test
using Logging
using Statistics
using DistributedFactorGraphs
using IncrementalInference
@testset "test basic three variable graph with prior" begin
VAR1 = :a
VAR2 = :b
VAR3 = :c
logger = SimpleLogger(stdout, Logging.Debug)
global_logger(logger)
dfg = initfg() #LightDFG{Solv... | 20.055556 | 72 | 0.714681 | [
"@testset \"test basic three variable graph with prior\" begin\n\nVAR1 = :a\nVAR2 = :b\nVAR3 = :c\n\nlogger = SimpleLogger(stdout, Logging.Debug)\nglobal_logger(logger)\ndfg = initfg() #LightDFG{SolverParams}(solverParams=SolverParams())\n# Add some nodes.\nv1 = addVariable!(dfg, VAR1, ContinuousScalar, labels = [:... |
f7523d184e789a517886d1d65014e78a3b50c4f2 | 3,523 | jl | Julia | test/runtests.jl | rubsc/RiskMeasures.jl | 6b0dd90bdb8428edc901dea7ac2e347746e8ce47 | [
"MIT"
] | 1 | 2022-01-18T18:47:59.000Z | 2022-01-18T18:47:59.000Z | test/runtests.jl | rubsc/RiskMeasures.jl | 6b0dd90bdb8428edc901dea7ac2e347746e8ce47 | [
"MIT"
] | null | null | null | test/runtests.jl | rubsc/RiskMeasures.jl | 6b0dd90bdb8428edc901dea7ac2e347746e8ce47 | [
"MIT"
] | null | null | null | using RiskMeasures
using Test
@testset "helper.jl" begin
# Write your tests here.
@test pnorm(2,[0.5 0.5],[1 2]) ≈ 1.5811 atol=0.01
@test ontoSimplex([0.3 0.3 0.3 0.3]) == [0.25 0.25 0.25 0.25]
@test ontoSimplex([-0.3 -0.3 0.3 0.3]) == [0.0 0.0 0.5 0.5]
@test goldenSearch(x -> x^2, 1.0)[2] < 1E-16... | 39.58427 | 84 | 0.549248 | [
"@testset \"helper.jl\" begin\n # Write your tests here.\n @test pnorm(2,[0.5 0.5],[1 2]) ≈ 1.5811 atol=0.01\n\n @test ontoSimplex([0.3 0.3 0.3 0.3]) == [0.25 0.25 0.25 0.25]\n @test ontoSimplex([-0.3 -0.3 0.3 0.3]) == [0.0 0.0 0.5 0.5]\n @test goldenSearch(x -> x^2, 1.0)[2] < 1E-16\n @test golden... |
f752982437a7e151c2b70f260582c8900d6997d0 | 99,087 | jl | Julia | stdlib/SparseArrays/test/sparse.jl | domluna/julia | 1c88c0e2bed347f35c641413f0c7f9cee25a8fe4 | [
"Zlib"
] | null | null | null | stdlib/SparseArrays/test/sparse.jl | domluna/julia | 1c88c0e2bed347f35c641413f0c7f9cee25a8fe4 | [
"Zlib"
] | null | null | null | stdlib/SparseArrays/test/sparse.jl | domluna/julia | 1c88c0e2bed347f35c641413f0c7f9cee25a8fe4 | [
"Zlib"
] | null | null | null | # This file is a part of Julia. License is MIT: https://julialang.org/license
module SparseTests
using Test
using SparseArrays
using LinearAlgebra
using Base.Printf: @printf
using Random
using Test: guardseed
using InteractiveUtils: @which
using Dates
@testset "issparse" begin
@test issparse(sparse(fill(1,5,5)))... | 38.257529 | 172 | 0.562516 | [
"@testset \"issparse\" begin\n @test issparse(sparse(fill(1,5,5)))\n @test !issparse(fill(1,5,5))\nend",
"@testset \"iszero specialization for SparseMatrixCSC\" begin\n @test !iszero(sparse(I, 3, 3)) # test failure\n @test iszero(spzeros(3, 3)) # test success with ... |
f7535830c743be2765fb3db17de351a083794962 | 1,565 | jl | Julia | test/testlogfcns.jl | curtd/ThreadPools.jl | e36e82c51adfd22a7d0459912861bfaf1d43deff | [
"MIT"
] | 1 | 2021-05-25T05:04:38.000Z | 2021-05-25T05:04:38.000Z | test/testlogfcns.jl | ppalmes/ThreadPools.jl | e36e82c51adfd22a7d0459912861bfaf1d43deff | [
"MIT"
] | null | null | null | test/testlogfcns.jl | ppalmes/ThreadPools.jl | e36e82c51adfd22a7d0459912861bfaf1d43deff | [
"MIT"
] | null | null | null |
module TestLoggedFunctions
using Test
import ThreadPools: LoggedStaticPool
using ThreadPools
include("util.jl")
@testset "log functions" begin
@testset "read/write logs" begin
N = 2 * Threads.nthreads()
pool = LoggedStaticPool()
tforeach(pool, x->sleep(0.01*x), 1:N)
close(pool)
... | 24.076923 | 84 | 0.506709 | [
"@testset \"log functions\" begin\n\n @testset \"read/write logs\" begin\n N = 2 * Threads.nthreads()\n pool = LoggedStaticPool()\n tforeach(pool, x->sleep(0.01*x), 1:N)\n close(pool)\n dumplog(\"_tmp.log\", pool)\n log2 = readlog(\"_tmp.log\")\n @test pool.log ==... |
f753b345c945a2ed273aed4f174ea95f216beb25 | 238 | jl | Julia | test/runtests.jl | UnofficialJuliaMirrorSnapshots/HilbertSpaceFillingCurve.jl-515b7ef8-bac0-55e1-a220-237e90591ccc | 7a1acc28354cfa94cea28cf6b520a0cd8c1bd4c7 | [
"MIT"
] | 7 | 2019-06-13T08:50:49.000Z | 2022-01-06T04:31:29.000Z | test/runtests.jl | UnofficialJuliaMirrorSnapshots/HilbertSpaceFillingCurve.jl-515b7ef8-bac0-55e1-a220-237e90591ccc | 7a1acc28354cfa94cea28cf6b520a0cd8c1bd4c7 | [
"MIT"
] | 2 | 2019-04-23T14:16:05.000Z | 2019-12-18T14:45:54.000Z | test/runtests.jl | UnofficialJuliaMirrorSnapshots/HilbertSpaceFillingCurve.jl-515b7ef8-bac0-55e1-a220-237e90591ccc | 7a1acc28354cfa94cea28cf6b520a0cd8c1bd4c7 | [
"MIT"
] | 2 | 2019-07-23T07:27:37.000Z | 2020-02-08T10:42:45.000Z | using HilbertSpaceFillingCurve
using Test
@testset "hilbert" begin
d = 10
for ndims in 2:3, nbits in [8,16]
p = hilbert(d, ndims, nbits)
@test d == hilbert(p, ndims, nbits)
end
@test_throws AssertionError hilbert(d, 2, 64)
end | 17 | 45 | 0.697479 | [
"@testset \"hilbert\" begin\n\nd = 10\nfor ndims in 2:3, nbits in [8,16]\n p = hilbert(d, ndims, nbits)\n @test d == hilbert(p, ndims, nbits)\nend\n\n@test_throws AssertionError hilbert(d, 2, 64)\n\nend"
] |
f75891a3ba16be7ebc580614c60385f31554fd3b | 5,964 | jl | Julia | test/runtests.jl | m-wells/MappedArrays.jl | 8fa8d7d9cc5cf99bd37a7d5f85376916aa7d0857 | [
"MIT"
] | null | null | null | test/runtests.jl | m-wells/MappedArrays.jl | 8fa8d7d9cc5cf99bd37a7d5f85376916aa7d0857 | [
"MIT"
] | null | null | null | test/runtests.jl | m-wells/MappedArrays.jl | 8fa8d7d9cc5cf99bd37a7d5f85376916aa7d0857 | [
"MIT"
] | null | null | null | using MappedArrays
using Test
@test isempty(detect_ambiguities(MappedArrays, Base, Core))
using FixedPointNumbers, OffsetArrays, ColorTypes
@testset "ReadonlyMappedArray" begin
a = [1,4,9,16]
s = view(a', 1:1, [1,2,4])
b = @inferred(mappedarray(sqrt, a))
@test parent(b) === a
@test eltype(b) == ... | 31.389474 | 134 | 0.562039 | [
"@testset \"ReadonlyMappedArray\" begin\n a = [1,4,9,16]\n s = view(a', 1:1, [1,2,4])\n\n b = @inferred(mappedarray(sqrt, a))\n @test parent(b) === a\n @test eltype(b) == Float64\n @test @inferred(getindex(b, 1)) == 1\n @test b[2] == 2\n @test b[3] == 3\n @test b[4] == 4\n @test_throws... |
f75bdd053fb108ea728d4648c9d13f6cbd888302 | 3,087 | jl | Julia | test/QecsimAdaptors.jl | qecsim/TensorNetworkCodes.jl | 2b5850ab834cbeeaa35666c12042d08239c281fe | [
"BSD-3-Clause"
] | null | null | null | test/QecsimAdaptors.jl | qecsim/TensorNetworkCodes.jl | 2b5850ab834cbeeaa35666c12042d08239c281fe | [
"BSD-3-Clause"
] | 2 | 2022-02-21T09:04:57.000Z | 2022-02-25T10:08:33.000Z | test/QecsimAdaptors.jl | qecsim/TensorNetworkCodes.jl | 2b5850ab834cbeeaa35666c12042d08239c281fe | [
"BSD-3-Clause"
] | null | null | null | using Qecsim
using Qecsim.GenericModels: DepolarizingErrorModel, NaiveDecoder
using TensorNetworkCodes
using TensorNetworkCodes.QecsimAdaptors
using Test
@testset "_tnpauli_to_bsf" begin
# single operator
str_pauli = "IXIYIZ"
int_pauli = pauli_rep_change.(collect(str_pauli))
bsf_pauli = QecsimAdaptors.... | 41.16 | 77 | 0.716553 | [
"@testset \"_tnpauli_to_bsf\" begin\n # single operator\n str_pauli = \"IXIYIZ\"\n int_pauli = pauli_rep_change.(collect(str_pauli))\n bsf_pauli = QecsimAdaptors._tnpauli_to_bsf(int_pauli)\n @test bsf_pauli == Qecsim.to_bsf(str_pauli)\n # multiple operators\n str_paulis = [\"XZZXI\", \"IXZZX\",... |
f75d10073dff615904327de63e97cefcbbcf82ce | 12,576 | jl | Julia | test/runtests.jl | ChrisRackauckas/VectorizationBase.jl | edd756facb6dd591220f7e290d0b83283354e720 | [
"MIT"
] | null | null | null | test/runtests.jl | ChrisRackauckas/VectorizationBase.jl | edd756facb6dd591220f7e290d0b83283354e720 | [
"MIT"
] | null | null | null | test/runtests.jl | ChrisRackauckas/VectorizationBase.jl | edd756facb6dd591220f7e290d0b83283354e720 | [
"MIT"
] | null | null | null | using VectorizationBase
using Test
const W64 = VectorizationBase.REGISTER_SIZE ÷ sizeof(Float64)
const W32 = VectorizationBase.REGISTER_SIZE ÷ sizeof(Float32)
A = randn(13, 17); L = length(A); M, N = size(A);
@testset "VectorizationBase.jl" begin
# Write your own tests here.
@test isempty(detect_unbound_args(Vec... | 69.480663 | 227 | 0.710083 | [
"@testset \"VectorizationBase.jl\" begin\n # Write your own tests here.\n@test isempty(detect_unbound_args(VectorizationBase))\n\n@test first(A) === A[1]\n@testset \"Struct-Wrapped Vec\" begin\n@test extract_data(zero(SVec{4,Float64})) === (VE(0.0),VE(0.0),VE(0.0),VE(0.0)) === extract_data(SVec{4,Float64}(0.0))\... |
f75e8ca096e7f649f1fb984ebc8212dddaffd164 | 268 | jl | Julia | test/runtests.jl | adknudson/MvSim.jl | 6c3085289a5e23441f5f0db90f2b3cbbb9b49afc | [
"MIT"
] | 1 | 2021-09-12T12:27:15.000Z | 2021-09-12T12:27:15.000Z | test/runtests.jl | adknudson/MvSim.jl | 6c3085289a5e23441f5f0db90f2b3cbbb9b49afc | [
"MIT"
] | 15 | 2020-07-08T20:07:03.000Z | 2021-01-16T01:56:40.000Z | test/runtests.jl | adknudson/bigsimr.jl | 1843a0607bcaee9b7724842df22aa42e176c910c | [
"MIT"
] | null | null | null | using Test
const tests = [
"Correlation",
"PearsonMatching",
"GeneralizedSDistribution",
"RandomVector",
"Utilities"
]
printstyled("Running tests:\n", color=:blue)
for t in tests
@testset "Test $t" begin
include("$t.jl")
end
end
| 14.888889 | 44 | 0.623134 | [
"@testset \"Test $t\" begin\n include(\"$t.jl\")\n end"
] |
f75e9ed559b23b57b9c1c5ad93fe1247c5639358 | 93 | jl | Julia | test/runtests.jl | csimal/LazyGraphs.jl | d7b70b4110028fd1f29364298ca28ea3fabccfc2 | [
"MIT"
] | null | null | null | test/runtests.jl | csimal/LazyGraphs.jl | d7b70b4110028fd1f29364298ca28ea3fabccfc2 | [
"MIT"
] | null | null | null | test/runtests.jl | csimal/LazyGraphs.jl | d7b70b4110028fd1f29364298ca28ea3fabccfc2 | [
"MIT"
] | null | null | null | using LazyGraphs
using Test
@testset "LazyGraphs.jl" begin
# Write your tests here.
end
| 13.285714 | 30 | 0.741935 | [
"@testset \"LazyGraphs.jl\" begin\n # Write your tests here.\nend"
] |
f75f0499a04fd3b597d5999efd1ddb12b0f42e8f | 845 | jl | Julia | test/Dynamics/mdef.jl | NQCD/NQCDynamics.jl | bf7f0ac5105aab72972cce4cd1f313e63878f474 | [
"MIT"
] | 16 | 2022-01-17T14:34:39.000Z | 2022-03-24T12:11:48.000Z | test/Dynamics/mdef.jl | NQCD/NonadiabaticMolecularDynamics.jl | 491937e0878f15881201e7d637235a5e7f6feb6d | [
"MIT"
] | 37 | 2021-08-18T11:59:08.000Z | 2022-01-02T14:32:58.000Z | test/Dynamics/mdef.jl | NQCD/NonadiabaticMolecularDynamics.jl | 491937e0878f15881201e7d637235a5e7f6feb6d | [
"MIT"
] | 1 | 2022-02-01T16:00:02.000Z | 2022-02-01T16:00:02.000Z | using Test
using NQCDynamics
using Unitful
using UnitfulAtomic
using RecursiveArrayTools: ArrayPartition
using LinearAlgebra: diag
using ComponentArrays
atoms = Atoms([:H, :H])
model = CompositeFrictionModel(Free(), ConstantFriction(1, atoms.masses[1]))
sim = Simulation{MDEF}(atoms, model; temperature=10u"K")
v = zer... | 27.258065 | 77 | 0.711243 | [
"@testset \"friction!\" begin\n gtmp = zeros(length(r), length(r))\n NQCDynamics.DynamicsMethods.ClassicalMethods.friction!(gtmp, r, sim, 0.0)\n @test all(diag(gtmp) .≈ 1.0)\nend"
] |
f75fb5e4074eacc9a5b14eb26f2d6e91e8814175 | 1,238 | jl | Julia | test/conservation.jl | gvn22/ZonalFlow.jl | 3ebfdd1d172f97321df13781239da28597137361 | [
"MIT"
] | 3 | 2021-03-26T10:51:38.000Z | 2022-02-10T03:36:34.000Z | test/conservation.jl | gvn22/ZonalFlow.jl | 3ebfdd1d172f97321df13781239da28597137361 | [
"MIT"
] | 17 | 2020-10-27T12:11:31.000Z | 2021-10-19T14:54:44.000Z | test/conservation.jl | gvn22/ZonalFlow.jl | 3ebfdd1d172f97321df13781239da28597137361 | [
"MIT"
] | 1 | 2021-04-10T12:18:54.000Z | 2021-04-10T12:18:54.000Z | using ZonalFlow
using Test
domain = Domain(extent=(2π,2π),res=(5,5));
coeffs = Coefficients(Ω=2π,θ=0.0,μ=0.0,ν=0.0,ν₄=1.0,linear=true);
forcing = Stochastic(kf=3,dk=1,ε=0.0);
prob = BetaPlane(domain,coeffs,forcing);
tspan = (0.0,1000.0);
tsargs = (
dt=0.001,
adaptive=false,
... | 28.790698 | 76 | 0.534733 | [
"@testset \"Linear Equations\" begin\n for sol in sols\n E,Z = energy(length(prob.d)...,size(prob.d)...,sol.t,sol.u);\n @test E[1] == E[end]\n @test Z[1] == Z[end]\n end\nend",
"@testset \"Nonlinear Equations\" begin\n for sol in sols\n ... |
f76003909b89eb5031185e7af51a319b12fea507 | 1,863 | jl | Julia | test/models/m1010/m1010.jl | rokkuran/DSGE.jl | 9e73c250fe477f941a0e49cff82a808f16048b23 | [
"BSD-3-Clause"
] | null | null | null | test/models/m1010/m1010.jl | rokkuran/DSGE.jl | 9e73c250fe477f941a0e49cff82a808f16048b23 | [
"BSD-3-Clause"
] | null | null | null | test/models/m1010/m1010.jl | rokkuran/DSGE.jl | 9e73c250fe477f941a0e49cff82a808f16048b23 | [
"BSD-3-Clause"
] | 1 | 2020-01-08T12:10:44.000Z | 2020-01-08T12:10:44.000Z | using DSGE
using Test
path = dirname(@__FILE__)
### Model
model = Model1010("ss18")
### Parameters
@testset "Test parameter bounds checking" begin
for θ in model.parameters
@test isa(θ, AbstractParameter)
if !θ.fixed
(left, right) = θ.valuebounds
@test left < θ.value < ri... | 22.445783 | 56 | 0.610843 | [
"@testset \"Test parameter bounds checking\" begin\n for θ in model.parameters\n @test isa(θ, AbstractParameter)\n if !θ.fixed\n (left, right) = θ.valuebounds\n @test left < θ.value < right\n end\n end\nend",
"@testset \"Checking model indices\" begin\n # Endoge... |
f760210800c0cc18dc1c8f574ac26f95cd1ae748 | 1,747 | jl | Julia | test/test_functionlenses.jl | UnofficialJuliaMirrorSnapshots/Setfield.jl-efcf1570-3423-57d1-acb7-fd33fddbac46 | 4536fae5c60fcea2cda4016b770381cfd4e6a774 | [
"MIT"
] | null | null | null | test/test_functionlenses.jl | UnofficialJuliaMirrorSnapshots/Setfield.jl-efcf1570-3423-57d1-acb7-fd33fddbac46 | 4536fae5c60fcea2cda4016b770381cfd4e6a774 | [
"MIT"
] | null | null | null | test/test_functionlenses.jl | UnofficialJuliaMirrorSnapshots/Setfield.jl-efcf1570-3423-57d1-acb7-fd33fddbac46 | 4536fae5c60fcea2cda4016b770381cfd4e6a774 | [
"MIT"
] | null | null | null | module TestFunctionLenses
using Test
using Setfield
@testset "first" begin
obj = (1, 2.0, '3')
l = @lens first(_)
@test get(obj, l) === 1
@test set(obj, l, "1") === ("1", 2.0, '3')
@test (@set first(obj) = "1") === ("1", 2.0, '3')
obj2 = (a=((b=1,), 2), c=3)
@test (@set first(obj2.a).b = '... | 29.610169 | 88 | 0.546079 | [
"@testset \"first\" begin\n obj = (1, 2.0, '3')\n l = @lens first(_)\n @test get(obj, l) === 1\n @test set(obj, l, \"1\") === (\"1\", 2.0, '3')\n @test (@set first(obj) = \"1\") === (\"1\", 2.0, '3')\n\n obj2 = (a=((b=1,), 2), c=3)\n @test (@set first(obj2.a).b = '1') === (a=((b='1',), 2), c=3)... |
f762232335b00ad4ca076074cf4d778da83868bd | 1,874 | jl | Julia | test/testPartialRangeCrossCorrelations.jl | msaroufim/RoME.jl | 1a34ca9b0012185d342070aab3a6c70bf19b6834 | [
"MIT"
] | null | null | null | test/testPartialRangeCrossCorrelations.jl | msaroufim/RoME.jl | 1a34ca9b0012185d342070aab3a6c70bf19b6834 | [
"MIT"
] | null | null | null | test/testPartialRangeCrossCorrelations.jl | msaroufim/RoME.jl | 1a34ca9b0012185d342070aab3a6c70bf19b6834 | [
"MIT"
] | null | null | null |
# see correct result with slanted (narrow) L1 modes at y=+-5. L1 should not be round blobs
# https://github.com/JuliaRobotics/RoME.jl/pull/434#issuecomment-817246038
using RoME
using Test
##
@testset "Test correlation induced by partials" begin
##
# start with an empty factor graph object
N = 200
fg = initfg()... | 20.150538 | 91 | 0.642476 | [
"@testset \"Test correlation induced by partials\" begin\n\n##\n\n# start with an empty factor graph object\nN = 200\nfg = initfg()\ngetSolverParams(fg).N = N\n\ngetSolverParams(fg).useMsgLikelihoods = true\n\naddVariable!(fg, :x0, Pose2)\naddVariable!(fg, :l1, Point2)\naddFactor!(fg, [:x0], PriorPose2( MvNormal([0... |
f76235022ef2bc45a57772af3fc525f856dce7dc | 5,615 | jl | Julia | test/utility_tests.jl | itsdfish/DifferentialEvolutionMCMC.jl | 3974509006e3df0eef74cf82be71586f2045d421 | [
"MIT"
] | 11 | 2020-06-22T07:03:08.000Z | 2022-03-01T06:47:34.000Z | test/utility_tests.jl | itsdfish/DifferentialEvolutionMCMC.jl | 3974509006e3df0eef74cf82be71586f2045d421 | [
"MIT"
] | 40 | 2020-05-28T11:51:19.000Z | 2022-03-26T11:59:22.000Z | test/utility_tests.jl | itsdfish/DifferentialEvolutionMCMC.jl | 3974509006e3df0eef74cf82be71586f2045d421 | [
"MIT"
] | null | null | null | @testset verbose = true "utility tests" begin
@safetestset "Discard Burnin" begin
using DifferentialEvolutionMCMC, Test, Random, Parameters, Distributions
Random.seed!(29542)
N = 10
k = rand(Binomial(N, .5))
data = (N = N,k = k)
prior_loglike(θ) = logpdf(Beta(1, 1),... | 27.935323 | 104 | 0.488157 | [
"@testset verbose = true \"utility tests\" begin \n @safetestset \"Discard Burnin\" begin\n using DifferentialEvolutionMCMC, Test, Random, Parameters, Distributions\n Random.seed!(29542)\n N = 10\n k = rand(Binomial(N, .5))\n data = (N = N,k = k)\n\n prior_loglike(θ) = l... |
f763399e181001cf6dcf97bc016af653862993a0 | 1,842 | jl | Julia | test/duplicates.jl | EarthGoddessDude/DataFrames.jl | 936d1155414b61d46633417340b86181a8863c8e | [
"MIT"
] | 4 | 2020-05-11T18:52:59.000Z | 2021-05-19T06:32:02.000Z | test/duplicates.jl | EarthGoddessDude/DataFrames.jl | 936d1155414b61d46633417340b86181a8863c8e | [
"MIT"
] | 1 | 2019-01-14T17:35:31.000Z | 2019-07-06T23:10:44.000Z | test/duplicates.jl | EarthGoddessDude/DataFrames.jl | 936d1155414b61d46633417340b86181a8863c8e | [
"MIT"
] | null | null | null | module TestDuplicates
using Test, DataFrames, CategoricalArrays
const ≅ = isequal
@testset "nonunique" begin
df = DataFrame(a = [1, 2, 3, 3, 4])
udf = DataFrame(a = [1, 2, 3, 4])
@test nonunique(df) == [false, false, false, true, false]
@test udf == unique(df)
unique!(df)
@test df == udf
@... | 40.933333 | 105 | 0.579262 | [
"@testset \"nonunique\" begin\n df = DataFrame(a = [1, 2, 3, 3, 4])\n udf = DataFrame(a = [1, 2, 3, 4])\n @test nonunique(df) == [false, false, false, true, false]\n @test udf == unique(df)\n unique!(df)\n @test df == udf\n @test_throws ArgumentError unique(df, true)\n\n pdf = DataFrame(a = ... |
f7636223bf6071f8edcd3efac92cca54f4a221ff | 9,698 | jl | Julia | test/SLM/property.jl | chenwilliam77/EconFixedPointPDEs | 50ce1f61fc796605a2d0e81b08dd472444182e2b | [
"MIT"
] | 1 | 2021-01-31T00:29:04.000Z | 2021-01-31T00:29:04.000Z | test/SLM/property.jl | chenwilliam77/EconFixedPointPDEs | 50ce1f61fc796605a2d0e81b08dd472444182e2b | [
"MIT"
] | null | null | null | test/SLM/property.jl | chenwilliam77/EconFixedPointPDEs | 50ce1f61fc796605a2d0e81b08dd472444182e2b | [
"MIT"
] | 1 | 2021-12-19T16:40:44.000Z | 2021-12-19T16:40:44.000Z | using Test, FileIO, ModelConstructors
include(joinpath(dirname(@__FILE__), "../../src/includeall.jl"))
rp = joinpath(dirname(@__FILE__), "../reference/SLM") # reference path
# Set up inputs
input_inc = load(joinpath(rp, "find_solution_input.jld2"))
input_dec = load(joinpath(rp, "find_solution_input_decrease.jld2"))
in... | 46.850242 | 142 | 0.648484 | [
"@testset \"Scaling\" begin\n d_false = deepcopy(d)\n d_false[:scaling] = false\n yscale_inc = load(joinpath(rp, \"scaleproblem.jld2\"))\n yscale_dec = load(joinpath(rp, \"scaleproblem_decrease.jld2\"))\n yscale_sin = load(joinpath(rp, \"scaleproblem_sine.jld2\"))\n leftval_inc = load(joinpath(rp,... |
f7662de5a8e626b277fefe3ce8c479ff09c61bb2 | 1,245 | jl | Julia | test/rank_by_consensus.jl | Durzot/MT_NMF | a3e3c2fb4a23cc09e78e1ad1e324787c6017a4fc | [
"MIT"
] | null | null | null | test/rank_by_consensus.jl | Durzot/MT_NMF | a3e3c2fb4a23cc09e78e1ad1e324787c6017a4fc | [
"MIT"
] | null | null | null | test/rank_by_consensus.jl | Durzot/MT_NMF | a3e3c2fb4a23cc09e78e1ad1e324787c6017a4fc | [
"MIT"
] | null | null | null | using VariantsNMF
using Test
#### simulate
V = get_one_simulated_V()
@testset "nmf_FI" begin
#### params for rank selection
rc_params = RCParams(
K_min = 2,
K_max = 6,
n_iter = 10
)
#### nmf β-divergence, multiplicative updates
nmf_global_params = NMFParams(
init ... | 25.408163 | 59 | 0.583133 | [
"@testset \"nmf_FI\" begin\n #### params for rank selection\n rc_params = RCParams(\n K_min = 2,\n K_max = 6,\n n_iter = 10\n )\n\n #### nmf β-divergence, multiplicative updates\n nmf_global_params = NMFParams(\n init = :random,\n dist = truncated(... |
f76828962b7f157fe728585cfec434da7d31759b | 33,111 | jl | Julia | test/runtests.jl | harivnkochi/UnderwaterAcoustics.jl | 23d090431f292890dad70e77c17dff414008fcfc | [
"MIT"
] | null | null | null | test/runtests.jl | harivnkochi/UnderwaterAcoustics.jl | 23d090431f292890dad70e77c17dff414008fcfc | [
"MIT"
] | null | null | null | test/runtests.jl | harivnkochi/UnderwaterAcoustics.jl | 23d090431f292890dad70e77c17dff414008fcfc | [
"MIT"
] | null | null | null | using Test
using UnderwaterAcoustics
using UnderwaterAcoustics: amp2db, db2amp
using ForwardDiff
@testset "basic" begin
@test soundspeed() ≈ 1539.0 atol=0.1
@test soundspeed(; voidfrac=1e-5) ≈ 1402.1 atol=0.1
@test soundspeed(; voidfrac=1.0) ≈ 340.0
@test amp2db(absorption(10000, 1000.0, 35.0, 15.0)) ≈ -1.0 ... | 43.339005 | 118 | 0.627495 | [
"@testset \"basic\" begin\n\n @test soundspeed() ≈ 1539.0 atol=0.1\n @test soundspeed(; voidfrac=1e-5) ≈ 1402.1 atol=0.1\n @test soundspeed(; voidfrac=1.0) ≈ 340.0\n\n @test amp2db(absorption(10000, 1000.0, 35.0, 15.0)) ≈ -1.0 atol=0.5\n @test amp2db(absorption(50000)) ≈ -11.0 atol=0.5\n @test amp2db(absorpti... |
f76a7a9c95f5a981d2ad23560f04ff76a7d19c8a | 2,215 | jl | Julia | test/_fast.jl | jw3126/AxisKeys.jl | ec293e172abfd832f2fa31ae190c4737b0a18f7d | [
"MIT"
] | 104 | 2020-03-18T17:16:47.000Z | 2022-02-22T12:35:16.000Z | test/_fast.jl | jw3126/AxisKeys.jl | ec293e172abfd832f2fa31ae190c4737b0a18f7d | [
"MIT"
] | 88 | 2020-03-14T19:54:46.000Z | 2022-03-22T20:33:48.000Z | test/_fast.jl | jw3126/AxisKeys.jl | ec293e172abfd832f2fa31ae190c4737b0a18f7d | [
"MIT"
] | 19 | 2020-03-20T11:57:50.000Z | 2022-01-16T10:21:26.000Z | using Test, AxisKeys, BenchmarkTools
@testset "indexing & lookup" begin
A = wrapdims(rand(2,3), 11.0:12.0, [:a, :b, :c])
if VERSION >= v"1.2"
# getindex
@test 0 == @ballocated $A[1, 1]
@test 272 >= @ballocated $A[1, :]
@test (@inferred A[1, :]; true)
@test (@inferred v... | 30.342466 | 86 | 0.550339 | [
"@testset \"indexing & lookup\" begin\n\n A = wrapdims(rand(2,3), 11.0:12.0, [:a, :b, :c])\n\n if VERSION >= v\"1.2\"\n # getindex\n @test 0 == @ballocated $A[1, 1]\n @test 272 >= @ballocated $A[1, :]\n @test (@inferred A[1, :]; true)\n @test (@inferred view(A, 1, :); true)\... |
f76c5f73ffe2766fcae1a29dafa004ee9b851bc9 | 942 | jl | Julia | test/datasets_test.jl | mjirik/LarSurf.jl | de2eaec62dfe8c63e7d621bc973aa01d8de019c6 | [
"MIT"
] | 2 | 2019-09-17T22:56:08.000Z | 2020-01-04T09:50:42.000Z | test/datasets_test.jl | mjirik/lario3d.jl | de2eaec62dfe8c63e7d621bc973aa01d8de019c6 | [
"MIT"
] | 1 | 2019-11-16T15:47:22.000Z | 2019-11-18T17:43:46.000Z | test/datasets_test.jl | mjirik/lario3d.jl | de2eaec62dfe8c63e7d621bc973aa01d8de019c6 | [
"MIT"
] | 1 | 2021-03-05T15:01:47.000Z | 2021-03-05T15:01:47.000Z | using Test
using Logging
# using Revise
using LarSurf
# Logging.configure(level==Logging.Debug)
# include("../src/LarSurf.jl")
# include("../src/block.jl")
@testset "Block basic function Tests" begin
data3d = LarSurf.random_image([7, 7, 7], [1,2,2], [3, 4, 5], 2)
@test maximum(data3d) > 2
@test minimum(d... | 24.153846 | 68 | 0.686837 | [
"@testset \"Block basic function Tests\" begin\n data3d = LarSurf.random_image([7, 7, 7], [1,2,2], [3, 4, 5], 2)\n @test maximum(data3d) > 2\n @test minimum(data3d) < 1\nend",
"@testset \"Tetris\" begin\n segmentation = LarSurf.tetris_brick()\n @test minimum(segmentation) == 0\n @test maximum(se... |
f76ea9c014f7c98b9151b679053cecf996211dc3 | 2,867 | jl | Julia | test/runtests.jl | tobydriscoll/fnc | dde6097e6a9efff3c8cd7748c96214b4fcec2dc4 | [
"MIT"
] | 31 | 2020-07-15T15:31:47.000Z | 2022-03-14T14:48:49.000Z | test/runtests.jl | tobydriscoll/fnc | dde6097e6a9efff3c8cd7748c96214b4fcec2dc4 | [
"MIT"
] | 4 | 2020-07-20T15:42:58.000Z | 2022-02-08T19:08:43.000Z | test/runtests.jl | tobydriscoll/fnc | dde6097e6a9efff3c8cd7748c96214b4fcec2dc4 | [
"MIT"
] | 12 | 2020-07-26T17:42:14.000Z | 2022-01-24T06:10:19.000Z | using FundamentalsNumericalComputation
using Test
@testset "Chapter 1" begin
@test FNC.horner([-1,3,-3,1],1.6) ≈ 0.6^3
end
@testset "Chapter 2" begin
A = [ 1 2 3 0; -1 1 2 -1; 3 1 2 4; 1 1 1 1 ]
L,U = FNC.lufact(A)
@test norm(L*U - A) < 100eps()
@test norm(U - triu(U)) < 100eps()
@test norm(L - tril(L)) < 100ep... | 24.930435 | 69 | 0.531217 | [
"@testset \"Chapter 1\" begin\n\t@test FNC.horner([-1,3,-3,1],1.6) ≈ 0.6^3\nend",
"@testset \"Chapter 2\" begin\n\tA = [ 1 2 3 0; -1 1 2 -1; 3 1 2 4; 1 1 1 1 ]\n\tL,U = FNC.lufact(A)\n\t@test norm(L*U - A) < 100eps()\n\t@test norm(U - triu(U)) < 100eps()\n\t@test norm(L - tril(L)) < 100eps()\n\tb = [1,10,0,-1] / ... |
f774b41915333f01b265988666134303e7b44ba5 | 12,852 | jl | Julia | test/fit.jl | pdeffebach/Distributions.jl | 8aea3cc82ee2f8ffe1e8cd754e7fcd99369c7a1c | [
"MIT"
] | 852 | 2015-01-03T14:38:13.000Z | 2022-03-31T19:04:52.000Z | test/fit.jl | pdeffebach/Distributions.jl | 8aea3cc82ee2f8ffe1e8cd754e7fcd99369c7a1c | [
"MIT"
] | 1,133 | 2015-01-12T20:37:42.000Z | 2022-03-28T16:18:57.000Z | test/fit.jl | pdeffebach/Distributions.jl | 8aea3cc82ee2f8ffe1e8cd754e7fcd99369c7a1c | [
"MIT"
] | 467 | 2015-01-14T14:30:55.000Z | 2022-03-30T22:32:51.000Z | # Testing:
#
# - computation of sufficient statistics
# - distribution fitting (i.e. estimation)
#
using Distributions
using Test, Random, LinearAlgebra
n0 = 100
N = 10^5
rng = MersenneTwister(123)
const funcs = ([rand,rand], [dist -> rand(rng, dist), (dist, n) -> rand(rng, dist, n)])
@testset "Testing fit for ... | 28.184211 | 87 | 0.519297 | [
"@testset \"Testing fit for DiscreteUniform\" begin\n for func in funcs\n w = func[1](n0)\n\n x = func[2](DiscreteUniform(10, 15), n0)\n d = fit(DiscreteUniform, x)\n @test isa(d, DiscreteUniform)\n @test minimum(d) == minimum(x)\n @test maximum(d) == maximum(x)\n\n ... |
f777386a69e39ffadf6bc200cc05b4a48c79f03a | 50,351 | jl | Julia | test/runtests.jl | kevmoor/GXBeam.jl | 7536c97cc103d7ae53bb6e0b1d2ae4a5196a35a1 | [
"MIT"
] | null | null | null | test/runtests.jl | kevmoor/GXBeam.jl | 7536c97cc103d7ae53bb6e0b1d2ae4a5196a35a1 | [
"MIT"
] | null | null | null | test/runtests.jl | kevmoor/GXBeam.jl | 7536c97cc103d7ae53bb6e0b1d2ae4a5196a35a1 | [
"MIT"
] | null | null | null | using GXBeam
using LinearAlgebra
using DifferentialEquations
using Test
import Elliptic
using ForwardDiff
@testset "Math" begin
c = rand(3)
cdot = rand(3)
# get_C_θ
C_θ1, C_θ2, C_θ3 = GXBeam.get_C_θ(c)
@test isapprox(C_θ1, ForwardDiff.derivative(c1 -> GXBeam.get_C([c1, c[2], c[3]]), c[1]))
... | 32.844749 | 132 | 0.606363 | [
"@testset \"Math\" begin\n \n c = rand(3)\n cdot = rand(3)\n\n # get_C_θ\n C_θ1, C_θ2, C_θ3 = GXBeam.get_C_θ(c)\n @test isapprox(C_θ1, ForwardDiff.derivative(c1 -> GXBeam.get_C([c1, c[2], c[3]]), c[1]))\n @test isapprox(C_θ2, ForwardDiff.derivative(c2 -> GXBeam.get_C([c[1], c2, c[3]]), c[2]))\n... |
f77aa451320125b4e96e109583a22fd866ac7168 | 798 | jl | Julia | test/multithreaded.jl | ThomasRetornaz/ImageMorphology.jl | 3181b69eab153fec9eeb0eaa55e97000252fa895 | [
"MIT"
] | null | null | null | test/multithreaded.jl | ThomasRetornaz/ImageMorphology.jl | 3181b69eab153fec9eeb0eaa55e97000252fa895 | [
"MIT"
] | null | null | null | test/multithreaded.jl | ThomasRetornaz/ImageMorphology.jl | 3181b69eab153fec9eeb0eaa55e97000252fa895 | [
"MIT"
] | null | null | null | # This doesn't run under "runtests.jl" but does under CI
using ImageMorphology
using Test
@testset "multithreaded" begin
@test Threads.nthreads() > 1
@testset "feature_transform" begin
img = rand(100, 128) .> 0.9
@test feature_transform(img; nthreads=Threads.nthreads()) ==
feature_t... | 38 | 103 | 0.651629 | [
"@testset \"multithreaded\" begin\n @test Threads.nthreads() > 1\n @testset \"feature_transform\" begin\n img = rand(100, 128) .> 0.9\n @test feature_transform(img; nthreads=Threads.nthreads()) ==\n feature_transform(img; nthreads=1)\n # Since the threaded implementation handle... |
f77ab07997532ed4da6cc0a744ee2f8ae77132ff | 200 | jl | Julia | test/runtests.jl | giandopal/MyExample | 1cf4af029843abb069114e2bd3001564d7125811 | [
"MIT"
] | null | null | null | test/runtests.jl | giandopal/MyExample | 1cf4af029843abb069114e2bd3001564d7125811 | [
"MIT"
] | null | null | null | test/runtests.jl | giandopal/MyExample | 1cf4af029843abb069114e2bd3001564d7125811 | [
"MIT"
] | null | null | null | using MyExample
using Test
my_f(2,1)
MyExample.greet2()
MyExample.my_f2(1,1)
@testset "MyExample.jl" begin
@test MyExample.my_f(2,1)==5
@test MyExample.my_f(2,3)==7
@test my_f(2,3)=9
end
| 16.666667 | 32 | 0.685 | [
"@testset \"MyExample.jl\" begin\n @test MyExample.my_f(2,1)==5\n @test MyExample.my_f(2,3)==7\n @test my_f(2,3)=9\nend"
] |
f77b1550f23602d89921d2589260ed7e29ff3059 | 1,554 | jl | Julia | test/data.jl | EvilDonkey420/OpenML.jl | 1a11b2a4aa761ff029e721e45d748c6282b750d6 | [
"MIT"
] | 1 | 2021-09-24T14:21:05.000Z | 2021-09-24T14:21:05.000Z | test/data.jl | EvilDonkey420/OpenML.jl | 1a11b2a4aa761ff029e721e45d748c6282b750d6 | [
"MIT"
] | null | null | null | test/data.jl | EvilDonkey420/OpenML.jl | 1a11b2a4aa761ff029e721e45d748c6282b750d6 | [
"MIT"
] | null | null | null | module TestOpenml
using Test
using HTTP
using OpenML
import Tables.istable
response_test = OpenML.load_Dataset_Description(61)
ntp_test = OpenML.load(61)
@test istable(ntp_test)
dqlist_test = OpenML.load_Data_Qualities_List()
data_features_test = OpenML.load_Data_Features(61)
data_qualities_test = OpenML.load_Data_Qu... | 28.254545 | 84 | 0.714929 | [
"@testset \"HTTP connection\" begin\n @test typeof(response_test) <: Dict\n @test response_test[\"data_set_description\"][\"name\"] == \"iris\"\n @test response_test[\"data_set_description\"][\"format\"] == \"ARFF\"\nend",
"@testset \"ARFF file conversion to NamedTuples\" begin\n @test isempty(ntp_tes... |
f780005034669c2e2b793ced2dbf0c3570ec0184 | 8,418 | jl | Julia | test/test_bracketing.jl | alecloudenback/Roots.jl | 299e5ead40ad16d112d461ab2a736ccc44eeafd0 | [
"MIT"
] | null | null | null | test/test_bracketing.jl | alecloudenback/Roots.jl | 299e5ead40ad16d112d461ab2a736ccc44eeafd0 | [
"MIT"
] | null | null | null | test/test_bracketing.jl | alecloudenback/Roots.jl | 299e5ead40ad16d112d461ab2a736ccc44eeafd0 | [
"MIT"
] | null | null | null | using Roots
using Test
using Printf
## testing bracketing methods
## Orignially by John Travers
#
#
## This set of tests is very useful for benchmarking the number of function
## calls, failures, and max errors for the various bracketing methods.
## Table 1 from TOMS748 by Alefeld, Potra, Shi
mutable struct Func
... | 27.509804 | 156 | 0.509979 | [
"@testset \"bracketing methods\" begin\n\n ## Test for failures, ideally all of these would be 0\n ## test for residual, ideally small\n ## test for evaluation counts, ideally not so low for these problems\n\n\n ## exact_bracket\n Ms = [Roots.A42(), Roots.AlefeldPotraShi(), Roots.Bisection()]\n re... |
f7814ef0e18bf636d2636df0a4aba72493a4483b | 732 | jl | Julia | test/codegen/julia/node.jl | xgdgsc/Comonicon.jl | 8c8a46549bf7d88c0e4b3ea1cc02bdf5e0baa7cc | [
"MIT"
] | 52 | 2021-06-01T10:00:10.000Z | 2022-03-13T07:15:42.000Z | test/codegen/julia/node.jl | Leticia-maria/Comonicon.jl | a7c38f9378f32a70396c5aaa5607b46391c921a4 | [
"MIT"
] | 51 | 2021-05-24T19:35:35.000Z | 2022-03-17T07:51:58.000Z | test/codegen/julia/node.jl | Leticia-maria/Comonicon.jl | a7c38f9378f32a70396c5aaa5607b46391c921a4 | [
"MIT"
] | 7 | 2021-06-04T21:28:27.000Z | 2022-02-21T03:26:01.000Z | module TestNodeCommand
using Comonicon.AST
using Comonicon.JuliaExpr
using Comonicon.JuliaExpr: emit, emit_body, emit_norm_body, emit_dash_body
using Test
function called()
@test true
end
cmd = Entry(;
version = v"1.2.0",
root = NodeCommand(;
name = "node",
subcmds = Dict(
"cm... | 21.529412 | 74 | 0.586066 | [
"@testset \"test node\" begin\n @test command_main([\"cmd3\"]) == 1\n @test command_main([\"cmd1\", \"foo\"]) == 1\n @test command_main([\"cmd1\", \"foo\", \"-h\"]) == 0\n @test command_main([\"cmd1\", \"foo\", \"-V\"]) == 0\n @test command_main(String[]) == 1\nend"
] |
f78279cfc365ded66a2110e44246f23fdc8f5253 | 48,698 | jl | Julia | stdlib/LinearAlgebra/test/dense.jl | GiggleLiu/julia | 6e894ccd56274b62b169d949b67ea150a12090bb | [
"Zlib"
] | null | null | null | stdlib/LinearAlgebra/test/dense.jl | GiggleLiu/julia | 6e894ccd56274b62b169d949b67ea150a12090bb | [
"Zlib"
] | null | null | null | stdlib/LinearAlgebra/test/dense.jl | GiggleLiu/julia | 6e894ccd56274b62b169d949b67ea150a12090bb | [
"Zlib"
] | null | null | null | # This file is a part of Julia. License is MIT: https://julialang.org/license
module TestDense
using Test, LinearAlgebra, Random
using LinearAlgebra: BlasComplex, BlasFloat, BlasReal
@testset "Check that non-floats are correctly promoted" begin
@test [1 0 0; 0 1 0]\[1,1] ≈ [1;1;0]
end
n = 10
# Split n into 2 p... | 40.854027 | 143 | 0.505524 | [
"@testset \"Check that non-floats are correctly promoted\" begin\n @test [1 0 0; 0 1 0]\\[1,1] ≈ [1;1;0]\nend",
"@testset \"Matrix condition number\" begin\n ainit = rand(n,n)\n @testset \"for $elty\" for elty in (Float32, Float64, ComplexF32, ComplexF64)\n ainit = convert(Matrix{elty}, ainit)\n ... |
f786fb70e13de65553bb39105d496a5ba9839a83 | 3,294 | jl | Julia | test/runtests.jl | sid-dey/PBDS.jl | d4d1d2af0753c60d7082e24c714734eb3ad5fda6 | [
"MIT"
] | 13 | 2021-01-05T01:09:19.000Z | 2022-02-24T03:10:45.000Z | test/runtests.jl | sid-dey/PBDS.jl | d4d1d2af0753c60d7082e24c714734eb3ad5fda6 | [
"MIT"
] | 1 | 2021-09-03T03:39:30.000Z | 2021-09-03T03:39:30.000Z | test/runtests.jl | sid-dey/PBDS.jl | d4d1d2af0753c60d7082e24c714734eb3ad5fda6 | [
"MIT"
] | 1 | 2021-02-27T23:52:02.000Z | 2021-02-27T23:52:02.000Z | using PBDS
using Test
using NBInclude
@testset "Examples" begin
"no_plots" in ARGS && (global const no_plots = true)
PBDS_dir = joinpath(@__DIR__, "..", "examples", "PBDS")
test_notebook = "R7Arm_DynamicMugGrasping"
@testset "$test_notebook" begin
file = string(test_notebook, ".ipynb")
... | 42.779221 | 100 | 0.60595 | [
"@testset \"Examples\" begin\n \"no_plots\" in ARGS && (global const no_plots = true)\n PBDS_dir = joinpath(@__DIR__, \"..\", \"examples\", \"PBDS\")\n\n test_notebook = \"R7Arm_DynamicMugGrasping\"\n @testset \"$test_notebook\" begin\n file = string(test_notebook, \".ipynb\")\n @nbinclude... |
f78a1288629efb613a10d2bcea6748e09d3df249 | 720 | jl | Julia | test/tree.jl | eascarrunz/Phylodendron2.jl | e4164a2b6209536fcca9706890e53fba130f5165 | [
"MIT"
] | null | null | null | test/tree.jl | eascarrunz/Phylodendron2.jl | e4164a2b6209536fcca9706890e53fba130f5165 | [
"MIT"
] | 2 | 2019-12-09T23:25:59.000Z | 2019-12-23T19:44:05.000Z | test/tree.jl | eascarrunz/Phylodendron2.jl | e4164a2b6209536fcca9706890e53fba130f5165 | [
"MIT"
] | null | null | null | using Phylodendron2
using Test
@testset "Linking and unlinking" begin
a = Node("A")
b = Node("B")
c = Node("C")
d = Node("D")
e = Node("E")
br_ab = Branch()
link!(a, b, br_ab)
link!(a, c)
link!(c, d)
link!(c, e)
@test length(a.links) == 2
@test a.links[1].to == b
@test a.links[2].to == c
@test length(... | 20 | 38 | 0.581944 | [
"@testset \"Linking and unlinking\" begin\n\ta = Node(\"A\")\n\tb = Node(\"B\")\n\tc = Node(\"C\")\n\td = Node(\"D\")\n\te = Node(\"E\")\n\n\tbr_ab = Branch()\n\n\tlink!(a, b, br_ab)\n\tlink!(a, c)\n\tlink!(c, d)\n\tlink!(c, e)\n\n\t@test length(a.links) == 2\n\t@test a.links[1].to == b\n\t@test a.links[2].to == c\... |
f78ca5527140bff7043a310d947902909a78e74d | 681 | jl | Julia | test/iterativesolvers.jl | saolof/ITensors.jl | ae84b80ef55271dca1aa39dfcd4db350c4e864e1 | [
"Apache-2.0"
] | 1 | 2021-12-14T10:09:02.000Z | 2021-12-14T10:09:02.000Z | test/iterativesolvers.jl | saolof/ITensors.jl | ae84b80ef55271dca1aa39dfcd4db350c4e864e1 | [
"Apache-2.0"
] | null | null | null | test/iterativesolvers.jl | saolof/ITensors.jl | ae84b80ef55271dca1aa39dfcd4db350c4e864e1 | [
"Apache-2.0"
] | null | null | null | using ITensors
using Test
# Wrap an ITensor with pairs of primed and
# unprimed indices to pass to davidson
struct ITensorMap
A::ITensor
end
Base.eltype(M::ITensorMap) = eltype(M.A)
Base.size(M::ITensorMap) = dim(IndexSet(filterinds(M.A; plev=0)...))
(M::ITensorMap)(v::ITensor) = noprime(M.A * v)
@testset "Complex ... | 21.967742 | 68 | 0.628488 | [
"@testset \"Complex davidson\" begin\n d = 10\n i = Index(d, \"i\")\n A = randomITensor(ComplexF64, i, i')\n A = mapprime(A * mapprime(dag(A), 0 => 2), 2 => 1)\n M = ITensorMap(A)\n \n v = randomITensor(i)\n λ, v = davidson(M, v; maxiter = 10)\n @test M(v) ≈ λ * v\n \n v = randomITensor(ComplexF64, i... |
f78f15a12b33756293cc7614ddd3a48769b91043 | 1,226 | jl | Julia | test/runtests.jl | akio-tomiya/Gaugefields.jl | dd2180dfe54eba7826ddd45a13ab2f5a007857d1 | [
"MIT"
] | 1 | 2022-01-24T14:21:45.000Z | 2022-01-24T14:21:45.000Z | test/runtests.jl | akio-tomiya/Gaugefields.jl | dd2180dfe54eba7826ddd45a13ab2f5a007857d1 | [
"MIT"
] | 12 | 2022-01-18T01:51:48.000Z | 2022-03-25T01:14:03.000Z | test/runtests.jl | akio-tomiya/Gaugefields.jl | dd2180dfe54eba7826ddd45a13ab2f5a007857d1 | [
"MIT"
] | null | null | null | using Gaugefields
using Test
using Random
import Wilsonloop:loops_staple
const eps = 1e-1
@testset "gradientflow_general" begin
println("gradientflow with general action")
include("gradientflow_general.jl")
end
@testset "gradientflow nowing" begin
println("gradientflow nowing")
include("gradientflow... | 13.775281 | 52 | 0.71044 | [
"@testset \"gradientflow_general\" begin\n println(\"gradientflow with general action\")\n include(\"gradientflow_general.jl\")\nend",
"@testset \"gradientflow nowing\" begin\n println(\"gradientflow nowing\")\n include(\"gradientflow_test_nowing.jl\")\nend",
"@testset \"gradientflow\" begin\n pr... |
f79380ae33149f55e9f70eaec12827788dc2879f | 5,480 | jl | Julia | test/runtests.jl | JuliaTagBot/CharibdeOptim.jl | a1ec17ded88dbc8d0720bb3f220f4d728fecbba3 | [
"ISC"
] | null | null | null | test/runtests.jl | JuliaTagBot/CharibdeOptim.jl | a1ec17ded88dbc8d0720bb3f220f4d728fecbba3 | [
"ISC"
] | null | null | null | test/runtests.jl | JuliaTagBot/CharibdeOptim.jl | a1ec17ded88dbc8d0720bb3f220f4d728fecbba3 | [
"ISC"
] | null | null | null | using Test, JuMP
using Distributed
addprocs(2)
@everywhere using CharibdeOptim
@everywhere using IntervalArithmetic
@testset "Using Charibde for Constrained Optimsation" begin
@everywhere using ModelingToolkit
@everywhere vars = ModelingToolkit.@variables x y
@everywhere C1 = constraint(vars, x+y, ... | 40 | 182 | 0.598723 | [
"@testset \"Using Charibde for Constrained Optimsation\" begin\n @everywhere using ModelingToolkit\n\n @everywhere vars = ModelingToolkit.@variables x y\n @everywhere C1 = constraint(vars, x+y, -Inf..4)\n @everywhere C2 = constraint(vars, x+3y, -Inf..9)\n @everywhere constraints = [C1, C2]\... |
f7955887e028c72bfb30ed41a2e1d562fd0442b1 | 2,454 | jl | Julia | test/runtests.jl | rbontekoe/AppliMaster.jl | cf0c5bf13120980650609480f13e836bcaabd622 | [
"MIT"
] | null | null | null | test/runtests.jl | rbontekoe/AppliMaster.jl | cf0c5bf13120980650609480f13e836bcaabd622 | [
"MIT"
] | null | null | null | test/runtests.jl | rbontekoe/AppliMaster.jl | cf0c5bf13120980650609480f13e836bcaabd622 | [
"MIT"
] | null | null | null | # runtests.jl
using AppliMaster
using Test
using AppliAR, AppliSales, AppliGeneralLedger
using Query
using DataFrames
using Dates
@testset "Test AppliSales" begin
orders = AppliSales.process()
@test length(orders) == 3
@test length(orders[1].students) == 1
@test length(orders[2].students) == 2
... | 30.675 | 105 | 0.690709 | [
"@testset \"Test AppliSales\" begin\n orders = AppliSales.process()\n @test length(orders) == 3\n @test length(orders[1].students) == 1\n @test length(orders[2].students) == 2\n @test length(orders[3].students) == 1\n @test orders[1].training.price == 1000\nend",
"@testset \" Test AppliAR - unpa... |
f79651a2e460201b9a8e127eb2cf8b1e17288477 | 2,082 | jl | Julia | test/box.jl | April-Hannah-Lena/GAIO.jl | 5cc55575a615db337312a07fa295cf08f87d8cb4 | [
"MIT"
] | 7 | 2020-07-12T13:48:31.000Z | 2021-12-20T02:11:02.000Z | test/box.jl | April-Hannah-Lena/GAIO.jl | 5cc55575a615db337312a07fa295cf08f87d8cb4 | [
"MIT"
] | 25 | 2020-07-10T10:40:02.000Z | 2022-03-30T09:01:02.000Z | test/box.jl | April-Hannah-Lena/GAIO.jl | 5cc55575a615db337312a07fa295cf08f87d8cb4 | [
"MIT"
] | 3 | 2020-07-15T11:23:28.000Z | 2021-12-20T02:11:05.000Z | using GAIO
using StaticArrays
using Test
@testset "exported functionality" begin
@testset "basics" begin
center = SVector(0.0, 0.1)
radius = SVector(10.0, 10.0)
box = Box(center, radius)
@test box.center == center
@test box.radius == radius
end
@testset "types" begin... | 33.047619 | 63 | 0.580211 | [
"@testset \"exported functionality\" begin\n @testset \"basics\" begin\n center = SVector(0.0, 0.1)\n radius = SVector(10.0, 10.0)\n box = Box(center, radius)\n @test box.center == center\n @test box.radius == radius\n end\n @testset \"types\" begin\n center = SVec... |
f79b047288c0de98e54f43ae36be2f8248502143 | 8,483 | jl | Julia | test/sample_test.jl | pitmonticone/MitosisStochasticDiffEq.jl | f9f3621e6610b0f29a0418de59d0a85fa7b401f9 | [
"MIT"
] | 11 | 2021-02-21T20:52:11.000Z | 2022-01-26T13:06:30.000Z | test/sample_test.jl | pitmonticone/MitosisStochasticDiffEq.jl | f9f3621e6610b0f29a0418de59d0a85fa7b401f9 | [
"MIT"
] | 46 | 2020-10-18T15:38:19.000Z | 2021-10-05T22:32:51.000Z | test/sample_test.jl | pitmonticone/MitosisStochasticDiffEq.jl | f9f3621e6610b0f29a0418de59d0a85fa7b401f9 | [
"MIT"
] | 2 | 2021-04-02T21:54:59.000Z | 2021-08-14T11:03:29.000Z | import MitosisStochasticDiffEq as MSDE
using StochasticDiffEq
using Mitosis
using LinearAlgebra
using SparseArrays
using DiffEqNoiseProcess
using Test, Random
"""
forwardsample(f, g, p, s, W, x) using the Euler-Maruyama scheme
on a time-grid s with associated noise values W
"""
function forwardsample(f, g, p, s, Ws, ... | 33.662698 | 111 | 0.597077 | [
"@testset \"sampling tests\" begin\n # define SDE function\n f(u,p,t) = p[1]*u + p[2] - 1.5*sin.(u*2pi)\n g(u,p,t) = p[3] .- 0.2*(1 .-sin.(u))\n\n # set estimate of model parameters or true model parameters\n p = [-0.1,0.2,0.9]\n\n # time range\n tstart = 0.0\n tend = 1.0\n dt = 0.02\n trange = tstart:dt:... |
f79bc25a4211811480a39c93622746f15296898e | 30,461 | jl | Julia | test/reflection.jl | rfourquet/julia | 18674303bdfb5670f3bd36dd0e6ba0e6cf2bcd8b | [
"Zlib"
] | 1 | 2020-08-14T16:07:35.000Z | 2020-08-14T16:07:35.000Z | test/reflection.jl | rfourquet/julia | 18674303bdfb5670f3bd36dd0e6ba0e6cf2bcd8b | [
"Zlib"
] | null | null | null | test/reflection.jl | rfourquet/julia | 18674303bdfb5670f3bd36dd0e6ba0e6cf2bcd8b | [
"Zlib"
] | null | null | null | # This file is a part of Julia. License is MIT: https://julialang.org/license
using Test
# code_native / code_llvm (issue #8239)
# It's hard to really test these, but just running them should be
# sufficient to catch segfault bugs.
module ReflectionTest
using Test, Random
function test_ir_reflection(freflect, f, ty... | 33.584344 | 143 | 0.681593 | [
"@testset \"issue #31687\" begin\n import InteractiveUtils._dump_function\n\n @noinline f31687_child(i) = f31687_nonexistent(i)\n f31687_parent() = f31687_child(0)\n params = Base.CodegenParams()\n _dump_function(f31687_parent, Tuple{},\n #=native=#false, #=wrapper=#false, #=strip=#... |
f7a1dcb6a6e2de828dfa43c94a4ac74f64293ff1 | 61,402 | jl | Julia | test/React.jl | lucifer1004/Pluto.jl | bfa99933273e8b6b989759db17e114b2f9879559 | [
"MIT"
] | 1 | 2022-02-04T17:46:20.000Z | 2022-02-04T17:46:20.000Z | test/React.jl | lucifer1004/Pluto.jl | bfa99933273e8b6b989759db17e114b2f9879559 | [
"MIT"
] | 1 | 2022-02-28T12:50:51.000Z | 2022-02-28T12:50:51.000Z | test/React.jl | lucifer1004/Pluto.jl | bfa99933273e8b6b989759db17e114b2f9879559 | [
"MIT"
] | null | null | null | using Test
import Pluto: Configuration, Notebook, ServerSession, ClientSession, update_run!, Cell, WorkspaceManager
import Pluto.Configuration: Options, EvaluationOptions
import Distributed
@testset "Reactivity" begin
🍭 = ServerSession()
🍭.options.evaluation.workspace_use_distributed = false
fakeclient ... | 36.989157 | 159 | 0.55578 | [
"@testset \"Reactivity\" begin\n 🍭 = ServerSession()\n 🍭.options.evaluation.workspace_use_distributed = false\n\n fakeclient = ClientSession(:fake, nothing)\n 🍭.connected_clients[fakeclient.id] = fakeclient\n\n @testset \"Basic $(parallel ? \"distributed\" : \"single-process\")\" for parallel in [... |
f7ab34939f3e4311aa69f0e30b7b159e7529c94c | 78 | jl | Julia | test/data_driven/tokenize.jl | charleskawczynski/BetweenFlags.jl | ed922db49e17b6f7dd5e34f4856dc7a4fc7c3cd9 | [
"Apache-2.0"
] | 3 | 2019-03-08T08:03:03.000Z | 2019-07-26T14:24:14.000Z | test/data_driven/tokenize.jl | charleskawczynski/BetweenFlags.jl | ed922db49e17b6f7dd5e34f4856dc7a4fc7c3cd9 | [
"Apache-2.0"
] | 18 | 2019-02-17T21:10:15.000Z | 2020-10-16T23:54:10.000Z | test/data_driven/tokenize.jl | charleskawczynski/BetweenFlags.jl | ed922db49e17b6f7dd5e34f4856dc7a4fc7c3cd9 | [
"Apache-2.0"
] | 4 | 2019-07-26T14:25:02.000Z | 2020-02-08T11:13:31.000Z | using Test
@testset "Tokenize" begin
include("julia_simple_func.jl")
end
| 13 | 35 | 0.74359 | [
"@testset \"Tokenize\" begin\n include(\"julia_simple_func.jl\")\nend"
] |
f7ac012ffcab6f0e6690d2a0b1bf07758228c768 | 2,790 | jl | Julia | test/runtests.jl | lhnguyen-vn/TreeParzen.jl | d6b4181a45167663e8844330220f0c62c715c75f | [
"BSD-3-Clause"
] | null | null | null | test/runtests.jl | lhnguyen-vn/TreeParzen.jl | d6b4181a45167663e8844330220f0c62c715c75f | [
"BSD-3-Clause"
] | null | null | null | test/runtests.jl | lhnguyen-vn/TreeParzen.jl | d6b4181a45167663e8844330220f0c62c715c75f | [
"BSD-3-Clause"
] | null | null | null | using Test
@time @testset "Unit Tests" begin
@testset "Small functions" begin
@info "Bincount"
@test include("bincount.jl")
@info "Configuration"
@test include("configuration.jl")
@info "dfs"
@test include("dfs.jl")
@info "graph"
@test include("gr... | 22.868852 | 79 | 0.573835 | [
"@time @testset \"Unit Tests\" begin\n @testset \"Small functions\" begin\n\n @info \"Bincount\"\n @test include(\"bincount.jl\")\n\n @info \"Configuration\"\n @test include(\"configuration.jl\")\n\n @info \"dfs\"\n @test include(\"dfs.jl\")\n\n @info \"graph\"\n ... |
f7ae89cdae5a436ac972ba83a753e52357249ef5 | 7,620 | jl | Julia | test/runtests.jl | treigerm/EPT.jl | e4e28168e9f1192273d2882d180432de5aab5a71 | [
"MIT"
] | null | null | null | test/runtests.jl | treigerm/EPT.jl | e4e28168e9f1192273d2882d180432de5aab5a71 | [
"MIT"
] | null | null | null | test/runtests.jl | treigerm/EPT.jl | e4e28168e9f1192273d2882d180432de5aab5a71 | [
"MIT"
] | null | null | null | using EPT
using Turing
using Test
using Random
import AnnealedIS
# rng = MersenneTwister(42)
Random.seed!(42)
@testset "EPT.jl" begin
@testset "Expectation Macro" begin
@expectation function expct(y)
x ~ Normal(0, 1)
y ~ Normal(x, 1)
return x^2
end
yv... | 26.830986 | 92 | 0.556955 | [
"@testset \"EPT.jl\" begin\n @testset \"Expectation Macro\" begin\n @expectation function expct(y)\n x ~ Normal(0, 1) \n y ~ Normal(x, 1)\n return x^2\n end\n\n yval = 1\n expct_conditioned = expct(yval)\n\n xval = 2\n vi = Turing.VarInfo... |
f7b0637c15611f38918f57fc9d71790a92320927 | 14,702 | jl | Julia | test/FileFormats/MOF/MOF.jl | egbuck/MathOptInterface.jl | a95e7d68adb2e60e40dd8c0bffe4fdbcfde24590 | [
"MIT"
] | null | null | null | test/FileFormats/MOF/MOF.jl | egbuck/MathOptInterface.jl | a95e7d68adb2e60e40dd8c0bffe4fdbcfde24590 | [
"MIT"
] | null | null | null | test/FileFormats/MOF/MOF.jl | egbuck/MathOptInterface.jl | a95e7d68adb2e60e40dd8c0bffe4fdbcfde24590 | [
"MIT"
] | null | null | null | import MathOptInterface
using Test
const MOI = MathOptInterface
const MOIU = MOI.Utilities
const MOF = MOI.FileFormats.MOF
const TEST_MOF_FILE = "test.mof.json"
@test sprint(show, MOF.Model()) == "A MathOptFormat Model"
include("nonlinear.jl")
struct UnsupportedSet <: MOI.AbstractSet end
struct UnsupportedFunction... | 34.756501 | 83 | 0.534009 | [
"@testset \"Error handling: read_from_file\" begin\n failing_models_dir = joinpath(@__DIR__, \"failing_models\")\n\n @testset \"Non-empty model\" begin\n model = MOF.Model(warn=true)\n MOI.add_variable(model)\n @test !MOI.is_empty(model)\n exception = ErrorException(\n \... |
f7b55b0bdcd7bd2c15b230c6128ec5df9f2b837f | 6,487 | jl | Julia | test/MiscTest.jl | dcelisgarza/DDD | 9257c619240a2b3bbdddd813d5e08ab71a07f7be | [
"MIT"
] | 4 | 2020-05-30T03:22:57.000Z | 2020-12-09T07:34:42.000Z | test/MiscTest.jl | dcelisgarza/DDD.jl | 9257c619240a2b3bbdddd813d5e08ab71a07f7be | [
"MIT"
] | 12 | 2020-02-03T10:26:41.000Z | 2021-11-11T10:01:38.000Z | test/MiscTest.jl | dcelisgarza/DDD | 9257c619240a2b3bbdddd813d5e08ab71a07f7be | [
"MIT"
] | 2 | 2020-12-09T07:34:50.000Z | 2021-11-10T03:24:45.000Z | using DDD
using Test
using DDD: makeInstanceDict, inclusiveComparison
cd(@__DIR__)
@testset "Geometry" begin
arr = Int[3; 4; 6]
@test isapprox(internalAngle(arr[1]), π / 3)
@test isapprox(internalAngle(arr[2]), π / 2)
@test isapprox(internalAngle(arr[3]), 2π / 3)
@test isapprox(externalAngle(arr[1... | 32.59799 | 83 | 0.548327 | [
"@testset \"Geometry\" begin\n arr = Int[3; 4; 6]\n @test isapprox(internalAngle(arr[1]), π / 3)\n @test isapprox(internalAngle(arr[2]), π / 2)\n @test isapprox(internalAngle(arr[3]), 2π / 3)\n @test isapprox(externalAngle(arr[1]), 2π / 3)\n @test isapprox(externalAngle(arr[2]), π / 2)\n @test ... |
f7b83eb9f5a639491aa268ad263f4e6435e368a3 | 3,007 | jl | Julia | test/semipoly.jl | doppioandante/Symbolics.jl | b077a7935c515736916fa63469ad53b0abf2c2d2 | [
"MIT"
] | 1 | 2021-11-06T13:10:46.000Z | 2021-11-06T13:10:46.000Z | test/semipoly.jl | doppioandante/Symbolics.jl | b077a7935c515736916fa63469ad53b0abf2c2d2 | [
"MIT"
] | 45 | 2021-02-26T12:14:48.000Z | 2021-02-26T12:30:33.000Z | test/semipoly.jl | doppioandante/Symbolics.jl | b077a7935c515736916fa63469ad53b0abf2c2d2 | [
"MIT"
] | null | null | null | using Symbolics
using Test
using Random
@variables x y z
@test_throws ArgumentError semipolynomial_form(x,[x],0)
d, r = semipolynomial_form(x, [x], 1)
@test d == Dict(x=>1)
@test r == 0
d, r = semipolynomial_form(x + sin(x) + 1 + y, [x], 1)
@test d == Dict(x=>1)
@test iszero(r - sin(x) - 1 - y)
d, r = semipoly... | 26.147826 | 82 | 0.438311 | [
"@testset \"fuzz semi-polynomial-form ($i/20)\" begin\n trial()\n end"
] |
f7b957ba7d72638e0bd6915795639204a39d020f | 1,141 | jl | Julia | test/reduce_test.jl | rohanmclure/ArrayChannels.jl | 0098cdb23d16cca0e87ab2cdfcc86f24f7ae1c19 | [
"MIT"
] | 15 | 2019-07-06T14:01:29.000Z | 2021-10-14T17:30:33.000Z | test/reduce_test.jl | rohanmclure/ArrayChannels.jl | 0098cdb23d16cca0e87ab2cdfcc86f24f7ae1c19 | [
"MIT"
] | 8 | 2019-07-11T18:55:30.000Z | 2020-08-31T16:10:59.000Z | test/reduce_test.jl | rohanmclure/ArrayChannels.jl | 0098cdb23d16cca0e87ab2cdfcc86f24f7ae1c19 | [
"MIT"
] | null | null | null | rmprocs(workers()...); addprocs(4); @assert nprocs() == 5
@everywhere using ArrayChannels
using Test
function test_reduce_two()
@testset "Two-process Reduction" begin
A = ArrayChannel(Float64, procs()[1:2], 10)
println("Procs one and two: $(procs()[1:2])")
fill!(A, 1.0)
proc_2 = pro... | 27.829268 | 57 | 0.501315 | [
"@testset \"Two-process Reduction\" begin\n A = ArrayChannel(Float64, procs()[1:2], 10)\n println(\"Procs one and two: $(procs()[1:2])\")\n fill!(A, 1.0)\n proc_2 = procs()[2]\n @sync @spawnat proc_2 fill!(A, 1.0)\n @sync begin\n @async reduce!(+, A, 1)\n ... |
f7b98638d64b0962128ef15999ff2e396ade61be | 14,812 | jl | Julia | test/BlockSystems_test.jl | hexaeder/IOSystems_prototype | 93ae0593bd6430a2d686a22f21f3c17688234124 | [
"MIT"
] | 2 | 2020-12-21T14:29:32.000Z | 2021-01-02T12:53:49.000Z | test/BlockSystems_test.jl | hexaeder/IOSystems_prototype | 93ae0593bd6430a2d686a22f21f3c17688234124 | [
"MIT"
] | null | null | null | test/BlockSystems_test.jl | hexaeder/IOSystems_prototype | 93ae0593bd6430a2d686a22f21f3c17688234124 | [
"MIT"
] | 1 | 2021-01-02T12:54:54.000Z | 2021-01-02T12:54:54.000Z | using Test
using BlockSystems
using ModelingToolkit
using ModelingToolkit: get_iv, get_eqs, get_states
using LightGraphs
@info "Tests of BlockSystems.jl"
@testset "BlockSystems.jl" begin
@testset "namespaced accessors" begin
@parameters t i1(t) i2(t) a
@variables x1(t) x2(t) o1(t) o2(t)
D ... | 44.48048 | 100 | 0.466784 | [
"@testset \"BlockSystems.jl\" begin\n @testset \"namespaced accessors\" begin\n @parameters t i1(t) i2(t) a\n @variables x1(t) x2(t) o1(t) o2(t)\n D = Differential(t)\n eqs = [D(x1) ~ a*i1, o1~i1, D(x2) ~ i2, o2~i2]\n iob = IOBlock(eqs, [i1, i2], [o1, o2], name=:ns)\n @... |
f7bad86a00d24607f18797a209af677bea40efd3 | 2,819 | jl | Julia | script/investigate/two-sym-CV-gen-Siddhu-channel.jl | ChitambarLab/CVChannel.jl | 479fa1e70d19b5434137f9017d99830796802d87 | [
"MIT"
] | null | null | null | script/investigate/two-sym-CV-gen-Siddhu-channel.jl | ChitambarLab/CVChannel.jl | 479fa1e70d19b5434137f9017d99830796802d87 | [
"MIT"
] | 4 | 2021-09-21T00:29:01.000Z | 2021-10-15T00:35:15.000Z | script/investigate/two-sym-CV-gen-Siddhu-channel.jl | ChitambarLab/cv-channel | 479fa1e70d19b5434137f9017d99830796802d87 | [
"MIT"
] | null | null | null | using CVChannel
using Test
using DelimitedFiles
"""
This script looks at the communication value of the
generalized Siddhu channel using SDP relaxations.
Specifically, it shows that 2-sym cv is effectively
the same as cv PPT, and that they are loose at least
some of the time. It also shows multiplicativity over PPT con... | 41.455882 | 93 | 0.668322 | [
"@testset \"Investigate generalized Siddhu channel\" begin\n println(\"We calculate cvPPT, 2symCV, and cvPPT of the channel ran in parallel.\")\n println(\"We then show that 2symCV provides no improvement to cvPPT and that cvPPT\")\n println(\"is effectively multiplicative for the gen Siddhu with itself.\"... |
f7bc9183de8b016fa5a1369493a28366ff6a961a | 207 | jl | Julia | test/runtests.jl | invenia/Hyperparameters.jl | 625ff9f79d9f0347963147345ecaa06c90fdad21 | [
"MIT"
] | 1 | 2022-01-25T09:24:39.000Z | 2022-01-25T09:24:39.000Z | test/runtests.jl | invenia/Hyperparameters.jl | 625ff9f79d9f0347963147345ecaa06c90fdad21 | [
"MIT"
] | 15 | 2020-06-26T20:08:04.000Z | 2021-08-16T19:44:21.000Z | test/runtests.jl | invenia/Hyperparameters.jl | 625ff9f79d9f0347963147345ecaa06c90fdad21 | [
"MIT"
] | null | null | null | using Hyperparameters
using FilePathsBase
using JSON
using Memento
using Memento.TestUtils
using Test
const LOGGER = getlogger()
@testset "Hyperparameters.jl" begin
include("hyperparameters.jl")
end
| 13.8 | 35 | 0.797101 | [
"@testset \"Hyperparameters.jl\" begin\n include(\"hyperparameters.jl\")\nend"
] |
f7c10b43cf6f04d7dfc243e511610325565f3496 | 7,689 | jl | Julia | test/geometrytypes.jl | pauljurczak/GeometryBasics.jl | e9c9e0cc4b6b3aa28572d56c982af8588420c43d | [
"MIT"
] | null | null | null | test/geometrytypes.jl | pauljurczak/GeometryBasics.jl | e9c9e0cc4b6b3aa28572d56c982af8588420c43d | [
"MIT"
] | null | null | null | test/geometrytypes.jl | pauljurczak/GeometryBasics.jl | e9c9e0cc4b6b3aa28572d56c982af8588420c43d | [
"MIT"
] | null | null | null | using Test, GeometryBasics
@testset "algorithms.jl" begin
cube = Rect(Vec3f0(-0.5), Vec3f0(1))
cube_faces = decompose(TriangleFace{Int}, QuadFace{Int}[
(1,3,4,2),
(2,4,8,6),
(4,3,7,8),
(1,5,7,3),
(1,2,6,5),
(5,6,8,7),
])
cube_vertices = decompose(Point{3,... | 32.306723 | 155 | 0.506048 | [
"@testset \"algorithms.jl\" begin\n cube = Rect(Vec3f0(-0.5), Vec3f0(1))\n cube_faces = decompose(TriangleFace{Int}, QuadFace{Int}[\n (1,3,4,2),\n (2,4,8,6),\n (4,3,7,8),\n (1,5,7,3),\n (1,2,6,5),\n (5,6,8,7),\n ])\n cube_vertices = decompose(Point{3,Float32}, c... |
f7c267ff442a8c8ba73c58df7ba33a1f9ca64cdc | 1,817 | jl | Julia | test/compare_nearestneighbors.jl | UnofficialJuliaMirror/HNSW.jl-540f64fa-c57e-11e8-081c-41422cda4629 | bdef8e7d2d47cb36a0c75feaf71dd89caef30312 | [
"MIT"
] | null | null | null | test/compare_nearestneighbors.jl | UnofficialJuliaMirror/HNSW.jl-540f64fa-c57e-11e8-081c-41422cda4629 | bdef8e7d2d47cb36a0c75feaf71dd89caef30312 | [
"MIT"
] | null | null | null | test/compare_nearestneighbors.jl | UnofficialJuliaMirror/HNSW.jl-540f64fa-c57e-11e8-081c-41422cda4629 | bdef8e7d2d47cb36a0c75feaf71dd89caef30312 | [
"MIT"
] | null | null | null | using NearestNeighbors
using HNSW
using StaticArrays
using Statistics
using Test
@testset "Compare To NearestNeighbors.jl" begin
dim = 5
num_elements = 10000
num_queries = 1000
data = [@SVector rand(Float32, dim) for n ∈ 1:num_elements]
tree = KDTree(data)
queries = [@SVector rand(Float32, dim)... | 30.283333 | 79 | 0.539351 | [
"@testset \"Compare To NearestNeighbors.jl\" begin\n dim = 5\n num_elements = 10000\n num_queries = 1000\n data = [@SVector rand(Float32, dim) for n ∈ 1:num_elements]\n tree = KDTree(data)\n queries = [@SVector rand(Float32, dim) for n ∈ 1:num_queries]\n @testset \"M=$M, K=1\" for M ∈ [5, 10]\n... |
f7cd37586fcfb537c3930fb632fb894a7b745bed | 23,279 | jl | Julia | test/filterfit.jl | NicholasWMRitchie/NeXLSpectrum | e40990f68850fc2e732d0c6e13acdfbfbf5b1a31 | [
"Unlicense"
] | null | null | null | test/filterfit.jl | NicholasWMRitchie/NeXLSpectrum | e40990f68850fc2e732d0c6e13acdfbfbf5b1a31 | [
"Unlicense"
] | null | null | null | test/filterfit.jl | NicholasWMRitchie/NeXLSpectrum | e40990f68850fc2e732d0c6e13acdfbfbf5b1a31 | [
"Unlicense"
] | null | null | null | using Test
using NeXLSpectrum
using Statistics
using LinearAlgebra
using DataFrames
@testset "Filter Fitting" begin
@testset "Filter" begin
eds = simpleEDS(2048, 10.0, 0.0, 135.0)
filt = buildfilter(eds)
# Each row sums to zero
@test all(
isapprox(sum(NeXLSpectrum.filter... | 46.280318 | 180 | 0.549594 | [
"@testset \"Filter Fitting\" begin\n @testset \"Filter\" begin\n eds = simpleEDS(2048, 10.0, 0.0, 135.0)\n filt = buildfilter(eds)\n # Each row sums to zero\n @test all(\n isapprox(sum(NeXLSpectrum.filterdata(filt, row)), 0.0, atol = 1.0e-8) for\n row in size(fil... |
f7cf3f1d35f79bc4e63eb2273441f41ee6e86558 | 3,917 | jl | Julia | 20/src/11.jl | CmdQ/AoC | 1ab6118e4d2c71df06326b08f1b0dc5f2e664f1d | [
"Unlicense"
] | 1 | 2020-12-07T10:27:26.000Z | 2020-12-07T10:27:26.000Z | 20/src/11.jl | CmdQ/AoC2020 | 78f96de7b050291df9e5ed56b314f8cb3aa5856c | [
"Unlicense"
] | null | null | null | 20/src/11.jl | CmdQ/AoC2020 | 78f96de7b050291df9e5ed56b314f8cb3aa5856c | [
"Unlicense"
] | null | null | null | using Chain
using Underscores
using Utils
@enum Seat::Int8 floor=Int('.') empty=Int('L') occupied=Int('#') void=Int('?')
function parse_line(line::String)::Array{Seat}
@chain line begin
collect
map(Seat ∘ Int, _)
end
end
function embed(m)
a, b = size(m)
re = fill(void, (a+2, b+2))
... | 21.288043 | 99 | 0.490426 | [
"@testset \"Adapter Array\" begin\n input = \"\"\"\n L.LL.LL.LL\n LLLLLLL.LL\n L.L.L..L..\n LLLL.LL.LL\n L.LL.LL.LL\n L.LLLLL.LL\n ..L.L.....\n LLLLLLLLLL\n L.LLLLLL.L\n L.LLLLL.LL\n \"\"\"\n\n\n example = parse_file(IOBuffer(input))... |
f7d093827f0dbc35982c3a02d5ed3e5b94851ae1 | 28,567 | jl | Julia | stdlib/REPL/test/lineedit.jl | greimel/julia | 1c6f89f04a1ee4eba8380419a2b01426e84f52aa | [
"Zlib"
] | 18 | 2018-03-17T16:54:52.000Z | 2021-11-14T20:28:51.000Z | stdlib/REPL/test/lineedit.jl | greimel/julia | 1c6f89f04a1ee4eba8380419a2b01426e84f52aa | [
"Zlib"
] | 8 | 2018-09-27T01:16:58.000Z | 2018-12-05T23:33:08.000Z | stdlib/REPL/test/lineedit.jl | greimel/julia | 1c6f89f04a1ee4eba8380419a2b01426e84f52aa | [
"Zlib"
] | 3 | 2018-03-21T14:40:39.000Z | 2020-05-04T19:15:03.000Z | # This file is a part of Julia. License is MIT: https://julialang.org/license
using Test
using REPL
import REPL.LineEdit
import REPL.LineEdit: edit_insert, buffer, content, setmark, getmark, region
include("FakeTerminals.jl")
import .FakeTerminals.FakeTerminal
# no need to have animation in tests
REPL.GlobalOptions.... | 32.425653 | 106 | 0.627612 | [
"@testset \"edit_word_transpose\" begin\n local buf, mode\n buf = IOBuffer()\n mode = Ref{Symbol}()\n transpose!(i) = transform!(buf -> LineEdit.edit_transpose_words(buf, mode[]),\n buf, i)[1:2]\n\n mode[] = :readline\n edit_insert(buf, \"àbç def gh \")\n @test tr... |
f7d100424158c40fab8a56ecc76f0460d2477cb5 | 4,306 | jl | Julia | test/runtests.jl | asinghvi17/ColorSchemes.jl | cb4d8314c4327d98b94ff7bc18826748e078de6d | [
"Apache-2.0",
"CC0-1.0"
] | null | null | null | test/runtests.jl | asinghvi17/ColorSchemes.jl | cb4d8314c4327d98b94ff7bc18826748e078de6d | [
"Apache-2.0",
"CC0-1.0"
] | null | null | null | test/runtests.jl | asinghvi17/ColorSchemes.jl | cb4d8314c4327d98b94ff7bc18826748e078de6d | [
"Apache-2.0",
"CC0-1.0"
] | null | null | null | using Test, Colors, ColorSchemes, ColorTypes, FixedPointNumbers
monalisa = ColorScheme([
RGB(0.05482025926320272, 0.016508952654741622, 0.019315160361063788),
RGB(0.07508160782698388, 0.034110215845969745, 0.039708343938094984),
RGB(0.10884977211887092, 0.033667530751245296, 0.026120424375656533),
RGB(... | 41.009524 | 78 | 0.699721 | [
"@testset \"basic tests\" begin\n @test length(monalisa) == 32\n @test length(monalisa.colors) == 32\n # test that sampling schemes yield different values\n @test get(monalisa, 0.0) != get(monalisa, 0.5)\nend",
"@testset \"conversion tests\" begin\n # convert an Array{T,2} to an RGB image\n tmp ... |
f7d3ff4ee03842b391b967e0ebc86e413e6959cb | 1,216 | jl | Julia | test/test_ensemble.jl | quinnj/AMLPipelineBase.jl | ab244b3934d82c9036e309ce26e9797ffa89a1e4 | [
"MIT"
] | null | null | null | test/test_ensemble.jl | quinnj/AMLPipelineBase.jl | ab244b3934d82c9036e309ce26e9797ffa89a1e4 | [
"MIT"
] | null | null | null | test/test_ensemble.jl | quinnj/AMLPipelineBase.jl | ab244b3934d82c9036e309ce26e9797ffa89a1e4 | [
"MIT"
] | null | null | null | module TestEnsembleMethods
using Test
using Random
using AMLPipelineBase
using DataFrames
function generateXY()
Random.seed!(123)
iris = getiris()
indx = Random.shuffle(1:nrow(iris))
features=iris[indx,1:4]
sp = iris[indx,5] |> Vector
(features,sp)
end
function getprediction(model,features,o... | 21.714286 | 59 | 0.702303 | [
"@testset \"Ensemble learners\" begin\n Random.seed!(123)\n test_ensembles()\nend",
"@testset \"Vararg Ensemble Test\" begin\n Random.seed!(123)\n test_vararg()\nend"
] |
f7d7e4492e2c22a8656ff9737d6962f470752ddc | 19,228 | jl | Julia | test/runtests.jl | UnofficialJuliaMirror/OffsetArrays.jl-6fe1bfb0-de20-5000-8ca7-80f57d26f881 | 950bb889753bfbdcd5313b6f1eb814b28f1a26c2 | [
"MIT"
] | null | null | null | test/runtests.jl | UnofficialJuliaMirror/OffsetArrays.jl-6fe1bfb0-de20-5000-8ca7-80f57d26f881 | 950bb889753bfbdcd5313b6f1eb814b28f1a26c2 | [
"MIT"
] | null | null | null | test/runtests.jl | UnofficialJuliaMirror/OffsetArrays.jl-6fe1bfb0-de20-5000-8ca7-80f57d26f881 | 950bb889753bfbdcd5313b6f1eb814b28f1a26c2 | [
"MIT"
] | null | null | null | using OffsetArrays
using Test
using DelimitedFiles
using OffsetArrays: IdentityUnitRange, no_offset_view
using CatIndices: BidirectionalVector
@test isempty(detect_ambiguities(OffsetArrays, Base, Core))
@testset "Single-entry arrays in dims 0:5" begin
for n = 0:5
for z in (OffsetArray(ones(Int,ntuple(d->1... | 33.266436 | 138 | 0.545611 | [
"@testset \"Single-entry arrays in dims 0:5\" begin\n for n = 0:5\n for z in (OffsetArray(ones(Int,ntuple(d->1,n)), ntuple(x->x-1,n)),\n fill!(OffsetArray{Float64}(undef, ntuple(x->x:x, n)), 1),\n fill!(OffsetArray{Float64}(undef, ntuple(x->x:x, n)...), 1),\n ... |
f7dba5dc67cea436c10e802319e6dfd2ff84489b | 105 | jl | Julia | test/runtests.jl | Lyceum/LyceumDevTools.jl | 92bb0735bfc4f3921ca7396bf4e351b14ad811ca | [
"MIT"
] | null | null | null | test/runtests.jl | Lyceum/LyceumDevTools.jl | 92bb0735bfc4f3921ca7396bf4e351b14ad811ca | [
"MIT"
] | null | null | null | test/runtests.jl | Lyceum/LyceumDevTools.jl | 92bb0735bfc4f3921ca7396bf4e351b14ad811ca | [
"MIT"
] | null | null | null | using LyceumDevTools
using Test
@testset "LyceumDevTools.jl" begin
# Write your own tests here.
end
| 15 | 34 | 0.761905 | [
"@testset \"LyceumDevTools.jl\" begin\n # Write your own tests here.\nend"
] |
f7dedd6608a9b67dff230b090c5ceda250ff3368 | 10,407 | jl | Julia | test/avio.jl | caleb-allen/VideoIO.jl | 2dfa72e16c9b82107285a8a132ce1ec689a6b440 | [
"MIT"
] | null | null | null | test/avio.jl | caleb-allen/VideoIO.jl | 2dfa72e16c9b82107285a8a132ce1ec689a6b440 | [
"MIT"
] | null | null | null | test/avio.jl | caleb-allen/VideoIO.jl | 2dfa72e16c9b82107285a8a132ce1ec689a6b440 | [
"MIT"
] | null | null | null | using Test
using ColorTypes: RGB, Gray, N0f8
using FileIO, ImageCore, Dates, Statistics
using Statistics, StatsBase
import VideoIO
createmode = false
testdir = dirname(@__FILE__)
videodir = joinpath(testdir, "..", "videos")
VideoIO.TestVideos.available()
VideoIO.TestVideos.download_all()
swapext(f, new_ext) = "$(s... | 38.83209 | 133 | 0.607284 | [
"@testset \"Reading of various example file formats\" begin\n for name in VideoIO.TestVideos.names()\n @testset \"Reading $name\" begin\n first_frame_file = joinpath(testdir, swapext(name, \".png\"))\n !createmode && (first_frame = load(first_frame_file))\n\n f = VideoIO.t... |
f7e1de692c429e70b145e220a315b80be849b4a6 | 1,321 | jl | Julia | test/loading.jl | JuliaAI/MLJModels.jl | b3e1b7973d30c275ace5713726322355ea976d97 | [
"MIT"
] | 15 | 2021-07-06T16:11:32.000Z | 2022-03-17T12:22:26.000Z | test/loading.jl | JuliaAI/MLJModels.jl | b3e1b7973d30c275ace5713726322355ea976d97 | [
"MIT"
] | 63 | 2021-06-30T03:54:16.000Z | 2022-03-15T21:02:42.000Z | test/loading.jl | JuliaAI/MLJModels.jl | b3e1b7973d30c275ace5713726322355ea976d97 | [
"MIT"
] | 5 | 2021-08-28T10:43:44.000Z | 2022-03-31T05:57:00.000Z | module TestLoading
using Test
using MLJModels
using MLJBase
function isloaded(name::String, pkg::String)
(name, pkg) in map(localmodels()) do m
(m.name, m.package_name)
end
end
@load AdaBoostStumpClassifier pkg=DecisionTree verbosity=0
@test isloaded("AdaBoostStumpClassifier", "DecisionTree")
# buil... | 23.589286 | 71 | 0.762301 | [
"@testset \"@load from within a function within a module\" begin\n model = FooBar.regressor()\n @test isdefined(model, :bias)\nend"
] |
f7e3e93acd27e6c3303e713038cf65bb88ef80b8 | 44,775 | jl | Julia | test/precompile.jl | TechPenguineer/julia | aa17702e0e24a8a2afd511e6e869e68f31daf709 | [
"MIT"
] | null | null | null | test/precompile.jl | TechPenguineer/julia | aa17702e0e24a8a2afd511e6e869e68f31daf709 | [
"MIT"
] | null | null | null | test/precompile.jl | TechPenguineer/julia | aa17702e0e24a8a2afd511e6e869e68f31daf709 | [
"MIT"
] | null | null | null | # This file is a part of Julia. License is MIT: https://julialang.org/license
using Test, Distributed, Random
Foo_module = :Foo4b3a94a1a081a8cb
Foo2_module = :F2oo4b3a94a1a081a8cb
FooBase_module = :FooBase4b3a94a1a081a8cb
@eval module ConflictingBindings
export $Foo_module, $FooBase_module
$Foo_module = 232
... | 34.62877 | 152 | 0.566499 | [
"@testset \"issue 38149\" begin\n M = Module()\n @eval M begin\n @nospecialize\n f(x, y) = x + y\n f(x::Int, y) = 2x + y\n end\n precompile(M.f, (Int, Any))\n precompile(M.f, (AbstractFloat, Any))\n mis = map(methods(M.f)) do m\n m.specializations[1]\n end\n @test... |
f7e46ec3d41064780e59b866ae77ec4fd8d1c2ef | 36,092 | jl | Julia | stdlib/SuiteSparse/test/cholmod.jl | syntapy/julia | 4fc446f1790fe04e227ff96ab75a01d130e2d930 | [
"Zlib"
] | 1 | 2019-07-14T04:08:02.000Z | 2019-07-14T04:08:02.000Z | stdlib/SuiteSparse/test/cholmod.jl | syntapy/julia | 4fc446f1790fe04e227ff96ab75a01d130e2d930 | [
"Zlib"
] | null | null | null | stdlib/SuiteSparse/test/cholmod.jl | syntapy/julia | 4fc446f1790fe04e227ff96ab75a01d130e2d930 | [
"Zlib"
] | null | null | null | # This file is a part of Julia. License is MIT: https://julialang.org/license
using SuiteSparse.CHOLMOD
using DelimitedFiles
using Test
using Random
using Serialization
using LinearAlgebra: issuccess, PosDefException
# CHOLMOD tests
Random.seed!(123)
@testset "based on deps/SuiteSparse-4.0.2/CHOLMOD/Demo/" begin
# ... | 42.361502 | 168 | 0.620442 | [
"@testset \"based on deps/SuiteSparse-4.0.2/CHOLMOD/Demo/\" begin\n\n# chm_rdsp(joinpath(Sys.BINDIR, \"../../deps/SuiteSparse-4.0.2/CHOLMOD/Demo/Matrix/bcsstk01.tri\"))\n# because the file may not exist in binary distributions and when a system suitesparse library\n# is used\n\n## Result from C program\n## --------... |
f7e873f50aecf4ae0d56cb398b44a52cf2fe5459 | 155 | jl | Julia | test/shallow_water/runtests.jl | sandreza/Atum.jl | c03d3ff0a6fd0a6891de93747437ad0931572db7 | [
"MIT"
] | 3 | 2021-07-06T16:49:53.000Z | 2021-11-30T20:05:40.000Z | test/shallow_water/runtests.jl | sandreza/Atum.jl | c03d3ff0a6fd0a6891de93747437ad0931572db7 | [
"MIT"
] | 1 | 2022-03-08T00:43:04.000Z | 2022-03-08T00:43:27.000Z | test/shallow_water/runtests.jl | sandreza/Atum.jl | c03d3ff0a6fd0a6891de93747437ad0931572db7 | [
"MIT"
] | 2 | 2021-07-06T16:49:56.000Z | 2022-03-03T20:40:30.000Z | using Test
using SafeTestsets
@testset "shallow_water" begin
@safetestset "entropy_conservation_1d" begin include("entropy_conservation_1d.jl") end
end
| 22.142857 | 88 | 0.825806 | [
"@testset \"shallow_water\" begin\n @safetestset \"entropy_conservation_1d\" begin include(\"entropy_conservation_1d.jl\") end\nend"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.