Home
last modified time | relevance | path

Searched refs:m_nextCode (Results 1 – 5 of 5) sorted by relevance

/dports/science/massxpert/massxpert-c229f4a1abde3c20b83a90e50f9c5d79104dfa5f/lib/
H A DfragRule.cpp70 m_prevCode(prevCode), m_currCode(currCode), m_nextCode(nextCode), in FragRule()
83 m_nextCode(other.m_nextCode), in FragRule()
124 other->m_nextCode = m_nextCode; in clone()
143 m_nextCode = other.m_nextCode; in mold()
210 m_nextCode = str; in setNextCode()
220 return m_nextCode; in nextCode()
316 if (!m_nextCode.isEmpty()) in validate()
317 if (Monomer::isCodeInList(m_nextCode, monomerRefList) == -1) in validate()
427 m_nextCode = child.text(); in renderXmlFgrElement()
533 if (!m_nextCode.isEmpty()) in formatXmlFgrElement()
[all …]
H A DfragRule.hpp91 QString m_nextCode; member in massXpert::FragRule
/dports/graphics/freeimage/FreeImage/Source/FreeImage/
H A DPluginGIF.cpp93 int m_minCodeSize, m_clearCode, m_endCode, m_nextCode; member in StringTable
309 m_strmap[nextprefix] = m_nextCode; in Compress()
312 if( m_nextCode == (1 << m_codeSize) ) { in Compress()
315 m_nextCode++; in Compress()
318 if( m_nextCode == MAX_LZW_CODE ) { in Compress()
396 …m_strings[m_nextCode] = m_strings[m_oldCode] + m_strings[code == m_nextCode ? m_oldCode : code][0]; in Decompress()
415 if( ++m_nextCode < MAX_LZW_CODE ) { in Decompress()
416 if( (m_nextCode & m_codeMask) == 0 ) { in Decompress()
418 m_codeMask |= m_nextCode; in Decompress()
443 m_nextCode = m_endCode + 1; in ClearCompressorTable()
[all …]
/dports/cad/verilator/verilator-4.216/include/
H A Dverilated_trace_imp.cpp287 , m_nextCode{0}
320 m_nextCode = 1; in traceInit()
367 m_nextCode = std::max(m_nextCode, code + codesNeeded); in declCode()
H A Dverilated_trace.h150 vluint32_t m_nextCode; // Next code number to assign variable
213 vluint32_t nextCode() const { return m_nextCode; } in nextCode()