{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: lda_exc *)\n\n$define xc_dimensions_2d\n\nax := -4/3*sqrt(2)/Pi:\n\nf := (rs, z) -> ax*f_zeta_2d(z)/rs:\n", "meta": {"hexsha": "fe99bd537e4e104051b35a9070c66a02a4833a51", "size": 346, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/lda_exc/lda_x_2d.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/lda_exc/lda_x_2d.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/lda_exc/lda_x_2d.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 21.625, "max_line_length": 68, "alphanum_fraction": 0.6676300578, "num_tokens": 115, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.9161096181702032, "lm_q2_score": 0.7090191214879992, "lm_q1q2_score": 0.6495392366617438}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_gga_x *)\n\nmbeta  := 0.003317:\nmgamma := 0.008323:\n\nf := x -> 1 + mbeta/X_FACTOR_C*x^2/(1 + mgamma*x^2)^(3/4):", "meta": {"hexsha": "cc442a95099baa9e37f5561357836c6c327e45cf", "size": 362, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/gga_x_2d_b86_mgc.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/gga_x_2d_b86_mgc.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/gga_x_2d_b86_mgc.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 25.8571428571, "max_line_length": 68, "alphanum_fraction": 0.6602209945, "num_tokens": 125, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.907312221360624, "lm_q2_score": 0.7154239897159439, "lm_q1q2_score": 0.6491129293238532}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\nairy_a5  := 133.983631:\nairy_a6  :=   3.217063:\nairy_a7  := 136.707378:\nairy_a8  :=   3.223476:\nairy_a9  :=   2.675484:\nairy_a10 :=   3.473804:\n\nairy_f1 := s -> (1 - airy_a5*s^airy_a6 + airy_a7*s^airy_a8)/(1 + airy_a9*s^airy_a10):\n\n$include \"gga_x_lag.mpl\"\n\nairy_f := x -> lag_f0(X2S*x) + airy_f1(X2S*x):\n\nf := (rs, zeta, xt, xs0, xs1) -> gga_exchange(airy_f, rs, zeta, xs0, xs1):\n", "meta": {"hexsha": "67165e25699ba63cfb1db21e041e6d31d0f26158", "size": 641, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_airy.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_airy.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_airy.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 25.64, "max_line_length": 85, "alphanum_fraction": 0.6505460218, "num_tokens": 251, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.919642531177793, "lm_q2_score": 0.7057850154599563, "lm_q1q2_score": 0.6490699180849521}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* Equation (7) from the paper *)\n\np     := x -> X2S^2*x^2:\nz     := (x, t) -> x^2/(8*t):\n\nalpha := (x, t) -> (t - x^2/8)/K_FACTOR_C:\nqb    := (x, t) -> \\\n      9/20 * (alpha(x, t) - 1)/sqrt(1 + params_a_b*alpha(x, t)*(alpha(x, t) - 1)) \\\n      + 2*p(x)/3:\n\n(* Equation (10) in all its glory *)\nfxnum := (x, t) -> \\\n      + (MU_GE + params_a_c*z(x, t)^ff(z(x, t))/(1 + z(x, t)^2)^2)*p(x) \\\n      + 146/2025 * qb(x, t)^2 \\\n      - 73/405 * qb(x, t) * sqrt(1/2*(9/25*z(x, t)^2 + p(x)^2)) \\\n      + MU_GE^2/mkappa(x, t) * p(x)^2 \\\n      + 2*sqrt(params_a_e)*MU_GE*9/25*z(x, t)^2 \\\n      + params_a_e*params_a_mu*p(x)^3:\n\nfxden := x -> \\\n      (1 + sqrt(params_a_e)*p(x))^2:\n\nfx    := (x, t) -> fxnum(x, t)/fxden(x):\n", "meta": {"hexsha": "bcbdd5c9b78376944ab093072df786b428372dbe", "size": 952, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/tpss_x.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/tpss_x.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/tpss_x.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 29.75, "max_line_length": 83, "alphanum_fraction": 0.506302521, "num_tokens": 387, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9324533051062238, "lm_q2_score": 0.6959583187272711, "lm_q1q2_score": 0.6489486345134147}}
{"text": "`is_element/binary_trees` := (A::set) -> proc(TT)\n global reason;\n \n if not(`is_element/full_trees`(A)(TT)) then\n  reason := [convert(procname,string),\"TT is not a full tree\",TT,reason];\n  return false;\n fi;\n\n if not(`is_binary/full_trees`(A)(TT)) then\n  reason := [convert(procname,string),\"TT is not binary\",TT,reason];\n  return false;\n fi;\nend:\n\n######################################################################\n\n`is_equal/binary_trees` := eval(`is_equal/full_trees`);\n\n######################################################################\n\n`is_leq/binary_trees` := eval(`is_leq/full_trees`);\n\n######################################################################\n\n`list_elements/binary_trees` := proc(A::set) \n option remember;\n local n,L,P,B,C,UUU,VVV,UU,VV;\n\n n := nops(A);\n\n if n = 0 then\n  return [];\n elif n = 1 then \n  return [{A}];\n fi;\n\n L := NULL;\n P := `list_elements/nonempty_subsets`(A minus {A[n]});\n\n for B in P do\n  C := A minus B;\n  UUU := `list_elements/binary_trees`(B);\n  VVV := `list_elements/binary_trees`(C);\n  L := L,seq(seq({op(UU),op(VV),A},VV in VVV),UU in UUU);\n od;\n return [L];\nend:\n\n######################################################################\n\n`random_element/binary_trees` := (A::set) -> proc()\n local n,B,C,UU,VV;\n\n n := nops(A);\n if n = 0 then return FAIL; fi;\n if n = 1 then return {A}; fi;\n B := `random_element/nonempty_subsets`(A minus {A[n]})();\n C := A minus B;\n UU := `random_element/binary_trees`(B)();\n VV := `random_element/binary_trees`(C)();\n return {op(UU),op(VV),A};\nend:\n\n######################################################################\n# OEIS: A001147\n`count_elements/binary_trees` := proc(A::set) local k; mul(2*k-1,k=1..nops(A)-1); end:\n\n", "meta": {"hexsha": "ff04508687c22eec4400e8cdfa9045ed1fffa716", "size": 1717, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/binary_trees.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/binary_trees.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/binary_trees.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 25.25, "max_line_length": 86, "alphanum_fraction": 0.5020384391, "num_tokens": 463, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8006920020959544, "lm_q2_score": 0.8104789086703225, "lm_q1q2_score": 0.6489439800397846}}
{"text": "# We use the definition below for generalised Narayana numbers because it is\n# good for m > 0 and for n = 0.  In the most common case where m = 0 and\n# n > 0 it is equivalent to the function narayana_number_basic(n,j).\n\nnarayana_number := proc(n,j,m := 0)\n (m+1)/(n+1)*binomial(n+1,j) * binomial(n-m-1,j-1);\nend:\n\nnarayana_number(0,0) := 1;\n\nnarayana_number_basic := (n,j) ->\n binomial(n,j) * binomial(n,j-1) / n;\n\n# This is the sum of narayana_number(n,j,0) x^n y^j for n,j >= 0\nnarayana_series := (x,y) -> \n (1 + x*(1-y) - sqrt(1-2*x*(1+y)+x^2*(1-y)^2))/(2*x);\n\n# This is the series used by Stanley which has slightly different\n# conventions for n = 0 and so ends up as 1 + narayana_series(x,y)\n\nnarayana_series_stanley := (x,y) ->\n (1-x-x*y - sqrt((1-x-x*y)^2-4*x^2*y))/(2*x);\n\n`is_element/narayana_paths` := (len::posint,peaks::posint) -> proc(u)\n local v,w,y,i;\n \n if not(type(u,list(integer))) then\n  return false;\n fi;\n\n if {op(u),1,-1} <> {1,-1} then\n  return false;\n fi;\n \n if nops(u) <> 2*len then\n  return false;\n fi;\n\n v := 0;\n y := 0;\n for i from 1 to 2*len do\n  y := y + u[i];\n  v := v,y;\n od:\n v := [v];\n \n if v[2*len+1] <> 0 then\n  return false;\n fi;\n\n if min(op(v)) < 0 then\n  return false;\n fi;\n\n w := select(i -> (u[i] = 1 and u[i+1] = -1),[seq(i,i=1..2*len-1)]);\n if nops(w) <> peaks then\n  return false;\n fi;\n \n return true;\nend:\n\n`list_elements/narayana_paths` := proc(len,peaks)\n local A,B,L,a,b,u,ok,y,i;\n A := map(a -> [0,op(a),len+1],combinat[choose](len  ,peaks-1));\n B := map(b -> [0,op(b),len  ],combinat[choose](len-1,peaks-1));\n L := NULL;\n for a in A do\n  for b in B do\n   u := map(op,[seq([(+1)$(a[i+1]-a[i]),(-1)$(b[i+1]-b[i])],i=1..peaks)]);\n   ok := true;\n   y := 0;\n   for i from 1 to 2*len+1 do\n    y := y + u[i];\n    if y = 0 then \n     ok := false;\n     break;\n    fi;\n   od:\n   if ok then \n    L := L,u[2..-1];\n   fi;\n  od:\n od:\n return [L];\nend:\n\n# This is very unintelligent\n`list_elements_basic/narayana_paths` := proc(len,peaks)\n local L,M,i,k,u,h;\n L := [[1]]:\n for i from 1 to 2*len-1 do\n  M := NULL;\n  for u in L do\n   h := `+`(op(u));\n   if h > 0 then\n    M := M,[op(u),-1],[op(u),1];\n   else\n    M := M,[op(u),1];\n   fi;\n  od:\n  L := [M];\n od:\n M := NULL;\n for u in L do\n  k := nops(select(i -> (u[i]=1 and u[i+1]=-1),[seq(i,i=1..2*len-1)]));\n  if k = peaks and `+`(op(u)) = 0 then \n   M := M,u;\n  fi;\n od:\n return [M];\nend:\n\n`count_elements/narayana_paths` := (len,peaks) ->\n narayana_number(len,peaks);\n\n`plot/narayana_path` := proc(u)\n local P,y,i;\n P := NULL;\n y := 0;\n for i from 1 to nops(u) do\n  P := P,line([i-1,y],[i,y+u[i]]);\n  y := y + u[i];\n od:\n display(P,scaling=constrained,axes=none);\nend:\n\n`digraph/narayana_path` := proc(u)\n local n,y,v,V,E,i,j,h;\n n := nops(u);\n y := 0;\n v := NULL;\n for i from 1 to n do \n  y := y + u[i];\n  v := v,y;\n od:\n v := [v];\n V := [0,op(select(i -> u[i] = 1,[seq(i,i=1..n)]))];\n E := NULL;\n for i in V do\n  if i = 0 then h := 0; else h := v[i]; fi;\n  j := i+1;\n  while j <= n and v[j] >= h do\n   if v[j] = h + 1 and u[j] = 1 then\n    E := E,[i,j];\n   fi;\n   j := j+1;\n  od;\n od:\n return [V,[E]];\nend:\n\n`extended_stasheff_tree/narayana_path` := proc(u)\n local n,V,E,L,ix,c,v,e,m,i,T,T0,t,UU;\n n := nops(u);\n V,E := op(`digraph/narayana_path`(u));\n L := select(i -> nops(select(e -> e[1]=i,E))=0,V);\n\n ix := table():\n for i from 1 to nops(L) do ix[L[i]] := i; od:\n\n c := table();\n for v in V do\n  c[v] := {};\n od:\n c[0] := {};\n for e in E do\n  c[e[1]] := {op(c[e[1]]),e[2]}; \n od:\n m := nops(V);\n for i from m to 1 by -1 do\n  v := V[i];\n  if member(v,L) then\n   T[v] := {v};\n  else\n   T[v] := map(j -> op(T[j]),c[v]);\n  fi;\n od:\n\n t := table():\n for v in V do\n  T0 := T[v];\n  if type(t[T0],integer) then\n   t[T0] := t[T0] + 1;\n  else\n   t[T0] := 0;\n  fi;\n od:\n\n UU := NULL;\n for T0 in map(op,[indices(t)]) do\n  UU := UU,[map(v -> ix[v],T0),t[T0]];\n od:\n UU := {UU};\n \n return UU;\nend:\n\ncheck_narayana := proc()\n local x,y,d,j,n,m,F0,F1,F2,F3;\n\n _ASSERT(\n  `and`(seq(seq(evalb(narayana_number(n,j) = narayana_number_basic(n,j)),j=0..20),n=1..20)),\n  \"narayana_number_basic(n,j) = narayana_number(n,j,0) for n > 0\"\n );\n \n F0 := narayana_series(x,y);\n _ASSERT(\n  simplify(x * F0^2 + (x*y-x-1) * F0 + 1) = 0,\n  \"Quadratic relation for Narayana series\"\n );\n\n F1 := narayana_series_stanley(x,y);\n \n _ASSERT(\n  simplify(F0 - F1 - 1) = 0,\n  \"narayana_series(x,y) = narayana_series_stanley(x,y) + 1\"\n );\n \n d := 9;\n m := 4;\n F2 := expand(convert(expand(series(\n  (e*x)^m * narayana_series(e*x,e*y)^(m+1),\n  e=0,d+2)),polynom,e));\n F3 := add(add(narayana_number(n,j,m) * x^n * y^j * e^(n+j),j=0..min(n-m,d-n)),n=m..d);\n _ASSERT(simplify(F3 - F2) = 0,\"generating function\");\nend:\n\n", "meta": {"hexsha": "360cd65764b4e41a02bd8692a1f6091519122c4a", "size": 4663, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/narayana.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/narayana.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/narayana.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 20.3624454148, "max_line_length": 92, "alphanum_fraction": 0.5382800772, "num_tokens": 1886, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8872046056466901, "lm_q2_score": 0.7310585786300049, "lm_q1q2_score": 0.6485985379580633}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: lda_exc *)\n(* prefix:\n  lda_c_chachiyo_params *params;\n\n  assert(p->params != NULL);\n  params = (lda_c_chachiyo_params * )(p->params);\n*)\n\ne0 := rs -> params_a_ap*log(1 + params_a_bp/rs + params_a_bp/rs^2):\ne1 := rs -> params_a_af*log(1 + params_a_bf/rs + params_a_bf/rs^2):\n\nf_chachiyo := (rs, zeta) -> e0(rs) + (e1(rs) - e0(rs))*f_zeta(zeta):\nf := (rs, zeta) -> f_chachiyo(rs, zeta):\n", "meta": {"hexsha": "255d823936f23ec467839ca208bbe446d585bef8", "size": 634, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/lda_exc/lda_c_chachiyo.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/lda_exc/lda_c_chachiyo.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/lda_exc/lda_c_chachiyo.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 28.8181818182, "max_line_length": 68, "alphanum_fraction": 0.6577287066, "num_tokens": 214, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9263037384317887, "lm_q2_score": 0.6992544335934766, "lm_q1q2_score": 0.6477219959526404}}
{"text": "######################################################################\n# nonempty_subsets(A) is the set of all nonempty subsets of A\n\n`is_element/nonempty_subsets` := (A::set) -> proc(B)\n type(B,set) and B minus A = {} and nops(B) > 0;\nend;\n\n`is_equal/nonempty_subsets` := (A::set) -> (B,C) -> evalb(B = C):\n\n`is_leq/nonempty_subsets` := (A::set) -> (B,C) -> evalb(B minus C = {}):\n\n`random_element/nonempty_subsets` := (A::set) -> proc()\n local r,B;\n\n if nops(A) = 0 then return FAIL; fi;\n\n r := rand(2);\n B := {};\n\n while nops(B) = 0 do\n  B := select(a -> (r() = 1),A);\n od;\n\n return B;\nend;\n\n`list_elements/nonempty_subsets` := (A::set) -> \n sort(map(sort,[op(combinat[powerset](A) minus {{}})])):\n\n`count_elements/nonempty_subsets` := (A::set) -> 2^nops(A) - 1;\n", "meta": {"hexsha": "421a1cb723774aaefdc43cf1a9bf1b26f98288ac", "size": 766, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/nonempty_subsets.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/nonempty_subsets.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/nonempty_subsets.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 24.7096774194, "max_line_length": 72, "alphanum_fraction": 0.5365535248, "num_tokens": 251, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8479677506936878, "lm_q2_score": 0.7634837635542925, "lm_q1q2_score": 0.6474096096722848}}
{"text": "# A Groebner basis is by definition a set of generators for an ideal\n# I in a polynomial ring over a field k.  Given such a set, one can\n# deduce a basis for the quotient ring P/I as a vector space over k.\n# We call that a cobasis for I.  The function below calculates the\n# cobasis, assuming that it is finite.  (It will just give an infinite\n# loop if the cobasis is infinite.)\n\ncobasis := proc(basis,vars)\n local lm,nf,L,L0,x,m,i;\n\n lm := map(LeadingMonomial,basis,vars);\n nf := (u) -> NormalForm(u,lm,vars);\n L := [1];\n for x in [op(vars)] do\n  L0 := L;\n  L := NULL;\n  for m in L0 do\n   i := 0;\n   while nf(m*x^i) <> 0 do\n    L := L,m*x^i;\n    i := i+1;\n   od;\n  od:\n  L := [L];\n od:\n\n return L;\nend:\n", "meta": {"hexsha": "8e5516228492f9c9d994c5ebbf8fe8e66b4b1346", "size": 705, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/groebner.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/groebner.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/groebner.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 24.3103448276, "max_line_length": 70, "alphanum_fraction": 0.6269503546, "num_tokens": 233, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9005297941266013, "lm_q2_score": 0.7185944046238982, "lm_q1q2_score": 0.6471156712564867}}
{"text": "######################################################################\n\n`is_element/P2` := (N::posint) -> (A::set) -> proc(u)\n local n,A2,ab,ba,v,i;\n global reason;\n\n if not(type(u,table)) then\n  reason := [convert(procname,string),\"u is not a table\",u];  \n  return false;\n fi;\n\n n := nops(A);\n\n A2 := `list_elements/pairs`(A);\n if {indices(u)} <> {op(A2)} then\n  reason := [convert(procname,string),\"u is not indexed by pairs in A\",u,A2];  \n  return false;\n fi;\n\n for ab in A2 do\n  v := u[op(ab)];\n  if not(`is_element/R`(N)(v)) then\n   reason := [convert(procname,string),\"u[a,b] is not in R^N\",op(ab),v,N];  \n   return false;\n  fi;\n  if simplify(add(v[i]^2,i=1..N) - 1) <> 0 then\n   reason := [convert(procname,string),\"u[a,b] is not in S^(N-1)\",op(ab),v,N];  \n   return false;\n  fi;\n od;\n\n for ab in A2 do\n  ba := [ab[2],ab[1]];\n  if u[op(ab)] +~ u[op(ba)] <> [0$N] then\n   reason := [convert(procname,string),\"u[a,b]+u[b,a] <> 0\",op(ab),u[op(ab)],u[op(ba)],N];  \n   return false;\n  fi;\n od;\n\n return true;\nend:\n\n`phi2/Fbar/P2` := (N::posint) -> (A::set) -> proc(x)\n local A2,u,ab,a,b,f;\n\n A2 := `list_elements/pairs`(A);\n u := table();\n\n for ab in A2 do \n  a,b := op(ab);\n  f := `normalise_2/F`(N)({a,b})(x[{op(ab)}]);\n\n  u[op(ab)] := combine(sqrt(2) *~ f[b]);\n od: \n\n return(eval(u));\nend: \n\n", "meta": {"hexsha": "82e19ea5d6199f6e8fc4da2374e68fe43047cf88", "size": 1298, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/operads/fulton/P2.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/operads/fulton/P2.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/operads/fulton/P2.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 22.0, "max_line_length": 92, "alphanum_fraction": 0.5184899846, "num_tokens": 457, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8740772417253256, "lm_q2_score": 0.7401743620390163, "lm_q1q2_score": 0.646969564766866}}
{"text": "#@ Not autoload\n\n# (This has been partially converted to autoloadable form, but\n# needs more work.)\n\n# This file contains formulae for elliptic curves taken from\t\n# \"Courbes Elliptiques: Formulaire (d'apr\\`es J. Tate)\"\t\n# by P. Deligne (pages 53-73 of Modular Functions of One\t\n# Variable IV, LNM 476, edited by B.J. Birch and W. Kuyk, 1975)\n\n`is_element/weierstrass_vectors` := proc(a,t := constant)\n return type(a,[t $ 5]);\nend:\n\n`weierstrass_cubic` := (a) -> proc(xy)\n local a1,a2,a3,a4,a6,x,y;\n a1,a2,a3,a4,a6 := op(a);\n x,y := op(xy);\n return y^2 + a1 * x * y + a3 * y - x^3 - a2 * x^2 - a4 * x - a6;\nend:\n\n`homogeneous_cubic` := (a) -> proc(xyz)\n local a1,a2,a3,a4,a6,x,y,z;\n a1,a2,a3,a4,a6 := op(a);\n x,y,z := op(xyz);\n return y^2*z + a1*x*y*z + a3*y*z^2 - x^3 - a2*x^2*z - a4*x*z^2 - a6*z^3;\nend:\n\n`a_to_b/weierstrass_vectors` := proc(a)\n local a1,a2,a3,a4,a6,b2,b4,b6,b8;\n\n a1,a2,a3,a4,a6 := op(a);\n \n b2 := a1^2 + 4 * a2;\n b4 := a1 * a3 + 2 * a4;\n b6 := a3^2 + 4 * a6;\n b8 := a1^2 * a6 - a1 * a3 * a4 + 4 * a2 * a6 + a2 * a3^2 - a4^2;\n\n return [b2,b4,b6,b8];\nend:\n\n`b_to_c/weierstrass_vectors` := proc(b)\n local b2,b4,b6,b8,c4,c6,delta;\n\n b2,b4,b6,b8 := op(b);\n \n c4 := b2^2 - 24 * b4;\n c6 := - b2^3 + 36 * b2 * b4 - 216 * b6;\n\n delta := -b2^2 * b8 - 8 * b4^3 - 27 * b6^2 + 9 * b2 * b4 * b6;\n\n return [c4,c6,delta];\nend:\n\n`c_to_j/weierstrass_vectors` := proc(c)\n local c4,c6,delta;\n\n c4,c6,delta := op(c);\n\n return c4^3/delta;\nend:\n\n`b_to_j/weierstrass_vectors` := proc(b)\n `c_to_j/weierstrass_vectors`(`b_to_c/weierstrass_vectors`(b));\nend:\n\n`a_to_c/weierstrass_vectors` := proc(a)\n `b_to_c/weierstrass_vectors`(`a_to_b/weierstrass_vectors`(a));\nend:\n\n`a_to_j/weierstrass_vectors` := proc(a)\n `b_to_j/weierstrass_vectors`(`a_to_b/weierstrass_vectors`(a));\nend:\n\n`b_rel/weierstrass_vectors` := proc(b)\n local b2,b4,b6,b8;\n\n b2,b4,b6,b8 := op(b);\n\n return 4 * b8 - b2 * b6 + b4^2;\nend:\n\n`c_rel/weierstrass_vectors` := proc(c)\n local c4,c6,delta;\n\n c4,c6,delta := op(c);\n\n return 1728 * delta - c4^3 + c6^2;\nend:\n\n`invariant_differential0/weierstrass_vectors` := \n (a) -> (y * dx - x * dy)/diff(homogeneous_cubic(a)([x,y,z],z);\n\n`invariant_differential1/weierstrass_vectors` := \n (a) -> (z * dy - y * dz)/diff(homogeneous_cubic(a)([x,y,z],x);\n\n`invariant_differential2/weierstrass_vectors` := \n (a) -> (x * dz - z * dx)/diff(homogeneous_cubic(a)([x,y,z],y);\n\n######################################################################\n\n`id/weierstrass_group` := [1,0,0,0]:\n\n`o/weierstrass_group` := proc(urst1,urst0)\n local u0,u1,u2,r0,r1,r2,s0,s1,s2,t0,t1,t2;\n\n u1,r1,s1,t1 := op(urst1);\n u0,r0,s0,t0 := op(urst0);\n u2 := u0 * u1;\n s2 := s1 + s0 * u1;\n r2 := r1 + r0 * u1^2;\n t2 := t1 + t0 * u1^3 + r0 * s1 * u1^2;\n return [u2,r2,s2,t2];\nend:\n\n`inv/weierstrass_group` := proc(urst)\n local u,r,s,t;\n u,r,s,t := op(urst);\n return [1/u,-r/u^2,-s/u,(r*s-t)/u^3];\nend:\n\n`act/vector/weierstrass_group` := (urst) -> proc(a)\n local u,r,s,t,a1,a2,a3,a4,a6;\n u,r,s,t := op(urst);\n a1,a2,a3,a4,a6 := op(a);\n return [\n  a1 * u - 2 * s,\n  a2 * u^2 + a1 * s * u - 3 * r - s^2,\n  a3 * u^3 - a1 * r * u + 2 * r * s - 2 * t,\n  a4 * u^4 + a3 * s * u^3 - 2 * a2 * r * u^2 +\n    a1 * (t - 2 * r * s) * u + 3 * r^2 + 2 * r * s^2 - 2 * s * t,\n  a6 * u^6 - a4 * r * u^4 +\n    a3 * (t - r * s) * u^3 + a2 * r^2 * u^2 +\n    a1 * (r^2 * s - r * t) * u + 2 * r * s * t - t^2 - r^2 * s^2 - r^3\n ];\nend:\n\n`act/curve/weierstrass_group` := (urst) -> proc(xyz)\n local u,r,s,t,x,y,z;\n u,r,s,t := op(urst);\n x,y,z := op(xyz);\n return [u^2 * x + r * z,u^3 * y + s * u^2 * x + t * z,z];\nend:\n\n#### UNFINISHED\n\n# Three expressions for the invariant differential\t\t\nalpha0 := (y * dx - x * dy)/diff(HomogeneousCubic,z);\nalpha1 := (z * dy - y * dz)/diff(HomogeneousCubic,x);\nalpha2 := (x * dz - z * dx)/diff(HomogeneousCubic,y);\n\neta := y + (a1 * x + a3)/2;\nxi  := x + b2 / 12;\n\nWeierstrassCubic2 := eta^2 - x^3 - b2/4 * x^2 - b4/2 * x + b6/4;\nWeierstrassCubic6 := eta^2 - xi^3 + c4/48 * xi + c6/864;\n\nPu := xi;\nPdashu := 2 * eta;\ng2 := c4/12;\ng3 := c6/216;\ndu := omega;\ndxi := 2 * eta * omega;\n\n                                                                  \n# alpha[t_Plus]    := Expand[alpha /@ t]\n# alpha[t_Times]   := Expand[alpha /@ t]\n# alpha[t_^n_]     := Expand[alpha[t]^n]\n# alpha[n_Integer] := n\n\ncheckalpha := {\nalpha[b2] - (b2 * u^2 - 12 * r),\nalpha[b4] - (b4 * u^4 - b2 * r * u^2 + 6 * r^2),\nalpha[b6] - (b6 * u^6 - 2 * b4 * r * u^4 + b2 * r^2 * u^2 - 4 * r^3),\nalpha[b8] - (b8 * u^8 - 3 * b6 * r * u^6 + 3 * b4 * r^2 * u^4 - b2 * r^3 * u^2 + 3 * r^4),\nalpha[c4] - c4 * u^4,\nalpha[c6] - c6 * u^6,\nalpha[Delta] - Delta * u^12\n};\n\nCurveRule := proc(F)\n  [a1 =   coeff(coeff(F,x,1),y,1),\n   a2 = - coeff(coeff(F,x,2),y,0),\n   a3 =   coeff(coeff(F,x,0),y,1),\n   a4 = - coeff(coeff(F,x,1),y,0),\n   a6 = - coeff(coeff(F,x,0),y,0)\n  ]\nend:\n\nGenericCubic := y^2 + x * y - x^3 + 36/(jj - 1728) * x + 1/(jj - 1728);\n\nmChord := proc(P,Q)\n (Q[2] - P[2])/(Q[1] - P[1]);\nend:\n\nmTangent := proc(P)\n (3 * P[1]^2 + 2 * a2 * P[1] + a4 - a1 * P[2]) / (2 * P[2] + a1 * P[1] + a3);\nend:\n\nbChord := proc(P,Q)\n (P[2] * Q[1] - Q[2] * P[1])/(Q[1] - P[1]);\nend:\n\nbTangent := proc(P)\n (- P[1]^3 + a4 * P[1] + 2 * a6 - a3 * P[2]) / (2 * P[2] + a1 * P[1] + a3);\nend:\n\nEllipticSumChord := proc(P,Q)\n local m,b,x3;\n  m := mChord(P,Q);\n  b := bChord(P,Q);\n  x3 := m^2 + a1 * m - a2 - P[1] - Q[1];\n  [x3, -(m + a1) * x3 - b - a3];\nend:\n \nEllipticSumTangent := proc(P,Q)\n local m,b,x3;\n  m := mTangent(P);\n  b := bTangent(P);\n  x3 := m^2 + a1 * m - a2 - P[1] - Q[1];\n  [x3, -(m + a1) * x3 - b - a3]\nend:\n \nNegate := proc(P)\n if nops(P) = 2 then\n  return([P[1],-P[2]-a1*P[1]-a3]); \n else\n  return([P[1],-P[2]-a1*P[1]-a3*P[3],P[3]]);\n fi;\nend:\n\nDouble := proc(x) \n (x^4 - b4 * x^2 - 2 * b6 * x - b8)/(4 * x^3 + b2 * x^2 + 2 * b4 * x + b6);\nend:\n\n# xTate = sum[q^n u / (1 - q^n u)^2 , {n,-Infinity,Infinity}] -\n#         sum[n q^n / (1 - q^n) , {n,1,Infinity}]\n\n# yTate = sum[q^(2 n) u^2 / (1 - q^n u)^3 , {n,-Infinity,Infinity}] +\n#         sum[n q^n / (1 - q^n) , {n,1,Infinity}]\n\n# TateCubic = y^2 + x y - x^3 - aTate4 x - aTate6\n\n# aTate4 = - 5 sum[ DivisorSigma[3,n] q^n , {n,1,Infinity}]\n# aTate6 = - sum[ (5 DivisorSigma[3,n] + 7 DivisorSigma[5,n])/12 q^n,\n#                  {n,1,Infinity}]\n\n# cTate4 = E4 \n# cTate6 = -E6\n\n# E4 = 1 + 240 sum[ DivisorSigma[3,n] q^n , {n,1,Infinity}]\n# E6 = 1 - 504 sum[ DivisorSigma[5,n] q^n , {n,1,Infinity}]\n# DeltaTate = q product[ (1 - q^n)^24 , {n,1,Infinity}]\n\n\n\n", "meta": {"hexsha": "e8fcdd6783483645e9fbd4069c33a0553994f498", "size": 6454, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/elliptic/formulaire.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/elliptic/formulaire.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/elliptic/formulaire.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 25.1128404669, "max_line_length": 90, "alphanum_fraction": 0.5207623179, "num_tokens": 2907, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8438951182587158, "lm_q2_score": 0.7662936484231889, "lm_q1q2_score": 0.6466714690569898}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: lda_exc *)\n\na  := [0.4581652932831429, 2.217058676663745,  0.7405551735357053, 0.01968227878617998 ]:\nap := [0.119086804055547,  0.6157402568883345, 0.1574201515892867, 0.003532336663397157]:\nb  := [1.0000000000000000, 4.504130959426697,  1.110667363742916,  0.02359291751427506 ]:\nbp := [0.000000000000000,  0.2673612973836267, 0.2052004607777787, 0.004200005045691381]:\n\nf  := (rs, zeta) ->\n  - add((a[i] + f_zeta(zeta)*ap[i])*rs^(i-1), i=1..4) /\n    add((b[i] + f_zeta(zeta)*bp[i])*rs^i,     i=1..4):\n", "meta": {"hexsha": "3280d970aaab5871a640bdce5899edc57baa54dc", "size": 752, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/lda_exc/lda_xc_teter93.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/lda_exc/lda_xc_teter93.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/lda_exc/lda_xc_teter93.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 39.5789473684, "max_line_length": 89, "alphanum_fraction": 0.6848404255, "num_tokens": 314, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9111797003640645, "lm_q2_score": 0.7090191399336402, "lm_q1q2_score": 0.646043847477121}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\nsa_a := 2.413:\nsa_b := 0.348:\n\nparams_a_b      := 0.40:\nparams_a_c      := 1.59096:\nparams_a_e      := 1.537:\nparams_a_mu     := 0.21951:\n\nsa_alpha           := (x, t) -> (t - x^2/8)/K_FACTOR_C:\n\n(* Equation (8) *)\n\ntpss_ff    := z -> 2:\ntpss_kappa := (x, t) -> 2*Pi/(3*sqrt(5)) * \\\n          sqrt(sa_alpha(x, t) + 1)/sqrt(sa_a + log(sa_alpha(x, t) + sa_b)):\n\n$include \"tpss_x.mpl\"\n\nsa_a1  := (x, t) -> tpss_kappa(x, t)/(tpss_kappa(x, t) + tpss_fx(x, t)):\nsa_f   := (x, u, t) -> 1 + tpss_kappa(x, t)*(1 - sa_a1(x, t)):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) -> mgga_exchange(sa_f, rs, z, xs0, xs1, u0, u1, t0, t1):\n", "meta": {"hexsha": "5def430760af4e189f97607b51492d5b311b12ef", "size": 881, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_sa_tpss.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_sa_tpss.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_sa_tpss.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 26.696969697, "max_line_length": 99, "alphanum_fraction": 0.5652667423, "num_tokens": 358, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9324533163686645, "lm_q2_score": 0.6926419704455588, "lm_q1q2_score": 0.6458563023980878}}
{"text": "# Compute the actual repartition of nodes between the different application classes:\n# We have 17784 nodes\nN := 17784;\n# We want 66% / 5.5% / 15.5% and 12.5% overall\nworkload := [.66, 0.55e-1, .155, .12];\n# Each app has q[i] nodes and lasts for wall[i] hours\nwall := [262.4, 64, 128, 157.2];\nq := [16384*(1/16), 4096*(1/16), 32768*(1/16), 30000*(1/16)];\n# ress[i] represents the CPU.h used by an application of class i\nress := [q[1]*wall[1], q[2]*wall[2], q[3]*wall[3], q[4]*wall[4]];\n# t represents the resource necessary to run one app of each class\nt := sum(ress[i], i = 1 .. 4);\n# ressratio[i] is the proportion of CPU.h neede to run one app of class i\nressratio := [ress[1]/t, ress[2]/t, ress[3]/t, ress[4]/t];\n# nratio[i] is the relative number of applications of class i to run in order to get the workload goal\nnratio := [workload[1]/ressratio[1], workload[2]/ressratio[2], workload[3]/ressratio[3], workload[4]/ressratio[4]];\n# m is a scaling factor so that the total number of nodes is N\nm := N/evalf(sum(q[i]*nratio[i], i = 1 .. 4));\n# n[i] is thus the number of applications of class i that we run in steady state\nn := m*nratio;\n\n# Waste(C, mu) computes Equation (7) of the paper\nWaste := proc (C, mu)\n   local P, r, Period;\n   # Pi is computed for each qi/Ci following equation (8)\n   P := [sqrt(2*mu*N*(q[1]/N+L)*C[1]/q[1]^2), sqrt(2*mu*N*(q[2]/N+L)*C[2]/q[2]^2), sqrt(2*mu*N*(q[3]/N+L)*C[3]/q[3]^2), sqrt(2*mu*N*(q[4]/N+L)*C[4]/q[4]^2)];\n   # r is the lambda that solves equation (6), assuming we want the smallest lambda that is still positive\n   r := fsolve(sum(n[i]*C[i]/P[i], i = 1 .. 4)-1 = 0, L);\n   # Periodi is the numerical value corresponding to equation (8) with lambda instanciated\n   Period := eval(P, L = min(0, r));\n   # and we return Equation (7) for the computed Periodi\n   return evalf(sum(n[i]*q[i]*(C[i]/Period[i]+q[i]*((1/2)*Period[i]+C[i])/mu)/N, i = 1 .. 4))\nend proc;\n\n# We extracted the checkpoint duration for each application class at 40 GB/s from the simulation trace\n# and scale up the checkpoint time for variable bandwidth\n# We convert the time in hours (as for the rest of this file)\nCkptTime := proc (bw)\n    return [1310.72*0.4e11/(3600*bw), 378.88*0.4e11/(3600*bw), 5734.4*0.4e11/(3600*bw), 1275*0.4e11/(3600*bw)]\nend proc;\n\n# For each bandwidth in the figure, and each MTBF in the figure, compute the theoretical waste and store it into model.dat\nfd := fopen(\"celio.dat\", WRITE);\nfor bw from 0.4e11 by 0.1e11 to 0.16e12 do\n    for M in [1, 2, 4, 8, 16, 24] do\n    \t# M*N is the node MTBF in hours\n        fprintf(fd, \"%g\\t%g\\t%g\\n\", bw, M, Waste(CkptTime(bw), M*N))\n    end do\nend do;\nfclose(fd);\n", "meta": {"hexsha": "3171199c9177f6aad671f5fcc025cff98fcd2219", "size": 2648, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "maple/celio.mpl", "max_stars_repo_name": "SMURFSorg/InterferingCheckpoints", "max_stars_repo_head_hexsha": "ade317bdf58a4feed975bf5449bf17dcc912ec94", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "maple/celio.mpl", "max_issues_repo_name": "SMURFSorg/InterferingCheckpoints", "max_issues_repo_head_hexsha": "ade317bdf58a4feed975bf5449bf17dcc912ec94", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "maple/celio.mpl", "max_forks_repo_name": "SMURFSorg/InterferingCheckpoints", "max_forks_repo_head_hexsha": "ade317bdf58a4feed975bf5449bf17dcc912ec94", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 51.9215686275, "max_line_length": 157, "alphanum_fraction": 0.6503021148, "num_tokens": 970, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9149009573133051, "lm_q2_score": 0.7057850402140659, "lm_q1q2_score": 0.6457234089492584}}
{"text": "# P(N) is the set of real polynomials in epsilon of degree less than N\n\n######################################################################\n\n`is_element/P` := (N::posint) -> proc(u)\n global reason;\n\n if not type(u,polynom(realcons,epsilon)) then \n  reason := [convert(procname,string),\"u is not polynomial in epsilon\",u];\n  return false;\n fi;\n\n if degree(u,epsilon) >= N then\n  reason := [convert(procname,string),\"deg(u) >= N\",u,N];\n  return false;\n fi;\n\n return true;\nend;\n\n`is_leq/P` := (N::posint) -> proc(u,v)\n local w,d,c;\n\n w := expand(v-u);\n if (w = 0) then return true; fi;\n d := ldegree(w,epsilon);\n c := coeff(w,epsilon,d);\n return evalb(c >= 0);\nend:\n\n`random_element/P` := (N::posint) -> proc(d::posint := 4)\n local r,i;\n r := rand(-d^2..d^2);\n add(r()/d * epsilon^i,i=0..N-1);\nend;\n\n`list_elements/P` := NULL;\n`count_elements/P` := NULL;\n\n", "meta": {"hexsha": "68dcd15878c9f008bd4bd8832a04742db88e53f2", "size": 856, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/operads/chains/P.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/operads/chains/P.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/operads/chains/P.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 21.4, "max_line_length": 74, "alphanum_fraction": 0.5630841121, "num_tokens": 258, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8688267762381844, "lm_q2_score": 0.7431680029241321, "lm_q1q2_score": 0.6456842601839433}}
{"text": "############################################\n#  Performing finite differencing  using\n#  FD toolkit. See previous script \n#  'compactification.mpl' for how the tt table\n#  is generated\n############################################\n\nread \"/home/arman/FD/FD.mpl\":\nCFD();\nMFD();\n\ninterface(warnlevel=0);\nwith(StringTools):\n\n##############################################################\n# By default FD uses second order centered in Gen_Sten for RHS\n# which is exactly what we want \n##############################################################\n\nfor ii from 1 to nops(all_tensors) do\n  nm:= all_tensors[ii][1]:\n  rank := all_tensors[ii][2]:\n  tp  := all_tensors[ii][3]:\n\n  printf(\"Discretizing %a\\n\",nm);\n  if rank <> 0 then\n      # Note the collect operator on powers of 1/hx, it will help the compiler's O3 flag a lot!\n      tt[nm][dis] := table( [ seq(  coord[jj] = collect(Gen_Sten(tt[nm][all][coord[jj]]),1/hx) ,jj=1..2 ) ] );\n      tt[nm][disreg] := table( [seq( coord[jj] = collect(Gen_Sten(tt[nm][reg][coord[jj]]),1/hx) ,jj=1..2 ) ] );\n  else\n      tt[nm][dis] := collect(Gen_Sten(tt[nm][all]),1/hx);\n      tt[nm][disreg] := collect(Gen_Sten(tt[nm][reg]),1/hx);\n  end if;\n\nend do:\n\n###################################################\n# Bounday condition at infinity for the tensors:\n# Note that we use 'myzero*x' to indicate '0' grid\n# function at infinity, See documentation of FD\n# for why this is neccessary\n# The overhead of this is almost zero!\n###################################################\n\ninf_b_cond:= table( [\nEMPH = myzero*x+1,\nDPH = myzero*x,\nDB  = myzero*x,\ndg  = [myzero*x,myzero*x],\nmet = [myzero*x+1,myzero*x+1],\nDDL = [myzero*x,myzero*x],\nDTK = myzero*x,\nRR  = [myzero*x,myzero*x],\nU   = [myzero*x,myzero*x],\nP   = [myzero*x,myzero*x],\nDAA = [myzero*x,myzero*x],\nDLAM = [myzero*x,myzero*x],\nC1 = myzero*x,\nC5 = myzero*x,\nHS = psi(t,x)-1 + myzero*x,\nHS3 = psi(t,x)-1 + myzero*x,\nEQRPIb2 = myzero*x,\nEQIPIb2 = myzero*x,\nEQIPSI = myzero*x,\nEQRPSI = myzero*x,\nDRPSI = myzero*x,\nDIPSI = myzero*x\n]);\n\n# Discretizing the infinity boundary conditions\n\nfor ii from 1 to nops(all_tensors) do\n  nm:= all_tensors[ii][1]:\n  rank := all_tensors[ii][2]:\n  tp  := all_tensors[ii][3]:\n\n  printf(\"Discretizing %a\\n\",nm);\n  if rank <> 0 then\n      tt[nm][disinf] := table( [ seq(  coord[jj] = Gen_Sten(inf_b_cond[nm][jj]) ,jj=1..2 ) ] );\n  else\n      tt[nm][disinf] := Gen_Sten(inf_b_cond[nm]);\n  end if;\n\nend do:\n\n\n# Updating FD's table to default centered in all coordinates\n\npl:=table([ t=[-1,-1],x=[-1,-1],y=[-1,-1],z=[-1,-1] ]):\nUpdate_FD_Table(2,pl):\n\n\n\n############################################\n# A table to hold the LHS of BSSN equations\n# in their continuous form\n############################################\n\nevol_eq_LHS_tbl := table ( [ \nDPH = diff(phi(t,x),t),\ndg = [diff(A(t,x),t),diff(B(t,x),t)],\nDTK = diff(K(t,x),t),\nDAA = [diff(Axx(t,x),t),diff(Athth(t,x),t)],\nDLAM = [diff(Lamx(t,x),t),0],\nEQRPIb2 = diff(rPIb2(t,x),t),\nEQIPIb2 = diff(iPIb2(t,x),t),\nEQRPSI  = diff(rpsi(t,x),t),\nEQIPSI  = diff(ipsi(t,x),t)\n] );\n\n\n###############################################\n# A table to hold what each tensorial equation\n# is actually will be solved for, this will be\n# needed by FD to decide what to solve the FDA\n# for!\n###############################################\n\nsolve_for_tbl := table ( [ \n   DPH = phi(n+1,i),\n   dg  = table( [ x = A(n+1,i) , theta=B(n+1,i)  ] ),\n   DTK = K(n+1,i), \n   DAA = table( [ x = Axx(n+1,i), theta=Athth(n+1,i) ] ),\n   DLAM = table( [ x = Lamx(n+1,i), theta = 0 ] ),\n   EQRPIb2 = rPIb2(n+1,i),\n   EQIPIb2 = iPIb2(n+1,i),\n   EQRPSI = rpsi(n+1,i),\n   EQIPSI = ipsi(n+1,i)\n] );\n\n#################################################\n# A table to hold what are the actual discrete\n# form of the functions are, this will be needed\n# by FD\n#################################################\n\ndis_func_tbl := table ( [ \n   DPH = phi(n,i),\n   dg  = table( [ x = A(n,i) , theta=B(n,i)  ] ),\n   DTK = K(n,i), \n   DAA = table( [ x = Axx(n,i), theta=Athth(n,i) ] ),\n   DLAM = table( [ x = Lamx(n,i), theta = 0 ] ),\n   EQRPIb2 = rPIb2(n,i),\n   EQIPIb2 = iPIb2(n,i),\n   EQRPSI = rpsi(n,i),\n   EQIPSI = ipsi(n,i)\n] );\n\n\n##########################################################\n# The implementaion of the famous Kreiss/Oliger disspation \n# using FD's 'FD' operator, will be used in the RHS of the\n# evolution equations to suppress numerical noise\n# See FD's documentation on how 'FD' operator works, but\n# if you are familiar with RNPL, it should be pretty clear\n# what is happening here!\n##########################################################\n\nDISS := f-> -zepsdis / (16*ht) * ( 6*FD(f,[[0],[0,0,0]]) \n                                   + FD(f,[[0],[2,0,0]]) \n                                   + FD(f,[[0],[-2,0,0]])\n                                 - 4*FD(f,[[0],[1,0,0]]) \n                                 - 4*FD(f,[[0],[-1,0,0]]) \n                                );\n\n# Defining average operator for Crank-Nickelson second order update\nAVGT := f -> (FD(f,[[1],[0,0,0]]) + FD(f,[[0],[0,0,0]]))/2 ;\n\n# Advanced time operator\nNT := f -> FD(f,[[1],[0,0,0]]);\n\n# 2nd order interpolation at the boundary (used at origin)\nQFIT := f-> FD(f,[[0],[0,0,0]]) - 4*FD(f,[[0],[1,0,0]])/3 + FD(f,[[0],[2,0,0]])/3 ;\n\n######################################################################\n# Shift operator, will be used for the point next to origin condition\n# See Eq. (58) in the paper: http://arxiv.org/pdf/1508.01614v2.pdf\n#######################################################################\n\nSB := f -> FD(f,[[0],[-1,0,0]]);\n\n# Updating FD's table to default in all coordinates\npl:=table([ t=[-1,-1],x=[-1,-1],y=[-1,-1],z=[-1,-1] ]):\nUpdate_FD_Table(2,pl):\n\n# The evolutionary type equations:\nevol_trm := [[DPH,0],[dg,2],[DTK,0],[DAA,2],[DLAM,1], [EQRPIb2,0] , [EQIPIb2,0], [EQRPSI,0], [EQIPSI,0] ];\n\n# Initiating a table to hold the actual equations (residuals) in discrete form\nevol_eq_tbl := table ( [] );\n\n# Updating to forward in time differencing scheme, i.e. Crank-Niecklson when combined with AVGT\nFD_table[t] := [ [0] , [0,1] ];\n\n# List of all even/odd functions, will be used by FD for imposing inner-boundary conditions\nset_of_even_funcs:={alpha,K,phi,Axx,Athth,A,B,psi,a1,a2,b1,ipsi,rpsi,iPIb2,rPIb2,rPI,iPI,divbeta}:\nset_of_odd_funcs:={beta,Lamx,rPHI,iPHI}:\n\nfor ii from 1 to nops(evol_trm) do\n  nm := evol_trm[ii][1];\n  rank := evol_trm[ii][2];\n  if rank <> 0 then\n    for jj from 1 to 2 do\n       cn := coord[jj];\n       #######  THIS IS THE EQUATION IN FDA FORM ############\n       evol_eq_tbl[nm][dis][cn] := Gen_Sten(evol_eq_LHS_tbl[nm][jj]) - AVGT(tt[nm][dis][cn]);\n       evol_eq_tbl[nm][disreg][cn] := Gen_Sten(evol_eq_LHS_tbl[nm][jj]) - AVGT(tt[nm][disreg][cn]);\n       # Applying boundary conditions using FD's facilities at the origin\n       t_mp_1:= A_FD_Even(tt[nm][disreg][cn],x,set_of_even_funcs,0,\"forward\");\n       t_mp_2:= A_FD_Odd(t_mp_1,x,set_of_odd_funcs,0,\"forward\");\n       # Storing  (in 'disorg') a version of FDA that can be used next to the origin \n       evol_eq_tbl[nm][disorg][cn] := Gen_Sten(evol_eq_LHS_tbl[nm][jj]) - AVGT(t_mp_2);\n       # Storing the form of the equation at infinity:\n       evol_eq_tbl[nm][disinf][cn] := Gen_Sten(evol_eq_LHS_tbl[nm][jj]) - AVGT(tt[nm][disinf][cn]);\n    end do\n  else\n      # Same as above\n      evol_eq_tbl[nm][dis] := Gen_Sten(evol_eq_LHS_tbl[nm]) - AVGT(tt[nm][dis]);\n      evol_eq_tbl[nm][disreg] := Gen_Sten(evol_eq_LHS_tbl[nm]) - AVGT(tt[nm][disreg]);\n      t_mp_1:= A_FD_Even(tt[nm][disreg],x,set_of_even_funcs,0,\"forward\");\n      t_mp_2:= A_FD_Odd(t_mp_1,x,set_of_odd_funcs,0,\"forward\");\n      evol_eq_tbl[nm][disorg] := Gen_Sten(evol_eq_LHS_tbl[nm]) - AVGT(t_mp_2);\n      evol_eq_tbl[nm][disinf] := Gen_Sten(evol_eq_LHS_tbl[nm]) - AVGT(tt[nm][disinf]);\n  end if;\nend do;\n\n# The evaluation type equations, i.e. 'work variables'\neval_term := [[EMPH,0] , [DB,0] ,[met,2],[DDL,2] ,[RR,2],[U,2], [P,2] ,[C1,0], [C5,0], [DIPSI,0], [DRPSI,0]];\n\neval_expr_tbl := table ( [] );\n\nfor ii from 1 to nops(eval_term) do \n  nm := eval_term[ii][1];\n  rank := eval_term[ii][2];\n  if rank <> 0 then\n    for jj from 1 to 2 do\n      cn := coord[jj];\n      eval_expr_tbl[nm][dis][cn] := (tt[nm][dis][cn]);\n      eval_expr_tbl[nm][disreg][cn] := (tt[nm][disreg][cn]);\n      eval_expr_tbl[nm][disinf][cn] := (tt[nm][disinf][cn]);\n      # Same as evolution case\n      t_mp_1:= A_FD_Even(tt[nm][disreg][cn],x,set_of_even_funcs,0,\"forward\");\n      t_mp_2:= A_FD_Odd(t_mp_1,x,set_of_odd_funcs,0,\"forward\");\n      eval_expr_tbl[nm][disorg][cn] := t_mp_2;\n    end do;\n  else\n      eval_expr_tbl[nm][dis]:= (tt[nm][dis]);\n      eval_expr_tbl[nm][disreg]:= (tt[nm][disreg]);\n      eval_expr_tbl[nm][disinf]:= (tt[nm][disinf]);\n      t_mp_1:= A_FD_Even(tt[nm][disreg],x,set_of_even_funcs,0,\"forward\");\n      t_mp_2:= A_FD_Odd(t_mp_1,x,set_of_odd_funcs,0,\"forward\");\n      eval_expr_tbl[nm][disorg] := t_mp_2;    \n  end if;\nend do;\n\n\n\n# Switching to forward in 'x' (ie 'r') for doing FDA at the origin\npl:=table([ t=[-1,-1],x=[0,-1],y=[-1,-1],z=[-1,-1] ]):\nUpdate_FD_Table(2,pl):\n\n# Again in time, we use CN scheme\nFD_table[t] := [ [0] , [0,1] ];\n\n#######################################################\n# Table for boundary conditions at the origin\n# See the paper: http://arxiv.org/pdf/1508.01614v2.pdf \n#######################################################\n\norg_bdc_tbl := table ( [\n   # d phi / dx must be zero at origin\n   DPH = NT(Gen_Sten(diff(phi(t,x),x))),\n   # conformal metric components are 1 at the origin\n   dg  = table( [ x = A(n+1,i) - 1 +myzero*x(i) , theta= B(n+1,i) -1 + myzero*x(i)  ] ),\n   # exterinsic curvature has zero spatial derivative at origin:\n   DTK = NT(Gen_Sten(diff(K(t,x),x))),\n   # (from dg eq above) conformal extrinsic curvature are fixed 0 at the origin\n   DAA = table( [ x = Axx(n+1,i) +myzero*x(i), theta= Athth(n+1,i)+myzero*x(i) ] ),\n   # Conformal connection is vector thus zero at the origin\n   DLAM = table( [ x = Lamx(n+1,i) +myzero*x(i), theta= 0 ] ),\n   # We use interpolation for matter fields\n   EQRPIb2 = NT(QFIT(rPIb2(n,i))),\n   EQIPIb2 = NT(QFIT(iPIb2(n,i))),\n   EQRPSI  = NT(QFIT(rpsi(n,i))),\n   EQIPSI  = NT(QFIT(ipsi(n,i)))\n] );\n\n##################################################################\n# Extra boundary conditions for the point next to the origin\n# as explained in the paper: http://arxiv.org/pdf/1508.01614v2.pdf\n# See eq. 58 in the paper\n###################################################################\n\norgp1_bdc_tbl := table ( [\n   # Just using the original version, (no extra condition)\n   DPH = evol_eq_tbl[DPH][dis],\n   # Using higher order derivative condition (see the paper)\n   dg  = table( [ x = NT(SB(Gen_Sten(diff(A(t,x),x)))) ,theta= NT(SB(Gen_Sten(diff(B(t,x),x)))) ] ),\n   # No BC here\n   DTK = evol_eq_tbl[DTK][dis],\n   # Same as dg\n   DAA  = table( [ x = NT(SB(Gen_Sten(diff(Axx(t,x),x)))) +hx*myzero ,theta= hx*myzero+NT(SB(Gen_Sten(diff(Athth(t,x),x))))  ] ),\n   # Same as dg\n   DLAM = table( [ x = NT(SB(Gen_Sten(diff(Lamx(t,x),x,x))) ), theta= 0 ] ),\n   # No BC here\n   EQRPIb2 = evol_eq_tbl[EQRPIb2][dis],\n   EQIPIb2 = evol_eq_tbl[EQIPIb2][dis],\n   EQRPSI  = evol_eq_tbl[EQRPSI][dis],\n   EQIPSI  = evol_eq_tbl[EQIPSI][dis]\n\n] );\n\n\n# Adding the newly defined FDA's to the original table:\nfor ii from 1 to nops(evol_trm) do\n  nm := evol_trm[ii][1];\n  rank := evol_trm[ii][2];\n  if rank <> 0 then\n    for jj from 1 to 2 do\n       cn := coord[jj];\n        evol_eq_tbl[nm][disorg][cn] := org_bdc_tbl[nm][cn];\n        evol_eq_tbl[nm][disorgp1][cn] := orgp1_bdc_tbl[nm][cn];\n    end do\n  else\n       evol_eq_tbl[nm][disorg] := org_bdc_tbl[nm];\n       evol_eq_tbl[nm][disorgp1] := orgp1_bdc_tbl[nm];\n  end if;\nend do:\n\n# BC for work variables, in reality the values will never be used\ne_org_bdc_tbl := table ( [\nEMPH = myzero*x+1,\nmet = [myzero*x+1,myzero*x+1],\nDDL = [myzero*x,myzero*x],\nRR  = [myzero*x,myzero*x],\nU   = [myzero*x,myzero*x],\nP   = [myzero*x,myzero*x],\nC1 = myzero*x,\nC5 = myzero*x,\nDRPSI = myzero*x,\nDIPSI = myzero*x,\nDB  = myzero*x\n ] );\n\npl:=table([ t=[-1,-1],x=[-1,-1],y=[-1,-1],z=[-1,-1] ]):\nUpdate_FD_Table(2,pl):\n\n# Adding them to the equation table:\nfor ii from 1 to nops(eval_term) do\n  nm := eval_term[ii][1];\n  rank := eval_term[ii][2];\n  if rank <> 0 then\n    for jj from 1 to 2 do\n       cn := coord[jj];\n        eval_expr_tbl[nm][disorg][cn] := Gen_Sten(e_org_bdc_tbl[nm][jj]);\n    end do\n  else\n        eval_expr_tbl[nm][disorg] := Gen_Sten(e_org_bdc_tbl[nm]);\n  end if;\nend do:\n\n\n# Treating Hamiltonian constraint seperately\npl:=table([ t=[-1,-1],x=[-1,-1],y=[-1,-1],z=[-1,-1] ]):\nUpdate_FD_Table(2,pl):\n\n\nnm := HS;\n\nconst_eq_tbl := table ( [] );\n\nconst_eq_tbl[nm][dis] := tt[nm][dis];\nconst_eq_tbl[nm][disreg] := tt[nm][disreg];\nt_mp_1 := A_FD_Even(tt[nm][disreg],x,set_of_even_funcs,0,\"forward\");\nt_mp_2 := A_FD_Odd(t_mp_1,x,set_of_odd_funcs,0,\"forward\");\nconst_eq_tbl[nm][disorg] := t_mp_2;\n\npl:=table([ t=[-1,-1],x=[-1,0],y=[-1,-1],z=[-1,-1] ]):\nUpdate_FD_Table(2,pl):\n\n# BC for Hamiltonian constraint at infinity:\nconst_eq_tbl[nm][inf] := Gen_Sten(ctfm(x)*diff(psi(t,x),x)/ctfmp(x) + psi(t,x) - 1);\n\npl:=table([ t=[-1,-1],x=[0,-1],y=[-1,-1],z=[-1,-1] ]):\nUpdate_FD_Table(2,pl):\n\nconst_eq_tbl[nm][disorg] := Gen_Sten(diff(psi(t,x),x));\n\npl:=table([ t=[-1,-1],x=[-1,-1],y=[-1,-1],z=[-1,-1] ]):\nUpdate_FD_Table(2,pl):\n\n\n# Will store header files, to pre-generate the C routine\nOther_Headers := NULL;\n\n# DDS for HC is easy:\n\nspec := [   \n  { i = [1,1,1],  b=xmin } =  const_eq_tbl[nm][disorg] ,\n  { i = [2,Nx-1,1] } = const_eq_tbl[nm][dis] , \n  { i = [Nx,Nx,1], b=xmax  } = const_eq_tbl[nm][inf]\n ];\n\n# Residual evaluator for HC\nA_Gen_Res_Code(spec,input=\"d\",proc_name=\"resid_hs\");\nOther_Headers := Other_Headers , \"resid_hs\";\n\n# Solver for HC\nA_Gen_Solve_Code(spec,{psi(n,i)},proc_name=\"solve_hs\");\nOther_Headers := Other_Headers , \"solve_hs\";\n\n# Now working with momentum constraint\npl:=table([ t=[-1,-1],x=[-1,-1],y=[-1,-1],z=[-1,-1] ]):\nUpdate_FD_Table(2,pl):\n\nnm := MK;\n\nconst_eq_tbl := table ( [] );\n\nconst_eq_tbl[nm][dis] := tt[nm][dis][x];\nconst_eq_tbl[nm][disreg] := tt[nm][disreg][x];\nt_mp_1 := A_FD_Even(tt[nm][disreg][x],x,set_of_even_funcs,0,\"forward\");\nt_mp_2 := A_FD_Odd(t_mp_1,x,set_of_odd_funcs,0,\"forward\");\nconst_eq_tbl[nm][disorg] := t_mp_2;\n\nspec := [   \n  { i = [1,1,1],  b=xmin } =  const_eq_tbl[nm][disorg] ,\n  { i = [2,Nx-1,1] } = const_eq_tbl[nm][dis] , \n  { i = [Nx,Nx,1], b=xmax  } = myzero*x(i)\n ];\n\n# Evaluator routine for momentum constraint, for testing purposes\nA_Gen_Eval_Code(spec,input=\"d\",proc_name=\"ire_mk\");\n\n\n##########################################################\n# See the bssn_spher.mw for what HS3 is, another form of\n# Hamiltonian constraint\n##########################################################\npl:=table([ t=[-1,-1],x=[-1,-1],y=[-1,-1],z=[-1,-1] ]):\nUpdate_FD_Table(2,pl):\n\n\nnm := HS3;\n\nconst_eq_tbl := table ( [] );\n\nconst_eq_tbl[nm][dis] := tt[nm][dis];\n\npl:=table([ t=[-1,-1],x=[-1,0],y=[-1,-1],z=[-1,-1] ]):\nUpdate_FD_Table(2,pl);\n\nconst_eq_tbl[nm][inf] := Gen_Sten(psi(t,x) - 1 +myzero*ctfm(x));\n\npl:=table([ t=[-1,-1],x=[0,-1],y=[-1,-1],z=[-1,-1] ]):\nUpdate_FD_Table(2,pl):\n\nconst_eq_tbl[nm][disorg] := Gen_Sten(diff(psi(t,x),x)):\n\n\npl:=table([ t=[-1,-1],x=[-1,-1],y=[-1,-1],z=[-1,-1] ]):\nUpdate_FD_Table(2,pl):\n\n\nOther_Headers := NULL;\n\nspec := [   \n  { i = [1,1,1],  b=xmin } =  const_eq_tbl[nm][disorg] ,\n  { i = [2,Nx-1,1] } = const_eq_tbl[nm][dis] , \n  { i = [Nx,Nx,1], b=xmax  } = const_eq_tbl[nm][inf]\n ]:\n\nA_Gen_Res_Code(spec,input=\"d\",proc_name=\"resid_hs3\");\nOther_Headers := Other_Headers , \"resid_HS3\";\n\nA_Gen_Solve_Code(spec,{psi(n,i)},proc_name=\"solve_hs3\");\nOther_Headers := Other_Headers , \"solve_HS3\";\n\n\n# End of constraint equation solvers / evaluators\n\n\n# Initializer expressions for grid functions:\n\ninit_alpha_expr:=myzero*x+1;\ninit_beta_expr:=myzero*x;\ninit_A_expr:=myzero*x+1;\ninit_B_expr:=myzero*x+1;\ninit_Axx_expr:=myzero*x;\ninit_Athth_expr:=myzero*x;\ninit_TK_expr:=myzero*x;\ninit_Lamx_expr:=myzero*x;\n\n# Some redefintion of variables:\n\nphi_expr:=log(psi(t,x));\npsi_expr := exp(phi(t,x));\na2_expr:= psi(t,x)^4*A(t,x);\na1_expr := sqrt(a2(t,x));\nb1_expr := psi(t,x)^2*sqrt(B(t,x));\n\nlv := 'lv'; \nrv := 'rv';\n\n# Initializer for matter field (Gaussian pulse on real coordinate)\nrpsi_expr :=  amp*exp( - ( ctfm(x) - x0 )^2 / deltx^2 );\nipsi_expr := myzero*x*x;\n\n\n# Note the correction due to compactification\ninit_rPHI_expr := diff(rpsi_expr, x)/ctfmp(x);\ninit_iPHI_expr := diff(ipsi_expr, x)/ctfmp(x);\n\nrpsidot_expr := myzero*x;\nipsidot_expr := omega*rpsi_expr;\n\n# PI = a/alpha(psidot - beta*psiprime)\n\ninit_rPI_expr := a1(t,x)/alpha(t,x)*(rpsidot(t,x) - beta(t,x)*rPHI(t,x));\ninit_iPI_expr := a1(t,x)/alpha(t,x)*(ipsidot(t,x) - beta(t,x)*iPHI(t,x));\n\ninit_rPIb2_expr := rPI(t,x)*b1(t,x)^2;\ninit_iPIb2_expr := iPI(t,x)*b1(t,x)^2;\n\nrPI_comp_expr :=  rPIb2(t,x)/b1(t,x)^2;\niPI_comp_expr :=  iPIb2(t,x)/b1(t,x)^2;\n\nPI2_expr := (rPI(t,x)^2 + iPI(t,x)^2);\nPHI2_expr := (rPHI(t,x)^2 + iPHI(t,x)^2);\n\n# Energy-momentum tensor expressions:\n\nU_expr := mass*(rpsi(t,x)^2 + ipsi(t,x)^2);\n\nrho_expr:= ( PI2(t,x) + PHI2(t,x) ) / ( 2*a2(t,x)) + U(t,x)/2;\n\nJSxx_expr:=  ( PI2(t,x) + PHI2(t,x) ) / (2) - a2(t,x)*U(t,x)/2;\n\nJSthetatheta_expr :=  (  (PI2(t,x) - PHI2(t,x)) / ( 2*a2(t,x) ) - U(t,x)/2  ) * b1(t,x)^2;\n\nTS_expr := ( 3*PI2(t,x) - PHI2(t,x) ) / (2*a2(t,x) ) - 3/2*U(t,x) ;\nSx_expr := - (  rPI(t,x)*rPHI(t,x) + iPI(t,x)*iPHI(t,x)  ) / (a1(t,x))  ;\n\n\n############################################################\n# all_expr will be used for pre-generation of main.c routine\n# this is an experimental feature in FD\n############################################################\nall_expr := rPHI_expr+mass+omega;\n\n# Creating initializer routines\n\nGen_Eval_Code(init_alpha_expr,input=\"c\",proc_name=\"init_alpha\");\nGen_Eval_Code(init_beta_expr,input=\"c\",proc_name=\"init_beta\");\n\n\nGen_Eval_Code(init_A_expr,input=\"c\",proc_name=\"init_a\");\nGen_Eval_Code(init_B_expr,input=\"c\",proc_name=\"init_b\");\n\nGen_Eval_Code(init_TK_expr,input=\"c\",proc_name=\"init_tk\");\nGen_Eval_Code(init_Axx_expr,input=\"c\",proc_name=\"init_axx\");\nGen_Eval_Code(init_Athth_expr,input=\"c\",proc_name=\"init_athth\");\nGen_Eval_Code(init_Lamx_expr,input=\"c\",proc_name=\"init_lamx\");\n\n\nGen_Eval_Code(rpsi_expr,input=\"c\",proc_name=\"init_rpsi\");\nGen_Eval_Code(ipsi_expr,input=\"c\",proc_name=\"init_ipsi\");\n\nGen_Eval_Code(init_iPHI_expr,input=\"c\",proc_name=\"init_iphi\");\nGen_Eval_Code(init_rPHI_expr,input=\"c\",proc_name=\"init_rphi\");\n\nGen_Eval_Code(rpsidot_expr,input=\"c\",proc_name=\"init_rpsidot\");\nGen_Eval_Code(ipsidot_expr,input=\"c\",proc_name=\"init_ipsidot\");\n\nGen_Eval_Code(init_rPI_expr,input=\"c\",proc_name=\"init_rpi\");\nGen_Eval_Code(init_iPI_expr,input=\"c\",proc_name=\"init_ipi\");\n\nGen_Eval_Code(init_iPIb2_expr,input=\"c\",proc_name=\"init_ipib2\");\nGen_Eval_Code(init_rPIb2_expr,input=\"c\",proc_name=\"init_rpib2\");\n\n\n\nGen_Eval_Code(phi_expr,input=\"c\",proc_name=\"compute_phi\");\nGen_Eval_Code(psi_expr,input=\"c\",proc_name=\"compute_psi\");\nGen_Eval_Code(a2_expr,input=\"c\",proc_name=\"compute_a2\");\nGen_Eval_Code(a1_expr,input=\"c\",proc_name=\"compute_a1\");\nGen_Eval_Code(b1_expr,input=\"c\",proc_name=\"compute_b1\");\n\nGen_Eval_Code(iPI_comp_expr,input=\"c\",proc_name=\"compute_ipi\");\nGen_Eval_Code(rPI_comp_expr,input=\"c\",proc_name=\"compute_rpi\");\n\n\nGen_Eval_Code(PHI2_expr,input=\"c\",proc_name=\"compute_phi2\");\nGen_Eval_Code(PI2_expr,input=\"c\",proc_name=\"compute_pi2\");\n\nGen_Eval_Code(U_expr,input=\"c\",proc_name=\"compute_u\");\n\nGen_Eval_Code(rho_expr,input=\"c\",proc_name=\"compute_rho\");\nGen_Eval_Code(JSxx_expr,input=\"c\",proc_name=\"compute_jsxx\");\nGen_Eval_Code(JSthetatheta_expr,input=\"c\",proc_name=\"compute_jsthth\");\nGen_Eval_Code(TS_expr,input=\"c\",proc_name=\"compute_ts\");\nGen_Eval_Code(Sx_expr,input=\"c\",proc_name=\"compute_sx\");\n\nC5psi_expr := C5s(t,x)*psi(t,x)^5;\nGen_Eval_Code(C5psi_expr,input=\"c\",proc_name=\"compute_c5psi\");\n\n\n# Newly generated header files, will be passed to C code generator\nOther_Headers := Other_Headers , \"init_alpha\", \"init_beta\", \"init_A\" , \"init_B\", \"init_TK\", \"init_Axx\", \"init_Athth\", \n                \"init_Lamx\", \"compute_phi\", \"compute_psi\", \"compute_a2\", \"compute_a1\",\n                \"compute_b1\", \"init_rpsi\", \"init_ipsi\", \"init_iphi\", \"init_rphi\",\n                \"init_ipib2\", \"init_rpib2\", \"compute_ipi\", \"compute_rpi\", \n                \"compute_phi2\", \"compute_pi2\", \"compute_u\", \"compute_rho\", \"compute_jsxx\",\n                \"compute_jsthth\", \"compute_ts\", \"compute_sx\", \"init_rpsidot\", \"init_ipsidot\", \"init_rpi\",\"init_ipi\";\n \n# Creating DDS for work variables and calculator routines\nall_work_tensors:=[ \n      [EMPH,0,dn], [DB,0,dn],\n         [met,2,dn], [DDL,2,dn],\n         [RR,2,dn], [U,2,dn] , [P,2,dn],\n         [C1,0,dn], [C5,0,dn], [DRPSI,0,dn], [DIPSI,0,dn]\n             ];\n\nfor ii from 1 to nops(all_work_tensors) do\n  nm:= all_work_tensors[ii][1]:\n  rank := all_work_tensors[ii][2]:\n  if rank <> 0 then\n     for jj from 1 to 2 do\n       cn := coord[jj];\n       # DDS for work variables\n       spec := [\n                     { i = [1,1,1] , b=xmin }     = eval_expr_tbl[nm][disorg][cn]    ,\n                     { i = [2,Nx-1,1] }  = eval_expr_tbl[nm][dis][cn]  ,\n                     { i = [Nx,Nx,1] , b=xmax }  = eval_expr_tbl[nm][disinf][cn]\n               ]; \n      # creating calculator routines fortran routines for work variables\n      A_Gen_Eval_Code(spec,input=\"d\",proc_name=LowerCase(cat(\"compute_\",nm,cn)));\n      Other_Headers := Other_Headers , LowerCase(cat(\"compute_\",nm,cn));\n     end do;     \n  else\n        spec := [\n                     { i = [1,1,1] , b=xmin }     = eval_expr_tbl[nm][disorg]    ,\n                     { i = [2,Nx-1,1] }  = eval_expr_tbl[nm][dis]  ,\n                     { i = [Nx,Nx,1] , b=xmax  }  = eval_expr_tbl[nm][disinf]\n               ]; \n      A_Gen_Eval_Code(spec,input=\"d\",proc_name=LowerCase(cat(\"compute_\",nm))); \n      Other_Headers := Other_Headers , LowerCase(cat(\"compute_\",nm));\n  end if;\nend do:\n\n# Treating conformal connection equation first:\n\nspec := [\n  { i = [1,1,1] , b=xmin } = myzero*x(i),\n  { i = [2,Nx-1,1] } = tt[DLAM][dis][x] ,\n  { i = [Nx,Nx,1] , b=xmax  } = myzero*x(i)\n];\n\nA_Gen_Eval_Code(spec, input=\"d\",proc_name=\"eval_dlam\");\n\n# Creating a table to hold the K/O dissipation at various points of discrete domain\ndis_tbl := table([]);\nfor ii from 1 to nops(evol_trm) do\n  nm := evol_trm[ii][1];\n  rank := evol_trm[ii][2];\n  if rank <> 0 then\n    for jj from 1 to 2 do\n       cn := coord[jj];\n       fn := dis_func_tbl[nm][cn];\n\n       dis_tbl[nm][mid][cn] := -AVGT(DISS(fn));\n       dis_tbl[nm][org][cn] := -AVGT(DISS(fn));\n       dis_tbl[nm][orgp1][cn] :=  -AVGT(DISS(fn));\n\n       # Using FD's even odd facility to built the correct version of FDA\n       # That can be used at the origin / infinity \n       t_mp_1:= A_FD_Even(dis_tbl[nm][org][cn],x,set_of_even_funcs,0,\"forward\");\n       dis_tbl[nm][org][cn]:= A_FD_Odd(t_mp_1,x,set_of_odd_funcs,0,\"forward\");\n\n       t_mp_1:= A_FD_Even(dis_tbl[nm][orgp1][cn],x,set_of_even_funcs,-1,\"forward\");\n       dis_tbl[nm][orgp1][cn]:= A_FD_Odd(t_mp_1,x,set_of_odd_funcs,-1,\"forward\");\n        \n    end do\n  else\n      fn := dis_func_tbl[nm];\n\n       dis_tbl[nm][mid] := -AVGT(DISS(fn));\n       dis_tbl[nm][org] := -AVGT(DISS(fn));\n       dis_tbl[nm][orgp1] :=  -AVGT(DISS(fn));\n\n       t_mp_1:= A_FD_Even(dis_tbl[nm][org],x,set_of_even_funcs,0,\"forward\");\n       dis_tbl[nm][org]:= A_FD_Odd(t_mp_1,x,set_of_odd_funcs,0,\"forward\");\n\n       t_mp_1:= A_FD_Even(dis_tbl[nm][orgp1],x,set_of_even_funcs,-1,\"forward\");\n       dis_tbl[nm][orgp1]:= A_FD_Odd(t_mp_1,x,set_of_odd_funcs,-1,\"forward\");\n\n  end if;\nend do:\n\n####### NOW EVOLUTION EQUATIONS ##########\n\nfor ii from 1 to nops(evol_trm) do \n  nm := evol_trm[ii][1]:\n  rank := evol_trm[ii][2]:\n  if rank <> 0 then\n    for jj from 1 to 2 do\n      cn := coord[jj];\n      fn := dis_func_tbl[nm][cn]:\n      # there are 5 conditions, origin, next to origin, middle, next to infinity and infinity \n      # here is the glory of FD! (Also we are adding the right dissipation expression)\n      spec := [ \n                 {i = [1,1,1] , b=xmin }    =  evol_eq_tbl[nm][disorg][cn],\n                 {i = [2,2,1] , b=xmin }    =  evol_eq_tbl[nm][disorgp1][cn] + dis_tbl[nm][orgp1][cn],\n                 {i = [3,Nx-2,1] } =  evol_eq_tbl[nm][dis][cn] + dis_tbl[nm][mid][cn],\n                 {i = [Nx-1,Nx-1,1] } =  evol_eq_tbl[nm][dis][cn],\n                 {i = [Nx,Nx,1] , b = xmax } =  evol_eq_tbl[nm][disinf][cn]\n              ];\n      if not( nm=DLAM and cn=theta) then\n         print(cat(\"Solve code for:\",nm,cn,\" Generated.\"));\n         A_Gen_Solve_Code(spec,{solve_for_tbl[nm][cn] },input=\"d\",proc_name=LowerCase(cat(\"evolve_\",nm,cn)));\n         Other_Headers := Other_Headers , cat(\"evolve_\",nm,cn);\n         A_Gen_Res_Code(spec,input=\"d\",proc_name=LowerCase(cat(\"resid_\",nm,cn)));\n         Other_Headers := Other_Headers , cat(\"resid_\",nm,cn);\n         print(cat(\"Res code for:\",nm,cn,\" Generated.\"));\n      end if;\n    end do;\n  else\n      fn := dis_func_tbl[nm];\n      spec := [ \n                 {i = [1,1,1] , b=xmin }    =  evol_eq_tbl[nm][disorg],\n                 {i = [2,2,1] , b=xmin }    =  evol_eq_tbl[nm][disorgp1] + dis_tbl[nm][orgp1],\n                 {i = [3,Nx-2,1] } =  evol_eq_tbl[nm][dis] + dis_tbl[nm][mid],\n                 {i = [Nx-1,Nx-1,1] } =  evol_eq_tbl[nm][dis],\n                 {i = [Nx,Nx,1] , b=xmax  } =  evol_eq_tbl[nm][disinf]\n\n              ];\n    A_Gen_Solve_Code(spec,{solve_for_tbl[nm]},proc_name=LowerCase(cat(\"evolve_\",nm)));\n    Other_Headers := Other_Headers , cat(\"evolve_\",nm);\n    print(cat(\"Solve code for:\",nm,\" Generated.\"));\n    A_Gen_Res_Code(spec,input=\"d\",proc_name=LowerCase(cat(\"resid_\",nm)));\n    Other_Headers := Other_Headers , cat(\"resid_\",nm);\n    print(cat(\"Res code for:\",nm,\" Generated.\"));\n  end if;\nend do:\n\n#Generating driver header:\npl:=table([ t=[-1,-1],x=[-1,-1],y=[-1,-1],z=[-1,-1] ]):\nUpdate_FD_Table(2,pl):\n\n#############################################################\n# This is where I use the Other_Headers in FD\n# GDC is an experimental feature, it generates a tempalte\n# for a main C driver routine.\n# It uses all_expr variable to learn all necessary definition\n# for a solver routine, enable it and see what it generates\n#############################################################\n\n#GDC(all_expr+myzero,input=\"c\",output=\"main\",other_headers={Other_Headers});\n\n\n# Creating IRE for BSSN equations (notice how quick this is!)\n\nprintf(\"Generating IREs...\\n\");\npl:=table([ t=[-1,-1],x=[-1,-1],y=[-1,-1],z=[-1,-1] ]):\nUpdate_FD_Table(2,pl):\ninterface(warnlevel = 0):\n\nfor ii from 1 to nops(evol_trm) do\n  nm := evol_trm[ii][1];\n  rank := evol_trm[ii][2];\n  if rank <> 0 then\n    for jj from 1 to 2 do\n       cn := coord[jj];\n       all_expr:=all_expr + ( evol_eq_LHS_tbl[nm][jj] -  tt[nm][all][cn] );\n       sten := Gen_Sten( evol_eq_LHS_tbl[nm][jj] -  tt[nm][all][cn]);\n       if (sten <> 0 ) then\n         Gen_Res_Code(sten,input=\"d\",proc_name=LowerCase(cat(\"ire_\",nm,cn)));\n         Gen_Eval_Code(sten,input=\"d\",proc_name=LowerCase(cat(\"irev_\",nm,cn)));\n         Other_Headers := Other_Headers , cat(\"ire_\",nm,cn);\n       end if;\n    end do\n  else\n       all_expr:=all_expr + ( evol_eq_LHS_tbl[nm] -  tt[nm][all] );\n       sten := Gen_Sten( evol_eq_LHS_tbl[nm] -  tt[nm][all]);\n       if (sten <> 0) then\n         Gen_Res_Code(sten,input=\"d\",proc_name=LowerCase(cat(\"ire_\",nm)));\n         Gen_Eval_Code(sten,input=\"d\",proc_name=LowerCase(cat(\"irev_\",nm)));\n         Other_Headers := Other_Headers , cat(\"ire_\",nm);\n       end if;\n  end if;\nend do:\n\n\n\n", "meta": {"hexsha": "a80c1d0dde9cf4fa23e5d86c1d89c635190ca801", "size": 27567, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "perform_fd.mpl", "max_stars_repo_name": "rmanak/bssn_spher", "max_stars_repo_head_hexsha": "b91104fd6b9b7cf1ba08e35efd65ff219ab7a5a9", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "perform_fd.mpl", "max_issues_repo_name": "rmanak/bssn_spher", "max_issues_repo_head_hexsha": "b91104fd6b9b7cf1ba08e35efd65ff219ab7a5a9", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "perform_fd.mpl", "max_forks_repo_name": "rmanak/bssn_spher", "max_forks_repo_head_hexsha": "b91104fd6b9b7cf1ba08e35efd65ff219ab7a5a9", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 34.6754716981, "max_line_length": 129, "alphanum_fraction": 0.5834875032, "num_tokens": 9403, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8757869819218865, "lm_q2_score": 0.7371581684030623, "lm_q1q2_score": 0.6455935275047837}}
{"text": "# 求解的成立条件\n\n$ifndef _CONDITION_\n$define _CONDITION_\n\n$include \"Utils.mpl\"\n\n(*\n* 求 解的 定义域\n* 返回的条件中求解了单变量约束\n* 如果无解则返回 x=undefined 的约束用作标记\n* 保留了多变量约束\n*)\nfindSolutionDomain:=proc(s)\n    local con;\n    con:=`union`(findDomain~(rhs~({s[]}))[]);\n    return remove(x->type(x,`=`) and (lhs(x)=rhs(x)),classifySolve(con)) \n        union select(x->type(rhs(x),numeric),{s[]});\nend proc:\n\n(*\n* 求解表达式的定义域\n* 只考虑 + * ^ ln\n*)\nfindDomain:=proc(ee)\n    local S,r;\n    S:={};\n    findDomainCondtions(ee,S);\n    return S;\nend proc:\n\n(*\n* 求解表达式的定义域约束条件\n* 只考虑 + * ^ ln\n*)\nfindDomainCondtions:=proc(e,S::evaln(set))\n    local _e;\n    if type(e,`^`) and (not type(op(1,e),numeric)) then\n        if (op(2,e)<0) then\n            if type(op(2,e),fraction) and type(denom(op(2,e)),even) then\n                S:=eval(S) union {op(1,e)>0};\n            else\n                S:=eval(S) union {op(1,e)<>0};\n            end if;\n        else\n            if type(op(2,e),fraction) and type(denom(op(2,e)),even) then\n                S:=eval(S) union {op(1,e)>=0};\n            end if;\n        end if;\n    elif type(e,`+`) or type(e,`*`) then\n        for _e in e do\n            findDomainCondtions(_e,S);\n        end do;\n    elif (op(0,e)='ln') and (not type(op(1,e),numeric)) then\n        S:=eval(S) union {op(e)>0};\n    end if;\nend proc:\n\n# 不等式约束分类求解\n# 合并单变量约束\n# 保留多变量约束\nclassifySolve:=proc(con::set)\n    local t,sd,ns,c,ind,x,sol;\n    t:=table();\n    ns,sd:=selectremove(x->(numelems(indets(x,name))=1),con);\n    for c in ns do\n        tappend(t,indets(c,name)[],c);\n    end do;\n    ind:=[indices(t,nolist)];\n    for x in ind do\n        sol:=RealDomain:-solve(t[x],{x});\n        if (sol=NULL) then\n            t[x]:={x=undefined};\n        else\n            t[x]:=sol;\n        end if;\n    end do;\n    ns:=`union`(entries(t,nolist));\n    return sd union ns;\nend proc:\n\n$endif", "meta": {"hexsha": "ee0e9e4c93036a52d1c757b719b800378ae130e6", "size": 1835, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "InvClassify/Condition.mpl", "max_stars_repo_name": "yu961549745/InvariantClassify", "max_stars_repo_head_hexsha": "eeb14ca2b39679e5a2da0f23888681ec7e2edd84", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "InvClassify/Condition.mpl", "max_issues_repo_name": "yu961549745/InvariantClassify", "max_issues_repo_head_hexsha": "eeb14ca2b39679e5a2da0f23888681ec7e2edd84", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "InvClassify/Condition.mpl", "max_forks_repo_name": "yu961549745/InvariantClassify", "max_forks_repo_head_hexsha": "eeb14ca2b39679e5a2da0f23888681ec7e2edd84", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 22.3780487805, "max_line_length": 73, "alphanum_fraction": 0.531880109, "num_tokens": 684, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8615382094310357, "lm_q2_score": 0.7490872075132153, "lm_q1q2_score": 0.6453672514686302}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\n(* prefix:\n  mgga_x_br89_params *params;\n\n  assert(p->params != NULL);\n  params = (mgga_x_br89_params * ) (p->params);\n*)\n\n(* replace: \"br89_x\\(\" -> \"xc_mgga_x_br89_get_x(\" *)\n\n(* This is the derivative of f = x*exp(-2.0/3.0*x)/(x - 2) = y = 2*Pi^(2/3)/(3*Q) *)\nbr89_aux_dfdx := x -> -2/3 * exp(-2*x/3) * (x^2 - 2*x + 3) / (x - 2)^2:\n\n`diff/br89_x` := proc(Q, g)\n  -2/3 * Pi^(2/3) * diff(Q, g)/(Q^2 * br89_aux_dfdx(br89_x(Q)))\nend proc:\n\nbr89_Q := (x, u, t) ->\n  (u - 4*params_a_gamma*t + params_a_gamma*x^2/2)/6:\n\nbr89_min_Q := 5.0e-13:\nbr89_cQ := Q -> my_piecewise3(abs(Q) < br89_min_Q,\n  my_piecewise3(Q > 0, br89_min_Q, -br89_min_Q), Q):\n\nbr89_v := x ->\n  -2*Pi^(1/3)/X_FACTOR_C * exp(x/3)*(1 - exp(-x)*(1 + x/2))/x:\n\nbr89_mx := Q -> br89_x(Q):\n\nbr89_f := (x, u, t) ->\n  - br89_v(br89_mx(br89_cQ(br89_Q(x, u, t))))/2 *\n  (1 + params_a_at*mgga_series_w([0, 1, 0, -2, 0, 1], 6, t)):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) ->\n  mgga_exchange(br89_f, rs, z, xs0, xs1, u0, u1, t0, t1):\n", "meta": {"hexsha": "d45546cb67c015b8d9702195313c49dd6e9940e1", "size": 1251, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_br89.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_br89.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_br89.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.8, "max_line_length": 84, "alphanum_fraction": 0.5827338129, "num_tokens": 543, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9059898279984214, "lm_q2_score": 0.7122321903471563, "lm_q1q2_score": 0.6452751196275591}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_mgga_x *)\n\na := 2.413:\nb := 0.348:\n\nparams_a_b      := 0.40:\nparams_a_c      := 1.59096:\nparams_a_e      := 1.537:\nparams_a_mu     := 0.21951:\n\nalpha           := (x, t) -> (t - x^2/8)/K_FACTOR_C:\n\n(* Equation (8) *)\n\nmkappa := (x, t) -> 2*Pi/(3*sqrt(5)) * \\\n          sqrt(alpha(x, t) + 1)/sqrt(a + log(alpha(x, t) + b)):\nff     := 2:\n\n$include \"tpss_x.mpl\"\n\na1  := (x, t) -> mkappa(x, t)/(mkappa(x, t) + fx(x, t)):\nf   := (rs, x, t, u) -> 1 + mkappa(x, t)*(1 - a1(x, t)):\n\n", "meta": {"hexsha": "b1bcbf2c699e8f6afed624b8304852933d13acbf", "size": 728, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/mgga_x_sa_tpss.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/mgga_x_sa_tpss.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/mgga_x_sa_tpss.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 22.75, "max_line_length": 68, "alphanum_fraction": 0.5384615385, "num_tokens": 281, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9184802417938535, "lm_q2_score": 0.7025300636233416, "lm_q1q2_score": 0.645259982704218}}
{"text": "`is_element/hasse_diagrams` := (A::set) -> proc(G)\n global reason;\n local D,R;\n \n if not(`is_element/autorel`(A)(G)) then\n  reason := [\"is_element/hasse_diagrams\",\"G is not a relation on A\",G,reason];\n  return false;\n fi;\n\n if not(`is_antisymmetric/autorel`(A)(G)) then\n  reason := [\"is_element/hasse_diagrams\",\"G is not antisymmetric\",G];\n  return false;\n fi;\n\n D := `id/autorel`(A);\n R := `o/autorel`(A)(G,G);\n \n while R <> {} do\n  if R intersect G <> {} then\n   reason := [\"is_element/hasse_diagrams\",\"G has an arrow parallel to a longer path\",G,R intersect G];\n   return false;\n  fi;\n\n  if R intersect D <> {} then\n   reason := [\"is_element/hasse_diagrams\",\"G has a loop\",G,R intersect D];\n   return false;\n  fi;\n\n  R := `o/autorel`(A)(R,G);\n od;\n \n return true;\nend:\n\n`is_element/ranked_hasse_diagrams` := (A::set) -> proc(Gr)\n local G,r,AA,rA,d,A1,r1,a,b,AA1,G1,M1,M2,Aa,A0,Ma,rMa,i;\n global reason;\n\n if not(type(Gr,list) and nops(Gr) = 2) then\n  reason := [convert(procname,string),\"Gr is not a list of length two\",Gr];\n  return false;\n fi;\n\n G,r := op(Gr);\n \n AA := {seq(seq([a,b],b in A),a in A)} minus {seq([a,a],a in A)};\n\n if not(type(G,set) and G minus AA = {}) then\n  reason := [convert(procname,string),\"G is not a subset of A^2 minus Delta\",G,A];\n  return false;\n fi;\n \n if not(type(r,table) and [indices(r)] = map(a -> [a],[op(A)])) then\n  reason := [convert(procname,string),\"r is not a table indexed by A\",r,A];\n  return false;\n fi;\n\n if A = {} then return true; fi;\n\n rA := map(a -> r[a],A);\n if not(type(rA,list(integer)) and min(op(rA)) = 0) then\n  reason := [convert(procname,string),\"The values of r are not integers starting from 0\",r,A];\n  return false;\n fi;\n\n d := max(rA);\n if rA <> {seq(i,i=0..d)} then\n  reason := [convert(procname,string),\"The values of r do not form an interval starting from 0\",r,A];\n  return false;\n fi;\n\n if d = 0 then\n  if G = {} then\n   return true;\n  else\n   reason := [convert(procname,string),\"All ranks are zero but G is not empty\",G];\n   return false;\n  fi;\n fi;\n\n A1 := select(a -> (r[a] < d),A);\n r1 := table();\n for a in A1 do r1[a] := r[a]; od;\n AA1 := {seq(seq([a,b],b in A1),a in A1)} minus {seq([a,a],a in A1)};\n G1 := G intersect AA1;\n\n if not(`is_element/ranked_hasse_diagrams`(A1)([G1,r1])) then\n  return false;\n fi;\n\n M1 := NULL;\n for a in A1 do\n  Aa := select(b -> member([a,b],G1),A1);\n  if Aa = {} then M1 := M1,a; fi;\n od:\n M1 := {M1};\n M2 := select(a -> (r[a] = d-1),M1);\n\n A0 := A minus A1;\n\n for a in A0 do\n  Ma := select(b -> member([b,a],G),A);\n  rMa := map(b -> r[b],Ma);\n  if not(member(d-1,rMa)) then\n   reason := [convert(procname,string),\"a has rank d but does not cover anything of rank d-1\",a,d,Ma];\n   return false;\n  fi;\n od:\nend:\n", "meta": {"hexsha": "8363684bce6219139843c110403146e65b4197f5", "size": 2720, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/hasse_diagrams.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/hasse_diagrams.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/hasse_diagrams.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 24.7272727273, "max_line_length": 102, "alphanum_fraction": 0.6036764706, "num_tokens": 936, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8479677583778258, "lm_q2_score": 0.7606506526772883, "lm_q1q2_score": 0.6450072288593902}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: lda_vxc *)\n\ntih_par := [\n  -1.0953, -0.0334789, 0.414661, -0.152399, -0.354691,\n  0.0390837, -0.0748531, -0.136598, -1.41063, 0.00496577,\n  0.48315, 4.02905, -0.420166, 0.0104352, -1.47409,\n  -0.442455, 0.625039, 1.30351, 1.37026, -1.29598,\n  -1.04305, -0.909651, -0.991782, -0.915745, 1.95026\n]:\n\ntih_zj := (j, n) -> tanh(tih_par[2*j-1] + tih_par[2*j]*n):\n\ntih_vxc := n ->\n  tih_par[17] + add(tih_par[i]*tih_zj(i-17, n), i=18..25):\n\nf  := (rs, z) ->\n  tih_vxc(n_total(rs)):\n", "meta": {"hexsha": "155999a42f4166aee2c50da7c44175efe9ce2e3d", "size": 723, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/lda_vxc/lda_xc_tih.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/lda_vxc/lda_xc_tih.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/lda_vxc/lda_xc_tih.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.8076923077, "max_line_length": 68, "alphanum_fraction": 0.6251728907, "num_tokens": 329, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8887588023318196, "lm_q2_score": 0.7248702880639791, "lm_q1q2_score": 0.6442348490656632}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\n$define mgga_x_revtpss_params\n$include \"mgga_x_tpss.mpl\"\n\nreg_c := 3:\nreg_d := 1.475:\n\nreg_f_a :=  a -> (1 - a)^3/(1 + (reg_d*a)^2)^(3/2):\n\n(* Eq. (12). Note that alpha = 0 => t = x^2/8 *)\nreg_f := (x, u, t) ->\n  tpss_f(x, u, t) + reg_f_a(tpss_alpha(x, t))*exp(-reg_c*X2S^2*x^2)*(tpss_f(x, u, x^2/8) - tpss_f(x, u, t)):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) ->\n  mgga_exchange(reg_f, rs, z, xs0, xs1, u0, u1, t0, t1):\n", "meta": {"hexsha": "62484d7ad28f0844f79ca4a91de6bf89ded57e33", "size": 685, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_regtpss.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_regtpss.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_regtpss.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.4, "max_line_length": 108, "alphanum_fraction": 0.601459854, "num_tokens": 286, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.934395157060208, "lm_q2_score": 0.6893056040203135, "lm_q1q2_score": 0.6440838181310424}}
{"text": "# This file is about Zagier's proof that every prime congruent to 1 mod 4\n# is the sum of two squares.\n\n# The following matrices generate a dihedral group of order 12 that\n# acts on Z ^ 3 preserving the quadratic form Q\n\nS := <<-1| 2| 0>,< 0| 1| 0>,< 1|-1| 1>>;\nR := << 1| 0| 2>,< 0| 0| 1>,<-1| 1|-1>>;\n\nQ := << 1| 0| 0>,< 0| 0| 2>,< 0| 2| 0>>;\nI3 := IdentityMatrix(3);\n\nG := [seq(seq(R ^ i . S ^ j, i = 0..5),j = 0..1)];\n\n_ASSERT(\"Dihedral relations\",\n  Equal(S . S, I3) and Equal(R . R . R, -I3) and Equal(S . R . S, 1/R));\n\n_ASSERT(\"Quadratic form relations\",\n  Equal(Transpose(S) . Q . S, Q) and Equal(Transpose(R) . Q . R, Q));\n\n# The following map F gives an involution on the set X\n\nF := proc(x)\n  if (R . x)[3] > 0 then\n    return R . x;\n  elif ((1/R) . x)[1] > 0 then\n    return (1/R) . x;\n  else\n    return S . x;\n  fi;\nend:\n\np := ithprime(10);\n\nX := select(u -> type(u[3],posint),\n  {seq(seq(<i,j,(p - i ^ 2)/(4 * j)>,j=1..p-1),i=1..p-1)}):\n\n_ASSERT(\"F preserves X\",\n  evalb(map(convert,map(F,X),list) = map(convert,X,list)));\n\n_ASSERT(\"F is an involution on X\",\n  `and`(seq(Equal(F(F(x)),x),x in X)));\n\n_ASSERT(\"F has a unique fixed point on X\",\n  evalb(map(convert,select(x -> Equal(F(x),x),X),list) = {[1,1,(p - 1)/4]}));\n\nfix := (T) -> subs(solve(convert(T . <x,y,z> - <x,y,z>,list),{x,y,z}),[x,y,z]);\n\n", "meta": {"hexsha": "8c716996c5a2aa1188228cbb414917522c1e7bba", "size": 1318, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/two_squares.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/two_squares.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/two_squares.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 26.8979591837, "max_line_length": 79, "alphanum_fraction": 0.5493171472, "num_tokens": 522, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8962513814471132, "lm_q2_score": 0.7185943925708561, "lm_q1q2_score": 0.644041217041779}}
{"text": "######################################################################\n\n`is_element/ord_simplex_interior` := (A::set) -> proc(Rx)\n local R,x;\n global reason;\n\n if not(type(Rx,list) and nops(Rx) = 2) then \n  reason := [convert(procname,string),\"Rx cannot be split as [R,x]\",Rx];  \n  return false;\n fi;\n\n R,x := op(Rx);\n\n if not(`is_element/ord`(A)(R)) then\n  reason := [convert(procname,string),\"R is not an order on A\",R,A,reason];\n  return false;\n fi;\n\n if not(`is_element/simplex_interior`(A)(x)) then\n  reason := [convert(procname,string),\"x is not in the interior of the A-simplex\",x,A,reason];\n  return false;\n fi;\n\n return true;\nend;\n\n`is_equal/ord_simplex_interior` := (A::set) -> proc(Rx,Sy)\n global reason;\n\n if not `is_equal/ord`(A)(Rx[1],Sy[1]) then\n  reason := [convert(procname,string),\"R <> S\",Rx[1],Sy[1],reason];\n  return false;\n fi;\n\n if not `is_equal/simplex`(A)(Rx[2],Sy[2]) then\n  reason := [convert(procname,string),\"x <> y\",Rx[2],Sy[2],reason];\n  return false;\n fi;\n\n return true;\nend;\n\n`is_leq/ord_simplex_interior` := NULL;\n\n`random_element/ord_simplex_interior` := (A::set) -> proc(d::posint := 5)\n [`random_element/ord`(A)(),\n  `random_element/simplex_interior`(A)(d)];\nend;\n\n`list_elements/ord_simplex_interior` := NULL;\n`count_elements/ord_simplex_interior` := NULL;\n\n`phi/ord_simplex_interior/one_cubes_prime` := (A::set) -> proc(Rx)\n local R,x,y,n,i,j,p,q;\n\n R,x := op(Rx);\n y := table();\n n := nops(R);\n\n for i from 1 to n do\n  p := add(x[R[j]],j=1..i-1);\n  q := p + x[R[i]];\n  y[R[i]] := [[p],[q]];\n od;\n\n return [R,eval(y)];\nend;\n\n", "meta": {"hexsha": "54cdb54108f305ee270cd30599499bed166ed20c", "size": 1564, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/ord_simplex_interior.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/ord_simplex_interior.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/ord_simplex_interior.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 22.6666666667, "max_line_length": 94, "alphanum_fraction": 0.6029411765, "num_tokens": 506, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8397339756938818, "lm_q2_score": 0.7662936377487304, "lm_q1q2_score": 0.6434828029756686}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_x_pw91_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_x_pw91_params * )(p->params);\n*)\n\n$ifdef gga_x_pw91_params\nparams_a_a     :=   0.19645:\nparams_a_b     :=   7.7956:\nparams_a_c     :=   0.2743:\nparams_a_d     :=  -0.1508:\nparams_a_f     :=   0.004:\nparams_a_alpha := 100:\nparams_a_expo  :=   4:\n$endif\n\npw91_num := s -> (params_a_c + params_a_d*exp(-params_a_alpha*s^2))*s^2\n         - params_a_f*s^params_a_expo:\npw91_den := s -> 1 + s*params_a_a*arcsinh(params_a_b*s) + params_a_f*s^params_a_expo:\n\npw91_f  := x -> 1 + pw91_num(X2S*x)/pw91_den(X2S*x):\n\nf := (rs, z, xt, xs0, xs1) -> gga_exchange(pw91_f, rs, z, xs0, xs1):\n", "meta": {"hexsha": "54982c01121b0d34aa3b5c70a897a581ebf8df9f", "size": 919, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_pw91.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_pw91.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_pw91.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.0294117647, "max_line_length": 85, "alphanum_fraction": 0.6496191513, "num_tokens": 336, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9073122288794594, "lm_q2_score": 0.7090191399336402, "lm_q1q2_score": 0.6433017361713884}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\n(* Equations are from the Appendix of Kurth1999_889 *)\n\n$include \"gga_c_gapc.mpl\"\n\ngap_par0[10] = 0.06483*((9*Pi)/4)^(2/3): (* this is approximately equal to 0.23878 *)\n\n(* Eq. (A4) *)\nkcis_G := (rs, xt) -> xt^2*n_total(rs)^(2/3)/8:\n\n(* Eq. (A9) *)\nkcis_t := (rs, xt) -> 2^(2/3)*xt/(8*sqrt(rs)):\n\nkcis_beta := 0.066725:\n\n(* Eq. (A7) *)\nkcis_gga0 := (rs, xt) -> f_pw(rs, 0)/(1 + kcis_beta*log(1 + kcis_t(rs, xt)^2/m_abs(f_pw(rs, 0)))):\n\n(* Eq. (A8) *)\nkcis_gga1 := (rs, xt) -> f_pw(rs, 1)/(1 + kcis_beta*log(1 + 2^(-1/3)*kcis_t(rs, xt)^2/m_abs(f_pw(rs, 1)))):\n\n(* Eq. (A5) *)\n(* The polarized parameters are the same as the unpolarized ones *)\n(* except that c_1, c_2, c_3 are multiplied by 0.7. 1.5, and 2.59 respectively *)\nkcis_eps_0 := (rs, xt) ->\n  + (kcis_gga0(rs, xt) + gap_c1(rs, 0, gap_par0)*kcis_G(rs, xt))\n  / (1 + gap_c2(rs, 0, gap_par0)*kcis_G(rs, xt) + gap_c3(rs, 0, gap_par0)*kcis_G(rs, xt)^2):\n\n(* Eq. (A6) *)\nkcis_eps_1 := (rs, xt) ->\n  + (kcis_gga1(rs, xt) + 0.7*gap_c1(rs, 0, gap_par0)*kcis_G(rs, xt))\n  / (1 + 1.5*gap_c2(rs, 0, gap_par0)*kcis_G(rs, xt) + 2.59*gap_c3(rs, 0, gap_par0)*kcis_G(rs, xt)^2):\n\n(* Eq. (A2) *)\ngap_f := (rs, z, xt) ->\n  + kcis_eps_0(rs, xt)\n  + f_zeta(z)*(kcis_eps_1(rs, xt) - kcis_eps_0(rs, xt)):\n\n(* Eq. (A1) *)\nkcis_f := (rs, z, xt, xs0, xs1, ts0, ts1) ->\n  + gap_f(rs, z, xt)\n  - xs0^2/(8*ts0) * opz_pow_n( z,1)/2 * gap_f(rs*(2/(1 + z))^(1/3),  1, xs0)\n  - xs1^2/(8*ts1) * opz_pow_n(-z,1)/2 * gap_f(rs*(2/(1 - z))^(1/3), -1, xs1):\n\nf  := (rs, z, xt, xs0, xs1, us0, us1, ts0, ts1) ->\n  kcis_f(rs, z, xt, xs0, xs1, ts0, ts1):\n", "meta": {"hexsha": "0aa6fa173383f429e37d61982b5573f55ee4c647", "size": 1833, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_c_kcis.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_c_kcis.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_c_kcis.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 32.7321428571, "max_line_length": 107, "alphanum_fraction": 0.5755591926, "num_tokens": 830, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9284088005554475, "lm_q2_score": 0.6926419831347361, "lm_q1q2_score": 0.6430549127764669}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\npkzb_a2 := 146/2025:\npkzb_a3 := -73/405:\npkzb_a4 := 0.131957187845257783631757384393: (* DD + 100/(81*81*kappa) *)\n\npkzb_kappa := 0.804:\n\npkzb_xx := (p, qt) -> MU_GE*p + pkzb_a2*qt*qt + pkzb_a3*qt*p + pkzb_a4*p*p:\n\npkzb_f := (x, u, t) -> 1 + pkzb_kappa - \\\n  pkzb_kappa^2/(pkzb_kappa + pkzb_xx(X2S^2*x^2, 6*X2S^2*t - 9/20 - X2S^2*x^2/12)):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) -> mgga_exchange(pkzb_f, rs, z, xs0, xs1, u0, u1, t0, t1):", "meta": {"hexsha": "f83e2eac7c32b771543acabd43a29734d8d90b20", "size": 703, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_pkzb.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_pkzb.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_pkzb.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 31.9545454545, "max_line_length": 101, "alphanum_fraction": 0.6344238976, "num_tokens": 306, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9465966702001758, "lm_q2_score": 0.6791786926816161, "lm_q1q2_score": 0.6429082889633263}}
{"text": "`is_element/real_functions` := (A::set) -> proc(x)\n local a;\n global reason;\n\n if not(is_table_on(A)(x)) then\n  reason := [convert(procname,string),\"x is not a table on A\",x,A];\n  return false;  \n fi;\n\n for a in A do\n  if not `is_element/RR`(x[a]) then\n   reason := [convert(procname,string),\"x[a] is not in R\",a,x[a]];\n   return false;\n  fi;\n od;\n\n return true;\nend;\n\n######################################################################\n\n`is_equal/real_functions` := (A::set) -> proc(x,y) \n local a;\n global reason;\n\n for a in A do\n  if not(`is_equal/RR`(x[a],y[a])) then\n   reason := [convert(procname,string),\"x[a] <> y[a]\",a,x,y];\n   return false;\n  fi;\n od;\n\n return true;\nend;\n\n######################################################################\n\n`random_element/real_functions` := (A::set) -> proc()\n local x,a;\n\n x := table();\n for a in A do\n  x[a] := `random_element/RR`();\n od:\n\n return eval(x);\nend;\n\n######################################################################\n\n`list_elements/real_functions` := NULL;\n`count_elements/real_functions` := NULL;\n\n######################################################################\n\n`is_nonnegative/real_functions` := (A::set) -> proc(x) \n local a;\n\n for a in A do\n  if is(x[a] < 0) then\n   return false;\n  fi;\n od;\n\n return true;\nend:\n\n######################################################################\n\n`is_leq/real_functions` := (A::set) -> proc(x,y)\n local a;\n\n for a in A do\n  if is(x[a] > y[a]) then\n   return false;\n  fi;\n od;\n\n return true;\nend:\n\n######################################################################\n\n`norm/real_functions` := (A::set) -> proc(x)\n local a,n;\n\n n := 0;\n for a in A do n := n + x[a]^2; od;\n \n return sqrt(n);\nend:\n\n######################################################################\n\n`sum/real_functions` := (A::set) -> proc(x)\n local a,u;\n\n u := 0;\n for a in A do u := u + x[a]; od;\n \n return u;\nend:\n\n######################################################################\n\n`max/real_functions` := (A::set) -> proc(x)\n local a,u;\n\n u := -infinity;\n for a in A do u := max(u,x[a]); od;\n \n return u;\nend:\n\n######################################################################\n\n`min/real_functions` := (A::set) -> proc(x)\n local a,u;\n\n u := infinity;\n for a in A do u := min(u,x[a]); od;\n \n return u;\nend:\n\n######################################################################\n\n`dist/real_functions` := (A::set) -> proc(x,y)\n local a,n;\n\n n := 0;\n for a in A do n := n + (x[a]-y[a])^2; od;\n \n return sqrt(n);\nend:\n\n######################################################################\n\n`dot/real_functions` := (A::set) -> proc(x,y)\n local a,d;\n\n d := 0;\n for a in A do d := d + x[a]*y[a]; od;\n \n return d;\nend:\n\n######################################################################\n\n`width/real_functions` := (A::set) -> proc(x)\n local V;\n V := map(a -> x[a],A);\n return max(op(V)) - min(op(V));\nend:\n\n######################################################################\n\n`gap/real_functions` := (A::set) -> proc(x)\n local V,n,i;\n V := sort([op(map(a -> x[a],A))]);\n n := nops(V);\n return max(0,seq(V[i+1]-V[i],i=1..n-1));\nend:\n\n######################################################################\n\n`relative_gap/real_functions` := (A::set) -> proc(x)\n return `gap/real_functions`(A)(x)/`width/real_functions`(A)(x);\nend:\n", "meta": {"hexsha": "18b7fb5e5997604b1b3b08cda7efc9427cf49c79", "size": 3335, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/real_functions.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/real_functions.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/real_functions.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 19.6176470588, "max_line_length": 70, "alphanum_fraction": 0.3985007496, "num_tokens": 849, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8902942319436397, "lm_q2_score": 0.7217432062975979, "lm_q1q2_score": 0.6425638135112598}}
{"text": "input := StringTools:-Trim(FileTools:-Text:-ReadFile(\"AoC-2021-15-input.txt\"));\ngrid := Matrix(map(s->parse~(StringTools:-Explode(s)),StringTools:-Split(input,\"\\n\"))):\n(gridw,gridl) := upperbound(grid);\n\ninc := a -> (a mod 9) +~ 1;\ngb:= Matrix([seq([seq((inc@@(i+j-2))(grid),j=1..5)],i=1..5)] );\n(gbw,gbl) := upperbound(gb);\n\nnbs := proc(i,j,gridsize)\nlocal out := NULL;\n    if i < gridsize then out := out, [i+1, j]; end if;\n    if j < gridsize then out := out, [i, j+1]; end if;\n    if i > 1 then out := out, [i-1,j]; end if;\n    if j > 1 then out := out, [i, j-1]; end if;\n    return [out];\nend proc:\n\nwith(GraphTheory):\nG := MakeWeighted(MakeDirected(SpecialGraphs:-GridGraph(gridl,gridw)));\n\nfor e in Edges(G) do\n    SetEdgeWeight(G, e, grid[parse(e[2])]);\nend do:\n\nDijkstrasAlgorithm(G, \"1,1\", cat(\"\",gridl,\",\",gridw))[2];\nBG := MakeWeighted(MakeDirected(SpecialGraphs:-GridGraph(gbl,gbw)));\n\nW := WeightMatrix(BG, copy=false);\n\nfor i from 1 to gbl do for j from 1 to gbw do\n       a := j + (i-1)*(gbw);\n       for n in nbs(i,j,gbw) do\n           b := n[2] + (n[1]-1)*gbw; W[b,a] := gb[i,j];\n       end do;\nend do; end do:\n\nanswer2 := DijkstrasAlgorithm(BG, \"1,1\", cat(\"\",gbl,\",\",gbw))[2];\n\n", "meta": {"hexsha": "1978228cec3817b67bb0968a7697988eb10b55a7", "size": 1197, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "Day15/AoC15-Maple-GraphTheory.mpl", "max_stars_repo_name": "johnpmay/AdventOfCode2021", "max_stars_repo_head_hexsha": "b51756bcebea662333072cf518cf040a962ef8b7", "max_stars_repo_licenses": ["CC0-1.0"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2021-12-04T18:24:03.000Z", "max_stars_repo_stars_event_max_datetime": "2021-12-04T18:24:03.000Z", "max_issues_repo_path": "Day15/AoC15-Maple-GraphTheory.mpl", "max_issues_repo_name": "johnpmay/AdventOfCode2021", "max_issues_repo_head_hexsha": "b51756bcebea662333072cf518cf040a962ef8b7", "max_issues_repo_licenses": ["CC0-1.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Day15/AoC15-Maple-GraphTheory.mpl", "max_forks_repo_name": "johnpmay/AdventOfCode2021", "max_forks_repo_head_hexsha": "b51756bcebea662333072cf518cf040a962ef8b7", "max_forks_repo_licenses": ["CC0-1.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 30.6923076923, "max_line_length": 87, "alphanum_fraction": 0.5864661654, "num_tokens": 438, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8856314738181875, "lm_q2_score": 0.7248702880639791, "lm_q1q2_score": 0.6419679415451159}}
{"text": "make_upper_unitriangular := proc(n,p)\n  local G,i,j,k,m,g,L,f;\n  \n  m := n * (n - 1) / 2;\n  \n  G := table():\n  G[\"p\"] := p;\n  G[\"id\"] := IdentityMatrix(n);\n  G[\"o\"] := (g,h) -> map(mods,g . h,G[\"p\"]);\n  G[\"inv\"] := g -> map(mods,1/g,G[\"p\"]);\n  G[\"order\"] := p ^ m;\n  \n  G[\"elementary\"] := table():\n  for i from 1 to n do\n   for j from i+1 to n do\n    g := Matrix(n,n);\n    for k from 1 to n do g[k,k] := 1; od:\n    g[i,j] := 1;\n    G[\"elementary\"][i,j] := g;\n   od:\n  od:\n\n  L := [[]];\n  for i from 1 to m do\n   L := [seq(seq([op(u),j],j=0..p-1),u in L)];\n  od:\n\n  f := proc(u)\n   local i,j,k,g;\n   g := Matrix(n,n);\n   for k from 1 to n do g[k,k] := 1; od:\n   k := 1;\n   for i from 1 to n do\n    for j from i+1 to n do\n     g[i,j] := mods(u[k],p); k := k + 1;\n    od:\n   od:\n   return g;\n  end:\n  \n  G[\"elements\"] := map(f,L);\n\n  return eval(G);\nend:", "meta": {"hexsha": "9f20ffa70fe140d7e5307f3db62cc70cc515c20e", "size": 851, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/groups/upper_unitriangular.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/groups/upper_unitriangular.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/groups/upper_unitriangular.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 19.3409090909, "max_line_length": 46, "alphanum_fraction": 0.4418331375, "num_tokens": 352, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9219218262741298, "lm_q2_score": 0.6959583250334526, "lm_q1q2_score": 0.641619170025525}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n Copyright (C) 2018 Susi Lehtola\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n(* prefix:\n  mgga_x_msb_params *params;\n\n  assert(p->params != NULL);\n  params = (mgga_x_msb_params * ) (p->params);\n*)\n\n$include \"mgga_x_ms.mpl\"\n\n(* eq (5) in the paper *)\nmsb_beta := (t, x) -> ms_alpha(t, x)*K_FACTOR_C/(t + K_FACTOR_C):\n\n(* eq (14) in the supplement *)\nmsb_fa := b -> (1 - (2*b)^2)^3 / (1 + (2*b)^3 + params_a_b*(2*b)^6):\n\nmsb_f := (x, u, t) -> ms_f0(X2S^2*x^2, 0) + \\\n  msb_fa(msb_beta(t,x))*(ms_f0(X2S^2*x^2, params_a_c) - ms_f0(X2S^2*x^2, 0)):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) ->\n  mgga_exchange(msb_f, rs, z, xs0, xs1, u0, u1, t0, t1):\n", "meta": {"hexsha": "abddfccb0806d3708225bb3059e3b720ea2cb788", "size": 863, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_msb.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_msb.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_msb.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.8387096774, "max_line_length": 77, "alphanum_fraction": 0.6106604867, "num_tokens": 347, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.926303724190573, "lm_q2_score": 0.6926419704455589, "lm_q1q2_score": 0.641596836754418}}
{"text": "############################################################\n# Generic conformal 3 metric for BSSN in spherical symmetry\n# See: BSSN_Spher.mw or BSSN_Spher.mpl\n############################################################\n\nNdim_ := 3:\nx1_ := x:\nx2_ := theta:\nx3_ := phi:\ncomplex_ := {}:\ng11_ := (A(t,x)):\ng12_ := 0:\ng13_ := 0:\ng22_ := x^2*(B(t,x)):\ng23_ := 0:\ng33_ := x^2*(B(t,x))*(sin(theta))^2:\n", "meta": {"hexsha": "8deaf11bdcc4b151a5e3a506a3b783c6bf84adff", "size": 396, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "metrics/spher_3.mpl", "max_stars_repo_name": "rmanak/bssn_spher", "max_stars_repo_head_hexsha": "b91104fd6b9b7cf1ba08e35efd65ff219ab7a5a9", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "metrics/spher_3.mpl", "max_issues_repo_name": "rmanak/bssn_spher", "max_issues_repo_head_hexsha": "b91104fd6b9b7cf1ba08e35efd65ff219ab7a5a9", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "metrics/spher_3.mpl", "max_forks_repo_name": "rmanak/bssn_spher", "max_forks_repo_head_hexsha": "b91104fd6b9b7cf1ba08e35efd65ff219ab7a5a9", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 23.2941176471, "max_line_length": 60, "alphanum_fraction": 0.404040404, "num_tokens": 127, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.9263037241905732, "lm_q2_score": 0.6926419704455588, "lm_q1q2_score": 0.641596836754418}}
{"text": "\n# Velocity Calculation for the Robot based on MDH frames\n# Introduction\n# Berechnung der Geschwindigkeit von Koordinatensystemen und Schwerpunkten\n# \n# Dateiname:\n# robot -> Berechnung für allgemeinen Roboter\n# tree -> Berechnung für eine beliebige Baumstruktur (ohne Schleifen)\n# floatb_twist -> floating base wird durch base twist (Geschwindigkeit der Basis) berücksichtigt\n# rotmat -> Kinematik wird mit Rotationsmatrizen berechnet\n# velocity -> Berechnung der Geschwindigkeit aller Segmente\n# linkframe -> Berechnung der Geschwindigkeit im Körper-KS (KSi)\n# par1 -> Parametersatz 1 (Schwerpunkt als Parameter: SX,SY,SZ)\n\n# Authors\n# Moritz Schappler, schappler@irt.uni-hannover.de, 2016-03\n# (C) Institut fuer Regelungstechnik, Leibniz Universitaet Hannover\n# \n# Sources\n# [GautierKhalil1990] Direct Calculation of Minimum Set of Inertial Parameters of Serial Robots\n# [KhalilDombre2002] Modeling, Identification and Control of Robots\n# [Ortmaier2014] Vorlesungsskript Robotik I (WS 2014/15)\n# [Ott2008] Cartesian Impedance Control of Redundant and Flexible-Joint Robots\n# Initialization\ninterface(warnlevel=0): # Unterdrücke die folgende Warnung.\nrestart: # Gibt eine Warnung, wenn über Terminal-Maple mit read gestartet wird.\ninterface(warnlevel=3):\nwith(LinearAlgebra):\nwith(ArrayTools):\nwith(codegen):\nwith(CodeGeneration):\nwith(StringTools):\ncodegen_act := true:\ncodegen_opt := 2:\nread \"../helper/proc_convert_s_t\":\nread \"../helper/proc_convert_t_s\": \nread \"../helper/proc_MatlabExport\":\nread \"../helper/proc_simplify2\":\nread \"../transformation/proc_rotx\": \nread \"../transformation/proc_roty\": \nread \"../transformation/proc_rotz\": \nread \"../transformation/proc_trotx\": \nread \"../transformation/proc_troty\": \nread \"../transformation/proc_trotz\": \nread \"../transformation/proc_transl\": \nread \"../transformation/proc_trafo_mdh\": \nread \"../robot_codegen_definitions/robot_env\":\nprintf(\"%s. Generiere Geschwindigkeit für %s (Herleitung im Körper-KS)\\n\", FormatTime(\"%Y-%m-%d %H:%M:%S\"), robot_name):\nread sprintf(\"../codeexport/%s/tmp/tree_floatb_definitions\", robot_name):\nread sprintf(\"../codeexport/%s/tmp/kinematic_constraints_maple_inert.m\", robot_name):  \nkin_constraints_exist := kin_constraints_exist: # nur zum Abschätzen der Komplexität\n;\n# Term-Vereinfachungen einstellen\nif not assigned(simplify_options) or simplify_options(4)=-1 then # Standard-Einstellungen:\n  if not kin_constraints_exist then # normale serielle Ketten und Baumstrukturen\n    use_simplify := 0: # Standardmäßig aus\n  else # mit kinematischen Zwangsbedingungen\n    use_simplify := 1: # standardmäßig simplify-Befehle anwenden\n  end if:\nelse # Benutzer-Einstellungen:\n  use_simplify := simplify_options(4): # vierter Eintrag ist für Geschwindigkeit\nend if:\n\n# Ergebnisse der Kinematik laden\nread sprintf(\"../codeexport/%s/tmp/kinematics_floatb_%s_rotmat_maple.m\", robot_name, base_method_name):\nTrf := Trf:\nTrf_c := Trf_c:\n# Zeitableitungen der MDH-Drehwinkel laden.\n# Die Berechnung soll nur an einer Stelle erfolgen. Siehe robot_tree_velocity_mdh_angles.mw.\nread sprintf(\"../codeexport/%s/tmp/velocity_mdh_angles_maple.m\", robot_name):\nthetaD := thetaD:\n\n# Calculate Velocities\n# First assume fixed base model with base velocity and acceleration set to zero\n# Anfangsgeschwindigkeit definieren für floating base model\n# Velocities of Frames\n# \n# Analog zu [Ortmaier2014], Gl. (7.6)\n# Geschwindigkeit der Basis der Koordinatensysteme der Körper (ausgedrückt im Körper-KS)\nrD_i_i := Matrix(3, NL):\n# Winkelgeschwindigkeit von Körper i ausgedrückt im Körper-KS\nomega_i_i := Matrix(3, NL):\n# Anfangsgeschwindigkeit der Basis:\n# twist: Basis-Geschwindigkeit bzgl Welt-KS ausgedrückt im Basis-KS\n# eulxyz: V_base_t beinhaltet die Geschwindigkeit der Basis im Welt-KS, ausgedrückt im Welt-KS. Daher ist für eine Darstellung im Körper-KS noch die Rotation erforderlich.\nif base_method_name = \"twist\" then:\n  rD_i_i(1..3,1) := V_base_t(1..3,1):\n  omega_i_i(1..3,1) := V_base_t(4..6,1):\nend:\nif base_method_name = \"eulxyz\" then:\n  rD_i_i(1..3,1) := Transpose(Trf_c(1..3, 1..3, 1)) . V_base_t(1..3,1):\n  omega_i_i(1..3,1) := Transpose(Trf_c(1..3, 1..3, 1)) . T_basevel . V_base_t(4..6,1):\nend:\n# Erhöhe die Geschwindigkeit jedes Körpers\n# Betrachte dazu nur die durch Gelenke angetriebenen Körper, nicht die Basis\nfor i from 1 to NJ do # Gelenke durchgehen\n  # Körper der von Gelenkwinkel i bewegt wird: Körperindex i+1\n  # Vorgängerkörper bestimmen\n  j := v(i) + 1:\n  # Geschwindigkeit des Vorgängers; Trf_c(...,i+1) enthält z-Achse des Körperkoordinatensystems, das von qi bewegt wird.\n  # [Ortmaier2014] (7.7) (S.115) (dort falsche Indizes für MDH), [KhalilDombre2002] (9.14)\n  R_j_i := Trf(1..3,1..3,i): # Rotation vom Vorgänger-Körper (j) zu diesem Körper (i+1)\n  R_i_j := Transpose(R_j_i):\n  # [GautierKhalil1988], equ.7: omega_jj aus [GautierKhalil1988] entspricht omega_i_i(1 .. 3, i+1) hier\n  if sigma(i) = 0 then # Drehgelenk\n    omega_i_i(1 .. 3, i+1) := Multiply(R_i_j,Matrix(3,1,omega_i_i(1 .. 3, j))) + thetaD(i,1)*<0;0;1>:\n  else: # Schubgelenk\n    omega_i_i(1 .. 3, i+1) := Multiply(R_i_j,Matrix(3,1,omega_i_i(1 .. 3, j)))\n  end if:\n  # Terme vereinfachen (Teil 1)\n  if use_simplify>=1 then\n    tmp_t11:=time():\n    tmp_l11 := length(omega_i_i(1 .. 3, i+1)):\n    omega_i_i(1 .. 3, i+1) := simplify2(omega_i_i(1 .. 3, i+1)):\n    tmp_l21 := length(omega_i_i(1 .. 3, i+1)):\n    tmp_t21:=time():\n  end if:\n  # Vektor vom Ursprung des vorherigen Koordinatensystems zu diesem KS\n  r_j_j_i := Trf(1 .. 3, 4, i):\n  # [GautierKhalil1988], equ.8: v_jj aus [GautierKhalil1988] entspricht rD_i_i(1 .. 3, i+1) hier\n  if sigma(i) = 0 then # Drehgelenk\n    rD_i_i(1 .. 3, i+1) := Multiply( R_i_j, ( rD_i_i(1 .. 3, j) + CrossProduct(omega_i_i(1 .. 3, j), r_j_j_i) ) ):\n  else: # Schubgelenk\n    rD_i_i(1 .. 3, i+1) := Matrix(Multiply( R_i_j, ( rD_i_i(1 .. 3, j) + CrossProduct(omega_i_i(1 .. 3, j), r_j_j_i) ) ) ) + Matrix(dD(i,1)*<0;0;1>):\n  end if:\n  printf(\"%s. Geschwindigkeit für Körperkoordinatensystem %d aufgestellt (Herleitung im Körper-KS).\\n\", \\\n     FormatTime(\"%Y-%m-%d %H:%M:%S\"), i-1): #0=Basis\n  # Terme vereinfachen (Teil 2)\n  if use_simplify>=1 then\n    tmp_t12:=time():\n    tmp_l12 := length(rD_i_i(1 .. 3, i+1)):\n    rD_i_i(1 .. 3, i+1) := simplify2(rD_i_i(1 .. 3, i+1)):\n    tmp_l22 := length(rD_i_i(1 .. 3, i+1)):\n    tmp_t22:=time():\n    printf(\"%s: Terme für Geschwindigkeiten vereinfacht. Länge: %d->%d / %d->%d. Rechenzeit %1.1fs und %1.1fs.\\n\", \\\n      FormatTime(\"%Y-%m-%d %H:%M:%S\"), tmp_l11, tmp_l21, tmp_l12, tmp_l22, tmp_t21-tmp_t11, tmp_t22-tmp_t12):\n  end if:\nend do:\n# Export\n# Maple Export\nsave omega_i_i, rD_i_i, sprintf(\"../codeexport/%s/tmp/velocity_linkframe_floatb_%s_maple.m\", robot_name, base_method_name):\nprintf(\"%s. Maple-Ausdrücke exportiert.\\n\", FormatTime(\"%Y-%m-%d %H:%M:%S\")):\n\n# Matlab Export\nif codegen_act then\n  MatlabExport(convert_t_s(omega_i_i), sprintf(\"../codeexport/%s/tmp/velocity_omegaii_floatb_%s_linkframe_matlab.m\", robot_name, base_method_name), codegen_opt):\n  MatlabExport(convert_t_s(rD_i_i), sprintf(\"../codeexport/%s/tmp/velocity_rDii_floatb_%s_linkframe_matlab.m\", robot_name, base_method_name), codegen_opt):\n  printf(\"%s. Geschwindigkeiten in Matlab exportiert.\\n\", FormatTime(\"%Y-%m-%d %H:%M:%S\")):\nend if:\n\n", "meta": {"hexsha": "61b76bd6734d36a6b48a8745f86411f748aa4710", "size": 7261, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "robot_codegen_kinematics/robot_tree_floatb_rotmat_velocity_linkframe.mpl", "max_stars_repo_name": "SchapplM/robsynth-modelgen", "max_stars_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 2, "max_stars_repo_stars_event_min_datetime": "2020-05-25T07:31:46.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-15T09:54:50.000Z", "max_issues_repo_path": "robot_codegen_kinematics/robot_tree_floatb_rotmat_velocity_linkframe.mpl", "max_issues_repo_name": "SchapplM/robsynth-modelgen", "max_issues_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "robot_codegen_kinematics/robot_tree_floatb_rotmat_velocity_linkframe.mpl", "max_forks_repo_name": "SchapplM/robsynth-modelgen", "max_forks_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 48.0860927152, "max_line_length": 171, "alphanum_fraction": 0.7252444567, "num_tokens": 2507, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9046505325302034, "lm_q2_score": 0.7090191276365462, "lm_q1q2_score": 0.6414145313905018}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\n$define xc_dimensions_2d\n\n_2d_pbe_kappa := 0.4604:\n_2d_pbe_mu    := 0.354546875:\n\n_2d_pbe_f0 := s -> 1 + _2d_pbe_kappa*(1 - _2d_pbe_kappa/(_2d_pbe_kappa + _2d_pbe_mu*s^2)):\n_2d_pbe_f  := x -> _2d_pbe_f0(X2S_2D*x):\n\nf := (rs, zeta, xt, xs0, xs1) -> gga_exchange(_2d_pbe_f, rs, zeta, xs0, xs1):\n", "meta": {"hexsha": "9a1ba76e5943ab32035c8d80847eddf1d329d38f", "size": 553, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_2d_pbe.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_2d_pbe.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_2d_pbe.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.65, "max_line_length": 90, "alphanum_fraction": 0.6853526221, "num_tokens": 225, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.939024825960626, "lm_q2_score": 0.6825737344123242, "lm_q1q2_score": 0.6409536821618272}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\n$define gga_x_b88_params\n$include \"gga_x_b88.mpl\"\n$include \"lda_x_erf.mpl\"\n\nityh_enhancement := xs -> b88_f(xs):\nityh_attenuation := a  -> attenuation_erf(a):\n\nityh_k_GGA := (rs, z, xs) -> sqrt(9*Pi/(2*X_FACTOR_C*ityh_enhancement(xs))) * n_spin(rs, z)^(1/3):\nityh_f_aa  := (rs, z, xs) -> ityh_attenuation(p_a_hyb_omega_0_/(2*ityh_k_GGA(rs, z, xs))):\n\nityh_f := (rs, z, xs) -> ityh_f_aa(rs, z, xs) * ityh_enhancement(xs):\n\nf := (rs, zeta, xt, xs0, xs1) -> gga_exchange_nsp(ityh_f, rs, zeta, xs0, xs1):\n", "meta": {"hexsha": "052ed752ab126e09b382d788a09b83d62bcb8df0", "size": 761, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_ityh.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_ityh.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_ityh.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 31.7083333333, "max_line_length": 98, "alphanum_fraction": 0.6754270696, "num_tokens": 288, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9381240211961401, "lm_q2_score": 0.6825737473266735, "lm_q1q2_score": 0.6403388286050171}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* One should be able to simplify this by evaluating explicitly the Stoll\n   decomposition of the exchange functional *)\n\n$define lda_c_pw_params\n$define lda_c_pw_modified_params\n$include \"lda_c_pw.mpl\"\n\nb97mv_ux    := (mgamma, x) -> mgamma*x^2/(1 + mgamma*x^2):\n\n(* article uses t = 2 tau convention *)\nb97mv_wx_ss := (t, dummy) -> (K_FACTOR_C - t)/(K_FACTOR_C + t):\nb97mv_wx_os := (ts0, ts1) -> (K_FACTOR_C*(ts0 + ts1) - 2*ts0*ts1)/(K_FACTOR_C*(ts0 + ts1) + 2*ts0*ts1):\n\nb97mv_g := (mgamma, wx, cc, n, xs, ts0, ts1) ->\n  add(cc[i][1]*wx(ts0, ts1)^cc[i][2]*b97mv_ux(mgamma, xs)^cc[i][3], i=1..n):\n\nb97mv_fpar  := (rs, z, xs0, xs1, ts0, ts1) ->\n  + lda_stoll_par(f_pw    , rs,  z,  1) * b97mv_g(b97mv_gamma_ss, b97mv_wx_ss, b97mv_par_ss, b97mv_par_n, xs0, ts0, 0)\n  + lda_stoll_par(f_pw    , rs, -z, -1) * b97mv_g(b97mv_gamma_ss, b97mv_wx_ss, b97mv_par_ss, b97mv_par_n, xs1, ts1, 0):\n\nb97mv_fos := (rs, z, xs0, xs1, ts0, ts1) ->\n  lda_stoll_perp(f_pw, rs, z)\n  * b97mv_g(b97mv_gamma_os, b97mv_wx_os, b97mv_par_os, b97mv_par_n, sqrt(xs0^2 + xs1^2)/sqrt(2), ts0, ts1):\n\nb97mv_f :=  (rs, z, xs0, xs1, ts0, ts1) ->\n  + b97mv_fpar(rs, z, xs0, xs1, ts0, ts1)\n  + b97mv_fos(rs, z, xs0, xs1, ts0, ts1):\n", "meta": {"hexsha": "fa32697a55dcf9a41b3980da74c56dd046134b45", "size": 1434, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/b97mv.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/b97mv.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/b97mv.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 39.8333333333, "max_line_length": 119, "alphanum_fraction": 0.659693166, "num_tokens": 598, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.933430812881347, "lm_q2_score": 0.6859494550081926, "lm_q1q2_score": 0.6402863573838141}}
{"text": "(*\n Copyright (C) 2020 Susi Lehtola\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n(* prefix:\n  mgga_k_csk_params *params;\n\n  assert(p->params != NULL);\n  params = (mgga_k_csk_params * )(p->params);\n*)\n\ncsk_p := x -> X2S^2*x^2:\ncsk_q := u -> X2S^2*u:\n\n(* Equation (21) *)\ncsk_z  := (p, q) -> 20/9*q - 40/27*p:\n\n(* Equation (22) *)\ncsk_f0 := (p, q, z) ->  1 + 5*p/3 + z*csk_I(z):\n\n(*\n   The function I(z) contains exp(-1/|z|^a) which is numerically\n   challenging for small |z|. Because of this, we truncate the term\n   close to z=0 for negative z, since I(z) -> 1 for small |z|.\n   For positive z, I(z)=1 identically, because of the step function.\n*)\ncsk_I_negz := z -> (1 - exp(-1/abs(z)^params_a_csk_a))^(1/params_a_csk_a):\ncsk_I_cutoff_small := (-log(DBL_EPSILON))^(-1/params_a_csk_a):\ncsk_I_cutoff_large := (-log(1 - DBL_EPSILON))^(-1/params_a_csk_a):\n\ncsk_I := z -> my_piecewise5(\n      z < -csk_I_cutoff_large, 0,\n      z > -csk_I_cutoff_small, 1,\n      csk_I_negz(m_max(m_min(z, -csk_I_cutoff_small), -csk_I_cutoff_large))\n  ):\n\ncsk_f := (x, u) -> \n  csk_f0(csk_p(x), csk_q(u), csk_z(csk_p(x), csk_q(u))):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) ->\n  mgga_kinetic(csk_f, rs, z, xs0, xs1, u0, u1):\n", "meta": {"hexsha": "3cd0fcd1a035a304db76d3be356ce3dde021df79", "size": 1383, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_k_csk.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_k_csk.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_k_csk.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 29.4255319149, "max_line_length": 75, "alphanum_fraction": 0.6305133767, "num_tokens": 525, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8976952975813454, "lm_q2_score": 0.7122321842389469, "lm_q1q2_score": 0.639367482577393}}
{"text": "function mandel_calc(a)\n    z = 0\n    for i in 1:100\n        z = z^2 + a\n    end\n    return z\nend\n\nfunction mandelbrot()\n    \"starting mandelbrot\"\n    for i in 0:30\n    \ty = 0.066666*i - 1\n\ts = \"\"\n\tfor j in 0:78\n\t    x = 0.0315*j - 2\n\t    if abs(mandel_calc((x, y))) < 2 then\n\t        s = s + \"*\"\n\t    else\n\t        s = s + \" \"\n\t    end\n\tend\n\ts\n    end\nend\n\nmandelbrot()\n", "meta": {"hexsha": "f8575c58b7056d10584039b10c4bec85539fe8cb", "size": 371, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "examples/mandelbrot.mpl", "max_stars_repo_name": "yugyfoog/MPL", "max_stars_repo_head_hexsha": "4159236c621fb823ada3d45b5b05368c60d8cb12", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2020-12-08T22:55:44.000Z", "max_stars_repo_stars_event_max_datetime": "2020-12-08T22:55:44.000Z", "max_issues_repo_path": "examples/mandelbrot.mpl", "max_issues_repo_name": "yugyfoog/MPL", "max_issues_repo_head_hexsha": "4159236c621fb823ada3d45b5b05368c60d8cb12", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "examples/mandelbrot.mpl", "max_forks_repo_name": "yugyfoog/MPL", "max_forks_repo_head_hexsha": "4159236c621fb823ada3d45b5b05368c60d8cb12", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 13.7407407407, "max_line_length": 41, "alphanum_fraction": 0.474393531, "num_tokens": 149, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8976952838963489, "lm_q2_score": 0.7122321781307374, "lm_q1q2_score": 0.6393674673471872}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_c_lyp_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_c_lyp_params * )(p->params);\n*)\n\nlyp_Cf := 3/10 * (3*Pi^2)^(2/3):\n\nlyp_omega := rr -> params_a_b*exp(-params_a_c*rr)/(1 + params_a_d*rr):\nlyp_delta := rr -> (params_a_c + params_a_d/(1 + params_a_d*rr))*rr:\n\nlyp_aux6 := 1/2^(8/3):\nlyp_aux4 := lyp_aux6/4:\nlyp_aux5 := lyp_aux4/(9*2):\n\nlyp_t1 := (rr, z) ->\n  -(1 - z^2)/(1 + params_a_d*rr):\nlyp_t2 := (rr, z, xt) ->\n  -xt^2*((1 - z^2)*(47 - 7*lyp_delta(rr))/(4*18) - 2/3):\nlyp_t3 := (z) ->\n  -lyp_Cf/2*(1 - z^2)*(opz_pow_n(z,8/3) + opz_pow_n(-z,8/3)):\nlyp_t4 := (rr, z, xs0, xs1) ->\n  lyp_aux4*(1 - z^2)*(5/2 - lyp_delta(rr)/18)*(xs0^2*opz_pow_n(z,8/3) + xs1^2*opz_pow_n(-z,8/3)):\nlyp_t5 := (rr, z, xs0, xs1) ->\n  lyp_aux5*(1 - z^2)*(lyp_delta(rr) - 11)*(xs0^2*opz_pow_n(z,11/3) + xs1^2*opz_pow_n(-z,11/3)):\nlyp_t6 := (z, xs0, xs1) ->\n  -lyp_aux6*(2/3*(xs0^2*opz_pow_n(z,8/3) + xs1^2*opz_pow_n(-z,8/3))\n  -opz_pow_n(z,2)*xs1^2*opz_pow_n(-z,8/3)/4 - opz_pow_n(-z,2)*xs0^2*opz_pow_n(z,8/3)/4):\n\nf_lyp_rr := (rr, z, xt, xs0, xs1) -> params_a_a*(lyp_t1(rr, z) + lyp_omega(rr)*(\n  + lyp_t2(rr, z, xt) + lyp_t3(z) + lyp_t4(rr, z, xs0, xs1)\n  + lyp_t5(rr, z, xs0, xs1) + lyp_t6(z, xs0, xs1)\n)):\n\n(* rr = rs/RS_FACTOR is equal to n_total(rs)^(-1/3) *)\nf_lyp := (rs, z, xt, xs0, xs1) -> f_lyp_rr(rs/RS_FACTOR, z, xt, xs0, xs1):\n\nf  := (rs, z, xt, xs0, xs1) -> f_lyp(rs, z, xt, xs0, xs1):\n", "meta": {"hexsha": "0bc04f461928408203d114824115e3d469b249ea", "size": 1671, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_lyp.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_lyp.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_lyp.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 34.1020408163, "max_line_length": 97, "alphanum_fraction": 0.5894673848, "num_tokens": 793, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9230391685381605, "lm_q2_score": 0.6926419831347361, "lm_q1q2_score": 0.6393356802073095}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_c_sogga11_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_c_sogga11_params * )(p->params);\n*)\n\n$define lda_c_pw_params\n$define lda_c_pw_modified_params\n$include \"lda_c_pw.mpl\"\n\nmbeta  := 15.75592*0.004235: (* the usual value of 0.066726 *)\nmalpha := mbeta/(16*2^(2/3)):\n\nsogga11_yy := (rs, z, xt) -> -malpha*mphi(z)*xt^2/(rs*f_pw(rs, z)):\n\nsogga11_f0 := (rs, z, xt) -> 1 - 1/(1 + sogga11_yy(rs, z, xt)):\nsogga11_f1 := (rs, z, xt) -> 1 - exp(-sogga11_yy(rs, z, xt)):\n\nsogga11_t0 := (rs, z, xt) -> add(params_a_sogga11_a[i]*sogga11_f0(rs, z, xt)^(i-1), i=1..6):\nsogga11_t1 := (rs, z, xt) -> add(params_a_sogga11_b[i]*sogga11_f1(rs, z, xt)^(i-1), i=1..6):\n\nsogga11_f := (rs, z, xt, xs0, xs1) ->\n  f_pw(rs, z)*(sogga11_t0(rs, z, xt) + sogga11_t1(rs, z, xt)):\n\nf  := (rs, z, xt, xs0, xs1) -> sogga11_f(rs, z, xt, xs0, xs1):\n", "meta": {"hexsha": "22bfd7d15f1c1d76447462fcc9580914bd43602f", "size": 1109, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_sogga11.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_sogga11.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_sogga11.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 30.8055555556, "max_line_length": 92, "alphanum_fraction": 0.6275924256, "num_tokens": 465, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9099070035949656, "lm_q2_score": 0.702530051167069, "lm_q1q2_score": 0.6392370137928456}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\nC0 := (1 - log(2))/(2*Pi^2): (* Equation (9) *)\nC1 := 4*C0/3:                (* Equations (13), (28), (33) *)\nC2 := RS_FACTOR:             (* Equation (8) *)\nC3 := C2/3:\n\n(* several cutoffs *)\nbig     := 1.0e4:\ncutoff  := 1.0e7:\nei_xmax := 7.0183341467e+02:\n\n(* Equation (39) *)\nkssp0_k0 := 1.291551074:\nkssp0_k1 := 0.349064173:\nkssp0_r1 := 0.08327588:\n\nkssp0 := rs ->\n  kssp0_k0 - kssp0_k1*(1 - exp(-kssp0_r1*rs^(4/5))):\n\n(* Equation (45) *)\nfssp_A1 := 1.622118767:\nfssp_A2 := 0.489958076:\nfssp_A3 := 1.379021941:\n\nfssp := (rs, gr) ->\n  (1 + fssp_A1*gr + fssp_A2^2*gr^2)*exp(-fssp_A2^2*gr^2)/sqrt(1 + fssp_A3*gr/rs):\n\n(* Equation (34) *)\nfa_a1 := 0.939016:\nfa_a2 := 1.733170:\n\nf_factor := rs -> exp(-rs^2/(fa_a1*sqrt(rs) + fa_a2*rs)^2):\n\n(* Equation (40) *)\nkss0_k0 :=  1.200801774:\nkss0_k1 :=  0.859614445:\nkss0_k2 := -0.812904345:\nkss0_r1 :=  1.089338848:\nkss0_r2 :=  0.655638823:\n\nkss0 := (rs, gr) ->\n  + kss0_k0\n  + kss0_k1*(1 - exp(-kss0_r1*sqrt(rs)))\n  + kss0_k2*(1 - exp(-kss0_r2*rs^(2/5))):\n\nfss_A4 := 4.946281353:\nfss_A5 := 3.600612059:\n\nfss := (rs, gr) ->\n  (1 + fss_A4^2*gr^2)*exp(-fss_A4^2*gr^2)/sqrt(1 + fss_A5*gr/rs):\n\n(* Equation (15) *)\neq15 := mu -> (3 + 2*(sqrt(mu) + mu))/(3 + 6*(sqrt(mu) + mu)):\n\nf_eab := mu ->\n  C0*(-xc_E1_scaled(mu)*(1 + 2*mu*eq15(mu)) + 2*eq15(mu)):\n\n(* Equation (13) *)\n(*\n   This is numerically suboptimal - the max function cuts off f_eab to\n   around 10^-6. This is too large. The other possibility that was used\n   before in the code was to put term to zero if mu > ei_xmax\n*)\nmu_ba := (rsa, ga2) -> C1*rsa/m_max(kssp0(rsa)^2*fssp(rsa, ga2)^2, 1e-60):\nterm1 := (rsa, z, ga2) -> my_piecewise3(mu_ba(rsa, ga2) >= cutoff, 0,\n  f_eab(mu_ba(rsa, ga2))*(1 - z)/2):\n\n\nmu_aa := (rsa, ga2) -> C1*rsa/m_max(kss0(rsa)^2*fss(rsa, ga2)^2, 1e-60):\nterm2 := (rsa, z, ga2) -> my_piecewise3(mu_aa(rsa, ga2) >= cutoff, 0,\n  f_eab(mu_aa(rsa, ga2))*f_factor(rsa)*(1 + z)/2):\n\nf_ft97 := (rs, z, xs) ->\n  + term1(rs*(2/(1 + z))^(1/3), z, C3^2*xs^2)\n  + term2(rs*(2/(1 + z))^(1/3), z, C3^2*xs^2):\n\nf  := (rs, z, xt, xs0, xs1) -> f_ft97(rs, z, xs0) + f_ft97(rs, -z, xs1):\n", "meta": {"hexsha": "b1c2e174ca99dec0a2f5fee7f1b7f70e47127ac0", "size": 2355, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_ft97.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_ft97.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_ft97.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.0689655172, "max_line_length": 81, "alphanum_fraction": 0.5813163482, "num_tokens": 1054, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9273632896242073, "lm_q2_score": 0.6893056231680122, "lm_q1q2_score": 0.639236730257552}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\nzlp_c := 0.828432   *RS_FACTOR:\nzlp_d := 2.15509e-2 *RS_FACTOR:\nzlp_k := 2.047107e-3*RS_FACTOR:\n\nzlp_f := (rs, z, xt, us0, us1) ->\n  - (zlp_c + zlp_d*t_vw(z, xt, us0, us1))\n  * (1 - zlp_k*log(1 + rs/zlp_k)/rs)/rs:\n\nf := (rs, z, xt, xs0, xs1, us0, us1, ts0, ts1) ->\n  zlp_f(rs, z, xt, us0, us1):\n", "meta": {"hexsha": "fba95848832be3c25ad94d1986b89343db61d7a1", "size": 556, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_xc_zlp.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_xc_zlp.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_xc_zlp.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 26.4761904762, "max_line_length": 68, "alphanum_fraction": 0.6241007194, "num_tokens": 228, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.931462503162843, "lm_q2_score": 0.6859494614282923, "lm_q1q2_score": 0.6389362023852011}}
{"text": "######################################################################\n# subsets(A) is the set of all subsets of A\n\n`is_element/subsets` := (A::set) -> proc(B)\n type(B,set) and B minus A = {};\nend;\n\n`is_equal/subsets` := (A::set) -> (B,C) -> evalb(B = C):\n\n`is_leq/subsets` := (A::set) -> (B,C) -> evalb(B minus C = {}):\n\n`random_element/subsets` := (A::set) -> proc()\n local r,B,a;\n r := rand(2);\n\n B := select(a -> (r() = 1),A);\n\n return B;\nend;\n\n`list_elements/subsets` := (A::set) -> \n sort(map(sort,[op(combinat[powerset](A))])):\n\n`count_elements/subsets` := (A::set) -> 2^nops(A);\n\n`functor/subsets` := (A::set,B::set) -> (f) -> proc(T)\n map(t -> f[t],T);\nend:\n\n`cofunctor/subsets` := (A::set,B::set) -> (f) -> proc(T)\n select(a -> member(f[a],T),A);\nend:\n", "meta": {"hexsha": "d5f2b19686f659a76cdf7b03dc5f0ba5e06c539f", "size": 762, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/subsets.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/subsets.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/subsets.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 23.0909090909, "max_line_length": 70, "alphanum_fraction": 0.4908136483, "num_tokens": 258, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8774767810736693, "lm_q2_score": 0.7279754430043072, "lm_q1q2_score": 0.6387815484280979}}
{"text": "######################################################################\n# Partitions of the set {1,...,n} into intervals\n\n`is_element/interval_partitions` := (n::posint) -> proc(pi)\n local A,U,i;\n global reason;\n\n A := {seq(i,i=1..n)};\n\n if not(`is_element/partitions`(A)(pi)) then\n  reason := [convert(procname,string),\"pi is not a partition\",pi,reason];\n  return false;\n fi;\n\n for U in pi do\n  if not(`is_element/posint_intervals`(U)) then\n   reason := [convert(procname,string),\"U is not a posint interval\",U];\n   return false;\n  fi;\n od;\n\n return true;\nend:\n\n`is_equal/interval_partitions` := (n::posint) -> proc(pi,rho)\n local A,i;\n\n A := {seq(i,i=1..n)};\n return `is_equal/partitions`(A)(pi,rho);\nend:\n\n`is_leq/interval_partitions` := (n::posint) -> proc(pi,rho)\n local A,i;\n\n A := {seq(i,i=1..n)};\n return `is_leq/partitions`(A)(pi,rho);\nend:\n\n# Given an integer n > 0 and a subset C of {1/2,3/2,...,(2n-1)/2}, this\n# returns the partition of {1,...,n} obtained by cutting at the points\n# of C.\n\n`cut_partition` := proc(n::posint,C)\n local m,C0,C1,i,j;\n\n m := 1 + nops(C);\n C0 := sort([1,op(map(c->c+1/2,C))]);\n C1 := sort([op(map(c->c-1/2,C)),n]);\n return {seq({seq(j,j=C0[i]..C1[i])},i=1..m)};\nend;\n\n`random_element/interval_partitions` := (n::posint) -> proc()\n local C,i;\n\n C := `random_element/subsets`({seq(i+1/2,i=1..n-1)})();\n return cut_partition(n,C);\nend;\n\n`list_elements/interval_partitions` := proc(n)\n local G,P,i;\n\n G := {seq(i+1/2,i=1..n-1)};\n P := `list_elements/subsets`(G);\n return map(C -> cut_partition(n,C),P);\nend;\n\n`count_elements/interval_partitions` := (n) -> 2^(n-1);\n\n", "meta": {"hexsha": "784f04e42389db8d6f7edb075590c9dacde700c3", "size": 1602, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/interval_partitions.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/interval_partitions.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/interval_partitions.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 23.2173913043, "max_line_length": 73, "alphanum_fraction": 0.5936329588, "num_tokens": 524, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8244619350028204, "lm_q2_score": 0.7745833789613197, "lm_q1q2_score": 0.6386145114394726}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: lda_exc *)\n(* prefix:\n  lda_k_gds08_params *params;\n\n  assert(p->params != NULL);\n  params = (lda_k_gds08_params * )(p->params);\n*)\n\ngds08_fs := (rs, z) -> (1 + z)/2 *(\n  + params_a_A\n  + params_a_B*log(2*n_spin(rs, z))\n  + params_a_C*log(2*n_spin(rs, z))^2\n):\n\n# Eq. (12)\ngds08_f := (rs, z) ->\n  + my_piecewise3(screen_dens(rs,  z), 0, gds08_fs(rs, z_thr( z)))\n  + my_piecewise3(screen_dens(rs, -z), 0, gds08_fs(rs, z_thr(-z))):\n\nf := (rs, z) -> gds08_f(rs, z):", "meta": {"hexsha": "6cc103a80f5f961ed28ff433a7a826219c41211c", "size": 710, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/lda_exc/lda_k_gds08_worker.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/lda_exc/lda_k_gds08_worker.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/lda_exc/lda_k_gds08_worker.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 25.3571428571, "max_line_length": 68, "alphanum_fraction": 0.6267605634, "num_tokens": 259, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9219218391455084, "lm_q2_score": 0.6926419894793246, "lm_q1q2_score": 0.6385617768101829}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_mgga_x *)\n(* prefix:\n  mgga_x_ms_params *params;\n \n  assert(pt->params != NULL);\n  params = (mgga_x_ms_params * ) (pt->params);\n*)\n\nfa := a -> (1 - a^2)^3 / (1 + a^3 + params_a_b*a^6):\nf0 := (p, c) -> 1 + params_a_kappa*(1 - params_a_kappa/(params_a_kappa + MU_GE*p + c)):\n\nf := (rs, x, t, u) -> f0(X2S^2*x^2, 0) + \\\n  fa((t - x^2/8)/K_FACTOR_C)*(f0(X2S^2*x^2, params_a_c) - f0(X2S^2*x^2, 0)):\n", "meta": {"hexsha": "da672de0689b78697bd337d58f62bdc7bf5d7435", "size": 647, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/mgga_x_ms.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/mgga_x_ms.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/mgga_x_ms.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 29.4090909091, "max_line_length": 87, "alphanum_fraction": 0.6105100464, "num_tokens": 252, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9263037323284109, "lm_q2_score": 0.6893056231680121, "lm_q1q2_score": 0.6385063714554908}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_x_vmt84_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_x_vmt84_params * )(p->params);\n*)\n\n$include \"gga_x_vmt.mpl\"\n\nvmt84_f0 := s -> (1 - exp(-params_a_alpha*s^4))/s^2 - 1 + exp(-params_a_alpha*s^4):\nvmt84_f  := x -> vmt_f(x) + vmt84_f0(X2S*x):\n\nf := (rs, zeta, xt, xs0, xs1) -> gga_exchange(vmt84_f, rs, zeta, xs0, xs1):\n", "meta": {"hexsha": "c6765e4938a3b5dd89cd5f7c4492460d2e1306b2", "size": 613, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_vmt84.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_vmt84.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_vmt84.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 26.652173913, "max_line_length": 83, "alphanum_fraction": 0.6525285481, "num_tokens": 223, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9086178870347122, "lm_q2_score": 0.7025300449389326, "lm_q1q2_score": 0.6383313650108143}}
{"text": "Digits := 120:\n\ninterface(quiet=true):\n\nread \"common-procedures.mpl\":\nread \"triple-double.mpl\":\n\n\n#---------------------------------------------------------------------\n# Procedure gal computes a number x and a boolean such that \n# \n# if the boolean is true\n# - |x - xstart| is minimal \n# - x = roundX(x) (x is a floating point number in format roundX)\n# - |(roundY(f(x)) - f(x)) / f(x)| <= eps\n#\n# and the boolean is false if no such x could be found in iter iterations\n#\n# Limitations:\n#\n# - floating point numbers xp such that f(xp) = 0 are not considered\n# \n# Uses: \n#\n# - The successor function succX for floating point numbers roundX(t)\n\ngal:=proc(xstart,roundX,f,roundY,epsi,succX,iter)\nlocal xleft, xright, i, err, ima, d, x, eps, b;\nd := Digits;\nDigits := 120;\neps := abs(epsi);\nxleft := roundX(xstart);\nxright := roundX(succX(roundX(xstart)));\nx := 0;\ni := 0;\nerr := eps * 2;\nwhile ((err > eps) and (i < iter)) do\n\ti := i + 1;\n\tif (type(i,odd)) then\n\t\tx := xright;\n\t\txright := evalf(roundX(succX(roundX(xright))));\n\telse\n\t\tx := xleft;\n\t\txleft := evalf(roundX(-succX(roundX(-xleft))));\n\tend if;\n\tima := evalf(f(x));\n\tif (ima <> 0) then \n\t\terr := evalf(abs((ima - roundY(ima))/ima));\n\tend if;\nend do;\nb := false;\nif (i < iter) then b := true; end if;\nDigits := d;\n(x,b);\nend proc:\n\n\ngalDoubleToDouble:=proc(xstart,f,epsi,iter)\nlocal g,b,xn; \n(g,b) := gal(xstart,nearest,f,nearest,epsi,succDouble,iter);\nif (b) then xn := g; else xn = xstart; end if; \nxn;\nend proc:\n\ngalDoubleToDoubleDouble:=proc(xstart,f,epsi,iter) \nlocal g,b,xn; \n(g,b) := gal(xstart,nearest,f,nearestDD,epsi,succDouble,iter);\nif (b) then xn := g; else xn = xstart; end if;\nxn;\nend proc:\n\n\n", "meta": {"hexsha": "7a19b97ef7db881b9ec80f69c6c2e079676494ae", "size": 1666, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "crlibm/maple/gal.mpl", "max_stars_repo_name": "squarePenguin/parvsl", "max_stars_repo_head_hexsha": "0d502abe795540a3dfc99d43726d3fc29a5e6e5d", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "crlibm/maple/gal.mpl", "max_issues_repo_name": "squarePenguin/parvsl", "max_issues_repo_head_hexsha": "0d502abe795540a3dfc99d43726d3fc29a5e6e5d", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 1, "max_issues_repo_issues_event_min_datetime": "2019-03-25T17:02:38.000Z", "max_issues_repo_issues_event_max_datetime": "2019-03-25T17:02:38.000Z", "max_forks_repo_path": "crlibm/maple/gal.mpl", "max_forks_repo_name": "squarePenguin/parvsl", "max_forks_repo_head_hexsha": "0d502abe795540a3dfc99d43726d3fc29a5e6e5d", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 22.8219178082, "max_line_length": 73, "alphanum_fraction": 0.6128451381, "num_tokens": 541, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8519527906914788, "lm_q2_score": 0.7490872131147275, "lm_q1q2_score": 0.6381869416843946}}
{"text": "(* type: work_lda *)\n\na :=  0.0311:\nb := -0.048:\nc :=  0.009:\nd := -0.017:\n\nf_ls := (rs, zeta) -> a*log(rs) + b + c*rs*log(rs) + d*rs:\nf_ms := (rs, zeta) -> -0.06156 + 0.01898*log(rs):\nf_hs := (rs, zeta) -> 0.438/rs + 1.325/rs^(3/2) - 1.47/rs^2 - 0.4/rs^(5/2):\n\nf := (rs, zeta) -> convert(piecewise(\n  rs < 0.7, f_ls(rs, zeta),\n  rs < 10,  f_ms(rs, zeta),\n  f_hs(rs, zeta)), 'Heaviside'):\n\n", "meta": {"hexsha": "9417c574709015dcbfe955db192845730ec8c09a", "size": 390, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/lda_c_gk72.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/lda_c_gk72.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/lda_c_gk72.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 22.9411764706, "max_line_length": 75, "alphanum_fraction": 0.4974358974, "num_tokens": 191, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.9532750427013547, "lm_q2_score": 0.6688802537704064, "lm_q1q2_score": 0.6376268524750771}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n               2020 Susi Lehtola\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_c_p86_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_c_p86_params * )(p->params);\n*)\n\n$define lda_c_pz_params\n$include \"lda_c_pz.mpl\"\n\n(* Equation (4) *)\np86_DD := z  -> sqrt(opz_pow_n(z,5/3) + opz_pow_n(-z,5/3))/sqrt(2):\n\n(* Equation (6) *)\np86_CC := rs ->\n  + params_a_aa\n  + (params_a_bb + params_a_malpha*rs + params_a_mbeta*rs^2)/(1 + params_a_mgamma*rs + params_a_mdelta*rs^2 + 1.0e4*params_a_mbeta*rs^3):\np86_CCinf := params_a_aa + params_a_bb:\n\n(* Equation (9) *)\np86_x1   := (rs, xt) -> xt/sqrt(rs/RS_FACTOR):\np86_mPhi := (rs, xt) -> params_a_ftilde*(p86_CCinf/p86_CC(rs))*p86_x1(rs, xt):\n\n(* Equation (8) *)\np86_H := (rs, z, xt) -> p86_x1(rs, xt)^2*exp(-p86_mPhi(rs, xt))*p86_CC(rs)/p86_DD(z):\n\nf_p86 := (rs, z, xt, xs0, xs1) ->\n  f_pz(rs, z) + p86_H(rs, z, xt):\n\nf := (rs, z, xt, xs0, xs1) ->\n  f_p86(rs, z, xt, xs0, xs1):\n", "meta": {"hexsha": "7adcb04af22eba7eedece9a2cfa71e906ff91716", "size": 1158, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_p86.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_p86.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_p86.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.5714285714, "max_line_length": 137, "alphanum_fraction": 0.6295336788, "num_tokens": 445, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8991213799730775, "lm_q2_score": 0.7090191460821871, "lm_q1q2_score": 0.6374942730527491}}
{"text": "\nread \"common-procedures.mpl\":\n\n\n#---------------------------------------------------------------------\n# hi_mi_lo takes an arbitrary precision number x and returns three doubles such that:\n# x ~ x_hi + x_mi + x_lo\nhi_mi_lo:= proc(x)\nlocal x_hi, x_mi, x_lo, res:\nx_hi:= nearest(evalf(x)):\nres:=x-x_hi:\nif (res = 0) then\n  x_mi:=0:\n  x_lo:=0:\nelse\n  x_mi:=nearest(evalf(res)):\n  res:=x-(x_hi+x_mi);\n  if (res = 0) then\n    x_lo:=0:\n  else\n    x_lo:=nearest(evalf(res)):\n  end if:\nend if:\nx_hi,x_mi,x_lo:\nend:\n\n\n#---------------------------------------------------------------------\n# same as hi_mi_lo, but returns hexadecimal strings\nieeehexa3:=proc(x)\nlocal x_hi, x_mi, x_lo;\n  x_hi, x_mi, x_lo := hi_mi_lo(x):\n  ieeehexa(x_hi), ieeehexa(x_mi), ieeehexa(x_lo):\nend proc:\n\n\n#---------------------------------------------------------------------\n#Like poly_exact, but the first n coefficients as triple doubles, \n#the next m coefiicients as double doubles and the rest as doubles\n#\npoly_exact32:=proc(P,n,m)\nlocal deg,i, coef, coef_hi, coef_mi, coef_lo, Q:\nQ:= 0:\nconvert(Q, polynom):\ndeg:=degree(P,x):\n  for i from 0 to deg do\n    coef :=coeff(P,x,i):\n    coef_hi, coef_mi, coef_lo:=hi_mi_lo(coef):\n    Q:= Q + coef_hi*x^i:\n    if(i<m+n) then\n        Q := Q + coef_mi*x^i:\n    fi: \n    if(i<n) then\n\tQ := Q + coef_lo*x^i:\n    fi:\n  od:\n  return(Q):\nend:\n\n\n#---------------------------------------------------------------------\n# Returns nearest double-double:\nnearestDD := proc(x)\n  local xh,xm:\n  xh := nearest(x);\n  xm := nearest(x - xh);\n  evalf(xh + xm);\nend:\n\n#---------------------------------------------------------------------\n# Returns nearest triple-double:\nnearestTD := proc(x)\n  local xh,xm,xl:\n  xh := nearest(x);\n  xm := nearest(x - xh);\n  xl := nearest(x - (xh + xm));\n  evalf(xh + xm + xl);\nend:\n", "meta": {"hexsha": "f250f6a4eab20d5a3af1fecdd1b63c1149d8998f", "size": 1812, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "crlibm/maple/triple-double.mpl", "max_stars_repo_name": "squarePenguin/parvsl", "max_stars_repo_head_hexsha": "0d502abe795540a3dfc99d43726d3fc29a5e6e5d", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "crlibm/maple/triple-double.mpl", "max_issues_repo_name": "squarePenguin/parvsl", "max_issues_repo_head_hexsha": "0d502abe795540a3dfc99d43726d3fc29a5e6e5d", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 1, "max_issues_repo_issues_event_min_datetime": "2019-03-25T17:02:38.000Z", "max_issues_repo_issues_event_max_datetime": "2019-03-25T17:02:38.000Z", "max_forks_repo_path": "crlibm/maple/triple-double.mpl", "max_forks_repo_name": "squarePenguin/parvsl", "max_forks_repo_head_hexsha": "0d502abe795540a3dfc99d43726d3fc29a5e6e5d", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 22.9367088608, "max_line_length": 85, "alphanum_fraction": 0.5071743929, "num_tokens": 519, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8791467580102418, "lm_q2_score": 0.7248702821204019, "lm_q1q2_score": 0.6372673585041208}}
{"text": "# Example from Section 5.1 of the paper\n\nread \"../ComputeIdentifiableFunctions.mpl\";\n\nmodel := [\n    diff(x1(t), t) = (a * x1(t) - b * x1(t) * x2(t)),\n    diff(x2(t), t) = (-c * x2(t) + d * x1(t) * x2(t) + e * u(t)),\n    y(t) = x1(t)\n]:\n\n# Computing function identifiable from a single experiment\nprintf(\"Single-experiment identifiable functions: %a\\n\", SingleExperimentIdentifiableFunctions(model)):\n\nme := MultiExperimentIdentifiableFunctions(model, simplified_generators=true):\nprintf(\"The bound for the number of experiments is %a, this means that the field of multi-experiment identifiable functions is the same, %a\\n\", me[1], me[3]):\n", "meta": {"hexsha": "2bfb2c0c043f61c0e18e07c078c86c62abad6d9e", "size": 640, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "examples/LV_with_control.mpl", "max_stars_repo_name": "iliailmer/AllIdentifiableFunctions", "max_stars_repo_head_hexsha": "033d335b6a2e6d53d8d935c627f9724fd2a56ebd", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2021-03-19T18:42:30.000Z", "max_stars_repo_stars_event_max_datetime": "2021-03-19T18:42:30.000Z", "max_issues_repo_path": "examples/LV_with_control.mpl", "max_issues_repo_name": "iliailmer/AllIdentifiableFunctions", "max_issues_repo_head_hexsha": "033d335b6a2e6d53d8d935c627f9724fd2a56ebd", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 1, "max_issues_repo_issues_event_min_datetime": "2021-03-20T15:22:40.000Z", "max_issues_repo_issues_event_max_datetime": "2021-03-21T01:07:04.000Z", "max_forks_repo_path": "examples/LV_with_control.mpl", "max_forks_repo_name": "iliailmer/AllIdentifiableFunctions", "max_forks_repo_head_hexsha": "033d335b6a2e6d53d8d935c627f9724fd2a56ebd", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2021-03-04T20:30:13.000Z", "max_forks_repo_forks_event_max_datetime": "2021-03-04T20:30:13.000Z", "avg_line_length": 40.0, "max_line_length": 158, "alphanum_fraction": 0.6859375, "num_tokens": 179, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.8824278664544911, "lm_q2_score": 0.721743200312399, "lm_q1q2_score": 0.6368863123797067}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\ngvt4_gamm := (alpha, x, z) -> 1 + alpha*(x^2 + z):\n\ngtv4 := (alpha, dd, x, z) ->\n  dd[1]/gvt4_gamm(alpha, x, z) +\n  (dd[2]*x^2 + dd[3]*z)/gvt4_gamm(alpha, x, z)^2 +\n  (dd[4]*x^4 + dd[5]*x^2*z + dd[6]*z^2)/gvt4_gamm(alpha, x, z)^3:\n", "meta": {"hexsha": "914adb6e560bdda056d28bbfa974ed7b139d8ea4", "size": 470, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gvt4.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gvt4.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gvt4.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 31.3333333333, "max_line_length": 68, "alphanum_fraction": 0.6063829787, "num_tokens": 194, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.9149009549929797, "lm_q2_score": 0.6959583187272711, "lm_q1q2_score": 0.6367329304388889}}
{"text": "(*\n Copyright (C) 2019 Susi Lehtola\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n(* prefix:\n  mgga_x_rscan_params *params;\n\n  assert(p->params != NULL);\n  params = (mgga_x_rscan_params * )(p->params);\n*)\n\n$include \"mgga_x_scan.mpl\"\n\n(* Coefficients of the rSCAN switching function from SI, in reversed(!) order: 7, 6, ..., 0 *)\nrscan_fx := [-0.023185843322, 0.234528941479, -0.887998041597, 1.451297044490, -0.663086601049, -0.4445555, -0.667, 1]:\n\nnp53 := (rs, z) -> n_spin(rs,z)^(5/3):\n\n(* First regularization: tau^u -> tau^u + tau_r.\n   tau_r gets scaled by 2^(2/3) due to the spin scaling. *)\nrscan_alpha0 := (rs, z, x, t) -> (np53(rs,z)*m_max(t - x^2/8, 0))/(np53(rs,z)*K_FACTOR_C + params_a_taur/2):\n\n(* Second regularization: alpha -> alpha^3/(alpha^2 + alpha_r) *)\nrscan_alpha := (rs, z, x, t) -> rscan_alpha0(rs, z, x, t)^3/(rscan_alpha0(rs, z, x ,t)^2 + params_a_alphar):\n\n(* f(alpha) replaced with a polynomial for alpha in [0, 2.5] *)\nrscan_f_alpha_small := (a, ff) -> add(ff[8-i]*a^i, i=0..7):\nrscan_f_alpha_large := a -> -params_a_d*exp(params_a_c2/(1 - a)):\nrscan_f_alpha := (a, ff) -> my_piecewise3(a <= 2.5, rscan_f_alpha_small(m_min(a, 2.5), ff), rscan_f_alpha_large(m_max(a, 2.5))):\nrscan_f   := (rs, z, x, u, t) -> (scan_h1x(scan_y(x, rscan_alpha(rs, z, x, t)))*(1 - rscan_f_alpha(rscan_alpha(rs, z, x, t), rscan_fx))\n  + scan_h0x*rscan_f_alpha(rscan_alpha(rs, z, x, t), rscan_fx))*scan_gx(x):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) -> mgga_exchange_nsp(rscan_f, rs, z, xs0, xs1, u0, u1, t0, t1):\n", "meta": {"hexsha": "b86fa6b32fcbb337bd6905423f5205de0d71275b", "size": 1700, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_rscan.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_rscan.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_rscan.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 43.5897435897, "max_line_length": 135, "alphanum_fraction": 0.6488235294, "num_tokens": 652, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.905989822921759, "lm_q2_score": 0.7025300573952054, "lm_q1q2_score": 0.6364850822966953}}
{"text": "make_icosahedron_complex := proc()\n global icosahedron_complex,dodecahedron_complex;\n local IC,DC,tau,vI,vD,i;\n\n IC := table():\n DC := table():\n \n IC[\"vertices\"] := [seq(i,i=1..12)];\n DC[\"vertices\"] := [seq(i,i=1..20)];\n\n IC[\"faces\"] := [\n  [ 1, 2, 9], [ 1, 2,11], [ 1, 5, 6], [ 1, 5, 9], [ 1, 6,11],\n  [ 2, 7, 8], [ 2, 7, 9], [ 2, 8,11], [ 3, 4,10], [ 3, 4,12],\n  [ 3, 5, 6], [ 3, 5,10], [ 3, 6,12], [ 4, 7, 8], [ 4, 7,10],\n  [ 4, 8,12], [ 5, 9,10], [ 6,11,12], [ 7, 9,10], [ 8,11,12]\n ];\n\n IC[\"edges\"] := {op(map(op,map(f -> [[f[1],f[2]],[f[1],f[3]],[f[2],f[3]]],IC[\"faces\"])))};\n IC[\"edges\"] := sort([op(IC[\"edges\"])]);\n\n IC[\"max_simplices\"] := IC[\"faces\"];\n \n tau := (1+sqrt(5))/2;\n\n IC[\"embedding_dim\"] := 3;\n\n vI := table([\n   1 = [   0,   1, tau],\n   2 = [   0,  -1, tau],\n   3 = [   0,   1,-tau],\n   4 = [   0,  -1,-tau],\n   5 = [   1, tau,   0],\n   6 = [  -1, tau,   0],\n   7 = [   1,-tau,   0],\n   8 = [  -1,-tau,   0],\n   9 = [ tau,   0,   1],\n  10 = [ tau,   0,  -1],\n  11 = [-tau,   0,   1],\n  12 = [-tau,   0,  -1]\n ]):\n\n for i from 1 to 12 do vI[i] := simplify(rationalize(vI[i] /~ tau^2)); od;\n\n IC[\"embedding\"] := eval(vI);\n IC[\"normalised_embedding\"] := table([\n  seq(i = evalf(vI[i] /~ sqrt(5-2*sqrt(5))),i = 1..12)\n ]);\n\n IC[\"edge_centres\"] :=\n  map(e -> (vI[e[1]] +~ vI[e[2]]) /~ 2,IC[\"edges\"]);\n\n IC[\"face_centres\"] :=\n  map(f -> (vI[f[1]] +~ vI[f[2]] +~ vI[f[3]]) /~ 3, IC[\"faces\"]);\n\n `plot/simplicial_complex`(IC);\n\n icosahedron_complex := eval(IC);\n dodecahedron_complex := eval(DC);\n return eval(IC);\nend:\n\nmake_icosahedron_complex():\n\nicosphere_complex := proc(n::nonnegint)\n local T,T0,E,v,x,i,j;\n \n T := eval(icosahedron_complex);\n\n for i from 1 to n do\n  T0 := eval(T);\n  T := eval(`triangular_subdivision/simplicial_complex`(T0));\n  T0 := eval(T);\n  T := eval(`condense/simplicial_complex`(T0));\n  E := T[\"embedding\"];\n  for v in T[\"vertices\"] do\n   x := E[v];\n   x := evalf(x /~ sqrt(add(x[j]^2,j=1..3)));\n   E[v] := x;\n  od:\n od:\n\n return eval(T):\nend:", "meta": {"hexsha": "9c8863760bb6b39076f4496549c0635c2b35c6c7", "size": 1986, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/simplicial_complexes/icosahedron_complex.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/simplicial_complexes/icosahedron_complex.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/simplicial_complexes/icosahedron_complex.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 23.9277108434, "max_line_length": 90, "alphanum_fraction": 0.4833836858, "num_tokens": 900, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9059898102301019, "lm_q2_score": 0.7025300636233416, "lm_q1q2_score": 0.6364850790230527}}
{"text": "`is_element/Xi/generic` := (gen_name,el_test) -> (A::set) -> (TT) -> proc(m)\n global reason;\n local pn,TT1,C,T;\n \n pn := cat(\"is_element/Phi/\",gen_name);\n TT1 := `big_sets/trees`(A)(TT);\n\n if not is_table_on(TT1,m) then\n  reason := [pn,\"m is not a table on TT1\",m,TT1];\n  return false;\n fi;\n\n C := children_map(A)(TT);\n\n for T in TT1 do\n  if not(el_test(C[T])(m[T])) then\n   reason := [pn,\"m[T] is not in M(C[T])\",m[T],T,C[T]];\n   return false;\n  fi;\n od;\n\n return true;\nend:\n\n# If E is a strongly reduced operad, then there are natural maps\n# \\theta : (\\Xi E)(TT) -> (\\Xi E)(UU) whenever TT and UU are full trees\n# on the same set A with UU contained in TT.\n\n`theta/Xi/generic` := (gen_name,eta,gamma) -> (A::set) -> (TT,UU) -> proc(x)\n local VV,CV,CT,X,Y,Z,T,P,Q,p,y,w;\n \n if TT = UU then return x; fi;\n\n T := (TT minus UU)[1];\n VV := TT minus {T};\n P := parent_map(A)(TT)[T];\n CT := children_map(A)(TT);\n CV := children_map(A)(VV);\n Y := CT[T];\n X := CV[P];\n Z := CT[P];\n p := table();\n for Q in X do\n  p[Q] := `if`(member(Q,Y),T,Q);\n od;\n y := table();\n y[T] := x[T];\n for Q in X minus Y do\n  y[Q] := eta({Q});\n od;\n\n w := gamma(X,Z)(p)(x[P],y);\n return `theta/Xi/generic`(gen_name,eta,gamma)(A)(VV,UU)(w);\nend:", "meta": {"hexsha": "7b2d4a1c2032a6628549b9a65b493380c5cb7cf7", "size": 1215, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/operads/Xi.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/operads/Xi.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/operads/Xi.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 22.5, "max_line_length": 76, "alphanum_fraction": 0.5670781893, "num_tokens": 443, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8740772318846386, "lm_q2_score": 0.7279754489059775, "lm_q1q2_score": 0.636306765259714}}
{"text": "# Elliptic curves in Edwards form\n# (This is rudimentary; there is a LaTeX file with much more material.)\n\n`rels/edwards` := (a) -> proc(u)\n [-u[1]^2 + u[2]^2 - u[3]^2 + u[4]^2,a * u[2]*u[4] - u[1]*u[3]];\nend: \n\n`is_element/edwards_curve` := (a) -> proc(u)\n if not(`is_element/CP`(3)(u)) then return false; fi;\n return evalb(simplify(`rels/edwards`(a)(u)) = [0,0]);\nend:\n\n", "meta": {"hexsha": "0786b20111b0d36f2715c52d7cb6d1ee8574c3c9", "size": 372, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/elliptic/edwards.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/elliptic/edwards.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/elliptic/edwards.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 28.6153846154, "max_line_length": 71, "alphanum_fraction": 0.6021505376, "num_tokens": 143, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.8933094060543488, "lm_q2_score": 0.7122321964553657, "lm_q1q2_score": 0.6362437203883271}}
{"text": "######################################################################\n# Here B is assumed to be a subset of A, and SWW(A,B,N) is the space\n# denoted by S(NWA,NWB) in the LaTeX document.\n\n`is_element/SWW` := (N::posint) -> (A::set,B::set) -> proc(xy)\n local x,y,x0,y0,a,b,r;\n global reason;\n \n if not(type(xy,list) and nops(xy) = 2) then\n  reason := [convert(procname,string),\"xy cannot be split as [x,y]\",xy];\n  return false;\n fi;\n\n x,y := op(xy); \n if not(`is_element/SW`(N)(A)(x)) then\n  reason := [convert(procname,string),\"x is not in SW(N)(A)\",x,N,A];\n  return false;\n fi;\n\n if not(`is_element/SW`(N)(B)(y)) then\n  reason := [convert(procname,string),\"y is not in SW(N)(B)\",y,N,B];\n  return false;\n fi;\n\n x0 := table();\n for b in B do x0[b] := x[b]; od;\n x0 := `normalise/W`(N)(B)(x0);\n y0 := `normalise/SW`(N)(B)(y);\n\n r := 0;\n for b in B do r := max(r,op(map(abs,x0[b]))); od;\n if r = 0 then return true; fi;\n for b in B do\n  if simplify(x0[b] -~ r *~ y0[b]) <> [0$N] then\n   reason := [convert(procname,string),\"x0 and y0 are incompatible at b\",x0,y0,b,r];\n   return false;\n  fi;\n od;\n\n return true;\nend;\n\n`normalise/SWW` := (N::posint) -> (A::set,B::set) -> proc(xy)\n [`normalise/SW`(N)(A)(xy[1]),\n  `normalise/SW`(N)(B)(xy[2])];\nend;\n\n`is_equal/SWW` := (N::posint) -> (A::set,B::set) -> proc(x,y) \n local p,q,r,s;\n global reason;\n\n p,q := op(`normalise/SWW`(N)(A,B)(x));\n r,s := op(`normalise/SWW`(N)(A,B)(y));\n\n if not `is_equal/SW`(N)(A)(p,r) then\n  reason := [convert(procname,string),\"p <> r\",p,r,reason];\n  return false;\n fi;\n\n if not `is_equal/SW`(N)(B)(q,s) then\n  reason := [convert(procname,string),\"q <> s\",q,s,reason];\n  return false;\n fi;\n\n return true;\nend;\n\n`is_leq/SWW` := NULL;\n\n`random_element/SWW` := (N::posint) -> (A::set,B::set) -> proc()\n local x,y,b,u,c;\n\n x := `random_element/SW`(N)(A)();\n\n if rand(1..3)() = 1 then\n  u := `random_element/R`(N)();\n\n  for b in B do\n   x[b] := u;\n  od;\n  y := `random_element/SW`(N)(B)();\n else \n  y := `rho/W`(A,B)(x);\n  if `is_zero/W`(N)(B)(y) then\n   y := `random_element/SW`(N)(B)();\n  fi;\n fi;\n\n return [eval(x),eval(y)];\nend;\n\n`list_elements/SWW` := NULL;\n`count_elements/SWW` := NULL;\n", "meta": {"hexsha": "8e329f9eee1ae79bc9a5b0a48a8f21df099556c5", "size": 2160, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/SWW.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/SWW.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/SWW.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 22.9787234043, "max_line_length": 84, "alphanum_fraction": 0.5509259259, "num_tokens": 775, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8459424217727027, "lm_q2_score": 0.7520125848754472, "lm_q1q2_score": 0.636159347253086}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_gga_c *)\n(* prefix:\n  gga_c_lyp_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_c_lyp_params * )(p->params);\n*)\n\nCf := 3/10 * (3*Pi^2)^(2/3):\n\nomega := rs -> params_a_B*exp(-params_a_c*rs)/(1 + params_a_d*rs):\ndelta := rs -> (params_a_c + params_a_d/(1 + params_a_d*rs))*rs:\n\naux6 := 1/2^(8/3):\naux4 := aux6/4:\naux5 := aux4/(9*2):\n\nt1 := (rs, z) ->\n  -(1 - z^2)/(1 + params_a_d*rs):\nt2 := (rs, z, xt) ->\n  -xt^2*((1 - z^2)*(47 - 7*delta(rs))/(4*18) - 2/3):\nt3 := (z) ->\n  -Cf/2*(1 - z^2)*((1 + z)^(8/3) + (1 - z)^(8/3)):\nt4 := (rs, z, xs0, xs1) ->\n  aux4*(1 - z^2)*(5/2 - delta(rs)/18)*(xs0^2*(1 + z)^(8/3) + xs1^2*(1 - z)^(8/3)):\nt5 := (rs, z, xs0, xs1) ->\n  aux5*(1 - z^2)*(delta(rs) - 11)*(xs0^2*(1 + z)^(11/3) + xs1^2*(1 - z)^(11/3)):\nt6 := (z, xs0, xs1) ->\n  -aux6*(2/3*(xs0^2*(1 + z)^(8/3) + xs1^2*(1 - z)^(8/3))\n  -(1 + z)^2*xs1^2*(1 - z)^(8/3)/4 - (1 - z)^2*xs0^2*(1 + z)^(8/3)/4):\n\nf_lyp := (rs, z, xt, xs0, xs1) -> params_a_A*(t1(rs/RS_FACTOR, z) + omega(rs/RS_FACTOR)*(\n  + t2(rs/RS_FACTOR, z, xt) + t3(z) + t4(rs/RS_FACTOR, z, xs0, xs1)\n  + t5(rs/RS_FACTOR, z, xs0, xs1) + t6(z, xs0, xs1)\n)):\n\nf  := (rs, z, xt, xs0, xs1) -> f_lyp(rs, z, xt, xs0, xs1):\n\n", "meta": {"hexsha": "ac8698caa336122aff845b10a20e2e8cb6083216", "size": 1433, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/gga_c_lyp.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/gga_c_lyp.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/gga_c_lyp.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 30.4893617021, "max_line_length": 89, "alphanum_fraction": 0.5198883461, "num_tokens": 676, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8962513620489619, "lm_q2_score": 0.7090191337850933, "lm_q1q2_score": 0.635459364373665}}
{"text": "ctfm_expr :=  exp(x) - exp(lv) + 1/(1-x/rv) - 1/(1-lv/rv);\nctfmp_expr := ((diff(ctfm_expr,x)));\noctfmp_expr := -(diff(1/ctfmp_expr,x));\n\nss:=eval(diff(ctfm_expr,x),{lv=-12,rv=3});\nevalf(eval(ss,x=2))/evalf(eval(ss,x=-12));\ntval_ctfm:=eval((ctfm_expr),{lv=-12,rv=3});\n(evalf(eval(tval_ctfm,x=2)));\nread (\"/home/arman/FD/FD.mpl\"):\nMFD(); grid_functions:={};\nGen_Eval_Code(ctfm_expr,input=\"c\",proc_name=\"init_ctfm\");\nGen_Eval_Code(ctfmp_expr,input=\"c\",proc_name=\"init_ctfmp\");\nGen_Eval_Code(octfmp_expr,input=\"c\",proc_name=\"init_octfmp\");\n\ngrid_functions:={};\nctfm_expr :=  x/(1-x/rv);\nctfmp_expr := simplify(diff(ctfm_expr,x));\noctfmp_expr := -simplify(diff(1/ctfmp_expr,x));\nGen_Eval_Code(ctfm_expr,input=\"c\",proc_name=\"init_ctfm2\");\nGen_Eval_Code(ctfmp_expr,input=\"c\",proc_name=\"init_ctfmp2\");\nGen_Eval_Code(octfmp_expr,input=\"c\",proc_name=\"init_octfmp2\");\n\n", "meta": {"hexsha": "b2dd48523e8f6c3270a7951ae920b23a1ee8afd7", "size": 858, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "ctfm.mpl", "max_stars_repo_name": "rmanak/bssn_spher", "max_stars_repo_head_hexsha": "b91104fd6b9b7cf1ba08e35efd65ff219ab7a5a9", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "ctfm.mpl", "max_issues_repo_name": "rmanak/bssn_spher", "max_issues_repo_head_hexsha": "b91104fd6b9b7cf1ba08e35efd65ff219ab7a5a9", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "ctfm.mpl", "max_forks_repo_name": "rmanak/bssn_spher", "max_forks_repo_head_hexsha": "b91104fd6b9b7cf1ba08e35efd65ff219ab7a5a9", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 37.3043478261, "max_line_length": 62, "alphanum_fraction": 0.7062937063, "num_tokens": 313, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9449947117065458, "lm_q2_score": 0.672331705744791, "lm_q1q2_score": 0.6353499064414689}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\na := -0.74860:\nb :=  0.06001:\nc :=  3.60073:\nd :=  0.90000:\n\nf_num := (z, xt) -> sqrt(1 - z^2)*(a + b*xt):\nf_den := (rs, xs0, xs1) -> c + d*(xs0 + xs1) + rs:\n\nf := (rs, zeta, xt, xs0, xs1) -> f_num(zeta, xt)/f_den(rs, xs0, xs1):\n", "meta": {"hexsha": "eaacedd98113116779925dd54492a831f57c754e", "size": 489, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_wl.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_wl.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_wl.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 24.45, "max_line_length": 69, "alphanum_fraction": 0.591002045, "num_tokens": 194, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9597620585273153, "lm_q2_score": 0.6619228758499942, "lm_q1q2_score": 0.635288461912111}}
{"text": "\nTITLE\n    AircraftAlloc;\n\nINDEX\n    aircraft := (A,B,C,D);\n   \nSTOCHASTIC\n\nINDEP\n    route := (NL1, NL2, ND0, ND1, NB0) -> (r1,r2,r3,r4,r5);\n\nOUTCOME\n   out5 := 1..5;\n\nEVENT\n    RouteOut[route,out5] := \n       (NL1, 1..5, \n        NL2, 1..2, \n        ND0, 1..5, \n        ND1, 1..5, \n        NB0, 1..3);\n\nPROBABILITIES\n    p[route, out5 IN RouteOut] := \n[NL1, 1, 0.2, \n NL1, 2, 0.05, \n NL1, 3, 0.35, \n NL1, 4, 0.2, \n NL1, 5, 0.2, \n NL2, 1, 0.3, \n NL2, 2, 0.7, \n ND0, 1, 0.1, \n ND0, 2, 0.2, \n ND0, 3, 0.4, \n ND0, 4, 0.2, \n ND0, 5, 0.1, \n ND1, 1, 0.2, \n ND1, 2, 0.2, \n ND1, 3, 0.3, \n ND1, 4, 0.2, \n ND1, 5, 0.1, \n NB0, 1, 0.1, \n NB0, 2, 0.8, \n NB0, 3, 0.1];\n\n\nRANDOM DATA\n    Demand[route, out5 IN RouteOut] := \n[NL1, 1, 200, \n NL1, 2, 220, \n NL1, 3, 250, \n NL1, 4, 270, \n NL1, 5, 300, \n NL2, 1,  50, \n NL2, 2, 150, \n ND0, 1, 140, \n ND0, 2, 160, \n ND0, 3, 180, \n ND0, 4, 200, \n ND0, 5, 220, \n ND1, 1,  10, \n ND1, 2,  50, \n ND1, 3,  80, \n ND1, 4, 100, \n ND1, 5, 340, \n NB0, 1, 580, \n NB0, 2, 600, \n NB0, 3, 620];\n  \nDATA\n    AircraftAvail[aircraft] := (10, 19, 25, 15);\n    !Demand[route]  := (250, 120, 180, 90, 600);\n    PriceTicket[route] := (13, 13, 7, 7, 1);\n\n    PotentialPass[aircraft, route] \n       := (16, 15, 28, 23, 81,\n             , 10, 14, 15, 57,\n             ,  5,   ,  7, 29,\n            9, 11, 22, 17, 55); \n            \n    MonthlyCost[aircraft, route] \n       := (18, 21, 18, 16, 10,\n             , 15, 16, 14,  9, \n             , 10,   ,  9,  6, \n           17, 16, 17, 15, 10);\n\n\nDECISION VARIABLES\n   Assign[aircraft, route]  -> x\n      WHERE (PotentialPass > 0);\n\nSTAGE2 VARIABLES\n   EmptySeats[route] -> y1;\n   TurnedAway[route] -> y2;\t\n\nMACRO\n   OperatingCost := SUM(aircraft, route: MonthlyCost * Assign);\n   LostRevenue   := SUM(route: PriceTicket * TurnedAway);\n\nMODEL\n  \n    MIN TotalCost = OperatingCost + LostRevenue;\n\n           \nSUBJECT TO\n   AircraftCap[aircraft]: \n       SUM(route: Assign) \n    <= \n       AircraftAvail;\n   \n   PassBal[route]: \n       SUM(aircraft: PotentialPass * Assign) \n       + TurnedAway[route] \n       - EmptySeats[route]\n     = \n       Demand[route];\nEND   \t\n\n", "meta": {"hexsha": "6ae8259d9e1bb2f1d16ae5465f3d6a57c1b1c4f9", "size": 2120, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "Stochastic/Aircraft.mpl", "max_stars_repo_name": "BjarniMax/mpl-models", "max_stars_repo_head_hexsha": "be22a81b3b42cdf63c933b010c1a2a9764127c98", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "Stochastic/Aircraft.mpl", "max_issues_repo_name": "BjarniMax/mpl-models", "max_issues_repo_head_hexsha": "be22a81b3b42cdf63c933b010c1a2a9764127c98", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Stochastic/Aircraft.mpl", "max_forks_repo_name": "BjarniMax/mpl-models", "max_forks_repo_head_hexsha": "be22a81b3b42cdf63c933b010c1a2a9764127c98", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 17.6666666667, "max_line_length": 63, "alphanum_fraction": 0.4891509434, "num_tokens": 1003, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.91243616285804, "lm_q2_score": 0.6959583376458152, "lm_q1q2_score": 0.6350175551106078}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\ncs_a := -0.04918:\ncs_b :=  0.132:\ncs_c :=  0.2533/RS_FACTOR:\ncs_d :=  0.349/RS_FACTOR:\n\ncs_thf := (z, u, t) ->\n  opz_pow_n(z,8/3)*2^(-8/3)*(t - u/8):\n\n(* This is Equation (15) of Lee1988_785 *)\n(* Note that gamma = (1 - z^2) *)\nf_cs := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) ->\n  cs_a*(1 - z^2)/(1 + cs_d*rs) * (1 + 2*cs_b*exp(-cs_c*rs)*(\n    cs_thf(z, u0, t0) + cs_thf(-z, u1, t1) - t_vw(z, xt, u0, u1)\n  )):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) ->\n  f_cs(rs, z, xt, xs0, xs1, u0, u1, t0, t1):\n", "meta": {"hexsha": "c6101aa1d7f773987fb115e514fec8a7b8094135", "size": 762, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_c_cs.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_c_cs.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_c_cs.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.2142857143, "max_line_length": 68, "alphanum_fraction": 0.5695538058, "num_tokens": 343, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9441768620069627, "lm_q2_score": 0.6723317123102956, "lm_q1q2_score": 0.634800046356903}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: lda_exc *)\n(* prefix:\n  lda_c_1d_csc_params *params;\n\n  assert(p->params != NULL);\n  params = (lda_c_1d_csc_params * )(p->params);\n*)\n\n$define xc_dimensions_1d\n\n(* factor of 2 is the conversion from Ry to Hartree *)\nf_aux := (a, rs) -> -(rs + a[5]*rs^2)*log(1+ a[8]*rs + a[9]*rs^a[10])\n  / (2*(a[1] + a[2]*rs + a[3]*rs^a[6] + a[4]*rs^a[7])):\n\nf := (rs, z) ->\n  f_aux(params_a_para, rs) + (f_aux(params_a_ferro, rs) - f_aux(params_a_para, rs))*z^2:\n", "meta": {"hexsha": "36248b79424a3277b61b2af5b4a4e8f7efc397fc", "size": 696, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/lda_exc/lda_c_1d_csc.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/lda_exc/lda_c_1d_csc.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/lda_exc/lda_c_1d_csc.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.84, "max_line_length": 88, "alphanum_fraction": 0.6278735632, "num_tokens": 258, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.933430803622103, "lm_q2_score": 0.6791787056691697, "lm_q1q2_score": 0.6339663250357929}}
{"text": "(*\n Copyright (C) 2019 Susi Lehtola\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_c_chachiyo_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_c_chachiyo_params * )(p->params);\n*)\n\n(* Functional is based on Chachiyo correlation with modified spin scaling *)\n$include \"lda_c_chachiyo_mod.mpl\"\n\n(* Reduced gradient parameter *)\ncha_t := (rs, xt) -> (Pi/3)^(1/6) / 4 * n_total(rs)^(1/6) * xt:\n\n(* The full functional that agrees with the given reference values is *)\nf_chachiyo_gga := (rs, z, xt, xs0, xs1) -> f_chachiyo(rs, z) * (1 + cha_t(rs, xt)^2)^(params_a_h / f_chachiyo(rs, z)):\n\nf  := (rs, z, xt, xs0, xs1) -> f_chachiyo_gga(rs, z, xt, xs0, xs1):\n", "meta": {"hexsha": "09c78141c0a85d348d48e58043a76637b215aa93", "size": 856, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_chachiyo.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_chachiyo.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_chachiyo.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 31.7037037037, "max_line_length": 118, "alphanum_fraction": 0.6670560748, "num_tokens": 284, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9241418241572635, "lm_q2_score": 0.6859494614282923, "lm_q1q2_score": 0.6339145865640345}}
{"text": "######################################################################\n# big_subsets(A) is the set of all subsets B of A with |B| > 1\n\n`is_element/big_subsets` := (A::set) -> proc(B)\n type(B,set) and B minus A = {} and nops(B) > 1;\nend;\n\n`is_equal/big_subsets` := (A::set) -> (B,C) -> evalb(B = C):\n\n`is_leq/big_subsets` := (A::set) -> (B,C) -> evalb(B minus C = {}):\n\n`random_element/big_subsets` := (A::set) -> proc()\n local r,B;\n\n if nops(A) < 2 then return FAIL; fi;\n\n r := rand(2);\n B := {};\n\n while nops(B) < 2 do\n  B := select(a -> (r() = 1),A);\n od;\n\n return B;\nend;\n\n`list_elements/big_subsets` := (A::set) ->\n select(B -> nops(B) > 1,sort(map(sort,[op(combinat[powerset](A))]))):\n\n`count_elements/big_subsets` := (A::set) ->\n 2^nops(A) - nops(A) - 1;\n\n", "meta": {"hexsha": "aad6efd2656a70569e9bded03ca05708a50dc8ff", "size": 762, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/big_subsets.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/big_subsets.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/big_subsets.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 23.0909090909, "max_line_length": 70, "alphanum_fraction": 0.5091863517, "num_tokens": 261, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8333246035907933, "lm_q2_score": 0.7606506581031359, "lm_q1q2_score": 0.6338689081348718}}
{"text": "\n# Velocity Calculation for the Robot based on MDH frames\n# Introduction\n# Berechnung der Geschwindigkeit von Koordinatensystemen und Schwerpunkten\n# \n# Dateiname:\n# robot -> Berechnung für allgemeinen Roboter\n# tree -> Berechnung für eine beliebige Baumstruktur (ohne Schleifen)\n# floatb -> floating base wird durch base twist (Geschwindigkeit der Basis) oder vollständige Orientierung (Euler-Winkel) berücksichtigt\n# rotmat -> Kinematik wird mit Rotationsmatrizen berechnet\n# velocity -> Berechnung der Geschwindigkeit aller Segmente\n# worldframe -> Berechnung der Geschwindigkeit im Welt-KS (KSW)\n# par1 -> Parametersatz 1 (Schwerpunkt als Parameter: SX,SY,SZ)\n\n# Authors\n# Moritz Schappler, schappler@irt.uni-hannover.de, 2016-03\n# (C) Institut fuer Regelungstechnik, Leibniz Universitaet Hannover\n# \n# Sources\n# [GautierKhalil1990] Direct Calculation of Minimum Set of Inertial Parameters of Serial Robots\n# [KhalilDombre2002] Modeling, Identification and Control of Robots\n# [Ortmaier2014] Vorlesungsskript Robotik I (WS 2014/15)\n# [Ott2008] Cartesian Impedance Control of Redundant and Flexible-Joint Robots\n# Initialization\ninterface(warnlevel=0): # Unterdrücke die folgende Warnung.\nrestart: # Gibt eine Warnung, wenn über Terminal-Maple mit read gestartet wird.\ninterface(warnlevel=3):\nwith(LinearAlgebra):\nwith(ArrayTools):\nwith(codegen):\nwith(CodeGeneration):\nwith(StringTools):\ncodegen_act := true:\ncodegen_opt := 2:\nread \"../helper/proc_convert_s_t\":\nread \"../helper/proc_convert_t_s\": \nread \"../helper/proc_MatlabExport\":\nread \"../helper/proc_simplify2\":\nread \"../transformation/proc_rotx\": \nread \"../transformation/proc_roty\": \nread \"../transformation/proc_rotz\": \nread \"../transformation/proc_trotx\": \nread \"../transformation/proc_troty\": \nread \"../transformation/proc_trotz\": \nread \"../transformation/proc_transl\": \nread \"../transformation/proc_trafo_mdh\": \nread \"../robot_codegen_definitions/robot_env\":\nprintf(\"%s. Generiere Geschwindigkeit für %s (Herleitung im Welt-KS)\\n\", FormatTime(\"%Y-%m-%d %H:%M:%S\"), robot_name):\nread sprintf(\"../codeexport/%s/tmp/tree_floatb_definitions\", robot_name):\nread sprintf(\"../codeexport/%s/tmp/kinematic_constraints_maple_inert.m\", robot_name):  \nkin_constraints_exist := kin_constraints_exist: # nur zum Abschätzen der Komplexität\n;\n# Term-Vereinfachungen einstellen\nif not assigned(simplify_options) or simplify_options(4)=-1 then # Standard-Einstellungen:\n  if not kin_constraints_exist then # normale serielle Ketten und Baumstrukturen\n    use_simplify := 0: # Standardmäßig aus\n  else # mit kinematischen Zwangsbedingungen\n    use_simplify := 1: # standardmäßig simplify-Befehle anwenden\n  end if:\nelse\n  use_simplify := simplify_options(4): # vierter Eintrag ist für Geschwindigkeit\nend if:\n\n# Ergebnisse der Kinematik laden\nread sprintf(\"../codeexport/%s/tmp/kinematics_floatb_%s_rotmat_maple.m\", robot_name, base_method_name):\nTrf := Trf:\nTrf_c := Trf_c:\nread sprintf(\"../codeexport/%s/tmp/kinematics_com_worldframe_floatb_%s_par1_maple.m\", robot_name, base_method_name):\nr_W_W_Si := r_W_W_Si:\nr_W_i_Si := r_W_i_Si:\n# Zeitableitungen der MDH-Drehwinkel laden.\n# Die Berechnung soll nur an einer Stelle erfolgen. Siehe robot_tree_velocity_mdh_angles.mw.\nread sprintf(\"../codeexport/%s/tmp/velocity_mdh_angles_maple.m\", robot_name):\nthetaD := thetaD:\n\n# Calculate Velocities\n# First assume fixed base model with base velocity and acceleration set to zero\n# Anfangsgeschwindigkeit definieren für floating base model\n# Velocities of Frames\n# Anfangsgeschwindigkeit der Basis\n# Analog zu [Ortmaier2014], Gl. (7.6)\n# Geschwindigkeit der Basis der Koordinatensysteme der Körper\nrD_W_i := Matrix(3, NL):\nrD_W_i(1..3,1) := V_base_t(1..3,1):\n# Winkelgeschwindigkeit von Körper i ausgedrückt im KS W\nomega_W_i := Matrix(3, NL):\nif base_method_name = \"twist\" then:\n  omega_W_i(1..3,1) := V_base_t(4..6,1):\nend:\nif base_method_name = \"eulxyz\" then:\n  omega_W_i(1..3,1) := T_basevel . V_base_t(4..6,1):\nend:\nprintf(\"%s. Nutze die Methode %s für die Basis-Drehgeschwindigkeit\\n\", FormatTime(\"%Y-%m-%d %H:%M:%S\"), base_method_name):\n# Erhöhe die Geschwindigkeit jedes Körpers\n# Betrachte dazu nur die durch Gelenke angetriebenen Körper, nicht die Basis\nfor i from 1 to NJ do # Gelenke durchgehen\n  # Körper der von Gelenkwinkel i bewegt wird: Index i+1\n  # Vorgängerkörper bestimmen\n  j := v(i) + 1:\n  if sigma(i) = 0 then # Drehgelenk\n    # Geschwindigkeit des Vorgängers; Trf_c(...,i+1) enthält z-Achse des Körperkoordinatensystems, das von qi bewegt wird.\n    # [Ortmaier2014] (7.7) (S.115) (dort falsche Indizes für MDH), [KhalilDombre2002] (9.14)\n    omega_W_i(1 .. 3, i+1) := omega_W_i(1 .. 3, j) + thetaD(i,1)*Trf_c(1 .. 3, 3, i+1):\n  else: # Schubgelenk\n    # [Ortmaier2014] (7.12) (S.116)\n    omega_W_i(1 .. 3, i+1) := omega_W_i(1 .. 3, j):\n  end if:\n  # Terme vereinfachen (Teil 1)\n  if use_simplify=1 then\n    tmp_t11:=time():\n    tmp_l11 := length(omega_W_i(1 .. 3, i+1)):\n    omega_W_i(1 .. 3, i+1) := simplify2(omega_W_i(1 .. 3, i+1)):\n    tmp_l21 := length(omega_W_i(1 .. 3, i+1)):\n    tmp_t21:=time():\n  end if:\n  # Vektor vom Ursprung des vorherigen Koordinatensystems zu diesem KS\n  r_W_im1_i := -Trf_c(1 .. 3, 4, j) + Trf_c(1 .. 3, 4, i+1):\n  if sigma(i) = 0 then # Drehgelenk\n    # [Ortmaier2014] (7.10) (S.115), [KhalilDombre2002] (9.15)\n    rD_W_i(1 .. 3, i+1) := rD_W_i(1 .. 3, j) + CrossProduct(omega_W_i(1 .. 3, j), r_W_im1_i):\n  else: # Schubgelenk\n    # [Ortmaier2014] (7.15) (S.116), [KhalilDombre2002] (9.15)\n    rD_W_i(1 .. 3, i+1) := rD_W_i(1 .. 3, j) + CrossProduct(omega_W_i(1 .. 3, j), r_W_im1_i) + dD(i,1)*Trf_c(1 .. 3, 3, i+1):\n  end if:\n  printf(\"%s. Geschwindigkeit für Körperkoordinatensystem %d aufgestellt (Herleitung im Welt-KS).\\n\",\\\n    FormatTime(\"%Y-%m-%d %H:%M:%S\"), i-1):#0=Basis\n  # Terme vereinfachen (Teil 2)\n  if use_simplify=1 then\n    tmp_t12:=time():\n    tmp_l12 := length(rD_W_i(1 .. 3, i+1)):\n    rD_W_i(1 .. 3, i+1) := simplify2(rD_W_i(1 .. 3, i+1)):\n    tmp_l22 := length(rD_W_i(1 .. 3, i+1)):\n    tmp_t22:=time():\n    printf(\"%s: Terme für Geschwindigkeiten vereinfacht. Länge: %d->%d / %d->%d. Rechenzeit %1.1fs und %1.1fs.\\n\", \\\n      FormatTime(\"%Y-%m-%d %H:%M:%S\"), tmp_l11, tmp_l21, tmp_l12, tmp_l22, tmp_t21-tmp_t11, tmp_t22-tmp_t12):\n  end if:\nend do:\n# Velocities of Center of Mass\n# \nrD_W_Si := Matrix(3, NL):\nfor i to NL do\n  # [Ortmaier2014] (7.17) (S.118), [KhalilDombre2002] (9.15)\n  rD_W_Si(1 .. 3, i) := Matrix(rD_W_i(1 .. 3, i)) + Matrix(CrossProduct(omega_W_i(1 .. 3, i), r_W_i_Si(1 .. 3, i))):\n  printf(\"%s. Geschwindigkeit für Körperschwerpunkt %d aufgestellt.\\n\", FormatTime(\"%Y-%m-%d %H:%M:%S\"), i-1):#0=Basis\n  if use_simplify=1 then\n    tmp_t1:=time():\n    tmp_l1 := length(rD_W_Si(1 .. 3, i)):\n    rD_W_Si(1 .. 3, i) := simplify2(rD_W_Si(1 .. 3, i)):\n    tmp_l2 := length(rD_W_Si(1 .. 3, i)):\n    tmp_t2:=time():\n    printf(\"%s: Terme für Schwerpunkts-Geschwindigkeiten vereinfacht. Länge: %d->%d. Rechenzeit %1.1fs.\\n\", \\\n      FormatTime(\"%Y-%m-%d %H:%M:%S\"), tmp_l1, tmp_l2, tmp_t2-tmp_t1):\n  end if:\nend do:\n\n# Exportieren\n# Basis-Position aus Termen entfernen. Die Basis-Position kann keinen Einfluss auf die Geschwindigkeiten der einzelnen Körper haben.\n# Bei manchen komplexen Systemen scheint der Term aber trotzdem nicht zu verschwinden, da Maple die Vereinfachung nicht erkennt\nfor i from 1 to 3 do\n  omega_W_i := subs({X_base_s[i,1]=0},omega_W_i):\n  rD_W_i := subs({X_base_s[i,1]=0},rD_W_i):\n  rD_W_Si := subs({X_base_s[i,1]=0},rD_W_Si):\nend do:\n# Maple Export\nsave omega_W_i, rD_W_i, rD_W_Si, sprintf(\"../codeexport/%s/tmp/velocity_worldframe_floatbase_%s_par1_maple.m\", robot_name, base_method_name):\nprintf(\"%s. Maple-Ausdrücke exportiert.\\n\", FormatTime(\"%Y-%m-%d %H:%M:%S\")):\n# Matlab Export\nif codegen_act then\n  MatlabExport(convert_t_s(omega_W_i), sprintf(\"../codeexport/%s/tmp/velocity_omegai0_floatb_%s_worldframe_matlab.m\", robot_name, base_method_name), codegen_opt):\n  MatlabExport(convert_t_s(rD_W_i), sprintf(\"../codeexport/%s/tmp/velocity_rDi0_floatb_%s_worldframe_matlab.m\", robot_name, base_method_name), codegen_opt):\n  MatlabExport(convert_t_s(rD_W_Si), sprintf(\"../codeexport/%s/tmp/velocity_rDSi0_floatb_%s_worldframe_par1_matlab.m\", robot_name, base_method_name), codegen_opt):\n  printf(\"Geschwindigkeiten in Matlab exportiert. %s\\n\", FormatTime(\"%Y-%m-%d %H:%M:%S\")):\nend if:\n\n\n", "meta": {"hexsha": "7190f14091907208e496df083cd93ec463bb56ce", "size": 8346, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "robot_codegen_kinematics/robot_tree_floatb_rotmat_velocity_worldframe_par1.mpl", "max_stars_repo_name": "SchapplM/robsynth-modelgen", "max_stars_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 2, "max_stars_repo_stars_event_min_datetime": "2020-05-25T07:31:46.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-15T09:54:50.000Z", "max_issues_repo_path": "robot_codegen_kinematics/robot_tree_floatb_rotmat_velocity_worldframe_par1.mpl", "max_issues_repo_name": "SchapplM/robsynth-modelgen", "max_issues_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "robot_codegen_kinematics/robot_tree_floatb_rotmat_velocity_worldframe_par1.mpl", "max_forks_repo_name": "SchapplM/robsynth-modelgen", "max_forks_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 47.4204545455, "max_line_length": 163, "alphanum_fraction": 0.7172298107, "num_tokens": 2927, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9019206712569267, "lm_q2_score": 0.7025300698514777, "lm_q1q2_score": 0.6336263921786204}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_mgga_x *)\n\nmalpha  := 0.00186726:\ncoeff_d := [-9.800683e-01, -3.556788e-03, 6.250326e-03, -2.354518e-05, -1.282732e-04, 3.574822e-04]:\n\n$include \"gvt4.mpl\"\n\nf := (rs, x, t, u) -> -gtv4(malpha, coeff_d, x, 2*(t - K_FACTOR_C))/X_FACTOR_C:\n", "meta": {"hexsha": "e22092c77e9313953ed7c6f4cd707d33ea89d9d3", "size": 490, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/mgga_x_gvt4.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/mgga_x_gvt4.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/mgga_x_gvt4.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 28.8235294118, "max_line_length": 100, "alphanum_fraction": 0.6653061224, "num_tokens": 192, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9059898127684335, "lm_q2_score": 0.6992544335934766, "lm_q1q2_score": 0.6335173933688509}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\nherman_c1 := 0.003:\n\nherman_f := x -> 1 + herman_c1/X_FACTOR_C * x^2:\n\nf := (rs, zeta, xt, xs0, xs1) -> gga_exchange(herman_f, rs, zeta, xs0, xs1):\n", "meta": {"hexsha": "017a80f157f5204f3bfa8d5125de490bd944e9b7", "size": 408, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_herman.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_herman.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_herman.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 25.5, "max_line_length": 76, "alphanum_fraction": 0.6642156863, "num_tokens": 143, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8933094060543488, "lm_q2_score": 0.709019146082187, "lm_q1q2_score": 0.63337347226784}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_x_ft97_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_x_ft97_params * )(p->params);\n*)\n\nft97_beta := (rs, z, xs) -> params_a_beta0\n  + params_a_beta1*sigma_spin(rs, z, xs)/(params_a_beta2 + sigma_spin(rs, z, xs)):\n\nft97_fx := (rs, z, xs) -> 1 + ft97_beta(rs, z, xs)*xs^2 /\n  (X_FACTOR_C*sqrt(1 + 9*xs^2*ft97_beta(rs, z, xs)^2*arcsinh(xs^2)^2)):\n\nf := (rs, zeta, xt, xs0, xs1) -> gga_exchange_nsp(ft97_fx, rs, zeta, xs0, xs1):\n", "meta": {"hexsha": "88362e1bdc41d92b80992b956c1d70c2e11bfaad", "size": 717, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_ft97.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_ft97.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_ft97.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 29.875, "max_line_length": 82, "alphanum_fraction": 0.6513249651, "num_tokens": 262, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9219218305645894, "lm_q2_score": 0.6859494550081925, "lm_q1q2_score": 0.6323917772359353}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\nbayesian_theta0 := 1.0008:\nbayesian_theta1 := 0.1926:\nbayesian_theta2 := 1.8962:\n\nbayesian_f0 := s -> s^2/(1 + s)^2:\nbayesian_f  := x -> bayesian_theta0 + bayesian_f0(X2S*x)* (bayesian_theta1 + bayesian_f0(X2S*x) * bayesian_theta2):\n\nf := (rs, zeta, xt, xs0, xs1) -> gga_exchange(bayesian_f, rs, zeta, xs0, xs1):\n", "meta": {"hexsha": "65e36606f6abf6e5dcc8d372db1b60027a362d18", "size": 573, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_bayesian.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_bayesian.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_bayesian.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 30.1578947368, "max_line_length": 115, "alphanum_fraction": 0.6841186736, "num_tokens": 204, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9207896715436482, "lm_q2_score": 0.6859494485880928, "lm_q1q2_score": 0.6316151674609766}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_gga_x *)\n\na1 := 1.647127:\na2 := 0.980118: \na3 := 0.017399: \nb1 := 1.523671: \nb2 := 0.367229: \nb3 := 0.011282:\n\nf0 := s -> (1 + a1*s^2 + a2*s^4 + a3*s^6)/(1 + b1*s^2 + b2*s^4 + b3*s^6):\nf  := x -> f0(X2S*x):", "meta": {"hexsha": "dd90f04dfb720738c95daee99220bb50b59cf2fa", "size": 459, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/gga_x_eg93.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/gga_x_eg93.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/gga_x_eg93.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 24.1578947368, "max_line_length": 73, "alphanum_fraction": 0.5969498911, "num_tokens": 193, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.9273632956467157, "lm_q2_score": 0.679178692681616, "lm_q1q2_score": 0.6298453907782513}}
{"text": "######################################################################\n# triples(A) is the set of all distinct triples (a,b,c) in A^3\n\n`is_element/triples` := (A::set) -> proc(abc)\n type(abc,list) and nops(abc) = 3 and\n member(abc[1],A) and member(abc[2],A) and member(abc[3],A) and\n abc[1] <> abc[2] and abc[1] <> abc[3] and abc[2] <> abc[3];\nend;\n\n`is_equal/triples` := (A::set) -> (abc,def) -> evalb(abc = def):\n\n`is_leq/triples` := NULL;\n\n`random_element/triples` := (A::set) -> proc()\n local n,r,i,j,k,abc;\n n := nops(A);\n\n if n < 3 then return FAIL; fi;\n\n abc := [];\n\n while nops({op(abc)}) < 3 do \n  i := rand(1..n)(); \n  j := rand(1..n)();\n  k := rand(1..n)();\n  abc := [A[i],A[j],A[k]];\n od;\n\n return abc;\nend;\n\n`list_elements/triples` := proc(A::set)\n local n,L,i,j,k;\n\n n := nops(A);\n L := NULL;\n\n for i from 1 to n do \n  for j from 1 to n do \n   for k from 1 to n do \n    if i <> j and i <> k and j <> k then\n     L := L,[A[i],A[j],A[k]];\n    fi;\n   od;\n  od;\n od;\n\n return [L];\nend:\n\n`count_elements/triples` := (A::set) ->\n nops(A) * (nops(A) - 1) * (nops(A) - 2);\n ", "meta": {"hexsha": "44afd0338cee2b07d9d0bd59bfd39b4b8d4b8f46", "size": 1080, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/triples.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/triples.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/triples.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 20.3773584906, "max_line_length": 70, "alphanum_fraction": 0.4935185185, "num_tokens": 399, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8244619263765706, "lm_q2_score": 0.7634837527911056, "lm_q1q2_score": 0.6294632855833683}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\ncac  := 1.467:\nmtau := 4.5:\nbcgp_pt := t -> t*sqrt((mtau + t)/(mtau + cac*t)):\narg := 0.5:\ncrg := 0.16667:\ndrg := 0.29633:\nfbeta_modRasoltGeldart := rs -> (1.0 + arg*rs*(1+crg*rs)) / (1.0 + arg*rs*(1+drg*rs)):\n\n$define gga_c_pbe_params\n$include \"gga_c_pbe.mpl\"\n\n(* override definition of tp *)\ntp := (rs, z, xt) -> bcgp_pt(tt(rs, z, xt)):\n\n(* override definition of mbeta *)\nmbeta := (rs, t) -> params_a_beta*fbeta_modRasoltGeldart(rs):\n", "meta": {"hexsha": "331218723058697199039711419c8da9986d662e", "size": 697, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_acggap.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_acggap.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_acggap.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 25.8148148148, "max_line_length": 86, "alphanum_fraction": 0.6398852224, "num_tokens": 260, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9086178969328286, "lm_q2_score": 0.6926419831347361, "lm_q1q2_score": 0.6293469020432677}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_c_zpbeint_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_c_zpbeint_params * )(p->params);\n*)\n\nparams_a_gamma := (1 - log(2))/Pi^2:\nparams_a_BB    := 1:\n$include \"gga_c_pbe.mpl\"\n\nff := (z, t) -> mphi(z)^(params_a_alpha*t^3):\n\nf  := (rs, z, xt, xs0, xs1) ->\n  f_pw(rs, z) + ff(z, tp(rs, z, xt))*fH(rs, z, tp(rs, z, xt)):\n", "meta": {"hexsha": "745c9c3a7c3f9b058e3bfbbb89c2e280f7d4fa83", "size": 610, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_zpbeint.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_zpbeint.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_zpbeint.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 24.4, "max_line_length": 68, "alphanum_fraction": 0.6245901639, "num_tokens": 220, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.921921841290738, "lm_q2_score": 0.6825737279551493, "lm_q1q2_score": 0.6292796280930945}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_mgga_c *)\n(* prefix:\n  mgga_x_mn12_params *params;\n\n  assert(p->params != NULL);\n  params = (mgga_x_mn12_params * ) (p->params);\n*)\n\n$define lda_x_params\n$include \"lda_x.mpl\"\n\nomega_x := 2.5:\ngamma_x := 0.004:\n\nvx := (rs, z) -> 1/(1 + rs/(omega_x*RS_FACTOR)*(2/(1 + z))^(1/3)):\nux := x -> gamma_x*x^2/(1 + gamma_x*x^2):\nwx := t -> (K_FACTOR_C - t)/(K_FACTOR_C + t):\n\npol1  := t-> params_a_c[ 1] + params_a_c[ 2]*wx(t) + params_a_c[ 3]*wx(t)^2 + params_a_c[ 4]*wx(t)^3\n  + params_a_c[ 5]*wx(t)^4 + params_a_c[ 6]*wx(t)^5:\npol2  := t-> params_a_c[ 7] + params_a_c[ 8]*wx(t) + params_a_c[ 9]*wx(t)^2 + params_a_c[10]*wx(t)^3\n   + params_a_c[11]*wx(t)^4:\npol3  := t-> params_a_c[12] + params_a_c[13]*wx(t) + params_a_c[14]*wx(t)^2 + params_a_c[15]*wx(t)^3:\npol4  := t-> params_a_c[16] + params_a_c[17]*wx(t) + params_a_c[18]*wx(t)^2:\npol5  := t-> params_a_c[19] + params_a_c[20]*wx(t) + params_a_c[21]*wx(t)^2 + params_a_c[22]*wx(t)^3\n   + params_a_c[23]*wx(t)^4:\npol6  := t-> params_a_c[24] + params_a_c[25]*wx(t) + params_a_c[26]*wx(t)^2 + params_a_c[27]*wx(t)^3:\npol7  := t-> params_a_c[28] + params_a_c[29]*wx(t) + params_a_c[30]*wx(t)^2:\npol8  := t-> params_a_c[31] + params_a_c[32]*wx(t) + params_a_c[33]*wx(t)^2 + params_a_c[34]*wx(t)^3:\npol9  := t-> params_a_c[35] + params_a_c[36]*wx(t) + params_a_c[37]*wx(t)^2:\npol10 := t-> params_a_c[38] + params_a_c[39]*wx(t) + params_a_c[40]*wx(t)^2:\n\nFMN12 := (rs, z, x, t) ->\n  + pol1(t)\n  + pol2(t)*ux(x)\n  + pol3(t)*ux(x)^2\n  + pol4(t)*ux(x)^3\n  + pol5(t)*vx(rs, z)\n  + pol6(t)*ux(x)*vx(rs, z)\n  + pol7(t)*ux(x)^2*vx(rs, z)\n  + pol8(t)*vx(rs, z)^2\n  + pol9(t)*ux(x)*vx(rs, z)^2\n  + pol10(t)*vx(rs, z)^3:\n\nf_spin := (rs, z, x, t) ->\n  lda_x_ax*(1 + z)^(4/3)/rs*FMN12(rs, z, x, t):\n\nf_mn12 := (rs, z, xt, xs0, xs1, ts0, ts1) ->\n  f_spin(rs, z, xs0, ts0) + f_spin(rs, -z, xs1, ts1):\n\nf := (rs, z, xt, xs0, xs1, ts0, ts1, us0, us1) ->\n  f_mn12(rs, z, xt, xs0, xs1, ts0, ts1):\n", "meta": {"hexsha": "7f76440476ec81ae237be626214ceda19c39299f", "size": 2173, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/mgga_x_mn12.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/mgga_x_mn12.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/mgga_x_mn12.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 35.6229508197, "max_line_length": 101, "alphanum_fraction": 0.5862862402, "num_tokens": 957, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9173026528034426, "lm_q2_score": 0.6859494614282923, "lm_q1q2_score": 0.6292232606572652}}
{"text": "(*\n\n区间对象\n实现运算：\n    + 交集\n    + 并集\n    + 补集\n    + 子集\n实现了三种初始化方法：\n    + 不等式集合\n    + RealRange表达式\n    + 区间的字符串表达形式\n导出了辅助RealRange计算的两个函数\n\n*)\n$ifndef _SEG_\n$define _SEG_\n\nSeg:=module()\n    option object;\n    export\n            # 运算符，优先级从高到低\n            ## 逻辑版本\n            `not`::static,          # 区间补集\n            `and`::static,          # 区间交集\n            `or`::static,           # 区间并集\n            `xor`::static,          # 区间差集\n            `implies`::static,      # 区间子集\n            ## 集合版本\n            `&C`::static,           # 区间补集\n            `intersect`::static,    # 区间交集\n            `union`::static,        # 区间并集\n            `minus`::static,        # 区间差集\n            `subset`::static,       # 区间属于\n\n            # 属性\n            bound:=real,            # 对应的 RealRange 对象\n\n            # 导出工具函数\n            formatRange::static,    # 将RealRange转化为区间表示形式\n            evalRange::static;      # RealRange彻底求值\n    local   \n            # 初始化\n            ModuleApply::static,    # 初始化\n            conBuild::static,       # 使用约束集合初始化\n            rangeBuild::static,     # 使用 RealRange 初始化\n            con2range::static,      # 约束转化为 RealRange 对象\n            strBuild::static,       # 使用字符串初始化\n            exprOutput::static,     # 字符串解析辅助函数\n            # 输出\n            ModulePrint::static,    # 输出\n            range2str::static,      # RealRange 对象转化为字符串\n            sortOps::static,        # 输出时按左值排序\n            leftBound::static,      # 获取 RealRange 左端值,用于排序\n            # 计算\n            expandRange::static,    # 化简 RealRange 对象\n            subsRange::static,      # 替换Range表达式中的集合对象和Non表达式\n            rangeNot::static;       # RealRange 对象取补集\n\n    # 初始化\n    ModuleApply:=proc(x)\n        if type(x,set({`=`,`<`,`<=`,`<>`})) then\n            return conBuild(x);\n        elif type(x,string) then\n            return strBuild(x);\n        else\n            return rangeBuild(x);\n        end if;\n    end proc:\n\n    # 使用约束集合初始化\n    conBuild:=proc(cons::set({`=`,`<`,`<=`,`<>`}))\n        if numelems(indets(cons,name))<>1 \n        or ormap(x->numelems(indets(cons,name))<>1,cons) then\n            error \"每个不等式（等式）都只能使用同一个变量\";\n        end if;\n        return rangeBuild(AndProp(con2range~(cons)[]));\n    end proc:\n\n    # 使用 RealRange 初始化\n    rangeBuild:=proc(r)\n        local this;\n        this:=Object(Seg);\n        this:-bound:=evalRange(r);\n        return this;\n    end proc:\n\n    # 将约束转化为RealRange\n    con2range:=proc(_c::{`=`,`<`,`<=`,`<>`})\n        local c,v;\n        c:=RealDomain:-solve({_c})[];\n        if type(c,`<`) then\n            if type(lhs(c),numeric) then\n                return RealRange(Open(lhs(c)),infinity);\n            else\n                return RealRange(-infinity,Open(rhs(c)));\n            end if;\n        elif type(c,`<=`) then\n            if type(lhs(c),numeric) then\n                return RealRange(lhs(c),infinity);\n            else\n                return RealRange(-infinity,rhs(c));\n            end if;\n        else\n            if type(c,`=`) then\n                return rhs(c);\n            else\n                v:=Open(rhs(c));\n                return OrProp(RealRange(-infinity,v),RealRange(v,infinity));\n            end if;\n        end if;\n    end proc:\n\n    # 交集\n    `and`:=proc()\n        option overload;\n        return rangeBuild(AndProp(map(x->x:-bound,[_passed])[]));\n    end proc:\n    `intersect`:=`and`;\n\n    # 并集\n    `or`:=proc()\n        option overload;\n        return rangeBuild(OrProp(map(x->x:-bound,[_passed])[]));\n    end proc:\n    `union`:=`or`;\n\n    # 补集\n    `not`:=proc(x::Seg,$)\n        option overload;\n        return rangeBuild(rangeNot(x:-bound));\n    end proc:\n    `&C`:=`not`;\n\n    # 差集\n    `xor`:=proc(x::Seg,y::Seg,$)\n        return x and (not y);\n    end proc:\n    `minus`:=`xor`;\n\n    # 子集\n    `subset`:=proc(x::Seg,y::Seg,$)\n        local z;\n        z:=x and y;\n        return evalb(z:-bound=x:-bound);\n    end proc:\n    `implies`:=`subset`;\n\n    # RealRange彻底求值\n    evalRange:=proc(x)\n        return expandRange(subsRange(x));\n    end proc:\n\n    # RealRange补集展开\n    rangeNot:=proc(b)\n        local lv,rv,lb,rb;\n        if b=BottomProp then\n            return RealRange(-infinity,infinity);\n        elif type(b,infinity) then\n            return real;\n        elif type(evalf(b),numeric) then\n            return OrProp(RealRange(-infinity,Open(b)),RealRange(Open(b),infinity));\n        elif b=real then\n            return BottomProp;\n        elif op(0,b)=RealRange then\n            if op([1,0],b)=Open then\n                lv:=op([1,1],b);\n            else\n                lv:=Open(op(1,b));\n            end if;\n            if op([2,0],b)=Open then\n                rv:=op([2,1],b);\n            else\n                rv:=Open(op(2,b));\n            end if;\n            if has(lv,infinity) then\n                lb:=NULL;\n            else\n                lb:=RealRange(-infinity,lv);\n            end if;\n            if has(rv,infinity) then\n                rb:=NULL;\n            else\n                rb:=RealRange(rv,infinity);\n            end if;\n            return OrProp(lb,rb);\n        elif op(0,b)=AndProp then\n            return OrProp(thisproc~([op(b)])[]);\n        elif op(0,b)=OrProp then\n            return AndProp(thisproc~([op(b)])[]);\n        end if;\n    end proc:\n\n    # 把 property 表达式中的集合都替换为 OrProp\n    # 把 Non 展开\n    subsRange:=proc(x)\n        if type(x,set) then\n            return OrProp(op(x));\n        elif op(0,x)=Non then\n            return rangeNot(op(x));\n        elif op(0,x)=AndProp or op(0,x)=OrProp then\n            return op(0,x)(thisproc~([op(x)])[]);\n        else\n            return x;\n        end if;\n    end proc:\n\n    # 展开计算RealRange\n    expandRange:=proc(x)\n        local orv,nxt,rst,tmp;\n        if op(0,x)=AndProp then\n            # 所有的交集操作的返回结果都不应该表示为交集的形式\n            if has([op(x)],OrProp) then\n                # A⋂(B⋃C)=(A⋂B)⋃(A⋂C)\n                orv:=op(1,x);\n                nxt:=op(2,x);\n                rst:=op(3..-1,x);\n                tmp:=OrProp(map(x->AndProp(x,nxt),[op(orv)])[]);\n                tmp:=AndProp(tmp,rst);\n            elif type(op(1,x),extended_numeric) then\n                # 计算 AndProp(x,property)\n                # 因为集合已经被事先展开，所以这里只可能有一个数值对象\n                # 而且经测试，顺序为：numeric < OrProp < RealRange\n                if is(op(1,x),op(2,x)) then\n                    tmp:=op(1,x);\n                else\n                    tmp:=BottomProp;\n                end if;\n            else\n                tmp:=x;\n            end if;\n            return thisproc(tmp);\n        elif op(0,x)=OrProp and has([op(x)],AndProp) then\n        \treturn thisproc(OrProp(thisproc~([op(x)])[]));\n        else\n            return x;\n        end if;\n    end proc:\n\n    # 将RealRange转化为区间表示形式\n    range2str:=proc(b)\n        local lc,lv,rc,rv,bs,r;\n        if b=BottomProp then\n            return \"∅\";\n        elif type(evalf(b),extended_numeric) then\n            return sprintf(\"{%a}\",b);\n        elif b=real then\n            return \"( -∞ , +∞ )\";\n        elif op(0,b)=RealRange then\n            if op([1,0],b)=Open then\n                lc:=\"(\";\n                lv:=op([1,1],b);\n            else\n                lc:=\"[\";\n                lv:=op(1,b);\n            end if;\n            if op([2,0],b)=Open then\n                rc:=\")\";\n                rv:=op([2,1],b);\n            else\n                rc:=\"]\";\n                rv:=op(2,b);\n            end if;\n            if type(lv,infinity) then\n                lv:=\"-∞\";\n                lc:=\"(\";\n            else\n                lv:=convert(lv,string);\n            end if;\n            if type(rv,infinity) then\n                rv:=\"+∞\";\n                rc:=\")\";\n            else\n                rv:=convert(rv,string);\n            end if;\n            return sprintf(\"%s %s , %s %s\",lc,lv,rv,rc);\n        elif op(0,b)=OrProp then\n            bs:=thisproc~(sortOps([op(b)]));\n            r:=cat(map(x->cat(x,\" ⋃ \"),bs)[]);\n            return sprintf(\"< %s >\",r[1..(-length(\" ⋃ \")-1)]);\n        elif op(0,b)=AndProp then\n            bs:=thisproc~(sortOps([op(b)]));\n            r:=cat(map(x->cat(x,\" ⋂ \"),bs)[]);\n            return sprintf(\"< %s >\",r[1..(-length(\" ⋂ \")-1)]);\n        end if;\n    end proc:\n\n    # 用于排序\n    sortOps:=proc(x)\n        return sort(x,key=leftBound);\n    end proc:\n\n    # 区间左值\n    leftBound:=proc(b)\n        if b=BottomProp then\n            return evalf(-infinity);\n        elif type(evalf(b),extended_numeric) then\n            return evalf(b);\n        else\n            return thisproc(op(1,b));\n        end if;\n    end proc:\n\n    # 默认输出\n    ModulePrint:=proc(x::Seg)\n        return formatRange(x:-bound);\n    end proc:\n\n    # 将RealRange转化为区间表示形式\n    formatRange:=proc(x)\n        local r:=range2str(x);\n        if r[1]=\"<\" then\n            r:=r[3..-3];\n        end if;\n        return r;\n    end proc:\n\n    # 根据区间的字符串表达形式初始化\n    strBuild:=proc(_s::string)\n        local r,s,cb,cx,cz,i,n,os,st,md,ed;\n        s:=_s;\n        # 处理无穷和交并符号\n        s:=StringTools:-SubstituteAll(s,\"\\x26\\x69\\x6E\\x66\\x69\\x6E\\x3B\",\"infinity\");\n        s:=StringTools:-SubstituteAll(s,\"\\x26\\x62\\x69\\x67\\x63\\x61\\x70\\x3B\",\"and\");\n        s:=StringTools:-SubstituteAll(s,\"\\x26\\x62\\x69\\x67\\x63\\x75\\x70\\x3B\",\"or\");\n        # 内部默认使用逻辑版本的运算符\n        s:=StringTools:-SubstituteAll(s,\"&C\",\"not\");\n        s:=StringTools:-SubstituteAll(s,\"intersect\",\"and\");\n        s:=StringTools:-SubstituteAll(s,\"union\",\"or\");\n        s:=StringTools:-SubstituteAll(s,\"minus\",\"xor\");\n        s:=StringTools:-SubstituteAll(s,\"subset\",\"implies\");\n        # 解析字符串\n        r:=StringTools:-StringBuffer();\n        n:=length(s);\n        cb:=0;# 区间括号标记\n        cx:=0;# 小括号标记\n        cz:=0;# 中括号标记\n        os:=1;# 未处理的字符串的开始下标\n        st:=0;# 区间开始下标\n        md:=0;# 区间分隔符下标\n        ed:=0;# 区间结束下标\n        for i from 1 to n do\n            if   s[i]=\"(\" then\n                if cx=0 and cb=0 then\n                    cb:=1;\n                    st:=i;\n                else\n                    cx:=cx+1;\n                end if;\n            elif s[i]=\"[\" then\n                if cz=0 and cb=0 then\n                    cb:=1;\n                    st:=i;\n                else\n                    cz:=cz+1;\n                end if;\n            elif s[i]=\",\" and cb=1 and cx=0 and cz=0 then\n            # 这么写保证了只有在其它表达式的()[]匹配的情况下才会将读取的`,`作为区间的分隔符，\n            # 考虑到了其它表达式中出现`,`的可能性。\n                md:=i;\n            elif s[i]=\")\" then\n                if cx=0 and cb=1 then\n                    ed:=i;\n                    cb:=0;\n                    r:-append(exprOutput(s,os,st,md,ed));\n                    os:=i+1;\n                else\n                    cx:=cx-1;\n                end if;\n            elif s[i]=\"]\" then\n                if cz=0 and cb=1 then\n                    ed:=i;\n                    cb:=0;\n                    r:-append(exprOutput(s,os,st,md,ed));\n                    os:=i+1;\n                else\n                    cz:=cz-1;\n                end if;\n            end if;\n        end do;\n        r:-append(s[os..-1]);\n        s:=r:-value();\n        r:-clear();\n        # 处理单点区间\n        s:=StringTools:-RegSubs(\"{(.*)}\"=\"Seg({\\\\1})\",s);\n        # 处理括号\n        s:=StringTools:-SubstituteAll(s,\"<\",\"(\");\n        s:=StringTools:-SubstituteAll(s,\">\",\")\");\n        # 返回结果\n        return eval(subs(Open(infinity)=infinity,Open(-infinity)=-infinity,parse(s)));\n    end proc:\n\n    # 辅助转化区间表达式为Maple表达式\n    exprOutput:=proc(s,os,st,md,ed)\n        local lv,rv,res;\n        if s[st]=\"(\" then\n            lv:=sprintf(\"Open(%s)\",s[(st+1)..(md-1)]);\n        else\n            lv:=s[(st+1)..(md-1)];\n        end if;\n        if s[ed]=\")\" then\n            rv:=sprintf(\"Open(%s)\",s[(md+1)..(ed-1)]);\n        else\n            rv:=s[(md+1)..(ed-1)];\n        end if;\n        res:=sprintf(\"%sSeg(RealRange(%s,%s))\",s[os..(st-1)],lv,rv);\n        return res;\n    end proc:\n\nend module:\n\n$endif", "meta": {"hexsha": "7becf941150e3f011976e96ddf4d5d380e0ea06e", "size": 11780, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "seg/Seg.mpl", "max_stars_repo_name": "yu961549745/InvariantClassify", "max_stars_repo_head_hexsha": "eeb14ca2b39679e5a2da0f23888681ec7e2edd84", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "seg/Seg.mpl", "max_issues_repo_name": "yu961549745/InvariantClassify", "max_issues_repo_head_hexsha": "eeb14ca2b39679e5a2da0f23888681ec7e2edd84", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "seg/Seg.mpl", "max_forks_repo_name": "yu961549745/InvariantClassify", "max_forks_repo_head_hexsha": "eeb14ca2b39679e5a2da0f23888681ec7e2edd84", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 28.5922330097, "max_line_length": 86, "alphanum_fraction": 0.4382852292, "num_tokens": 3667, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.863391617003942, "lm_q2_score": 0.7279754371026367, "lm_q1q2_score": 0.6285278897791969}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\nwc_mu    := 0.2195149727645171:\nwc_c     := (146/2025)*(4/9) - (73/405)*(2/3) + (wc_mu - MU_GE):\nwc_kappa := KAPPA_PBE:\n\nwc_f0_aux := s -> wc_kappa + MU_GE * s^2 + (wc_mu - MU_GE) * s^2 * exp(-s^2) + log(1 + wc_c * s^4):\nwc_f0  := s -> 1 + wc_kappa*(1 - wc_kappa/wc_f0_aux(s)):\nwc_f   := x -> wc_f0(X2S*x):\n\nf := (rs, z, xt, xs0, xs1) -> gga_exchange(wc_f, rs, z, xs0, xs1):\n", "meta": {"hexsha": "e796f155d8e48452d02016c4a311a815d57e64eb", "size": 635, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_wc.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_wc.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_wc.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 31.75, "max_line_length": 99, "alphanum_fraction": 0.6078740157, "num_tokens": 253, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.925229959153748, "lm_q2_score": 0.6791786861878392, "lm_q1q2_score": 0.6283964680796706}}
{"text": "program sample13; { square root }\r\nvar x, high, low, mid, can : integer;\r\nbegin\r\n\twriteln('Input x for calculating root x');\r\n\treadln(x);\r\n\tif x < 0 then begin\r\n\t\twriteln('can not calculate a root of negative number')\r\n\tend\r\n\telse begin\r\n\t\tlow := 0;\r\n\t\thigh := 181;\r\n\t\twhile (high - low) >= 2 do begin\r\n\t\t\tmid := (high + low) div 2;\r\n\t\t\tcan := mid * mid;\r\n\t\t\tif x < can then high := mid\r\n\t\t\telse if can < x then low := mid\r\n\t\t\telse begin\r\n\t\t\t\thigh := mid;\r\n\t\t\t\tlow := mid\r\n\t\t\tend\r\n\t\tend;\r\n\t\tif high = low then writeln('root ', x, ' = ', low)\r\n\t\telse if (high * high - x) > (x - low * low) then\r\n\t\t\twriteln('root ', x, ' = ', low)\r\n\t\telse writeln('root ', x, ' = ', high)\r\n\tend\r\nend.\r\n\t\t\t\t\r\n", "meta": {"hexsha": "ce575992302aa6ecef00ef6d6bee652fce3a32a4", "size": 690, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "data/sample13.mpl", "max_stars_repo_name": "naru380/SoftwareExperience5", "max_stars_repo_head_hexsha": "89020bf73d9fc6b58f8d564c7aaed52a0e02f371", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2022-02-10T01:27:36.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-10T01:27:36.000Z", "max_issues_repo_path": "task1_sample/sample13.mpl", "max_issues_repo_name": "shouth/LanguageProcessing", "max_issues_repo_head_hexsha": "7d4f751b5babb97857310990e746740f884fa5e5", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": 14, "max_issues_repo_issues_event_min_datetime": "2020-10-04T11:15:32.000Z", "max_issues_repo_issues_event_max_datetime": "2021-01-20T02:11:14.000Z", "max_forks_repo_path": "samples/program1/sample13.mpl", "max_forks_repo_name": "Hiroya-W/lang-processing", "max_forks_repo_head_hexsha": "c93ef2d5757e560c4df2335f07ac25552750140c", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 23.7931034483, "max_line_length": 57, "alphanum_fraction": 0.5434782609, "num_tokens": 221, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8418256551882383, "lm_q2_score": 0.7461389873857264, "lm_q1q2_score": 0.6281189419174777}}
{"text": "# Given elements a[i] in A we have elements 1 - a[i] in the group ring.\n# The tensor product of these is represented by `bar/BA`(a[1],...,a[n])\n\n`bar/BA` := proc ()\n local i;\n for i to nargs do\n  if args[i] = 1 then return 0 fi;\n od;\n return '`bar/BA`'(args);\nend:\n\n# The standard differential in the bar complex is `d/BA`\n\n`d/BA` := (u) -> sort(expand(eval(subs(`bar/BA`=`d_bar/BA`,u))));\n\n`d_bar/BA` := proc()\n local n,i,q;\n n := nargs;\n if n = 0 then\n  return 0;\n else \n  return -`bar/BA`(args[2..n]) + \n         (-1)^(n+1)*`bar/BA`(args[1..n-1]) +\n         add((-1)^(i+1)*`bar/BA`(args[1..i-1],args[i]*args[i+1],args[i+2..n]),\n             i=1..n-1);\n fi;\nend:\n\n# The shuffle product in the bar complex is `mu/BA`\n\n`mu/BA` := proc()\n apply_linear_assoc(`mu_aux0/BA`,`bar/BA`())(args);\nend:\n\n`mu_aux0/BA` := proc(u,v)\n local r,s,i,ii,j;\n r := nops(u);\n s := nops(v);\n if r = 0 then return v; fi;\n if s = 0 then return u; fi;\n ii := [seq([i],i=1..r+s)];\n for i from 2 to r do\n  ii := map(`ext/BA`,ii,r+s);\n od;\n return add(`mu_aux1/BA`(u,v,ii[j]),j=1..nops(ii));\nend:\n\n`ext/BA` := proc (i, r)\n local j;\n seq([op(i), j], j = i[nops(i)]+1 .. r);\nend:\n\n`mu_aux1/BA` := proc (u, v, i)\n local r,s,q,j,k,m;\n r := nops(u);\n s := nops(v);\n q := [EMPTY$r+s];\n for j to r do\n  q[i[j]] := op(j, u)\n od;\n k := 1;\n for j to r+s do\n  if q[j] = EMPTY then\n   q[j] := op(k, v);\n   k := k+1;\n  fi;\n od;\n m := `+`(op(i))-(1/2)*r*(r+1);\n return (-1)^m*`bar/BA`(op(q))\nend:\n\n`mu_bar/BA` := proc()\n `mu/BA`(op(map(`bar/BA`,[args])));\nend:\n\n######################################################################\n# The element u = `tau/BA`(n,a) has du = n[a] - [a^n].\n# Thus, if a^n = 1 then u is a 2-cycle modulo n.\n\n`tau/BA` := proc(n,a)\n local k;\n add(-`bar/BA`(a^k,a),k=0..n-1);\nend:\n\n`zeta/BA` := proc(n,m,a)\n local i,j;\n - add(add(`bar/BA`(a^(m*i),a^j,a),j=0..m-1),i=0..n-1);\nend:\n\n# The element `sigma/BA`(n,a,b) is a chain of dimension 3.\n# It is symmetric in a and b, and is a cycle if a^n = b^n = 1.\n\n`sigma/BA` := proc(n,a,b)\n `mu/BA`(`tau/BA`(n, a), `bar/BA`(b)) +\n `mu/BA`(`tau/BA`(n, b), `bar/BA`(a))\nend:\n\n# The element u = `gamma/BA`(n,a) is a chain of dimension 2n+1.\n# It is a cycle if a^n = 1.\n\n`gamma/BA` := proc(n,k,a)\n local u,v,i;\n u := `bar/BA`(a);\n v := `tau/BA`(n,a);\n for i from 1 to k do\n  u := `mu/BA`(u,v);\n od;\n u := expand(u/k!);\n return u;\nend:\n\n`rho/BA` := proc(n,a,b)\n `tau/BA`(n,a) +\n `tau/BA`(n,b) -\n `tau/BA`(n,a*b) +\n n*`bar/BA`(a, b);\nend:\n\n`omega/BA` := proc (n,a,b)\n local i,j;\n -add(add(`bar/BA`(a^i*b^j,b,a), j = i .. n-1), i = 0 .. n-1) +\n  add(add(`bar/BA`(a^i*b^j,a,b), j = i+1 .. n-1), i = 0 .. n-2);\nend:\n\n######################################################################\n# We now introduce the standard DGA for H_*(BZ/n).\n\n# The k'th chain group is freely generated over Z[Z/n] by\n# `e/EC`(n,k,0).  The orbit of this consists of elements `e/EC`(n,k,i).\n\n`e/EC` := proc(n::posint,k::nonnegint,i::nonnegint)\n '`e/EC`'(n,k,modp(i,n));\nend:\n\n`de/EC` := proc(n::posint,k::nonnegint,i::nonnegint)\n local j;\n if k = 0 then\n  return 0;\n elif modp(k,2) = 0 then\n  return(add(`e/EC`(n,k-1,j),j=0..n-1));\n else\n  return `e/EC`(n,k-1,modp(i+1,n)) - `e/EC`(n,k-1,i);\n fi;\nend:\n\n`d/EC` := (u) -> eval(subs(`e/EC` = `de/EC`,u));\n\n`mu/EC` := proc(a,b)\n local xx,ca,cb,pa,pb,na,nb,ka,kb,la,lb,ia,ib;\n if nargs > 2 then\n  return `mu/EC`(`mu/EC`(a,b),args[3..-1]);\n fi;\n if type(a,numeric) or type(b,numeric) then\n  return expand(a*b);\n elif type(a,`+`) then\n  return map(`mu/EC`,a,b);\n elif type(b,`+`) then\n  return map2(`mu/EC`,a,b);\n fi;\n if type(a,`*`) then \n  xx := selectremove(type,a,numeric);\n  ca := xx[1];\n  pa := xx[2];\n else\n  ca := 1;\n  pa := a;\n fi;\n if type(b,`*`) then \n  xx := selectremove(type,b,numeric);\n  cb := xx[1];\n  pb := xx[2];\n else\n  cb := 1;\n  pb := b;\n fi;\n if type(pa,specfunc(anything,`e/EC`)) and\n    type(pb,specfunc(anything,`e/EC`)) then\n  na,ka,ia := op(pa);\n  nb,kb,ib := op(pb);\n  if nb <> na then return FAIL; fi;\n  if modp(ka,2) = 1 and modp(kb,2) = 1 then\n   return 0;\n  fi;\n  la := floor(ka/2);\n  lb := floor(kb/2);\n  return ca * cb * binomial(la+lb,la) * `e/EC`(na,ka+kb,modp(ia+ib,na));\n else\n  return('`mu/EC`'(args))\n fi;\nend:\n\n##################################################\n\n`e/BC` := proc(n::posint,k::nonnegint)\n '`e/BC`'(n,k);\nend:\n\n`de/BC` := proc(n::posint,k::nonnegint)\n if k = 0 or modp(k,2) = 1 then\n  return 0;\n else\n  return n * `e/BC`(n,k-1);\n fi;\nend:\n\n`d/BC` := (u) -> eval(subs(`e/BC` = `de/BC`,u));\n\n`mu/BC` := proc(a,b)\n local xx,ca,cb,pa,pb,na,nb,ka,kb,la,lb,ia,ib;\n if nargs > 2 then\n  return `mu/BC`(`mu/BA`(a,b),args[3..-1]);\n fi;\n if type(a,numeric) or type(b,numeric) then\n  return expand(a*b);\n elif type(a,`+`) then\n  return map(`mu/BC`,a,b);\n elif type(b,`+`) then\n  return map2(`mu/BC`,a,b);\n fi;\n if type(a,`*`) then \n  xx := selectremove(type,a,numeric);\n  ca := xx[1];\n  pa := xx[2];\n else\n  ca := 1;\n  pa := a;\n fi;\n if type(b,`*`) then \n  xx := selectremove(type,b,numeric);\n  cb := xx[1];\n  pb := xx[2];\n else\n  cb := 1;\n  pb := b;\n fi;\n if type(pa,specfunc(anything,`e/BC`)) and\n    type(pb,specfunc(anything,`e/BC`)) then\n  na,ka := op(pa);\n  nb,kb := op(pb);\n  if nb <> na then return FAIL; fi;\n  if modp(ka,2) = 1 and modp(kb,2) = 1 then\n   return 0;\n  fi;\n  la := floor(ka/2);\n  lb := floor(kb/2);\n  return ca * cb * binomial(la+lb,la) * `e/BC`(na,ka+kb);\n else\n  return('`mu/BC`'(args))\n fi;\nend:\n\n`e/BC/BA` := proc(n::posint,k::nonnegint)\n option remember;\n\n if k = 0 then\n  return `bar/BA`();\n elif k = 1 then\n  return `bar/BA`(a);\n else\n  return expand(`mu/BA`(`tau/BA`(n,a),`e/BC/BA`(n,k-2))/floor(k/2));\n fi;\nend:\n\n`phi/BC/BA` := proc(u)\n eval(subs(`e/BC` = `e/BC/BA`,u));\nend:\n\n######################################################################\n\ncheck_abelian_group_homology := proc()\n local i,j,k,n,m,a,b,c,t,u,v,w,T,ok,err,exp_rel,diff_rel;\n\n ok := true;\n for i from 0 to 4 do\n  for j from 0 to 4 do \n   u := `bar/BA`(seq(a[m],m=1..i)); \n   v := `bar/BA`(seq(a[m],m=i+1..i+j));\n   err := `mu/BA`(u,v) - (-1)^(i*j) * `mu/BA`(v,u);\n   if err <> 0 then\n    ok := false;\n    break;\n   fi;\n  od:\n  if not(ok) then break; fi;\n od:\n\n _ASSERT(ok,\"`mu/BA` is graded-commutative\");\n\n ok := true;\n for i from 0 to 4 do\n  for j from 0 to 4 do \n   for k from 0 to 4 do \n    u := `bar/BA`(seq(a[m],m=1..i)); \n    v := `bar/BA`(seq(a[m],m=i+1..i+j));\n    w := `bar/BA`(seq(a[m],m=i+j+1..i+j+k));\n    err := `mu/BA`(`mu/BA`(u,v),w) - `mu/BA`(u,`mu/BA`(v,w));\n    if err <> 0 then\n     ok := false;\n     break;\n    fi;\n   od:\n   if not(ok) then break; fi;\n  od:\n  if not(ok) then break; fi;\n od:\n\n _ASSERT(ok,\"`mu/BA` is associative\");\n\n n := 5;\n err := `d/BA`(`tau/BA`(n,a)) - n * `bar/BA`(a);\n exp_rel := `bar/BA`(a^n);\n err := err + exp_rel;\n \n _ASSERT(err = 0,\"d(tau_n(a))\");\n\n err := \n  `d/BA`(`mu/BA`(`tau/BA`(n,a),`bar/BA`(b))) - n * `mu_bar/BA`(a,b);\n exp_rel := `mu_bar/BA`(a^n,b); \n err := err + exp_rel;\n\n _ASSERT(err = 0,\"d(tau_n(a) b)\");\n\n _ASSERT(\n  {seq(seq(\n   `tau/BA`(i*j,a) - `tau/BA`(i,a^j) - i * `tau/BA`(j,a) - `d/BA`(`zeta/BA`(i,j,a)),\n  j=1..4),i=1..4)} = {0},\n  \"tau_{ij}(a)\"\n );\n\n err := `d/BA`(`sigma/BA`(n,a,b));\n exp_rel := `mu_bar/BA`(a^n,b) - `mu_bar/BA`(a,b^n);\n err := err + exp_rel;\n\n _ASSERT(err = 0,\"d(sigma_n(a,b))\");\n\n _ASSERT(`sigma/BA`(n,a,b) = `sigma/BA`(n,b,a),\"sigma_n is symmetric\");\n \n err :=\n  `sigma/BA`(n,a,b*c) - `sigma/BA`(n,a,b) - `sigma/BA`(n,a,c) +\n    `mu/BA`(`bar/BA`(a),`rho/BA`(n,b,c));\n diff_rel := - `mu/BA`(`tau/BA`(n,a),`bar/BA`(b,c));\n exp_rel  := - `mu/BA`(`bar/BA`(a^n),`bar/BA`(b,c));\n err := err + `d/BA`(diff_rel) + exp_rel;\n\n _ASSERT(err = 0,\"First formula for sigma_n(a,bc)\");\n\n err := \n  `sigma/BA`(n,a,b*c)-`sigma/BA`(n,a,b)-`sigma/BA`(n,a,c)+\n   binomial(n+1,2)*`mu_bar/BA`(a,b,c);\n   \n diff_rel := -(`mu/BA`(`bar/BA`(a),`omega/BA`(n,b,c))+\n  \t       `mu/BA`(`tau/BA`(n,a),`bar/BA`(b,c)));\n exp_rel := \n  - `mu/BA`(`bar/BA`(a^n),`bar/BA`(b,c)) - \n  add(`bar/BA`(a,b^i,b)-`bar/BA`(a,b^i*c^n,b),i=0..n-1)- \n  add(`bar/BA`(b^i,b,a)-`bar/BA`(b^i*c^n,b,a),i=0..n-1)+\n  add(`bar/BA`(b^i,a,b)-`bar/BA`(b^i*c^n,a,b),i=0..n-1);\n\n err := err + `d/BA`(diff_rel) + exp_rel;\n\n _ASSERT(err = 0,\"Second formula for sigma_n(a,bc)\");\n\n for k from 1 to 5 do\n  err := `d/BA`(`gamma/BA`(n,k,a));\n  T := [[]]:\n  for i from 1 to k-1 do\n   T := [seq(seq([op(t),a,a^j],j=1..n-1),t in T)]:\n  od:\n  exp_rel := (-1)^k*add(`mu/BA`(`bar/BA`(op(t),a),`bar/BA`(a^n)),t in T);\n  err := err + exp_rel;\n  _ASSERT(err = 0,sprintf(\"d(gamma_{n,%d}(u))\",k));\n od:\n\n _ASSERT(simplify(`sigma/BA`(n,a,a) - 2 * `gamma/BA`(n,1,a)) = 0,\n         \"sigma_n(a,a) = 2 gamma_{n,1}(a)\");\n\t \n err := \n  `gamma/BA`(n,1,a*b) - `gamma/BA`(n,1,a) - `gamma/BA`(n,1,b) -\n    `sigma/BA`(n,a,b);\n\n diff_rel :=\n  n*`bar/BA`(a,b,a,b) -\n  `mu/BA`(`bar/BA`(a,b),`tau/BA`(n,a*b)) +\n  `mu/BA`(`omega/BA`(n,a,b),`bar/BA`(a)+`bar/BA`(b));\n  \n exp_rel := \n  add(`bar/BA`(a^i,b,a) - `bar/BA`(a^i*b^5,b,a),i=0..n-1) -\n  add(`bar/BA`(a^i,a,b) - `bar/BA`(a^i*b^5,a,b),i=0..n-1) -\n  add(`bar/BA`(b,a^i,a) - `bar/BA`(b,a^i*b^5,a),i=0..n-1) -\n  add(`bar/BA`(a,a^i,a) - `bar/BA`(a,a^i*b^5,a),i=0..n-1) -\n `mu/BA`(`bar/BA`(a^n*b^n),`bar/BA`(a,b));\n\n err := err + `d/BA`(diff_rel) + exp_rel;\n\n _ASSERT(err = 0,\"gamma_{n,1}(ab)\");\nend:\n\n######################################################################\n\ncheck_cyclic_group_homology := proc()\n local n,ok,u,v,w,ku,kv,kw,err;\n \n n := 5;\n\n ok := true;\n for ku from 0 to 4 do\n  for kv from 0 to 4 do\n   u := `e/BC`(n,ku);\n   v := `e/BC`(n,kv);\n   err := `mu/BC`(u,v) - (-1)^(ku*kv) * `mu/BC`(v,u);\n   if err <> 0 then\n    ok := false;\n    break;\n   fi;\n  od:\n  if not(ok) then break; fi;\n od:\n\n _ASSERT(ok,\"`mu_BC` is graded-commutative\");\n\n ok := true;\n for ku from 0 to 4 do\n  for kv from 0 to 4 do\n   for kw from 0 to 4 do\n    u := `e/BC`(n,ku);\n    v := `e/BC`(n,kv);\n    w := `e/BC`(n,kw);\n    err := `mu/BC`(`mu/BC`(u,v),w) - `mu/BC`(u,`mu/BC`(v,w));\n    if err <> 0 then\n     ok := false;\n     break;\n    fi;\n   od:\n   if not(ok) then break; fi;\n  od:\n od:\n \n _ASSERT(ok,\"`mu_BC` is associative\",[u,v,w,err]);\n\n ok := true;\n for ku from 0 to 4 do\n  for kv from 0 to 4 do\n   u := `e/BC`(n,ku);\n   v := `e/BC`(n,kv);\n   err := `d/BC`(`mu/BC`(u,v)) - `mu/BC`(`d/BC`(u),v) - (-1)^ku * `mu/BC`(u,`d/BC`(v));\n   if err <> 0 then\n    ok := false;\n    break;\n   fi;\n  od:\n  if not(ok) then break; fi;\n od:\n\n _ASSERT(ok,\"Leibniz rule for BC\");\nend:\n", "meta": {"hexsha": "7947e5fb82cebcc062eeb5ef68620240d28d20f9", "size": 10392, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/group_homology.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/group_homology.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/group_homology.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 22.7894736842, "max_line_length": 87, "alphanum_fraction": 0.4996150885, "num_tokens": 4415, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8519528132451417, "lm_q2_score": 0.7371581626286834, "lm_q1q2_score": 0.6280239704581265}}
{"text": "(*\n Copyright (C) 2020 Susi Lehtola\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_c_ccdf_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_c_ccdf_params * )(p->params);\n*)\n\n(* Equation (26) *)\nf_ccdf  := (rs, z, xt, xs0, xs1) ->\n  params_a_c1 / (1 + params_a_c2*n_total(rs)^(-1/3)) * (1 - params_a_c3 / (1 + exp(-params_a_c4*(2^(1/3)*X2S*xt - params_a_c5)))):\n\nf  := (rs, z, xt, xs0, xs1) -> f_ccdf(rs, z, xt, xs0, xs1):\n", "meta": {"hexsha": "8d47d2d3998928a228ea99ef3a040bac98e01a8a", "size": 625, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_ccdf.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_ccdf.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_ccdf.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 28.4090909091, "max_line_length": 130, "alphanum_fraction": 0.6288, "num_tokens": 229, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.905989815306765, "lm_q2_score": 0.6926419894793246, "lm_q1q2_score": 0.6275265881220836}}
{"text": "# Metric for planer symmetry\nNdim_ := 4:\nx1_ := t:\nx2_ := x:\nx3_ := theta:\nx4_ := phi:\ncomplex_ := {}:\ng11_ := -alpha(t,x)^2+a1(t,x)^2*beta(t,x)^2:\ng12_ := a1(t,x)^2*beta(t,x):\ng22_ := a1(t,x)^2:\ng33_ := b1(t,x)^2*x^2:\ng44_ := b1(t,x)^2*x^2*(sin(theta))^2:\n", "meta": {"hexsha": "8b2bfed48768d01e78e1456a5d3492dd237f26e3", "size": 257, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "metrics/spher_4.mpl", "max_stars_repo_name": "rmanak/bssn_spher", "max_stars_repo_head_hexsha": "b91104fd6b9b7cf1ba08e35efd65ff219ab7a5a9", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "metrics/spher_4.mpl", "max_issues_repo_name": "rmanak/bssn_spher", "max_issues_repo_head_hexsha": "b91104fd6b9b7cf1ba08e35efd65ff219ab7a5a9", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "metrics/spher_4.mpl", "max_forks_repo_name": "rmanak/bssn_spher", "max_forks_repo_head_hexsha": "b91104fd6b9b7cf1ba08e35efd65ff219ab7a5a9", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 19.7692307692, "max_line_length": 44, "alphanum_fraction": 0.5369649805, "num_tokens": 125, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.9381240194661945, "lm_q2_score": 0.6688802603710085, "lm_q1q2_score": 0.6274926384008451}}
{"text": "read \"../IdentifiabilityODE.mpl\";\n\nsys := [\ndiff(x1(t), t) = a*x1(t) + b*x1(t) - x2(t)*c*x1(t),\ndiff(x2(t), t) = -a*b*x2(t) + d*x2(t)*x1(t),\ny1(t) = x1(t)\n];\nCodeTools[CPUTime](IdentifiabilityODE(sys, GetParameters(sys)));", "meta": {"hexsha": "5df3a71d7ebd8a0da22b963e9b06f43d5f37623b", "size": 222, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "benchmarking/SIAN/Modified-LV-for-testing.mpl", "max_stars_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_stars_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 42, "max_stars_repo_stars_event_min_datetime": "2021-07-14T14:30:56.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-23T16:49:40.000Z", "max_issues_repo_path": "benchmarking/SIAN/Modified-LV-for-testing.mpl", "max_issues_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_issues_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 25, "max_issues_repo_issues_event_min_datetime": "2021-07-15T21:15:31.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-30T19:50:55.000Z", "max_forks_repo_path": "benchmarking/SIAN/Modified-LV-for-testing.mpl", "max_forks_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_forks_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 4, "max_forks_repo_forks_event_min_datetime": "2021-08-28T14:40:36.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-02T19:21:47.000Z", "avg_line_length": 27.75, "max_line_length": 64, "alphanum_fraction": 0.5855855856, "num_tokens": 92, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.9184802462567087, "lm_q2_score": 0.682573740869499, "lm_q1q2_score": 0.6269304976021802}}
{"text": "with(DifferentialAlgebra):\nring_diff := DifferentialRing(blocks = [[x1, x2], [y1] ], derivations = [t]):\nsys := [\ndiff(x1(t), t) - (a*x1(t) + b*x1(t) - x2(t)*c*x1(t)),\ndiff(x2(t), t) - (-a*b*x2(t) + d*x2(t)*x1(t)),\ny1(t) - (x1(t))\n];\nres := CodeTools[CPUTime](RosenfeldGroebner(sys, ring_diff, singsol=none));", "meta": {"hexsha": "dd56763c085e79a1e4c20f96b0ed74cd353412fc", "size": 309, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "benchmarking/RosenfeldGroebner/Modified-LV-for-testing.mpl", "max_stars_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_stars_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 42, "max_stars_repo_stars_event_min_datetime": "2021-07-14T14:30:56.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-23T16:49:40.000Z", "max_issues_repo_path": "benchmarking/RosenfeldGroebner/Modified-LV-for-testing.mpl", "max_issues_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_issues_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 25, "max_issues_repo_issues_event_min_datetime": "2021-07-15T21:15:31.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-30T19:50:55.000Z", "max_forks_repo_path": "benchmarking/RosenfeldGroebner/Modified-LV-for-testing.mpl", "max_forks_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_forks_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 4, "max_forks_repo_forks_event_min_datetime": "2021-08-28T14:40:36.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-02T19:21:47.000Z", "avg_line_length": 38.625, "max_line_length": 77, "alphanum_fraction": 0.5922330097, "num_tokens": 124, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9230391579526935, "lm_q2_score": 0.6791787056691698, "lm_q1q2_score": 0.6269085405802708}}
{"text": "inputfile := \"AOC4-input.txt\":\n\n# parse input\ninput := subs(\"\"=NULL,StringTools:-Split(\n        FileTools:-Text:-ReadFile(inputfile), \"\\n\\n\")):\nnumbers := [parse(input[1])]: # list of numbers to \"call\"\n# list of bingo boards stored as square lists of lists\nboards := [seq(map(s->map(parse, StringTools:-Split(s)),\n    input[(i-1)*5+2..(i*5+1)]), i=1..ceil( nops(input[2..]) / 5 ))]:\n\n# helper to check for row or column bingos marked with the symbol X\ncheckbingo := b->ormap(r->numboccur(X,r)=5,b) or\n     `or`(seq(numboccur(X,b[..,i])=5,i=1..5)):\n\nanswer1 := -1:\nfor n in numbers while answer1<0 do\n    boards := subs(n=X, boards); # mark all the boards at once\n    for b in boards while answer1<0 do\n        if checkbingo(b) then\n            answer1 := add(subs(X=0,map(op,b)))*n;\n        end if;\n    end do;\nend do:\nanswer1;\n\nfor n in numbers while not checkbingo(boards[1]) do\n    if nops(boards) > 1 then\n        boards := remove(checkbingo, subs(n=X, boards));\n    else\n        boards := subs(n=X, boards);\n        answer2 := add(subs(X=0,map(op,boards[1])))*n;\n    end if;\nend do:\nanswer2;\n", "meta": {"hexsha": "527d07ac4217fd163db4ca96fdff3b4c36d1b0f4", "size": 1097, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "Day4/AOC4-Improved.mpl", "max_stars_repo_name": "johnpmay/AdventOfCode2021", "max_stars_repo_head_hexsha": "b51756bcebea662333072cf518cf040a962ef8b7", "max_stars_repo_licenses": ["CC0-1.0"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2021-12-04T18:24:03.000Z", "max_stars_repo_stars_event_max_datetime": "2021-12-04T18:24:03.000Z", "max_issues_repo_path": "Day4/AOC4-Improved.mpl", "max_issues_repo_name": "johnpmay/AdventOfCode2021", "max_issues_repo_head_hexsha": "b51756bcebea662333072cf518cf040a962ef8b7", "max_issues_repo_licenses": ["CC0-1.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Day4/AOC4-Improved.mpl", "max_forks_repo_name": "johnpmay/AdventOfCode2021", "max_forks_repo_head_hexsha": "b51756bcebea662333072cf518cf040a962ef8b7", "max_forks_repo_licenses": ["CC0-1.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 31.3428571429, "max_line_length": 68, "alphanum_fraction": 0.6098450319, "num_tokens": 355, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8633916099737806, "lm_q2_score": 0.7248702880639791, "lm_q1q2_score": 0.6258469250337171}}
{"text": "cube_complex := proc()\n local T,V,E,F,G0,G1,G,S,r,v,f,i,j,k,s,s1,t,g,eqs,sol;\n\n V := [seq(i,i=1..8)];\n\n T[\"vertices\"] := V;\n\n T[\"short_edges\"] := [\n  [1,2],[1,3],[1,5],[2,4],[2,6],[3,4],[3,7],[4,8],[5,6],[5,7],[6,8],[7,8]\n ];\n\n T[\"long_edges\"] := [[1,4],[1,6],[1,7],[2,8],[3,8],[4,8]];\n \n T[\"edges\"] := sort([op(T[\"short_edges\"]),op(T[\"long_edges\"])]);\n\n T[\"squares\"] := [\n  [1,2,3,4],[1,2,5,6],[1,3,5,7],[2,4,6,8],[3,4,7,8],[5,6,7,8]\n ];\n\n T[\"faces\"] := [\n  [1,2,4],[1,3,4],[1,2,6],[1,5,6],[1,3,7],[1,5,7],\n  [2,4,8],[2,6,8],[3,4,8],[3,7,8],[5,6,8],[5,7,8]\n ];\n\n T[\"max_simplices\"] := T[\"faces\"];\n \n T[\"vertex_index\"]     := make_index(T[\"vertices\"]):\n T[\"short_edge_index\"] := make_index(T[\"short_edges\"]):\n T[\"square_index\"]     := make_index(T[\"squares\"]):\n\n T[\"embedding_dim\"] := 3;\n \n T[\"embedding\"] := table([\n  1 = [-1,-1,-1],\n  2 = [ 1,-1,-1],\n  3 = [-1, 1,-1],\n  4 = [ 1, 1,-1],\n  5 = [-1,-1, 1],\n  6 = [ 1,-1, 1],\n  7 = [-1, 1, 1],\n  8 = [ 1, 1, 1]\n ]);\n\n v := eval(T[\"embedding\"]);\n\n `plot/simplicial_complex`(T);\n\n S := NULL;\n for i from 1 to nops(T[\"squares\"]) do\n  f := T[\"squares\"][i];\n  f := [f[1],f[2],f[4],f[3]];\n  S := S, polygon(map(j -> T[\"embedding\"][j],f),colour=standard_colour(i));\n od:\n \n T[\"square_plot\"] := display(S,scaling=constrained,axes=none);\n \n T[\"short_edge_centres\"] :=\n  map(e -> (v[e[1]] +~ v[e[2]]) /~ 2,T[\"short_edges\"]);\n\n T[\"square_centres\"] :=\n  map(f -> (v[f[1]] +~ v[f[2]] +~ v[f[3]] +~ v[f[4]]) /~ 4, T[\"squares\"]);\n\n f := (u) -> simplify(u /~ sqrt(add(u[i]^2,i=1..3)));\n\n T[\"poles\"] := table([\n  2 = map(f,T[\"short_edge_centres\"]),\n  3 = map(i -> f(v[i]),T[\"vertices\"]),\n  4 = map(f,T[\"square_centres\"])\n ]);\n\n T[\"pole_plots\"] := table([\n  2 = map(u -> line(1.6 *~ u, -1.6 *~ u,color=green,thickness=4),T[\"poles\"][2]),\n  3 = map(u -> line(1.9 *~ u, -1.9 *~ u,color=red  ,thickness=4),T[\"poles\"][3]),\n  4 = map(u -> line(1.2 *~ u, -1.2 *~ u,color=blue ,thickness=4),T[\"poles\"][4])\n ]);\n\n T[\"all_poles_plot\"] := display(\n  op(T[\"pole_plots\"][2]),op(T[\"pole_plots\"][3]),op(T[\"pole_plots\"][4]),\n  scaling=constrained,axes=none\n );\n\n G0 := [];\n G1 := [[2,4,1,3,6,8,5,7],[1,3,5,7,2,4,6,8]];\n G := [[1,2,3,4,5,6,7,8]];\n\n while G <> G0 do\n  G0 := G;\n  G := sort([op({seq(seq(`o/permutations`(8)(g,h),g in G1),h in G)})]);\n od:\n\n T[\"rotation_group\"] := G;\n\n T[\"symmetry_group\"] :=\n   sort([op(G),op(map(s -> `o/permutations`(8)([8,7,6,5,4,3,2,1],s),G))]);\n\n r := table([1 = 1, 2 = 2, 3 = 3, 4 = 4, 5 = 4, 6 = 3, 7 = 2, 8 = 1]):\n \n T[\"to_axis_perm\"]    := table():\n T[\"of_axis_perm\"]    := table():\n T[\"symmetry_matrix\"] := table():\n\n for s in T[\"rotation_group\"] do\n  s1 := `o/permutations`(8)([8,7,6,5,4,3,2,1],s);\n  t := [r[s[1]],r[s[2]],r[s[3]],r[s[4]]];\n  T[\"to_axis_perm\"][s]  := t;\n  T[\"to_axis_perm\"][s1] := t;\n  T[\"of_axis_perm\"][t]  := s;\n\n  g := Matrix(3,3,[seq(x[i],i=1..9)]);\n  eqs := map(op,[seq(convert(g . Vector(v[i]) - Vector(v[s[i]]),list),i = 1..8)]);\n  sol := solve(eqs);\n  T[\"symmetry_matrix\"][s ] := subs(sol,convert( g,listlist));\n  T[\"symmetry_matrix\"][s1] := subs(sol,convert(-g,listlist));\n od:\n\n return eval(T);\nend:", "meta": {"hexsha": "59ad5a1ccdb794011ef6b43763ae3a6d3f346c1f", "size": 3083, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/simplicial_complexes/cube_complex.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/simplicial_complexes/cube_complex.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/simplicial_complexes/cube_complex.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 26.3504273504, "max_line_length": 82, "alphanum_fraction": 0.4907557574, "num_tokens": 1357, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.828938825225204, "lm_q2_score": 0.7549149923816048, "lm_q1q2_score": 0.6257783469297012}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* These numbers are taken from the original reference, but divided by\n     two to convert from Rydbergs to Hartrees *)\n\nA_vwn  := [ 0.0310907, 0.01554535, -1/(6*Pi^2)]:\nb_vwn  := [ 3.72744,   7.06042,    1.13107  ]:\nc_vwn  := [12.9352,   18.0578,    13.0045   ]:\nx0_vwn := [-0.10498,  -0.32500,   -0.0047584]:\n\nA_rpa  := [ 0.0310907,  0.01554535,  -1/(6*Pi^2)]:\nb_rpa  := [13.0720,    20.1231,      1.06835  ]:\nc_rpa  := [42.7198,   101.578,      11.4813   ]:\nx0_rpa := [-0.409286,  -0.743294,   -0.228344 ]:\n\nQ_vwn  := (b, c)     -> sqrt(4*c - b^2):\nf1_vwn := (b, c)     -> 2*b/Q_vwn(b, c):\nf2_vwn := (b, c, x0) -> b*x0/(x0^2 + b*x0 + c):\nf3_vwn := (b, c, x0) -> 2*(2*x0 + b)/Q_vwn(b, c):\n\nfpp_vwn := 4/(9*(2^(1/3) - 1)):\n\nfx_vwn := (b, c, rs) -> rs + b*sqrt(rs) + c:\n\nf_aux := (A, b, c, x0, rs) -> A*(\n  + log(rs/fx_vwn(b, c, rs))\n  + (f1_vwn(b, c) - f2_vwn(b, c, x0)*f3_vwn(b, c, x0))*arctan(Q_vwn(b, c)/(2*sqrt(rs) + b))\n  - f2_vwn(b, c, x0)*log((sqrt(rs) - x0)^2/fx_vwn(b, c, rs))\n):\n\nDMC  := (rs, z) ->\n    + f_aux(A_vwn[2], b_vwn[2], c_vwn[2], x0_vwn[2], rs)\n    - f_aux(A_vwn[1], b_vwn[1], c_vwn[1], x0_vwn[1], rs):\n\nDRPA := (rs, z) ->\n    + f_aux(A_rpa[2], b_rpa[2], c_rpa[2], x0_rpa[2], rs)\n    - f_aux(A_rpa[1], b_rpa[1], c_rpa[1], x0_rpa[1], rs):", "meta": {"hexsha": "51ffa6949ed9bd5253c4da1a82df0f2664502f5e", "size": 1498, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/vwn.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/vwn.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/vwn.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 34.8372093023, "max_line_length": 91, "alphanum_fraction": 0.544058745, "num_tokens": 725, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9032941962904956, "lm_q2_score": 0.6926419894793248, "lm_q1q2_score": 0.6256594892037766}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\ncs1_gamma :=  0.006: (* as in B88 *)\ncs1_d     :=  0.349: (* as in CS  *)\ncs1_C1    := -0.018897:\ncs1_C2    :=  0.155240:\ncs1_C3    := -0.159068:\ncs1_C4    :=  0.007953:\n\n(* Equation (24) corrected in Equation (8) in Proynov2006_436 *)\ncs1_ess := (rs, z, xs) ->\n  + opz_pow_n(z,1)/2 * n_spin(rs, z)^(1/3)/(n_spin(rs, z)^(1/3) + cs1_d)\n  * (cs1_C1 + cs1_C2*cs1_gamma^2*xs^4/(1 + cs1_gamma*xs^2)^2):\n\n(* Equation (25) corrected in Equation (6) in Proynov2006_436 *)\ncs1_eab := (rs, z, xt) ->\n  + (1 - z^2)/4 * 1/(1 + cs1_d*n_total(rs)^(-1/3))\n  * (cs1_C3 + cs1_C4*cs1_gamma^2*xt^4/(1 + cs1_gamma*xt^2)^2):\n\nf_cs1 := (rs, z, xt, xs0, xs1) ->\n  + cs1_eab(rs,  z, xt)\n  + cs1_ess(rs,  z, xs0)\n  + cs1_ess(rs, -z, xs1):\n\nf := (rs, z, xt, xs0, xs1) ->\n  f_cs1(rs, z, xt, xs0, xs1):\n", "meta": {"hexsha": "c5086bb20bc293689b88f80c444e582e2c29495f", "size": 1035, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_cs1.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_cs1.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_cs1.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 29.5714285714, "max_line_length": 72, "alphanum_fraction": 0.5855072464, "num_tokens": 453, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9032941988938413, "lm_q2_score": 0.6926419831347361, "lm_q1q2_score": 0.6256594852759331}}
{"text": "# The groupoid of sets of size 6 is equivalent to a certain groupoid of graphs which\n# we have called Holder graphs.  Specifically, if A is a set of size 6, then we write\n# DA for the set of subsets of size two, and we draw an edge between such subsets iff\n# they are disjoint; this gives a Holder graph.  The code below sets up the\n# relevant definitions.\n\n`is_element/holder_graphs` := (V::set) -> proc(E)\n local non_edges,pentads,E0,e;\n \n if nops(V) <> 15 then\n  return false;\n fi;\n\n if not `is_element/graphs`(V)(E) then\n  return false;\n fi;\n \n if map(v -> nops(select(e -> e[1] = v,E)),V) <> {6} then\n  return false;\n fi;\n\n non_edges := `top/autorel`(V) minus `id/autorel`(V) minus E;\n non_edges := map(e -> {op(e)},non_edges);\n\n pentads := combinat[choose](V,5);\n E0 := map(e -> {op(e)},E);\n\n for e in E0 do\n  pentads := select(p -> e minus p <> {},pentads);\n od:\n\n for e in non_edges do\n  if nops(select(p -> e minus p = {},pentads)) <> 1 then\n   return false;\n  fi;\n od;\n\n return true;\nend:\n\n`D/holder_graph` := proc(A::set)\n local V,E,v,w;\n \n if nops(A) <> 6 then\n  error(\"A does not have size six\");\n fi;\n\n V := combinat[choose](A,2);\n E := {seq(seq([v,w],w in V),v in V)};\n E := select(e -> e[1] intersect e[2] = {},E);\n return [V,E];\nend:\n\n`T/holder_graph` := (V::set) -> proc(E)\n local T,F,t,u;\n \n T := combinat[choose](V,3);\n T := select(t -> member([t[1],t[2]],E) and\n                  member([t[2],t[3]],E) and\n\t\t  member([t[3],t[1]],E),T);\n\n F := {seq(seq([t,u],u in T),t in T)};\n F := select(e -> e[1] <> e[2],F);\n F := select(e -> e[1] intersect e[2] <> {},F);\n return [T,F];\nend:\n\n`P/holder_graph` := (V) -> proc(E)\n local P,E0,e;\n \n P := combinat[choose](V,5);\n E0 := map(e -> {op(e)},E);\n\n for e in E0 do\n  P := select(p -> e minus p <> {},P);\n od:\n\n return P;\nend:\n\n`alpha/holder_graph` := (A) -> proc(a)\n local b;\n {seq({a,b},b in A minus {a})};\nend:\n\n`beta/holder_graph` := (V) -> (E) -> proc(v)\n local P;\n \n P := `P/holder_graph`(V)(E);\n\n return select(p -> member(v,p),P);\nend:\n\n`gamma/holder_graph` := (V) -> (E) -> proc(v)\n local T,F;\n \n T,F := op(`T/holder_graph`(V)(E));\n return select(t -> member(v,t),T);\nend:\n\ncheck_holder_graph := proc()\n local A0,A1,V0,V1,V2,V3,E0,E1,E2,E3,v,beta_table,gamma_table;\n\n A0 := {1,2,3,4,5,6};\n V0,E0 := op(`D/holder_graph`(A0)):\n _ASSERT(\n  `is_element/holder_graphs`(V0)(E0),\n  \"D sends sets of size six to Holder graphs\"\n );\n\n A1 := `P/holder_graph`(V0)(E0):\n _ASSERT(\n  evalb(nops(A1) = 6),\n  \"P sends Holder graphs to sets of size six\"\n );\n\n _ASSERT(\n  evalb(map(`alpha/holder_graph`(A0),A0) = A1),\n  \"alpha : A -> PDA is bijective\"\n );\n\n V1,E1 := op(`D/holder_graph`(A1)):\n\n _ASSERT(\n  `is_element/holder_graphs`(V1)(E1),\n  \"DP sends Holder graphs to Holder graphs\"\n );\n\n beta_table := table():\n for v in V0 do beta_table[v] := `beta/holder_graph`(V0)(E0)(v); od:\n _ASSERT(\n  evalb(map(v -> beta_table[v],V0) = V1) and\n  evalb(map(e -> [beta_table[e[1]],beta_table[e[2]]],E0) = E1),\n  \"beta : G -> DPG is an isomorphism\"\n );\n\n V2,E2 := op(`T/holder_graph`(V0)(E0)):\n\n _ASSERT(\n  `is_element/holder_graphs`(V2)(E2),\n  \"T sends Holder graphs to Holder graphs\"\n );\n\n V3,E3 := op(`T/holder_graph`(V2)(E2)):\n _ASSERT(\n  `is_element/holder_graphs`(V3)(E3),\n  \"T^2 sends Holder graphs to Holder graphs\"\n );\n\n gamma_table := table():\n for v in V0 do gamma_table[v] := `gamma/holder_graph`(V0)(E0)(v); od:\n _ASSERT(\n  evalb(map(v -> gamma_table[v],V0) = V3) and\n  evalb(map(e -> [gamma_table[e[1]],gamma_table[e[2]]],E0) = E3),\n  \"gamma : G -> T^2G is an isomorphism\"\n );\nend:\n\n# The code below is older.  It partially duplicates the code above and then\n# sets up an embedding of a Holder graph in R^3 u {infinity}\n\nmake_holder_graph := proc()\n local i,j,k,l,ii,jj,kk,\n  v,v_index,num_vertices,\n  e,e_index,num_edges,\n  t,t_index,num_triangles,\n  col,vv,vi,ww,a,b,c,d,\n  pol,draw_edge,sub_graph,full_sub_graph,G;\n\n i := 0:\n for j from 0 to 4 do\n  for k from j+1 to 5 do\n   v[i] := {j,k}:\n   v_index[{j,k}] := i:\n   i := i+1:\n  od:\n od:\n num_vertices := i;\n\n i := 0:\n for j from 0 to num_vertices-2 do\n  for k from j+1 to num_vertices-1 do\n   if v[j] intersect v[k] = {} then\n    e[i] := {j,k}:\n    e_index[{j,k}] := i:\n    i := i+1:\n   fi:\n  od:\n od:\n num_edges := i;\n\n i := 0:\n for j from 0 to num_vertices-1 do\n  for k from j+1 to num_vertices-1 do\n   for l from k+1 to num_vertices-1 do\n    if nops({op(v[j]),op(v[k]),op(v[l])}) = 6 then\n     ii := e_index[{j,k}]:\n     jj := e_index[{j,l}]:\n     kk := e_index[{k,l}]:\n     t[i] := {ii,jj,kk}:\n     t_index[{ii,jj,kk}] := i:\n     col[ii] := i;\n     col[jj] := i;\n     col[kk] := i;\n     i := i+1:\n    fi:\n   od:\n  od:\n od:\n num_triangles := i;\n\n a := 0.3: b := 2: c := sqrt(3*b^2 - a^2): d := 1.5:\n\n t[0] := {};\n\n # Coordinates for a 3D picture\n vv[ 0] := infinity:\n vv[ 1] := [-b,-b, b]:\n vv[ 2] := [ b,-b,-b]:\n vv[ 3] := [-b, b,-b]:\n vv[ 4] := [ b, b, b]:\n vv[ 5] := [ b, b,-b]:\n vv[ 6] := [-b, b, b]:\n vv[ 7] := [ b,-b, b]:\n vv[ 8] := [-b,-b,-b]:\n vv[ 9] := [ 0,-c,-a]:\n vv[10] := [-c,-a, 0]:\n vv[11] := [-a, 0, c]:\n vv[12] := [-a, 0,-c]:\n vv[13] := [ c,-a, 0]:\n vv[14] := [ 0, c,-a]:\n\n vi[ 9] := [ 0, 0,-d]:\n vi[10] := [ 0,-d, 0]:\n vi[11] := [-d, 0, 0]:\n vi[12] := [-d, 0, 0]:\n vi[13] := [ 0,-d, 0]:\n vi[14] := [ 0, 0,-d]:\n\n # Coordinates for a planar picture\n pol := (r,t) -> simplify([r * cos(Pi/6*t), r * sin(Pi/6*t)]);\n\n ww[ 0] := pol(1, 0):\n ww[10] := pol(1, 1):\n ww[ 4] := pol(1, 2):\n ww[ 6] := pol(1, 3):\n ww[14] := pol(1, 4):\n ww[ 1] := pol(1, 5):\n ww[12] := pol(1, 6):\n ww[ 8] := pol(1, 7):\n ww[ 9] := pol(1, 8):\n ww[ 3] := pol(1, 9):\n ww[ 5] := pol(1,10):\n ww[13] := pol(1,11):\n ww[11] := pol(3, 0):\n ww[ 2] := pol(3, 4):\n ww[ 7] := pol(3, 8):\n\n G := table():\n\n G[\"v\"] := eval(v);\n G[\"e\"] := eval(e);\n G[\"t\"] := eval(t);\n G[\"v_index\"] := eval(v_index);\n G[\"e_index\"] := eval(e_index);\n G[\"t_index\"] := eval(t_index);\n G[\"num_vertices\"] := num_vertices;\n G[\"num_edges\"] := num_edges;\n G[\"num_triangles\"] := num_triangles;\n G[\"col\"] := eval(col);\n G[\"vv\"] := eval(vv);\n G[\"vi\"] := eval(vi);\n G[\"ww\"] := eval(ww);\n\n draw_edge := proc(i)\n  local u,p,q,r;\n  u := e[i];\n  p := vv[u[1]];\n  q := vv[u[2]];\n  if (p = infinity) then\n   r := vi[u[2]];\n   return(CURVES([q,[d*q[1],d*q[2],d*q[3]]],COLOR(HUE,col[i] * 0.07)));\n  elif (p[1]*q[1] + p[2] * q[2] + p[3] * q[3] > 0) then\n   return(great_arc(p,q,col[i] * 0.07));\n  else \n   return(CURVES([p,q],COLOR(HUE,col[i] * 0.07)));\n  fi;\n end:\n\n sub_graph := proc(edge_test) \n  local ee,i;\n  ee := [];\n  for i from 0 to num_edges-1 do\n   if (edge_test(i)) then\n    ee := [op(ee),i]; \n   fi;\n  od:\n  plots[display](PLOT3D(op(map(draw_edge,ee)),THICKNESS(3)),axes=none):\n end: \n\n full_sub_graph := proc(vertex_test) \n  sub_graph(i -> vertex_test(e[i][1]) and vertex_test(e[i][2]));\n end:\n\n G[\"full_graph\"] :=\n  plots[display](PLOT3D(seq(draw_edge(i),i=0..num_edges-1),THICKNESS(3)),axes=none):\n\n G[\"outer_shell\"] := full_sub_graph(i -> evalb(i < 9)):\n G[\"inner_shell\"] := sub_graph(i -> evalb(e[i][1] > 8 and e[i][2] > 8)):\n G[\"joins\"]       := sub_graph(i -> evalb(e[i][1] > 0 and e[i][1] < 9 and e[i][2] > 8)):\n\n G[\"plane_plot\"] :=\n  plots[display](\n   seq(line(ww[e[i][1]],ww[e[i][2]]),i=0..num_edges-1),\n   axes = none\n  );\n\n return eval(G);\nend:\n", "meta": {"hexsha": "5f01da4b0d81cda877431a346251c8cd85297d32", "size": 7215, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/groups/holder_graph.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/groups/holder_graph.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/groups/holder_graph.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 22.546875, "max_line_length": 88, "alphanum_fraction": 0.5448371448, "num_tokens": 2813, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8519528094861981, "lm_q2_score": 0.734119526900183, "lm_q1q2_score": 0.6254351934412895}}
{"text": "(* type: work_gga_x *)\n(* prefix:\n  gga_x_b88_params *params;\n \n  assert(p->params != NULL);\n  params = (gga_x_b88_params * )(p->params);\n*)\n\nf0 := x -> 1.0 + params_a_beta/X_FACTOR_C*x^2/(1.0 + params_a_gamma*params_a_beta*x*arcsinh(x)):\n\nf := x -> f0(x):\n", "meta": {"hexsha": "f39dca5bc77af272c733d524b8b49bed6ca2ea58", "size": 257, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/gga_x_b88.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/gga_x_b88.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/gga_x_b88.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 21.4166666667, "max_line_length": 96, "alphanum_fraction": 0.626459144, "num_tokens": 94, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.8856314647623016, "lm_q2_score": 0.7057850402140659, "lm_q1q2_score": 0.6250654389721031}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\nlg93_ad  := 1e-8:\nlg93_b   := 0.024974:\nlg93_a2  := (lg93_ad + 0.1234)/lg93_b:\nlg93_a4  := 29.790:\nlg93_a6  := 22.417:\nlg93_a8  := 12.119:\nlg93_a10 := 1570.1:\nlg93_a12 := 55.944:\n\nlg93_f0 := s-> 1 + lg93_a2*s^2 + lg93_a4*s^4\n        + lg93_a6*s^6 + lg93_a8*s^8 + lg93_a10*s^10 + lg93_a12*s^12:\n\nlg93_f1 := s-> lg93_f0(s)^lg93_b/(1 + lg93_ad*s^2):\n\nlg93_f  := x->lg93_f1(X2S*x):\n\nf := (rs, zeta, xt, xs0, xs1) -> gga_exchange(lg93_f, rs, zeta, xs0, xs1):", "meta": {"hexsha": "ef434ce5db239f08e7c02f913e44c10f173ead92", "size": 713, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_lg93.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_lg93.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_lg93.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 26.4074074074, "max_line_length": 74, "alphanum_fraction": 0.633941094, "num_tokens": 311, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9294404116305638, "lm_q2_score": 0.6723317123102955, "lm_q1q2_score": 0.6248922634419629}}
{"text": "`is_element/cactus_trees` := (A::set) -> proc(J)\n global reason;\n local tag,B,C,E,a,j;\n\n tag := \"is_element/cactus_trees\";\n\n if A = {} then\n  reason := [tag,\"A is empty\"];\n  return false;\n fi;\n\n if not(type(J,set(set)) and map(op,J) minus A = {}) then\n  reason := [tag,\"J is not a set of subsets of A\",J,A];\n  return false;\n fi; \n\n if min(op(map(nops,J))) < 2 then\n  reason := [tag,\"J contains a set of size < 2\",J];\n  return false;\n fi;\n\n B := {};\n C := {A[1]};\n while nops(B) < nops(C) do\n  B := C;\n  C := map(op,{B,map(op,select(X -> X intersect B <> {},J))});\n od;\n if C <> A then\n  reason := [tag,\"The graph is not connected\",A,J,C];\n  return false;\n fi;\n\n E := {seq(seq([a,j],a in j),j in J)};\n if nops(E) <> (nops(A) + nops(J) - 1) then\n  reason := [tag,\"The graph is not a tree\",A,E];\n  return false;\n fi;\n\nreturn true;\nend:\n\n######################################################################\n\n`is_leq/cactus_trees` := (A::set) -> proc(J0,J1)\n local f,G,j0,j1,jj1,P,Q,p,q,U;\n\n # f will be the map J0 -> J1 with j0 a subset of f(j0)\n f := table():\n\n # G(j1) = f^{-1}{j1}\n G := table():\n \n for j1 in J1 do G[j1] := {}; od:\n\n for j0 in J0 do\n  jj1 := select(u -> (j0 minus u) = {},J1);\n  # Assuming that J1 really is a cactus tree, the set jj1 will\n  # have size 0 or 1.\n  if nops(jj1) <> 1 then\n   return false;\n  fi;\n  j1 := op(1,jj1);\n  f[j0] := j1;\n  G[j1] := {op(G[j1]),j0};\n od:\n\n for j1 in J1 do\n  P := G[j1];\n  p := nops(P);\n  if p = 0 then return false; fi; # f should be surjective\n  Q := {P[1]};\n  q := 0;\n  while q < nops(Q) do \n   q := nops(Q);\n   U := map(op,Q);\n   Q := select(j0 -> ((j0 intersect U) <> {}),P);\n  od:\n  if Q <> P then\n   return false;\n  fi;\n od;\n\n return true;\nend:\n\n`top/cactus_trees` := proc(A::set)\n if nops(A) > 1 then\n  return {A};\n elif nops(A) = 1 then\n  return {};\n else\n  return FAIL;\n fi;\nend:\n\n######################################################################\n\n`random_element/cactus_trees` := (A::set) -> proc()\n local a,b,B,J,K,k;\n \n if nops(A) = 0 then\n  return FAIL;\n elif nops(A) = 1 then\n  return {};\n elif nops(A) = 2 then\n  return {A};\n fi;\n\n a := random_element_of(A);\n B := A minus {a};\n K := `random_element/cactus_trees`(B)();\n if rand(0..1)() = 0 then\n  k := random_element_of(K);\n  J := K minus {k} union {k union {a}};\n else\n  b := random_element_of(B);\n  J := K union {{a,b}};\n fi;\n\n return J;\nend:\n\n######################################################################\n\n`list_elements/cactus_trees` := proc(A::set)\n option remember;\n local n,a,b,u,v,B,PP,pp,K,L,m,M,P,Q,i,k,f;\n\n n := nops(A);\n if n = 0 then\n  return [];\n elif n = 1 then\n  return [{}];\n elif n = 2 then\n  return [{A}];\n fi;\n\n a := A[1];\n B := A minus {a};\n PP := map(pp -> [op(pp)],`list_elements/partitions`(B));\n L := NULL;\n for pp in PP do\n  m := nops(pp);\n  M := map(`list_elements/cactus_trees`,pp);\n  P := [seq([seq(seq([K,{b}],b in pp[i]),K in M[i]),\n             seq(seq([K,k],k in K),K in M[i])],i=1..m)];\n  Q := [[]];\n  for i from 1 to m do\n   Q := [seq(seq([op(u),v],u in Q),v in P[i])]; \n  od:\n  f := (q) -> {seq(op(q[i][1] minus {q[i][2]}),i=1..m),seq({a,op(q[i][2])},i=1..m)};\n  L := L,op(map(f,Q));\n od:\n return [L];\nend:\n\n######################################################################\n\n# This is A030019 in OEIS\n\n`count_elements/cactus_trees` := proc(A::set)\n local n,i;\n n := nops(A);\n add(Stirling2(n-1, i)*n^(i-1),i=0..n-1);\nend:\n\n", "meta": {"hexsha": "c915412f2b31c9e954331823c157d29b5f723cbe", "size": 3400, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/operads/cacti/cactus_trees.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/operads/cacti/cactus_trees.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/operads/cacti/cactus_trees.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 20.3592814371, "max_line_length": 84, "alphanum_fraction": 0.4917647059, "num_tokens": 1179, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8244619350028204, "lm_q2_score": 0.7577943822145998, "lm_q1q2_score": 0.6247726226949158}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_gga_c *)\n(* prefix:\n  gga_x_hjs_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_x_hjs_params * )(p->params);\n*)\n\nAA :=  0.757211:\nBB := -0.106364:\nCC := -0.118649:\nDD :=  0.609650:\n\nfH := s -> add(params_a_a[i]*s^(1+i), i=1..6)/(1 + add(params_a_b[i]*s^i, i=1..9)):\n\nmzeta   := s -> s^2*fH(s):\nmeta    := s -> AA + mzeta(s):\nmlambda := s -> DD + mzeta(s):\nmchi    := (rs, z, s) -> nu(rs, z)/sqrt(mlambda(s) + nu(rs, z)^2):\n\nfF := (rs, z, s) ->\n  1 - s^2/(27*CC*(1 + s^2/4)) - mzeta(s)/(2*CC):\n\nfG := (rs, z, s) ->\n  - 2/5  * CC*fF(rs, z, s)*mlambda(s)\n  - 4/15 * BB*mlambda(s)^2\n  - 6/5  * AA*mlambda(s)^3\n  - mlambda(s)^(7/2)*(4/5*sqrt(Pi) + 12/5*(sqrt(mzeta(s)) - sqrt(meta(s)))):\n\nf1 := (rs, z, s) ->\n   + AA\n   - 4/9 * BB*(1 - mchi(rs, z, s))/mlambda(s)\n   - 2/9 * CC*fF(rs, z, s)*(2 - 3*mchi(rs, z, s) + mchi(rs, z, s)^3)/mlambda(s)^2\n   - 1/9 * fG(rs, z, s)*(8 - 15*mchi(rs, z, s) + 10*mchi(rs, z, s)^3 - 3*mchi(rs, z, s)^5)/mlambda(s)^3\n   + 2*nu(rs, z)*(sqrt(mzeta(s) + nu(rs, z)^2) -  sqrt(meta(s) + nu(rs, z)^2))\n   + 2*mzeta(s)*log((nu(rs, z) + sqrt(mzeta(s) + nu(rs, z)^2))/(nu(rs, z) + sqrt(mlambda(s) + nu(rs, z)^2)))\n   - 2*meta(s)*log((nu(rs, z) + sqrt(meta(s) + nu(rs, z)^2))/(nu(rs, z) + sqrt(mlambda(s) + nu(rs, z)^2))):\n\nf_lda := (rs, z) -> -X_FACTOR_C*RS_FACTOR*((1 + z)/2)^(4/3)/rs:\n\nf := (rs, z, xt, xs0, xs1) ->\n  f_lda(rs, z)*f1(rs, z, X2S*xs0) + f_lda(rs, -z)*f1(rs, -z, X2S*xs1):\n", "meta": {"hexsha": "c368e70dd65cae499984a0c9d81a90f420b0b841", "size": 1674, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/gga_x_hjs.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/gga_x_hjs.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/gga_x_hjs.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 32.8235294118, "max_line_length": 108, "alphanum_fraction": 0.517921147, "num_tokens": 764, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9059898279984214, "lm_q2_score": 0.6893056231680121, "lm_q1q2_score": 0.6245038829723321}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_mgga_x *)\n(* prefix:\n  mgga_x_tau_hcth_params *params;\n\n  assert(pt->params != NULL);\n  params = (mgga_x_tau_hcth_params * ) (pt->params);\n*)\n\ncoeff_a := [0, 1, 0, -2, 0, 1]:\n\n(* Equation (29) *)\ngamX := 0.004:\nux   := x -> gamX*x^2/(1 + gamX*x^2):\n\ngxl  := x -> add(params_a_cx_local [i]*ux(x)^(i-1), i=1..4):\ngxnl := x -> add(params_a_cx_nlocal[i]*ux(x)^(i-1), i=1..4):\n\nf    := (rs, x, t, u) -> gxl(x) + gxnl(x)*mgga_series_w(coeff_a, 6, t):\n", "meta": {"hexsha": "4c73fa16a4a0ea591747c7c2bc578265ed62c62e", "size": 698, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/mgga_x_tau_hcth.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/mgga_x_tau_hcth.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/mgga_x_tau_hcth.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 25.8518518519, "max_line_length": 71, "alphanum_fraction": 0.6074498567, "num_tokens": 264, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.905989815306765, "lm_q2_score": 0.6893056295505783, "lm_q1q2_score": 0.6245038800064419}}
{"text": "# Suppose that u is in Lie(A), and that a is in A.  Then there is a unique\n# way to express u as a linear combination of fully right associated words\n# with a as the last term.  The function below calculates this.\n\n`comb/lie_operad` := (a) -> proc(u)\n local x,y,z,n,ub,uc,t;\n if u = 0 then\n  return 0;\n elif type(u,`+`) or type(u,list) or type(u,set) then\n  return map(`comb/lie_operad`(a),u);\n elif type(u,`*`) then\n  ub,uc := selectremove(type,[op(u)],specfunc(bracket));\n  if nops(ub) <> 1 then\n   return FAIL;\n  fi;\n  ub := ub[1];\n  uc := `*`(op(uc));\n  return(uc * `comb/lie_operad`(a)(ub));\n elif type(u,specfunc(bracket)) then\n  n := nops(u);\n  if n = 0 then\n   return FAIL;\n  fi;\n  if n = 1 then\n   if op(u) = a then\n    return u;\n   else\n    return FAIL;\n   fi;\n  else\n   x := op(1,u);\n   y := op(2,u);\n   z := op(3..n,u);\n   if x = a then\n    if n = 2 then\n     return -bracket(y,x);\n    else\n     return `comb/lie_operad`(a)(bracket(y,bracket(a,z))) -\n      eval(subs(t = bracket(y,a),`comb/lie_operad`(t)(bracket(t,z))));\n    fi;\n   elif has(x,a) then\n    return eval(subs(t = `comb/lie_operad`(a)(x),\n                     `comb/lie_operad`(t)(bracket(t,y,z))));\n   else\n    return bracket(x,`comb/lie_operad`(a)(bracket(y,z)));\n   fi;\n  fi;\n fi;\nend:\n\n# This returns the basis consisting of fully right associated words\n# ending with a.\n\n`basis/lie_operad` := proc(A::set,a_)\n local a,B;\n \n a := `if`(nargs > 1,a_,A[nops(A)]);\n if not member(a,A) then\n  error \"a not in A\";\n fi;\n\n B := A minus {a};\n return map(u -> bracket(op(u),a),`list_elements/ord`(B));\nend:\n\n`vec0/lie_operad` := (A::set,a) -> proc(u)\n local n,m,ub,uc,T,B,i;\n global `vec_table/lie_operad`;\n\n n := nops(A);\n m := (n-1)!;\n if u = 0 then\n  return [0$m];\n elif type(u,`+`) then\n  return map(`vec0/lie_operad`(A,a),u); \n else\n  if type(u,specfunc(bracket)) then\n   ub := u;\n   uc := 1;\n  elif type(u,`*`) then\n   ub,uc := selectremove(type,[op(u)],specfunc(bracket));\n   if nops(ub) <> 1 then\n    return FAIL;\n   fi;\n   ub := ub[1];\n   uc := `*`(op(uc));\n  else\n   return FAIL;\n  fi;\n  if not(type(`vec_table/lie_operad`[A,a],table)) then\n   T := table():\n   B := `basis/lie_operad`(A,a);\n   for i from 1 to m do\n    T[B[i]] := [0$(i-1),1,0$(m-i)];\n   od:\n   `vec_table/lie_operad`[A,a] := eval(T);\n  fi;\n  return uc *~ `vec_table/lie_operad`[A,a][ub];\n fi;\nend:\n\n`vec/lie_operad` := (A::set,a) -> proc(u)\n `vec0/lie_operad`(A,a)(`comb/lie_operad`(a)(u));\nend:\n\n# This returns an alternative basis for Lie(X[n]), where\n# X[n] = {x[1],...,x[n]}.  The basis elements for Lie(X[n]) are\n# obtained from those for Lie(X[n-1]) by substitutions of the\n# form x[i] |-> [x[i],x[n]].  Note that we use the inert Bracket\n# operation to prevent automatic expansion by the Jacobi identity.\n# One can convert using eval(subs(Bracket = bracket,...))\n\n`alt_basis/lie_operad` := proc(n::nonnegint)\n option remember;\n local i,u;\n \n if n = 0 then\n  return [];\n elif n = 1 then\n  return [x[1]];\n else\n  return [seq(seq(subs(x[i]=Bracket(x[i],x[n]),u),i=1..n-1),u in `alt_basis/lie_operad`(n-1))];\n fi;\nend:\n", "meta": {"hexsha": "eb39f3dc9c601e222b4f4eea8b8884c986ab4ef8", "size": 3068, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/operads/lie.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/operads/lie.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/operads/lie.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 24.544, "max_line_length": 95, "alphanum_fraction": 0.5902868318, "num_tokens": 1087, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8539127529517044, "lm_q2_score": 0.7310585727705127, "lm_q1q2_score": 0.6242602384434124}}
{"text": "# Display contents of the packages since\n# we might use them latter\nwith(LinearAlgebra):\nwith(Groebner):\n\nwriteto(\"output.txt\"):\n\n#F := [x^3 + 12, 2*y^2 - x]:\n#a, b := Basis(F, plex(x, y), output=extended):\n\n#simplify(Multiply(convert(b, Matrix), Transpose(convert(F, Matrix)))):\n#simplify(Transpose(convert(a, Matrix))):\n\n#_m_order_1 = [[1, 0, 0], [0, 1, 0], [0, 0, 1]]:\n#order_1 = 'matrix'(_m_order_1, [x, y, z]):\n\n\n#f_example_monomial_order := proc (poly, order_1::{MonomialOrder, ShortMonomialOrder})\n#return sort([op(poly)], (b, a) -> TestOrder(a, b, order_1))\n#end proc:\n\n#F := 1/2*x + 2*y*z:\n\n#print(f_example_monomial_order(F, 'matrix'([[1,0,0],[0,1,0],[0,0,1]], [x, y, z])        )):\n#print(f_example_monomial_order(F, plex(x, y, z)   )):\n#print(f_example_monomial_order(F, grlex(x, y, z)  )):\n\n# ---------------------------------------------------------------------------\ntruncatePolynomial := proc (poly, order_1, order_2)\nlocal leading_coeff_1, leading_mon_1, leading_term, curr_index, polys:\n\n    leading_coeff_1, leading_mon_1 := LeadingTerm(poly, order_1):\n    leading_term                   := leading_coeff_1 * leading_mon_1:\n    curr_index                     := 1:\n\n    polys := sort([op(poly)], (b, a) -> TestOrder(a, b, order_2)):\n\n    while evalb(polys[curr_index] <> leading_term) do\n        curr_index := curr_index + 1:\n    end do:\n\n    if curr_index = 1 then\n        return polys[1]:\n    else\n        return add(x, x in polys[1..curr_index]):\n    end if:\nend proc:\n# ---------------------------------------------------------------------------\n\n# ---------------------------------------------------------------------------\n# Test truncatePolynomial\nprint( truncatePolynomial(x^2 - y*z + 1, grlex(x, y, z), plex(x, y, z)) ):\nprint( truncatePolynomial(y^2 - x, grlex(x, y, z), plex(x, y, z)) ):\n# ---------------------------------------------------------------------------\n\nbasisConversion := proc (basis, order_1, order_2)\nlocal F, F_t, num_iter, F_t_gb, multipliers, G, repeat, curr_index, num_elements:\n\n    print(\"Step 1\"):\n    F   := Basis(basis, order_1):\n    F_t := map(v -> truncatePolynomial(v, order_1, order_2), F):\n    print(\"Current F\", F):\n    print(\"Current F_t\", F_t):\n\n    num_iter := 1:\n\n    while true do\n        print(\"Iteration \", num_iter):\n        num_iter := num_iter + 1:\n\n        print(\"Step 3 & 4\"):\n        F_t_gb, multipliers := Basis(F_t, order_2, output=extended):\n        print(\"Matrix of multipliers M': \", multipliers):\n        print(\"H (= M' F_t): \", F_t_gb):\n\n        print(\"Step 5\"):\n        G := convert(simplify(Multiply(convert(multipliers, Matrix), Transpose(convert(F, Matrix)))), list):\n        print(\"G (= M' * F): \", G):\n\n        print(\"Step 6 and 7\"):\n        repeat := false:\n        curr_index := 1:\n        num_elements := numelems(F_t_gb):\n        while curr_index < num_elements do\n            if evalb(LeadingMonomial(F_t_gb[curr_index], order_2) <> LeadingMonomial(G[curr_index], order_2)) then\n                print(\"There are the witness polynomials that prove G_s is not empty (g_j, h_j) \", F_t_gb[curr_index], G[curr_index]):\n                repeat := true:\n                break:\n            end if:\n            curr_index := curr_index + 1:\n        end do:\n\n        if repeat = false then\n            print(\"Done\"):\n            return InterReduce(G, order_2):\n        else\n            F := G:\n            F_t := map(v -> truncatePolynomial(v, order_1, order_2), F):\n        end if:\n    end do:\n\nend proc:\n\n# ---------------------------------------------------------------------------\n# Test basisConversion\nprint( basisConversion([y^2-x,x^2-y*z-1,z^2-x], grlex(x, y, z), plex(x, y, z)) ):\n# ---------------------------------------------------------------------------\n\n", "meta": {"hexsha": "e1f1740364ca44210259bb988bacbf3d194c981a", "size": 3750, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "prev_testing.mpl", "max_stars_repo_name": "typesAreSpaces/Basis-Conversion", "max_stars_repo_head_hexsha": "e5aec90e139f19f874fe4e40b823d28551c773ff", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "prev_testing.mpl", "max_issues_repo_name": "typesAreSpaces/Basis-Conversion", "max_issues_repo_head_hexsha": "e5aec90e139f19f874fe4e40b823d28551c773ff", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "prev_testing.mpl", "max_forks_repo_name": "typesAreSpaces/Basis-Conversion", "max_forks_repo_head_hexsha": "e5aec90e139f19f874fe4e40b823d28551c773ff", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 34.4036697248, "max_line_length": 134, "alphanum_fraction": 0.5173333333, "num_tokens": 1025, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8333246118695629, "lm_q2_score": 0.7490872187162396, "lm_q1q2_score": 0.6242328157931607}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_k_dk_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_k_dk_params * )(p->params);\n*)\n\ndk_f := x ->\n  add(params_a_aa[i]*x^(2*(i-1)), i=1..5) /\n  add(params_a_bb[i]*x^(2*(i-1)), i=1..5):\n\nf := (rs, zeta, xt, xs0, xs1) -> gga_kinetic(dk_f, rs, zeta, xs0, xs1):\n", "meta": {"hexsha": "5f58ca77cbb75d2128b39635169a2167e7b19fe1", "size": 548, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_k_dk.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_k_dk.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_k_dk.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 24.9090909091, "max_line_length": 71, "alphanum_fraction": 0.6259124088, "num_tokens": 199, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9099069987088003, "lm_q2_score": 0.6859494485880928, "lm_q1q2_score": 0.6241502040307481}}
{"text": "`is_element/digraphs` := (V::set) -> proc(E)\n if not(`is_element/autorel`(V)(E)) then\n  return false;\n fi;\n\n if not(`is_antisymmetric/autorel`(V)(E)) then\n  return false;\n fi;\n\n return true;\nend:\n\n`is_leq/digraphs` := (V::set) -> (E0,E1) -> evalb(E0 minus E1 = {}):\n\n`list_elements/digraphs` := proc(V::set)\n local n,EE,E,i,j,a,b;\n \n n := nops(V);\n EE := [{}];\n for i from 1 to n-1 do\n  for j from i+1 to n do\n   a := V[i];\n   b := V[j];\n   EE := [op(EE),\n          seq(E union {[a,b]},E in EE),\n          seq(E union {[b,a]},E in EE)];\n  od;\n od;\n\n return EE; \nend:\n\n`count_elements/digraphs` := (V::set) -> 3^(nops(V)*(nops(V)-1)/2);\n\n`random_element/digraphs` := (V::set) -> proc()\n local n,E,r,i,j,a,b,x;\n \n n := nops(V);\n E := NULL;\n r := rand(-1..1);\n for i from 1 to n-1 do\n  for j from i+1 to n do\n   a := V[i];\n   b := V[j];\n   x := r();\n   if x = -1 then\n    E := E,[b,a];\n   elif x = 1 then\n    E := E,[a,b];\n   fi;\n  od;\n od;\n\n return {E}; \nend:\n\n`neighbour_table/digraphs` := (V) -> proc(E)\n local N,v,e;\n \n N := table();\n for v in V do N[v] := {}; od:\n for e in E do\n  N[e[1]] := {op(N[e[1]]),e[2]};\n  N[e[2]] := {op(N[e[2]]),e[1]};\n od:\n\n return eval(N);\nend:\n\n`in_neighbour_table/digraphs` := (V) -> proc(E)\n local N,v,e;\n \n N := table();\n for v in V do N[v] := {}; od:\n for e in E do\n  N[e[2]] := {op(N[e[2]]),e[1]};\n od:\n\n return eval(N);\nend:\n\n`out_neighbour_table/digraphs` := (V) -> proc(E)\n local N,v,e;\n \n N := table();\n for v in V do N[v] := {}; od:\n for e in E do\n  N[e[1]] := {op(N[e[1]]),e[2]};\n od:\n\n return eval(N);\nend:\n\n`component_relation/digraphs` := (V) -> (E) ->\n `transitive_closure/autorel`(V)(\n  E union `op/autorel`(V)(E) union `id/autorel`(V)\n );\n\n`components/digraphs` := (V) -> (E) ->\n `block_partition/equiv`(`component_relation/graphs`(V)(E));\n\n`is_connected/digraphs` := (V) -> (E) -> \n evalb(`component_relation/digraphs`(V)(E) = `top/autorel`(V));\n\n`skeleton/digraphs` := (V::set) -> proc(E)\n local n,V0,E0,ix,i;\n \n n := nops(V);\n V0 := {seq(i,i=1..n)};\n ix := table():\n for i from 1 to n do ix[V[i]] := i; od;\n E0 := map(e -> [ix[e[1]],ix[e[2]]],E);\n return [V0,E0];\nend:\n\n`is_element/dipaths` := (V) -> (E) -> proc(p)\n local i,n;\n \n if not type(p,list) then\n  return false;\n fi;\n\n n := nops(p) - 1;\n\n if n < 0 then \n  return false;\n fi;\n\n if {op(p)} minus V <> {} then\n  return false;\n fi;\n\n for i from 1 to n do\n  if not(member([p[i],p[i+1]],E)) then\n   return false;\n  fi;\n od;\n\n return true;\nend:\n\n`is_small_element/dipaths` := (V) -> (E) -> (n::nonnegint) -> proc(p)\n return evalb(`is_element/dipaths`(V)(E)(p) and (nops(p) = n+1));\nend:\n\n`random_small_element/dipaths` := (V) -> (E) -> (n::nonnegint) -> proc(num_tries := 10)\n local k,p,F;\n\n if n = 0 then\n  if V = {} then\n   return FAIL;\n  else\n   return [random_element_of(V)()];\n  fi;\n elif n = 1 then\n  if E = {} then\n   return FAIL;\n  else\n   return random_element_of(E)();\n  fi;\n fi;\n \n k := num_tries;\n\n while k > 0 do\n  k := k-1;\n  p := `random_small_element/dipaths`(V)(E)(n-1)();\n  if p <> FAIL then\n   F := select(e -> e[2] = p[1],E);\n   if F <> {} then\n    return [random_element_of(F)()[1],op(p)];\n   fi;\n  fi;\n od;\n\n return FAIL;\nend:\n\n`list_small_elements/dipaths` := (V) -> (E) -> proc(n::nonnegint)\n option remember;\n local P,Q,p,v,F,e;\n \n if n = 0 then\n  return map(v -> [v],V);\n else\n  P := `list_small_elements/dipaths`(V)(E)(n-1);\n  Q := NULL;\n  for p in P do\n   v := p[1];\n   F := select(e -> e[2] = v,E);\n   Q := Q,seq([e[1],op(p)],e in F);\n  od:\n  return [Q];\n fi;\nend:\n\n`is_leq/dipaths` := NULL;\n`count_elements/dipaths` := NULL:\n`count_small_elements/dipaths` := NULL:\n\n`length/dipaths` := (V) -> (E) -> (p) -> nops(p) - 1;\n\n`is_trail/dipaths` := proc(p)\n local n,e,i;\n n := nops(p) - 1;\n e := {seq([p[i],p[i+1]],i=1..n)};\n return evalb(nops(e) = n);\nend:\n\n`is_cycle/dipaths` := proc(p)\n local n,i;\n n := nops(p) - 1;\n return evalb(p[1] = p[n+1] and nops({seq(p[i],i=1..n)}) = n);\nend:\n\n`is_small_element/ditrails` := (V) -> (E) -> (n::nonnegint) -> proc(p)\n if not `is_small_element/dipaths`(V)(E)(n)(p) then\n  return false;\n fi;\n\n return `is_trail/dipaths`(p);\nend:\n\n`is_element/ditrails` := (V) -> (E) -> proc(p)\n if not `is_element/dipaths`(V)(E)(p) then\n  return false;\n fi;\n\n return `is_trail/dipaths`(p);\nend:\n\n`list_small_elements/ditrails` := (V) -> (E) -> proc(n)\n option remember;\n local E0,E1,P,Q,p,v,F,i,e;\n\n if n = 0 then\n  return map(v -> [v],V);\n else\n  P := `list_small_elements/ditrails`(V)(E)(n-1);\n  Q := NULL;\n  for p in P do\n   E0 := {seq([p[i],p[i+1]],i=1..n-1)};\n   E1 := E minus E0;\n   v := p[1];\n   F := select(e -> e[2] = v,E1);\n   Q := Q,seq([e[1],op(p)],e in F);\n  od:\n  return [Q];\n fi;\nend:\n\n`random_small_element/ditrails` := (V) -> (E) -> (n) -> proc(num_tries := 10)\n local i,k,p,E0,E1,v,F,e;\n \n k := num_tries;\n\n if n = 0 then\n  if V = {} then\n   return FAIL;\n  else \n   return [random_element_of(V)()];\n  fi;\n elif n = 1 then\n  if E = {} then\n   return FAIL;\n  else\n   return random_element_of(E)();\n  fi;\n fi;\n \n while k > 0 do\n  p := `random_small_element/ditrails`(V)(E)(n-1)();\n  k := k - 1;\n  if p <> FAIL then\n   E0 := {seq([p[i],p[i+1]],i=1..n-1)};\n   E1 := E minus E0;\n   v := p[1];\n   F := select(e -> e[2] = v,E1);\n   if F <> {} then\n    e := random_element_of(F)();\n    return [e[1],op(p)];\n   fi;\n  fi;\n od;\n\n return FAIL;\nend:\n\n`is_leq/ditrails` := NULL:\n`count_elements/ditrails` := NULL:\n`count_small_elements/ditrails` := NULL:\n\n`roots/digraphs` := (V) -> proc(E)\n V minus map(e -> e[2],E);\nend:\n\n`root/digraphs` := (V) -> proc(E)\n local R;\n R := `roots/digraphs`(V)(E);\n if nops(R) = 1 then\n  return R[1];\n else\n  error \"Digraph does not have a unique root\";\n fi;\nend:\n\n`leaves/digraphs` := (V) -> proc(E)\n V minus map(e -> e[1],E);\nend:\n\n`is_forest/digraphs` := (V::set) -> proc(E)\n local NI,NO,R,v,U,U1;\n \n NI := `in_neighbour_table/digraphs`(V)(E);\n NO := `out_neighbour_table/digraphs`(V)(E);\n R := NULL;\n\n for v in V do\n  if nops(NI[v]) > 1 then\n   return false;\n  elif NI[v] = {} then\n   R := R,v;\n  fi;\n od;\n\n R := {R};\n\n U := R;\n U1 := {op(U),seq(op(NO[v]),v in U)};\n while nops(U1) > nops(U) do\n  U := U1;\n  U1 := {op(U),seq(op(NO[v]),v in U)};\n od:\n\n if U <> V then return false; fi;\n\n return true;\nend:\n\n`is_tree/digraphs` := (V) -> (E) ->\n nops(`roots/digraphs`(V)(E)) = 1 and \n  `is_forest/digraphs`(V)(E);\n\n`level_table/forest_digraphs` := (V) -> proc(E)\n local X,N,L,k,v;\n \n X := `roots/digraphs`(V)(E);\n N := `out_neighbour_table/digraphs`(V)(E);\n L := table():\n k := 0;\n while X <> {} do\n  for v in X do L[v] := k; od:\n  X := map(v -> op(N[v]),X);\n  k := k+1;\n od:\n\n return eval(L);\nend:\n\n`shadow_table/forest_digraphs` := (V) -> proc(E)\n local X,Y,Z,S,x,z,N,u;\n\n X := `leaves/digraphs`(V)(E);\n Y := V minus X;\n S := table():\n for x in X do S[x] := {x}; od:\n N := `out_neighbour_table/digraphs`(V)(E);\n while Y <> {} do\n  Z := select(y -> ((N[y] minus X) = {}),Y);\n  if Z = {} then\n   error \"Something wrong\";\n  fi;\n  z := Z[1];\n  S[z] := map(op,{seq(S[u],u in N[z])});\n  X := X union {z};\n  Y := Y minus {z};\n od:\n return eval(S);\nend:\n\n`shadow_set/forest_digraphs` := (V) -> proc(E)\n local S,v;\n S := `shadow_table/forest_digraphs`(V)(E);\n return {seq(S[v],v in V)};\nend:\n\n`is_element/stasheff_digraphs` := (V::set) -> proc(EL)\n local E,L,L0,r,i,TT,rTT;\n if not (type(EL,list) and nops(EL) = 2) then\n  return false;\n fi;\n\n E,L := op(EL);\n\n if not(`is_tree/digraphs`(V)(E)) then\n  return false;\n fi;\n\n L0 := `leaves/digraphs`(V)(E);\n if not({op(L)} = L0 and nops(L0) = nops(L)) then\n  return false;\n fi;\n\n r := table();\n for i from 1 to nops(L) do r[L[i]] := i; od;\n\n TT := `shadow_set/forest_digraphs`(V)(E);\n rTT := map(T -> map(v -> r[v],T),TT);\n\n return `and`(op(map(`is_element/posint_intervals`,rTT)));\nend:\n", "meta": {"hexsha": "b57f252679f28ff33f9484707b12be40f4acf2aa", "size": 7715, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/graphs/digraphs.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/graphs/digraphs.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/graphs/digraphs.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 18.7257281553, "max_line_length": 87, "alphanum_fraction": 0.5405055087, "num_tokens": 2960, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7931059609645724, "lm_q2_score": 0.7853085758631159, "lm_q1q2_score": 0.6228329127136363}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_mgga_x *)\n\n$include \"mgga_x_gx.mpl\"\n\nmmu := 0.001015549:\npbe_gx := x -> 1/(1 + mmu*x^2):\n\nf := (rs, x, t, u) ->\n  f_gx_a(malpha(x, t)) * pbe_gx(x):\n", "meta": {"hexsha": "a0dda602a245a7df781b3a37f202ee79e92be741", "size": 401, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/mgga_x_pbe_gx.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/mgga_x_pbe_gx.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/mgga_x_pbe_gx.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 22.2777777778, "max_line_length": 68, "alphanum_fraction": 0.6408977556, "num_tokens": 147, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.8902942319436397, "lm_q2_score": 0.6992544147913993, "lm_q1q2_score": 0.622542172149908}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_gga_c *)\n(* prefix:\n  gga_c_sogga11_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_c_sogga11_params * )(p->params);\n*)\n\n$define lda_c_pw_params\n$define lda_c_pw_modified_params\n$include \"lda_c_pw.mpl\"\n\nmbeta  := 15.75592*0.004235: (* the usual value of 0.066726 *)\nmalpha := mbeta/(16*2^(2/3)):\n\nyy := (rs, z, xt) -> -malpha*mphi(z)*xt^2/(rs*f_pw(rs, z)):\n\nf0 := (rs, z, xt) -> 1 - 1/(1 + yy(rs, z, xt)):\nf1 := (rs, z, xt) -> 1 - exp(-yy(rs, z, xt)):\n\nt0 := (rs, z, xt) -> add(params_a_sogga11_a[i]*f0(rs, z, xt)^(i-1), i=1..6):\nt1 := (rs, z, xt) -> add(params_a_sogga11_b[i]*f1(rs, z, xt)^(i-1), i=1..6):\n\nf_sogga11 := (rs, z, xt, xs0, xs1) ->\n  f_pw(rs, z)*(t0(rs, z, xt) + t1(rs, z, xt)):\n\nf  := (rs, z, xt, xs0, xs1) -> f_sogga11(rs, z, xt, xs0, xs1):", "meta": {"hexsha": "1b5e1db5e28609f9f95638f8d8bee2c518ba9da9", "size": 1023, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/gga_c_sogga11.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/gga_c_sogga11.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/gga_c_sogga11.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 29.2285714286, "max_line_length": 76, "alphanum_fraction": 0.5972629521, "num_tokens": 422, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9111796979521253, "lm_q2_score": 0.6825737279551494, "lm_q1q2_score": 0.6219473232682291}}
{"text": "# Proof by PDF that X <~ standardChiSq(2) == Y <~ exponential(2)\n\nPDF_chisq := (n, x) -> x^(1/2*n-1)*exp(-1/2*x)/(2^(1/2*n))/GAMMA(1/2*n); \nsimplify(PDF_chisq(2,x));\n\nPDF_exponential := (alpha, x) -> exp(-x/alpha)/alpha;\nsimplify(PDF_chisq(2,x));\n\nevalb(PDF_chisq(2,x) = PDF_exponential(2,x));", "meta": {"hexsha": "540a7d4bb2b9494c3d7366249c5b8515a88d4cf1", "size": 293, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "tests/RoundTrip2/t_exponential_to_stdChiSq.proof.mpl", "max_stars_repo_name": "vmchale/hakaru", "max_stars_repo_head_hexsha": "78922e13876e449d6812a55a11bf84c8eb0af4d6", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 327, "max_stars_repo_stars_event_min_datetime": "2015-01-03T08:56:51.000Z", "max_stars_repo_stars_event_max_datetime": "2022-01-24T12:12:06.000Z", "max_issues_repo_path": "tests/RoundTrip2/t_exponential_to_stdChiSq.proof.mpl", "max_issues_repo_name": "vmchale/hakaru", "max_issues_repo_head_hexsha": "78922e13876e449d6812a55a11bf84c8eb0af4d6", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 155, "max_issues_repo_issues_event_min_datetime": "2015-05-05T17:57:22.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-30T15:43:39.000Z", "max_forks_repo_path": "tests/RoundTrip2/t_exponential_to_stdChiSq.proof.mpl", "max_forks_repo_name": "vmchale/hakaru", "max_forks_repo_head_hexsha": "78922e13876e449d6812a55a11bf84c8eb0af4d6", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 38, "max_forks_repo_forks_event_min_datetime": "2015-01-23T16:25:37.000Z", "max_forks_repo_forks_event_max_datetime": "2021-03-14T15:09:12.000Z", "avg_line_length": 32.5555555556, "max_line_length": 73, "alphanum_fraction": 0.6211604096, "num_tokens": 125, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.8933093975331752, "lm_q2_score": 0.6959583187272711, "lm_q1q2_score": 0.6217061064104601}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n               2019 Susi Lehtola\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n(* prefix:\n  mgga_x_gx_params *params;\n\n  assert(p->params != NULL);\n  params = (mgga_x_gx_params * ) (p->params);\n*)\n\n$ifdef mgga_x_gx_params\nparams_a_c0       :=  0.827411:\nparams_a_c1       := -0.643560:\nparams_a_alphainf :=  0.852:\n$endif\n\ngx_alpha := (x, t) -> (t - x^2/8)/K_FACTOR_C:\n\ngx_cx0 := 4/3*(2/Pi)^(1/3):\ngx_cx1 := X_FACTOR_C:\n\ngx_gx0 := a ->\n  + gx_cx0/gx_cx1\n  + a*(params_a_c0 + params_a_c1*a)/(1.0 + (params_a_c0 + params_a_c1 - 1)*a) * (1 - gx_cx0/gx_cx1):\n\ngx_gx1 := a ->\n  1 + (1 - params_a_alphainf)*(1 - a)/(1 + a):\n\ngx_f_a := a->\n  + gx_gx0(a)*Heaviside(1 - a)\n  + gx_gx1(a)*Heaviside(a - 1):\n\ngx_f := (x, u, t) ->\n  gx_f_a(gx_alpha(x, t)):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) -> mgga_exchange(gx_f, rs, z, xs0, xs1, u0, u1, t0, t1):\n", "meta": {"hexsha": "33cd6e637cc83591c23d8df274630f85ee86a6ee", "size": 1059, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_gx.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_gx.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_gx.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 24.0681818182, "max_line_length": 100, "alphanum_fraction": 0.6024551464, "num_tokens": 440, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.90192067652954, "lm_q2_score": 0.6893056231680122, "lm_q1q2_score": 0.6216989939833097}}
{"text": "$ifndef _CLOSURE_\n$define _CLOSURE_\n\n# 寻找变换矩阵的闭包\n# 代入的条件只能是等于0的条件，目的在于删去一些系数之后再求闭包\ngetClosure:=proc(A::Matrix,sol:={})\n    local _a,_b,n;\n    n:=LinearAlgebra[RowDimension](A);\n    _a:=Matrix([seq(a[i],i=1..n)]);\n    _a:=subs(sol[],_a);\n    _b:=_a.A;\n    _b:=map(x->sym2ind(indets(x,specindex(a))),convert(_b,list));\n    return map(findClosure,[seq(1..n)],_b);\nend proc:\n\n# 提取a[k]的下标\nsym2ind:=proc(s::set)\n    return map(x->op(1,x),s);\nend proc:\n\n# 寻找某个元素所在的最小闭包\nfindClosure:=proc(k::integer,A::list)\n    local aset,bset;\n    aset:={};\n    bset:=A[k];\n    while aset<>bset do\n        aset:=bset;\n        bset:=`union`(bset,A[convert(bset,list)][]);\n    end do;\n    return aset;\nend proc:\n\n# 获取最小封闭\n# 输入参数为封闭的输出结果\n# 忽略空集\ngetMinClosure:=proc(c::list(set))\n    local ns,ind;\n    ns:=map(x->`if`(x={},infinity,numelems(x)),c);\n    ind:=min[index](ns);\n    return c[ind];\nend proc:\n\n$endif", "meta": {"hexsha": "4e921e6b137b4dd7601ea3fa9bc58ae41824ecdd", "size": 884, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "InvClassify/Closure.mpl", "max_stars_repo_name": "yu961549745/InvariantClassify", "max_stars_repo_head_hexsha": "eeb14ca2b39679e5a2da0f23888681ec7e2edd84", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "InvClassify/Closure.mpl", "max_issues_repo_name": "yu961549745/InvariantClassify", "max_issues_repo_head_hexsha": "eeb14ca2b39679e5a2da0f23888681ec7e2edd84", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "InvClassify/Closure.mpl", "max_forks_repo_name": "yu961549745/InvariantClassify", "max_forks_repo_head_hexsha": "eeb14ca2b39679e5a2da0f23888681ec7e2edd84", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 20.5581395349, "max_line_length": 65, "alphanum_fraction": 0.6108597285, "num_tokens": 375, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8397339756938818, "lm_q2_score": 0.740174367770488, "lm_q1q2_score": 0.6215495645546172}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n(* prefix:\n  mgga_x_br89_params *params;\n\n  assert(p->params != NULL);\n  params = (mgga_x_br89_params * )(p->params);\n*)\n\n$include \"mgga_x_br89.mpl\"\n\n(* This is only used in B00 *)\nparams_a_at := 0:\n\nbr89_y := Q -> 2*Pi^(2/3)/(3*Q):\n\n(* lower piece *)\npgk_a1 := 1.5255251812009530:\npgk_a2 := 0.4576575543602858:\npgk_a3 := 0.4292036732051034:\n\npgk_b  := [0.4771976183772063, -1.7799813494556270, 3.8433841862302150,\n       -9.5912050880518490, 2.1730180285916720, -30.425133851603660]:\n\npgk_c  := [0.7566445420735584, -2.6363977871370960, 5.4745159964232880,\n       -12.657308127108290, 4.1250584725121360, -30.425133957163840]:\n\npgk_d  := [0.00004435009886795587, 0.58128653604457910, 66.742764515940610,\n       434.26780897229770, 824.7765766052239000, 1657.9652731582120]:\n\npgk_e  := [0.00003347285060926091, 0.47917931023971350, 62.392268338574240,\n       463.14816427938120, 785.2360350104029000, 1657.962968223273000000]:\n\npgk_UB := 2.085749716493756:\n\npgk_x_lower := y -> (-arctan(pgk_a1*y + pgk_a2) + pgk_a3) *\n            add(pgk_c[i]*y^(i-1), i=1..6)/add(pgk_b[i]*y^(i-1), i=1..6):\n\npgk_x_upper := y -> (arccsch(pgk_UB*y) + 2) *\n            add(pgk_d[i]*y^(i-1), i=1..6)/add(pgk_e[i]*y^(i-1), i=1..6):\n\nbr89_mx := Q -> my_piecewise3(\n  br89_y(Q) <= 0,\n  pgk_x_lower(m_min(br89_y(Q), -br89_min_Q)),\n  pgk_x_upper(m_max(br89_y(Q),  br89_min_Q))\n):", "meta": {"hexsha": "e5591df3d45d7f75644db532bc2b131e51de9480", "size": 1614, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_br89_explicit.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_br89_explicit.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_br89_explicit.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 30.4528301887, "max_line_length": 75, "alphanum_fraction": 0.6765799257, "num_tokens": 666, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8887587993853654, "lm_q2_score": 0.6992544273261175, "lm_q1q2_score": 0.6214685252952614}}
{"text": "\n# Center of Mass Jacobian for the Robot based on MDH frames\n# Introduction\n# Berechnung der Schwerpunkts-Jacobi-Matrix (Veränderung des Schwerpunktes in Abhängigkeit der Gelenkwinkel).\n# Diese Matrix wird bei Gleichgewichtsregelungen (z.B. zweibeiniges Laufen) gebraucht.\n# \n# Dateiname:\n# robot -> Berechnung für allgemeinen Roboter\n# tree -> Berechnung für eine beliebige Baumstruktur (ohne Schleifen)\n# floatb -> floating base wird durch base twist (Geschwindigkeit der Basis) oder vollständige Orientierung (Euler-Winkel) berücksichtigt\n# rotmat -> Kinematik wird mit Rotationsmatrizen berechnet\n# kinematics_comjacobi -> Jacobi-Matrix der Körperschwerpunkte\n# worldframe -> Berechnung der Geschwindigkeit im Welt-KS (KSW)\n# par1 -> Parametersatz 1 (Schwerpunkt als Parameter: SX,SY,SZ)\n# Authors\n# Moritz Schappler, schappler@irt.uni-hannover.de, 2015-12\n# (C) Institut fuer Regelungstechnik, Leibniz Universitaet Hannover\n# \n# Sources\n# [SugiharaNakIno2002] Sugihara, T. and Nakamura, Y. and Inoue, H.: Real-time humanoid motion generation through ZMP manipulation based on inverted pendulum control (2002)\n# Initialization\ninterface(warnlevel=0): # Unterdrücke die folgende Warnung.\nrestart: # Gibt eine Warnung, wenn über Terminal-Maple mit read gestartet wird.\ninterface(warnlevel=3):\nwith(LinearAlgebra):\nwith(ArrayTools):\nwith(codegen):\nwith(CodeGeneration):\nwith(StringTools):\ncodegen_act := true:\ncodegen_opt := 2:\nread \"../helper/proc_convert_s_t\":\nread \"../helper/proc_convert_t_s\": \nread \"../helper/proc_MatlabExport\":\nread \"../transformation/proc_rotx\": \nread \"../transformation/proc_roty\": \nread \"../transformation/proc_rotz\": \nread \"../transformation/proc_trotx\": \nread \"../transformation/proc_troty\": \nread \"../transformation/proc_trotz\": \nread \"../transformation/proc_transl\": \nread \"../transformation/proc_trafo_mdh\": \nread \"../robot_codegen_definitions/robot_env\":\nprintf(\"Generiere Schwerpunktskinematik für %s\\n\", robot_name):\nread sprintf(\"../codeexport/%s/tmp/tree_floatb_definitions\", robot_name):\n# Ergebnisse der Kinematik laden\nread sprintf(\"../codeexport/%s/tmp/kinematics_floatb_%s_rotmat_maple.m\", robot_name, base_method_name):\nTrf := Trf:\nTrf_c := Trf_c:\n# Schwerpunkt des Roboters laden\nread sprintf(\"../codeexport/%s/tmp/kinematics_com_total_worldframe_floatb_%s_par1_maple.m\", robot_name, base_method_name):\n# Calculate CoG Jacobian\n# CoG Jacobian nach [SugiharaNakIno2002].\n# TODO: baseframe in worldframe ändern\nJ_COG_s := Matrix(3, NQJ):\nc_s := convert_t_s(c):\nfor i from 1 to 3 do\n  for j from 1 to NQJ do\n    J_COG_s(i,j) := diff(c_s(i,1), qJ_s(j,1)):\n  end:\nend:\n# TODO: Wenn der Ausdruck J_COG_s nicht gespeichert und wieder geladen wird, hängt die Berechnung bei der Optimierung des Ausdrucks mit \"tryhard\"\nsave J_COG_s, sprintf(\"../codeexport/%s/tmp/kinematics_Jcom_worldframe_floatb_%s_par1_maple.m\", robot_name, base_method_name):\nread sprintf(\"../codeexport/%s/tmp/kinematics_Jcom_worldframe_floatb_%s_par1_maple.m\", robot_name, base_method_name):\nif codegen_act then\n  MatlabExport(J_COG_s, sprintf(\"../codeexport/%s/tmp/com_jacobi_baseframe_par1_matlab.m\", robot_name), 2):\nend if:\n# CoG-Jacobian Time derivative\nJ_COG := convert_s_t(J_COG_s):\nJD_COG := diff~(J_COG, t):\nJD_COG_s := convert_t_s(JD_COG):\nif codegen_act then\n  MatlabExport(convert_t_s(JD_COG_s), sprintf(\"../codeexport/%s/tmp/com_jacobiD_baseframe_par1_matlab.m\", robot_name), codegen_opt):\nend if:\n\n", "meta": {"hexsha": "1a7978e4a82b9879491619eb146bd9a65c04af40", "size": 3420, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "robot_codegen_kinematics/robot_tree_floatb_rotmat_kinematics_comjacobi_worldframe_par1.mpl", "max_stars_repo_name": "SchapplM/robsynth-modelgen", "max_stars_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 2, "max_stars_repo_stars_event_min_datetime": "2020-05-25T07:31:46.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-15T09:54:50.000Z", "max_issues_repo_path": "robot_codegen_kinematics/robot_tree_floatb_rotmat_kinematics_comjacobi_worldframe_par1.mpl", "max_issues_repo_name": "SchapplM/robsynth-modelgen", "max_issues_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "robot_codegen_kinematics/robot_tree_floatb_rotmat_kinematics_comjacobi_worldframe_par1.mpl", "max_forks_repo_name": "SchapplM/robsynth-modelgen", "max_forks_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 45.0, "max_line_length": 171, "alphanum_fraction": 0.7780701754, "num_tokens": 1027, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.914900950352329, "lm_q2_score": 0.679178692681616, "lm_q1q2_score": 0.6213812313934629}}
{"text": "######################################################################\n\n`is_element/preord` := (A::set) -> proc(R)\n global reason;\n\n if not `is_element/autorel`(A)(R) then\n  reason := [convert(procname,string),\"R is not a relation on A\",R,A,reason];\n  return false;\n fi;\n\n if not(`is_reflexive/autorel`(A)(R)) then\n  reason := [convert(procname,string),\"R is not reflexive\",R];\n  return false;\n fi;\n \n if not(`is_transitive/autorel`(A)(R)) then\n  reason := [convert(procname,string),\"R is not transitive\",R];\n  return false;\n fi;\n \n return true;\nend;\n\n######################################################################\n\n`is_equal/preord`     := eval(`is_equal/autorel`);\n`is_separated/preord` := eval(`is_separated/autorel`);\n\n# We order the set of preorders by reverse inclusion, so that \n# separated preorders are maximal.\n\n`is_leq/preord`       := (A::set) -> proc(R,S)\n evalb(S minus R = {});\nend;\n \n\n`op/preord` := eval(`op/autorel`);\n\n######################################################################\n\n`random_element/preord` := (A::set) -> proc(R)\n local pi,n,r,i,a,b,N,RN,A2,RA;\n\n pi := `random_element/partitions`(A)();\n n := nops(pi);\n r := table();\n for i from 1 to n do\n  for a in pi[i] do\n   r[a] := i;\n  od:\n od:\n N := {seq(i,i=1..n)};\n RN := `random_element/partord`(N)();\n A2 := {seq(seq([a,b],b in A),a in A)};\n RA := select(u -> member([r[u[1]],r[u[2]]],RN),A2);\n\n return RA;\nend:\n\n######################################################################\n\n`is_total/preord` := (A::set) -> proc(R)\n local U,a,b;\n\n U := R union `op/preord`(A)(R);\n U := {seq(seq([a,b],b in A),a in A)} minus U;\n\n return evalb(U = {}); \nend;\n\n######################################################################\n\n`strictify/preord` := (A::set) -> proc(R)\n return R minus `op/preord`(A)(R);\nend:\n\n######################################################################\n\n`res/preord` := (A::set,B::set) -> (R) ->\n select(xy -> member(xy[1],B) and member(xy[2],B),R);\n\n######################################################################\n\n`block_partition/preord` := (A::set) -> proc(R)\n local E,pi,X,x,B;\n\n E := R intersect map(ab -> [ab[2],ab[1]],R);\n pi := NULL;\n X := A;\n\n while X <> {} do\n  x := X[1];\n  B := map(ab -> ab[2],select(ab -> ab[1] = x,E));\n  pi := pi,B;\n  X := X minus B;\n od:\n\n pi := {pi};\n\n return pi;\nend:\n\n######################################################################\n# Note that the function below is not actually a rank function, but\n# it is an ingredient in certain rank functions to be defined \n# elsewhere.\n\n`rank/preord` := (A::set) -> proc(R)\n nops(`block_partition/preord`(A)(R));\nend:\n\n######################################################################\n\n`bump/preord` := (A::set) -> proc(R)\n local pi,B,a,b,B0,R0;\n\n pi := `block_partition/preord`(A)(R);\n\n for B in pi do \n  if nops(B) > 1 then\n   a := B[1];\n   B0 := B minus {a};\n   R0 := R minus {seq([b,a],b in B0)};\n   return R0;\n  fi;\n od;\n\n return FAIL;\nend:\n\n######################################################################\n\n`rank_table/preord` := (A::set) -> proc(R)\n local pi,pi0,a,b,r,k,B;\n \n pi := `block_partition/preord`(A)(R);\n pi0 := map(B -> B[1],pi);\n r := table():\n for B in pi do\n  k := nops(select(a -> member([a,B[1]],R),pi0)) - 1;\n  for b in B do r[b] := k; od;\n od;\n\n return eval(r);\nend;\n\n######################################################################\n\n`separated_quotient/preord` := (A::set) -> proc(R)\n local A0,R0,a0,b0;\n\n A0 := `block_partition/preord`(A)(R);\n R0 := NULL;\n for a0 in A0 do\n  for b0 in A0 do\n   if member([a0[1],b0[1]],R) then\n    R0 := R0,[a0,b0];\n   fi;\n  od;\n od;\n R0 := {R0};\n\n return [A0,R0];\nend: \n\n######################################################################\n\n`preord_is_leq` := (A::set) -> (R) -> (a,b) -> member([a,b],R);\n\n######################################################################\n\n`preord_is_equiv` := (A::set) -> (R) -> (a,b) ->\n  member([a,b],R) and member([b,a],R);\n\n######################################################################\n\n`preord_is_less` := (A::set) -> (R) -> (a,b) ->\n  member([a,b],R) and not(member([b,a],R));\n\n\n", "meta": {"hexsha": "16a7ca179db9930b335c1d713ff79d3c10dc5d16", "size": 4125, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/preord.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/preord.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/preord.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 22.7900552486, "max_line_length": 77, "alphanum_fraction": 0.4269090909, "num_tokens": 1179, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8596637577007394, "lm_q2_score": 0.7217432062975979, "lm_q1q2_score": 0.620456476820773}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_gga_c *)\n\n$include \"gga_c_tca.mpl\"\n\nmsinc := x -> piecewise(x = 0, 1, sin(x)/x):\naa    := Pi*(9*Pi/4)^(1/3):\n\nfD := (rs, z, s) -> 1 - z^4*(1 - msinc(aa*s/rs)^2):\n\nf := (rs, z, xt, xs0, xs1) -> \n  f_tcs(rs, z, xt)*fD(rs, z, X2S*2^(1/3)*xt):", "meta": {"hexsha": "62a3001bb986405adfa424e73c4de146a9665abc", "size": 492, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/gga_c_revtca.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/gga_c_revtca.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/gga_c_revtca.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 25.8947368421, "max_line_length": 68, "alphanum_fraction": 0.5914634146, "num_tokens": 197, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.88720460564669, "lm_q2_score": 0.6992544210587585, "lm_q1q2_score": 0.6203817428821403}}
{"text": "knights_tour_map := [\n [ 0, 5, 2,57,62,15,18,21],\n [ 3,56,63,14, 9,20,61,16],\n [ 6, 1, 4,43,58,17,22,19],\n [55,44,27, 8,13,10,39,60],\n [28, 7,42,45,40,59,12,23],\n [51,54,49,26,11,36,33,38],\n [48,29,52,41,46,31,24,35],\n [53,50,47,30,25,34,37,32]\n];\n\nknights_tour_pos := table():\nknights_tour_opos := table():\n\nfor i from 0 to 7 do\n for j from 0 to 7 do\n  knights_tour_pos[knights_tour_map[i+1,j+1]] := [i,j];\n  knights_tour_opos[knights_tour_map[i+1,j+1]] := [i,j] +~ [0.5,0.5];\n od:\nod:\nknights_tour_pos[64] := knights_tour_pos[0]:\nknights_tour_opos[64] := knights_tour_opos[0]:\n\nchess_grid := display(\n seq(line([i,0],[i,8],colour=grey),i=0..8),\n seq(line([0,i],[8,i],colour=grey),i=0..8),\n scaling=constrained,axes=none\n):\n\nshaded_chess_grid := display(\n seq(seq(rectangle([2*i+1,2*j+1],[2*i+2,2*j],colour=grey),j=0..3),i=0..3),\n seq(seq(rectangle([2*i,2*j+2],[2*i+1,2*j+1],colour=grey),j=0..3),i=0..3),\n chess_grid\n);\n\nknights_tour_plot := display(\n shaded_chess_grid,\n seq(line(knights_tour_opos[i],knights_tour_opos[i+1],colour=red),i=0..63),\n scaling=constrained,axes=none\n);\n\nis_knight_move := (u,v) -> evalb({op(map(abs,u -~ v))} = {1,2});\n\ncheck_knights_tour := proc()\n evalb(sort(map(op,knights_tour_map)) = [seq(i,i=0..63)]) and\n `and`(seq(is_knight_move(knights_tour_pos[i],knights_tour_pos[i+1]),i=0..63));\nend:\n", "meta": {"hexsha": "34362fe14b618dd42c260f8737035122d349d9e3", "size": 1325, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/graphs/knight.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/graphs/knight.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/graphs/knight.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 27.6041666667, "max_line_length": 79, "alphanum_fraction": 0.6437735849, "num_tokens": 581, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8006920020959545, "lm_q2_score": 0.7745833945721304, "lm_q1q2_score": 0.6202027289902398}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\nsg4_mu1     := 0.042:\nsg4_mu2     := 0.26 - sg4_mu1:\nsg4_nu_MGE4 := -0.195:\nsg4_k2      := -sg4_mu2^2/sg4_nu_MGE4:\nsg4_k1      := 0.804 - sg4_k2:\n\nsg4_f0 := s -> 1 + sg4_k1 + sg4_k2\n   - sg4_k1*(1 - sg4_mu1*s^2/sg4_k1)/(1 - (sg4_mu1*s^2/sg4_k1)^5)\n   - sg4_k2/(1 + sg4_mu2*s^2/sg4_k2):\nsg4_f:= x -> sg4_f0(X2S*x):\n\nf := (rs, zeta, xt, xs0, xs1) -> gga_exchange(sg4_f, rs, zeta, xs0, xs1):\n", "meta": {"hexsha": "d2a3546149371e8a8e02cc6de98b1888fe5c3bfd", "size": 649, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_sg4.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_sg4.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_sg4.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 28.2173913043, "max_line_length": 73, "alphanum_fraction": 0.62403698, "num_tokens": 287, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9416541561135442, "lm_q2_score": 0.6584174938590246, "lm_q1q2_score": 0.6200015695502145}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n               2019 Susi Lehtola\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_c_am05_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_c_am05_params * )(p->params);\n*)\n\n$define lda_c_pw_params\n$define lda_c_pw_modified_params\n$include \"lda_c_pw.mpl\"\n\nXX := s -> 1/(1 + params_a_alpha*s^2):\nff := s -> XX(s) + params_a_gamma*(1 - XX(s)):\n\nf := (rs, z, xt, xs0, xs1) -> f_pw(rs, z)*(\n  + opz_pow_n( z,1)/2 * ff(X2S*xs0)\n  + opz_pow_n(-z,1)/2 * ff(X2S*xs1)\n):\n", "meta": {"hexsha": "93e13589d555b3cefa783341ac41deca7ad84ee8", "size": 700, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_am05.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_am05.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_am05.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 24.1379310345, "max_line_length": 68, "alphanum_fraction": 0.6342857143, "num_tokens": 248, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9073122163480667, "lm_q2_score": 0.682573734412324, "lm_q1q2_score": 0.6193074877906224}}
{"text": "\n# Berechne kinematische Zwangsbedingungen für Fünfgelenkkette\n\n# Einleitung\n# Die kinematischen Zwangsbedingungen werden als Ersetzungsausdruck für die abhängigen Winkel aufgestellt.\n# \n# fivebar1TE -> Fünfgelenkkette, Modellierung der Zwangsbedingungen mit trigonometrischer Elimination der Winkel\n# kinematic_constraint -> Berechnungen zu kinematischen Zwangsbedingungen\n\n# Quelle\n# SA Bejaoui: Bejaoui2018_S749; \"Modellierung kinematischer Zwangsbedingungen für hybride serielle Roboter mit planaren Parallelmechanismen\"\n# (Fünfgelenkkette S. 23 in [Bejaoui2018_S749])\n# Autor\n# Abderahman Bejaoui, Moritz Schappler\n# Studienarbeit bei: Moritz Schappler, moritz.schappler@imes.uni-hannover.de, 2019-01\n# (C) Institut fuer Mechatronische Systeme, Leibniz Universitaet Hannover\n# Initialisierung\ninterface(warnlevel=0): # Unterdrücke die folgende Warnung.\nrestart: # Gibt eine Warnung, wenn über Terminal-Maple mit read gestartet wird.\ninterface(warnlevel=3):\nkin_constraints_exist := true: # Für Speicherung\n;\nwith(StringTools): # Für Zeitausgabe\nwith(LinearAlgebra):\nwith(codegen):\nwith(CodeGeneration):\n#with(ListTools):\ncodegen_act := true:\ncodegen_opt := 2:\nread \"../helper/proc_MatlabExport\":\nread \"../helper/proc_simplify2\":\nread \"../helper/proc_convert_s_t\":\nread \"../helper/proc_convert_t_s\":\nread \"../robot_codegen_constraints/proc_subs_kintmp_exp\":\nread \"../helper/proc_intersect_circle\":\nwith(RealDomain): # Schränkt alle Funktionen auf den reellen Bereich ein. Muss nach Definition von MatlabExport kommen. Sonst geht dieses nicht.\n;\nread \"../robot_codegen_definitions/robot_env\":\nread sprintf(\"../codeexport/%s/tmp/tree_floatb_definitions\",robot_name):\nuse_simplify := 0: # keine zusätzlichen simplify-Befehle\n;\n# Variable mit Winkeln der Nebenstruktur nur in Abhängigkeit der verallgemeinerten Koordinaten\nkintmp_qs := Matrix(RowDimension(kintmp_s),1):\nfor i from 1 to RowDimension(kintmp_s) do\n  if diff(kintmp_s(i,1), t) = 0 then\n    kintmp_qs(i,1) := kintmp_s(i,1):\n  end if:\nend do:\n# Ersetzungsausdrücke definieren.\n# Speichere Sinus und Cosinus der Winkel direkt ab, da diese in den Rotationsmatrizen direkt auftreten.\n# Spalte 1: Zu suchender Ausdruck (sin oder cos eines Winkels)\n# Spalte 2: Einzusetzender Ausdruck.\n# Dadurch werden arctan-Ausdrücke in der direkten Kinematik reduziert.\nkintmp_subsexp := Matrix(2*RowDimension(kintmp_s),2):\nfor i from 1 to RowDimension(kintmp_s) do\n  kintmp_subsexp(2*i-1, 1) := sin(kintmp_s(i,1)):\n  kintmp_subsexp(2*i,   1) := cos(kintmp_s(i,1)):\n  # Initialisierung der rechten Spalte mit gleichen Werten. Später nur Ersetzung, wenn Vorteilhaft.\n  kintmp_subsexp(2*i-1, 2) := kintmp_subsexp(2*i-1, 1):\n  kintmp_subsexp(2*i,   2) := kintmp_subsexp(2*i,   1):\nend do:\nprintf(\"%s. Beginn der Berechnungen.\\n\", FormatTime(\"%Y-%m-%d %H:%M:%S\")):\nst := time():\n# Zwangsbedingungen mit Kreisschnittpunkt D zur Bestimmung von rho\nr_p1:=<AE*cos(qJ1s), AE*sin(qJ1s)>:\nr_p2:=<AB+BC*cos(qJ2s), BC*sin(qJ2s)>:\nr1:=ED:\nr2:=CD:\nA:=intersect_circle(r_p1, r_p2, r1, r2):\n# Es gibt zwei Lösungen für den Kreisschnittpunkt. Bei der gewählten Definition der Kreise ist die erste Lösung in der Fünfgelenkkette und die zweite außen (für die gewählten Beispiel-Parameter).\n# Die zweite Lösung entspricht der gewählten Lösung in [Bejaoui2018_S749]\nr_s1x:=simplify(A(1,2),trig):\nr_s1y:=simplify(A(2,2),trig):\n# Zwangsbedingungen für eta, zweiter Weg zum Kreisschnittpunkt D über B\nradx1:=AB+BC*cos(qJ2s)+CD*(cos(qJ2s)*cos(eta_s)-sin(qJ2s)*sin(eta_s)):\nrady1:=BC*sin(qJ2s)+CD*(sin(qJ2s)*cos(eta_s)+cos(qJ2s)*sin(eta_s)):\nf11:=r_s1x-radx1=0: #GL3\n;\nf12:=r_s1y-rady1=0: #GL4\n;\n# Zwangsbedingungen für xi , zwei Wege Punkt E\nracx1:=AE*cos(qJ1s):\nracy1:=AE*sin(qJ1s):\nracx2:=AB+BC*cos(qJ2s)+CD*(cos(qJ2s)*cos(eta_s)-sin(qJ2s)*sin(eta_s))+ED*(cos(qJ2s)*(cos(eta_s)*cos(xi_s)-sin(eta_s)*sin(xi_s))-sin(qJ2s)*(cos(xi_s)*sin(eta_s)+cos(eta_s)*sin(xi_s))):\nracy2:=BC*sin(qJ2s)+CD*(sin(qJ2s)*cos(eta_s)+cos(qJ2s)*sin(eta_s))+ED*(sin(qJ2s)*(cos(eta_s)*cos(xi_s)-sin(eta_s)*sin(xi_s))+cos(qJ2s)*(cos(xi_s)*sin(eta_s)+cos(eta_s)*sin(xi_s))):\nf21:=racx1-racx2=0:  # GL5\n;\nf22:=racy1-racy2=0:  # GL6\n;\n# Bestimme Winkel\n# eta bestimmen\nsol1:=solve({f11,f12},{cos(eta_s),sin(eta_s)}): \nassign(sol1):\ncos_eta_s:=simplify(rhs(sol1[1]),trig):\nsin_eta_s:=simplify(rhs(sol1[2]),trig):\n# xi bestimmen\nsol2:=solve({f21,f22},{cos(xi_s),sin(xi_s)}):\nsol2:=op(sol2):\ncos_xi_s:=simplify(rhs(sol2[1]),trig):\nsin_xi_s:=simplify(rhs(sol2[2]),trig):\n# rho bestimmen\ncos_psi_phi:=cos(qJ2s)*cos(qJ1s)+sin(qJ2s)*sin(qJ1s): # cos(psi-phi)\n;\ncos_eta_xi:=cos_eta_s*cos_xi_s-sin_eta_s*sin_xi_s: # cos(eta+xi)\n;\nsin_psi_phi:=sin(qJ2s)*cos(qJ1s)-cos(qJ2s)*sin(qJ1s): # sin(psi-phi)\n;\nsin_eta_xi:=sin_eta_s*cos_xi_s+cos_eta_s*sin_xi_s: #sin(eta+xi)\n;\ncos_rho_s:=cos_psi_phi*cos_eta_xi-sin_psi_phi*sin_eta_xi:\nsin_rho_s:=sin_psi_phi*cos_eta_xi+cos_psi_phi*sin_eta_xi:\n# Cos-und Sinus-Terme zuweisen\n\nkintmp_subsexp(1,2):=sin_rho_s:\nkintmp_subsexp(2,2):=cos_rho_s:\nkintmp_subsexp(3,2):=sin_eta_s:\nkintmp_subsexp(4,2):=cos_eta_s:\nkintmp_subsexp(5,2):=sin_xi_s:\nkintmp_subsexp(6,2):=cos_xi_s:\n# Terme vereinfachen\n\nif use_simplify>=1 then # bringt leider nichts\n  tmp_t0 := time():\n  tmp_l0 := length(kintmp_subsexp):\n  printf(\"%s: Vereinfache Ersetzungsausdrücke für Zwangsbedingungen. Länge: %d.\\n\", \\\n    FormatTime(\"%Y-%m-%d %H:%M:%S\"), tmp_l0):\n  for i from 1 to RowDimension(kintmp_subsexp) do\n    tmp_t1 := time():\n    tmp_l1 := length(kintmp_subsexp(i,2)): # es kann sowieso nur einer der beiden Informationen enthalten\n    printf(\"%s: Vereinfache Ersetzungsausdruck %d (%s). Länge: %d.\\n\", \\\n      FormatTime(\"%Y-%m-%d %H:%M:%S\"), i, String(kintmp_subsexp(i,1)), tmp_l1):\n    kintmp_subsexp(i,2) := simplify2(kintmp_subsexp(i,2)):\n    tmp_t2 := time():\n    tmp_l2 := length(kintmp_subsexp(i,2)):\n    printf(\"%s: Ersetzungsausdruck %d (%s) vereinfacht. Länge: %d->%d. Rechenzeit %1.1fs.\\n\", \\\n      FormatTime(\"%Y-%m-%d %H:%M:%S\"), i, String(kintmp_subsexp(i,1)), tmp_l1, tmp_l2, tmp_t2-tmp_t1):\n  end do:\n  tmp_l3 := length(kintmp_subsexp):\n  printf(\"%s: Ersetzungsausdrücke vereinfacht. Länge: %d->%d. Rechenzeit %1.1fs.\\n\", \\\n    FormatTime(\"%Y-%m-%d %H:%M:%S\"), tmp_l0, tmp_l3, tmp_t2-tmp_t0):\nend if:\n# Winkel zuweisen:\nkintmp_qs(1,1):=%arctan(sin_rho_s,cos_rho_s):\nkintmp_qs(2,1):=%arctan(sin_eta_s,cos_eta_s):\nkintmp_qs(3,1):=%arctan(sin_xi_s,cos_xi_s):\n# Exportiere Code für folgende Skripte\n# \n# Die Annahmen sind im Ausdruck bereits in den Variablen gespeichert. Ersetze das \"~\"-Zeichen.\n# Quelle: http://www.mapleprimes.com/questions/207601-Remove-Assumptions\nwinkel := <<sin_xi|sin(xi_s)>; <cos_xi|cos(xi_s)>; <sin_rho | sin(rho_s)>; <cos_rho | cos(rho_s)>;<sin_eta | sin(eta_s)>; <cos_eta | cos(eta_s)>>:\nsave winkel, sprintf(\"../codeexport/fivebar1TE/tmp/kinematic_constraints_maple_inert\"):\nkintmp_qt := convert_s_t(kintmp_qs):\n# Speichere Maple-Ausdruck (Eingabe-Format und internes Format)\nsave kintmp_subsexp, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_kintmp_subsexp_maple\", robot_name):\nsave kintmp_subsexp, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_kintmp_subsexp_maple.m\", robot_name):\nprintf(\"%s. Ausdrücke für kintmp_subsexp gespeichert (Maple). CPU-Zeit bis hier: %1.2fs.\\n\", FormatTime(\"%Y-%m-%d %H:%M:%S\"), time()-st):\nfor i from 1 to RowDimension(kintmp_s) do\n  tmp := kintmp_qs(i):\n  save tmp, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_maple_inert_kintmpq_%d\", robot_name, i):\n  save tmp, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_maple_inert_kintmpq_%d.m\", robot_name, i):\nend do:\nsave kin_constraints_exist, kintmp_qs, kintmp_qt,kintmp_subsexp, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_maple_inert\", robot_name):\nsave kin_constraints_exist, kintmp_qs, kintmp_qt, kintmp_subsexp, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_maple_inert.m\", robot_name):\nprintf(\"%s. Ausdrücke mit Inert-Arctan exportiert (Matlab). CPU-Zeit bis hier: %1.2fs.\\n\", FormatTime(\"%Y-%m-%d %H:%M:%S\"), time()-st):\n# Liste mit abhängigen konstanten Kinematikparametern erstellen (wichtig für Matlab-Funktionsgenerierung)\nread \"../helper/proc_list_constant_expressions\";\nkc_symbols := Matrix(list_constant_expressions( kintmp_subsexp ));\nsave kc_symbols, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_symbols_list_maple\", robot_name):\nMatlabExport(kc_symbols, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_symbols_list_matlab.m\",robot_name),2);\nprintf(\"%s. Zwangsbedingungen berechnet. CPU-Zeit bis hier: %1.2fs.\\n\", FormatTime(\"%Y-%m-%d %H:%M:%S\"), time()-st):\n\n# \n\n", "meta": {"hexsha": "7585d45c85c63a13e9dec1b8f94241be5c1a29cb", "size": 8540, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "systems/fivebar1/codegen/fivebar1TE_kinematic_constraints.mpl", "max_stars_repo_name": "SchapplM/robsynth-serhybroblib", "max_stars_repo_head_hexsha": "8e4d39cf919a85a5d3d54391b699ae51ada191a1", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "systems/fivebar1/codegen/fivebar1TE_kinematic_constraints.mpl", "max_issues_repo_name": "SchapplM/robsynth-serhybroblib", "max_issues_repo_head_hexsha": "8e4d39cf919a85a5d3d54391b699ae51ada191a1", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "systems/fivebar1/codegen/fivebar1TE_kinematic_constraints.mpl", "max_forks_repo_name": "SchapplM/robsynth-serhybroblib", "max_forks_repo_head_hexsha": "8e4d39cf919a85a5d3d54391b699ae51ada191a1", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 49.0804597701, "max_line_length": 195, "alphanum_fraction": 0.7446135831, "num_tokens": 3110, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9019206844384594, "lm_q2_score": 0.6859494614282923, "lm_q1q2_score": 0.618672007741598}}
{"text": "\n# Calculate Jacobi-Matrix based on MDH-Frames\n# Introduction\n# Jacobi-Matrix für Roboterkinematik basierend auf MDH-Parametern berechnen.\n# Die Berechnung erfolgt durch symbolische Ableitung der Transformationsmatrizen für jeden Körper\n# \n# robot -> Berechnung für allgemeinen Roboter\n# tree -> Berechnung für eine beliebige Baumstruktur (ohne Schleifen)\n# rotmat -> Kinematik wird mit Rotationsmatrizen berechnet\n# jacobian -> Berechnung der Jacobi-Matrix\n# baseframe -> Berechnung der Jacobi-Matrix bezogen auf das Basis-Koordinatensystem des Roboters (nicht: Welt-KS)\n\n# Tests\n# \n# Autor\n# Moritz Schappler, schappler@irt.uni-hannover.de, 2016-10\n# (C) Institut fuer Regelungstechnik, Leibniz Universitaet Hannover\n# \n# Sources\n# [SchapplerTapOrt2019] Schappler, M. et al.: Resolution of Functional Redundancy for 3T2R Robot Tasks using Two Sets of Reciprocal Euler Angles, Proc. of the 15th IFToMM World Congress, 2019\n# [Ortmaier2014] Vorlesungsskript Robotik I\n# [Ortmaier2014a] Vorlesungsskript Robotik II\n# Initialization\ninterface(warnlevel=0): # Unterdrücke die folgende Warnung.\nrestart: # Gibt eine Warnung, wenn über Terminal-Maple mit read gestartet wird.\ninterface(warnlevel=3):\nwith(LinearAlgebra):\nwith(ArrayTools):\nwith(codegen):\nwith(CodeGeneration):\nwith(StringTools):\ncodegen_act := true:\ncodegen_debug := false:\ncodegen_opt := 2:\ncodegen_jacobi := 3: # 1=nur Position, 2=Rotationsmatrix-Jacobi, 3=mit Zeitableitung\n;\n# Funktionen aus Robotik-Repo\nread(\"../robotics_repo_path\"): # Lädt Variable robotics_repo_path\n;\nread(sprintf(\"%s/transformation/maple/proc_r2eulxyz_inert\", robotics_repo_path)):\n# Funktionen aus diesem Repo\nread sprintf(\"../helper/proc_MatlabExport\"):\nread sprintf(\"../transformation/proc_transl\"):\nread \"../helper/proc_convert_s_t\":\nread \"../helper/proc_convert_t_s\":\n# Roboter-Definitionen\nread \"../robot_codegen_definitions/robot_env\":\nread sprintf(\"../codeexport/%s/tmp/tree_floatb_definitions\", robot_name):\n# Ergebnisse der Kinematik laden\nread sprintf(\"../codeexport/%s/tmp/kinematics_floatb_%s_rotmat_maple.m\", robot_name, base_method_name):\nTrf := Trf:\nTrf_c := Trf_c:\n# Eliminiere die Basis-Position und Orientierung. Darf keinen Einfluss auf die Jacobi-Matrix haben.\n# Bei komplizierten Ausdrücken (insbesondere bei kinematischen Zwangsbedingungen) können die Symbole manchmal nicht eliminiert werden\nfor i from 1 to NQB do\n  Trf_c := subs({X_base_t[i,1]=0},Trf_c):\nend do:\n# Link-Index, für den die Jacobi-Matrix aufgestellt wird. Hier wird angenommen, dass der Endeffektor das letzte Segment (=Link) ist. Die Jacobi-Matrix kann hier aber für beliebige Segmente aufgestellt werden. (0=Basis)\nLIJAC:=NL-1:\nprintf(\"Generiere Jacobi-Matrix für %s (Körper %d)\\n\", robot_name, LIJAC):\n# Jacobi-Matrix analytisch (Translatorisch)\n# Ortmaier2014a Gl. (1.15), S.14: Geometrische Zwangsbedingungen in impliziter Form\n# Gleichung enthält verallgemeinerte Koordinaten und Endeffektorposition und ergibt Null.\nx_EE := Matrix(3,1,<r_xEE; r_yEE; r_zEE>):\n# Transformationsmatrix von der Basis zum gegebenen Punkt auf dem Körper. Die Koordinaten px,py,pz für den Punkt werden später eingesetzt.\nT_p := Trf_c(1 .. 4, 1..4, LIJAC+1) . transl(<px;py;pz>):\nh_transl := Matrix(T_p(1..3,4)) - x_EE:\nh_transl_s :=convert_t_s(h_transl):\n# Jacobi-Matrix der inversen Kinematik\nb_transl := Matrix(3, NQJ):\nfor i from 1 to 3 do\n  for j from 1 to NQJ do\n    b_transl(i,j) := diff(h_transl_s(i,1), qJ_s(j,1)):\n  end do:\nend do:\n# Export\nsave b_transl, sprintf(\"../codeexport/%s/tmp/jacobia_transl_%d_maple.m\", robot_name, LIJAC):\n# Ausdruck muss nochmal geladen werden, ansonsten hängt sich die Code-Optimerung mit \"tryhard\" auf.\n# TODO: Klären warum das so ist und Problem beheben.\nread sprintf(\"../codeexport/%s/tmp/jacobia_transl_%d_maple.m\", robot_name, LIJAC):\nb_transl := b_transl:\nif codegen_act and codegen_debug then\n  for i from 1 to 3 do\n    for j from 1 to NQJ do\n      MatlabExport(b_transl(i,j), sprintf(\"../codeexport/%s/tmp/jacobia_transl_%d_floatb_%s_%d_%d_matlab.m\", robot_name, LIJAC, base_method_name, i, j), codegen_opt):\n    end do:\n  end do:\nend if:\nif codegen_act then\n  MatlabExport(b_transl, sprintf(\"../codeexport/%s/tmp/jacobia_transl_%d_floatb_%s_matlab.m\", robot_name, LIJAC, base_method_name), codegen_opt):\nend if:\n# Jacobi-Matrix analytisch (Rotatorisch)\n# Ortmaier2014a Gl. (1.15), S.14: Geometrische Zwangsbedingungen in impliziter Form\n# Rotationsdarstellung des Endeffektors in RPY-Winkeln\nxo_EE := Matrix(3,1,<phi_xEE; phi_yEE; phi_zEE>):\n# r2eulxyz_inert liefert inert-arctan (%). Auswertung vor Export dauert zu lange. In exportiertem Matlab-Code muss \"%arctan\" händisch gegen \"atan2\" getauscht werden.\nh_rota_rpy := r2eulxyz_inert(T_p) - xo_EE: \nh_rota_s :=convert_t_s(h_rota_rpy):\n# Jacobi-Matrix der inversen Kinematik\n# Falls die RPY-Darstellung für dieses Körper-KS singulär ist, existiert die analytische Jacobi-Matrix nicht. Maple gibt dann einen Fehler aus. Die Kennzeichnung mit NaN sorgt dafür, dass dies in Matlab erkennbar ist.\n# Die Singularität kann bei kinematischen Strukturen am Anfang auftreten.\nb_rota := Matrix(3, NQJ):\nfor i from 1 to 3 do\n  for j from 1 to NQJ do\n    if T_p(3,3) = 0 then\n      b_rota(i,j) := NaN: # Singulär\n    else\n      b_rota(i,j) := diff(h_rota_s(i,1), qJ_s(j,1)):\n    end if:\n  end do:\nend do:\n# Export\nsave b_rota, sprintf(\"../codeexport/%s/tmp/jacobia_rot_%d_maple.m\", robot_name, LIJAC):\n# Ausdruck nochmal laden.\nread sprintf(\"../codeexport/%s/tmp/jacobia_rot_%d_maple.m\", robot_name, LIJAC):\nb_rota := b_rota:\n# Einzelne Ausdrücke als Code exportieren (falls Gesamtausdruck zu komplex ist)\nif codegen_act and codegen_debug then\n  for i from 1 to 3 do\n    for j from 1 to NQJ do\n      MatlabExport(b_rota(i,j), sprintf(\"../codeexport/%s/tmp/jacobia_rot_%d_floatb_%s_%d_%d_matlab.m\", robot_name, LIJAC, base_method_name, i, j), codegen_opt):\n    end do:\n  end do:\nend if:\nif codegen_act then\n  interface(warnlevel=0): # Unterdrücke die Warnung für arctan\n  MatlabExport(b_rota, sprintf(\"../codeexport/%s/tmp/jacobia_rot_%d_floatb_%s_matlab.m\", robot_name, LIJAC, base_method_name), codegen_opt):\n  interface(warnlevel=3):\nend if:\n# Jacobi-Matrix geometrisch (Rotatorisch)\n# Zusammenhang zwischen Geschwindigkeit der verallgemeinerten Koordinaten und Winkelgeschwindigkeit des Endeffektors ausgedrückt im Basis-Koordinatensystems\nread sprintf(\"../codeexport/%s/tmp/velocity_worldframe_floatbase_%s_par1_maple.m\", robot_name, base_method_name):\nomega_W_i := omega_W_i:\n# Basis-Terme entfernen (falls durch Maple später nicht möglich, s.o.)\nfor i from 1 to NQB do\n  omega_W_i := subs({X_base_t[i,1]=0},omega_W_i):\n  omega_W_i := subs({V_base_t[i,1]=0},omega_W_i):\nend do:\n# Winkelgeschwindigkeit als allgemeiner Ausdruck (nicht über Gelenk-Konfiguration)\n# (fällt später sowieso weg)\nomega_EE := Matrix(3,1,<omega_xEE; omega_yEE; omega_zEE>):\n# Differenz als kinematische Zwangsbedingung aufstellen\nh_rotg := Matrix(omega_W_i(1..3,LIJAC+1)) - omega_EE:\nh_rotg_s :=convert_t_s(h_rotg):\n# Jacobi-Matrix der inversen Kinematik\n# Leite die Winkelgeschwindigkeiten des Endeffektors nach den Gelenkwinkelgeschwindigkeiten ab.\n# Damit wird der Zusammenhang nach Ortmaier2014 Gl. (4.17), S.51 umgeformt.\nb_rotg := Matrix(3, NQJ):\nfor i from 1 to 3 do\n  for j from 1 to NQJ do\n    b_rotg(i,j) := diff(h_rotg_s(i,1), qJD_s(j,1)):\n  end do:\nend do:\nB_s := b_rotg:\n# Export\nsave b_rotg, sprintf(\"../codeexport/%s/tmp/jacobig_rot_%d_maple.m\", robot_name, LIJAC):\n# Ausdruck nochmal laden.\nread sprintf(\"../codeexport/%s/tmp/jacobig_rot_%d_maple.m\", robot_name, LIJAC):\nb_rotg := b_rotg:\nif codegen_act and codegen_debug then\n  for i from 1 to 3 do\n    for j from 1 to NQJ do\n      MatlabExport(b_rotg(i,j), sprintf(\"../codeexport/%s/tmp/jacobig_rot_%d_floatb_%s_%d_%d_matlab.m\", robot_name, LIJAC, base_method_name, i, j), codegen_opt):\n    end do:\n  end do:\nend if:\nif codegen_act then\n  MatlabExport(b_rotg, sprintf(\"../codeexport/%s/tmp/jacobig_rot_%d_floatb_%s_matlab.m\", robot_name, LIJAC, base_method_name), codegen_opt):\nend if:\n# Jacobi-Matrix der Rotationsmatrix (Rotatorisch)\n# Ableitung der Rotationsmatrix nach den Gelenkwinkel (kann z.B. für die inverse Kinematik benutzt werden)\n# Siehe [SchapplerTapOrt2019], Gl. 31, Term III und Gl. 27\nR_0_i_s := convert_t_s( Trf_c(1 .. 3, 1..3, LIJAC+1) ):\nRb_0_i_s :=Reshape(R_0_i_s, 9,1):\nJ_Rb_s := Matrix(9, NQJ):\nfor i from 1 to 9 do\n  for j from 1 to NQJ do\n    J_Rb_s(i,j) := diff(Rb_0_i_s(i,1), qJ_s(j,1)):\n  end do:\nend do:\nsave J_Rb_s, sprintf(\"../codeexport/%s/tmp/jacobiR_rot_%d_floatb_%s_maple.m\", robot_name, LIJAC, base_method_name):\nif codegen_act and codegen_jacobi > 1 then\n  MatlabExport(J_Rb_s, sprintf(\"../codeexport/%s/tmp/jacobiR_rot_%d_floatb_%s_matlab.m\", robot_name, LIJAC, base_method_name), codegen_opt):\nend if:\n# Jacobi-Zeitableitungen\n# Die Jacobi-Zeitableitungen werden z.B. zur Umrechnung zwischen EE-Beschleunigungen und Gelenk-Beschleunigungen benötigt.\nJD_rotg_t := diff~(convert_s_t(b_rotg), t):\nJD_rotg_s := convert_t_s(JD_rotg_t):\nJD_rota_t := diff~(convert_s_t(b_rota), t):\nJD_rota_s := convert_t_s(JD_rota_t):\nJD_transla_t := diff~(convert_s_t(b_transl), t):\nJD_transla_s := convert_t_s(JD_transla_t):\n# Zeitableitung der Ableitung der Rotationsmatrix nach den Gelenkwinkeln. Dieser Term wird zur Berechnung der Zeitableitung der kinematischen Zwangsbedingungen für PKM benötigt.\n# Das wird bei der Berechnung der Coriolis-Terme aus dieser Darstellung benötigt.\nJD_Rb_t := diff~(convert_s_t(J_Rb_s), t):\nJD_Rb_s := convert_t_s(JD_Rb_t):\n# Matlab-Export\nif codegen_act and codegen_jacobi > 2 then\n  MatlabExport(JD_rotg_s, sprintf(\"../codeexport/%s/tmp/jacobigD_rot_%d_floatb_%s_matlab.m\", robot_name, LIJAC, base_method_name), codegen_opt):\n  interface(warnlevel=0): # Unterdrücke die Warnung für arctan\n  MatlabExport(JD_rota_s, sprintf(\"../codeexport/%s/tmp/jacobiaD_rot_%d_floatb_%s_matlab.m\", robot_name, LIJAC, base_method_name), codegen_opt):\n  interface(warnlevel=3):\n  MatlabExport(JD_transla_s, sprintf(\"../codeexport/%s/tmp/jacobiaD_transl_%d_floatb_%s_matlab.m\", robot_name, LIJAC, base_method_name), codegen_opt):\n  MatlabExport(JD_Rb_s, sprintf(\"../codeexport/%s/tmp/jacobiRD_rot_%d_floatb_%s_matlab.m\", robot_name, LIJAC, base_method_name), codegen_opt):\nend if:\n\n", "meta": {"hexsha": "6fa82128ae8af896f728765e59a6c9b8db54f510", "size": 10268, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "robot_codegen_kinematics/robot_tree_rotmat_jacobian_baseframe.mpl", "max_stars_repo_name": "SchapplM/robsynth-modelgen", "max_stars_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 2, "max_stars_repo_stars_event_min_datetime": "2020-05-25T07:31:46.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-15T09:54:50.000Z", "max_issues_repo_path": "robot_codegen_kinematics/robot_tree_rotmat_jacobian_baseframe.mpl", "max_issues_repo_name": "SchapplM/robsynth-modelgen", "max_issues_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "robot_codegen_kinematics/robot_tree_rotmat_jacobian_baseframe.mpl", "max_forks_repo_name": "SchapplM/robsynth-modelgen", "max_forks_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 49.6038647343, "max_line_length": 218, "alphanum_fraction": 0.7643163226, "num_tokens": 3400, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8887588023318196, "lm_q2_score": 0.6959583313396339, "lm_q1q2_score": 0.6185390930342647}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n Copyright (C) 2018 Susi Lehtola\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n(* prefix:\n  mgga_x_rtpss_params *params;\n\n  assert(p->params != NULL);\n  params = (mgga_x_rtpss_params * ) (p->params);\n*)\n\n(* These are used within the tpss_x routine *)\ntpss_ff     := z -> 2:\ntpss_kappa := (x, t) -> params_a_kappa:\n\n$include \"tpss_x.mpl\"\n\n(* Equation (6) *)\n\nrtpss_f := (x, u, t) -> 1 + tpss_kappa(x, t)*(1 - exp(-tpss_fx(x, t)/tpss_kappa(x,t))):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) -> mgga_exchange(rtpss_f, rs, z, xs0, xs1, u0, u1, t0, t1):", "meta": {"hexsha": "fdd4035c19bf5041f6501be8063123d41f8959ff", "size": 763, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_rtpss.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_rtpss.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_rtpss.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.25, "max_line_length": 102, "alphanum_fraction": 0.6356487549, "num_tokens": 283, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9099070060380482, "lm_q2_score": 0.6791786861878392, "lm_q1q2_score": 0.6179894449140318}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_mgga_c *)\n\n$define lda_c_pw_params\n$include \"lda_c_pw.mpl\"\n\n$define lda_x_params\n$include \"lda_x.mpl\"\n\ngamma_x  := 0.11:\ngamma_ss := 1.6:\ngamma_ab := 0.14:\n\nparams_a_c_x  := [0.8085,  0.6682, 0.1420]:\nparams_a_c_ss := [0.2606, -0.9608, 0.9023]:\nparams_a_c_ab := [1.2033, -2.2717, 0.9596]:\n\nb98_q := (x, t, u) -> (u/4 - t + x^2/8 + K_FACTOR_C)/K_FACTOR_C:\n\nb98_g := (gamma, cc, q) -> add(cc[i]*(gamma*q^2/sqrt(1 + gamma*q^2))^(i-1), i=1..3):\n\nf_b98 := (lda_func, g_ss, cc_ss, g_ab, cc_ab, rs, z, xs0, xs1, ts0, ts1, us0, us1) ->\n  + lda_stoll_par(lda_func, rs,  z,  1)\n    * b98_g(g_ss, cc_ss, b98_q(xs0, ts0, us0)) * Fermi_D(xs0, ts0)\n  + lda_stoll_par(lda_func, rs, -z, -1)\n    * b98_g(g_ss, cc_ss, b98_q(xs1, ts1, us1)) * Fermi_D(xs1, ts1)\n  + lda_stoll_perp(lda_func, rs, z)\n    * b98_g(g_ab, cc_ab, (b98_q(xs0, ts0, us0) + b98_q(xs1, ts1, us1))/2):\n\nf := (rs, z, xt, xs0, xs1, ts0, ts1, us0, us1) ->\n  + f_lda_x(rs,  1)*b98_g(gamma_x, params_a_c_x, b98_q(xs0, ts0, us0))\n  + f_lda_x(rs, -1)*b98_g(gamma_x, params_a_c_x, b98_q(xs1, ts1, us1))\n  + f_b98(f_pw, gamma_ss, params_a_c_ss, gamma_ab, params_a_c_ab,\n        rs, z, xs0, xs1, ts0, ts1, us0, us1):", "meta": {"hexsha": "9db340200d7639749e5739affb29346d3c06bd67", "size": 1410, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/mgga_xc_b98.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/mgga_xc_b98.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/mgga_xc_b98.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 34.3902439024, "max_line_length": 85, "alphanum_fraction": 0.6319148936, "num_tokens": 624, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9099070035949656, "lm_q2_score": 0.6791786861878392, "lm_q1q2_score": 0.6179894432547421}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\ng96_c1 := 1/137:\n\nf_g96  := x->\n  1 + g96_c1/X_FACTOR_C * x^(3/2):\n\nf  := (rs, z, xt, xs0, xs1) -> gga_exchange(f_g96, rs, z, xs0, xs1):\n", "meta": {"hexsha": "67a7ebd9618ae6857b09f146a4a0e88316471aab", "size": 397, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_g96.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_g96.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_g96.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 23.3529411765, "max_line_length": 68, "alphanum_fraction": 0.6397984887, "num_tokens": 145, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.8962513620489619, "lm_q2_score": 0.6893056295505783, "lm_q1q2_score": 0.617791109352723}}
{"text": "#######################################################################\n# This file is part of the crlibm library, and is distributed under\n# the  LGPL.\n# To use:\n# restart; read \"log2-td.mpl\";\nDigits := 120:\n\ninterface(quiet=true):\n\nread \"common-procedures.mpl\":\nread \"triple-double.mpl\":\nmkdir(\"TEMPLOG\"):\n\n\n# We want log2h + log2m + log2l + delta = log(2) such that\n# log2h and log2m have at least 11 trailing zeros\n# in order to have an exact multiplication with E, which is lower than 1024 in\n# magnitude\n# The resting accuracy is enough for both quick and accurate phases.\n\nlog2acc := log(2):\nlog2h := round(log2acc * 2**(floor(-log[2](abs(log2acc))) + (53 - 11))) / 2**(floor(-log[2](abs(log2acc))) + (53 - 11)):\nlog2m := round((log2acc - log2h) * 2**(floor(-log[2](abs((log2acc - log2h)))) + (53 - 11))) / 2**(floor(-log[2](abs((log2acc - log2h)))) + (53 - 11)):\nlog2l := log2acc - (log2h + log2m):\n\n\nL := 7: # number of bits used to address the table\n\nMAXINDEX    := round(2^L * (sqrt(2)-1)):\n\nfor i from 0 to MAXINDEX-1 do\n    center[i] := 1 + i*2^(-L): # center[i] in [1, 2[\n    t :=  evalf(1/center[i]):\n    r[i] := round(t * 2**(floor(-log[2](abs(t))) + 23)) / 2**(floor(-log[2](abs(t))) + 23):\n    (logih[i], logim[i], logil[i]) := hi_mi_lo(evalf(-log(r[i]))):\nod:\nfor i from MAXINDEX to 2^L do\n    # y has been divided by two, center[i] in [0.5, 1[\n    center[i]:=(1 + i*2^(-L)) / 2:\n    t :=  evalf(1/center[i]):\n    r[i] := round(t * 2**(floor(-log[2](abs(t))) + 23)) / 2**(floor(-log[2](abs(t))) + 23):\n    (logih[i], logim[i], logil[i]) := hi_mi_lo(evalf(-log(r[i]))):\nod:\n\n\n\n\n#Computation of ZMax.\nfor i from 0 to MAXINDEX-1 do\n    __x := center[i] + 2^(-L-1) :\n    zmax[i] := (__x*r[i]-1) :\n    __x := center[i] - 2^(-L-1) :\n    zmin[i] := (__x*r[i]-1) :\nod:\nfor i from MAXINDEX to 2^L do\n    __x := center[i] + 2^(-L-2) :\n    zmax[i] := (__x*r[i]-1) :\n    __x := center[i] - 2^(-L-2) :\n    zmin[i] := (__x*r[i]-1) :\nod:\n\nzmaxmax:=0:\nzminmin:=0:\nfor i from 0 to 2^L do\n    tabulated_value := logih[i] + logim[i] + logil[i]:\n    poly_approx_min := evalf(log(1+zmin[i])):\n    poly_approx_max := evalf(log(1+zmax[i])):\n\n    # Test if we have a case where we cancellate a lot\n    # i.e. the polynomial approximation value is greater than half the tabulated value\n    # the tabulated value is not exactly zero and we are of opposite sign\n\n    if ((abs(poly_approx_min) > 0.75*abs(tabulated_value)) and (tabulated_value <> 0.0) and (poly_approx_min * tabulated_value < 0)) then\n\tprintf(\"Polynomial approximation is greater in magnitude in zmin[%d] than half the tabluated value\\n\",i):\n\n\tprintf(\"The tabulated value is %1.50e\\n\",tabulated_value):\n\tif (tabulated_value <> 0.0) then printf(\"i.e. the value has the exponent %d\\n\",floor(log2(abs(tabulated_value)))) fi:\n\tprintf(\"The value of polynomial in zmin[%d] is %1.50e\\n\",i,poly_approx_min):\n        if (poly_approx_min <> 0.0) then printf(\"i.e. the value has the exponent %d\\n\",floor(log2(abs(poly_approx_min)))) fi:\n\n\tsumme := poly_approx_min + tabulated_value:\n\tprintf(\"The exponent of the sum of both is %d\\n\",floor(log2(abs(summe)))):\n\n\n    fi:\n\n    if ((abs(poly_approx_max) > 0.75*abs(tabulated_value)) and (tabulated_value <> 0.0) and (poly_approx_max * tabulated_value <0)) then\n\tprintf(\"Polynomial approximation is greater in magnitude in zmax[%d] than half the tabluated value\\n\",i):\n\n\tprintf(\"The tabulated value is %1.50e\\n\",tabulated_value):\n\tif (tabulated_value <> 0.0) then printf(\"i.e. the value has the exponent %d\\n\",floor(log2(abs(tabulated_value)))) fi:\n\tprintf(\"The value of polynomial in zmax[%d] is %1.50e\\n\",i,poly_approx_max):\n        if (poly_approx_max <> 0.0) then printf(\"i.e. the value has the exponent %d\\n\",floor(log2(abs(poly_approx_max)))) fi:\n\n\tsumme := poly_approx_max + tabulated_value:\n\tprintf(\"The exponent of the sum of both is %d\\n\",floor(log2(abs(summe)))):\n\n\n    fi:\n\n\n    if zmax[i] > zmaxmax then zmaxmax := zmax[i]: fi:\n    if zmin[i] < zminmin then zminmin := zmin[i]: fi:\nod:\nprintf(\"zminmin = -2^(%2f)   zmaxmax = 2^(%2f)\\n\", log2(-zminmin), log2(zmaxmax) ) :\n\nPolyDegreeQuick:=7:\n\nprintf(\"   degree of the polynomial used in the quick phase is %d\\n\",PolyDegreeQuick);\n\nDDNumberQuick:=3:\n\nprintf(\"   number of double doubles used for the coefficients is %d\\n\",DDNumberQuick);\n\n#Keep -zmaxmax..zmaxmax to keep c1=1, which is useful in the proof\n#and constrain the first two coefficients to 1 and -1/2 in order to save up a full multiplication and a rounding error\npolyQuick:= poly_exact2(x*(1+x*(-0.5+x*(numapprox[minimax]((((log(1+x)/x)-1)/x+0.5)/x,\n\t\t\tx=-zmaxmax..zmaxmax,  [PolyDegreeQuick-3,0], 1 ,  'deltaApprox')))), DDNumberQuick):\n\n#Try to verify the bound for using double double arithmetic.\n#Idea: compare the maximum absolute value of the polynomial in zmaxmax (the polynomial has its maxima at the limits)\n#with the maximum value of the first term which is calculated in double precision only\n\np := unapply(polyQuick,x):\nprintf(\"   using only %d double doubles should be fine since the hi z ulp should affect the result starting from bit %f\\n\",\n\tDDNumberQuick,evalf(53 + log2(p(zmaxmax)) - log2(zmaxmax^(DDNumberQuick)),5)):\n\n\nepsilonApproxQuick := numapprox[infnorm]( 1-polyQuick/log(1+x), x=zminmin..zmaxmax):\nprintf(\"   approximation rel error for the quick phase is 2^(%2f)\\n\", log2(epsilonApproxQuick) ) :\ndeltaApproxQuick := numapprox[infnorm]( polyQuick-log(1+x), x=zminmin..zmaxmax):\nprintf(\"   approximation abs error for the quick phase is 2^(%2f)\\n\", log2(deltaApproxQuick) ) :\n\n\nPolyDegreeAccurate:=14:\n\nprintf(\"   degree of the polynomial used in the accurate phase is %d\\n\",PolyDegreeAccurate);\n\nDDNumberAccu:=7:\nTDNumberAccu:=3:\n\nprintf(\"   number of triple doubles used for the coefficients is %d\\n\",TDNumberAccu);\nprintf(\"   number of double doubles used for the coefficients is %d\\n\",DDNumberAccu);\n\n\n#Keep -zmaxmax..zmaxmax to keep c1=1, which is useful in the proof\npolyAccurate:= poly_exact32(x*(1+x*(-0.5+x*(numapprox[minimax]((((log(1+x)/x)-1)/x+0.5)/x,\n\t\t\t\tx=-zmaxmax..zmaxmax,  [PolyDegreeAccurate-3,0], 1 ,  'deltaApprox')))),\n\t\t\t\tTDNumberAccu, DDNumberAccu):\n\n#Try to verify the bound for using double double arithmetic.\n#Idea: compare the maximum absolute value of the polynomial in zmaxmax (the polynomial has its maxima at the limits)\n#with the maximum value of the first term which is calculated in double precision only\n\npp := unapply(polyAccurate,x):\nprintf(\"   using only %d triple doubles should be fine since the mi z ulp should affect the result starting from bit %f\\n\",\n\tTDNumberAccu,evalf(106 + log2(p(zmaxmax)) - log2(zmaxmax^(TDNumberAccu)),5)):\nprintf(\"   using only %d double doubles should be fine since the hi z ulp should affect the result starting from bit %f\\n\",\n\tDDNumberAccu,evalf(53 + log2(p(zmaxmax)) - log2(zmaxmax^(TDNumberAccu + DDNumberAccu)),5)):\n\n\nepsilonApproxAccurate := numapprox[infnorm]( 1-polyAccurate/log(1+x), x=zminmin..zmaxmax):\nprintf(\"   approximation rel error for the accurate phase is 2^(%2f)\\n\", log2(epsilonApproxAccurate) ) :\ndeltaApproxAccurate := numapprox[infnorm]( polyAccurate-log(1+x), x=zminmin..zmaxmax):\nprintf(\"   approximation abs error for the quick phase is 2^(%2f)\\n\", log2(deltaApproxAccurate) ) :\n\n\n\n#Compute now the inverse of ln(10) for the final multiplication of ln(x) with this constant for obtaining log10(x)\n#Compute also the relative error of the constant stored as a triple double.\nLog10inv := evalf(1 / log(10)):\n\n(log10invh, log10invm, log10invl) := hi_mi_lo(Log10inv):\n\nLog10invhml := log10invh + log10invm + log10invl:\n\nepsilonLog10invhml := evalf(abs((Log10invhml - Log10inv) / Log10inv)):\n\nprintf(\"   Log10inv = 1 / ln(10) stored as a triple-double is exact with a relative error of 2^(%2f)\\n\",\n\tevalf(log[2](epsilonLog10invhml))):\n\n\n#Compute now the constant needed for the unfiltered directed final rounding of the triple-double result\n#This constant is supposed to be the reciprocal of the critical accuracy of the function.\n#We suppose this critical accuracy to be 2^(-120) because the worst case (for RD) we know of is x = 403ce41d 8fa665fa\n#We can easily spend some guard bits since we want simply filter out cases with a theoretical worst case accuracy\n#of -infty (exact floating point images) and as we know that we are exact to at least 122 bits.\n\nwca := 2^(122):\n\n\n#-------------------------------------------------------------------\n# Output\n\n\nfilename:=\"TEMPLOG/log10-td.h\":\nfd:=fopen(filename, WRITE, TEXT):\n\nfprintf(fd, \"#include \\\"crlibm.h\\\"\\n#include \\\"crlibm_private.h\\\"\\n\"):\n\nfprintf(fd, \"\\n/*File generated by maple/log10-td.mpl*/\\n\"):\n\nfprintf(fd, \"\\n\\#define L %d\\n\\n\",L):\nfprintf(fd, \"\\#define MAXINDEX %d\\n\\n\", MAXINDEX):\nfprintf(fd, \"\\#define INDEXMASK %d\\n\", 2^L-1):\nfprintf(fd, \"\\#define two52 %1.50e\\n\", 2^(52)):\nfprintf(fd, \"\\#define log2h %1.50e\\n\", log2h):\nfprintf(fd, \"\\#define log2m %1.50e\\n\", log2m):\nfprintf(fd, \"\\#define log2l %1.50e\\n\", log2l):\nfprintf(fd, \"\\#define log10invh %1.50e\\n\",log10invh):\nfprintf(fd, \"\\#define log10invm %1.50e\\n\",log10invm):\nfprintf(fd, \"\\#define log10invl %1.50e\\n\",log10invl):\nfprintf(fd, \"\\#define WORSTCASEACCURACY %1.50e\\n\",wca):\n\nepsilon_quick_1 := 2^(-61): # The Gappa proof will show this bound\nepsilon_quick_2 := 2^(-61): # The Gappa proof will show this bound\nfprintf(fd, \"\\#define ROUNDCST1 %1.50e\\n\", compute_rn_constant(epsilon_quick_1)):\nfprintf(fd, \"\\#define ROUNDCST2 %1.50e\\n\", compute_rn_constant(epsilon_quick_2)):\nfprintf(fd, \"\\#define RDROUNDCST1 %1.50e\\n\", epsilon_quick_1):\nfprintf(fd, \"\\#define RDROUNDCST2 %1.50e\\n\", epsilon_quick_2):\n\n\nfprintf(fd, \"\\n\\n\"):\n\n\n# Print the defines for the define statements\n\nfor i from 3 to PolyDegreeQuick do\n\tfprintf(fd, \"\\#define c%d %1.50e\\n\",i,coeff(polyQuick,x,i)):\nod:\n\nfprintf(fd, \"\\n\\n\"):\n\nfor i from 3 to (DDNumberAccu + TDNumberAccu -1) do\n\t(hi,lo) := hi_lo(coeff(polyAccurate,x,i)):\n\tfprintf(fd, \"\\#define accPolyC%dh %1.50e\\n\",i,hi):\n\tfprintf(fd, \"\\#define accPolyC%dl %1.50e\\n\",i,lo):\nod:\n\nfor i from (DDNumberAccu + TDNumberAccu) to PolyDegreeAccurate do\n\tfprintf(fd, \"\\#define accPolyC%d %1.50e\\n\",i,coeff(polyAccurate,x,i)):\nod:\n\nfprintf(fd, \"\\n\\n\"):\n\n# Print the table\nfprintf(fd, \"typedef struct rri_tag {float ri; double logih; double logim; double logil;} rri;  \\n\"):\nfprintf(fd, \"static const rri argredtable[%d] = {\\n\", 2^L):\nfor i from 0 to 2^L-1 do\n      fprintf(fd, \"  { \\n\"):\n      fprintf(fd, \"    %1.50e,   /* r[%d] */ \\n\", r[i], i):\n      fprintf(fd, \"    %1.50e, /* logih[%d] */ \\n\", logih[i], i):\n      fprintf(fd, \"    %1.50e, /* logim[%d] */ \\n\", logim[i], i):\n      fprintf(fd, \"    %1.50e, /* logil[%d] */ \\n\", logil[i], i):\n      fprintf(fd, \"  } \"):\n      if(i<2^L-1) then  fprintf(fd, \", \\n\"): fi\nod:\nfprintf(fd, \"}; \\n \\n\"):\n\nfclose(fd):\n\nfor j from 0 to 2^L-1 do\n    filename:=cat(\"TEMPLOG/log10-td_\",j,\".sed\"):\n    fd:=fopen(filename, WRITE, TEXT):\n    fprintf(fd, \" s/_log2h/%1.50e/g\\n\", log2h):\n    fprintf(fd, \" s/_log2m/%1.50e/g\\n\", log2m):\n    fprintf(fd, \" s/_log2l/%1.50e/g\\n\", log2l):\n    fprintf(fd, \" s/_logih/%1.50e/g\\n\", logih[j]):\n    fprintf(fd, \" s/_logim/%1.50e/g\\n\", logim[j]):\n    fprintf(fd, \" s/_logil/%1.50e/g\\n\", logil[j]):\n    fprintf(fd, \" s/_zmin/%1.50e/g\\n\", zmin[j]):\n    fprintf(fd, \" s/_zmax/%1.50e/g\\n\", zmax[j]):\n    for i from 3 to PolyDegreeQuick do\n        fprintf(fd, \" s/_c%d/%1.50e/g\\n\", i, coeff(polyQuick,x,i)):\n    od:\n    fprintf(fd, \" s/_epsilonApproxQuick/%1.50e/g\\n\", epsilonApproxQuick):\n    fprintf(fd, \" s/_epsilonLog10invhml/%1.50e/g\\n\", epsilonLog10invhml):\n    fclose(fd):\n  od:\n\nfor j from 0 to 2^L-1 do\n    filename:=cat(\"TEMPLOG/log10-td-accurate_\",j,\".sed\"):\n    fd:=fopen(filename, WRITE, TEXT):\n    fprintf(fd, \" s/_log2h/%1.50e/g\\n\", log2h):\n    fprintf(fd, \" s/_log2m/%1.50e/g\\n\", log2m):\n    fprintf(fd, \" s/_log2l/%1.50e/g\\n\", log2l):\n    fprintf(fd, \" s/_logih/%1.50e/g\\n\", logih[j]):\n    fprintf(fd, \" s/_logim/%1.50e/g\\n\", logim[j]):\n    fprintf(fd, \" s/_logil/%1.50e/g\\n\", logil[j]):\n    fprintf(fd, \" s/_zmin/%1.50e/g\\n\", zmin[j]):\n    fprintf(fd, \" s/_zmax/%1.50e/g\\n\", zmax[j]):\n    for i from 3 to (DDNumberAccu + TDNumberAccu -1) do\n\t(hi,lo) := hi_lo(coeff(polyAccurate,x,i)):\n        fprintf(fd, \" s/_accPolyC%dh/%1.50e/g\\n\", i, hi):\n        fprintf(fd, \" s/_accPolyC%dl/%1.50e/g\\n\", i, lo):\n    od:\n    for i from (DDNumberAccu + TDNumberAccu) to PolyDegreeAccurate do\n        fprintf(fd, \" s/_accPolyC%d/%1.50e/g\\n\", i, coeff(polyAccurate,x,i)):\n    od:\n    fprintf(fd, \" s/_epsilonApproxAccurate/%1.50e/g\\n\", epsilonApproxAccurate):\n    fprintf(fd, \" s/_epsilonLog10invhml/%1.50e/g\\n\", epsilonLog10invhml):\n    fclose(fd):\n  od:\n\n# A shell script to use them\nfilename:=\"run-log10-td-proof.sh\":\nfd:=fopen(filename, WRITE, TEXT):\nfprintf(fd, \"#!/bin/sh\\n\"):\nfprintf(fd, \"# You probably need to edit the path to the gappa executable\\n\"):\nfprintf(fd, \"GAPPA=~/ble/gappa-0.4.5/src/gappa\\n\"):\nfprintf(fd, \"# Test all the possible table value for E=1\\n\"):\nfprintf(fd, \"for num in `seq 0 %d`; do\\n\", 2^L-1):\nfprintf(fd, \"  echo $num, E=1:\\n\"):\nfprintf(fd, \"  sed -f ./TEMPLOG/log10-td_$num.sed log10-td.gappa | $GAPPA > /dev/null\\n\"):\nfprintf(fd, \"  echo\\n\"):\nfprintf(fd, \"done\\n\"):\nfprintf(fd, \"# For the case E=0 we first handle the cases 0 and %d using log10-td-E0-logir0.gappa\\n\", 2^L):\nfprintf(fd, \"echo 0 and %d, E=0:\\n\", 2^L):\nfprintf(fd, \"sed -f log10-td_0.sed log10-td-E0-logir0.gappa | $GAPPA > /dev/null\\n\"):\nfprintf(fd, \"# then the other cases where logirh <> 0\\n\"):\nfprintf(fd, \"for num in `seq 1 %d`; do\\n\", 2^L-1):\nfprintf(fd, \"  echo $num, E=0:\\n\"):\nfprintf(fd, \"  sed -f ./TEMPLOG/log10-td_$num.sed log10-td-E0.gappa | $GAPPA > /dev/null\\n\"):\nfprintf(fd, \"  echo\\n\"):\nfprintf(fd, \"done\\n\"):\nfprintf(fd, \"# Accurate phase: Test all the possible table value for E=1\\n\"):\nfprintf(fd, \"for num in `seq 0 %d`; do\\n\", 2^L-1):\nfprintf(fd, \"  echo Accurate phase: $num, E=1:\\n\"):\nfprintf(fd, \"  sed -f ./TEMPLOG/log10-td-accurate_$num.sed log10-td-accurate.gappa | $GAPPA > /dev/null\\n\"):\nfprintf(fd, \"  echo\\n\"):\nfprintf(fd, \"done\\n\"):\nfprintf(fd, \"# Accurate phase: For the case E=0 we first handle the cases 0 and %d using log10-td-accurate-E0-logir0.gappa\\n\", 2^L):\nfprintf(fd, \"echo 0 and %d, E=0:\\n\", 2^L):\nfprintf(fd, \"sed -f ./TEMPLOG/log10-td-accurate_0.sed log10-td-accurate-E0-logir0.gappa | $GAPPA > /dev/null\\n\"):\nfprintf(fd, \"# Accurate phase: then the other cases where logirh <> 0\\n\"):\nfprintf(fd, \"for num in `seq 1 %d`; do\\n\", 2^L-1):\nfprintf(fd, \"  echo $num, E=0:\\n\"):\nfprintf(fd, \"  sed -f ./TEMPLOG/log10-td-accurate_$num.sed log10-td-accurate-E0.gappa | $GAPPA > /dev/null\\n\"):\nfprintf(fd, \"  echo\\n\"):\nfprintf(fd, \"done\\n\"):\nfclose(fd):\n\nprintf(\"----DONE---\\n\") :\n\n\n", "meta": {"hexsha": "330f5921ed35481223a453d1290aafd47aa66f81", "size": 14661, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "crlibm/maple/log10-td.mpl", "max_stars_repo_name": "squarePenguin/parvsl", "max_stars_repo_head_hexsha": "0d502abe795540a3dfc99d43726d3fc29a5e6e5d", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "crlibm/maple/log10-td.mpl", "max_issues_repo_name": "squarePenguin/parvsl", "max_issues_repo_head_hexsha": "0d502abe795540a3dfc99d43726d3fc29a5e6e5d", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 1, "max_issues_repo_issues_event_min_datetime": "2019-03-25T17:02:38.000Z", "max_issues_repo_issues_event_max_datetime": "2019-03-25T17:02:38.000Z", "max_forks_repo_path": "crlibm/maple/log10-td.mpl", "max_forks_repo_name": "squarePenguin/parvsl", "max_forks_repo_head_hexsha": "0d502abe795540a3dfc99d43726d3fc29a5e6e5d", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 42.3728323699, "max_line_length": 150, "alphanum_fraction": 0.6553441102, "num_tokens": 4984, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8633916029436189, "lm_q2_score": 0.7154239957834733, "lm_q1q2_score": 0.6176910705038219}}
{"text": "# Simplicial constructions for a proof of the Hurewicz theorem\n\n`is_element/K/hurewicz` := (A::set) -> (d::posint) -> proc(x)\n if not(`is_element/prime_simplex`(A)(x)) then\n  return false;\n fi;\n\n if nops(select(a -> x[a]>0,A)) > d then\n  return false;\n fi;\n\n return true;\nend:\n\n`random_element/K/hurewicz` := (A::set) -> (d::posint) -> proc()\n local k,i,B,x,a;\n k := rand(1..min(nops(A),d))();\n B := {};\n for i from 1 to k do\n  B := {op(B),random_element_of(A minus B)};\n od:\n x := `random_element/prime_simplex`(B)();\n for a in A minus B do x[a] := 0; od;\n return eval(x);\nend:\n\n`list_elements/K_hurewicz` := NULL:\n`count_elements/K_hurewicz` := NULL:\n\n######################################################################\n\n`is_element/L/hurewicz` := (A::set) -> (d::posint) -> proc(tx)\n local t,x;\n \n if not(type(tx,list)) and nops(tx) = 2 then\n  return false;\n fi;\n\n t,x := op(tx);\n\n if not(type(t,realcons) and is(t >= 0) and is(t <= 1)) then\n  return false;\n fi;\n \n if not(`is_element/prime_simplex`(A)(x)) then\n  return false;\n fi;\n\n if t = 1 then\n  return true;\n fi;\n\n if `is_element/K/hurewicz`(A)(d)(x) then\n  return true;\n fi;\n\n return false;\nend:\n\n`random_element/L/hurewicz` := (A::set) -> (d::posint) -> proc()\n if rand(1..2)() = 1 then\n  return [1,`random_element/prime_simplex`(A)()];\n else\n  return [rand(0..12)()/12,`random_element/K/hurewicz`(A)(d)()];\n fi;\nend:\n\n`list_elements/L_hurewicz` := NULL:\n`count_elements/L_hurewicz` := NULL:\n\n######################################################################\n\n`u1/hurewicz` := (A::set) -> (d::posint) -> proc(x)\n local JJ,J,j;\n if nops(A) <= d then return 0; fi;\n JJ := combinat[choose](A,nops(A) - d);\n return min(seq(max(seq(x[j],j in J)),J in JJ));\nend:\n\n`w1/hurewicz` := (A::set) -> (d::posint) -> proc(tx)\n local t,x,u1;\n t,x := op(tx);\n u1 := `u1/hurewicz`(A)(d)(x);\n return min(u1+(1+t)/2,1);\nend:\n\n`f1/hurewicz` := (A::set) -> (d::posint) -> proc(tx)\n local t,x,y,a;\n t,x := op(tx);\n y := table():\n for a in A do\n  y[a] := max(0,x[a]-(1-t)/2,2*x[a]-1);\n od:\n return eval(y);\nend:\n\n`h1/hurewicz` := (A::set) -> (d::posint) -> proc(tx)\n return [`w1/hurewicz`(A)(d)(tx),`f1/hurewicz`(A)(d)(tx)];\nend:\n\n", "meta": {"hexsha": "cfac40badb6a20a846e2e2c64d664e0a9d6c48b2", "size": 2176, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/hurewicz.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/hurewicz.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/hurewicz.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 21.5445544554, "max_line_length": 70, "alphanum_fraction": 0.5500919118, "num_tokens": 773, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8267117769928211, "lm_q2_score": 0.7461389873857264, "lm_q1q2_score": 0.616841888145278}}
{"text": "with(DifferentialAlgebra):\nring_diff := DifferentialRing(blocks = [[S, A, E, C, Ninv, J, I], [y2, y] ], derivations = [t]):\nsys := [\ndiff(S(t), t) - (-b*S(t)*Ninv(t)*A(t)*q - b*S(t)*Ninv(t)*II(t) - b*S(t)*Ninv(t)*J(t)),\ndiff(A(t), t) - (-E(t)*k*r + E(t)*k - A(t)*g1),\ndiff(E(t), t) - (b*S(t)*Ninv(t)*A(t)*q + b*S(t)*Ninv(t)*II(t) + b*S(t)*Ninv(t)*J(t) - E(t)*k),\ndiff(C(t), t) - (alpha*II(t)),\ndiff(Ninv(t), t) - (0),\ndiff(J(t), t) - (alpha*II(t) - g2*J(t)),\ndiff(II(t), t) - (-alpha*II(t) + E(t)*k*r - g1*II(t)),\ny2(t) - (Ninv(t)),\ny(t) - (C(t))\n];\nres := CodeTools[CPUTime](RosenfeldGroebner(sys, ring_diff, singsol=none));", "meta": {"hexsha": "3dcc2fd90fc5306dc4d0bbd6e2ed56c863f68325", "size": 625, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "benchmarking/RosenfeldGroebner/SEAIJRC-Covid-model.mpl", "max_stars_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_stars_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 42, "max_stars_repo_stars_event_min_datetime": "2021-07-14T14:30:56.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-23T16:49:40.000Z", "max_issues_repo_path": "benchmarking/RosenfeldGroebner/SEAIJRC-Covid-model.mpl", "max_issues_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_issues_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 25, "max_issues_repo_issues_event_min_datetime": "2021-07-15T21:15:31.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-30T19:50:55.000Z", "max_forks_repo_path": "benchmarking/RosenfeldGroebner/SEAIJRC-Covid-model.mpl", "max_forks_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_forks_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 4, "max_forks_repo_forks_event_min_datetime": "2021-08-28T14:40:36.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-02T19:21:47.000Z", "avg_line_length": 44.6428571429, "max_line_length": 96, "alphanum_fraction": 0.5152, "num_tokens": 278, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9314625050654264, "lm_q2_score": 0.661922862511608, "lm_q1q2_score": 0.6165563276751402}}
{"text": "RP2_net_complex := proc()\n local T,rt,tau,i;\n\n T[\"vertices\"] := {seq(i,i=1..9)};\n T[\"faces\"] := {{1,2,3},{1,2,5},{1,3,9},{1,4,5},{1,4,9},{2,3,7},{2,5,6},{2,6,7},{3,7,8},{3,8,9}};\n T[\"max_simplices\"] := T[\"faces\"];\n \n rt := sqrt(3);\n tau := (1+sqrt(5))/2;\n\n T[\"flat_embedding\"] := table([\n  1 = [ 1/2, 0   ],\n  2 = [-1/4, rt/4],\n  3 = [-1/4,-rt/4],\n  4 = [ 1  , 0   ],\n  5 = [ 1/2, rt/2],\n  6 = [-1/2, rt/2],\n  7 = [-1  , 0   ],\n  8 = [-1/2,-rt/2],\n  9 = [ 1/2,-rt/2]\n ]):\n\n T[\"icosahedron_embedding\"] := table([\n   1 = [   0,   1, tau],\n   2 = [ tau,   0,   1],\n   3 = [   1, tau,   0],\n   4 = [-tau,   0,   1],\n   5 = [   0,  -1, tau],\n   6 = [   1,-tau,   0],\n   7 = [ tau,   0,  -1],\n   8 = [   0,   1,-tau],\n   9 = [  -1, tau,   0]\n ]):\n\n T[\"flat_plot\"] :=\n   `plot/simplicial_complex`(T[\"vertices\"])(T[\"faces\"],2,T[\"flat_embedding\"]);\n\n T[\"icosahedron_plot\"] :=\n   `plot/simplicial_complex`(T[\"vertices\"])(T[\"faces\"],2,T[\"icosahedron_embedding\"]);\n\n return eval(T);\nend:\n\nRP2_complex := proc()\n local T0,T,i;\n\n T0 := RP2_net_complex();\n T[\"vertices\"] := {seq(i,i=1..6)};\n T[\"faces\"] := subs({7=4,8=5,9=6},T0[\"faces\"]);\n T[\"max_simplices\"] := T[\"faces\"];\n\n return eval(T);\nend:\n", "meta": {"hexsha": "562d7faaa5dd79314281d766739c2f1fa36dc475", "size": 1182, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/simplicial_complexes/RP2_complex.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/simplicial_complexes/RP2_complex.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/simplicial_complexes/RP2_complex.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 21.8888888889, "max_line_length": 97, "alphanum_fraction": 0.4526226734, "num_tokens": 550, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8539127455162773, "lm_q2_score": 0.7217432182679956, "lm_q1q2_score": 0.6163057330689778}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_mgga_x *)\n(* prefix:\n  mgga_x_scan_params *params;\n\n  assert(pt->params != NULL);\n  params = (mgga_x_scan_params * )(pt->params);\n*)\n\np     := x -> X2S^2*x^2:\nalpha := (x, t) -> (t - x^2/8)/K_FACTOR_C:\n\nf_alpha := a -> piecewise(a <= 1, exp(-params_a_c1*a/(1 - a)), -params_a_d*exp(params_a_c2/(1 - a))):\n\nh1x := x -> 1 + params_a_k1*(1 - params_a_k1/(params_a_k1 + x)):\n\nb2 := sqrt(5913/405000):\nb1 := (511/13500)/(2*b2):\nb3 := 1/2:\nb4 := MU_GE^2/params_a_k1 - 1606/18225 - b1^2:\ny  := (x, a) -> MU_GE*p(x) + b4*p(x)^2*exp(-b4*p(x)/MU_GE) + (b1*p(x) + b2*(1 - a)*exp(-b3*(1 - a)^2))^2:\n\na1 := 4.9479:\ngx := x -> 1 - exp(-a1/sqrt(X2S*x)):\n\nh0x := 1.174:\nf   := (rs, x, t, u) -> (h1x(y(x, alpha(x, t)))*(1 - f_alpha(alpha(x, t))) + h0x*f_alpha(alpha(x, t)))*gx(x):\n", "meta": {"hexsha": "c8a93f080516c6fee45bb899616c69fc90a753a3", "size": 1017, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/mgga_x_scan.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/mgga_x_scan.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/mgga_x_scan.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 29.0571428571, "max_line_length": 109, "alphanum_fraction": 0.5771878073, "num_tokens": 422, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9073122163480666, "lm_q2_score": 0.679178699175393, "lm_q1q2_score": 0.6162271308452226}}
{"text": "# 计算不变量阶数\n$ifndef _INVORDER_\n$define _INVORDER_\n\n(*\n    * 计算不变量的次数\n*)\nfindInvariantsOrder:=proc(ee)\n    if not type(denom(ee),numeric) then\n        return findOrder(numer(ee))-findOrder(denom(ee));\n    else\n        return findOrder(ee);\n    end if;\nend proc:\n\n(*\n    * 计算齐次表达式的的次数（不含分母）\n*)\nfindOrder:=proc(ee)\n    local e;\n    e:=expand(ee);\n    if type(e,`+`) then\n        e:=op(1,e);\n    end if;\n    e:=remove(type,e,numeric);\n    if (e=NULL) then\n        return 0;\n    end if:\n    return findItemOrder(e);\nend proc:\n\n(*\n    * 计算一项的次数\n*)\nfindItemOrder:=proc(ee)\n    local s,_e;\n    s:=0;\n    for _e in ee do\n        if type(_e,`^`) then\n            s:=s+op(2,_e);\n        else\n            s:=s+1;\n        end if;\n    end do;\nend proc:\n\n$endif", "meta": {"hexsha": "e7522444874b6fa6e2e60c193a241c06a610fb02", "size": 744, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "InvClassify/InvOrder.mpl", "max_stars_repo_name": "yu961549745/InvariantClassify", "max_stars_repo_head_hexsha": "eeb14ca2b39679e5a2da0f23888681ec7e2edd84", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "InvClassify/InvOrder.mpl", "max_issues_repo_name": "yu961549745/InvariantClassify", "max_issues_repo_head_hexsha": "eeb14ca2b39679e5a2da0f23888681ec7e2edd84", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "InvClassify/InvOrder.mpl", "max_forks_repo_name": "yu961549745/InvariantClassify", "max_forks_repo_head_hexsha": "eeb14ca2b39679e5a2da0f23888681ec7e2edd84", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 15.829787234, "max_line_length": 57, "alphanum_fraction": 0.5376344086, "num_tokens": 283, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8128673133042217, "lm_q2_score": 0.7577943767446202, "lm_q1q2_score": 0.6159862790614467}}
{"text": "\n# Energy Calculation for the Robot links based on MDH frames\n# Introduction\n# Berechnung von kinetischer Energie für den Roboter.\n# \n# Dateiname:\n# robot -> Berechnung für allgemeinen Roboter\n# tree -> Berechnung für eine beliebige Baumstruktur (ohne Schleifen)\n# floatb -> floating base wird durch base twist (Geschwindigkeit der Basis) oder vollständige Orientierung (Euler-Winkel) berücksichtigt\n# rotmat -> Kinematik wird mit Rotationsmatrizen berechnet\n# energy -> Berechnung der Energie\n# linkframe -> Berechnung der Geschwindigkeit im Körper-KS (KSi)\n# par2 -> Parametersatz 2 (erstes Moment anstelle von Schwerpunkt als Parameter)\n# Authors\n# Moritz Schappler, schappler@irt.uni-hannover.de, 2016-03\n# (C) Institut fuer Regelungstechnik, Leibniz Universitaet Hannover\n# Sources\n# [GautierKhalil1988] A direct determination of minimum inertial parameters of robots\n# [GautierKhalil1990] Direct Calculation of Minimum Set of Inertial Parameters of Serial Robots\n# [KhalilDombre2002] Modeling, Identification and Control of Robots\n# [Craig] Introduction to Robotics, Modeling and Control (3rd Edition)\n# [Ortmaier2014] Vorlesungsskript Robotik I\n# Initialization\ninterface(warnlevel=0): # Unterdrücke die folgende Warnung.\nrestart: # Gibt eine Warnung, wenn über Terminal-Maple mit read gestartet wird.\ninterface(warnlevel=3):\nwith(LinearAlgebra):\nwith(ArrayTools):\nwith(codegen):\nwith(CodeGeneration):\nwith(StringTools):\ncodegen_act := true:\ncodegen_opt := 2:\nread \"../helper/proc_convert_s_t\":\nread \"../helper/proc_convert_t_s\": \nread \"../helper/proc_MatlabExport\":\nread \"../helper/proc_simplify2\":\nread \"../transformation/proc_rotx\": \nread \"../transformation/proc_roty\": \nread \"../transformation/proc_rotz\": \nread \"../transformation/proc_trotx\": \nread \"../transformation/proc_troty\": \nread \"../transformation/proc_trotz\": \nread \"../transformation/proc_transl\": \nread \"../transformation/proc_trafo_mdh\": \nread \"../robot_codegen_definitions/robot_env\":\nread sprintf(\"../codeexport/%s/tmp/tree_floatb_definitions\", robot_name, base_method_name):\nread sprintf(\"../codeexport/%s/tmp/kinematic_constraints_maple_inert.m\", robot_name):\nkin_constraints_exist := kin_constraints_exist: # Laden zur Einstellung der Term-Vereinfachung\n;\n# Einstellungen für Term-Vereinfachungen: 0=keine, 2=E_kin (einzelne), 3=auch E_kin (komplett)\nif not assigned(simplify_options) or simplify_options(6)=-1 then\n  # Die Vereinfachung ist ein Kompromiss aus Laufzeit des Programms und Güte der Ergebnisse\n  # Bei zu komplizierten Termen stürzt Maple bei der Vereinfachung unvorhersehbar ab.\n  # Die folgenden Regeln sind konservative Einstellungen, damit die Code-Generierung nicht zu lange dauert.\n  if not kin_constraints_exist then # ohne Zwangsbedingungen. Annahme: Bringt dann sowieso nicht so viel\n    use_simplify := 0: # Keine Vereinfachungen\n  else # für Systeme mit Zwangsbedingungen\n    if NJ <= 7 then\n      use_simplify := 3: # standardmäßig bei einfachen Systemen alle simplify-Befehle anwenden\n    else\n      use_simplify := 0: # Sonst keine. Optimierung der einzelnen kinetischen Energien bringt sowieso nichts.\n    end if:\n  end if:\nelse\n  use_simplify := simplify_options(6): # sechster Eintrag ist für Energie\nend if:\n\n# Ergebnisse der Kinematik laden\nread sprintf(\"../codeexport/%s/tmp/kinematics_floatb_%s_rotmat_maple.m\", robot_name, base_method_name):\nTrf_c := Trf_c:\nread sprintf(\"../codeexport/%s/tmp/velocity_linkframe_floatb_%s_maple.m\", robot_name, base_method_name):\nomega_i_i := omega_i_i: \nrD_i_i := rD_i_i:\n\n# Calculate Energy\n# Use velocities in link frame and MX,MY,MZ as a parameter\n# Kinetic Energy\n# [GautierKhalil1988], equ.6\n# Hier wird der Trägheitstensor um den Koordinatenursprung gewählt, und nicht um den Schwerpunkt!\nT_b := Matrix(NL, 1):\nT := 0:\nfor i to NL do \n  I_i_i_tensor := Matrix([[I_i_i[1, i], I_i_i[2, i], I_i_i[3, i]], [I_i_i[2, i], I_i_i[4, i], I_i_i[5, i]], [I_i_i[3, i], I_i_i[5, i], I_i_i[6, i]]]):\n  T_b_rot := (1/2)*Multiply(Transpose(omega_i_i(1 .. 3, i)), Multiply(I_i_i_tensor, omega_i_i(1 .. 3, i))):\n  T_b_trans := (1/2)*M[i, 1]*Multiply(Transpose(rD_i_i(1 .. 3, i)), rD_i_i(1 .. 3, i))+Multiply(Transpose(rD_i_i(1 .. 3, i)), CrossProduct(omega_i_i(1 .. 3, i), mr_i_i_Si(1 .. 3, i))):\n  T_b[i, 1] := T_b_rot+T_b_trans:\n  printf(\"%s. Kinetische Energie für Körper %d berechnet (im Körper-KS, mit Parametersatz 2).\\n\", \\\n    FormatTime(\"%Y-%m-%d %H:%M:%S\"), i-1):#0=Basis\n  # Terme vereinfachen (nur einzelne Energien und nicht die Summe).\n  # Annahme: Zusammenfassung verschiedener Körper nicht zielführend\n  if use_simplify>=2 then\n    tmp_t1:=time(): tmp_l1 := length(T_b[i,1]):\n    printf(\"%s. Beginne Vereinfachung für kinetische Energie (Param. 2; Körper %d). Länge: %d.\\n\", \\\n      FormatTime(\"%Y-%m-%d %H:%M:%S\"), i-1, tmp_l1):\n    T_b[i,1] := simplify2(T_b[i,1]):\n    tmp_t2:=time(): tmp_l2 := length(T_b[i,1]): \n    printf(\"%s. Terme für kinetische Energie (Param. 2) vereinfacht (Körper %d). Länge: %d->%d. Rechenzeit %1.1fs.\\n\", \\\n      FormatTime(\"%Y-%m-%d %H:%M:%S\"), i-1, tmp_l1, tmp_l2, tmp_t2-tmp_t1):\n  end if:\n  T := T+T_b[i, 1]:\n\n  # Terme vereinfachen (optional, Standardmäßig nur kinetische Energie einzelner Körper optimieren)\n  # Für komplizierte Systeme hängt sich Maple hier auf.\n  if use_simplify>=3 then\n    tmp_t1:=time(): tmp_l1 := length(T):\n    printf(\"%s. Beginne Vereinfachung für kinetische Energie (Param. 2; Summe bis Körper %d). Länge: %d.\\n\", \\\n      FormatTime(\"%Y-%m-%d %H:%M:%S\"), i-1, tmp_l1):\n    T := simplify2(T):\n    tmp_t2:=time(): tmp_l2 := length(T):\n    printf(\"%s. Terme für kinetische Energie (Param. 2) vereinfacht (Körper %d). Länge: %d->%d. Rechenzeit %1.1fs.\\n\", \\\n      FormatTime(\"%Y-%m-%d %H:%M:%S\"), i-1, tmp_l1, tmp_l2, tmp_t2-tmp_t1):\n  end if:\nend do:\n# Maple Export\nsave T, sprintf(\"../codeexport/%s/tmp/energy_kinetic_floatb_%s_linkframe_par2_maple.m\", robot_name, base_method_name):\n# Potential Energy\n# Berechnung in Welt-KS ist bereits erfolgreich. Wird hier nicht nochmal durchgeführt.\n# siehe robot_tree_floatb_twist_rotmat_energy_worldframe_par2.mw\n# Export\nprintf(\"%s: Kinetische Energie (Param. 2) berechnet und gespeichert. Beginne Matlab-Export.\\n\", \\\n      FormatTime(\"%Y-%m-%d %H:%M:%S\")):\n# Matlab Export\n# Floating Base\n# Eliminiere die Basis-Position (nicht: Orientierung). Die kinetische Energie kann nicht davon abhängen.\n# Falls die Ausdrücke doch vorkommen, liegt es daran, dass Maple diese nicht wegoptimieren konnte.\nT_s:=convert_t_s(T):\nfor i from 1 to 3 do\n  T_s := subs({X_base_s[i,1]=0},T_s):\nend do:\nif codegen_act then\n  MatlabExport(T_s, sprintf(\"../codeexport/%s/tmp/energy_kinetic_floatb_%s_linkframe_par2_matlab.m\", robot_name, base_method_name), codegen_opt):\nend if:\n# Fixed Base\nT_s_fixb:=T_s:\nfor i from 1 to NQB do\n  T_s_fixb := subs({X_base_s[i,1]=0},T_s_fixb):\nend do:\nfor i from 1 to 6 do\n  T_s_fixb := subs({V_base_s[i,1]=0},T_s_fixb):\nend do:\nif codegen_act then\n  MatlabExport(T_s_fixb, sprintf(\"../codeexport/%s/tmp/energy_kinetic_fixb_linkframe_par2_matlab.m\", robot_name), codegen_opt):\nend if:\n\n", "meta": {"hexsha": "103257ec37b800a222ca9d100d3b55e4778c57f8", "size": 7054, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "robot_codegen_energy/robot_tree_floatb_rotmat_energy_linkframe_par2.mpl", "max_stars_repo_name": "SchapplM/robsynth-modelgen", "max_stars_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 2, "max_stars_repo_stars_event_min_datetime": "2020-05-25T07:31:46.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-15T09:54:50.000Z", "max_issues_repo_path": "robot_codegen_energy/robot_tree_floatb_rotmat_energy_linkframe_par2.mpl", "max_issues_repo_name": "SchapplM/robsynth-modelgen", "max_issues_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "robot_codegen_energy/robot_tree_floatb_rotmat_energy_linkframe_par2.mpl", "max_forks_repo_name": "SchapplM/robsynth-modelgen", "max_forks_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 48.3150684932, "max_line_length": 184, "alphanum_fraction": 0.7322086759, "num_tokens": 2300, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.916109606718245, "lm_q2_score": 0.6723316926137811, "lm_q1q2_score": 0.6159295225046231}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: lda_exc *)\n\n$define lda_c_pw_params\n$define lda_c_pw_modified_params\n$include \"lda_c_pw.mpl\"\n\nalpha := (4/(9*Pi))^(1/3):\n\n# Eq. (46) of Phys. Rev. A 73, 032506 (2006)\n# I am not sure if this is the on-top pair correlation functional\n# intended by the authors\ng0_C    :=  0.08193:\ng0_D    := -0.01277:\ng0_E    :=  0.001859:\ng0_dd   :=  0.7524:\ng0_aHD  := -alpha*(Pi^2 + 6*log(2) - 3)/(5 * Pi):\ng0_B    := -2*g0_aHD - g0_dd:\npmgb_g0 := rs ->\n        (1 - g0_B*rs + g0_C*rs^2 + g0_D*rs^3 + g0_E*rs^4)*exp(-g0_dd*rs)/2:\n\npmgb_gc0 := rs -> pmgb_g0(rs) - 1/2:\n\n# Eq. (14)\npmgb_phi := (n, z) ->\n         (opz_pow_n(z,n/3) + opz_pow_n(-z,n/3))/2:\n\n# Eq. (22)\npmgb_Q_a := 5.84605:\npmgb_Q_c := 3.91744:\npmgb_Q_d := 3.44851:\npmgb_Q_b := pmgb_Q_d - 3*Pi*alpha/(4*log(2) - 4):\n\npmgb_Q := x ->\n       ((2*log(2) - 2)/Pi^2) * log(\n        (1 + pmgb_Q_a*x + pmgb_Q_b*x^2 + pmgb_Q_c*x^3)/\n        (1 + pmgb_Q_a*x + pmgb_Q_d*x^2)\n       ):\n\n# Eq. (31)\npmgb_b0 := (rs) -> 0.784949*rs:\n\n# Eq. (32)\npmgb_gpp1 := (rs) -> (2^(5/3)/(5*alpha^2*rs^2)) *\n          (1 - 0.02267*rs)/(1 + 0.4319*rs + 0.04*rs^2):\n\n# Eq. (33)\npmgb_D2 := (rs) -> (-0.388*rs + 0.676*rs^2)*exp(-0.547*rs)/rs^2:\n\n# Eq. (34)\npmgb_D3 := (rs) -> (-4.95*rs + rs^2)*exp(-0.31*rs)/rs^3:\n\n# Eq. (28)\npmgb_cc4 := (rs, z) ->\n       + (opz_pow_n( z,2)/4) * pmgb_gpp1(rs*(2/(1 + z))^(1/3))\n       + (opz_pow_n(-z,2)/4) * pmgb_gpp1(rs*(2/(1 - z))^(1/3))\n       + (1 - z^2) * pmgb_D2(rs)\n       - pmgb_phi(8, z)/(5*alpha^2*rs^2):\n\n# Eq. (29)\npmgb_cc5 := (rs, z) ->\n       + (opz_pow_n( z,2)/4) * pmgb_gpp1(rs*(2/(1 + z))^(1/3))\n       + (opz_pow_n(-z,2)/4) * pmgb_gpp1(rs*(2/(1 - z))^(1/3))\n       + (1 - z^2) * pmgb_D3(rs):\n\n# Eq. (30)\npmgb_C2 := (rs, z) ->\n        -3*(1 - z^2)*pmgb_gc0(rs)/(8*rs^3):\n\npmgb_C3 := (rs, z) ->\n        -(1 - z^2)*pmgb_g0(rs)/(sqrt(2*Pi)*rs^3):\n\npmgb_C4 := (rs, z) ->\n        -9*pmgb_cc4(rs, z)/(64*rs^3):\n\npmgb_C5 := (rs, z) ->\n        -9*pmgb_cc5(rs, z)/(40*sqrt(2*Pi)*rs^3):\n\npmgb_a1 := (rs, z) ->\n        4*pmgb_b0(rs)^6*pmgb_C3(rs, z) + pmgb_b0(rs)^8*pmgb_C5(rs, z):\n\npmgb_a2 := (rs, z) ->\n        4*pmgb_b0(rs)^6*pmgb_C2(rs, z) + pmgb_b0(rs)^8*pmgb_C4(rs, z)\n        + 6*pmgb_b0(rs)^4*f_pw(rs, z):\n\npmgb_a3 := (rs, z) ->\n        pmgb_b0(rs)^8*pmgb_C3(rs, z):\n\npmgb_a4 := (rs, z) ->\n        pmgb_b0(rs)^8*pmgb_C2(rs, z) + 4*pmgb_b0(rs)^6*f_pw(rs, z):\n\npmgb_a5 := (rs, z) ->\n        pmgb_b0(rs)^8*f_pw(rs, z):\n\n# Eq. (26)\npmgb_ec_LR := (rs, z) -> (\n           + pmgb_phi(2, z)^3*pmgb_Q(p_a_hyb_omega_0_*sqrt(rs)/pmgb_phi(2, z))\n           + pmgb_a1(rs, z)*p_a_hyb_omega_0_^3\n           + pmgb_a2(rs, z)*p_a_hyb_omega_0_^4\n           + pmgb_a3(rs, z)*p_a_hyb_omega_0_^5\n           + pmgb_a4(rs, z)*p_a_hyb_omega_0_^6\n           + pmgb_a5(rs, z)*p_a_hyb_omega_0_^8\n           )/(1 + pmgb_b0(rs)^2*p_a_hyb_omega_0_^2)^4:\n\nf := (rs, z) -> pmgb_ec_LR(rs, z):\n", "meta": {"hexsha": "2ebff908f6f8193560bc20b070004ea36d773a5c", "size": 3073, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/lda_exc/lda_c_pmgb06.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/lda_exc/lda_c_pmgb06.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/lda_exc/lda_c_pmgb06.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.1946902655, "max_line_length": 78, "alphanum_fraction": 0.5258704849, "num_tokens": 1428, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9294403999037782, "lm_q2_score": 0.6619228691808011, "lm_q1q2_score": 0.6152178562368601}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_c_wi_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_c_wi_params * )(p->params);\n*)\n\nf_num := xt -> params_a_a + params_a_b*xt^2*exp(-params_a_k*xt^2):\nf_den := (rs, xt) -> params_a_c + rs*(1 + params_a_d*(4*Pi/3)^(1/3)*xt^(7/2)):\n\nf := (rs, zeta, xt, xs0, xs1) -> f_num(xt)/f_den(rs, xt):\n", "meta": {"hexsha": "c73a894bb1175f29789dce0050a983989a267d08", "size": 580, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_wi.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_wi.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_wi.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.619047619, "max_line_length": 78, "alphanum_fraction": 0.6396551724, "num_tokens": 208, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9230391685381605, "lm_q2_score": 0.6654105653819836, "lm_q1q2_score": 0.6142000150066934}}
{"text": "with(DifferentialAlgebra):\nring_diff := DifferentialRing(blocks = [[N, S, M, P, E], [y1, y3, y2] ], derivations = [t]):\nsys := [\ndiff(N(t), t) - (-delta_NE*N(t)*P(t) - mu_N*N(t)),\ndiff(S(t), t) - (-mu_LE*S(t)*E(t) + delta_EL*S(t) - S(t)^2*mu_LL - S(t)*delta_LM),\ndiff(M(t), t) - (S(t)*delta_LM - M(t)*mu_M),\ndiff(P(t), t) - (rho_P*P(t)^2 - S(t)*P(t)*mu_PL - E(t)*mu_PE*P(t) - P(t)*mu_P),\ndiff(E(t), t) - (-mu_EE*E(t)^2 + delta_NE*N(t)*P(t) - delta_EL*E(t) + E(t)*P(t)*rho_E),\ny1(t) - (N(t)),\ny3(t) - (M(t)),\ny2(t) - (S(t) + E(t))\n];\nres := CodeTools[CPUTime](RosenfeldGroebner(sys, ring_diff, singsol=none));", "meta": {"hexsha": "dd94e0a4ebdf48c53a05820ede96b5e7670536e3", "size": 608, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "benchmarking/RosenfeldGroebner/CD8-T-cell-differentiation.mpl", "max_stars_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_stars_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 42, "max_stars_repo_stars_event_min_datetime": "2021-07-14T14:30:56.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-23T16:49:40.000Z", "max_issues_repo_path": "benchmarking/RosenfeldGroebner/CD8-T-cell-differentiation.mpl", "max_issues_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_issues_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 25, "max_issues_repo_issues_event_min_datetime": "2021-07-15T21:15:31.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-30T19:50:55.000Z", "max_forks_repo_path": "benchmarking/RosenfeldGroebner/CD8-T-cell-differentiation.mpl", "max_forks_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_forks_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 4, "max_forks_repo_forks_event_min_datetime": "2021-08-28T14:40:36.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-02T19:21:47.000Z", "avg_line_length": 46.7692307692, "max_line_length": 92, "alphanum_fraction": 0.5476973684, "num_tokens": 264, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9230391664210672, "lm_q2_score": 0.665410558746814, "lm_q1q2_score": 0.6142000074734357}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\nparams_a_mu := MU_GE:\nparams_a_b  := 0.4:\nparams_a_c  := 2.14951:\nparams_a_e  := 1.987:\n\nvt84_gamma := 0.000023:\ntpss_ff    := z -> 3:\ntpss_kappa := (x, t) ->\n  1/(vt84_gamma/params_a_mu^2 + vt84_gamma/params_a_mu + 1):\n\n$include \"tpss_x.mpl\"\n\n(* Equation (8) *)\n\nvt84_f   := (x, u, t) -> 1\n    + tpss_fx(x, t)*exp(-vt84_gamma*tpss_fx(x, t)/params_a_mu)/(1 + tpss_fx(x, t))\n    + (1 - exp(-vt84_gamma*tpss_fx(x, t)^2/params_a_mu^2))*(params_a_mu/tpss_fx(x, t) - 1):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) -> mgga_exchange(vt84_f, rs, z, xs0, xs1, u0, u1, t0, t1):\n", "meta": {"hexsha": "19851cf45e8869cb9e85d60f42ed670d6d42b2a7", "size": 830, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_vt84.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_vt84.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_vt84.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.6666666667, "max_line_length": 101, "alphanum_fraction": 0.6289156627, "num_tokens": 335, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9324533107374444, "lm_q2_score": 0.658417487156366, "lm_q1q2_score": 0.6139435657463823}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_x_pbeint_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_x_pbeint_params * )(p->params);\n*)\n\npbeint_mu := s -> params_a_muGE + (params_a_muPBE - params_a_muGE)* \\\n   params_a_alpha*s^2/(1 + params_a_alpha * s^2):\n\n(* this is the gga_x_pbe expression *)\npbeint_f0 := s -> 1 + params_a_kappa * (1 - params_a_kappa/(params_a_kappa + pbeint_mu(s)*s^2)):\npbeint_f  := x -> pbeint_f0(X2S * x):\n\nf := (rs, z, xt, xs0, xs1) -> gga_exchange(pbeint_f, rs, z, xs0, xs1):\n", "meta": {"hexsha": "d85d638295a9d731e4a9fddf585613fca573e8c2", "size": 750, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_pbeint.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_pbeint.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_pbeint.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 30.0, "max_line_length": 96, "alphanum_fraction": 0.6666666667, "num_tokens": 262, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9273632896242073, "lm_q2_score": 0.6619228758499942, "lm_q1q2_score": 0.6138429756257664}}
{"text": "\nmake_complex_projective_space := proc(n::nonnegint)\n local T,x,i;\n\n T := table([]):\n T[\"name\"] := sprintf(\"CP^%d\",n);\n T[\"dimension\"] := 2*n;\n T[\"cohomology_gens\"] := tdeg(x);\n T[\"cohomology_degrees\"] := table([x = 2]);\n T[\"cohomology_rels\"] := [x^(n+1)];\n T[\"cohomology_basis\"] := [seq(x^i,i=0..n)];\n T[\"cohomology_graded_basis\"] := table([]):\n for i from 0 to 2*n do\n  T[\"cohomology_graded_basis\"][i] := \n   `if`(modp(i,2)=0,[x^(i/2)],[]);\n od:\n\n return eval(T);\nend:\n", "meta": {"hexsha": "4ccdc2291f448a33128f795aaac008e9a22846f9", "size": 471, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/spaces/complex_projective_space.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/spaces/complex_projective_space.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/spaces/complex_projective_space.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 23.55, "max_line_length": 51, "alphanum_fraction": 0.5796178344, "num_tokens": 176, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.8539127529517043, "lm_q2_score": 0.7185943925708562, "lm_q1q2_score": 0.6136169160158376}}
{"text": "restart;\nwith(LinearAlgebra):\nwith(VectorCalculus):\nwith(plottools):\nBasisFormat(false):\n\nMNAC := proc(w1,w2,x,t,epsilon)\n\tlocal z1, z2, L, i;\n\tz1 := w1.x;\n\tz2 := exp~(w2.log~(abs(z1) +~ epsilon));\n\n\tL := (z2 -~ t)^~2;\n\treturn add(L[i],i=1..numelems(L));\nend proc:\n\nMNACalt := proc(w1,w2,x,t)\n\tlocal z1, z2, zhat2, w2ones, L, i;\n\n\tz1 := w1.x;\n\tzhat2 := log~(Transpose(w2) *~ z1 +~ 1 -~ w2);\n\tz2 := exp~(zhat2 . Matrix(ColumnDimension(w2),1,1));\n\tL := (z2 -~ t)^~2;\n\treturn add(L[i],i=1..numelems(L));\nend proc:\n\nP := plot3d(\n\tMNAC(<<w[1]|w[1]|0|0>, <w[1]|w[1]|w[1]|w[1]>>, <<w[2]|w[2]>>, <1,1.2,1.8,2>, 13.2, 1E-7),\n\tw[1] = -1 .. 1, w[2] = -1 .. 1, view = [-1..1, -1..1, 0..500],\n\taxes=boxed, orientation=[-45, 39, 0]):\nExport(FileTools:-JoinPath([currentdir(), \"..\", \"paper\", \"graphics\", \"nac-mul-eps-1em7.jpeg\"]), P);\n\nP := plot3d(\n\tMNAC(<<w[1]|w[1]|0|0>, <w[1]|w[1]|w[1]|w[1]>>, <<w[2]|w[2]>>, <1,1.2,1.8,2>, 13.2, 1E-1),\n\tw[1] = -1 .. 1, w[2] = -1 .. 1, view = [-1..1, -1..1, 0..500],\n\taxes=boxed, orientation=[-45, 39, 0]):\nExport(FileTools:-JoinPath([currentdir(), \"..\", \"paper\", \"graphics\", \"nac-mul-eps-1em1.jpeg\"]), P);\n\nP := plot3d(\n\tMNAC(<<w[1]|w[1]|0|0>, <w[1]|w[1]|w[1]|w[1]>>, <<w[2]|w[2]>>, <1,1.2,1.8,2>, 13.2, 1),\n\tw[1] = -1 .. 1, w[2] = -1 .. 1, view = [-1..1, -1..1, 0..500],\n\taxes=boxed, orientation=[-45, 39, 0]):\nExport(FileTools:-JoinPath([currentdir(), \"..\", \"paper\", \"graphics\", \"nac-mul-eps-1.jpeg\"]), P);\n\nP := plot3d(\n\tMNACalt(<<w[1]|w[1]|0|0>, <w[1]|w[1]|w[1]|w[1]>>, <w[2]|w[2]>, <1,1.2,1.8,2>, 13.2),\n\tw[1] = -1 .. 1, w[2] = 0 .. 1, view = [-1..1, 0..1, 0..500],\n\taxes=boxed, orientation=[-45, 39, 0]):\nExport(FileTools:-JoinPath([currentdir(), \"..\", \"paper\", \"graphics\", \"nac-mul-nmu.jpeg\"]), P);\n", "meta": {"hexsha": "715d8a752b111b4c972920db5b96be1b67ad8d5b", "size": 1729, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "export/nac-mul-and-mnac-loss-curvature.mpl", "max_stars_repo_name": "wlm2019/Neural-Arithmetic-Units", "max_stars_repo_head_hexsha": "f9de9d004bb2dc2ee28577cd1760d0a00c185836", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 147, "max_stars_repo_stars_event_min_datetime": "2019-10-07T11:01:54.000Z", "max_stars_repo_stars_event_max_datetime": "2021-11-16T02:51:18.000Z", "max_issues_repo_path": "export/nac-mul-and-mnac-loss-curvature.mpl", "max_issues_repo_name": "wlm2019/Neural-Arithmetic-Units", "max_issues_repo_head_hexsha": "f9de9d004bb2dc2ee28577cd1760d0a00c185836", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 1, "max_issues_repo_issues_event_min_datetime": "2019-12-03T12:40:21.000Z", "max_issues_repo_issues_event_max_datetime": "2019-12-03T12:40:21.000Z", "max_forks_repo_path": "export/nac-mul-and-mnac-loss-curvature.mpl", "max_forks_repo_name": "wlm2019/Neural-Arithmetic-Units", "max_forks_repo_head_hexsha": "f9de9d004bb2dc2ee28577cd1760d0a00c185836", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 19, "max_forks_repo_forks_event_min_datetime": "2019-12-21T15:58:44.000Z", "max_forks_repo_forks_event_max_datetime": "2021-09-03T08:32:38.000Z", "avg_line_length": 35.2857142857, "max_line_length": 99, "alphanum_fraction": 0.5159051475, "num_tokens": 848, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8615382094310357, "lm_q2_score": 0.7122321842389469, "lm_q1q2_score": 0.6136152407083778}}
{"text": "\n# Acceleration Calculation for the Robot based on MDH frames\n# Introduction\n# Berechnung der Beschleunigung von Koordinatensystemen und Schwerpunkten\n# \n# Dateiname:\n# robot -> Berechnung für allgemeinen Roboter\n# tree -> Berechnung für eine beliebige Baumstruktur (ohne Schleifen)\n# floatb_twist -> floating base wird durch base twist (Geschwindigkeit der Basis) berücksichtigt\n# rotmat -> Kinematik wird mit Rotationsmatrizen berechnet\n# acceleration -> Berechnung der Beschleunigung aller Segmente\n# linkframe -> Berechnung der Geschwindigkeit im Körper-KS (KSi)\n\n# Sources\n# [KhalilDombre2002] Modeling, Identification and Control of Robots\n# [Ortmaier2014] Vorlesungsskript Robotik I \n# Initialization\ninterface(warnlevel=0): # Unterdrücke die folgende Warnung.\nrestart: # Gibt eine Warnung, wenn über Terminal-Maple mit read gestartet wird.\ninterface(warnlevel=3):\nwith(LinearAlgebra):\nwith(ArrayTools):\nwith(codegen):\nwith(CodeGeneration):\nwith(StringTools):\ncodegen_act := true:\ncodegen_opt := 2:\nread \"../helper/proc_convert_s_t\":\nread \"../helper/proc_convert_t_s\": \nread \"../helper/proc_MatlabExport\":\nread \"../helper/proc_simplify2\":\nread \"../transformation/proc_rotx\":\nread \"../transformation/proc_roty\":\nread \"../transformation/proc_rotz\":\nread \"../transformation/proc_trotx\":\nread \"../transformation/proc_troty\":\nread \"../transformation/proc_trotz\":\nread \"../transformation/proc_transl\":\nread \"../transformation/proc_trafo_mdh\":\nread \"../robot_codegen_definitions/robot_env\":\nprintf(\"Generiere Beschleunigung für %s (Herleitung im Körper-KS)\\n\", robot_name):\nread sprintf(\"../codeexport/%s/tmp/tree_floatb_definitions\", robot_name):\nread sprintf(\"../codeexport/%s/tmp/kinematic_constraints_maple_inert.m\", robot_name):  \nkin_constraints_exist := kin_constraints_exist: # nur zum Abschätzen der Komplexität\n;\n# Term-Vereinfachungen einstellen\nif not assigned(simplify_options) or simplify_options(5)=-1 then # Standard-Einstellungen:\n  if not kin_constraints_exist then # normale serielle Ketten und Baumstrukturen\n    use_simplify := 0: # Standardmäßig aus\n  else # mit kinematischen Zwangsbedingungen\n    if NJ <= 5 then # bei einfachen Systemen vereinfachungen vornehmen\n      use_simplify := 1\n    else # bei längeren kinematischen Ketten dauert es zu lange / bringt zu wenig\n      use_simplify := 0:\n    end if:\n  end if:\nelse # Benutzer-Einstellungen:\n  use_simplify := simplify_options(5): # fünfter Eintrag ist für Beschleunigung\nend if:\n# Ergebnisse der Kinematik laden\nread sprintf(\"../codeexport/%s/tmp/kinematics_floatb_%s_rotmat_maple.m\", robot_name, base_method_name):\nTrf := Trf:\nTrf_c := Trf_c:\n# Ergebnisse der Geschwindigkeit laden\nread sprintf(\"../codeexport/%s/tmp/velocity_linkframe_floatb_%s_maple.m\", robot_name, base_method_name):\nomega_i_i:=omega_i_i:\nrD_i_i:=rD_i_i:\n# Zeitableitungen der MDH-Drehwinkel laden.\n# Die Berechnung soll nur an einer Stelle erfolgen. Siehe robot_tree_velocity_mdh_angles.mw.\nread sprintf(\"../codeexport/%s/tmp/velocity_mdh_angles_maple.m\", robot_name):\nthetaD := thetaD:\ndD :=dD:\n# Zeitableitungen der Geschwindigkeit laden.\n# Die Berechnung soll nur an einer Stelle erfolgen. Siehe robot_tree_acceleration_mdh_angles.mw.\nread sprintf(\"../codeexport/%s/tmp/acceleration_mdh_angles_maple.m\", robot_name):\nthetaDD :=thetaDD:\ndDD := dDD:\n\n# Calculate Acceleration\n# First assume fixed base model with base velocity and acceleration set to zero\n# Anfangsgeschwindigkeit definieren für floating base model\n# Acceleration of Frames\n# \n# Beschleunigung der Basis der Koordinatensysteme der Körper (ausgedrückt im Körper-KS)\nrDD_i_i := Matrix(3, NL):\n# Winkelbeschleunigung von Körper i ausgedrückt im Körper-KS\nomegaD_i_i := Matrix(3, NL):\n# Anfangsgeschwindigkeit der Basis:\n# twist: Basis-Geschwindigkeit bzgl Welt-KS ausgedrückt im Basis-KS\n# eulangrpy: V_base_t beinhaltet die Geschwindigkeit der Basis im Welt-KS, ausgedrückt im Welt-KS. Daher ist für eine Darstellung im Körper-KS noch die Rotation erforderlich.\nif base_method_name = \"twist\" then:\n  rDD_i_i(1..3,1) := diff~(V_base_t(1..3,1),t):\n  omegaD_i_i(1..3,1) := diff~(V_base_t(4..6,1),t):\nend:\nif base_method_name = \"eulxyz\" then:\n  rDD_i_i(1..3,1) := Transpose(Trf_c(1..3, 1..3, 1)) . diff~(V_base_t(1..3,1),t):\n  omegaD_i_i(1..3,1) := Transpose(Trf_c(1..3, 1..3, 1)) . T_basevel . diff~(V_base_t(4..6,1),t):\nend:\n# Erhöhe die Beschleunigung jedes Körpers\n# Betrachte dazu nur die durch Gelenke angetriebenen Körper, nicht die Basis\nfor i from 1 to NJ do # Gelenke durchgehen\n  # Körper der von Gelenkwinkel i bewegt wird: Körperindex i+1\n  # Vorgängerkörper bestimmen\n  j := v(i) + 1:\n  # Geschwindigkeit des Vorgängers; Trf_c(...,i+1) enthält z-Achse des Körperkoordinatensystems, das von qi bewegt wird.\n  # [Ortmaier2014] (7.7) (S.115) (dort falsche Indizes für MDH), [KhalilDombre2002] (9.14)\n  R_j_i := Trf(1..3,1..3,i): # Rotation vom Vorgänger-Körper (j) zu diesem Körper (i+1)\n  R_i_j := Transpose(R_j_i):\n  # [GautierKhalil1988], equ.7: omega_jj aus [GautierKhalil1988] entspricht omega_i_i(1 .. 3, i+1) hier\n  # [Ortmaier](7.14) (S.99) & (7.19) (S.99)\n  if sigma(i) = 0 then # Drehgelenk\n    omegaD_i_i(1 .. 3, i+1) := Matrix(Multiply(R_i_j,( Matrix(3,1,omegaD_i_i(1 .. 3, j))))) + Matrix( thetaDD(i,1)*<0;0;1>) + Matrix(CrossProduct(R_i_j.Matrix(3,1,omega_i_i(1 .. 3, j)),thetaD(i,1)*<0;0;1>)) :\n  else: # Schubgelenk\n    omegaD_i_i(1 .. 3, i+1) := Multiply(R_i_j, Matrix(3,1,omegaD_i_i(1 .. 3, j))): \n  end if:\n  # Terme vereinfachen (Teil 1)\n  if use_simplify>=1 then\n    tmp_t11:=time():\n    tmp_l11 := length(omegaD_i_i(1 .. 3, i+1)):\n    omegaD_i_i(1 .. 3, i+1) := simplify2(omegaD_i_i(1 .. 3, i+1)):\n    tmp_l21 := length(omegaD_i_i(1 .. 3, i+1)):\n    tmp_t21:=time():\n  end if:\n  # Vektor vom Ursprung des vorherigen Koordinatensystems zu diesem KS\n  r_j_j_i := Trf(1 .. 3, 4, i):\n  # [GautierKhalil1988], equ.8: v_jj aus [GautierKhalil1988] entspricht rD_i_i(1 .. 3, i+1) hier\n  # [Ortmaier](7.17) (S.99) & (7.22) (S.100)\n  if sigma(i) = 0 then # Drehgelenk\n    rDD_i_i(1 .. 3, i+1) := Multiply( R_i_j, ( rDD_i_i(1 .. 3, j) + omegaD_i_i(1 .. 3, j) &x r_j_j_i + CrossProduct(omega_i_i(1..3,j),(omega_i_i(1..3,j) &x r_j_j_i )))) :\n  else: # Schubgelenk\n    rDD_i_i(1 .. 3, i+1) := Matrix( Multiply( R_i_j, ( rDD_i_i(1 .. 3, j)  + CrossProduct(omega_i_i(1..3,j), (omega_i_i(1..3,j) &x r_j_j_i )) + CrossProduct(omegaD_i_i(1..3,j), r_j_j_i)))) + Matrix( 2* dD(i,1) * CrossProduct(R_i_j.omega_i_i(1..3,j),<0;0;1>)) + Matrix(dDD(i,1)*<0;0;1>)  : \n  end if:\n  printf(\"Beschleunigung für Körperkoordinatensystem %d aufgestellt (Herleitung im Körper-KS). %s\\n\", i, FormatTime(\"%Y-%m-%d %H:%M:%S\")): #0=Basis\n  # Terme vereinfachen (Teil 2)\n  if use_simplify>=1 then\n    tmp_t12:=time():\n    tmp_l12 := length(rDD_i_i(1 .. 3, i+1)):\n    rDD_i_i(1 .. 3, i+1) := simplify2(rDD_i_i(1 .. 3, i+1)):\n    tmp_l22 := length(rDD_i_i(1 .. 3, i+1)):\n    tmp_t22:=time():\n    printf(\"%s: Terme für Beschleunigungen vereinfacht. Länge: %d->%d / %d->%d. Rechenzeit %1.1fs und %1.1fs.\\n\", \\\n      FormatTime(\"%Y-%m-%d %H:%M:%S\"), tmp_l11, tmp_l21, tmp_l12, tmp_l22, tmp_t21-tmp_t11, tmp_t22-tmp_t12):\n  end if:\nend do:\n\n# Acceleration of Center of Mass\n\nrDD_i_Si := Matrix(3, NL):\n\nfor i to NL do \n  rDD_i_Si(1 .. 3, i) := Matrix(rDD_i_i(1 .. 3, i))+Matrix(CrossProduct(omegaD_i_i(1 .. 3, i), r_i_i_Si(1 .. 3, i)))+Matrix(CrossProduct(omega_i_i(1 .. 3, i), CrossProduct(omega_i_i(1 .. 3, i), r_i_i_Si(1 .. 3, i)))): \n  printf(\"Beschleunigung für Körperschwerpunkt %d aufgestellt. %s\\n\", i-1, FormatTime(\"%Y-%m-%d %H:%M:%S\")):\n  # Terme vereinfachen\n  if use_simplify>=1 then\n    tmp_t1:=time(): tmp_l1 := length(rDD_i_Si(1 .. 3, i)):\n    rDD_i_Si(1 .. 3, i) := simplify2(rDD_i_Si(1 .. 3, i)):\n    tmp_t2:=time(): tmp_l2 := length(rDD_i_Si(1 .. 3, i)):\n    printf(\"%s: Terme für Schwerpunkts-Beschleunigungen vereinfacht. Länge: %d->%d. Rechenzeit %1.1fs.\\n\", \\\n      FormatTime(\"%Y-%m-%d %H:%M:%S\"), tmp_l1, tmp_l2, tmp_t2-tmp_t1):\n  end if:\nend do:\n# Export\n# Maple Export\nsave omegaD_i_i, rDD_i_i,rDD_i_Si , sprintf(\"../codeexport/%s/tmp/acceleration_linkframe_floatb_%s_maple.m\", robot_name, base_method_name):\nprintf(\"Maple-Ausdrücke exportiert. %s\\n\", FormatTime(\"%Y-%m-%d %H:%M:%S\")):\n\n# Matlab Export\n\nif codegen_act then\n  MatlabExport(convert_t_s(omegaD_i_i), sprintf(\"../codeexport/%s/tmp/acceleration_omegaDii_floatb_%s_linkframe_matlab.m\", robot_name, base_method_name), codegen_opt):\n  MatlabExport(convert_t_s(rDD_i_i), sprintf(\"../codeexport/%s/tmp/acceleration_rDDii_floatb_%s_linkframe_matlab.m\", robot_name, base_method_name), codegen_opt):\n  MatlabExport(convert_t_s(rDD_i_Si), sprintf(\"../codeexport/%s/tmp/acceleration_rDDiSi_floatb_%s_linkframe_matlab.m\", robot_name, base_method_name), codegen_opt):\n  printf(\"Beschleunigung in Matlab exportiert. %s\\n\", FormatTime(\"%Y-%m-%d %H:%M:%S\")):\nend if:\n\n", "meta": {"hexsha": "7ad948ca9402ea3929b454b2102a870975886218", "size": 8843, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "robot_codegen_kinematics/robot_tree_floatb_rotmat_acceleration_linkframe.mpl", "max_stars_repo_name": "SchapplM/robsynth-modelgen", "max_stars_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 2, "max_stars_repo_stars_event_min_datetime": "2020-05-25T07:31:46.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-15T09:54:50.000Z", "max_issues_repo_path": "robot_codegen_kinematics/robot_tree_floatb_rotmat_acceleration_linkframe.mpl", "max_issues_repo_name": "SchapplM/robsynth-modelgen", "max_issues_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "robot_codegen_kinematics/robot_tree_floatb_rotmat_acceleration_linkframe.mpl", "max_forks_repo_name": "SchapplM/robsynth-modelgen", "max_forks_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 50.2443181818, "max_line_length": 289, "alphanum_fraction": 0.7151419202, "num_tokens": 3158, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9032942041005327, "lm_q2_score": 0.679178699175393, "lm_q1q2_score": 0.6134981825136717}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\n$define gga_c_pbe_params\n$include \"gga_c_pbe.mpl\"\n\npkzb_c := 0.53:\n\npkzb_perp := (rs, z, xt, xs0, xs1, ts0, ts1) ->\n  + (1 + pkzb_c*(t_total(z, xs0^2, xs1^2)/(8*t_total(z, ts0, ts1)))^2)\n  * f_pbe(rs, z, xt, xs0, xs1):\n\npkzb_par  := (rs, z, xt, xs0, xs1, ts0, ts1) ->\n  - (1 + pkzb_c)*(\n    + (xs0^2/(8*ts0))^2*gga_stoll_par(f_pbe, rs,  z, xs0,  1)\n    + (xs1^2/(8*ts1))^2*gga_stoll_par(f_pbe, rs, -z, xs1, -1)\n):\n\npkzb_f := (rs, z, xt, xs0, xs1, ts0, ts1) ->\n  pkzb_perp(rs, z, xt, xs0, xs1, ts0, ts1) + pkzb_par(rs, z, xt, xs0, xs1, ts0, ts1):\n\nf := (rs, z, xt, xs0, xs1, us0, us1, ts0, ts1) ->\n  pkzb_f(rs, z, xt, xs0, xs1, ts0, ts1):\n", "meta": {"hexsha": "cb230a7ca815532e45ece8468fa0a50d76dea875", "size": 899, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_c_pkzb.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_c_pkzb.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_c_pkzb.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 29.0, "max_line_length": 85, "alphanum_fraction": 0.5928809789, "num_tokens": 408, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9124361604769413, "lm_q2_score": 0.6723316860482762, "lm_q1q2_score": 0.6134597421848774}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\nk  := 6.5124: (* PBEsol transformation *)\nxi := p -> 2*p/(k + p) - 1:\nxj := a -> - (1 - a^2)^3/(1 + a^3*(1 + a^3)):\n\nwith(orthopoly):\n\nmgga_mbeef := (x, t) -> add(add(\n  + coefs_mbeef[i][j]\n  * P(j-1, xi(X2S^2*x^2))\n  * P(i-1, xj((t - x^2/8)/K_FACTOR_C)),\ni=1..n_mbeef), j=1..n_mbeef):\n", "meta": {"hexsha": "6565bf0c39e581dbd9cf4200baf9db72e63e52be", "size": 525, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/mbeef.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/mbeef.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/mbeef.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 26.25, "max_line_length": 68, "alphanum_fraction": 0.5866666667, "num_tokens": 216, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9362850110816423, "lm_q2_score": 0.6548947357776795, "lm_q1q2_score": 0.6131681249449139}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_x_sogga11_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_x_sogga11_params * )(p->params);\n*)\n\nsogga11_alpha := params_a_mu*X2S*X2S/params_a_kappa:\n\nsogga11_f0 := x -> 1 - 1/(1 + sogga11_alpha*x^2):\nsogga11_f1 := x -> 1 - exp(-sogga11_alpha*x^2):\n\nsogga11_f  := x -> add(params_a_a[i]*sogga11_f0(x)^(i-1), i=1..6) + add(params_a_b[i]*sogga11_f1(x)^(i-1), i=1..6):\n\nf := (rs, zeta, xt, xs0, xs1) -> gga_exchange(sogga11_f, rs, zeta, xs0, xs1):\n", "meta": {"hexsha": "a5fc30424e47280720219cb28d99553a0014fbd2", "size": 733, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_sogga11.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_sogga11.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_sogga11.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 29.32, "max_line_length": 115, "alphanum_fraction": 0.6589358799, "num_tokens": 284, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9263037241905732, "lm_q2_score": 0.6619228891883799, "lm_q1q2_score": 0.6131416373821804}}
{"text": "TITLE\n   Farmer;\n\nSTOCHASTIC\n\n\nSCENARIO\n   sc := 1..3;\n\nINDEX\n   crop    := (Wheat,Corn,SugarB);\n   prLevel := 1..2;\n  \nPROBABILITIES\n   Prob[sc] := (1/3, 1/3, 1/3);\n\nRANDOM DATA\n   Yield[crop,sc] := SPARSEFILE(\"Farmer.dat\");\n\nDATA\n   Cost[crop] := (150,230,260);\n   SellPrice[crop,prLevel]   := (170,  0,\n                                 150,  0,\n                                  36, 10);\n   PurPrice[crop] := (238, 210, 0);\n   MinReq[crop] := (200,240,  0);\n   AvailLand := 500;\n   MaxBeets := 6000;\n \n                     \nSTAGE1 VARIABLES\n   Plant[crop] -> Pl;\n\nSTAGE2 VARIABLES\n   CropPurchased[crop] WHERE (PurPrice > 0) -> Cp;\n   CropSold[crop,prLevel] WHERE (SellPrice > 0) -> Cs;\n\nMODEL\n   MAX Profit =  SUM(crop,prLevel: SellPrice * CropSold) \n              - SUM(crop: PurPrice * CropPurchased) \n              - SUM(crop: Cost * Plant);\n\nSUBJECT TO\n\n   LandUse: SUM(crop: Plant) <= AvailLand;\n\n   MeetMinReq[crop] -> MR:   Yield * Plant \n                    + CropPurchased \n                    - SUM(prLevel: CropSold) \n                   >= MinReq;\n\nBOUNDS\n   CropSold[crop:=SugarB,prLevel:=1] <= MaxBeets;\n\nEND\n\n", "meta": {"hexsha": "0c3ed2bb1b08fa69588f3c3c7579d16784d18db3", "size": 1127, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "Stochastic/FarmerScen.mpl", "max_stars_repo_name": "BjarniMax/mpl-models", "max_stars_repo_head_hexsha": "be22a81b3b42cdf63c933b010c1a2a9764127c98", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "Stochastic/FarmerScen.mpl", "max_issues_repo_name": "BjarniMax/mpl-models", "max_issues_repo_head_hexsha": "be22a81b3b42cdf63c933b010c1a2a9764127c98", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Stochastic/FarmerScen.mpl", "max_forks_repo_name": "BjarniMax/mpl-models", "max_forks_repo_head_hexsha": "be22a81b3b42cdf63c933b010c1a2a9764127c98", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 19.7719298246, "max_line_length": 57, "alphanum_fraction": 0.5199645075, "num_tokens": 372, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9263037363973294, "lm_q2_score": 0.6619228691808012, "lm_q1q2_score": 0.6131416269290169}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_x_optx_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_x_optx_params * )(p->params);\n*)\n\noptx_f := x-> params_a_a + params_a_b*(params_a_gamma*x^2/(1 + params_a_gamma*x^2))^2:\n\nf := (rs, z, xt, xs0, xs1) -> gga_exchange(optx_f, rs, z, xs0, xs1):\n", "meta": {"hexsha": "258a29d360772425ae91d415cb15723ed5a7f841", "size": 536, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_optx.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_optx.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_optx.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 26.8, "max_line_length": 86, "alphanum_fraction": 0.6641791045, "num_tokens": 179, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9073122213606241, "lm_q2_score": 0.6757646075489391, "lm_q1q2_score": 0.6131294871921182}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\nb97mv_par_n := 6:\n\nb97mv_gamma_x := 0.004:\nb97mv_par_x := [\n    [  0.85,  0, 0],\n    [  1.007, 0, 1],\n    [  0.259, 1, 0],\n    [  0,   0, 0],\n    [  0,   0, 0],\n    [  0,   0, 0]\n]:\n\nb97mv_gamma_ss := 0.2:\nb97mv_par_ss := [\n    [  0.443,  0, 0],\n    [ -1.437,  0, 4],\n    [ -4.535,  1, 0],\n    [ -3.39,   2, 0],\n    [  4.278,  4, 3],\n    [  0,    0, 0]\n]:\n\nb97mv_gamma_os := 0.006:\nb97mv_par_os := [\n    [  1.000,  0, 0],\n    [  1.358,  1, 0],\n    [  2.924,  2, 0],\n    [ -8.812,  2, 1],\n    [ -1.39,   6, 0],\n    [  9.142,  6, 1]\n]:\n\n$include \"lda_x_erf.mpl\"\n$include \"b97mv.mpl\"\n\nwb97mv_f := (rs, z, xs0, xs1, ts0, ts1) ->\n   my_piecewise3(screen_dens_zeta(rs,  z), 0, (1 + z)/2 * lda_x_erf_spin(rs*(2/(1 + z))^(1/3),  1)\n    * b97mv_g(b97mv_gamma_x,  b97mv_wx_ss, b97mv_par_x,  b97mv_par_n, xs0, ts0, 0))\n+  my_piecewise3(screen_dens_zeta(rs, -z), 0, (1 - z)/2 * lda_x_erf_spin(rs*(2/(1 - z))^(1/3),  1)\n    * b97mv_g(b97mv_gamma_x,  b97mv_wx_ss, b97mv_par_x,  b97mv_par_n, xs1, ts1, 0)):\n\nf :=  (rs, z, xt, xs0, xs1, us0, us1, ts0, ts1) ->\n  wb97mv_f(rs, z, xs0, xs1, ts0, ts1) +\n  b97mv_f(rs, z, xs0, xs1, ts0, ts1):\n", "meta": {"hexsha": "5bd80adc31ffcafb72169db613dfedf654a00776", "size": 1383, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/hyb_mgga_xc_wb97mv.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/hyb_mgga_xc_wb97mv.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/hyb_mgga_xc_wb97mv.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 25.1454545455, "max_line_length": 98, "alphanum_fraction": 0.5307302965, "num_tokens": 691, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8807970779778824, "lm_q2_score": 0.6959583187272711, "lm_q1q2_score": 0.6129980535293802}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_vxc *)\n\n(* prefix:\n  mgga_x_tb09_params *params;\n\n  assert(p->params != NULL);\n  params = (mgga_x_tb09_params * ) (p->params);\n*)\n\n(* replace: \"br89_x\\(\" -> \"xc_mgga_x_br89_get_x(\" *)\n\n$include \"mgga_x_br89.mpl\"\n\nparams_a_gamma := 0.8:\ntb09_c_HEG := (3*params_a_c - 2)*sqrt(5/12)/(Pi):\n\n# we add here a threshold of 1e-10 for either tau or the Fermi curvature\ntb09_f := (rs, z, x, u, t) -> (params_a_c*X_FACTOR_C*br89_v(br89_x(br89_cQ(br89_Q(x, u, t))))\n  + tb09_c_HEG*sqrt(2*m_max(t - params_a_alpha*x^2/8, 1e-10)))*n_spin(rs, z)^(1/3):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) ->\n  tb09_f(rs, z, xs0, u0, t0):\n", "meta": {"hexsha": "86602fba6005e5f5b64b73283a723ee8a949679e", "size": 868, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_vxc/mgga_x_tb09.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_vxc/mgga_x_tb09.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_vxc/mgga_x_tb09.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 28.0, "max_line_length": 93, "alphanum_fraction": 0.650921659, "num_tokens": 333, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.911179705187943, "lm_q2_score": 0.6723316926137812, "lm_q1q2_score": 0.6126149934643359}}
{"text": "input := FileTools:-Text:-ReadFile(\"AoC-2021-2-input.txt\" ):\n\nsample_input := \"forward 5\ndown 5\nforward 8\nup 3\ndown 8\nforward 2\";\n\n# split input into a flat list: one letter directions, and numbers into integers\ncourse := map(s->ifelse(parse(s)::posint, parse(s), s[1]), StringTools:-Split(input)):\n\nhpos := 0:\ndepth := 0:\naim := 0: # aim = depth in part 1\n\nfor i from 1 to nops(course) by 2 do\n    if course[i] = \"f\" then\n        x := course[i+1];\n        hpos := hpos + x;\n        depth := depth + aim*x;\n    elif course[i] = \"d\" then\n        aim := aim + course[i+1];\n    elif course[i] = \"u\" then\n        aim := aim - course[i+1];\n    end if;\nend do:\n\nhpos * aim; # answer part 1\nhpos * depth; # answer part 2\n", "meta": {"hexsha": "6c0632e5ff2410f6f2684b49d112f2395f8ff583", "size": 714, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "Day2/AoC2-Maple.mpl", "max_stars_repo_name": "johnpmay/AdventOfCode2021", "max_stars_repo_head_hexsha": "b51756bcebea662333072cf518cf040a962ef8b7", "max_stars_repo_licenses": ["CC0-1.0"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2021-12-04T18:24:03.000Z", "max_stars_repo_stars_event_max_datetime": "2021-12-04T18:24:03.000Z", "max_issues_repo_path": "Day2/AoC2-Maple.mpl", "max_issues_repo_name": "johnpmay/AdventOfCode2021", "max_issues_repo_head_hexsha": "b51756bcebea662333072cf518cf040a962ef8b7", "max_issues_repo_licenses": ["CC0-1.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Day2/AoC2-Maple.mpl", "max_forks_repo_name": "johnpmay/AdventOfCode2021", "max_forks_repo_head_hexsha": "b51756bcebea662333072cf518cf040a962ef8b7", "max_forks_repo_licenses": ["CC0-1.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 23.0322580645, "max_line_length": 86, "alphanum_fraction": 0.5910364146, "num_tokens": 240, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8558511616741042, "lm_q2_score": 0.7154239957834733, "lm_q1q2_score": 0.6122964578808151}}
{"text": "\n# Berechne kinematische Zwangsbedingungen für den picker2Dm1 aus 2 Parallelogrammen und einer Fünfgelenkkette\n# Einleitung\n# \n# Herleitung der Kinematischen Zwangsbedingungen für einen 2-FG hybriden Palettier-/Verpackungsroboter mit zwei Parallelogrammen und einer Fünfgelenkkette\n# Roboter: Triowin (Hersteller), \"TDR Series 2-Axis Parallel Robot\"\n# Link: http://en.triowin.com/tdr-series2-axisparallelrobot-15268685491267769.html\n# \n# Die kinematischen Zwangsbedingungen werden als Ersetzungsausdruck für die abhängigen Winkel aufgestellt.\n# picker2Dm2TE -> modellierung der Zwangsbedingungen mit Ausdrücken für trigonometrische Elimination\n\n# Voraussetzung\n# Vier- und Fünf gelenkkette muss mit der Toolbox berechnet worden sein (Arbeitsblätter \"fourbar1TE_kinematic_constraints.mw\" und fivebar1TE_kinematic_constraints.mw)\n# \n# Autor\n# Abderahman Bejaoui\n#  Hiwi bei: Moritz Schappler, moritz.schappler@imes.uni-hannover.de, 2019-01\n# (C) Institut fuer mechatronische Systeme, Leibniz Universitaet Hannover\n# Initialisierung\n# Import \ninterface(warnlevel=0): # Unterdrücke die folgende Warnung.\nrestart: # Gibt eine Warnung, wenn über Terminal-Maple mit read gestartet wird.\ninterface(warnlevel=3):\nkin_constraints_exist := true: # Für Speicherung\n;\nwith(StringTools): # Für Zeitausgabe\nwith(LinearAlgebra):\nwith(codegen):\nwith(CodeGeneration):\ncodegen_act := true:\ncodegen_opt := 1: # Geringerer Optimierungsgrad. Sonst zu lange.\ncodegen_debug := 0: # Zur Code-Generierung auch für Nicht-Inert-Ausdrücke\n;\nread \"../helper/proc_MatlabExport\":\nread \"../transformation/proc_rotx\":\nread \"../transformation/proc_roty\":\nread \"../transformation/proc_rotz\":\nread \"../helper/proc_convert_s_t\":\nread \"../helper/proc_convert_t_s\":\nread \"../robot_codegen_constraints/proc_subs_kintmp_exp\":\nwith(RealDomain): # Schränkt alle Funktionen auf den reellen Bereich ein. Muss nach Definition von MatlabExport kommen. Sonst geht dieses nicht.\n;\nread \"../robot_codegen_definitions/robot_env\":\nread sprintf(\"../codeexport/%s/tmp/tree_floatb_definitions\",robot_name):\n# Variable mit Winkeln der Nebenstruktur nur in Abhängigkeit der verallgemeinerten Koordinaten\nkintmp_qs := Matrix(RowDimension(kintmp_s),1):\n# Konstante Winkel bereits hineinschreiben \nfor i from 1 to RowDimension(kintmp_s) do\n  if diff(kintmp_s(i,1), t) = 0 then\n    kintmp_qs(i,1) := kintmp_s(i,1):\n  end if:\nend do:\n# Variablen definieren für die Hilfswinkel\n# \n# Ersetzungsausdrücke definieren.\n# Speichere Sinus und Cosinus der Winkel direkt ab, da diese in den Rotationsmatrizen direkt auftreten.\n# Spalte 1: Zu suchender Ausdruck (sin oder cos eines Winkels)\n# Spalte 2: Einzusetzender Ausdruck.\n# Dadurch werden arctan-Ausdrücke in der direkten Kinematik reduziert.\nkintmp_subsexp := Matrix(2*RowDimension(kintmp_s),2):\nfor i from 1 to RowDimension(kintmp_s) do\n  kintmp_subsexp(2*i-1, 1) := sin(kintmp_s(i,1)):\n  kintmp_subsexp(2*i,   1) := cos(kintmp_s(i,1)):\n  # Initialisierung der rechten Spalte mit gleichen Werten. Später nur Ersetzung, wenn Vorteilhaft.\n  kintmp_subsexp(2*i-1, 2) := kintmp_subsexp(2*i-1, 1):\n  kintmp_subsexp(2*i,   2) := kintmp_subsexp(2*i,   1):\nend do:\n\n# Sicherung der aktuellen Daten\nbackup_kintmp_qs := kintmp_qs:\nbackup_kintmp_qt := kintmp_qt:\nbackup_kintmp_subsexp := kintmp_subsexp:\n# Aufruf der Viergelenkkette (als Parallelogramm)\nread sprintf(\"../codeexport/fourbar2TE/tmp/kinematic_constraints_maple_inert.m\"):\nkintmp_subsexp_fourbar:= kintmp_subsexp:\nkintmp_qs_fourbar := kintmp_qs:\nkintmp_qt_fourbar := kintmp_qt:\n# Aufrud der Fünfgelenkkette\nread sprintf(\"../codeexport/fivebar1TE/tmp/kinematic_constraints_maple_inert.m\"):\nkintmp_subsexp_fivebar := kintmp_subsexp:\nkintmp_qs_fivebar := kintmp_qs:\nkintmp_qt_fivebar := kintmp_qt:\n# Vorherige Werte für dieses System wieder herstellen\nkintmp_qs := backup_kintmp_qs:\nkintmp_qt := backup_kintmp_qt:\nkintmp_subsexp := backup_kintmp_subsexp:\n# Fünfgelenkkettte A-B-C-E-D\nwinkel1:=<<sin_eta3|sin(eta3_s)>;<cos_eta3|cos(eta3_s)>;<sin_eta12|sin(eta12_s)>;<cos_eta12|cos(eta12_s)>;<sin_eta24|sin(eta24_s)>;<cos_eta24|cos(eta24_s)>>:\n\nfor i from 1 to 6 do\n  # Daten der allgemeinen Fünfgelenkkette laden\n  winkel1(i,2):=kintmp_subsexp_fivebar(i,2):  \n  # Kinematikparameter der FGK an die des Roboters anpassen\n  winkel1(i,2) := subs({BC=L1}, winkel1(i,2)):\n  winkel1(i,2) := subs({AB=e}, winkel1(i,2)):\n  winkel1(i,2) := subs({CD=L3}, winkel1(i,2)):\n  winkel1(i,2) := subs({ED=L4}, winkel1(i,2)):\n  winkel1(i,2) := subs({AE=L3}, winkel1(i,2)):\n  # variable qJ bezogen auf FGK durch allgemeine Variable ersetzen\n  winkel1(i,2) := subs({sin(qJ1s)= sin_phi_s},winkel1(i,2)): \n  winkel1(i,2) := subs({cos(qJ1s)= cos_phi_s},winkel1(i,2)):\n  winkel1(i,2) := subs({sin(qJ2s)= sin_psi_s},winkel1(i,2)): \n  winkel1(i,2) := subs({cos(qJ2s)= cos_psi_s},winkel1(i,2)):\t\n  # Allgemeine Variable durch qJ bezogen auf Roboter ersetzen\n  winkel1(i,2) := subs({sin_phi_s = cos(qJ2s)},winkel1(i,2)): \n  winkel1(i,2) := subs({cos_phi_s = -sin(qJ2s)},winkel1(i,2)):\n  winkel1(i,2) := subs({sin_psi_s = sin(qJ1s)},winkel1(i,2)): \n  winkel1(i,2) := subs({cos_psi_s = cos(qJ1s)},winkel1(i,2)):\t\nend do:\n# Umrechnung aus Zwangsbedingugen für Winkel aus MDH-Tabelle\nsin_eta3_s:=winkel1(1,2):\ncos_eta3_s:=winkel1(2,2):  \nsin_eta12_s:=winkel1(3,2):  \ncos_eta12_s:=winkel1(4,2):  \nsin_eta24_s:=winkel1(5,2):    \ncos_eta24_s:=winkel1(6,2):  \nsin_eta410_s:=sin_eta3_s:\ncos_eta410_s:=-cos_eta3_s:\n\n# Viergelenkkette B-H-L-C\nwinkel2:=<<sin_rho18|sin(rho18_s)>;<cos_rho18|cos(rho18_s)>;<sin_rho05|sin(rho05_s)>;<cos_rho05|cos(rho05_s)>;<sin_rho811|sin(rho811_s)>;<cos_rho811|cos(rho811_s)>>:\nfor i from 1 to 6 do\n  # Daten des Parallelogramms laden\n  winkel2(i,2) := kintmp_subsexp_fourbar(i,2):  \n  # Kinematikparameter des Parallelogramms an die des Roboters anpassen\n  winkel2(i,2) := subs({l1=L5}, winkel2(i,2)):\n  winkel2(i,2) := subs({l2=L1}, winkel2(i,2)):\n  # variable qJ bezogen auf Parallelogramm durch allgemeine Variable ersetzen\n  winkel2(i,2) := subs({sin(qJ1s)= sin_phi_s},winkel2(i,2)): \n  winkel2(i,2) := subs({cos(qJ1s)= cos_phi_s},winkel2(i,2)):\n  # Allgemeine Variable durch qJ bezogen auf Roboter ersetzen\n  winkel2(i,2) := subs({cos_phi_s = -cos(phi05)*cos(qJ1s)-sin(phi05)*sin(qJ1s)},winkel2(i,2)): \n  winkel2(i,2) := subs({sin_phi_s = -cos(phi05)*sin(qJ1s)+sin(phi05)*cos(qJ1s)},winkel2(i,2)):\t\nend do:\nsin_rho18_s:=winkel2(1,2):\ncos_rho18_s:=winkel2(2,2):\nsin_rho05_s:=winkel2(3,2):\ncos_rho05_s:=winkel2(4,2):\nsin_rho811_s:=winkel2(5,2): \ncos_rho811_s:=winkel2(6,2): \n# Viergelenkkette C-G-F-P\nwinkel3:=<<sin_xi23|sin(xi23_s)>;<cos_xi23|cos(xi23_s)>;<sin_xi612|sin(xi612_s)>;<cos_xi612|cos(xi612_s)>;<sin_xi39|sin(xi39_s)>;<cos_xi39|cos(xi39_s)>>:\ncos_xi26_s:= - ( -cos(phi1)*(cos_rho18_s*cos_eta12_s+sin_rho18_s*sin_eta12_s)-sin(phi1)*(sin_eta12_s*cos_rho18_s-cos_eta12_s*sin_rho18_s)): \nsin_xi26_s:= -cos(phi1)*(sin_eta12_s*cos_rho18_s-cos_eta12_s*sin_rho18_s)+sin(phi1)*(cos_eta12_s*cos_rho18_s+sin_eta12_s*sin_rho18_s):\nfor i from 1 to 6 do\n  # Daten des Parallelogramms laden\n  winkel3(i,2) := kintmp_subsexp_fourbar(i,2):  \n  # Kinematikparameter des Parallelogramms an die des Roboters anpassen\n  winkel3(i,2) := subs({l1=L6}, winkel3(i,2)):\n  winkel3(i,2) := subs({l2=L2}, winkel3(i,2)):\n  # variable qJ bezogen auf Parallelogramm durch allgemeine Variable ersetzen\n  winkel3(i,2) := subs({sin(qJ1s) = sin_phi_s},winkel3(i,2)): \n  winkel3(i,2) := subs({cos(qJ1s) = cos_phi_s},winkel3(i,2)):\n  # Allgemeine Variable durch qJ bezogen auf Roboter ersetzen\n  winkel3(i,2) := subs({cos_phi_s = -cos(phi1)*(cos_rho18_s*cos_eta12_s+sin_rho18_s*sin_eta12_s)-sin(phi1)*(sin_eta12_s*cos_rho18_s-cos_eta12_s*sin_rho18_s)},winkel3(i,2)): \n  winkel3(i,2) := subs({sin_phi_s = -cos(phi1)*(sin_eta12_s*cos_rho18_s-cos_eta12_s*sin_rho18_s)+sin(phi1)*(cos_eta12_s*cos_rho18_s+sin_eta12_s*sin_rho18_s)},winkel3(i,2)):\nend do:\nwinkel3(1..6,1):\nsin_xi23_s:=winkel3(1,2):\ncos_xi23_s:=winkel3(2,2):\nsin_xi612_s:=winkel3(3,2): # schon in MDH\n;\ncos_xi612_s:=winkel3(4,2): # schon in MDH\n;\nsin_xi39_s:=winkel3(5,2):\ncos_xi39_s:=winkel3(6,2):\n# Kintmp_subsexp\nkintmp_subsexp(1,2) := sin_eta12_s:\nkintmp_subsexp(2,2) := cos_eta12_s:\nkintmp_subsexp(3,2) := sin_xi23_s:\nkintmp_subsexp(4,2) := cos_xi23_s:\nkintmp_subsexp(5,2) := sin_eta24_s:\nkintmp_subsexp(6,2) := cos_eta24_s:\nkintmp_subsexp(7,2) := sin_rho05_s:\nkintmp_subsexp(8,2) := cos_rho05_s:\nkintmp_subsexp(9,2) := sin_xi26_s:\nkintmp_subsexp(10,2) := cos_xi26_s:\nkintmp_subsexp(11,2) := sin_rho18_s:\nkintmp_subsexp(12,2) := cos_rho18_s:\nkintmp_subsexp(13,2) := sin_xi39_s:\nkintmp_subsexp(14,2) := cos_xi39_s:\nkintmp_subsexp(15,2) := sin_eta410_s:\nkintmp_subsexp(16,2) := cos_eta410_s:\nkintmp_subsexp(17,2) := sin_rho811_s:\nkintmp_subsexp(18,2) := cos_rho811_s:\nkintmp_subsexp(19,2) := sin_xi612_s:\nkintmp_subsexp(20,2) := cos_xi612_s:\n# Kintmp_qs\nkintmp_qs(1,1):=%arctan(sin_eta12_s,cos_eta12_s):\nkintmp_qs(2,1):=%arctan(sin_xi23_s,cos_xi23_s):\nkintmp_qs(3,1):=%arctan(sin_eta24_s,cos_eta24_s):\nkintmp_qs(4,1):=%arctan(sin_rho05_s,cos_rho05_s):\nkintmp_qs(5,1):=%arctan(sin_xi26_s,cos_xi26_s):\nkintmp_qs(6,1):=%arctan(sin_rho18_s,cos_rho18_s):\nkintmp_qs(7,1):=%arctan(sin_xi39_s,cos_xi39_s):\nkintmp_qs(8,1):=%arctan(sin_eta410_s,cos_eta410_s):\nkintmp_qs(9,1):=%arctan(sin_rho811_s,cos_rho811_s):\nkintmp_qs(10,1):=%arctan(sin_xi612_s,cos_xi612_s):\n# Export\nkintmp_qt := convert_s_t(kintmp_qs):\nsave kintmp_subsexp, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_kintmp_subsexp_maple\", robot_name):\nsave kintmp_subsexp, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_kintmp_subsexp_maple.m\", robot_name):\nfor i from 1 to RowDimension(kintmp_s) do\n  tmp := kintmp_qs(i):\n  save tmp, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_maple_inert_kintmpq_%d\",robot_name, i):\n  save tmp, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_maple_inert_kintmpq_%d.m\", robot_name, i):\nend do:\nsave kin_constraints_exist, kintmp_qs, kintmp_qt,kintmp_subsexp, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_maple_inert\" ,robot_name):\nsave kin_constraints_exist, kintmp_qs, kintmp_qt, kintmp_subsexp, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_maple_inert.m\", robot_name):\nsave kintmp_qs, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_kintmp_qs_maple_inert\", robot_name):\n# Liste mit abhängigen konstanten Kinematikparametern erstellen (wichtig für Matlab-Funktionsgenerierung)\nread \"../helper/proc_list_constant_expressions\";\nkc_symbols := Matrix(list_constant_expressions( kintmp_subsexp ));\nsave kc_symbols, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_symbols_list_maple\", robot_name):\nMatlabExport(kc_symbols, sprintf(\"../codeexport/%s/tmp/kinematic_constraints_symbols_list_matlab.m\",robot_name),2);\n\n", "meta": {"hexsha": "db0d0eaf3ec479b04710925f57e2e39f99f75632", "size": 10705, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "systems/picker2Dm2/codegen/picker2Dm2TE_kinematic_constraints.mpl", "max_stars_repo_name": "SchapplM/robsynth-serhybroblib", "max_stars_repo_head_hexsha": "8e4d39cf919a85a5d3d54391b699ae51ada191a1", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "systems/picker2Dm2/codegen/picker2Dm2TE_kinematic_constraints.mpl", "max_issues_repo_name": "SchapplM/robsynth-serhybroblib", "max_issues_repo_head_hexsha": "8e4d39cf919a85a5d3d54391b699ae51ada191a1", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "systems/picker2Dm2/codegen/picker2Dm2TE_kinematic_constraints.mpl", "max_forks_repo_name": "SchapplM/robsynth-serhybroblib", "max_forks_repo_head_hexsha": "8e4d39cf919a85a5d3d54391b699ae51ada191a1", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 49.331797235, "max_line_length": 173, "alphanum_fraction": 0.7593647828, "num_tokens": 4018, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8333245787544825, "lm_q2_score": 0.734119526900183, "lm_q1q2_score": 0.611759845509535}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\n(* prefix:\n  mgga_x_mvs_params *params;\n\n  assert(p->params != NULL);\n  params = (mgga_x_mvs_params * ) (p->params);\n*)\n\n(* equation 10 *)\nmvs_fa := a -> (1 - a) / ((1 + params_a_e1*a^2)^2 + params_a_c1*a^4)^(1/4):\n\n(* alpha *)\nmvs_alpha := (t,x) -> (t - x^2/8)/K_FACTOR_C:\n\n(* eq 7 *)\nmvs_f := (x, u, t) -> (1 + params_a_k0*mvs_fa(mvs_alpha(t,x)))\n      / (1 + params_a_b*(X2S*x)^4)^(1/8):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) ->\n  mgga_exchange(mvs_f, rs, z, xs0, xs1, u0, u1, t0, t1):", "meta": {"hexsha": "5ecaea13184763f30181f7488df88ae2df838699", "size": 755, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_mvs.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_mvs.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_mvs.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 26.0344827586, "max_line_length": 75, "alphanum_fraction": 0.5947019868, "num_tokens": 295, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9284088084787998, "lm_q2_score": 0.6584175072643413, "lm_q1q2_score": 0.6112806134008687}}
{"text": "`is_element/E/Fbar` := (N::posint) -> (A::set,B::set) -> proc(tpqx)\n global reason;\n local t,p,q,x,nt,nx;\n\n if not(type(tpqx,list) and nops(tpqx) = 4) then\n  reason := [convert(procname,string),\"tpqx is not a list of length 4\",tpqx];\n  return false;\n fi;\n \n t,p,q,x := op(tpqx);\n\n if not (`is_element/real_functions`(A)(t) and\n         `is_nonnegative/real_functions`(A)(t)) then\n  reason := [convert(procname,string),\"t is not a nonnegative real function on A\",t,A];\n  return false;\n fi;\n\n nt := `norm/real_functions`(A)(t)^2;\n\n if simplify(nt - 1) <> 0 then \n  reason := [convert(procname,string),\"t is not in normalised\",t];\n  return false;\n fi;\n\n if not(`is_element/RR`(p) and \n        `is_element/RR`(q) and \n        p >= 0 and q >= 0 and simplify(p^2+q^2 - 1) = 0) then\n  reason := [convert(procname,string),\"(p,q) is not in normalised\",p,q];\n  return false;\n fi;\n\n if not `is_element/prime_W`(N)(B)(x) then\n  reason := [convert(procname,string),\"x is not in NWB\",x,B,reason];\n  return false;\n fi;\n\n nx := `norm/prime_W`(N)(B)(x)^2;\n\n if simplify(nx - 1) <> 0 then\n  reason := [convert(procname,string),\"x is not in normalised\",x];\n  return false;\n fi;\n\n return true;\nend:\n\n######################################################################\n\n`random_element/E/Fbar` := (N::posint) -> (A::set,B::set) -> proc()\n local t,p,q,x,n,t0,r,i,b;\n\n n := nops(A);\n t0 := map(abs,`random_element/sphere`(n-1)());\n t := table([seq(A[i]=t0[i],i=1..n)]):\n p,q := op(map(abs,`random_element/sphere`(1)()));\n r := 0;\n while r = 0 do \n  x := `random_element/prime_W`(N)(B)();\n  r := `norm/prime_W`(N)(B)(x);\n od;\n x := table([seq(b = simplify(x[b] /~ r),b in B)]);\n return [eval(t),p,q,eval(x)];\nend:\n\n######################################################################\n\n`is_equal/E/Fbar` := (N::posint) -> (A::set,B::set) -> proc(tpqx1,tpqx2)\n local t1,p1,q1,x1,t2,p2,q2,x2;\n\n t1,p1,q1,x1 := op(tpqx1);\n t2,p2,q2,x2 := op(tpqx2);\n\n return `is_equal/real_functions`(A)(t1,t2) and\n        `is_equal/RR`(p1,p2) and \n        `is_equal/RR`(q1,q2) and \n        `is_equal/prime_W`(N)(B)(x1,x2);\nend:\n\n######################################################################\n\n`theta/E/D/Fbar` := (N::posint) -> (A::set,B::set) -> proc(tpqx)\n local t,p,q,x,u,v,a,b;\n\n t,p,q,x := op(tpqx);\n u := table();\n v := table();\n for a in A do u[a] := p * t[a]; od;\n for b in B do\n  v[b] := q *~ x[b];\n od;\n\n return [u,v];\nend;\n\n######################################################################\n\n`is_leq/E/Fbar` := NULL:\n`list_elements/E/Fbar` := NULL:\n`count_elements/E/Fbar` := NULL:\n", "meta": {"hexsha": "6d820119f426c3c3027a8774391a494c9296284c", "size": 2566, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/operads/fulton/E.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/operads/fulton/E.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/operads/fulton/E.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 25.66, "max_line_length": 87, "alphanum_fraction": 0.5187061574, "num_tokens": 842, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9184802395624257, "lm_q2_score": 0.665410558746814, "lm_q1q2_score": 0.6111664494051413}}
{"text": "with(networks):\n\n# encode an array as a single number.\nencode := (x,F) -> ( F[output](x[1])*100 \n\t           + F[output](x[2])*10\t\n\t           + F[output](x[3])*1 ): \n\n# Define the switch function.\nswitch := proc(a,b,c,F) \n       local x3,x1;\n       x1 := F[input](1);\n       x3 := F[`+`]( x1, F[`+`]( x1,x1 ) ) ;\n       F[`-`]( F[`*`]( x3, F[`*`](a,b) ),c ); \nend:\n\n# Define my three cluster functions.\nf:= (x,F) -> [x[1],x[2],switch(x[1],x[2],x[3],F)]:\ng:= (x,F) -> [x[1],switch(x[1],x[3],x[2],F),x[3]]:\nh:= (x,F) -> [switch(x[2],x[3],x[1],F),x[2],x[3]]:\n \n# Give me the graph neighbors of x.\nN := x -> neighbors(x,G):\n \n# Given a prime F, return a graph G(M,F)\nmakegraph := proc(F,firstelement)\n   local g;\n   g := graph({encode(firstelement,F)},{}):\n   bleg(g, firstelement, 1, F):\n   eval(g);\nend:\n \n# useful function\nbleg := proc(G,x,depth,F)\n  if depth < 100 then\n    step(G,x,f(x,F),depth,F);\n    step(G,x,g(x,F),depth,F);\n    step(G,x,h(x,F),depth,F);\n  fi;\nend:\n \n# useful function\nstep := proc(G,x,y,depth,F)\n  if (encode(y,F) in vertices(G)) then\n    addedge({encode(x,F),encode(y,F)},G):\n  else\n  #  if markoff(x,F) then\n      addvertex(encode(y,F),G):\n      addedge({encode(x,F),encode(y,F)},G):\n      bleg(G,y,depth+1,F);\n  #  fi\n  fi\nend:\n\n\n# Usefull functions.\n# is this a markoff solution?  For debuging\nmarkoff := (x,F) -> markoff2(x[1],x[2],x[3],F):\nmarkoff2 := proc(x,y,z,F)\n    local lhs,rhs,x1,x3;\n    x1 := F[input](1);\n    x3 := F[`+`](x1,x1,x1) ;\t\n    lhs := F[`+`]( F[`^`](x,2), F[`^`](y,2), F[`^`](z,2));\n    rhs := F[`*`]( x3, x,y,z);\n    if lhs = rhs then true else false fi;\n    #if (x^2 + y^2 + z^2 - 3*x*y*z) mod p = 0 then true else false fi;\nend:\n\ndecode2 := proc(x)\n    local n,one,ten,hun;\n    n := 10;\n    one := x mod n;\n    ten := ((x-one)/n) mod n;\n    hun := (x-one-(n*ten))/n^2;\n    [hun,ten,one];\nend:\ndecode := proc(x,F) \n    local y;\n    y := decode2(x);\n    [F[input](y[1]), F[input](y[2]), F[input](y[3])];\nend:\n\n# Enumerate ALL of the solutions\nenumerate := proc(p,k,F)\n\tlocal a,b,c,A,B,C,sols;\n\tsols := {}:\n\tfor a from 0 to p^k-1 do\n\t    for b from 0 to p^k-1 do\n\t\tfor c from 0 to p^k-1 do\n\t\t    A := F[input](a):\n\t\t    B := F[input](b):\n\t\t    C := F[input](c):\n\t\t    if markoff([A,B,C],F) then \n\t\t\tsols := sols union {[A,B,C]};\n\t\t    fi\n\t\tod    \n\t    od\n\tod:  \n\tsols;\nend:\n\n\n# here is where things begin to happen.\n#let our field F be\np:=2:\nk:=2:\nF := GF(p,k):\n#seq(F[input](x),x=0..p^k-1);\n#G := makegraph(F,[F[input](1),F[input](1),F[input](1)]):\n#nops(vertices(G));\n#vertices(G);\n#draw3d(G);\n#draw(G);\nsols := enumerate(p,k,F):\nnops(sols);\nsols;\n\n\n#found solutions.\nu := {}:\n# set of connected components.\nGees := {}:\nfor x in sols do \n    if not(x in u)  then\n        G := makegraph(F, x);\n        for y in vertices(G) do\n            u := u union {decode(y,F)}; \n        od:\n        Gees := Gees union {eval(G)}; \n    fi\nod:\nnops(Gees);\ndraw3d(Gees[1]);\nseq(nops(vertices(Gees[i])), i = 1..nops(Gees));\n#seq((vertices(Gees[i])), i = 1..nops(Gees));\n\n\n\n", "meta": {"hexsha": "0b43357f8fe62281e6ccb76c10a0930a620983b7", "size": 3007, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "docs/SSL/Polynomial-Solution-Graphs/galois.mpl", "max_stars_repo_name": "HalCanary/halcanary.github.io", "max_stars_repo_head_hexsha": "012342fc4bd36a3c6bece46db1022d57a7a317ee", "max_stars_repo_licenses": ["FSFAP"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "docs/SSL/Polynomial-Solution-Graphs/galois.mpl", "max_issues_repo_name": "HalCanary/halcanary.github.io", "max_issues_repo_head_hexsha": "012342fc4bd36a3c6bece46db1022d57a7a317ee", "max_issues_repo_licenses": ["FSFAP"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "docs/SSL/Polynomial-Solution-Graphs/galois.mpl", "max_forks_repo_name": "HalCanary/halcanary.github.io", "max_forks_repo_head_hexsha": "012342fc4bd36a3c6bece46db1022d57a7a317ee", "max_forks_repo_licenses": ["FSFAP"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 21.7898550725, "max_line_length": 70, "alphanum_fraction": 0.5134685733, "num_tokens": 1146, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8354835289107307, "lm_q2_score": 0.7310585786300049, "lm_q1q2_score": 0.6107874011142594}}
{"text": "SL2_11 := table():\n\nSL2_11[\"elements\"] := {\n seq(seq(seq(seq(<<e*a|b>,<c|mods(e*(1+b*c)/a,11)>>,c=-5..5),b=-5..5),a=1..5),e in {-1,1}),\n seq( seq(seq(<<0|e*b>,<mods(-e/b,11)|d>>,d=-5..5),b=1..5),e in {-1,1})\n}:\n\nSL2_11[\"projective_line\"] := {seq(i,i=-5..5),infinity};\n\nSL2_11[\"action\"] := proc(g,u)\n local a,b,c,d,nn,dd;\n\n a := g[1,1]; b := g[1,2];\n c := g[2,1]; d := g[2,2];\n if u = infinity then\n  if c = 0 then\n   return infinity;\n  else\n   return mods(a/c,11);\n  fi;\n else\n  nn := mods(a * u + b,11);\n  dd := mods(c * u + d,11);\n  if dd = 0 then\n   return infinity;\n  else\n   return mods(nn/dd,11);\n  fi;\n fi;\nend:\n\nSL2_11[\"first_hexad\"] := {seq(mods(i^2,11),i=0..5)};\n\nSL2_11[\"hexads\"] := \n {seq(map2(SL2_11[\"action\"],g,SL2_11[\"first_hexad\"]),g in SL2_11[\"elements\"])};\n\n# `is_element/steiner_systems`(SL2_11[\"projective_line\"])(5,6)(SL2_11[\"hexads\"]);", "meta": {"hexsha": "df03876e3ff6c062616a356fa4a7ce755a733dc1", "size": 857, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/groups/SL2_11.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/groups/SL2_11.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/groups/SL2_11.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 23.1621621622, "max_line_length": 91, "alphanum_fraction": 0.5495915986, "num_tokens": 374, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.894789457685656, "lm_q2_score": 0.6825737214979745, "lm_q1q2_score": 0.6107597700896525}}
{"text": "with(DifferentialAlgebra):\nring_diff := DifferentialRing(blocks = [[s, x2, i, r, x1], [y1, y2] ], derivations = [t]):\nsys := [\ndiff(s(t), t) - (-b1*b0*s(t)*x1(t)*i(t) - b0*s(t)*i(t) - s(t)*mu + mu + g*r(t)),\ndiff(x2(t), t) - (M*x1(t)),\ndiff(i(t), t) - (-nu*i(t) + b1*b0*s(t)*x1(t)*i(t) + b0*s(t)*i(t) - mu*i(t)),\ndiff(r(t), t) - (nu*i(t) - mu*r(t) - g*r(t)),\ndiff(x1(t), t) - (-M*x2(t)),\ny1(t) - (i(t)),\ny2(t) - (r(t))\n];\nres := CodeTools[CPUTime](RosenfeldGroebner(sys, ring_diff, singsol=none));", "meta": {"hexsha": "508b9091fd88bb28544f2e1d83edd2ca18ee1eac", "size": 497, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "benchmarking/RosenfeldGroebner/SIRS-forced.mpl", "max_stars_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_stars_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 42, "max_stars_repo_stars_event_min_datetime": "2021-07-14T14:30:56.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-23T16:49:40.000Z", "max_issues_repo_path": "benchmarking/RosenfeldGroebner/SIRS-forced.mpl", "max_issues_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_issues_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 25, "max_issues_repo_issues_event_min_datetime": "2021-07-15T21:15:31.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-30T19:50:55.000Z", "max_forks_repo_path": "benchmarking/RosenfeldGroebner/SIRS-forced.mpl", "max_forks_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_forks_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 4, "max_forks_repo_forks_event_min_datetime": "2021-08-28T14:40:36.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-02T19:21:47.000Z", "avg_line_length": 41.4166666667, "max_line_length": 90, "alphanum_fraction": 0.5150905433, "num_tokens": 220, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9416541610257063, "lm_q2_score": 0.6477982179521103, "lm_q1q2_score": 0.6100018874396421}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\nol1_f  := x -> 1 + (x^2/72 + 0.00677*2^(1/3)*x)/K_FACTOR_C:\n\nf := (rs, zeta, xt, xs0, xs1) -> gga_kinetic(ol1_f, rs, zeta, xs0, xs1):\n", "meta": {"hexsha": "706a123651f6f4676e615e279159865aab597352", "size": 394, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_k_ol1.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_k_ol1.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_k_ol1.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 28.1428571429, "max_line_length": 72, "alphanum_fraction": 0.6446700508, "num_tokens": 149, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.8933094145755219, "lm_q2_score": 0.6825737408694988, "lm_q1q2_score": 0.609749548860756}}
{"text": "\n#---------------------------------------------------------------------\n# ieeedouble converts a number to IEEE double extended format.\n# returns sign (-1 or 1), exponent between -16383 and 16383, mantissa as a fraction between 0.5 and 1.\n\n# TODO : use JMM procedure; check subnormals etc\nieeedoubleExt:=proc(xx)\nlocal x, sign, logabsx, exponent, mantissa, infmantissa;\n    x:=evalf(xx):\n    if (x=0) then\n        sign,exponent,mantissa := 0,0,0;\n    else\n        if (x<0) then sign:=-1:\n        else sign:=1:\n        fi:\n        exponent := floor(log2(sign*x));\n        if (exponent>16383) then mantissa:=infinity: exponent:=16383:\n        elif (exponent< -16382) then\n            # denorm\n            exponent := -16383\n        fi:\n        infmantissa := sign*x*2^(63-exponent);\n        if frac(infmantissa) <> 0.5 then mantissa := round(infmantissa)\n        else\n            mantissa := floor(infmantissa);\n            if type(mantissa,odd) then mantissa := mantissa+1 fi;\n        fi;\n        mantissa := mantissa*2^(-63);\n    fi;\n    sign,exponent,mantissa;\nend:\n\nnearestExt := proc(x)\n    local sign, exponent, mantissa;\n\n    sign, exponent, mantissa := ieeedoubleExt(x);\n    sign*mantissa*2^(exponent);\nend:\n\n\n\nieeehexaExt:= proc(x)\nlocal resultat, sign, exponent, mantissa, t;\n\n    if(x=0) then resultat:=[\"0000\",\"0000\",\"0000\",\"0000\",\"0000\"];\n    elif(x=-0) then resultat:=[\"8000\",\"0000\",\"0000\",\"0000\",\"0000\"];\n    else\n        sign,exponent,mantissa := ieeedoubleExt(x);\n        t := 2**80 +  (exponent+16383)*2^64 + mantissa*2^63;\n        if (sign=-1) then\n            t := t + 2**79;\n        fi:\n   t := convert(t, hex);\n   t:=convert(t, string):\n\n   resultat:=[substring(t, 2..5),\n              substring(t, 6..9 ),  substring(t, 10..13 ),\n              substring(t, 14..17 ),  substring(t, 18..21 )];\n\n    end if:\n    resultat;\nend proc:\n\n\n\nprintDoubleAsShort:=proc(x)\n    local ss;\n    ss:=ieeehexa(x);\n    cat( \"DOUBLE_HEX(\",\n         substring(ss[1], 1..4),  \", \" ,\n         substring(ss[1], 5..8),  \", \" ,\n         substring(ss[2], 1..4),  \", \" ,\n         substring(ss[2], 5..8)) ;\nend proc:\n\nprintDoubleExtAsShort:=proc(x)\n    local ss;\n    ss:=ieeehexaExt(x);\n    cat( \"LDOUBLE_HEX(\", ss[1],  \", \", ss[2],  \", \",ss[3],  \", \", ss[4],  \", \", ss[5],  \")\");\nend proc:\n\nprintDoubleAsULL:=proc(x)\n    local ss;\n    ss:=ieeehexa(x);\n    cat( \"ULL(\", ss[1], ss[2],  \")\");\nend proc:\n\nprintDoubleAsHexInt:=proc(x)\n    local ss;\n    ss:=ieeehexa(x);\n    cat(ss[1], ss[2]);\nend proc:\n\n\n\n\n#---------------------------------------------------------------------\n# hi_lo takes an arbitrary precision number x and returns two doubles such that:\n# x ~ x_hi + x_lo\nhiloExt:= proc(x)\nlocal x_hi, x_lo, res:\n    x_hi:= nearestExt(evalf(x)):\n    res:=x-x_hi:\n    if (res = 0) then\n        x_lo:=0:\n    else\n        x_lo:=nearestExt(evalf(res)):\n    end if;\n    x_hi,x_lo;\nend:\n\n\n#---------------------------------------------------------------------\n# Like poly_exact, but the n first coefficients are exactly representable as the sum of two doubles.\n# (to actually get the two doubles, use procedure hi_lo)\n\npolyExact2Ext:=proc(P,n)\nlocal deg,i, coef, coef_hi, coef_lo, Q:\n    Q:= 0:\n    convert(Q, polynom):\n    deg:=degree(P,x):\n    for i from 0 to deg do\n        coef :=coeff(P,x,i):\n        coef_hi, coef_lo:=hiloExt(coef):\n        Q:= Q + coef_hi*x^i:\n        if(i<n) then\n            Q := Q + coef_lo*x^i:\n        fi:\n    od:\n    return(Q);\nend:\n\nprintPolyExt := proc(fd,P,n, name_of_poly)\nlocal deg,i, coef, coef_hi, coef_lo;\n    convert(Q, polynom):\n    deg:=degree(P,x):\n    fprintf(fd, \" static const long double %s[%d][2] = {\\n\", name_of_poly, deg+1);\n    for i from 0 to deg do\n        coef :=coeff(P,x,i):\n        coef_hi, coef_lo:=hiloExt(coef):\n\n        fprintf(fd,\"{ %1.50eL, \",coef_hi);\n\n        if(i<n) then\n            fprintf(fd,\" %1.50eL},\\n\",coef_lo);\n        else\n            fprintf(fd,\"0},\\n\");\n        fi:\n    od:\n    fprintf(fd,\"}; \\n\");\nend:\n", "meta": {"hexsha": "db4a9483a6bcddeaee4d6ed0b6fe129bbd06d8b2", "size": 3966, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "crlibm/maple/double-extended.mpl", "max_stars_repo_name": "squarePenguin/parvsl", "max_stars_repo_head_hexsha": "0d502abe795540a3dfc99d43726d3fc29a5e6e5d", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "crlibm/maple/double-extended.mpl", "max_issues_repo_name": "squarePenguin/parvsl", "max_issues_repo_head_hexsha": "0d502abe795540a3dfc99d43726d3fc29a5e6e5d", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 1, "max_issues_repo_issues_event_min_datetime": "2019-03-25T17:02:38.000Z", "max_issues_repo_issues_event_max_datetime": "2019-03-25T17:02:38.000Z", "max_forks_repo_path": "crlibm/maple/double-extended.mpl", "max_forks_repo_name": "squarePenguin/parvsl", "max_forks_repo_head_hexsha": "0d502abe795540a3dfc99d43726d3fc29a5e6e5d", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 26.0921052632, "max_line_length": 102, "alphanum_fraction": 0.5277357539, "num_tokens": 1205, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8670357460591569, "lm_q2_score": 0.7025300573952052, "lm_q1q2_score": 0.6091186724426341}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\nb97mv_par_n := 5:\n\nb97mv_gamma_x := 0.004:\nb97mv_par_x := [\n    [  1.000, 0, 0],\n    [  1.308, 0, 1],\n    [  1.901, 0, 2],\n    [  0.416, 1, 0],\n    [  3.070, 1, 1]\n]:\n\nb97mv_gamma_ss := 0.2:\nb97mv_par_ss := [\n    [  1.000, 0, 0],\n    [ -1.855, 0, 2],\n    [ -5.668, 1, 0],\n    [-20.497, 3, 2],\n    [-20.364, 4, 2]\n]:\n\nb97mv_gamma_os := 0.006:\nb97mv_par_os := [\n    [  1.000, 0, 0],\n    [  1.573, 0, 1],\n    [ -6.298, 0, 3],\n    [  2.535, 1, 0],\n    [ -6.427, 3, 2]\n]:\n\n$define lda_x_params\n$include \"lda_x.mpl\"\n$include \"b97mv.mpl\"\n\nb97mv_f_aux := (rs, z, xs0, xs1, ts0, ts1) ->\n  + opz_pow_n( z,1)/2 * f_lda_x(rs*(2/(1 + z))^(1/3),  1)\n    * b97mv_g(b97mv_gamma_x,  b97mv_wx_ss, b97mv_par_x,  b97mv_par_n, xs0, ts0, 0)\n  + opz_pow_n(-z,1)/2 * f_lda_x(rs*(2/(1 - z))^(1/3),  1)\n    * b97mv_g(b97mv_gamma_x,  b97mv_wx_ss, b97mv_par_x,  b97mv_par_n, xs1, ts1, 0):\n\nf :=  (rs, z, xt, xs0, xs1, us0, us1, ts0, ts1) ->\n  + b97mv_f_aux(rs, z, xs0, xs1, ts0, ts1)\n  + b97mv_f(rs, z, xs0, xs1, ts0, ts1):\n", "meta": {"hexsha": "792b4976cdba7d3bf0a4602dae61cedeb5455505", "size": 1257, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_xc_b97mv.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_xc_b97mv.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_xc_b97mv.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 23.7169811321, "max_line_length": 83, "alphanum_fraction": 0.5497215593, "num_tokens": 617, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8791467706759584, "lm_q2_score": 0.6926419831347361, "lm_q1q2_score": 0.6089339627074949}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_gga_x *)\n\nf0 := s -> 1 + B1*s*log(1 + s) + B2*s*log(1 + log(1 + s)):\nf  := x -> f0(X2S*x):\n", "meta": {"hexsha": "b91e0785520cce613810b84cea44502735bc1554", "size": 344, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/gga_x_ak13.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/gga_x_ak13.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/gga_x_ak13.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 26.4615384615, "max_line_length": 68, "alphanum_fraction": 0.625, "num_tokens": 120, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.89181104831338, "lm_q2_score": 0.6825737279551493, "lm_q1q2_score": 0.6087267918788535}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\n$define gga_c_pbe_params\n$include \"gga_c_pbe.mpl\"\n\n$include \"lda_c_2d_amgb.mpl\"\n$undef xc_dimensions_2d\n\nrs2D_factor := 1.704:\nq2d_dd := 1e6:\n\nq2d_rs2D := (rs, xt) -> rs2D_factor*rs*sqrt(X2S*xt)/RS_FACTOR:\n\nq2d_fac := t -> t^4*(1 + t^2)/(q2d_dd + t^6):\n\nq2d_f := (rs, z, xt, xs0, xs1) ->\n  (1 - q2d_fac(tt(rs, z, xt)))*f_pbe(rs, z, xt, xs0, xs1) + q2d_fac(tt(rs, z, xt))*f_amgb(q2d_rs2D(rs, xt), z):\n\nf := (rs, z, xt, xs0, xs1) -> q2d_f(rs, z, xt, xs0, xs1):\n", "meta": {"hexsha": "3b496cdcb71d01cde1a1cd54d77f7b05f81e1b4a", "size": 719, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_q2d.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_q2d.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_c_q2d.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 25.6785714286, "max_line_length": 111, "alphanum_fraction": 0.6411682893, "num_tokens": 302, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9241418241572634, "lm_q2_score": 0.6584175072643415, "lm_q1q2_score": 0.6084711562203468}}
{"text": "with(DifferentialThomas):\nwith(Tools):\nRanking([t], [[x1, x2], [y1] ]):\nsys := [\ndiff(x1(t), t) - (a*x1(t) + b*x1(t) - x2(t)*c*x1(t)),\ndiff(x2(t), t) - (-a*b*x2(t) + d*x2(t)*x1(t)),\ny1(t) - (x1(t))\n];\nres := CodeTools[CPUTime](ThomasDecomposition(sys));", "meta": {"hexsha": "76e688474c94df25270d67f5b5bf2e5dfaf202e1", "size": 253, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "benchmarking/DifferentialThomas/Modified-LV-for-testing.mpl", "max_stars_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_stars_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 42, "max_stars_repo_stars_event_min_datetime": "2021-07-14T14:30:56.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-23T16:49:40.000Z", "max_issues_repo_path": "benchmarking/DifferentialThomas/Modified-LV-for-testing.mpl", "max_issues_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_issues_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 25, "max_issues_repo_issues_event_min_datetime": "2021-07-15T21:15:31.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-30T19:50:55.000Z", "max_forks_repo_path": "benchmarking/DifferentialThomas/Modified-LV-for-testing.mpl", "max_forks_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_forks_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 4, "max_forks_repo_forks_event_min_datetime": "2021-08-28T14:40:36.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-02T19:21:47.000Z", "avg_line_length": 28.1111111111, "max_line_length": 53, "alphanum_fraction": 0.5454545455, "num_tokens": 110, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9136765163620469, "lm_q2_score": 0.665410558746814, "lm_q1q2_score": 0.6079700012663122}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: lda_exc *)\n(* prefix:\n  lda_xc_ksdt_params *params;\n\n  assert(p->params != NULL);\n  params = (lda_xc_ksdt_params * )(p->params);\n*)\n\ng := [2/3, -0.0139261, 0.183208]:\nl := [1.064009, 0.572565]:\n\nalpha := (t, rs) ->\n      2 - (g[1] + g[2]*rs)/(1 + g[3]*rs)*exp(-t*(l[1] + l[2]*t*sqrt(rs))):\n\n\nphi := (malpha, z) -> (opz_pow_n(z,malpha) + opz_pow_n(-z,malpha) - 2)/(2^malpha - 2):\n\n\nlambda := (4/(9*Pi))^(1/3):\na0     := 1/(Pi*lambda):\n\na     := [0.750, 3.043630, -0.0922700, 1.703500, 8.310510, 5.11050]:\n\naa := t -> a0*tanh(1/t)*(a[1] + a[2]*t^2 + a[3]*t^3 + a[4]*t^4)/(1 + a[5]*t^2 + a[6]*t^4):\nbb := (b, t) -> tanh(1/sqrt(t))*(b[1] + b[2]*t^2 + b[3]*t^4)/(1 + b[4]*t^2 + b[5]*t^4):\ndd := (d, t) -> bb(d, t):\nee := (e, t) -> tanh(1/t)*(e[1] + e[2]*t^2 + e[3]*t^4)/(1 + e[4]*t^2 + e[5]*t^4):\ncc := (c, e, t) -> (c[1] + c[2]*exp(-c[3]/t))*ee(e, t):\n\nfxc := (omega, b, c, d, e, rs, t) ->\n    -(omega*aa(t) + bb(b, t)*sqrt(rs) + cc(c, e, t)*rs)/(rs*(1 + dd(d, t)*sqrt(rs) + ee(e, t)*rs)):\n\n# (T/T_F)*opz_pow_n(z,2/3)\nmtt := (rs, z) ->\n    2*(4/(9*Pi))^(2/3)*params_a_T*rs^2*(1 + params_a_thetaParam*z)^(2/3):\n\nf := (rs, z) ->\n  + fxc(1,\n        params_a_b_0_, params_a_c_0_, params_a_d_0_, params_a_e_0_,\n        rs, mtt(rs, z))*(1 - phi(alpha(mtt(rs, z), rs), z))\n  + fxc(2^(1/3),\n        params_a_b_1_, params_a_c_1_, params_a_d_1_, params_a_e_1_,\n        rs, mtt(rs, z)/2^(2/3))*phi(alpha(mtt(rs, z), rs), z):\n", "meta": {"hexsha": "c29bcdca41988e59ef01fb11ed8f7926ada4513e", "size": 1658, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/lda_exc/lda_xc_ksdt.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/lda_exc/lda_xc_ksdt.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/lda_exc/lda_xc_ksdt.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 31.8846153846, "max_line_length": 99, "alphanum_fraction": 0.5180940893, "num_tokens": 772, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9433475730993028, "lm_q2_score": 0.6442251064863697, "lm_q1q2_score": 0.6077281907335568}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\n$define xc_dimensions_2d\n\njs17_lambda := 0.74:\njs17_beta   := 30.0:\n\n(*\nNotes:\n  rho -> 2 rho_sigma, from the spin sum rule\n  tsu2d_unif_sigma/n_sigma^2 = 4 Pi, tau is missing 1/2 in paper\n*)\n\n(* Eq. (18) *)\njs17_ff := s ->\n  (1 + 90*(2*js17_lambda - 1)^2*s^2 + js17_beta*(2*js17_lambda - 1)^4*s^4)^(1/15):\n\n(* Eq. (23) *)\njs17_R := (s, t) ->\n  1 + 128/21*(2*js17_lambda - 1)^2*s^2 +\n  (3*(js17_lambda^2 - js17_lambda + 1/2)*(t - 4*Pi) - t)/(4*Pi):\n\njs17_f := (x, u, t) -> 1/js17_ff(X2S_2D*x)\n  + 2/5 * js17_R(X2S_2D*x, t)/js17_ff(X2S_2D*x)^3:\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) ->\n  mgga_exchange(js17_f, rs, z, xs0, xs1, u0, u1, t0, t1):\n", "meta": {"hexsha": "acfbbf5aec53587b7c0a7c971337ec6000604111", "size": 910, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_2d_js17.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_2d_js17.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_2d_js17.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 25.2777777778, "max_line_length": 82, "alphanum_fraction": 0.6054945055, "num_tokens": 395, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9372107931567177, "lm_q2_score": 0.6477982179521103, "lm_q1q2_score": 0.6071234816524056}}
{"text": "# The Boys embedding, as a map from the Riemann sphere to R^3\n \ncomplex_boys_embedding := proc(z)\n local a,V,M,B,rM,i;\n\n if z = 0 then return [0,0,2]; fi;\n \n a := 1/(z^3-1/z^3+sqrt(5)):\n V := [I*(z^2-1/z^2), z^2+1/z^2, 2/3*I*(z^3+1/z^3)]:\n M := map(Re, a *~ V +~ [0, 0, 1/2]):\n rM := add(M[i]^2,i=1..3);\n B := M /~ rM;\n return B;\nend:\n\nsphere_reduce0 := (x) -> (u) -> rem(u,x[1]^2+x[2]^2+x[3]^2-1,x[3]);\n\nsphere_reduce1 := (x) -> proc(u)\n  local n,d,n0,d0,n1,d1,f;\n  if type(u,list) then return map(sphere_reduce1(x),u); fi;\n\n  n := sphere_reduce0(x)(numer(u));\n  d := sphere_reduce0(x)(denom(u));\n  n0 := coeff(n,x[3],0);\n  n1 := coeff(n,x[3],1);\n  d0 := coeff(d,x[3],0);\n  d1 := coeff(d,x[3],1);\n  n := sphere_reduce0(x)(expand(n * (d0 - d1*x[3])));\n  d := sphere_reduce0(x)(expand(d * (d0 - d1*x[3])));\n  return factor(n/d);\nend:\n\n# The map boys_embedding() is the Boys embedding, as a map from the\n# round sphere S^2 to R^3.\nmake_boys_embedding := proc()\n local x,Z,B,BN,dB,i;\n global boys_embedding0,boys_normal0;\n \n assume(x[1] > 0, x[2] > 0, x[3] > 0);\n Z := (x[1] + I * x[2])/(1 - x[3]);\n B := complex_boys_embedding(Z);\n B := map(sphere_reduce1(x),B);\n dB := denom(B[1]);\n B := factor(dB *~ B);\n B := [op(B),dB];\n boys_embedding0 := unapply(B,x);\n\n BN := subs({seq(x[i] = t*x[i],i=1..3)},\n            [B[1]/B[4],B[2]/B[4],B[3]/B[4]]);\n BN := subs(t = 1, map(diff,BN,t));\n BN := sphere_reduce1(x)(BN);\n BN := expand(factor(BN *~ denom(BN[1]) /~ 480)):\n \n boys_normal0 := unapply(BN,x);\nend:\n\nboys_embedding := proc(x)\n local B;\n B := boys_embedding0(x);\n return [B[1]/B[4],B[2]/B[4],B[3]/B[4]];\nend:\n\nboys_normal := proc(x)\n local n,M,i;\n if x = [0,0,1] then return [0,0,1]; fi;\n M := evalf(boys_jacobian_matrix(x));\n n := convert((1/Transpose(Matrix(M))) . Vector(x),list);\n n := n /~ sqrt(add(n[i]^2,i=1..3));\n return n;\nend:\n\nmake_boys_jacobian := proc()\n local x,p,xred,B,BJM,BJN,BJNP,DBJNP,p_rule,x0,rot,i,j;\n global boys_jacobian_matrix,boys_jacobian_square_norm,boys_poly,boys_p0,boys_corners;\n \n B := boys_embedding(x);\n\n # The embedding map extends naturally over a neighbourhood of S2 in R3,\n # and this is the Jacobian of that extension.\n BJM := [seq([seq(sphere_reduce1(x)(diff(B[i],x[j])),j=1..3)],i=1..3)];\n boys_jacobian_matrix := unapply(BJM,x);\n\n # This is the square norm of the Jacobian restricted to S2\n BJN := sphere_reduce1(x)(expand(add(add(BJM[i][j]^2,j=1..3),i=1..3) -\n                          add(add(BJM[i][j]*x[j],j=1..3)^2,i=1..3))):\n boys_jacobian_square_norm := unapply(BJN,x);\n\n p_rule := {x[1] = (1-p^2)/(1+p^2)/sqrt(2),\n            x[2] = (1-p^2)/(1+p^2)/sqrt(2),\n\t    x[3] = 2 * p/(1+p^2)};\n\n BJNP := factor(expand(simplify(subs(p_rule,BJN))));\n DBJNP := factor(expand(diff(BJNP,p)));\n boys_poly := unapply(select(g -> degree(g,p) = 18,{op(numer(DBJNP))})[1],p);\n boys_p0 := fsolve(boys_poly(p),p=0.15..0.16);\n\n x0 := evalf(subs(p = boys_p0,subs(p_rule,[x[1],x[2],x[3]])));\n\n rot := (x) -> [(-x[1]-sqrt(3)*x[2])/2,(sqrt(3)*x[1]-x[2])/2,x[3]];\n boys_corners :=\n  evalf([x0,rot(x0),rot(rot(x0)),\n         -~ x0, -~ rot(x0), -~ rot(rot(x0))]);\nend:\n\n# We now construct a map boys_embedding_alt() which is obtained by precomposing\n# boys_embedding() with a linear map and then postcomposing with an affine map.\n# This has the effect that boys_embedding_alt sends [1,1,1]/sqrt(3) to itself\n# and is equivariant for the third-twist about that axis.  Moreover, the\n# \"corner points\" for boys_embedding_alt are at the other points of the form\n# [+/- 1, +/- 1, +/- 1]/sqrt(3), where the three signs are not all the same.\n\nmake_boys_embedding_alt := proc()\n global boys_M0,boys_M1,boys_a1,boys_embedding_alt;\n local u,a,x,M,M0,be0,F,F0,rels,sol,i;\n \n if not(type(boys_corners,list(list))) then\n  make_boys_jacobian():\n fi;\n\n u := table():\n u[ 0] := [ 1, 1, 1] /~ sqrt(3): \n u[ 1] := [ 1, 1,-1] /~ sqrt(3): \n u[ 2] := [ 1,-1, 1] /~ sqrt(3): \n u[ 3] := [-1, 1, 1] /~ sqrt(3): \n\n M := Matrix(3,3,[seq(a[i],i=1..9)]):\n\n M0 := subs(solve(evalf(map(op,[seq(convert(M . Vector(u[i]),list) -~ boys_corners[i],i=1..3)]))),M):\n boys_M0 := M0;\n be0 := unapply(simplify(expand(evalf(boys_embedding(M0 . <x[1],x[2],x[3]>)))),x):\n\n F := (y) -> convert(M . Vector(y),list) +~ [a[10],a[11],a[12]]:\n rels := map(op,evalf([\n  F(be0(u[0])) -~ u[0], F(be0(u[1])) +~ u[1], F(be0(u[2])) +~ u[2], F(be0(u[3])) +~ u[3]\n ])):\n sol := solve(rels);\n boys_M1 := subs(sol,M);\n boys_a1 := subs(sol,[a[10],a[11],a[12]]);\n\n boys_embedding_alt := (x) ->\n  evalf(convert(boys_M1 . Vector(boys_embedding(boys_M0 . <x[1],x[2],x[3]>)),list) +~\n   boys_a1);\n   \nend:", "meta": {"hexsha": "362fd84b6a78f8c220b2fafa45e9f236f0e8fb0e", "size": 4562, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/geometry/boys.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/geometry/boys.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/geometry/boys.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 31.6805555556, "max_line_length": 101, "alphanum_fraction": 0.5826391933, "num_tokens": 1763, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8519527906914787, "lm_q2_score": 0.7122321903471563, "lm_q1q2_score": 0.6067882021865643}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* The B97 function g *)\nb97_g := (gamma, cc, x) -> add(cc[i]*(gamma*x^2/(1 + gamma*x^2))^(i-1), i=1..5):\n\n(* The parallel and perpendicular components of the energy *)\nb97_fpar  := (lda_func, mgamma, cc, rs, z, xs0, xs1) ->\n  + lda_stoll_par(lda_func, rs,  z) * b97_g(mgamma, cc, xs0)\n  + lda_stoll_par(lda_func, rs, -z) * b97_g(mgamma, cc, xs1):\n\nb97_fperp := (lda_func, mgamma, cc, rs, z, xs0, xs1) ->\n  lda_stoll_perp(lda_func, rs, z) * b97_g(mgamma, cc, sqrt(xs0^2 + xs1^2)/sqrt(2)):\n\nb97_f := (lda_func, gamma_ss, cc_ss, gamma_ab, cc_ab, rs, z, xs0, xs1) ->\n  + b97_fpar (lda_func, gamma_ss, cc_ss, rs, z, xs0, xs1)\n  + b97_fperp(lda_func, gamma_ab, cc_ab, rs, z, xs0, xs1):\n", "meta": {"hexsha": "25b1599f842623291d1e4a8516d87fb54b777475", "size": 920, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/b97.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/b97.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/b97.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 40.0, "max_line_length": 83, "alphanum_fraction": 0.65, "num_tokens": 354, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9314625107731764, "lm_q2_score": 0.6513548714339144, "lm_q1q2_score": 0.6067126439501734}}
{"text": "\n# Base Parameter Properties for Robot based on MDH frames\n# Einleitung\n# Untersuchung von Eigenschaften der Regressorform und des Minimalparametervektors\n# \n# Dateiname:\n# robot -> Berechnung für allgemeinen Roboter\n# tree -> Berechnung für eine allgemeine Baumstruktur (aber bisher nur für serielle Strukturen getestet)\n# base_parameter_transformations -> Umwandlung der Minimalparameterform in andere Darstellungen\n# Authors\n# Moritz Schappler, schappler@irt.uni-hannover.de, 2016-04\n# \n# (C) Institut fuer Regelungstechnik, Leibniz Universitaet Hannover\n# Quellen\n# [SousaCor2014] Sousa, C. D. and Cortesao, R.: Physical feasibility of robot base inertial parameter identification: A linear matrix inequality approach (2014)\n# Initialisierung\ninterface(warnlevel=0): # Unterdrücke die folgende Warnung.\nrestart: # Gibt eine Warnung, wenn über Terminal-Maple mit read gestartet wird.\ninterface(warnlevel=3):\nwith(LinearAlgebra):\nwith(ArrayTools):\nwith(codegen):\nwith(CodeGeneration):\nwith(StringTools):\ncodegen_opt := true:\ncodegen_act := true:\nread \"../helper/proc_convert_s_t\":\nread \"../helper/proc_convert_t_s\": \nread \"../helper/proc_MatlabExport\":\nread \"../robot_codegen_definitions/robot_env\":\nread sprintf(\"../codeexport/%s/tmp/tree_floatb_definitions\", robot_name):\n# Ergebnisse der Minimalparametergruppierung laden\n\nif base_method_name=\"twist\" then\n  paramfile := sprintf(\"../codeexport/%s/tmp/minimal_parameter_vector_fixb_maple\", robot_name):\n  expstring:=\"fixb\":\n  PV2:=Matrix(PV2_vec[11..10*NL,1]):\nelif base_method_name=\"eulxyz\" then \n  paramfile := sprintf(\"../codeexport/%s/tmp/minimal_parameter_vector_floatb_eulxyz_maple\", robot_name):\n  expstring:=\"floatb_eulxyz\":\n  PV2:=PV2_vec:\nelse\n  printf(\"Nicht behandelte Basis-Methode: %s\\n\", base_method_name):\nfi:\nif FileTools[Exists](paramfile) then\n  read paramfile:\nelse\n  printf(\"%s. Minimalparametervektor wurde nicht berechnet. Abbruch der Untersuchung der Parameter-Abhängigkeiten.\\n\", FormatTime(\"%Y-%m-%d %H:%M:%S\")):\n  quit: # Funktioniert in GUI nicht richtig...\n  robot_name := \"\": # ...Daher auch Löschung des Roboternamens.\nend if:\nMPV := Paramvec2:\n\nprintf(\"Generiere Minimalparameter-Transformationen für %s (%s)\\n\", robot_name, expstring):\n\n# Minimalparametervektor als Matrixdarstellung\n# Siehe [SousaCor2014] equ. (38)\n# Beispielrechnung:\n# U=dU/dPV2*PV2=dU/dMPV*MPV # Parameterlineare Form\n# MPV=dMPV/dPV2 * PV2 # Minimalparametervektor MPV hängt nur linear von den normalen Parametern im Parametervektor PV2 ab\n# dU/dMPV = dU/dPV2 * dMPV/dPV1\n# Benutze Fixed-Base Parameter: Ignoriere Parameter der Basis\nParamvec_size := RowDimension(MPV):\nK := Matrix(Paramvec_size, RowDimension(PV2)):\nfor i to Paramvec_size do \n  for j from 1 to RowDimension(PV2) do \n    K[i,j] := diff(MPV[i, 1], PV2[j,1]):\n  end do:\nend do:\n# Export der Umwandlung von Parametersatz 2 nach Minimalparameter (Matrix)\nif codegen_act then\n  MatlabExport(K, sprintf(\"../codeexport/%s/tmp/PV2_MPV_transformation_linear_%s_matlab.m\", robot_name, expstring), 2):\nend:\nsave K, sprintf(\"../codeexport/%s/tmp/PV2_MPV_transformation_linear_dependant_%s_maple\", robot_name, expstring):\n# Aufteilung der Matrixdarstellung in einzelne Teilmatrizen\n# Generate the Matrices required in [SousaCor2014] equ. (33)\n# Wenn ein Inertialparameter zu einer linear unabhängigen Spalte der Regressormatrizen gehört, \n# steht er in K als 1, alle anderen Spalteneinträge dieser Zeile sind Null und der Inertialparameter steht auch in keiner anderen Zeile.\n# Falls er zu einer linear abhängigen Spalte der Regressormatrix gehört, steht er in mehreren Spalten von K oder nur in einer Spalte aber dort nicht alleine.\n# Die Permutationsmatrizen P_b, P_d wählen die jeweiligen Parameter aus dem Gesamt-Inertialparametervektor aus \nn_b := RowDimension(K):\nn_d := ColumnDimension(K)-RowDimension(K): \nn := n_b+n_d: # [SousaCor2014] equ. (31)\n;\nP_b := Matrix(n, n_b): # für [SousaCor2014] equ. (33) \nP_d := Matrix(n, n_d): # für [SousaCor2014] equ. (33)\n;\n\nfor i from 1 to n_b do:\n  # gehe alle Zeilen durch und prüfe, ob der MPV nur aus einem Inertialparameter-Eintrag besteht   \n  # falls er nicht aus einem Inertialparameter-Eintrag besteht, kommt der Basis-Eintrag nur in dieser Zeile vor.   \n  # falls der MPV-Eintrag aus mehreren Inertialparameter-Einträgen besteht, die nur hier vorkommen, wird der kleinere genommen (der weiter unten steht)\n\n  # gehe alle Spalten durch und prüfe, wenn dieser Eintrag 1 ist, ob er noch in einer anderen Zeile vorkommt.\n  linunabh_gefunden :=false: # Merker, ob ein Basis-Inertialparameter gefunden wurde.\n  for j from 1 to n do: # alle Spalten durchgehen\n    if K(i,j)=1 then\n      # printf(\"In MPV-Zeile %d kommt Inertialparameter %d (%s) direkt vor.\\n\", i, j, convert(PV2(j,1), string)):\n      # gehe alle anderen Zeilen durch\n      Index_j_lin_unabh := true: # Merker, dass aktueller Index Basis-Inertialparameter ist.\n      for i2 from 1 to n_b do:\n        if i = i2 then # die selbe Zeile die gegengeprüft wird ausschließen\n          next\n        end if:\n        if not (K(i2,j) = 0) then\n          # Der Inertialparameter kommt auch in einem anderen MPV-Eintrag vor, damit ist er kein Basisparameter\n          # printf(\"Inertialparameter %d (%s) kommt sowohl in MPV-Zeile %d als auch in Zeile %d vor. Kein Basisparameter.\\n\", j, convert(PV2_vec(10+j,1), string), i, i2):\n          Index_j_lin_unabh := false:\n          break:\n        end if:\n      end do:\n      if Index_j_lin_unabh then\n        # linear unabhängigen Parameter speichern\n        P_b(j,i):=1:\n        # printf(\"Für MPV-Zeile %d ist %d (%s) der Basisparameter\\n\", i, j, convert(PV2(j,1), string)):\n        linunabh_gefunden:=true:\n      end if:  \n    end if:\n    if linunabh_gefunden then\n      # Nicht weiter nach einem Basisparameter suchen, da bereits einer gefunden wurde.\n      break:\n    end if\n  end do: # j-Schleife über Inertialparameter\n  if not linunabh_gefunden then\n    # printf(\"Keinen Basis-Inertialparameter in MPV Zeile %d gefunden.\\n\", i):\n  end if:\nend do:\n\n# Alle linear abhängigen Parameter (der Rest) in andere Permutationsmatrix P_d packen\n\ni_d := 0:\nfor j from 1 to n do:\n  # Prüfe ob der betrachtete Parameter in der Permutationsmatrix für linear unabhängige vorkommt\n  # Summe über die Zeilen von P_b: Prüfe, ob linear unabhängig\n  linunabh := false:\n  for i_b from 1 to ColumnDimension(P_b) do:\n    if P_b(j, i_b) = 1 then:\n      linunabh := true: # kommt in P_b vor: Linear unabhängig!\n      break:      \n    end if:    \n  end do:\n  \n  if not (linunabh) then \n    i_d := i_d+1; \n    P_d(j, i_d) := 1 \n  end if\nend do:\n# Transformationsmatrix K_d füllen. Setze K_d nur aus den Spalten von K für die linear abhängigen Inertialparameter zusammen\n# K_d: Matrix zur Aufteilung des Minimalparametervektors in linear abhängige und unabhängige Inertialparameter\nK_d:=Matrix(n_b, n_d):\nj_Kd := 0:\nfor j from 1 to n do:\n  # Prüfe, ob der Inertialparameter j linear abhängig ist.\n  linabh := false:\n  for j_d from 1 to ColumnDimension(P_d) do:\n    # j: Index des untersuchten Inertialparameters\n    # j_d: Index der untersuchten Spalte von P_d. Ein Eintrag hier bedeutet, dass der Inertialparameter abhängig ist.\n    if P_d(j, j_d) = 1 then:\n      linabh := true:\n      break:      \n    end if:    \n  end do:\n\n  if linabh then\n    j_Kd := j_Kd + 1:\n    K_d(..,j_Kd) := K(..,j):\n  end if:\nend do:\nprintf(\"Inertialparametervektor hat %d linear abhängige und %d linear unabhängige Einträge\\n\", n_d, n_b):\ndelta_b := Transpose(P_b) . PV2: # Zur Überprüfung\n;\ndelta_d := Transpose(P_d) . PV2: # Zur Überprüfung\n;\nif codegen_act then\n  MatlabExport(K_d, sprintf(\"../codeexport/%s/tmp/PV2_MPV_transformation_linear_dependant_%s_matlab.m\", robot_name, expstring), 2):\n  MatlabExport(P_b, sprintf(\"../codeexport/%s/tmp/PV2_permutation_linear_independant_%s_matlab.m\", robot_name, expstring), 2):\n  MatlabExport(P_d, sprintf(\"../codeexport/%s/tmp/PV2_permutation_linear_dependant_%s_matlab.m\", robot_name, expstring), 2):\nend if:\n\n", "meta": {"hexsha": "5ac2bd580c9d749fa415464c68772759b96409ab", "size": 7974, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "robot_codegen_definitions/robot_tree_base_parameter_transformations.mpl", "max_stars_repo_name": "SchapplM/robsynth-modelgen", "max_stars_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 2, "max_stars_repo_stars_event_min_datetime": "2020-05-25T07:31:46.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-15T09:54:50.000Z", "max_issues_repo_path": "robot_codegen_definitions/robot_tree_base_parameter_transformations.mpl", "max_issues_repo_name": "SchapplM/robsynth-modelgen", "max_issues_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "robot_codegen_definitions/robot_tree_base_parameter_transformations.mpl", "max_forks_repo_name": "SchapplM/robsynth-modelgen", "max_forks_repo_head_hexsha": "33b345ae0dd6ec4aa15499ab3d43edbbded0bea5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 44.3, "max_line_length": 170, "alphanum_fraction": 0.7321294206, "num_tokens": 2432, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8887587993853654, "lm_q2_score": 0.6825737344123242, "lm_q1q2_score": 0.6066434126882825}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n(* prefix:\n  mgga_c_m08_params *params;\n\n  assert(p->params != NULL);\n  params = (mgga_c_m08_params * )(p->params);\n*)\n\n\n$define lda_c_pw_params\n$define lda_c_pw_modified_params\n$include \"lda_c_pw.mpl\"\n\n$define gga_c_pbe_params\n$include \"gga_c_pbe.mpl\"\n\n(* the prefactor of t was chosen to get the right K_FACTOR_C in mgga_series_w *)\nm08_f := (rs, z, xt, xs0, xs1, ts0, ts1) ->\n  + mgga_series_w(params_a_m08_a, 12, 2^(2/3)*t_total(z, ts0, ts1))\n    * f_pw(rs, z)\n  + mgga_series_w(params_a_m08_b, 12, 2^(2/3)*t_total(z, ts0, ts1))\n    * (f_pbe(rs, z, xt, xs0, xs1) - f_pw(rs, z)):\n\nf := (rs, z, xt, xs0, xs1, us0, us1, ts0, ts1) ->\n  m08_f(rs, z, xt, xs0, xs1, ts0, ts1):\n", "meta": {"hexsha": "10a5e13918a80880cdeea733836e30278d487906", "size": 934, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_c_m08.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_c_m08.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_c_m08.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.4705882353, "max_line_length": 80, "alphanum_fraction": 0.6627408994, "num_tokens": 352, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9019206659843131, "lm_q2_score": 0.6723316926137812, "lm_q1q2_score": 0.6063898479645821}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_x_b88_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_x_b88_params * )(p->params);\n*)\n\n$ifdef gga_x_b88_params\nparams_a_beta  := 0.0042:\nparams_a_gamma := 6.0:\n$endif\n\nb88_f := x -> 1 + params_a_beta/X_FACTOR_C*x^2/(1 + params_a_gamma*params_a_beta*x*arcsinh(x)):\n\nf := (rs, zeta, xt, xs0, xs1) -> gga_exchange(b88_f, rs, zeta, xs0, xs1):\n", "meta": {"hexsha": "8533dc7c9f846626c58aaf149262bcca08b5e8d6", "size": 629, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_b88.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_b88.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_b88.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 25.16, "max_line_length": 95, "alphanum_fraction": 0.6788553259, "num_tokens": 217, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9046505402422645, "lm_q2_score": 0.6688802669716106, "lm_q1q2_score": 0.6051028948732577}}
{"text": "######################################################################\n\n`is_element/PP` := (N::posint) -> (A::set) -> proc(R)\n local E,i,a,b;\n global reason;\n \n if not(type(R,list) and nops(R) = N) then\n  reason := [convert(procname,string),\"R is not a list of length N\",R,N];\n  return false;\n fi;\n\n E := {seq(seq([a,b],b in A),a in A)};\n \n for i from 1 to N do\n  if not `is_element/preord`(A)(R[i]) then\n   reason := [convert(procname,string),\"R[i] is not a preorder on A\",R,i,A,reason];\n   return false;\n  fi;\n\n  E := E intersect R[i] intersect `op/preord`(A)(R[i]);\n od;\n\n if E <> {seq([a,a],a in A)} then\n  reason := [convert(procname,string),\"E <> Delta\",E];\n  return false;\n fi;\n\n return true;\nend:\n\n`is_equal/PP` := (N::posint) -> (A::set) -> proc(R,S)\n local i;\n global reason;\n\n for i from 1 to N do\n  if not(`is_equal/preord`(A)(R[i],S[i])) then\n   reason := [convert(procname,string),\"R[i] <> S[i]\",i,R[i],S[i]];\n   return false;\n  fi;\n od;\n\n return true;\nend:\n\n`is_leq/PP` := (N::posint) -> (A::set) -> proc(R,S)\n local i;\n global reason;\n\n for i from 1 to N do\n  if not(`is_leq/preord`(A)(R[i],S[i])) then\n   reason := [convert(procname,string),\"R[i] is not a subset of S[i]\",i,R[i],S[i]];\n   return false;\n  fi;\n od;\n\n return true;\nend:\n\n`mu/F/PP` := (N::posint) -> (A::set) -> proc(x)\n local AA,a,b,i;\n \n AA := {seq(seq([a,b],b in A),a in A)};\n \n [seq(select(ab -> x[ab[1]][i] <= x[ab[2]][i],AA),i=1..N)];\nend:\n\n`sigma/PP/F` := (N::posint) -> (A::set) -> proc(R)\n local x0,x,r,a,i;\n\n x0 := table();\n for i from 1 to N do\n  r := eval(`rank_table/preord`(A)(R[i]));\n  for a in A do x0[a,i] := r[a]; od;\n od;\n\n x := table();\n for a in A do x[a] := [seq(x0[a,i],i=1..N)]; od;\n\n return eval(x);\nend;\n\n`random_element/PP` := (N::posint) -> (A::set) -> proc()\n local R,ok,i;\n\n ok := false;\n while not(ok) do\n  R := [seq(`random_element/preord`(A),i=1..N)];\n  ok := `is_element/PP`(N)(A)(R);\n od;\n\n return R;\nend;\n\n`list_elements/PP` := (N::posint) -> proc(A::set)\n local RR,QQ,R,Q,i;\n\n RR := `list_elements/preord`(A);\n QQ := [[]];\n for i from 1 to N do\n  QQ := [seq(seq([op(Q),R],R in RR),Q in QQ)];\n od;\n\n QQ := select(`is_element/PP`(N)(A),QQ);\n\n return QQ;\nend;\n\n######################################################################\n\n`is_element/realisation/PP` := (N::posint) -> (A::set) -> \n `is_element/realisation/generic`(\"PP\",\n  eval(`is_element/PP`(N)(A)),\n  eval(`is_leq/PP`(N)(A))\n );\n\n`is_equal/realisation/PP` := (N::posint) -> (A::set) -> \n `is_equal/realisation/generic`(\"PP\",\n  eval(`is_equal/PP`(N)(A))\n );\n\n", "meta": {"hexsha": "0ee566d2bcb5c5fdbbc68b718e76b4c0491ccc13", "size": 2536, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/operads/parallel/PP.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/operads/parallel/PP.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/operads/parallel/PP.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 20.958677686, "max_line_length": 83, "alphanum_fraction": 0.5264195584, "num_tokens": 890, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8652240825770432, "lm_q2_score": 0.6992544085240401, "lm_q1q2_score": 0.6050117541031655}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\nrge2_kappa := 0.8040:\n\nrge2_den := s -> rge2_kappa + 1*MU_GE*s^2 + MU_GE^2*s^4/rge2_kappa:\nrge2_f0  := s -> 1 + rge2_kappa * (1 - rge2_kappa/rge2_den(s)):\nrge2_f   := x -> rge2_f0(X2S * x):\n\nf := (rs, zeta, xt, xs0, xs1) -> gga_exchange(rge2_f, rs, zeta, xs0, xs1):\n", "meta": {"hexsha": "03fd3b0b4cd78be2407aaee1a11dd6eaba9242f7", "size": 526, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_rge2.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_rge2.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_rge2.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 29.2222222222, "max_line_length": 74, "alphanum_fraction": 0.6501901141, "num_tokens": 210, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9284088005554476, "lm_q2_score": 0.651354857898194, "lm_q1q2_score": 0.6047235823572263}}
{"text": "(*\n Copyright (C) 2019 Susi Lehtola\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n(* prefix:\n  gga_x_s12_params *params;\n\n  assert(p->params != NULL);\n  params = (gga_x_s12_params * )(p->params);\n*)\n\ns12g_f := x -> params_a_bx*(params_a_A + params_a_B*(1 - 1/(1 + params_a_C*x^2 + params_a_D*x^4))*(1 - 1/(1 + params_a_E*x^2))):\n\nf := (rs, z, xt, xs0, xs1) -> gga_exchange(s12g_f, rs, z, xs0, xs1):\n\n", "meta": {"hexsha": "8c5f1ef68d4fb2a01c656ed84f2f2680d98884e2", "size": 575, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_s12.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_s12.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_x_s12.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 27.380952381, "max_line_length": 128, "alphanum_fraction": 0.6504347826, "num_tokens": 203, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.923039160069787, "lm_q2_score": 0.6548947290421275, "lm_q1q2_score": 0.6044934806291762}}
{"text": "fd := fopen(\"nonlinfit.txt\", APPEND):\nwith(plots): \nwith(Statistics): \nwith(LinearAlgebra):\n\n\ndta := ImportMatrix(\"/tmp/dta.csv\"):\nlen := RowDimension(dta):\nx := dta[1 .. len, 1]; y := dta[1 .. len, 2]: \n#pointplot([x, y]); \nN:=15; \ntmp := NonlinearFit(c*exp(a*ln(binomial(N, v))-(b-a)*ln(factorial(v))), x, y, v, output = [parametervalues, residualmeansquare], initialvalues = [a = 1, b = 1, c = 0.1e-5]):\nprint(tmp);\nfprintf(fd,\"%f , %f, %f,%f\\n\", eval(a, tmp[1]), eval(b, tmp[1]), eval(c, tmp[1]), tmp[2]):\nfclose(fd):\n", "meta": {"hexsha": "a5e3bb07463a6ea0e26a7a77ada943a36b33c1be", "size": 522, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "kaflonDTA/artificial/fitModel.mpl", "max_stars_repo_name": "jkobject/CodonUsageBias", "max_stars_repo_head_hexsha": "b31033ba4e20bbd260d9ce1e31659ee97d24bc74", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "kaflonDTA/artificial/fitModel.mpl", "max_issues_repo_name": "jkobject/CodonUsageBias", "max_issues_repo_head_hexsha": "b31033ba4e20bbd260d9ce1e31659ee97d24bc74", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "kaflonDTA/artificial/fitModel.mpl", "max_forks_repo_name": "jkobject/CodonUsageBias", "max_forks_repo_head_hexsha": "b31033ba4e20bbd260d9ce1e31659ee97d24bc74", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 32.625, "max_line_length": 173, "alphanum_fraction": 0.5938697318, "num_tokens": 199, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.9032942145139149, "lm_q2_score": 0.668880247169804, "lm_q1q2_score": 0.6041956574711214}}
{"text": "(*\n Copyright (C) 2020 M.A.L. Marques\n               2020 Susi Lehtola\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\n(* prefix:\n  mgga_x_mbr_params *params;\n\n  assert(p->params != NULL);\n  params = (mgga_x_mbr_params * ) (p->params);\n*)\n\n(* replace: \"br89_x\\(\" -> \"xc_mgga_x_br89_get_x(\" *)\n\n$include \"mgga_x_br89.mpl\"\n\nparams_a_at := 0:\n\n(*Equation 15. The three equations below are from mgga_x_tm.mpl; note\nthat the numerical factors in the denominator in eqn 15 just\ncorrespond to going from 'x' to 's'.*)\ntm_p  := x -> (X2S*x)^2:\ntm_y  := x -> (2*params_a_lambda - 1)^2 * tm_p(x):\ntm_f0 := x -> (1 + 10*(70/27)*tm_y(x) + params_a_beta*tm_y(x)^2)^(1/10):\n\n(* definition below equation 16 *)\nmbr_D := (ts, xs) -> 2*ts - 1/4 * (2*params_a_lambda - 1)^2 * xs^2:\n\n(* k_\\sigma is not defined in the paper, but Subrata Jana\nsaid on GitLab that k_\\sigma = (6\\pi^2\\rho_\\sigma)^{1/3} *)\nk_sigma := (6*Pi^2)^(1/3):\n\n(* Equation 18. Note that there's a typo in the paper: since Becke's\ntau is two times the kinetic energy density, there should be a factor\nof two in front of tau uniform as well. *)\nbr89_Q := (x, u, t) ->\n  1/6*(\n  + 6*(params_a_lambda^2 - params_a_lambda + 1/2)*(2*t - 2*K_FACTOR_C - 1/36*x^2)\n  + 6/5*k_sigma^2*(tm_f0(x)^2 - 1)\n  - 2*params_a_gamma*mbr_D(t, x)\n  ):\n", "meta": {"hexsha": "11812790fd73e82c8d473a3be4192b1868e857cf", "size": 1454, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_mbr.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_mbr.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_mbr.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 30.2916666667, "max_line_length": 81, "alphanum_fraction": 0.6458046768, "num_tokens": 527, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8807970685907242, "lm_q2_score": 0.6859494550081925, "lm_q1q2_score": 0.6041822691726207}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n(* prefix:\n  mgga_x_m06l_params *params;\n\n  assert(p->params != NULL);\n  params = (mgga_x_m06l_params * )(p->params);\n*)\n\n$define gga_x_pbe_params\n$include \"gga_x_pbe.mpl\"\n$include \"gvt4.mpl\"\n\nm06_alpha  := 0.00186726:\nm06_coeff_d := params_a_d:\n\n(* there is a factor if 2 in the definition of z, as in Theor. Chem. Account 120, 215 (2008) *)\n(* A MINUS was missing in Eq. (7) of the paper *)\n\nm06_f := (x, u, t) ->\n  + pbe_f(x)*mgga_series_w(params_a_a, 12, t)\n  + gtv4(m06_alpha, m06_coeff_d, x, 2*(t - K_FACTOR_C)):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) ->\n  mgga_exchange(m06_f, rs, z, xs0, xs1, u0, u1, t0, t1):\n", "meta": {"hexsha": "db9725fbc4fbc8e744ad242da7bb853eb839bd96", "size": 883, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_m06l.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_m06l.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_m06l.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 26.7575757576, "max_line_length": 95, "alphanum_fraction": 0.657984145, "num_tokens": 330, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9273633016692236, "lm_q2_score": 0.6513548782017745, "lm_q1q2_score": 0.6040426104075527}}
{"text": "(*\n Copyright (C) 2019 M.A.L. Marques\n               2019 Susi Lehtola\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\n$include \"mgga_x_tm.mpl\"\n$include \"lda_x_erf.mpl\"\n\n(* See text after eq 7  *)\njs18_H := x -> (2*tm_lambda - 1)^2 * tm_p(x):\n(* See text after eq 7 *)\njs18_G := (x, t) ->\n  (3*(tm_lambda^2 - tm_lambda + 1/2)*(t - K_FACTOR_C - x^2/72) - (t - K_FACTOR_C)\n   + 7/18*(2*tm_lambda - 1)^2*x^2)/K_FACTOR_C:\n\n(* not to run into problems with erfs and exp *)\njs18_A := (rs, z, x) -> m_max(1e-10, a_cnst*rs/(tm_f0(x)*opz_pow_n(z,1/3))):\n\njs18_DME_SR := (rs, z, x, t) ->\n  + attenuation_erf   (js18_A(rs, z, x))/tm_f0(x)^2\n  + attenuation_erf_f2(js18_A(rs, z, x))*7*js18_G(x, t)/(9*tm_f0(x)^4)\n  + attenuation_erf_f3(js18_A(rs, z, x))*245*js18_H(x)/(54*tm_f0(x)^4):\n\npjs18_f := (rs, z, x, u, t) -> js18_DME_SR(rs, z, x, t):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) ->\n  mgga_exchange_nsp(pjs18_f, rs, z, xs0, xs1, u0, u1, t0, t1):\n", "meta": {"hexsha": "3d8b4092230e01d511acc0e8a0a99df321aa0d01", "size": 1116, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/hyb_mgga_x_pjs18.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/hyb_mgga_x_pjs18.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/hyb_mgga_x_pjs18.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 32.8235294118, "max_line_length": 81, "alphanum_fraction": 0.6093189964, "num_tokens": 465, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9073122213606241, "lm_q2_score": 0.665410558746814, "lm_q1q2_score": 0.6037351321733858}}
{"text": "######################################################################\n# W(N)(A) is Map(A,RR^N) modulo translation, except that we take\n# W(N)(emptyset) to be empty.\n#\n# Elements are represented as tables indexed by A, whose values \n# are lists of length N of real numbers.  The equivalence relation\n# is built into the definition of the function `is_equal/W` rather\n# than the representation of the elements.\n\n`is_element/W` := (N::posint) -> (A::set) -> proc(x)\n local a;\n global reason;\n\n if A = {} then\n  reason := [convert(procname,string),\"W(N)(emptyset) = emptyset\"];\n  return false;\n fi;\n\n if not(type(x,table)) then\n  reason := [convert(procname,string),\"x is not a table\",x];\n  return false;  \n fi;\n\n if map(op,{indices(x)}) <> A then\n  reason := [convert(procname,string),\"x is not indexed by A\",x,A];\n  return false;\n fi;\n\n for a in A do\n  if not `is_element/R`(N)(x[a]) then\n   reason := [convert(procname,string),\"x[a] is not in R^N\",a,x[a],N];\n   return false;\n  fi;\n od;\n\n return true;\nend;\n\n`is_equal/W` := (N::posint) -> (A::set) -> proc(x,y) \n local a0,u0,a;\n global reason;\n\n if A = {} then \n  reason := [convert(procname,string),\"W(N)(emptyset) = emptyset\"];\n  return false;\n fi;\n\n a0 := A[1];\n u0 := x[a0] -~ y[a0];\n\n for a in A do\n  if not(`is_equal/R`(N)(x[a] -~ y[a],u0)) then\n   reason := [convert(procname,string),\"x[a] - y[a] <> x[a0] - y[a0]\",a,a0];\n   return false;\n  fi;\n od;\n\n return true;\nend;\n\n`is_leq/W` := NULL;\n\n`random_element/W` := (N::posint) -> (A::set) -> proc()\n local x,a;\n\n x := table();\n for a in A do\n  x[a] := `random_element/R`(N)();\n od:\n\n return eval(x);\nend;\n\n`list_elements/W` := NULL;\n`count_elements/W` := NULL;\n\n", "meta": {"hexsha": "4239c4a2aaf23c1d07c3646ecdbf3a7c21a971ce", "size": 1668, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/scratch/W.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/scratch/W.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/scratch/W.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 21.6623376623, "max_line_length": 76, "alphanum_fraction": 0.5851318945, "num_tokens": 514, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8221891305219503, "lm_q2_score": 0.734119521083126, "lm_q1q2_score": 0.6035850907385258}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n(* prefix:\n  mgga_x_mn12_params *params;\n\n  assert(p->params != NULL);\n  params = (mgga_x_mn12_params * ) (p->params);\n*)\n\n$define lda_x_params\n$include \"lda_x.mpl\"\n\nmn12_omega_x := 2.5:\nmn12_gamma_x := 0.004:\n\nmn12_vx := (rs, z) -> 1/(1 + rs/(mn12_omega_x*RS_FACTOR)*(2/(1 + z))^(1/3)):\nmn12_ux := x -> mn12_gamma_x*x^2/(1 + mn12_gamma_x*x^2):\nmn12_wx := t -> (K_FACTOR_C - t)/(K_FACTOR_C + t):\n\nmn12_pol1  := t-> params_a_c[ 1] + params_a_c[ 2]*mn12_wx(t) + params_a_c[ 3]*mn12_wx(t)^2 + params_a_c[ 4]*mn12_wx(t)^3\n  + params_a_c[ 5]*mn12_wx(t)^4 + params_a_c[ 6]*mn12_wx(t)^5:\nmn12_pol2  := t-> params_a_c[ 7] + params_a_c[ 8]*mn12_wx(t) + params_a_c[ 9]*mn12_wx(t)^2 + params_a_c[10]*mn12_wx(t)^3\n   + params_a_c[11]*mn12_wx(t)^4:\nmn12_pol3  := t-> params_a_c[12] + params_a_c[13]*mn12_wx(t) + params_a_c[14]*mn12_wx(t)^2 + params_a_c[15]*mn12_wx(t)^3:\nmn12_pol4  := t-> params_a_c[16] + params_a_c[17]*mn12_wx(t) + params_a_c[18]*mn12_wx(t)^2:\nmn12_pol5  := t-> params_a_c[19] + params_a_c[20]*mn12_wx(t) + params_a_c[21]*mn12_wx(t)^2 + params_a_c[22]*mn12_wx(t)^3\n   + params_a_c[23]*mn12_wx(t)^4:\nmn12_pol6  := t-> params_a_c[24] + params_a_c[25]*mn12_wx(t) + params_a_c[26]*mn12_wx(t)^2 + params_a_c[27]*mn12_wx(t)^3:\nmn12_pol7  := t-> params_a_c[28] + params_a_c[29]*mn12_wx(t) + params_a_c[30]*mn12_wx(t)^2:\nmn12_pol8  := t-> params_a_c[31] + params_a_c[32]*mn12_wx(t) + params_a_c[33]*mn12_wx(t)^2 + params_a_c[34]*mn12_wx(t)^3:\nmn12_pol9  := t-> params_a_c[35] + params_a_c[36]*mn12_wx(t) + params_a_c[37]*mn12_wx(t)^2:\nmn12_pol10 := t-> params_a_c[38] + params_a_c[39]*mn12_wx(t) + params_a_c[40]*mn12_wx(t)^2:\n\nmn12_f := (rs, z, x, u, t) ->\n  + mn12_pol1(t)\n  + mn12_pol2(t)*mn12_ux(x)\n  + mn12_pol3(t)*mn12_ux(x)^2\n  + mn12_pol4(t)*mn12_ux(x)^3\n  + mn12_pol5(t)*mn12_vx(rs, z)\n  + mn12_pol6(t)*mn12_ux(x)*mn12_vx(rs, z)\n  + mn12_pol7(t)*mn12_ux(x)^2*mn12_vx(rs, z)\n  + mn12_pol8(t)*mn12_vx(rs, z)^2\n  + mn12_pol9(t)*mn12_ux(x)*mn12_vx(rs, z)^2\n  + mn12_pol10(t)*mn12_vx(rs, z)^3:\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) ->\n  mgga_exchange_nsp(mn12_f, rs, z, xs0, xs1, u0, u1, t0, t1):\n", "meta": {"hexsha": "824fddaa01e40dcdf9355c1bfacdf89bfef272fc", "size": 2365, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_mn12.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_mn12.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_x_mn12.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 43.0, "max_line_length": 121, "alphanum_fraction": 0.6545454545, "num_tokens": 1062, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9263037221561135, "lm_q2_score": 0.651354857898194, "lm_q1q2_score": 0.6033524293155634}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\n$include \"attenuation.mpl\"\n$define gga_x_b88_params\n$include \"gga_x_b88.mpl\"\n\n(* Eq. 5 - Note that their K_s = 2*X_FACTOR_C*b88_f\n   Note that there is a misprint sqrt(mu) -> sqrt(pi)\n*)\nlcgau_arg := (rs, z, xs) ->\n  sqrt(2*X_FACTOR_C*b88_f(xs)/Pi)/(6*n_spin(rs, z)^(1/3)):\n\n(* Eq. 4 + Eq. 8 *)\nlcgau_f := (rs, z, xs) ->  b88_f(xs) * (\n  + attenuation_erf(p_a_hyb_omega_0_*lcgau_arg(rs, z, xs))\n  +  p_a_hyb_coeff_2_*attenuation_gau(p_a_hyb_omega_2_*lcgau_arg(rs, z, xs))\n  +  p_a_hyb_coeff_3_*attenuation_gau(p_a_hyb_omega_3_*lcgau_arg(rs, z, xs))\n  ):\n\nf := (rs, zeta, xt, xs0, xs1) -> gga_exchange_nsp(lcgau_f, rs, zeta, xs0, xs1):\n", "meta": {"hexsha": "2b85b933d09e653a30cbb432525feb2df82a0464", "size": 895, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "external/libxc-5.1.6/maple/gga_exc/gga_x_lcgau.mpl", "max_stars_repo_name": "pmu2022/lsms", "max_stars_repo_head_hexsha": "3c5f266812cad0b6d570bef9f5abb590d044ef92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2022-01-27T14:45:51.000Z", "max_stars_repo_stars_event_max_datetime": "2022-01-27T14:45:51.000Z", "max_issues_repo_path": "external/libxc-5.1.6/maple/gga_exc/gga_x_lcgau.mpl", "max_issues_repo_name": "pmu2022/lsms", "max_issues_repo_head_hexsha": "3c5f266812cad0b6d570bef9f5abb590d044ef92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 3, "max_issues_repo_issues_event_min_datetime": "2021-09-14T01:30:26.000Z", "max_issues_repo_issues_event_max_datetime": "2021-09-25T14:05:10.000Z", "max_forks_repo_path": "external/libxc-5.1.6/maple/gga_exc/gga_x_lcgau.mpl", "max_forks_repo_name": "pmu2022/lsms", "max_forks_repo_head_hexsha": "3c5f266812cad0b6d570bef9f5abb590d044ef92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2022-01-03T18:16:26.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-03T18:16:26.000Z", "avg_line_length": 30.8620689655, "max_line_length": 79, "alphanum_fraction": 0.6759776536, "num_tokens": 348, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9161096090086368, "lm_q2_score": 0.6584175072643413, "lm_q1q2_score": 0.603182605144377}}
{"text": "# E(N) is the set of polynomials of the form 0 or +/- epsilon^d\n# with 0 <= d < N.\n\n######################################################################\n\n`is_element/E` := (N::posint) -> proc(u)\n local d;\n global reason;\n\n if not(`is_element/P`(N)(u)) then\n  reason := [convert(procname,string)];\n  return false;\n fi;\n\n if (u = 0) then return true; fi;\n\n d := degree(u,epsilon);\n if u <> epsilon^d and u <> -epsilon^d then\n  reason := [convert(procname,string),\"u <> +/- epsilon^d\",u,d];\n  return false;\n fi;\n\n return true;\nend;\n\n######################################################################\n# `is_leq/E`(N)(u,v) is true if v-u is zero or is c epsilon^d + higher\n# with c > 0.\n\n`is_leq/E` :=  (N::posint) -> proc(u,v)\n local w,d,c;\n\n w := expand(v-u);\n if (w = 0) then return true; fi;\n d := ldegree(w,epsilon);\n c := coeff(w,epsilon,d);\n return evalb(c >= 0);\nend:\n\n######################################################################\n\n`is_preceq/E` := (N::posint) -> proc(u,v)\n if (u = v) then return true; fi;\n if (u = 0) then return true; fi;\n if (v = 0) then return false; fi;\n return evalb(ldegree(u,epsilon) > ldegree(v,epsilon));\nend:\n\n######################################################################\n\n`list_elements/E` := proc(N::posint)\n local i;\n return [seq(-epsilon^i,i=0..N-1),0,seq(epsilon^(N-1-i),i=0..N-1)];\nend:\n\n`random_element/E` := (N::posint) -> proc()\n local L;\n L := `list_elements/E`(N);\n L[rand(1..nops(L))()];\nend:\n\n######################################################################\n\n`count_elements/E` := (N::posint) -> 2*N+1;\n\n`abs/E` := (N::posint) -> proc(u) \n if (u = 0) then return 0; fi;\n return epsilon^degree(u,epsilon);\nend:\n\n######################################################################\n\n`lambda/P/E` := (N::posint) -> proc(u)\n local c,d;\n\n if u = 0 then\n  return 0;\n else\n  d := ldegree(u,epsilon);\n  c := coeff(u,epsilon,d);\n  return signum(c) * epsilon^d;\n fi;\nend:\n\n######################################################################\n\n`delta/P` := (N::posint) -> (u,v) -> `lambda/P/E`(N)(v-u);\n", "meta": {"hexsha": "6ed05bea1f20f0af660d496a14fcc57587900b18", "size": 2071, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/operads/chains/E.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/operads/chains/E.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/operads/chains/E.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 23.5340909091, "max_line_length": 70, "alphanum_fraction": 0.4413326895, "num_tokens": 587, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8244619393159451, "lm_q2_score": 0.7310585903489891, "lm_q1q2_score": 0.6027299831527086}}
{"text": "input := FileTools:-Text:-ReadFile(\"AoC-2021-19-input.txt\" ):\n\nwith(StringTools):\nscanners := map(l->[parse]~(l[2..-1]),\n     map(Split,Split(SubstituteAll(input, \"\\n\\n\", \"X\"),\"X\"),\"\\n\")):\n\ntruelocs := table();\ntruelocs[1] := scanners[1]; # base 0\n\nsunknown := [seq(2..nops(scanners))];\nknownscans := [1=[0,0,0]];\n\ndist := (v,u) -> add((v[i]-u[i])^2,i=1..3):\n\n# used to generate equations\nM := Matrix(3,3,(i,j)->a[i,j]):\nA := <a[0,1], a[0,2], a[0,3]>:\n\nfor k1 to nops(scanners)-1 do\n\n    # find a scanner that overlaps with a known scanner \n    for j1 from 1 to nops(knownscans) do\n        sn1 := lhs(knownscans[j1]);\n        scan0 := truelocs[sn1];\n\n        for i1 from 1 to nops(sunknown) do\n            # compute all pairwise distances\n                sn2 := sunknown[i1];\n                scan1 := scanners[sn2];\n                n0 := nops(scan0); n1 := nops(scan1);\n                # building pairs\"\n                M0 := Matrix([seq([seq(dist(scan0[i],scan0[j]),j=1..n0)],i=1..n0)]):\n                M1 := Matrix([seq([seq(dist(scan1[i],scan1[j]),j=1..n1)],i=1..n1)]):\n\n            ints01 := {entries(M0,'nolist')} intersect {entries(M1,'nolist')} minus {0};\n\n            if nops(ints01) < 50 then\n#                printf(\"scanner %d can not overlap  scanner %d -- only %d common pairs\\n\", sn1, sn2, nops(ints01) );\n                next;\n            end if; # at least 66 needed for 12 in common\n\n                # looking up pair from their common distances\n            pairs0 := NULL: pairs1 := NULL:\n            for i from 1 to nops(ints01) do\n                member(ints01[i], M0, 'loc0'); pairs0 := pairs0, [loc0];\n                member(ints01[i], M1, 'loc1'); pairs1 := pairs1, [loc1];nu\n            end do:\n            pairs0 := [pairs0];\n            pairs1 := [pairs1];\n\n            # these are the overlapping sets of beacons\n            o0 := [seq](ifelse(numboccur(pairs0,i)=11,i,NULL),i=1..n0);\n            o1 := [seq](ifelse(numboccur(pairs1,i)=11,i,NULL),i=1..n1);\n            if nops(o0) <> 12 then\n                #printf(\"found only %d=%d overlaps between %d and %d skipping\\n\", nops(o0), nops(o1), sn1, sn2);\n                next;\n            end if;\n\n            # determine the pairings\n            pot01matches := table(sparse={o1[]});\n\n            for i from 1 to nops(pairs0) do\n                if pairs0[i][1] in o0 and pairs0[i][2] in o0 then # check o2 too?\n                pot01matches[pairs0[i][1]] := pot01matches[pairs0[i][1]] intersect {pairs1[i][]};\n                pot01matches[pairs0[i][2]] := pot01matches[pairs0[i][2]] intersect {pairs1[i][]};\n                end if;\n            end do;\n\n            if {} in {entries(pot01matches,'nolist')} then\n                printf(\"found a contradiction in the potential pairings\\n\");\n                next;\n            end if;\n\n            matches01 := map(p->lhs(p)=rhs(p)[], [entries(pot01matches,'pairs')]);\n\n            # use symbolic computation to build the equations to solve for the rotation\n            # and translation\n            eqs := {seq(seq((M . Vector(scan1[rhs(matches01[k])]) + A)[j]\n                = Vector(scan0[lhs(matches01[k])])[j], j=1..3),k=1..4)};\n            sol := solve( eqs );\n\n            Mo := eval(M, sol);\n            a0 := eval(<a[0,1], a[0,2], a[0,3]>, sol);\n\n            scan1 := [seq(convert(Mo . Vector(scan1[i]) + a0,list), i=1..nops(scan1))];\n            knownscans := [knownscans[], sn2=convert(a0,list)];\n            sunknown := subsop(i1=NULL, sunknown); # remove this scan from the unknowns\n            truelocs[sn2] := scan1;\n            break;\n\n        end do;\n    end do;\nend do;\n\nASSERT(nops(knownscans) = nops(scanners));\nanswer1 := nops( map(op, {entries}(truelocs,'nolist') ) );\n\n# compute the Manhatten distance between scanners\nmdist := (u,v) -> add(abs(u[i]-v[i]),i=1..3):\nscannerlocs := map(rhs, knownscans);\nanswer2 := max( seq(seq(mdist(scannerlocs[i],scannerlocs[j]),j=i+1..nops(scannerlocs)),i=1..nops(scannerlocs)));\n\n", "meta": {"hexsha": "5d2450c4dca010a2598a6b08f9e032be845c667c", "size": 3964, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "Day19/AoC19-Maple.mpl", "max_stars_repo_name": "johnpmay/AdventOfCode2021", "max_stars_repo_head_hexsha": "b51756bcebea662333072cf518cf040a962ef8b7", "max_stars_repo_licenses": ["CC0-1.0"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2021-12-04T18:24:03.000Z", "max_stars_repo_stars_event_max_datetime": "2021-12-04T18:24:03.000Z", "max_issues_repo_path": "Day19/AoC19-Maple.mpl", "max_issues_repo_name": "johnpmay/AdventOfCode2021", "max_issues_repo_head_hexsha": "b51756bcebea662333072cf518cf040a962ef8b7", "max_issues_repo_licenses": ["CC0-1.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Day19/AoC19-Maple.mpl", "max_forks_repo_name": "johnpmay/AdventOfCode2021", "max_forks_repo_head_hexsha": "b51756bcebea662333072cf518cf040a962ef8b7", "max_forks_repo_licenses": ["CC0-1.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 38.4854368932, "max_line_length": 117, "alphanum_fraction": 0.5262361251, "num_tokens": 1205, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8577681195338727, "lm_q2_score": 0.7025300573952052, "lm_q1q2_score": 0.6026078862479088}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_mgga_x *)\n(* prefix:\n  mgga_x_m08_params *params;\n\n  assert(pt->params != NULL);\n  params = (mgga_x_m08_params * ) (pt->params);\n*)\n\nparams_a_rpbe_kappa := 0.552:\nparams_a_rpbe_mu    := MU_GE:\n$include \"gga_x_rpbe.mpl\"\n\nparams_a_kappa := KAPPA_PBE:\nparams_a_mu    := 0.21951:\n$include \"gga_x_pbe.mpl\"\n\nm08_f := (a, b, x, t) ->\n  + f_pbe(x) *mgga_series_w(a, 12, t)\n  + f_rpbe(x)*mgga_series_w(b, 12, t):\n\nf_m08 := (x, t) ->\n  m08_f(params_a_a, params_a_b, x, t):\n\nf := (rs, x, t, u) ->\n  f_m08(x, t):\n", "meta": {"hexsha": "d0a52cf735f229edb246608ee025941d61f7f5cd", "size": 754, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/mgga_x_m08.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/mgga_x_m08.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/mgga_x_m08.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 22.1764705882, "max_line_length": 68, "alphanum_fraction": 0.6472148541, "num_tokens": 280, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8962513648201267, "lm_q2_score": 0.672331699179286, "lm_q1q2_score": 0.60257820300127}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: work_mgga_c *)\n\npar_n := 6:\n\ngamma_x := 0.004:\npar_x := [\n    [  0.85,  0, 0],\n    [  1.007, 0, 1],\n    [  0.259, 1, 0],\n    [  0,   0, 0],\n    [  0,   0, 0],\n    [  0,   0, 0]\n]:\n\ngamma_ss := 0.2:\npar_ss := [\n    [  0.443,  0, 0],\n    [ -1.437,  0, 4],\n    [ -4.535,  1, 0],\n    [ -3.39,   2, 0],\n    [  4.278,  4, 3],\n    [  0,    0, 0]\n]:\n\ngamma_os := 0.006:\npar_os := [\n    [  1.000,  0, 0],\n    [  1.358,  1, 0],\n    [  2.924,  2, 0],\n    [ -8.812,  2, 1],\n    [ -1.39,   6, 0],\n    [  9.142,  6, 1]\n]:\n\n$include \"lda_x_erf.mpl\"\n$include \"b97mv.mpl\"\n\nf :=  (rs, z, xt, xs0, xs1, ts0, ts1, us0, us1) ->\n  f_b97mv(f_lda_x_erf, rs, z, xt, xs0, xs1, ts0, ts1):\n", "meta": {"hexsha": "8d9ece7bb1aedd3faf1616be77827d59dcca3fbe", "size": 910, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-4.2.3/maple/hyb_mgga_xc_wb97mv.mpl", "max_stars_repo_name": "rdietric/lsms", "max_stars_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-4.2.3/maple/hyb_mgga_xc_wb97mv.mpl", "max_issues_repo_name": "rdietric/lsms", "max_issues_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-4.2.3/maple/hyb_mgga_xc_wb97mv.mpl", "max_forks_repo_name": "rdietric/lsms", "max_forks_repo_head_hexsha": "8d0d5f01186abf9a1cc54db3f97f9934b422cf92", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 18.9583333333, "max_line_length": 68, "alphanum_fraction": 0.4681318681, "num_tokens": 456, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.877476793890012, "lm_q2_score": 0.6859494614282923, "lm_q1q2_score": 0.6019047341846784}}
{"text": "read \"../IdentifiabilityODE.mpl\";\n\nsys := [\ndiff(s(t), t) = -b1*b0*s(t)*x1(t)*i(t) - b0*s(t)*i(t) - s(t)*mu + mu + g*r(t),\ndiff(x2(t), t) = M*x1(t),\ndiff(i(t), t) = -nu*i(t) + b1*b0*s(t)*x1(t)*i(t) + b0*s(t)*i(t) - mu*i(t),\ndiff(r(t), t) = nu*i(t) - mu*r(t) - g*r(t),\ndiff(x1(t), t) = -M*x2(t),\ny1(t) = i(t),\ny2(t) = r(t)\n];\nCodeTools[CPUTime](IdentifiabilityODE(sys, GetParameters(sys)));", "meta": {"hexsha": "15a96ad361b47d3bcc1ca4a9ced36d48fdf2d793", "size": 389, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "benchmarking/SIAN/SIRS-forced.mpl", "max_stars_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_stars_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 42, "max_stars_repo_stars_event_min_datetime": "2021-07-14T14:30:56.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-23T16:49:40.000Z", "max_issues_repo_path": "benchmarking/SIAN/SIRS-forced.mpl", "max_issues_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_issues_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 25, "max_issues_repo_issues_event_min_datetime": "2021-07-15T21:15:31.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-30T19:50:55.000Z", "max_forks_repo_path": "benchmarking/SIAN/SIRS-forced.mpl", "max_forks_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_forks_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 4, "max_forks_repo_forks_event_min_datetime": "2021-08-28T14:40:36.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-02T19:21:47.000Z", "avg_line_length": 32.4166666667, "max_line_length": 78, "alphanum_fraction": 0.5089974293, "num_tokens": 177, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.913676530465412, "lm_q2_score": 0.658417487156366, "lm_q1q2_score": 0.6015806052627835}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* Equation (7) from the paper *)\n\ntpss_p := x -> X2S^2*x^2:\ntpss_z := (x, t) -> x^2/(8*t):\n\ntpss_alpha := (x, t) -> (t - x^2/8)/K_FACTOR_C:\ntpss_qb    := (x, t) -> \\\n      9/20 * (tpss_alpha(x, t) - 1)/sqrt(1 + params_a_b*tpss_alpha(x, t)*(tpss_alpha(x, t) - 1)) \\\n      + 2*tpss_p(x)/3:\n\n(* Equation (10) in all its glory *)\ntpss_fxnum := (x, t) -> \\\n      + (MU_GE + params_a_c*tpss_z(x, t)^tpss_ff(tpss_z(x, t))/(1 + tpss_z(x, t)^2)^2)*tpss_p(x) \\\n      + 146/2025 * tpss_qb(x, t)^2 \\\n      - 73/405 * tpss_qb(x, t) * sqrt(1/2*(9/25*tpss_z(x, t)^2 + tpss_p(x)^2)) \\\n      + MU_GE^2/tpss_kappa(x, t) * tpss_p(x)^2 \\\n      + 2*sqrt(params_a_e)*MU_GE*9/25*tpss_z(x, t)^2 \\\n      + params_a_e*params_a_mu*tpss_p(x)^3:\n\ntpss_fxden := x -> \\\n      (1 + sqrt(params_a_e)*tpss_p(x))^2:\n\ntpss_fx    := (x, t) -> tpss_fxnum(x, t)/tpss_fxden(x):\n", "meta": {"hexsha": "60aed4eab21aa5166f3b9c8f199cbc37c4393346", "size": 1078, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/tpss_x.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/tpss_x.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/tpss_x.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 33.6875, "max_line_length": 98, "alphanum_fraction": 0.5714285714, "num_tokens": 447, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9230391706552536, "lm_q2_score": 0.6513548578981939, "lm_q1q2_score": 0.6012260478366195}}
{"text": "(*\n Copyright (C) 2020 Susi Lehtola\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n(* prefix:\n  mgga_k_rda_params *params;\n\n  assert(p->params != NULL);\n  params = (mgga_k_rda_params * ) (p->params);\n*)\n\nrda_s := x -> X2S*x:\nrda_p := u -> X2S^2*u:\n\n(* Equation (61) *)\nrda_k4 := (s, p, b) -> sqrt(s^4 + b*p^2):\n(* Equation (63) *)\nrda_k2 := (s, p, b) -> s^2 + b*p:\n\n(* Equation (71); first term is von Weiszäcker according to equation (13) *)\nrda_f0 := (s, p) ->\n       5/3*s^2 + params_a_A0\n       + params_a_A1 * (rda_k4(s,p,params_a_a) / (1 + params_a_beta1*rda_k4(s,p,params_a_a)))^2\n       + params_a_A2 * (rda_k4(s,p,params_a_b) / (1 + params_a_beta2*rda_k4(s,p,params_a_b)))^4\n       + params_a_A3 * (rda_k2(s,p,params_a_c) / (1 + params_a_beta3*rda_k2(s,p,params_a_c))):\n\n(* Complete functional *)\nrda_f := (xs, us) -> rda_f0(rda_s(xs), rda_p(us)):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) ->\n  mgga_kinetic(rda_f, rs, z, xs0, xs1, u0, u1):\n", "meta": {"hexsha": "a5c6355e758349e0161894f2dcfad37012750777", "size": 1127, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_k_rda.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_k_rda.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_k_rda.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 30.4594594595, "max_line_length": 95, "alphanum_fraction": 0.6149068323, "num_tokens": 436, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9230391579526935, "lm_q2_score": 0.651354857898194, "lm_q1q2_score": 0.6012260395627453}}
{"text": "with(DifferentialThomas):\nwith(Tools):\nRanking([t], [[x15, x13, x7, x9, x2, x8, x14, x5, x4, x12, x6, x1, x10, x11, x3], [y4, y6, y2, y1, y3, y5] , [u]]):\nsys := [\ndiff(x15(t), t) - (-1/2500*x15(t) + 1/2000000*x7(t)),\ndiff(x13(t), t) - (e2a*x14(t) + 1/2*x10(t)*x6(t) - x2(t)*x13(t) - 1/50000*x13(t)),\ndiff(x7(t), t) - (5*i1*x6(t) - 1/2*x11(t)*x7(t)),\ndiff(x9(t), t) - (-1/2500*x9(t) - 1/2000000*x7(t)),\ndiff(x2(t), t) - (-1/5*x10(t)*x2(t) - x2(t)*x13(t) - x2(t)*k_deg - x2(t)*k2*u(t)*x8(t) - x2(t)*k3 + x1(t)*u(t)*k1 + x4(t)*t1 + x5(t)*t2),\ndiff(x8(t), t) - (1/2*x9(t) - c5*x8(t)),\ndiff(x14(t), t) - (-5*e2a*x14(t) + 1/2*x11(t)*x7(t)),\ndiff(x5(t), t) - (x2(t)*x13(t) - x5(t)*t2),\ndiff(x4(t), t) - (1/5*x10(t)*x2(t) - x4(t)*t1),\ndiff(x12(t), t) - (1/2000000*x7(t) - c3a*x12(t)),\ndiff(x6(t), t) - (-1/2*x10(t)*x6(t) + 1/50000*x13(t) - i1*x6(t) - x5(t)*t2),\ndiff(x1(t), t) - (-x1(t)*k_deg - x1(t)*u(t)*k1 + k_prod),\ndiff(x10(t), t) - (-1/5*x10(t)*x2(t) - x10(t)*i1a - 1/2*x10(t)*x6(t) - 1/10000*x10(t) + 1/2000*x11(t) + x12(t)*c4a),\ndiff(x11(t), t) - (5*x10(t)*i1a - 1/2*x11(t)*x7(t) - 1/400*x11(t)),\ndiff(x3(t), t) - (x2(t)*k2*u(t)*x8(t) + x2(t)*k3 - x3(t)*k_deg),\ny4(t) - (x2(t) + x3(t) + x1(t)),\ny6(t) - (x12(t)),\ny2(t) - (x10(t) + x13(t)),\ny1(t) - (x7(t)),\ny3(t) - (x9(t)),\ny5(t) - (x2(t))\n];\nres := CodeTools[CPUTime](ThomasDecomposition(sys));", "meta": {"hexsha": "ae56d1906e1d5bba77c9646951f781772e075172", "size": 1346, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "benchmarking/DifferentialThomas/NFkB.mpl", "max_stars_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_stars_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 42, "max_stars_repo_stars_event_min_datetime": "2021-07-14T14:30:56.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-23T16:49:40.000Z", "max_issues_repo_path": "benchmarking/DifferentialThomas/NFkB.mpl", "max_issues_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_issues_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 25, "max_issues_repo_issues_event_min_datetime": "2021-07-15T21:15:31.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-30T19:50:55.000Z", "max_forks_repo_path": "benchmarking/DifferentialThomas/NFkB.mpl", "max_forks_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_forks_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 4, "max_forks_repo_forks_event_min_datetime": "2021-08-28T14:40:36.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-02T19:21:47.000Z", "avg_line_length": 49.8518518519, "max_line_length": 137, "alphanum_fraction": 0.4970282318, "num_tokens": 744, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9032942041005328, "lm_q2_score": 0.6654105653819836, "lm_q1q2_score": 0.6010615070568045}}
{"text": "######################################################################\n# W1(A) is Map(A,RR) modulo translation, except that we take\n# W1(emptyset) to be empty.\n#\n# Elements are represented as tables indexed by A, whose values \n# are real numbers.  The equivalence relation\n# is built into the definition of the function `is_equal/W1` rather\n# than the representation of the elements.\n\n`is_element/W1` := (A::set) -> proc(x)\n local a;\n global reason;\n\n if A = {} then\n  reason := [convert(procname,string),\"W1(emptyset) = emptyset\"];\n  return false;\n fi;\n\n if not(is_table_on(A)(x)) then\n  reason := [convert(procname,string),\"x is not a table on A\",x,A];\n  return false;  \n fi;\n\n for a in A do\n  if not `is_element/RR`(x[a]) then\n   reason := [convert(procname,string),\"x[a] is not in R\",a,x[a],N];\n   return false;\n  fi;\n od;\n\n return true;\nend;\n\n`is_equal/W1` := (A::set) -> proc(x,y) \n local a0,u0,a;\n global reason;\n\n if A = {} then \n  reason := [convert(procname,string),\"W1(emptyset) = emptyset\"];\n  return false;\n fi;\n\n a0 := A[1];\n u0 := x[a0] - y[a0];\n\n for a in A do\n  if not(`is_equal/RR`(x[a] - y[a],u0)) then\n   reason := [convert(procname,string),\"x[a] - y[a] <> x[a0] - y[a0]\",a,a0];\n   return false;\n  fi;\n od;\n\n return true;\nend;\n\n`is_leq/W1` := NULL;\n\n`random_element/W1` := (A::set) -> proc()\n local x,a;\n\n x := table();\n for a in A do\n  x[a] := `random_element/RR`();\n od:\n\n return eval(x);\nend;\n\n`list_elements/W1` := NULL;\n`count_elements/W1` := NULL;\n\n", "meta": {"hexsha": "6fcc47495a4499222e4aa7412101ddf687a47619", "size": 1475, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/W1.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/W1.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/W1.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 20.4861111111, "max_line_length": 76, "alphanum_fraction": 0.5918644068, "num_tokens": 452, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8397339676722393, "lm_q2_score": 0.7154240018510026, "lm_q1q2_score": 0.6007658356422939}}
{"text": "`is_element/graphs` := (V::set) -> proc(E)\n if not(`is_element/autorel`(V)(E)) then\n  return false;\n fi;\n\n if not(`is_symmetric/autorel`(V)(E)) then\n  return false;\n fi;\n\n if not(`is_irreflexive/autorel`(V)(E)) then\n  return false;\n fi;\n\n return true;\nend:\n\n`is_leq/graphs` := (V::set) -> (E0,E1) -> evalb(E0 minus E1 = {}):\n\n`list_elements/graphs` := proc(V::set)\n local n,E0,EE,i,j;\n \n n := nops(V);\n E0 := {seq(seq([V[i],V[j]],j=i+1..n),i=1..n-1)};\n EE := `list_elements/subsets`(E0);\n EE := map(E -> E union `op/autorel`(V)(E),EE);\n return EE;\nend:\n\n`count_elements/graphs` := (V::set) -> 2^(nops(V)*(nops(V)-1)/2);\n\n`random_element/graphs` := (V::set) -> proc()\n local n,E0,E,i,j;\n \n n := nops(V);\n E0 := {seq(seq([V[i],V[j]],j=i+1..n),i=1..n-1)};\n E := `random_element/subsets`(E0)();\n E := E union `op/autorel`(V)(E);\n return E;\nend:\n\n`neighbour_table/graphs` := (V) -> proc(E)\n local N,v,e;\n \n N := table();\n for v in V do N[v] := {}; od:\n for e in E do\n  N[e[1]] := {op(N[e[1]]),e[2]};\n od:\n\n return eval(N);\nend:\n\n`component_relation/graphs` := (V) -> (E) ->\n `transitive_closure/autorel`(V)(\n  E union `id/autorel`(V)\n );\n\n`components/graphs` := (V) -> (E) ->\n `block_partition/equiv`(`component_relation/graphs`(V)(E));\n\n`is_connected/graphs` := (V) -> (E) -> \n evalb(`component_relation/graphs`(V)(E) = `top/autorel`(V));\n\n`is_forest/graphs` := (V) -> proc(E)\n local CC,V0,E0;\n \n CC := `components/graphs`(V)(E);\n\n for V0 in CC do\n  E0 := select(e -> member(e[1],V0),V0);\n\n  if nops(E0) <> nops(V0) - 1 then\n   return false;\n  fi;\n od:\n\n return true;\nend:\n\n`is_tree/graphs` := (V) -> proc(E)\n `is_connected/graphs`(V)(E) and\n  nops(E) = nops(V) - 1;\nend:\n\n`skeleton/graphs` := (V::set) -> proc(E)\n local n,V0,E0,ix,i;\n \n n := nops(V);\n V0 := {seq(i,i=1..n)};\n ix := table():\n for i from 1 to n do ix[V[i]] := i; od;\n E0 := map(e -> [ix[e[1]],ix[e[2]]],E);\n return [V0,E0];\nend:\n\n`is_element/paths` := (V) -> (E) -> proc(p)\n local i,n;\n \n if not type(p,list) then\n  return false;\n fi;\n\n n := nops(p) - 1;\n\n if n < 0 then \n  return false;\n fi;\n\n if {op(p)} minus V <> {} then\n  return false;\n fi;\n\n for i from 1 to n do\n  if not(member([p[i],p[i+1]],E)) then\n   return false;\n  fi;\n od;\n\n return true;\nend:\n\n`is_small_element/paths` := (V) -> (E) -> (n::nonnegint) -> proc(p)\n return evalb(`is_element/paths`(V)(E)(p) and (nops(p) = n+1));\nend:\n\n`random_small_element/paths` := (V) -> (E) -> (n::nonnegint) -> proc()\n local v,p,e,i;\n \n if E = {} then\n  if V = {} or n > 0 then\n   return FAIL;\n  else\n   return [random_element_of(V)()];\n  fi;\n fi;\n\n v := random_element_of(E)()[1];\n p := v;\n for i from 1 to n do\n  e := random_element_of(select(e -> member(v,e),E))();\n  v := op({op(e)} minus {v});\n  p := p,v;\n od;\n return [p];\nend:\n\n`list_small_elements/paths` := (V) -> (E) -> proc(n::nonnegint)\n option remember;\n local P,Q,p,v,F,e;\n \n if n = 0 then\n  return map(v -> [v],V);\n else\n  P := `list_small_elements/paths`(V)(E)(n-1);\n  Q := NULL;\n  for p in P do\n   v := p[1];\n   F := select(e -> e[2] = v,E);\n   Q := Q,seq([e[1],op(p)],e in F);\n  od:\n  return [Q];\n fi;\nend:\n\n`is_leq/paths` := NULL;\n`count_elements/paths` := NULL:\n`count_small_elements/paths` := NULL:\n\n`length/paths` := (V) -> (E) -> (p) -> nops(p) - 1;\n\n`is_trail/paths` := proc(p)\n local n,e,i;\n n := nops(p) - 1;\n e := {seq([p[i],p[i+1]],i=1..n)};\n return evalb(nops(e) = n);\nend:\n\n`is_cycle/paths` := proc(p)\n local n,i;\n n := nops(p) - 1;\n return evalb(p[1] = p[n+1] and nops({seq(p[i],i=1..n)}) = n);\nend:\n\n`is_small_element/trails` := (V) -> (E) -> (n) -> proc(p)\n if not `is_small_element/paths`(V)(E)(n)(p) then\n  return false;\n fi;\n\n return `is_trail/paths`(p);\nend:\n\n`is_element/trails` := (V) -> (E) -> proc(p)\n if not `is_element/paths`(V)(E)(p) then\n  return false;\n fi;\n\n return `is_trail/paths`(p);\nend:\n\n`list_small_elements/trails` := (V) -> (E) -> proc(n)\n option remember;\n local E0,E1,P,Q,p,v,F,i,e;\n\n if n = 0 then\n  return map(v -> [v],V);\n else\n  P := `list_small_elements/trails`(V)(E)(n-1);\n  Q := NULL;\n  for p in P do\n   E0 := {seq([p[i],p[i+1]],i=1..n-1),seq([p[i+1],p[i]],i=1..n-1)};\n   E1 := E minus E0;\n   v := p[1];\n   F := select(e -> e[2] = v,E1);\n   Q := Q,seq([e[1],op(p)],e in F);\n  od:\n  return [Q];\n fi;\nend:\n\n`random_small_element/trails` := (V) -> (E) -> (n) -> proc(num_tries := 10)\n local k,p,E0,E1,v,F,e,i;\n \n k := num_tries;\n\n if n = 0 then\n  if V = {} then\n   return FAIL;\n  else \n   return [random_element_of(V)()];\n  fi;\n elif n = 1 then\n  if E = {} then\n   return FAIL;\n  else\n   return random_element_of(E)();\n  fi;\n fi;\n \n while k > 0 do\n  p := `random_small_element/trails`(V)(E)(n-1)();\n  k := k - 1;\n  if p <> FAIL then\n   E0 := {seq([p[i],p[i+1]],i=1..n-1),seq([p[i+1],p[i]],i=1..n-1)};\n   E1 := E minus E0;\n   v := p[1];\n   F := select(e -> e[2] = v,E1);\n   if F <> {} then\n    e := random_element_of(F)();\n    return [e[1],op(p)];\n   fi;\n  fi;\n od;\n\n return FAIL;\nend:\n\n`is_leq/trails` := NULL:\n`count_elements/trails` := NULL:\n`count_small_elements/trails` := NULL:\n\n######################################################################", "meta": {"hexsha": "8eea624ca11599b403bb34e2a79a9b12c396116d", "size": 5075, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "lib/graphs/graphs.mpl", "max_stars_repo_name": "NeilStrickland/maple_lib", "max_stars_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/graphs/graphs.mpl", "max_issues_repo_name": "NeilStrickland/maple_lib", "max_issues_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/graphs/graphs.mpl", "max_forks_repo_name": "NeilStrickland/maple_lib", "max_forks_repo_head_hexsha": "afdc262a183c56959a7c013e38a166824f7fc3d5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 19.4444444444, "max_line_length": 75, "alphanum_fraction": 0.5375369458, "num_tokens": 1940, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8397339596505965, "lm_q2_score": 0.7154239836484144, "lm_q1q2_score": 0.6007658146180866}}
{"text": "with(DifferentialAlgebra):\nring_diff := DifferentialRing(blocks = [[x5, x6, x4, x2, x1, x3], [y1, y2] ], derivations = [t]):\nsys := [\ndiff(x5(t), t) - (k5*x6(t) + k4*x6(t) - k6*x5(t)*x3(t)),\ndiff(x6(t), t) - (-k5*x6(t) - k4*x6(t) + k6*x5(t)*x3(t)),\ndiff(x4(t), t) - (-k3*x4(t) - k2*x4(t) + k1*x1(t)*x2(t)),\ndiff(x2(t), t) - (k3*x4(t) + k2*x4(t) + k1*x1(t)*x2(t)),\ndiff(x1(t), t) - (k4*x6(t) + k2*x4(t) - k1*x1(t)*x2(t)),\ndiff(x3(t), t) - (k5*x6(t) + k3*x4(t) - k6*x5(t)*x3(t)),\ny1(t) - (x3(t)),\ny2(t) - (x2(t))\n];\nres := CodeTools[CPUTime](RosenfeldGroebner(sys, ring_diff, singsol=none));", "meta": {"hexsha": "12d529a9acd9e59e8fdc87da85f03153f59c7f82", "size": 589, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "benchmarking/RosenfeldGroebner/Chemical-reaction-network.mpl", "max_stars_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_stars_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 42, "max_stars_repo_stars_event_min_datetime": "2021-07-14T14:30:56.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-23T16:49:40.000Z", "max_issues_repo_path": "benchmarking/RosenfeldGroebner/Chemical-reaction-network.mpl", "max_issues_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_issues_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 25, "max_issues_repo_issues_event_min_datetime": "2021-07-15T21:15:31.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-30T19:50:55.000Z", "max_forks_repo_path": "benchmarking/RosenfeldGroebner/Chemical-reaction-network.mpl", "max_forks_repo_name": "iliailmer/StructuralIdentifiability.jl", "max_forks_repo_head_hexsha": "29f1104e357f2f2942ff5477871856d80518a6ed", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 4, "max_forks_repo_forks_event_min_datetime": "2021-08-28T14:40:36.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-02T19:21:47.000Z", "avg_line_length": 45.3076923077, "max_line_length": 97, "alphanum_fraction": 0.5297113752, "num_tokens": 292, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9324533088603709, "lm_q2_score": 0.6442251064863697, "lm_q1q2_score": 0.6007098321941402}}
{"text": "(*\n Copyright (C) 2020 Susi Lehtola\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\ngea2_s := x -> X2S*x:\ngea2_q := u -> X2S^2*u:\n\ngea2_f0 := (s, q) -> 1 + 5/27*s^2 + 20/9*q:\ngea2_f := (x, u) ->\n  gea2_f0(gea2_s(x), gea2_q(u)):\n\nf := (rs, z, xt, xs0, xs1, u0, u1, t0, t1) ->\n  mgga_kinetic(gea2_f, rs, z, xs0, xs1, u0, u1):\n", "meta": {"hexsha": "2fa35d4f2c7e4c8e1b2a49de20a8e837fbfea052", "size": 499, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_k_gea2.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_k_gea2.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_k_gea2.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 24.95, "max_line_length": 68, "alphanum_fraction": 0.6092184369, "num_tokens": 217, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.9324533126145178, "lm_q2_score": 0.6442250928250375, "lm_q1q2_score": 0.6007098218741014}}
{"text": "(*\n Copyright (C) 2019 Susi Lehtola\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: mgga_exc *)\n\n$include \"mgga_c_scan.mpl\"\n\n(* Coefficients of the rSCAN switching function from SI, in reversed(!) order: 7, 6, ..., 0 *)\nrscan_fc := [-0.051848879792, 0.516884468372, -1.915710236206, 3.061560252175, -1.535685604549, -0.4352, -0.64, 1]:\n\nnp53 := rs -> n_total(rs)^(5/3):\n(* First regularization: tau^u -> tau^u + tau^r *)\n\nrscan_alpha0 := (rs, z, xt, ts0, ts1) ->\n  (np53(rs)*m_max(t_total(z, ts0, ts1) - xt^2/8, 0))/((K_FACTOR_C*np53(rs) + 2^(2/3)*params_a_taur)*t_total(z, 1, 1)):\n\n(* Second regularization: alpha -> alpha^3/(alpha^2 + alpha_r) *)\nrscan_alpha := (rs, z, xt, ts0, ts1) -> rscan_alpha0(rs, z, xt, ts0, ts1)^3/(rscan_alpha0(rs, z, xt, ts0, ts1)^2 + params_a_alphar):\n\n(* f(alpha) replaced with a polynomial for alpha in [0, 2.5] *)\nrscan_f_alpha_small := (a,ff) -> add(ff[8-i]*a^i, i=0..7):\nrscan_f_alpha_large := a -> -params_a_d*exp(params_a_c2/(1 - a)):\nrscan_f_alpha := (a, ff) -> my_piecewise3( a <= 2.5, rscan_f_alpha_small(m_min(a, 2.5),ff), rscan_f_alpha_large(m_max(a, 2.5)) ):\n\n(* set parameters of f_alpha *)\nparams_a_alphar := 1e-3:\nparams_a_taur := 1e-4:\n\nrscan_f := (rs, z, xt, xs0, xs1, ts0, ts1) ->\n  f_pbe(rs, z, xt, xs0, xs1) + rscan_f_alpha(rscan_alpha(rs, z, xt, ts0, ts1), rscan_fc)*(\n    + scan_e0(rs, z, X2S*2^(1/3)*xt)\n    - f_pbe(rs, z, xt, xs0, xs1)\n  ):\n\nf := (rs, z, xt, xs0, xs1, us0, us1, ts0, ts1) ->\n  rscan_f(rs, z, xt, xs0, xs1, ts0, ts1):\n", "meta": {"hexsha": "c27d510d28ddcf73f9a2080018d8ae0b38c29cda", "size": 1651, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_c_rscan.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_c_rscan.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/mgga_exc/mgga_c_rscan.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 39.3095238095, "max_line_length": 132, "alphanum_fraction": 0.6365838886, "num_tokens": 669, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8887587905460026, "lm_q2_score": 0.6757646075489392, "lm_q1q2_score": 0.6005917352989892}}
{"text": "(*\n Copyright (C) 2017 M.A.L. Marques\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n*)\n\n(* type: gga_exc *)\n\nparams_a_n := 19:\n\nparams_a_a := [\n   13/12, 7/6,  8/6,  9/6, 10/6, 17/12, 9/6, 10/6,\n   11/6, 10/6, 11/6, 12/6, 10/6, 11/6, 12/6,  7/6,\n    8/6,  9/6, 10/6.0\n]:\n\nparams_a_b := [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1]:\nparams_a_c := [0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0]:\nparams_a_d := [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0]:\n\nparams_a_omega := [\n   +0.678831e+00, -0.175821e+01, +0.127676e+01, -0.160789e+01, +0.365610e+00, -0.181327e+00,\n   +0.146973e+00, +0.147141e+00, -0.716917e-01, -0.407167e-01, +0.214625e-01, -0.768156e-03,\n   +0.310377e-01, -0.720326e-01, +0.446562e-01, -0.266802e+00, +0.150822e+01, -0.194515e+01,\n   +0.679078e+00\n]:\n\n$include \"th.mpl\"\n\nf := (rs, z, xt, xs0, xs1) -> f_th(rs, z, xt, xs0, xs1):\n", "meta": {"hexsha": "935915b965932388bff2b3c33b7a1a193ce60f18", "size": 1039, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "libxc-5.1.6/maple/gga_exc/gga_xc_th2.mpl", "max_stars_repo_name": "pwang234/lsms", "max_stars_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2018-04-03T15:35:47.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-01T03:19:23.000Z", "max_issues_repo_path": "libxc-5.1.6/maple/gga_exc/gga_xc_th2.mpl", "max_issues_repo_name": "pwang234/lsms", "max_issues_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2019-07-30T13:59:18.000Z", "max_issues_repo_issues_event_max_datetime": "2022-03-31T17:43:35.000Z", "max_forks_repo_path": "libxc-5.1.6/maple/gga_exc/gga_xc_th2.mpl", "max_forks_repo_name": "pwang234/lsms", "max_forks_repo_head_hexsha": "6044153b6138512093e457bdc0c15c699c831778", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2018-06-30T00:30:48.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-31T09:14:29.000Z", "avg_line_length": 31.4848484848, "max_line_length": 92, "alphanum_fraction": 0.5630413859, "num_tokens": 595, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8976952921073469, "lm_q2_score": 0.668880247169804, "lm_q1q2_score": 0.6004506488679315}}
{"text": "#######################################################################\n# This file is part of the crlibm library, and is distributed under\n# the  LGPL.\n# To use:\n# restart; read \"exp-td.mpl\";\nDigits := 120:\n\ninterface(quiet=true):\n\nread \"common-procedures.mpl\":\nread \"triple-double.mpl\":\nmkdir(\"TEMPEXP\"):\n\nL := 12:\n\nprintf(\"   memory requirement for L = %d and two triple-double tables: %d bytes\\n\",L,48*2^(ceil(L/2)));\n\nrmax := log(2) / (2^(L+1)):\n\nprintf(\"   maximal absolute value for rmax = 2^(%f)\\n\",log[2](rmax)):\n\n\nMsLog2Div2L := evalf(-log(2)/(2^L)):\n\nmsLog2Div2Lh, msLog2Div2Lm, msLog2Div2Ll := hi_mi_lo(MsLog2Div2L):\n\nepsMsLog2Div2L := evalf(abs(((msLog2Div2Lh + msLog2Div2Lm + msLog2Div2Ll) - MsLog2Div2L)/MsLog2Div2L)):\nepsDDMsLog2Div2L := evalf(abs(((msLog2Div2Lh + msLog2Div2Lm) - MsLog2Div2L)/MsLog2Div2L)):\n\nprintf(\"   error made by storing MsLog2Div2L as a double-double: 2^(%f)\\n\",log[2](epsDDMsLog2Div2L)):\nprintf(\"   error made by storing MsLog2Div2L as a triple-double: 2^(%f)\\n\",log[2](epsMsLog2Div2L)):\n\ngap := -floor(-log[2](abs(msLog2Div2Lm/msLog2Div2Lh))):\n\nprintf(\"   |msLog2Div2Lm| <= 2^(%f) * |msLog2Div2Lh|\\n\",gap):\n\n\nlog2InvMult2L := nearest(2^L / (log(2))):\n\nshiftConst := 2^(52) + 2^(51):\n\nindexmask1 := 2^(L/2) - 1:\nindexmask2 := indexmask1 * 2^(L/2):\n\nlargest := 2^(1023) * ((2^(53) - 1) / 2^(52)):\nsmallest := 2^(-1023) * 1 * 2^(-51):\n\noverflowbound := nearest(log(largest)):\n\noverflowboundHex := ieeehexa(overflowbound):\noverflowSimplebound := convert(overflowboundHex[1],decimal,hex):\n\nunderflowbound := nearest(log(2^(-1075))):\n\ndenormbound := nearest(log(2^(-1022) * 1)):\n\n\noverUnderflowboundHex := ieeehexa(min(abs(underflowbound),min(abs(overflowbound),abs(denormbound)))):\noverUnderflowSimplebound := convert(overUnderflowboundHex[1],decimal,hex):\n\ntwoPowerM1000 := 2^(-1000):\ntwoPower1000 := 2^(1000):\n\ntwoM52 := 2^(-52):\nmTwoM53 := - 2^(-53):\n\nfor i from 0 to 2^(L/2) - 1 do\n\ttwoPowerIndex1hi[i], twoPowerIndex1mi[i], twoPowerIndex1lo[i] := hi_mi_lo(evalf(2^(i/(2^L)))):\n\ttwoPowerIndex2hi[i], twoPowerIndex2mi[i], twoPowerIndex2lo[i] := hi_mi_lo(evalf(2^(i/(2^(L/2))))):\nod: \n\n\n\nPolyDegreeQuick:=4:\nprintf(\"   degree of the polynomial used in the quick phase is %d\\n\",PolyDegreeQuick);\n\n\n\npolyQuick:= poly_exact(1 + x + 0.5*x^2 + x^3 * (numapprox[minimax](((exp(x) - (1 + x + 0.5*x^2))/x^3),  \n\t\t\t\tx=-rmax..rmax, [PolyDegreeQuick-3,0], 1 ,  'deltaApprox'))):\n\nepsilonApproxQuick := numapprox[infnorm]( ((polyQuick-1)/(exp(x)-1))-1, x=-rmax..rmax):\nprintf(\"   approximation rel error for the quick phase is 2^(%2f)\\n\", log2(epsilonApproxQuick) ) :\ndeltaApproxQuick := numapprox[infnorm]( polyQuick-exp(x), x=-rmax..rmax):\nprintf(\"   approximation abs error for the quick phase is 2^(%2f)\\n\", log2(deltaApproxQuick) ) :\n\n\t\n\nPolyDegreeAccurate:=7:\n\nprintf(\"   degree of the polynomial used in the accurate phase is %d\\n\",PolyDegreeAccurate):\n\nDDNumberAccu:=5:\n\n\nprintf(\"   number of double doubles used for the coefficients is %d\\n\",DDNumberAccu):\n\n\n\npolyAccurate:= poly_exact2(1 + x + 0.5*x^2 + x^3 * (numapprox[minimax](((exp(x) - (1 + x + 0.5*x^2))/x^3),  \n\t\t\t\tx=-rmax..rmax, [PolyDegreeAccurate-3,0], 1 ,  'deltaApprox')), \n\t\t\t\tDDNumberAccu):\t\n\n\nepsilonApproxAccurate := numapprox[infnorm]( ((polyAccurate-1)/(exp(x)-1))-1, x=-rmax..rmax):\nprintf(\"   approximation rel error for the accurate phase is 2^(%2f)\\n\", log2(epsilonApproxAccurate) ) :\ndeltaApproxAccurate := numapprox[infnorm]( polyAccurate-exp(x), x=-rmax..rmax):\nprintf(\"   approximation abs error for the accurate phase is 2^(%2f)\\n\", log2(deltaApproxAccurate) ) :\n\n\nepsilonApproxRmAccurate := numapprox[infnorm]( (x/(exp(x)-1))-1, x=-rmax*2^(-52)..rmax*2^(-52)):\nepsilonApproxRlAccurate := numapprox[infnorm]( (x/(exp(x)-1))-1, x=-rmax*2^(-105)..rmax*2^(-105)):\n\nprintf(\"   approximation rel error for approximating exp(rm) - 1 by rm is 2^(%2f)\\n\", log2(abs(epsilonApproxRmAccurate))):\nprintf(\"   approximation rel error for approximating exp(rl) - 1 by rl is 2^(%2f)\\n\", log2(abs(epsilonApproxRlAccurate))):\n\nepsilonApproxAccurateSpecial := numapprox[infnorm]( ((polyAccurate-1)/(exp(x)-1))-1, x=-2^(-30)..2^(-30)):\nprintf(\"   approximation rel error for the accurate phase in the special interval (|r| \\\\leq 2^(-30)) is 2^(%2f)\\n\", \nlog2(epsilonApproxAccurateSpecial) ) :\n\nepsilonApproxAccurateSpecial2 := numapprox[infnorm]( ((polyAccurate-1)/(exp(x)-1))-1, x=-2^(-18)..2^(-18)):\nprintf(\"   approximation rel error for the accurate phase in the special interval (|r| \\\\leq 2^(-18)) is 2^(%2f)\\n\", \nlog2(epsilonApproxAccurateSpecial2) ) :\n\n\n\nepsilon_quick := 2^(-64): # The Gappa proof will show this bound\n\n\n\n\n\n#-------------------------------------------------------------------\n# Output\n\nfilename:=\"TEMPEXP/exp-td.h\":\nfd:=fopen(filename, WRITE, TEXT):\n\nfprintf(fd, \"#include \\\"crlibm.h\\\"\\n#include \\\"crlibm_private.h\\\"\\n\"):\n\nfprintf(fd, \"\\n/*File generated by maple/exp-td.mpl*/\\n\"):\n\nfprintf(fd, \"\\#define L %d\\n\",L):\nfprintf(fd, \"\\#define LHALF %d\\n\",L/2):\nfprintf(fd, \"\\#define log2InvMult2L %1.50e\\n\",log2InvMult2L):\nfprintf(fd, \"\\#define msLog2Div2Lh %1.50e\\n\",msLog2Div2Lh):\nfprintf(fd, \"\\#define msLog2Div2Lm %1.50e\\n\",msLog2Div2Lm):\nfprintf(fd, \"\\#define msLog2Div2Ll %1.50e\\n\",msLog2Div2Ll):\nfprintf(fd, \"\\#define shiftConst %1.50e\\n\",shiftConst):\nfprintf(fd, \"\\#define INDEXMASK1 0x%08x\\n\",indexmask1):\nfprintf(fd, \"\\#define INDEXMASK2 0x%08x\\n\",indexmask2):\nfprintf(fd, \"\\#define OVRUDRFLWSMPLBOUND 0x%08x\\n\",overUnderflowSimplebound):\nfprintf(fd, \"\\#define OVRFLWBOUND %1.50e\\n\",overflowbound):\nfprintf(fd, \"\\#define LARGEST %1.50e\\n\",largest):\nfprintf(fd, \"\\#define SMALLEST %1.50e\\n\",smallest):\nfprintf(fd, \"\\#define DENORMBOUND %1.50e\\n\",denormbound):\nfprintf(fd, \"\\#define UNDERFLWBOUND %1.50e\\n\",underflowbound):\nfprintf(fd, \"\\#define twoPowerM1000 %1.50e\\n\",twoPowerM1000):\nfprintf(fd, \"\\#define twoPower1000 %1.50e\\n\",twoPower1000):\nfprintf(fd, \"\\#define ROUNDCST %1.50e\\n\", compute_rn_constant(epsilon_quick)):   \nfprintf(fd, \"\\#define RDROUNDCST %1.50e\\n\", epsilon_quick):   \nfprintf(fd, \"\\#define twoM52 %1.50e\\n\", twoM52):   \nfprintf(fd, \"\\#define mTwoM53 %1.50e\\n\", mTwoM53):   \n\nfprintf(fd,\"\\n\\n\"):\n\nfor i from 3 to PolyDegreeQuick do\n\tfprintf(fd, \"\\#define c%d %1.50e\\n\",i,coeff(polyQuick,x,i)):\nod:\n\n\nfor i from 3 to DDNumberAccu-1 do\n\t(hi,lo) := hi_lo(coeff(polyAccurate,x,i)):\n\tfprintf(fd, \"\\#define accPolyC%dh %1.50e\\n\",i,hi):\n\tfprintf(fd, \"\\#define accPolyC%dl %1.50e\\n\",i,lo):\nod:\n\nfor i from DDNumberAccu to PolyDegreeAccurate do\n\tfprintf(fd, \"\\#define accPolyC%d %1.50e\\n\",i,coeff(polyAccurate,x,i)):\nod:\n\nfprintf(fd,\"\\n\\n\"):\n\n# Print the tables\nfprintf(fd, \"typedef struct tPi_t_tag {double hi; double mi; double lo;} tPi_t;  \\n\"):\nfprintf(fd, \"static const tPi_t twoPowerIndex1[%d] = {\\n\", 2^(L/2)):\nfor i from 0 to 2^(L/2)-1 do\n      fprintf(fd, \"  { \\n\"):      \n      fprintf(fd, \"    %1.50e, /* twoPowerIndex1hi[%d] */ \\n\", twoPowerIndex1hi[i], i):\n      fprintf(fd, \"    %1.50e, /* twoPowerIndex1mi[%d] */ \\n\", twoPowerIndex1mi[i], i):\n      fprintf(fd, \"    %1.50e, /* twoPowerIndex1lo[%d] */ \\n\", twoPowerIndex1lo[i], i):\n      fprintf(fd, \"  } \"):\n      if(i<2^(L/2)-1) then  fprintf(fd, \", \\n\"): fi\nod:\nfprintf(fd, \"}; \\n \\n\"):\nfprintf(fd, \"static const tPi_t twoPowerIndex2[%d] = {\\n\", 2^(L/2)):\nfor i from 0 to 2^(L/2)-1 do\n      fprintf(fd, \"  { \\n\"):      \n      fprintf(fd, \"    %1.50e, /* twoPowerIndex2hi[%d] */ \\n\", twoPowerIndex2hi[i], i):\n      fprintf(fd, \"    %1.50e, /* twoPowerIndex2mi[%d] */ \\n\", twoPowerIndex2mi[i], i):\n      fprintf(fd, \"    %1.50e, /* twoPowerIndex2lo[%d] */ \\n\", twoPowerIndex2lo[i], i):\n      fprintf(fd, \"  } \"):\n      if(i<2^(L/2)-1) then  fprintf(fd, \", \\n\"): fi\nod:\nfprintf(fd, \"}; \\n \\n\"):\n\nfprintf(fd, \"\\n\\n\"):\n\nfclose(fd):\n\nfilename:=\"TEMPEXP/exp-td-accurate.sed\":\nfd:=fopen(filename, WRITE, TEXT):\nfprintf(fd, \" s/_rhmax/%1.50e/g\\n\", rmax):\nfprintf(fd, \" s/_rmmax/%1.50e/g\\n\", rmax*2^(-52)):\nfprintf(fd, \" s/_rlmax/%1.50e/g\\n\", rmax*2^(-105)):\nfprintf(fd, \" s/_epsilonApproxAccurate/%1.50e/g\\n\", epsilonApproxAccurate):\nfprintf(fd, \" s/_epsilonApproxRmAccurate/%1.50e/g\\n\", epsilonApproxRmAccurate):\nfprintf(fd, \" s/_epsilonApproxRlAccurate/%1.50e/g\\n\", epsilonApproxRlAccurate):\nfprintf(fd, \" s/_epsilonApproxSpecial/%1.50e/g\\n\", epsilonApproxAccurateSpecial):\n\nfor i from 3 to DDNumberAccu-1 do\n\t(hi,lo) := hi_lo(coeff(polyAccurate,x,i)):\n\tfprintf(fd, \"s/_accPolyC%dh/%1.50e/g\\n\",i,hi):\n\tfprintf(fd, \"s/_accPolyC%dl/%1.50e/g\\n\",i,lo):\nod:\n\nfor i from DDNumberAccu to PolyDegreeAccurate do\n\tfprintf(fd, \"s/_accPolyC%d/%1.50e/g\\n\",i,coeff(polyAccurate,x,i)):\nod:\n\nfclose(fd):\n\n\n\nprintf(\"----DONE---\\n\") :\n\n\n", "meta": {"hexsha": "84cbba0d1f628bda8765c7e95390584364eb1779", "size": 8615, "ext": "mpl", "lang": "Maple", "max_stars_repo_path": "crlibm/maple/exp-td.mpl", "max_stars_repo_name": "squarePenguin/parvsl", "max_stars_repo_head_hexsha": "0d502abe795540a3dfc99d43726d3fc29a5e6e5d", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "crlibm/maple/exp-td.mpl", "max_issues_repo_name": "squarePenguin/parvsl", "max_issues_repo_head_hexsha": "0d502abe795540a3dfc99d43726d3fc29a5e6e5d", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 1, "max_issues_repo_issues_event_min_datetime": "2019-03-25T17:02:38.000Z", "max_issues_repo_issues_event_max_datetime": "2019-03-25T17:02:38.000Z", "max_forks_repo_path": "crlibm/maple/exp-td.mpl", "max_forks_repo_name": "squarePenguin/parvsl", "max_forks_repo_head_hexsha": "0d502abe795540a3dfc99d43726d3fc29a5e6e5d", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 36.1974789916, "max_line_length": 122, "alphanum_fraction": 0.653047011, "num_tokens": 3129, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.8791467770088162, "lm_q2_score": 0.6825737473266735, "lm_q1q2_score": 0.6000825100330751}}