/dports/graphics/aseprite/aseprite-1.2.9/src/app/file/ |
H A D | file.cpp | 283 fop->m_seq.filename_list.erase(fop->m_seq.filename_list.begin()+1, in createLoadDocumentOperation() 578 m_seq.last_cel->data()->setImage(m_seq.image); in operate() 579 m_seq.layer->addCel(m_seq.last_cel); in operate() 644 layer_add_frame(m_seq.layer, m_seq.last_cel); in operate() 655 m_seq.progress_offset += m_seq.progress_fraction; in operate() 768 m_seq.progress_offset += m_seq.progress_fraction; in operate() 829 delete m_seq.palette; in ~FileOp() 969 if (m_seq.last_cel) { in sequenceImage() 976 m_seq.last_cel = new Cel(m_seq.frame++, ImageRef(nullptr)); in sequenceImage() 1071 m_seq.layer = nullptr; in FileOp() [all …]
|
/dports/x11-toolkits/vte3/vte-0.64.2/src/ |
H A D | parser-glue.hh | 102 return m_seq->type; in type() 171 return m_seq->st; in st() 503 vte_seq_t m_seq; member in vte::parser::SequenceBuilder 513 memset(&m_seq, 0, sizeof(m_seq)); in SequenceBuilder() 580 assert(m_seq.n_args + 1 <= (sizeof(m_seq.args) / sizeof(m_seq.args[0]))); in append_param() 581 m_seq.args[m_seq.n_args++] = vte_seq_arg_init(std::min(p, 0xffff)); in append_param() 594 … assert(m_seq.n_args + params.size() <= (sizeof(m_seq.args) / sizeof(m_seq.args[0]))); in append_params() 599 m_seq.args[m_seq.n_args++] = vte_seq_arg_init(std::min(p, 0xffff)); in append_params() 613 … assert(m_seq.n_args + subparams.size() <= (sizeof(m_seq.args) / sizeof(m_seq.args[0]))); in append_subparams() 618 int* arg = &m_seq.args[m_seq.n_args++]; in append_subparams() [all …]
|
/dports/biology/lamarc/lamarc-2.1.8/src/conversion/ |
H A D | IndividualDS.cpp | 29 m_seq.push_back(seq); in IndividualDS() 38 m_seq.push_back(Sequence(seq)); in IndividualDS() 62 return m_seq[0].asString(); in getSequence() 80 for(seq = m_seq.begin(); seq != m_seq.end(); ++seq) in GetAllSeqNames() 113 for(seq = m_seq.begin(); seq != m_seq.end(); ++seq) in HasSequence() 126 return m_seq.empty(); in HasNoSequences() 135 for(seq = m_seq.begin(); seq != m_seq.end(); ++seq) in HasNonContiguousData() 150 for(seq = m_seq.begin(); seq != m_seq.end(); ++seq) in HasSNPs() 165 for(seq = m_seq.begin(); seq != m_seq.end(); ++seq) in PopSequence() 170 m_seq.erase(seq); in PopSequence() [all …]
|
/dports/deskutils/recoll/recoll-1.31.2/query/ |
H A D | docseq.h | 187 if (!m_seq) in getAbstract() 193 if (!m_seq) in getAbstract() 200 if (!m_seq) in docDups() 206 if (!m_seq) in snippetsCapable() 211 if (!m_seq) in getDescription() 216 if (!m_seq) in getTerms() 221 if (!m_seq) in getEnclosing() 226 if (!m_seq) in getReason() 239 if (!m_seq) in getDb() 261 if (!m_seq) [all …]
|
H A D | docseq.cpp | 61 if (!m_seq) in stripStack() 63 while (m_seq->getSourceSeq()) { in stripStack() 64 m_seq = m_seq->getSourceSeq(); in stripStack() 73 if (!m_seq) in buildStack() 78 if (m_seq->canFilter()) { in buildStack() 79 if (!m_seq->setFiltSpec(m_fspec)) { in buildStack() 84 m_seq = std::shared_ptr<DocSequence>(new DocSeqFiltered(m_config, m_seq, m_fspec)); in buildStack() 88 if (m_seq->canSort()) { in buildStack() 94 m_seq = std::shared_ptr<DocSequence>(new DocSeqSorted(m_seq, m_sspec)); in buildStack() 102 if (!m_seq) in title() [all …]
|
/dports/emulators/mess/mame-mame0226/src/mame/machine/ |
H A D | iteagle_fpga.cpp | 156 feed = ((m_seq<<4) ^ m_seq)>>7; in update_sequence() 158 val1 = ((m_seq & 0x2)<<1) | ((m_seq & 0x4)>>1) | ((m_seq & 0x8)>>3); in update_sequence() 159 m_seq_rem1 = ((m_seq & 0x10)) | ((m_seq & 0x20)>>2) | ((m_seq & 0x40)>>4); in update_sequence() 164 val1 = ((m_seq & 0x2)<<1) | ((m_seq & 0x4)>>1) | ((m_seq & 0x8)>>3); in update_sequence() 169 val1 = ((m_seq & 0x2)<<6) | ((m_seq & 0x4)<<4) | ((m_seq & 0x8)<<2) | ((m_seq & 0x10)<<0) in update_sequence() 170 | ((m_seq & 0x20)>>2) | ((m_seq & 0x40)>>4) | ((m_seq & 0x80)>>6) | ((m_seq & 0x100)>>8); in update_sequence() 184 feed = ((m_seq<<4) ^ m_seq)>>7; in update_sequence_eg1() 186 val1 = ((m_seq & 0x2)<<6) | ((m_seq & 0x4)<<4) | ((m_seq & 0x8)<<2) | ((m_seq & 0x10)<<0) in update_sequence_eg1() 187 | ((m_seq & 0x20)>>2) | ((m_seq & 0x40)>>4) | ((m_seq & 0x80)>>6) | ((m_seq & 0x100)>>8); in update_sequence_eg1() 191 val1 = ((m_seq & 0x2)<<1) | ((m_seq & 0x4)>>1) | ((m_seq & 0x8)>>3); in update_sequence_eg1() [all …]
|
/dports/emulators/mame/mame-mame0226/src/mame/machine/ |
H A D | iteagle_fpga.cpp | 156 feed = ((m_seq<<4) ^ m_seq)>>7; in update_sequence() 158 val1 = ((m_seq & 0x2)<<1) | ((m_seq & 0x4)>>1) | ((m_seq & 0x8)>>3); in update_sequence() 159 m_seq_rem1 = ((m_seq & 0x10)) | ((m_seq & 0x20)>>2) | ((m_seq & 0x40)>>4); in update_sequence() 164 val1 = ((m_seq & 0x2)<<1) | ((m_seq & 0x4)>>1) | ((m_seq & 0x8)>>3); in update_sequence() 169 val1 = ((m_seq & 0x2)<<6) | ((m_seq & 0x4)<<4) | ((m_seq & 0x8)<<2) | ((m_seq & 0x10)<<0) in update_sequence() 170 | ((m_seq & 0x20)>>2) | ((m_seq & 0x40)>>4) | ((m_seq & 0x80)>>6) | ((m_seq & 0x100)>>8); in update_sequence() 184 feed = ((m_seq<<4) ^ m_seq)>>7; in update_sequence_eg1() 186 val1 = ((m_seq & 0x2)<<6) | ((m_seq & 0x4)<<4) | ((m_seq & 0x8)<<2) | ((m_seq & 0x10)<<0) in update_sequence_eg1() 187 | ((m_seq & 0x20)>>2) | ((m_seq & 0x40)>>4) | ((m_seq & 0x80)>>6) | ((m_seq & 0x100)>>8); in update_sequence_eg1() 191 val1 = ((m_seq & 0x2)<<1) | ((m_seq & 0x4)>>1) | ((m_seq & 0x8)>>3); in update_sequence_eg1() [all …]
|
/dports/biology/avida/avida-2.12.4-src/avida-core/source/cpu/ |
H A D | cCPUMemory.cc | 37 if (m_seq.GetSize() != m_flag_array.GetSize()) m_flag_array.Resize(m_seq.GetSize()); in adjustCapacity() 52 for (int i = old_size - 1; i >= pos; i--) m_seq[i + num_sites] = m_seq[i]; in prepareInsert() 74 m_seq[i].SetOp(0); in Resize() 94 assert(to < m_seq.GetSize()); in Copy() 98 m_seq[to] = m_seq[from]; in Copy() 109 m_seq[pos] = inst; in Insert() 120 m_seq[i + pos] = genome[i]; in Insert() 133 m_seq[i] = m_seq[i + num_sites]; in Remove() 153 m_seq[i + pos] = genome[i]; in Replace() 165 m_seq[i] = other_memory.m_seq[i]; in operator =() [all …]
|
/dports/multimedia/qpwgraph/qpwgraph-71edb283e7b5d4429d5ef9951de6b740afb07790/src/ |
H A D | qpwgraph_alsamidi.cpp | 63 if (m_seq) in open() 67 m_seq = nullptr; in open() 72 = snd_seq_create_simple_port(m_seq, in open() 81 snd_seq_close(m_seq); in open() 82 m_seq = nullptr; in open() 113 if (m_seq == nullptr) in close() 121 snd_seq_close(m_seq); in close() 123 m_seq = nullptr; in close() 130 if (m_seq == nullptr) in changedNotify() 149 if (m_seq == nullptr) in connectPorts() [all …]
|
/dports/biology/avida/avida-2.12.4-src/avida-core/include/public/avida/core/ |
H A D | Genome.h | 55 Sequence m_seq; variable 60 …e(int hw, const cString& is, const Sequence& seq) : m_hw_type(hw), m_inst_set(is), m_seq(seq) { ; } in Genome() 62 …e(const Genome& gen) : m_hw_type(gen.m_hw_type), m_inst_set(gen.m_inst_set), m_seq(gen.m_seq) { ; } in Genome() 67 LIB_EXPORT inline const Sequence& GetSequence() const { return m_seq; } in GetSequence() 68 LIB_EXPORT inline Sequence& GetSequence() { return m_seq; } in GetSequence() 70 LIB_EXPORT inline int GetSize() const { return m_seq.GetSize(); } in GetSize() 75 LIB_EXPORT inline void SetSequence(const Sequence& seq) { m_seq = seq; } in SetSequence() 82 { return (m_hw_type == gen.m_hw_type && m_inst_set == gen.m_inst_set && m_seq == gen.m_seq); } 84 { m_hw_type = gen.m_hw_type; m_inst_set = gen.m_inst_set; m_seq = gen.m_seq; return *this; }
|
/dports/devel/rapidcheck/rapidcheck-7bc7d30/include/rapidcheck/seq/ |
H A D | Transform.hpp | 19 if (!m_seq.next()) { in operator ()() 20 m_seq = Seq<T>(); in operator ()() 27 return m_seq.next(); in operator ()() 32 Seq<T> m_seq; member in rc::seq::detail::DropSeq 48 return m_seq.next(); in operator ()() 53 Seq<T> m_seq; member in rc::seq::detail::TakeSeq 87 Seq<T> m_seq; member in rc::seq::detail::DropWhileSeq 114 Seq<T> m_seq; member in rc::seq::detail::TakeWhileSeq 139 Seq<T> m_seq; member in rc::seq::detail::MapSeq 204 Seq<T> m_seq; member in rc::seq::detail::FilterSeq [all …]
|
/dports/biology/abyss/abyss-2.3.1/vendor/btl_bloomfilter/vendor/ |
H A D | ntHashIterator.hpp | 39 m_seq(seq), m_h(h), m_k(k), m_hVec(new uint64_t[h]), m_pos(0) in ntHashIterator() 47 m_seq = nth.m_seq; in ntHashIterator() 61 if (m_k > m_seq.length()) { in init() 66 …while (m_pos<m_seq.length()-m_k+1 && !NTMC64(m_seq.data()+m_pos, m_k, m_h, m_fhVal, m_rhVal, locN,… in init() 68 if (m_pos >= m_seq.length()-m_k+1) in init() 76 if (m_pos >= m_seq.length()-m_k+1) { in next() 80 if(seedTab[(unsigned char)(m_seq.at(m_pos+m_k-1))]==seedN) { in next() 85 NTMC64(m_seq.at(m_pos-1), m_seq.at(m_pos-1+m_k), m_k, m_h, m_fhVal, m_rhVal, m_hVec); in next() 132 std::string m_seq; member in ntHashIterator
|
/dports/biology/abyss/abyss-2.3.1/vendor/nthash/ |
H A D | ntHashIterator.hpp | 39 m_seq(seq), m_h(h), m_k(k), m_hVec(new uint64_t[h]), m_pos(0) in ntHashIterator() 47 m_seq = nth.m_seq; in ntHashIterator() 61 if (m_k > m_seq.length()) { in init() 66 …while (m_pos<m_seq.length()-m_k+1 && !NTMC64(m_seq.data()+m_pos, m_k, m_h, m_fhVal, m_rhVal, locN,… in init() 68 if (m_pos >= m_seq.length()-m_k+1) in init() 76 if (m_pos >= m_seq.length()-m_k+1) { in next() 80 if(seedTab[(unsigned char)(m_seq.at(m_pos+m_k-1))]==seedN) { in next() 85 NTMC64(m_seq.at(m_pos-1), m_seq.at(m_pos-1+m_k), m_k, m_h, m_fhVal, m_rhVal, m_hVec); in next() 132 std::string m_seq; member in ntHashIterator
|
/dports/biology/abyss/abyss-2.3.1/BloomDBG/ |
H A D | RollingHashIterator.h | 37 if (m_seq.length() < m_k) { in next() 44 while(m_pos < m_seq.length() - m_k + 1) { in next() 81 m_rollingHash.reset(m_seq.substr(m_pos, m_k)); in next() 88 m_seq[m_pos + m_k - 1]); in next() 117 : m_seq(seq), m_numHashes(numHashes), m_k(k), in RollingHashIterator() 132 std::transform(m_seq.begin(), m_seq.end(), m_seq.begin(), ::toupper); in init() 135 size_t i = m_seq.find_first_not_of(ACGT_CHARS); in init() 138 i = m_seq.find_first_not_of(ACGT_CHARS, i + 1); in init() 148 assert(m_pos + m_k <= m_seq.length()); 195 std::string kmer(m_seq, m_pos, m_k); [all …]
|
/dports/editors/libreoffice/libreoffice-7.2.6.2/ucb/source/ucp/file/ |
H A D | filprp.cxx | 33 m_seq( 0 ) in XPropertySetInfo_impl() 41 m_seq.realloc( properties.size() ); in XPropertySetInfo_impl() 46 m_seq[ count++ ] = beans::Property( rProp.getPropertyName(), in XPropertySetInfo_impl() 56 m_seq( seq ) in XPropertySetInfo_impl() 71 auto pProp = std::find_if(m_seq.begin(), m_seq.end(), in getPropertyByName() 73 if (pProp != m_seq.end()) in getPropertyByName() 83 return m_seq; in getProperties() 90 return std::any_of(m_seq.begin(), m_seq.end(), in hasPropertyByName()
|
/dports/editors/libreoffice6/libreoffice-6.4.7.2/ucb/source/ucp/file/ |
H A D | filprp.cxx | 33 m_seq( 0 ) in XPropertySetInfo_impl() 41 m_seq.realloc( properties.size() ); in XPropertySetInfo_impl() 46 m_seq[ count++ ] = beans::Property( rProp.getPropertyName(), in XPropertySetInfo_impl() 56 m_seq( seq ) in XPropertySetInfo_impl() 71 auto pProp = std::find_if(m_seq.begin(), m_seq.end(), in getPropertyByName() 73 if (pProp != m_seq.end()) in getPropertyByName() 83 return m_seq; in getProperties() 90 return std::any_of(m_seq.begin(), m_seq.end(), in hasPropertyByName()
|
/dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/ndb/src/kernel/vm/ |
H A D | NdbSeqLock.hpp | 32 NdbSeqLock() { m_seq = 0;} in NdbSeqLock() 33 volatile Uint32 m_seq; member 46 assert((m_seq & 1) == 0); in write_lock() 47 m_seq++; in write_lock() 55 assert((m_seq & 1) == 1); in write_unlock() 57 m_seq++; in write_unlock() 65 Uint32 val = m_seq; in read_lock() 82 return val == m_seq; in read_unlock()
|
/dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/ndb/src/kernel/vm/ |
H A D | NdbSeqLock.hpp | 32 NdbSeqLock() { m_seq = 0;} in NdbSeqLock() 33 volatile Uint32 m_seq; member 46 assert((m_seq & 1) == 0); in write_lock() 47 m_seq++; in write_lock() 55 assert((m_seq & 1) == 1); in write_unlock() 57 m_seq++; in write_unlock() 65 Uint32 val = m_seq; in read_lock() 82 return val == m_seq; in read_unlock()
|
/dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/ndb/src/kernel/vm/ |
H A D | NdbSeqLock.hpp | 32 NdbSeqLock() { m_seq = 0;} in NdbSeqLock() 33 volatile Uint32 m_seq; member 46 assert((m_seq & 1) == 0); in write_lock() 47 m_seq++; in write_lock() 55 assert((m_seq & 1) == 1); in write_unlock() 57 m_seq++; in write_unlock() 65 Uint32 val = m_seq; in read_lock() 82 return val == m_seq; in read_unlock()
|
/dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/storage/ndb/src/kernel/vm/ |
H A D | NdbSeqLock.hpp | 32 NdbSeqLock() { m_seq = 0;} in NdbSeqLock() 33 volatile Uint32 m_seq; member 46 assert((m_seq & 1) == 0); in write_lock() 47 m_seq++; in write_lock() 55 assert((m_seq & 1) == 1); in write_unlock() 57 m_seq++; in write_unlock() 65 Uint32 val = m_seq; in read_lock() 82 return val == m_seq; in read_unlock()
|
/dports/databases/mysql56-client/mysql-5.6.51/storage/ndb/src/kernel/vm/ |
H A D | NdbSeqLock.hpp | 32 NdbSeqLock() { m_seq = 0;} in NdbSeqLock() 33 volatile Uint32 m_seq; member 46 assert((m_seq & 1) == 0); in write_lock() 47 m_seq++; in write_lock() 55 assert((m_seq & 1) == 1); in write_unlock() 57 m_seq++; in write_unlock() 65 Uint32 val = m_seq; in read_lock() 82 return val == m_seq; in read_unlock()
|
/dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/storage/ndb/src/kernel/vm/ |
H A D | NdbSeqLock.hpp | 35 NdbSeqLock() { m_seq = 0;} in NdbSeqLock() 36 volatile Uint32 m_seq; member 49 assert((m_seq & 1) == 0); in write_lock() 50 m_seq++; in write_lock() 58 assert((m_seq & 1) == 1); in write_unlock() 60 m_seq++; in write_unlock() 68 Uint32 val = m_seq; in read_lock() 85 return val == m_seq; in read_unlock()
|
/dports/databases/percona57-client/percona-server-5.7.36-39/storage/ndb/src/kernel/vm/ |
H A D | NdbSeqLock.hpp | 35 NdbSeqLock() { m_seq = 0;} in NdbSeqLock() 36 volatile Uint32 m_seq; member 49 assert((m_seq & 1) == 0); in write_lock() 50 m_seq++; in write_lock() 58 assert((m_seq & 1) == 1); in write_unlock() 60 m_seq++; in write_unlock() 68 Uint32 val = m_seq; in read_lock() 85 return val == m_seq; in read_unlock()
|
/dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/storage/ndb/src/kernel/vm/ |
H A D | NdbSeqLock.hpp | 35 NdbSeqLock() { m_seq = 0;} in NdbSeqLock() 36 volatile Uint32 m_seq; member 49 assert((m_seq & 1) == 0); in write_lock() 50 m_seq++; in write_lock() 58 assert((m_seq & 1) == 1); in write_unlock() 60 m_seq++; in write_unlock() 68 Uint32 val = m_seq; in read_lock() 85 return val == m_seq; in read_unlock()
|
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/ndb/src/kernel/vm/ |
H A D | NdbSeqLock.hpp | 35 NdbSeqLock() { m_seq = 0;} in NdbSeqLock() 36 volatile Uint32 m_seq; member 49 assert((m_seq & 1) == 0); in write_lock() 50 m_seq++; in write_lock() 58 assert((m_seq & 1) == 1); in write_unlock() 60 m_seq++; in write_unlock() 68 Uint32 val = m_seq; in read_lock() 85 return val == m_seq; in read_unlock()
|