| /dports/security/hs-cryptol/cryptol-2.11.0/src/Cryptol/TypeCheck/ |
| H A D | Solve.hs | 83 go su unsolved [] =
84 case matchMaybe (findImprovement noIncompatible unsolved) of
85 Nothing -> Right (su,unsolved)
92 go su unsolved (g : gs)
95 go su unsolved (g : gs) =
98 Unsolved -> go su (g : unsolved) gs
101 in go su unsolved (map cvt subs ++ gs)
242 go True unsolved [] = go False [] unsolved
243 go False unsolved [] = mapM_ addHasGoal unsolved
245 go changes unsolved (g : todo) =
[all …]
|
| /dports/astro/astrometry/astrometry.net-0.85/solver/ |
| H A D | printsolved.c | 39 anbool unsolved = FALSE; in main() local
69 unsolved = TRUE; in main()
103 if (unsolved) in main()
111 …: %i/%i (%f %%) %ssolved\n", inputfiles[i], nc, nt, (100.0 * nc / (double)nt), unsolved ? "un":""); in main()
135 …%i (%f %%) %ssolved\n", ncounted, ntotal, (100.0 * ncounted / (double)ntotal), unsolved ? "un":""); in main()
|
| H A D | agreeable.c | 54 il* unsolved; variable
175 unsolved = il_new(256); in main()
326 …fprintf(stderr, "This file: %i fields solved, %i unsolved.\n", il_size(solved), il_size(unsolved)); in main()
327 …tal: %i solved, %i unsolved.\n", totalsolved + il_size(solved), totalunsolved + il_size(unsolved)); in main()
330 totalunsolved += il_size(unsolved); in main()
333 il_remove_all(unsolved); in main()
354 il_free(unsolved); in main()
376 il_append(unsolved, fieldnum); in write_field()
|
| /dports/lang/purescript/purescript-0.14.5/src/Language/PureScript/TypeChecker/ |
| H A D | TypeSearch.hs | 53 checkSubsume unsolved env st userT envT = checkInEnvironment env st $ do function
76 }) constraint' context []) unsolved
79 Entailment.replaceTypeClassDictionaries (isJust unsolved) expP
88 accessorSearch unsolved env st userT = maybe ([], []) fst $ checkInEnvironment env st $ do function
105 checkAccessor tcs x (_, type') = isJust (checkSubsume unsolved env tcs x type')
118 typeSearch unsolved env st type' =
121 runTypeSearch = Map.mapMaybe (\ty -> checkSubsume unsolved env st type' ty $> ty)
125 (allLabels, matchingLabels) = accessorSearch unsolved env st type'
|
| /dports/games/crafty/crafty-25.2_1/ |
| H A D | test.c | 36 void Test(char *filename, FILE * unsolved, int screen, int margin) { in Test() argument
62 TestEPD(filename, unsolved, screen, margin); in Test()
160 if (unsolved) in Test()
162 fputs(failed[i], unsolved); in Test()
226 void TestEPD(char *filename, FILE * unsolved, int screen, int margin) { in TestEPD() argument
383 if (unsolved) in TestEPD()
384 fputs(failed, unsolved); in TestEPD()
|
| /dports/math/reduce/Reduce-svn5758-src/packages/solve/ |
| H A D | ppsoln.red | 46 % return if z eq 'unsolved then list list(list w,nil,mu) else z
47 return if z eq 'unsolved then mkrootsof(w,var,mu) else z
52 % 'unsolved if solutions can't be found.
54 a: if null x1 then return 'unsolved
56 and not((z := pr!-pow!-soln1(ex,car x1,var,mu)) eq 'unsolved)
67 if ldeg z neq 1 then return 'unsolved;
90 then return 'unsolved
110 then <<z := nil; x := 'unsolved>>
120 return if null x then 'unsolved else x
|
| /dports/math/py-cryptominisat/cryptominisat-5.8.0/scripts/output_parser/ |
| H A D | solvetimes_from_output_cadical.sh | 24 grep -v -f solved_filtering.csv allFiles.csv | sed "s/.gz.*/.gz/" > unsolved.csv
27 cat unsolved.csv | awk '{print "5000.00 " $1}' >> solveTimes.csv
52 cat unsolved.csv | awk '{print $1 " UNKN"}' >> solved_sol.csv
|
| H A D | solvetimes_from_output.sh | 28 grep -v -f solved_filtering.csv allFiles.csv | sed "s/.gz.*/.gz/" > unsolved.csv
31 cat unsolved.csv | awk '{print "5000.00 " $1}' >> solveTimes.csv
56 cat unsolved.csv | awk '{print $1 " UNKN"}' >> solved_sol.csv
|
| H A D | solvetimes_from_output_glucose.sh | 27 grep -v -f solved_filtering.csv allFiles.csv | sed "s/.gz.*/.gz/" > unsolved.csv
30 cat unsolved.csv | awk '{print "5000.00 " $1}' >> solveTimes.csv
55 cat unsolved.csv | awk '{print $1 " UNKN"}' >> solved_sol.csv
|
| /dports/math/cryptominisat/cryptominisat-5.8.0/scripts/output_parser/ |
| H A D | solvetimes_from_output_cadical.sh | 24 grep -v -f solved_filtering.csv allFiles.csv | sed "s/.gz.*/.gz/" > unsolved.csv
27 cat unsolved.csv | awk '{print "5000.00 " $1}' >> solveTimes.csv
52 cat unsolved.csv | awk '{print $1 " UNKN"}' >> solved_sol.csv
|
| H A D | solvetimes_from_output.sh | 28 grep -v -f solved_filtering.csv allFiles.csv | sed "s/.gz.*/.gz/" > unsolved.csv
31 cat unsolved.csv | awk '{print "5000.00 " $1}' >> solveTimes.csv
56 cat unsolved.csv | awk '{print $1 " UNKN"}' >> solved_sol.csv
|
| H A D | solvetimes_from_output_glucose.sh | 27 grep -v -f solved_filtering.csv allFiles.csv | sed "s/.gz.*/.gz/" > unsolved.csv
30 cat unsolved.csv | awk '{print "5000.00 " $1}' >> solveTimes.csv
55 cat unsolved.csv | awk '{print $1 " UNKN"}' >> solved_sol.csv
|
| /dports/lang/purescript/purescript-0.14.5/src/Language/PureScript/TypeChecker/Entailment/ |
| H A D | Coercible.hs | 130 given : unsolved -> do
136 put $ GivenSolverState { unsolvedGivens = (a', b') : unsolved, .. }
138 put $ GivenSolverState { unsolvedGivens = unsolved, .. }
143 , unsolvedGivens = kickedOut <> unsolved
146 put $ GivenSolverState { unsolvedGivens = toList deriveds <> unsolved, .. }
219 wanted : unsolved -> do
225 put $ WantedSolverState { unsolvedWanteds = (a', b') : unsolved, .. }
227 put $ WantedSolverState { unsolvedWanteds = unsolved, .. }
231 , unsolvedWanteds = unsolved
235 put $ WantedSolverState { unsolvedWanteds = toList deriveds <> unsolved, .. }
|
| /dports/science/mpb/mpb-1.11.1/mpb/ |
| H A D | material_grid_opt.c | 151 int iter, unsolved; member
185 if (!vector3_equal(cur_kvector, d->ks.items[ik]) || d->unsolved) { in band_constraint()
189 d->unsolved = 0; in band_constraint()
227 d->unsolved = 1; in maxgap_func()
273 d.unsolved = 1; in material_grids_maxmin_gap()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/scripts/ |
| H A D | report.py | 168 unsolved.append(instance)
329 unsolved=[] variable
395 print "### Number of unsolved = ", len(unsolved)
404 for iter in unsolved:
|
| /dports/games/supertuxkart/SuperTuxKart-1.2-src/data/tracks/overworld/ |
| H A D | scripting.as | 12 // allow ONE unsolved challenge : the last one
31 // allow ONE unsolved challenge : the last one
|
| /dports/lang/elm/compiler-0.19.1/builder/src/Deps/ |
| H A D | Solver.hs | 235 addConstraint solved unsolved (name, newConstraint) =
239 then return unsolved
243 case Map.lookup name unsolved of
245 return $ Map.insert name newConstraint unsolved
254 then return unsolved
255 else return (Map.insert name mergedConstraint unsolved)
|
| /dports/math/lrslib/lrslib-071a/ine/mit/ |
| H A D | mit288-281.ine | 1 *Gerardo Garbulsky's problem: probably unsolved gdg@lanai.mit.edu
|
| /dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/doc/ |
| H A D | options.tex | 259 Number $n$ of consecutive unsolved problems before aborting
264 are unsolved (i.e., for
286 Set the behavior when an NLP or a series of NLP are unsolved by {\tt Ipopt}
287 (an NLP is unsolved if {\tt Ipopt} is not able to guarantee optimality within the specified toleran…
290 node when an NLP is unsolved. The algorithm then becomes a
302 Number $k$ of times that the algorithm tries to resolve an unsolved NLP with a
303 random starting point (unsolved NLP as defined above).
304 When an NLP is unsolved, if $k > 0$, the algorithm tries
|
| /dports/devel/glademm/glademm-2.6.0/ |
| H A D | BUGS | 3 meaning: '-' unsolved '+' solved
|
| /dports/math/hs-Agda/Agda-2.6.2/doc/release-notes/ |
| H A D | 2.5.4.2.md | 21 …- [#3177](https://github.com/agda/agda/issues/3177): Slow typechecking with unsolved instance cons…
|
| /dports/math/reduce/Reduce-svn5758-src/packages/cdiff/ |
| H A D | integrator.red | 677 begin scalar total,old_total,to_do,unsolved,old_unsolved,stuck;
686 then unsolved:=eq_nr . unsolved>> ;
688 if total=old_total and unsolved and unsolved=old_unsolved then stuck:=t
689 else <<old_unsolved:=unsolved;
690 to_do:=reverse unsolved;
691 unsolved:=nil;
695 if stuck then return 'list . reverse unsolved
|
| /dports/lang/p5-Try-Catch/Try-Catch-1.1.0/ |
| H A D | Changes | 6 - documenting an unsolved bug behavior with finally blocks
|
| /dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/test/ |
| H A D | bonmin.opt | 15 … #Set the behavior when an NLP or a series of NLP are unsolved by Ipopt (we call unsolved an …
69 … 10 #(temporarily removed) Number $n$ of consecutive unsolved problems before a…
72 …imes that the algorithm will try to resolve an unsolved NLP with a random starting point (we call …
|
| /dports/graphics/povray38/povunix-v3.8.0-beta.2-src/ini/ |
| H A D | pngflc.ini | 22 ;; There is an unsolved problem when running dta directly.
|