?? discernibilitymatrix.h
字號:
//-------------------------------------------------------------------
// Author........: Aleksander 豩rn
// Date..........:
// Description...:
// Revisions.....:
//===================================================================
#ifndef __DISCERNIBILITYMATRIX_H__
#define __DISCERNIBILITYMATRIX_H__
#include <copyright.h>
#include <kernel/structures/structure.h>
#include <kernel/structures/generalizeddecision.h>
#include <kernel/basic/bits.h>
//-------------------------------------------------------------------
// Class prototypes.
//===================================================================
class DecisionTable;
class Discerner;
class ifstream;
class ofstream;
//-------------------------------------------------------------------
// Class.........: DiscernibilityMatrix
// Author........: Aleksander 豩rn
// Date..........:
// Description...: Represents a discernibility matrix, optimized
// somewhat wrt space.
//
// Each matrix entry is a bitset. Slightly less than
// half the matrix is actually stored, since the matrix
// is symmetric with empty diagonal entries.
//
// NOTE: The assumption above implies that the
// Discerner object must define a reflexive and
// symmetric relation. It is the caller's
// responsibility to check this!
//
// Moreover, only one bitset per equivalence class
// is stored, with the mapping from object index to
// equivalence class index taking O(1) time.
//
// Empty sets are returned as NULL.
//
// Comments......: The friend declaration is an ugly hack. Resolve
// later,
//
// Revisions.....: A
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -