| /dports/games/supertuxkart/SuperTuxKart-1.2-src/src/challenges/ |
| H A D | challenge_status.hpp | 57 int m_solved; member in ChallengeStatus
71 m_solved = 0; in ChallengeStatus()
84 return ((m_solved >> (int) d)&0x01) == 1; in isSolved()
89 bool isSolvedAtAnyDifficulty() const { return m_solved != 0; } in isSolvedAtAnyDifficulty()
94 return (m_solved & 0x08) ? RaceManager::DIFFICULTY_BEST : in highestSolved()
95 (m_solved & 0x04) ? RaceManager::DIFFICULTY_HARD : in highestSolved()
96 (m_solved & 0x02) ? RaceManager::DIFFICULTY_MEDIUM : in highestSolved()
97 (m_solved & 0x01) ? RaceManager::DIFFICULTY_EASY : in highestSolved()
|
| H A D | challenge_status.cpp | 48 m_solved = 0; in load()
55 m_solved = 0x01; in load()
57 m_solved = 0x03; in load()
59 m_solved = 0x07; in load()
61 m_solved = 0x0F; in load()
75 m_solved |= (0x0F >> (3 - (int) d)); // Sets the last d+1 bits to 1 in setSolved()
76 m_active &= ~m_solved; // Sets to 0 all bits which are at 1 in m_solved in setSolved()
|
| /dports/games/supertux2/SuperTux-v0.6.3-Source/src/supertux/ |
| H A D | levelset_screen.cpp | 37 m_solved(false), in LevelsetScreen()
49 m_solved = level_state.solved; in LevelsetScreen()
65 m_solved = m_solved || win; in finished_level()
75 m_savegame.set_levelset_state(m_basedir, m_level_filename, m_solved); in setup()
|
| H A D | levelset_screen.hpp | 37 bool m_solved; member in LevelsetScreen
|
| /dports/audio/amarok/amarok-3e11ccdd1417e70486eaaa84d8475182eec44c20/src/core-impl/collections/playdarcollection/support/ |
| H A D | Query.cpp | 47 , m_solved( false ) in Query()
105 return m_solved; in isSolved()
196 if( !m_solved && aTrack->score() >= 1.00 ) in receiveResults()
198 m_solved = true; in receiveResults()
215 if( m_receivedFirstResults || m_solved ) in receiveResults()
|
| H A D | Query.h | 113 bool m_solved; variable
|
| /dports/games/supertux2/SuperTux-v0.6.3-Source/src/worldmap/ |
| H A D | level_tile.cpp | 40 m_solved(false), in LevelTile()
96 if (!m_solved) { in update_sprite_action()
106 m_solved = v; in set_solved()
|
| H A D | level_tile.hpp | 42 bool is_solved() const { return m_solved; } in is_solved()
78 bool m_solved; member in worldmap::LevelTile
|
| /dports/math/z3/z3-z3-4.8.13/src/qe/mbp/ |
| H A D | mbp_term_graph.h | 36 obj_hashtable<func_decl> m_decls, m_solved; variable
43 void reset_solved() {m_solved.reset();} in reset_solved()
44 void reset() {m_decls.reset(); m_solved.reset(); m_exclude = true;} in reset()
|
| H A D | mbp_term_graph.cpp | 221 …TRACE("qe_verbose", tout << a->get_family_id() << " " << m_solved.contains(a->get_decl()) << " " <… in operator ()()
224 !m_solved.contains(a->get_decl()) && in operator ()()
239 m_solved.insert(::to_app(e)->get_decl()); in mark_solved()
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/qe/mbp/ |
| H A D | mbp_term_graph.h | 36 obj_hashtable<func_decl> m_decls, m_solved; variable
43 void reset_solved() {m_solved.reset();} in reset_solved()
44 void reset() {m_decls.reset(); m_solved.reset(); m_exclude = true;} in reset()
|
| H A D | mbp_term_graph.cpp | 221 …TRACE("qe_verbose", tout << a->get_family_id() << " " << m_solved.contains(a->get_decl()) << " " <… in operator ()()
224 !m_solved.contains(a->get_decl()) && in operator ()()
239 m_solved.insert(::to_app(e)->get_decl()); in mark_solved()
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/math/grobner/ |
| H A D | pdd_solver.cpp | 332 for (equation* eq : m_solved) m_all_eqs.push_back(eq); in equations()
339 for (equation* e : m_solved) dealloc(e); in reset()
342 m_solved.reset(); in reset()
382 case solved: return m_solved; in get_queue()
433 st.update("dd.solver.solved", m_solved.size()); in collect_statistics()
446 out << "solved\n"; for (auto e : m_solved) display(out, *e); in display()
474 for (auto* e : m_solved) { in invariant()
|
| H A D | pdd_solver.h | 118 …equation_vector m_solved; // equations with solved variables, triangu… variable
|
| /dports/math/z3/z3-z3-4.8.13/src/math/grobner/ |
| H A D | pdd_solver.cpp | 332 for (equation* eq : m_solved) m_all_eqs.push_back(eq); in equations()
339 for (equation* e : m_solved) dealloc(e); in reset()
342 m_solved.reset(); in reset()
382 case solved: return m_solved; in get_queue()
433 st.update("dd.solver.solved", m_solved.size()); in collect_statistics()
446 out << "solved\n"; for (auto e : m_solved) display(out, *e); in display()
474 for (auto* e : m_solved) { in invariant()
|
| H A D | pdd_solver.h | 118 …equation_vector m_solved; // equations with solved variables, triangu… variable
|
| /dports/games/picmi/picmi-21.12.3/src/logic/ |
| H A D | levelloader.h | 50 bool solved() const { return m_solved; } in solved()
67 bool m_solved; variable
|
| H A D | levelloader.cpp | 59 Level::Level() : m_solved(false), m_solved_time(0) { } in Level()
102 m_solved = true; in readSettings()
126 m_solved = true; in setSolved()
|