コミット: 37b201138608993cb5401cae307e05a531a0a8d1 - nono_solver (hg)

Nonogram solver

コミットメタ情報

• リビジョン: 37b201138608993cb5401cae307e05a531a0a8d1 (tree)
• 日時: 2021-02-12 20:58:46
• 作者: Alexander Larin <scalar438@gmai...>
• コミッター: Alexander Larin

ログメッセージ

Cell implemented

変更サマリ

• modified: cell.cpp
• modified: cell.hpp

差分

diff -r 00e6fc6e0c18 -r 37b201138608 cell.cpp
--- a/cell.cpp	Thu Feb 11 14:25:03 2021 +0300
+++ b/cell.cpp	Fri Feb 12 14:58:46 2021 +0300
@@ -0,0 +1,61 @@
+#include "cell.hpp"
+
+namespace
+{
+
+// Calculate number of enabled bit.
+constexpr int get_bit_number(uint32_t val)
+{
+	static const int MultiplyDeBruijnBitPosition[32] = {0,  1,  28, 2,  29, 14, 24, 3,  30, 22, 20,
+	                                                    15, 25, 17, 4,  8,  31, 27, 13, 23, 21, 19,
+	                                                    16, 7,  26, 12, 18, 6,  11, 5,  10, 9};
+	return MultiplyDeBruijnBitPosition[(val * 0x077CB531U) >> 27u];
+}
+
+constexpr bool test_get_bit_number()
+{
+	for (uint32_t i = 0; i < 32; ++i)
+	{
+		if (get_bit_number(1u << i) != i) return false;
+	}
+	return true;
+}
+
+} // namespace
+
+Cell::Cell(int max_colors) : m_max_colors(max_colors)
+{
+	// TODO: replace it to actual exception
+	if (max_colors > MAX_COLORS) throw 42;
+	m_data = 1u >> (max_colors + 1) - 1u;
+}
+
+std::optional<int> Cell::get_color() const
+{
+	if (m_data == 0 || (m_data & (m_data - 1)) != 0) return std::nullopt;
+	static_assert(test_get_bit_number());
+	return get_bit_number(m_data);
+}
+
+bool Cell::is_color_possible(int color_number) const
+{
+	return m_data & (1u << color_number) != 0;
+}
+
+bool Cell::is_impossible() const
+{
+	return m_data == 0;
+}
+
+void Cell::set_color_possible(int color_number, bool possible)
+{
+	if (possible)
+		m_data |= (1u << color_number);
+	else
+		m_data &= ~(1u << color_number);
+}
+
+int Cell::max_colors() const
+{
+	return m_max_colors;
+}

diff -r 00e6fc6e0c18 -r 37b201138608 cell.hpp
--- a/cell.hpp	Thu Feb 11 14:25:03 2021 +0300
+++ b/cell.hpp	Fri Feb 12 14:58:46 2021 +0300
@@ -17,9 +17,13 @@
 
 	void set_color_possible(int color_number, bool possible);
 
+	int max_colors() const;
+
 private:
 	// Bitmask with possible colors. 0 - "impossible" cell, it mustn't appear in normal puzzless
 	// Least bit is background (i.e. if m_data == 0 then cell is background) all other bits are
 	// colors
 	uint32_t m_data;
+
+	int m_max_colors;
 };