Home
last modified time | relevance | path

Searched refs:cheapest (Results 1 – 25 of 1116) sorted by relevance

12345678910>>...45

/dports/games/xnethack/xNetHack-xnh6.1/outdated/win/Qt3/
H A Dqt3_clust.cpp69 int cheapest=-1; in add() local
83 cheapest=cursor; in add()
89 if (cheapest>=0) { in add()
90 include(cluster[cheapest],rect); in add()
104 cheapest=-1; in add()
116 cheapest=cursor; in add()
156 include(cluster[cheapest],rect); in add()
/dports/games/xnethack/xNetHack-xnh6.1/win/Qt/
H A Dqt_clust.cpp70 int cheapest = -1; in add() local
84 cheapest = cursor; in add()
90 if (cheapest >= 0) { in add()
91 include(cluster[cheapest], rect); in add()
105 cheapest = -1; in add()
117 cheapest = cursor; in add()
157 include(cluster[cheapest],rect); in add()
/dports/games/nethack36/NetHack-NetHack-3.6.6_Released/win/Qt4/
H A Dqt4clust.cpp68 int cheapest=-1; in add() local
82 cheapest=cursor; in add()
88 if (cheapest>=0) { in add()
89 include(cluster[cheapest],rect); in add()
103 cheapest=-1; in add()
115 cheapest=cursor; in add()
155 include(cluster[cheapest],rect); in add()
/dports/games/nethack36-nox11/NetHack-NetHack-3.6.6_Released/win/Qt4/
H A Dqt4clust.cpp68 int cheapest=-1; in add() local
82 cheapest=cursor; in add()
88 if (cheapest>=0) { in add()
89 include(cluster[cheapest],rect); in add()
103 cheapest=-1; in add()
115 cheapest=cursor; in add()
155 include(cluster[cheapest],rect); in add()
/dports/games/nethack36-nox11/NetHack-NetHack-3.6.6_Released/win/Qt/
H A Dqt_clust.cpp69 int cheapest=-1; in add() local
83 cheapest=cursor; in add()
89 if (cheapest>=0) { in add()
90 include(cluster[cheapest],rect); in add()
104 cheapest=-1; in add()
116 cheapest=cursor; in add()
156 include(cluster[cheapest],rect); in add()
/dports/games/nethack33/nethack-3.3.1/win/Qt/
H A Dqt_clust.cpp69 int cheapest=-1; in add() local
83 cheapest=cursor; in add()
89 if (cheapest>=0) { in add()
90 include(cluster[cheapest],rect); in add()
104 cheapest=-1; in add()
116 cheapest=cursor; in add()
156 include(cluster[cheapest],rect); in add()
/dports/games/nethack33-nox11/nethack-3.3.1/win/Qt/
H A Dqt_clust.cpp69 int cheapest=-1; in add() local
83 cheapest=cursor; in add()
89 if (cheapest>=0) { in add()
90 include(cluster[cheapest],rect); in add()
104 cheapest=-1; in add()
116 cheapest=cursor; in add()
156 include(cluster[cheapest],rect); in add()
/dports/games/nethack36/NetHack-NetHack-3.6.6_Released/win/Qt/
H A Dqt_clust.cpp69 int cheapest=-1; in add() local
83 cheapest=cursor; in add()
89 if (cheapest>=0) { in add()
90 include(cluster[cheapest],rect); in add()
104 cheapest=-1; in add()
116 cheapest=cursor; in add()
156 include(cluster[cheapest],rect); in add()
/dports/games/nethack34/nethack-3.4.3/win/Qt/
H A Dqt_clust.cpp69 int cheapest=-1; in add() local
83 cheapest=cursor; in add()
89 if (cheapest>=0) { in add()
90 include(cluster[cheapest],rect); in add()
104 cheapest=-1; in add()
116 cheapest=cursor; in add()
156 include(cluster[cheapest],rect); in add()
/dports/games/nethack34-nox11/nethack-3.4.3/win/Qt/
H A Dqt_clust.cpp69 int cheapest=-1; in add() local
83 cheapest=cursor; in add()
89 if (cheapest>=0) { in add()
90 include(cluster[cheapest],rect); in add()
104 cheapest=-1; in add()
116 cheapest=cursor; in add()
156 include(cluster[cheapest],rect); in add()
/dports/games/unnethack/unnethack-5.1.0-20131208/win/unsupported/Qt/
H A Dqt_clust.cpp69 int cheapest=-1; in add() local
83 cheapest=cursor; in add()
89 if (cheapest>=0) { in add()
90 include(cluster[cheapest],rect); in add()
104 cheapest=-1; in add()
116 cheapest=cursor; in add()
156 include(cluster[cheapest],rect); in add()
/dports/games/falconseye/falconseye-1.9.3_11/win/Qt/
H A Dqt_clust.cpp69 int cheapest=-1; in add() local
83 cheapest=cursor; in add()
89 if (cheapest>=0) { in add()
90 include(cluster[cheapest],rect); in add()
104 cheapest=-1; in add()
116 cheapest=cursor; in add()
156 include(cluster[cheapest],rect); in add()
/dports/games/vultures-eye/vulture-2.3.67/slashem/win/Qt/
H A Dqt_clust.cpp69 int cheapest=-1; in add() local
83 cheapest=cursor; in add()
89 if (cheapest>=0) { in add()
90 include(cluster[cheapest],rect); in add()
104 cheapest=-1; in add()
116 cheapest=cursor; in add()
156 include(cluster[cheapest],rect); in add()
/dports/games/vultures-eye/vulture-2.3.67/nethack/win/Qt/
H A Dqt_clust.cpp69 int cheapest=-1; in add() local
83 cheapest=cursor; in add()
89 if (cheapest>=0) { in add()
90 include(cluster[cheapest],rect); in add()
104 cheapest=-1; in add()
116 cheapest=cursor; in add()
156 include(cluster[cheapest],rect); in add()
/dports/games/vultures-eye/vulture-2.3.67/unnethack/win/Qt/
H A Dqt_clust.cpp69 int cheapest=-1; in add() local
83 cheapest=cursor; in add()
89 if (cheapest>=0) { in add()
90 include(cluster[cheapest],rect); in add()
104 cheapest=-1; in add()
116 cheapest=cursor; in add()
156 include(cluster[cheapest],rect); in add()
/dports/math/miracl/miracl-5.6/
H A Dfindbase.cpp179 long cheapest,wcost; in main() local
199 cheapest=1000000L; in main()
211 if (wcost<cheapest) in main()
213 cheapest=wcost; in main()
245 if (wcost<cheapest) in main()
247 cheapest=wcost; in main()
269 if (cheapest==1000000L) return 0; in main()
/dports/math/py-or-tools/or-tools-9.2/ortools/constraint_solver/
H A Drouting_enums.proto36 // the cheapest route segment, then extend the route by iterating on the
73 // Iteratively build a solution by inserting the cheapest node at its
74 // cheapest position; the cost of insertion is based on the global cost
78 // Iteratively build a solution by inserting the cheapest node at its
79 // cheapest position; the cost of insertion is based on the arc cost
83 // each route inserting the cheapest node at its cheapest position until the
87 // Iteratively build a solution by inserting each node at its cheapest
96 // Iteratively connect two nodes which produce the cheapest route segment.
99 // node which produces the cheapest route segment.
/dports/games/xnethack/xNetHack-xnh6.1/outdated/win/gem/
H A Dgr_rect.c50 int cheapest = -1; in add_dirty_rect() local
73 cheapest = cursor; in add_dirty_rect()
79 if (cheapest >= 0) { in add_dirty_rect()
80 gc_combine(&dr->rects[cheapest], area); in add_dirty_rect()
91 cheapest = -1; in add_dirty_rect()
103 cheapest = cursor; in add_dirty_rect()
137 gc_combine(&dr->rects[cheapest], area); in add_dirty_rect()
/dports/games/nethack36/NetHack-NetHack-3.6.6_Released/win/gem/
H A Dgr_rect.c50 int cheapest = -1; in add_dirty_rect() local
73 cheapest = cursor; in add_dirty_rect()
79 if (cheapest >= 0) { in add_dirty_rect()
80 gc_combine(&dr->rects[cheapest], area); in add_dirty_rect()
91 cheapest = -1; in add_dirty_rect()
103 cheapest = cursor; in add_dirty_rect()
137 gc_combine(&dr->rects[cheapest], area); in add_dirty_rect()
/dports/games/nethack36-nox11/NetHack-NetHack-3.6.6_Released/win/gem/
H A Dgr_rect.c50 int cheapest = -1; in add_dirty_rect() local
73 cheapest = cursor; in add_dirty_rect()
79 if (cheapest >= 0) { in add_dirty_rect()
80 gc_combine(&dr->rects[cheapest], area); in add_dirty_rect()
91 cheapest = -1; in add_dirty_rect()
103 cheapest = cursor; in add_dirty_rect()
137 gc_combine(&dr->rects[cheapest], area); in add_dirty_rect()
/dports/games/nethack34-nox11/nethack-3.4.3/win/gem/
H A Dgr_rect.c43 int cheapest=-1; in add_dirty_rect() local
66 cheapest=cursor; in add_dirty_rect()
72 if (cheapest>=0) { in add_dirty_rect()
73 gc_combine(&dr->rects[cheapest],area); in add_dirty_rect()
84 cheapest=-1; in add_dirty_rect()
96 cheapest=cursor; in add_dirty_rect()
129 gc_combine(&dr->rects[cheapest],area); in add_dirty_rect()
/dports/games/nethack34/nethack-3.4.3/win/gem/
H A Dgr_rect.c43 int cheapest=-1; in add_dirty_rect() local
66 cheapest=cursor; in add_dirty_rect()
72 if (cheapest>=0) { in add_dirty_rect()
73 gc_combine(&dr->rects[cheapest],area); in add_dirty_rect()
84 cheapest=-1; in add_dirty_rect()
96 cheapest=cursor; in add_dirty_rect()
129 gc_combine(&dr->rects[cheapest],area); in add_dirty_rect()
/dports/games/vultures-eye/vulture-2.3.67/nethack/win/gem/
H A Dgr_rect.c43 int cheapest=-1; in add_dirty_rect() local
66 cheapest=cursor; in add_dirty_rect()
72 if (cheapest>=0) { in add_dirty_rect()
73 gc_combine(&dr->rects[cheapest],area); in add_dirty_rect()
84 cheapest=-1; in add_dirty_rect()
96 cheapest=cursor; in add_dirty_rect()
129 gc_combine(&dr->rects[cheapest],area); in add_dirty_rect()
/dports/games/vultures-eye/vulture-2.3.67/unnethack/win/gem/
H A Dgr_rect.c43 int cheapest=-1; in add_dirty_rect() local
66 cheapest=cursor; in add_dirty_rect()
72 if (cheapest>=0) { in add_dirty_rect()
73 gc_combine(&dr->rects[cheapest],area); in add_dirty_rect()
84 cheapest=-1; in add_dirty_rect()
96 cheapest=cursor; in add_dirty_rect()
129 gc_combine(&dr->rects[cheapest],area); in add_dirty_rect()
/dports/games/vultures-eye/vulture-2.3.67/slashem/win/gem/
H A Dgr_rect.c43 int cheapest=-1; in add_dirty_rect() local
66 cheapest=cursor; in add_dirty_rect()
72 if (cheapest>=0) { in add_dirty_rect()
73 gc_combine(&dr->rects[cheapest],area); in add_dirty_rect()
84 cheapest=-1; in add_dirty_rect()
96 cheapest=cursor; in add_dirty_rect()
129 gc_combine(&dr->rects[cheapest],area); in add_dirty_rect()

12345678910>>...45