/dports/games/blobby/blobby-1.0/src/raknet/ |
H A D | LinkedList.h | 277 if ( ( &original_copy ) != this ) 283 if ( original_copy.list_size == 0 ) 291 if ( original_copy.list_size == 1 ) 388 if ( original_copy.list_size == 0 ) in LinkedList() 397 if ( original_copy.list_size == 1 ) in LinkedList() 456 this->list_size = original_copy.list_size; in LinkedList() 468 if ( original_copy.list_size == 0 ) in CircularLinkedList() 477 if ( original_copy.list_size == 1 ) in CircularLinkedList() 550 if ( ( &original_copy ) != this ) 556 if ( original_copy.list_size == 0 ) [all …]
|
H A D | ArrayList.h | 102 List( const List& original_copy ); 106 List& operator= ( const List& original_copy ); 191 List<list_type>::List( const List& original_copy ) in List() argument 193 array = original_copy.array; in List() 197 List<list_type>& List<list_type>::operator= ( const List& original_copy ) 199 array = original_copy.array;
|
/dports/devel/raknet/raknet-3.9.2_10,1/Source/ |
H A D | DS_Queue.h | 29 Queue( Queue& original_copy ); 30 bool operator= ( const Queue& original_copy ); 249 if ( original_copy.Size() == 0 ) in Queue() 259 …array[ counter ] = original_copy.array[ ( original_copy.head + counter ) % ( original_copy.allocat… in Queue() 263 tail = original_copy.Size(); in Queue() 265 allocation_size = original_copy.Size() + 1; in Queue() 272 if ( ( &original_copy ) == this ) 278 if ( original_copy.Size() == 0 ) 288 …array[ counter ] = original_copy.array[ ( original_copy.head + counter ) % ( original_copy.allocat… 292 tail = original_copy.Size(); [all …]
|
H A D | DS_LinkedList.h | 253 if ( ( &original_copy ) != this ) 259 if ( original_copy.list_size == 0 ) 267 if ( original_copy.list_size == 1 ) 364 if ( original_copy.list_size == 0 ) in LinkedList() 373 if ( original_copy.list_size == 1 ) in LinkedList() 432 this->list_size = original_copy.list_size; in LinkedList() 448 if ( original_copy.list_size == 0 ) in CircularLinkedList() 457 if ( original_copy.list_size == 1 ) in CircularLinkedList() 534 if ( ( &original_copy ) != this ) 540 if ( original_copy.list_size == 0 ) [all …]
|
H A D | DS_List.h | 40 List( const List& original_copy ); 43 List& operator= ( const List& original_copy ); 145 List<list_type>::List( const List& original_copy ) in List() argument 149 if ( original_copy.list_size == 0 ) in List() 159 listArray[ counter ] = original_copy.listArray[ counter ]; in List() 164 list_size = allocation_size = original_copy.list_size; in List() 169 List<list_type>& List<list_type>::operator= ( const List& original_copy ) 171 if ( ( &original_copy ) != this ) 177 if ( original_copy.list_size == 0 ) 188 listArray[ counter ] = original_copy.listArray[ counter ]; [all …]
|
H A D | DS_QueueLinkedList.h | 28 QueueLinkedList( const QueueLinkedList& original_copy ); 29 bool operator= ( const QueueLinkedList& original_copy ); 82 QueueLinkedList<QueueType>::QueueLinkedList( const QueueLinkedList& original_copy ) in QueueLinkedList() argument 84 data = original_copy.data; in QueueLinkedList() 88 bool QueueLinkedList<QueueType>::operator= ( const QueueLinkedList& original_copy ) 90 if ( ( &original_copy ) == this ) 93 data = original_copy.data;
|
H A D | DS_Map.h | 61 Map( const Map& original_copy ); 62 Map& operator= ( const Map& original_copy ); 105 Map<key_type, data_type, key_comparison_func>::Map( const Map& original_copy ) in Map() argument 107 mapNodeList=original_copy.mapNodeList; in Map() 108 lastSearchIndex=original_copy.lastSearchIndex; in Map() 109 lastSearchKey=original_copy.lastSearchKey; in Map() 110 lastSearchIndexValid=original_copy.lastSearchIndexValid; in Map() 116 mapNodeList=original_copy.mapNodeList; 117 lastSearchIndex=original_copy.lastSearchIndex; 118 lastSearchKey=original_copy.lastSearchKey; [all …]
|
H A D | DS_WeightedGraph.h | 41 WeightedGraph( const WeightedGraph& original_copy ); 42 WeightedGraph& operator= ( const WeightedGraph& original_copy ); 97 adjacencyLists=original_copy.adjacencyLists; in WeightedGraph() 99 isValidPath=original_copy.isValidPath; in WeightedGraph() 102 rootNode=original_copy.rootNode; in WeightedGraph() 103 costMatrixIndices=original_copy.costMatrixIndices; in WeightedGraph() 107 …memcpy(leastNodeArray, original_copy.leastNodeArray, costMatrixIndices.Size() * sizeof(weight_type… in WeightedGraph() 114 adjacencyLists=original_copy.adjacencyLists; 116 isValidPath=original_copy.isValidPath; 119 rootNode=original_copy.rootNode; [all …]
|
H A D | DS_OrderedList.h | 36 OrderedList( const OrderedList& original_copy ); 37 OrderedList& operator= ( const OrderedList& original_copy ); 73 …<key_type, data_type, default_comparison_function>::OrderedList( const OrderedList& original_copy ) in OrderedList() argument 75 orderedList=original_copy.orderedList; in OrderedList() 79 …t<key_type, data_type, default_comparison_function>::operator= ( const OrderedList& original_copy ) 81 orderedList=original_copy.orderedList;
|
H A D | DS_BinarySearchTree.h | 104 BinarySearchTree& operator= ( const BinarySearchTree& original_copy ); 144 …archTree<BinarySearchTreeType>& operator= ( BinarySearchTree<BinarySearchTreeType>& original_copy ) 146 return BinarySearchTree<BinarySearchTreeType>::operator= ( original_copy ); 978 BinarySearchTree<BinarySearchTreeType>::BinarySearchTree( const BinarySearchTree& original_copy ) in BinarySearchTree() argument 989 if ( original_copy.BinarySearchTree_size == 0 ) in BinarySearchTree() 999 tree_queue.Push( original_copy.root ); in BinarySearchTree() 1023 …eType>& BinarySearchTree<BinarySearchTreeType>::operator= ( const BinarySearchTree& original_copy ) 1027 if ( ( &original_copy ) == this ) 1041 if ( original_copy.BinarySearchTree_size == 0 ) 1051 tree_queue.Push( original_copy.root );
|
/dports/games/blobby/blobby-1.0/src/blobnet/adt/ |
H A D | Queue.hpp | 48 bool operator= (const Queue& original_copy); 101 template <class QueueType> Queue<QueueType>::Queue(const Queue& original_copy) in Queue() argument 103 this->array = original_copy->array; in Queue() 116 template <class QueueType> bool Queue<QueueType>::operator= (const Queue& original_copy) in operator =() argument 118 return this->array = original_copy->array; in operator =()
|
/dports/graphics/vigra/vigra-8acd73a/vigranumpy/test/ |
H A D | test_segmentation.py | 48 original_copy = original.copy() 49 vigra.analysis.applyMapping(original_copy, mapping, out=original_copy) 50 assert (original_copy == original+100).all()
|
/dports/multimedia/mjpegtools/mjpegtools-2.1.0/mplex/ |
H A D | mpastrm_in.cpp | 143 original_copy = bs.Get1Bit (); in Init() 326 original_copy,mpa_original_bit[original_copy]); in OutputHdrInfo()
|
/dports/multimedia/avidemux-qt5/avidemux_2.7.6/avidemux_plugins/ADM_muxers/muxerMplex/ |
H A D | mpastrm_in.cpp | 143 original_copy = bs.Get1Bit (); in Init() 322 original_copy,mpa_original_bit[original_copy]); in OutputHdrInfo()
|
H A D | audiostrm.hpp | 78 unsigned int original_copy ; member in MPAStream
|
/dports/multimedia/avidemux-cli/avidemux_2.7.6/avidemux_plugins/ADM_muxers/muxerMplex/ |
H A D | mpastrm_in.cpp | 143 original_copy = bs.Get1Bit (); in Init() 322 original_copy,mpa_original_bit[original_copy]); in OutputHdrInfo()
|
H A D | audiostrm.hpp | 78 unsigned int original_copy ; member in MPAStream
|
/dports/multimedia/avidemux-plugins/avidemux_2.7.6/avidemux_plugins/ADM_muxers/muxerMplex/ |
H A D | mpastrm_in.cpp | 143 original_copy = bs.Get1Bit (); in Init() 322 original_copy,mpa_original_bit[original_copy]); in OutputHdrInfo()
|
H A D | audiostrm.hpp | 78 unsigned int original_copy ; member in MPAStream
|
/dports/multimedia/avidemux/avidemux_2.7.6/avidemux_plugins/ADM_muxers/muxerMplex/ |
H A D | mpastrm_in.cpp | 143 original_copy = bs.Get1Bit (); in Init() 322 original_copy,mpa_original_bit[original_copy]); in OutputHdrInfo()
|
H A D | audiostrm.hpp | 78 unsigned int original_copy ; member in MPAStream
|
/dports/multimedia/mplex/mplex-1.1/ |
H A D | inptstrm.c | 434 audio_info->original_copy,original[audio_info->original_copy]); 493 audio_info->original_copy = get1bit (&audio_bs);
|
H A D | inits.c | 54 pointer->original_copy = 0;
|
/dports/multimedia/tcmplex-panteltje/tcmplex-panteltje-0.4.7/ |
H A D | inits.c | 60 pointer->original_copy = 0; in empty_audio_struc()
|
/dports/audio/py-mutagen/mutagen-1.42.0/mutagen/ |
H A D | aac.py | 168 original_copy = r.bits(1) 174 private_bit, channel_configuration, original_copy, home,
|