mat.inl.hpp 97 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925
  1. /*M///////////////////////////////////////////////////////////////////////////////////////
  2. //
  3. // IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
  4. //
  5. // By downloading, copying, installing or using the software you agree to this license.
  6. // If you do not agree to this license, do not download, install,
  7. // copy or use the software.
  8. //
  9. //
  10. // License Agreement
  11. // For Open Source Computer Vision Library
  12. //
  13. // Copyright (C) 2000-2008, Intel Corporation, all rights reserved.
  14. // Copyright (C) 2009, Willow Garage Inc., all rights reserved.
  15. // Copyright (C) 2013, OpenCV Foundation, all rights reserved.
  16. // Copyright (C) 2015, Itseez Inc., all rights reserved.
  17. // Third party copyrights are property of their respective owners.
  18. //
  19. // Redistribution and use in source and binary forms, with or without modification,
  20. // are permitted provided that the following conditions are met:
  21. //
  22. // * Redistribution's of source code must retain the above copyright notice,
  23. // this list of conditions and the following disclaimer.
  24. //
  25. // * Redistribution's in binary form must reproduce the above copyright notice,
  26. // this list of conditions and the following disclaimer in the documentation
  27. // and/or other materials provided with the distribution.
  28. //
  29. // * The name of the copyright holders may not be used to endorse or promote products
  30. // derived from this software without specific prior written permission.
  31. //
  32. // This software is provided by the copyright holders and contributors "as is" and
  33. // any express or implied warranties, including, but not limited to, the implied
  34. // warranties of merchantability and fitness for a particular purpose are disclaimed.
  35. // In no event shall the Intel Corporation or contributors be liable for any direct,
  36. // indirect, incidental, special, exemplary, or consequential damages
  37. // (including, but not limited to, procurement of substitute goods or services;
  38. // loss of use, data, or profits; or business interruption) however caused
  39. // and on any theory of liability, whether in contract, strict liability,
  40. // or tort (including negligence or otherwise) arising in any way out of
  41. // the use of this software, even if advised of the possibility of such damage.
  42. //
  43. //M*/
  44. #ifndef OPENCV_CORE_MATRIX_OPERATIONS_HPP
  45. #define OPENCV_CORE_MATRIX_OPERATIONS_HPP
  46. #ifndef __cplusplus
  47. # error mat.inl.hpp header must be compiled as C++
  48. #endif
  49. #ifdef _MSC_VER
  50. #pragma warning( push )
  51. #pragma warning( disable: 4127 )
  52. #endif
  53. namespace cv
  54. {
  55. CV__DEBUG_NS_BEGIN
  56. //! @cond IGNORED
  57. //////////////////////// Input/Output Arrays ////////////////////////
  58. inline void _InputArray::init(int _flags, const void* _obj)
  59. { flags = _flags; obj = (void*)_obj; }
  60. inline void _InputArray::init(int _flags, const void* _obj, Size _sz)
  61. { flags = _flags; obj = (void*)_obj; sz = _sz; }
  62. inline void* _InputArray::getObj() const { return obj; }
  63. inline int _InputArray::getFlags() const { return flags; }
  64. inline Size _InputArray::getSz() const { return sz; }
  65. inline _InputArray::_InputArray() { init(NONE, 0); }
  66. inline _InputArray::_InputArray(int _flags, void* _obj) { init(_flags, _obj); }
  67. inline _InputArray::_InputArray(const Mat& m) { init(MAT+ACCESS_READ, &m); }
  68. inline _InputArray::_InputArray(const std::vector<Mat>& vec) { init(STD_VECTOR_MAT+ACCESS_READ, &vec); }
  69. inline _InputArray::_InputArray(const UMat& m) { init(UMAT+ACCESS_READ, &m); }
  70. inline _InputArray::_InputArray(const std::vector<UMat>& vec) { init(STD_VECTOR_UMAT+ACCESS_READ, &vec); }
  71. template<typename _Tp> inline
  72. _InputArray::_InputArray(const std::vector<_Tp>& vec)
  73. { init(FIXED_TYPE + STD_VECTOR + traits::Type<_Tp>::value + ACCESS_READ, &vec); }
  74. #ifdef CV_CXX_STD_ARRAY
  75. template<typename _Tp, std::size_t _Nm> inline
  76. _InputArray::_InputArray(const std::array<_Tp, _Nm>& arr)
  77. { init(FIXED_TYPE + FIXED_SIZE + STD_ARRAY + traits::Type<_Tp>::value + ACCESS_READ, arr.data(), Size(1, _Nm)); }
  78. template<std::size_t _Nm> inline
  79. _InputArray::_InputArray(const std::array<Mat, _Nm>& arr)
  80. { init(STD_ARRAY_MAT + ACCESS_READ, arr.data(), Size(1, _Nm)); }
  81. #endif
  82. inline
  83. _InputArray::_InputArray(const std::vector<bool>& vec)
  84. { init(FIXED_TYPE + STD_BOOL_VECTOR + traits::Type<bool>::value + ACCESS_READ, &vec); }
  85. template<typename _Tp> inline
  86. _InputArray::_InputArray(const std::vector<std::vector<_Tp> >& vec)
  87. { init(FIXED_TYPE + STD_VECTOR_VECTOR + traits::Type<_Tp>::value + ACCESS_READ, &vec); }
  88. inline
  89. _InputArray::_InputArray(const std::vector<std::vector<bool> >&)
  90. { CV_Error(Error::StsUnsupportedFormat, "std::vector<std::vector<bool> > is not supported!\n"); }
  91. template<typename _Tp> inline
  92. _InputArray::_InputArray(const std::vector<Mat_<_Tp> >& vec)
  93. { init(FIXED_TYPE + STD_VECTOR_MAT + traits::Type<_Tp>::value + ACCESS_READ, &vec); }
  94. template<typename _Tp, int m, int n> inline
  95. _InputArray::_InputArray(const Matx<_Tp, m, n>& mtx)
  96. { init(FIXED_TYPE + FIXED_SIZE + MATX + traits::Type<_Tp>::value + ACCESS_READ, &mtx, Size(n, m)); }
  97. template<typename _Tp> inline
  98. _InputArray::_InputArray(const _Tp* vec, int n)
  99. { init(FIXED_TYPE + FIXED_SIZE + MATX + traits::Type<_Tp>::value + ACCESS_READ, vec, Size(n, 1)); }
  100. template<typename _Tp> inline
  101. _InputArray::_InputArray(const Mat_<_Tp>& m)
  102. { init(FIXED_TYPE + MAT + traits::Type<_Tp>::value + ACCESS_READ, &m); }
  103. inline _InputArray::_InputArray(const double& val)
  104. { init(FIXED_TYPE + FIXED_SIZE + MATX + CV_64F + ACCESS_READ, &val, Size(1,1)); }
  105. inline _InputArray::_InputArray(const MatExpr& expr)
  106. { init(FIXED_TYPE + FIXED_SIZE + EXPR + ACCESS_READ, &expr); }
  107. inline _InputArray::_InputArray(const cuda::GpuMat& d_mat)
  108. { init(CUDA_GPU_MAT + ACCESS_READ, &d_mat); }
  109. inline _InputArray::_InputArray(const std::vector<cuda::GpuMat>& d_mat)
  110. { init(STD_VECTOR_CUDA_GPU_MAT + ACCESS_READ, &d_mat);}
  111. inline _InputArray::_InputArray(const ogl::Buffer& buf)
  112. { init(OPENGL_BUFFER + ACCESS_READ, &buf); }
  113. inline _InputArray::_InputArray(const cuda::HostMem& cuda_mem)
  114. { init(CUDA_HOST_MEM + ACCESS_READ, &cuda_mem); }
  115. inline _InputArray::~_InputArray() {}
  116. inline Mat _InputArray::getMat(int i) const
  117. {
  118. if( kind() == MAT && i < 0 )
  119. return *(const Mat*)obj;
  120. return getMat_(i);
  121. }
  122. inline bool _InputArray::isMat() const { return kind() == _InputArray::MAT; }
  123. inline bool _InputArray::isUMat() const { return kind() == _InputArray::UMAT; }
  124. inline bool _InputArray::isMatVector() const { return kind() == _InputArray::STD_VECTOR_MAT; }
  125. inline bool _InputArray::isUMatVector() const { return kind() == _InputArray::STD_VECTOR_UMAT; }
  126. inline bool _InputArray::isMatx() const { return kind() == _InputArray::MATX; }
  127. inline bool _InputArray::isVector() const { return kind() == _InputArray::STD_VECTOR ||
  128. kind() == _InputArray::STD_BOOL_VECTOR ||
  129. kind() == _InputArray::STD_ARRAY; }
  130. inline bool _InputArray::isGpuMatVector() const { return kind() == _InputArray::STD_VECTOR_CUDA_GPU_MAT; }
  131. ////////////////////////////////////////////////////////////////////////////////////////
  132. inline _OutputArray::_OutputArray() { init(ACCESS_WRITE, 0); }
  133. inline _OutputArray::_OutputArray(int _flags, void* _obj) { init(_flags|ACCESS_WRITE, _obj); }
  134. inline _OutputArray::_OutputArray(Mat& m) { init(MAT+ACCESS_WRITE, &m); }
  135. inline _OutputArray::_OutputArray(std::vector<Mat>& vec) { init(STD_VECTOR_MAT+ACCESS_WRITE, &vec); }
  136. inline _OutputArray::_OutputArray(UMat& m) { init(UMAT+ACCESS_WRITE, &m); }
  137. inline _OutputArray::_OutputArray(std::vector<UMat>& vec) { init(STD_VECTOR_UMAT+ACCESS_WRITE, &vec); }
  138. template<typename _Tp> inline
  139. _OutputArray::_OutputArray(std::vector<_Tp>& vec)
  140. { init(FIXED_TYPE + STD_VECTOR + traits::Type<_Tp>::value + ACCESS_WRITE, &vec); }
  141. #ifdef CV_CXX_STD_ARRAY
  142. template<typename _Tp, std::size_t _Nm> inline
  143. _OutputArray::_OutputArray(std::array<_Tp, _Nm>& arr)
  144. { init(FIXED_TYPE + FIXED_SIZE + STD_ARRAY + traits::Type<_Tp>::value + ACCESS_WRITE, arr.data(), Size(1, _Nm)); }
  145. template<std::size_t _Nm> inline
  146. _OutputArray::_OutputArray(std::array<Mat, _Nm>& arr)
  147. { init(STD_ARRAY_MAT + ACCESS_WRITE, arr.data(), Size(1, _Nm)); }
  148. #endif
  149. inline
  150. _OutputArray::_OutputArray(std::vector<bool>&)
  151. { CV_Error(Error::StsUnsupportedFormat, "std::vector<bool> cannot be an output array\n"); }
  152. template<typename _Tp> inline
  153. _OutputArray::_OutputArray(std::vector<std::vector<_Tp> >& vec)
  154. { init(FIXED_TYPE + STD_VECTOR_VECTOR + traits::Type<_Tp>::value + ACCESS_WRITE, &vec); }
  155. inline
  156. _OutputArray::_OutputArray(std::vector<std::vector<bool> >&)
  157. { CV_Error(Error::StsUnsupportedFormat, "std::vector<std::vector<bool> > cannot be an output array\n"); }
  158. template<typename _Tp> inline
  159. _OutputArray::_OutputArray(std::vector<Mat_<_Tp> >& vec)
  160. { init(FIXED_TYPE + STD_VECTOR_MAT + traits::Type<_Tp>::value + ACCESS_WRITE, &vec); }
  161. template<typename _Tp> inline
  162. _OutputArray::_OutputArray(Mat_<_Tp>& m)
  163. { init(FIXED_TYPE + MAT + traits::Type<_Tp>::value + ACCESS_WRITE, &m); }
  164. template<typename _Tp, int m, int n> inline
  165. _OutputArray::_OutputArray(Matx<_Tp, m, n>& mtx)
  166. { init(FIXED_TYPE + FIXED_SIZE + MATX + traits::Type<_Tp>::value + ACCESS_WRITE, &mtx, Size(n, m)); }
  167. template<typename _Tp> inline
  168. _OutputArray::_OutputArray(_Tp* vec, int n)
  169. { init(FIXED_TYPE + FIXED_SIZE + MATX + traits::Type<_Tp>::value + ACCESS_WRITE, vec, Size(n, 1)); }
  170. template<typename _Tp> inline
  171. _OutputArray::_OutputArray(const std::vector<_Tp>& vec)
  172. { init(FIXED_TYPE + FIXED_SIZE + STD_VECTOR + traits::Type<_Tp>::value + ACCESS_WRITE, &vec); }
  173. #ifdef CV_CXX_STD_ARRAY
  174. template<typename _Tp, std::size_t _Nm> inline
  175. _OutputArray::_OutputArray(const std::array<_Tp, _Nm>& arr)
  176. { init(FIXED_TYPE + FIXED_SIZE + STD_ARRAY + traits::Type<_Tp>::value + ACCESS_WRITE, arr.data(), Size(1, _Nm)); }
  177. template<std::size_t _Nm> inline
  178. _OutputArray::_OutputArray(const std::array<Mat, _Nm>& arr)
  179. { init(FIXED_SIZE + STD_ARRAY_MAT + ACCESS_WRITE, arr.data(), Size(1, _Nm)); }
  180. #endif
  181. template<typename _Tp> inline
  182. _OutputArray::_OutputArray(const std::vector<std::vector<_Tp> >& vec)
  183. { init(FIXED_TYPE + FIXED_SIZE + STD_VECTOR_VECTOR + traits::Type<_Tp>::value + ACCESS_WRITE, &vec); }
  184. template<typename _Tp> inline
  185. _OutputArray::_OutputArray(const std::vector<Mat_<_Tp> >& vec)
  186. { init(FIXED_TYPE + FIXED_SIZE + STD_VECTOR_MAT + traits::Type<_Tp>::value + ACCESS_WRITE, &vec); }
  187. template<typename _Tp> inline
  188. _OutputArray::_OutputArray(const Mat_<_Tp>& m)
  189. { init(FIXED_TYPE + FIXED_SIZE + MAT + traits::Type<_Tp>::value + ACCESS_WRITE, &m); }
  190. template<typename _Tp, int m, int n> inline
  191. _OutputArray::_OutputArray(const Matx<_Tp, m, n>& mtx)
  192. { init(FIXED_TYPE + FIXED_SIZE + MATX + traits::Type<_Tp>::value + ACCESS_WRITE, &mtx, Size(n, m)); }
  193. template<typename _Tp> inline
  194. _OutputArray::_OutputArray(const _Tp* vec, int n)
  195. { init(FIXED_TYPE + FIXED_SIZE + MATX + traits::Type<_Tp>::value + ACCESS_WRITE, vec, Size(n, 1)); }
  196. inline _OutputArray::_OutputArray(cuda::GpuMat& d_mat)
  197. { init(CUDA_GPU_MAT + ACCESS_WRITE, &d_mat); }
  198. inline _OutputArray::_OutputArray(std::vector<cuda::GpuMat>& d_mat)
  199. { init(STD_VECTOR_CUDA_GPU_MAT + ACCESS_WRITE, &d_mat);}
  200. inline _OutputArray::_OutputArray(ogl::Buffer& buf)
  201. { init(OPENGL_BUFFER + ACCESS_WRITE, &buf); }
  202. inline _OutputArray::_OutputArray(cuda::HostMem& cuda_mem)
  203. { init(CUDA_HOST_MEM + ACCESS_WRITE, &cuda_mem); }
  204. inline _OutputArray::_OutputArray(const Mat& m)
  205. { init(FIXED_TYPE + FIXED_SIZE + MAT + ACCESS_WRITE, &m); }
  206. inline _OutputArray::_OutputArray(const std::vector<Mat>& vec)
  207. { init(FIXED_SIZE + STD_VECTOR_MAT + ACCESS_WRITE, &vec); }
  208. inline _OutputArray::_OutputArray(const UMat& m)
  209. { init(FIXED_TYPE + FIXED_SIZE + UMAT + ACCESS_WRITE, &m); }
  210. inline _OutputArray::_OutputArray(const std::vector<UMat>& vec)
  211. { init(FIXED_SIZE + STD_VECTOR_UMAT + ACCESS_WRITE, &vec); }
  212. inline _OutputArray::_OutputArray(const cuda::GpuMat& d_mat)
  213. { init(FIXED_TYPE + FIXED_SIZE + CUDA_GPU_MAT + ACCESS_WRITE, &d_mat); }
  214. inline _OutputArray::_OutputArray(const ogl::Buffer& buf)
  215. { init(FIXED_TYPE + FIXED_SIZE + OPENGL_BUFFER + ACCESS_WRITE, &buf); }
  216. inline _OutputArray::_OutputArray(const cuda::HostMem& cuda_mem)
  217. { init(FIXED_TYPE + FIXED_SIZE + CUDA_HOST_MEM + ACCESS_WRITE, &cuda_mem); }
  218. ///////////////////////////////////////////////////////////////////////////////////////////
  219. inline _InputOutputArray::_InputOutputArray() { init(ACCESS_RW, 0); }
  220. inline _InputOutputArray::_InputOutputArray(int _flags, void* _obj) { init(_flags|ACCESS_RW, _obj); }
  221. inline _InputOutputArray::_InputOutputArray(Mat& m) { init(MAT+ACCESS_RW, &m); }
  222. inline _InputOutputArray::_InputOutputArray(std::vector<Mat>& vec) { init(STD_VECTOR_MAT+ACCESS_RW, &vec); }
  223. inline _InputOutputArray::_InputOutputArray(UMat& m) { init(UMAT+ACCESS_RW, &m); }
  224. inline _InputOutputArray::_InputOutputArray(std::vector<UMat>& vec) { init(STD_VECTOR_UMAT+ACCESS_RW, &vec); }
  225. template<typename _Tp> inline
  226. _InputOutputArray::_InputOutputArray(std::vector<_Tp>& vec)
  227. { init(FIXED_TYPE + STD_VECTOR + traits::Type<_Tp>::value + ACCESS_RW, &vec); }
  228. #ifdef CV_CXX_STD_ARRAY
  229. template<typename _Tp, std::size_t _Nm> inline
  230. _InputOutputArray::_InputOutputArray(std::array<_Tp, _Nm>& arr)
  231. { init(FIXED_TYPE + FIXED_SIZE + STD_ARRAY + traits::Type<_Tp>::value + ACCESS_RW, arr.data(), Size(1, _Nm)); }
  232. template<std::size_t _Nm> inline
  233. _InputOutputArray::_InputOutputArray(std::array<Mat, _Nm>& arr)
  234. { init(STD_ARRAY_MAT + ACCESS_RW, arr.data(), Size(1, _Nm)); }
  235. #endif
  236. inline _InputOutputArray::_InputOutputArray(std::vector<bool>&)
  237. { CV_Error(Error::StsUnsupportedFormat, "std::vector<bool> cannot be an input/output array\n"); }
  238. template<typename _Tp> inline
  239. _InputOutputArray::_InputOutputArray(std::vector<std::vector<_Tp> >& vec)
  240. { init(FIXED_TYPE + STD_VECTOR_VECTOR + traits::Type<_Tp>::value + ACCESS_RW, &vec); }
  241. template<typename _Tp> inline
  242. _InputOutputArray::_InputOutputArray(std::vector<Mat_<_Tp> >& vec)
  243. { init(FIXED_TYPE + STD_VECTOR_MAT + traits::Type<_Tp>::value + ACCESS_RW, &vec); }
  244. template<typename _Tp> inline
  245. _InputOutputArray::_InputOutputArray(Mat_<_Tp>& m)
  246. { init(FIXED_TYPE + MAT + traits::Type<_Tp>::value + ACCESS_RW, &m); }
  247. template<typename _Tp, int m, int n> inline
  248. _InputOutputArray::_InputOutputArray(Matx<_Tp, m, n>& mtx)
  249. { init(FIXED_TYPE + FIXED_SIZE + MATX + traits::Type<_Tp>::value + ACCESS_RW, &mtx, Size(n, m)); }
  250. template<typename _Tp> inline
  251. _InputOutputArray::_InputOutputArray(_Tp* vec, int n)
  252. { init(FIXED_TYPE + FIXED_SIZE + MATX + traits::Type<_Tp>::value + ACCESS_RW, vec, Size(n, 1)); }
  253. template<typename _Tp> inline
  254. _InputOutputArray::_InputOutputArray(const std::vector<_Tp>& vec)
  255. { init(FIXED_TYPE + FIXED_SIZE + STD_VECTOR + traits::Type<_Tp>::value + ACCESS_RW, &vec); }
  256. #ifdef CV_CXX_STD_ARRAY
  257. template<typename _Tp, std::size_t _Nm> inline
  258. _InputOutputArray::_InputOutputArray(const std::array<_Tp, _Nm>& arr)
  259. { init(FIXED_TYPE + FIXED_SIZE + STD_ARRAY + traits::Type<_Tp>::value + ACCESS_RW, arr.data(), Size(1, _Nm)); }
  260. template<std::size_t _Nm> inline
  261. _InputOutputArray::_InputOutputArray(const std::array<Mat, _Nm>& arr)
  262. { init(FIXED_SIZE + STD_ARRAY_MAT + ACCESS_RW, arr.data(), Size(1, _Nm)); }
  263. #endif
  264. template<typename _Tp> inline
  265. _InputOutputArray::_InputOutputArray(const std::vector<std::vector<_Tp> >& vec)
  266. { init(FIXED_TYPE + FIXED_SIZE + STD_VECTOR_VECTOR + traits::Type<_Tp>::value + ACCESS_RW, &vec); }
  267. template<typename _Tp> inline
  268. _InputOutputArray::_InputOutputArray(const std::vector<Mat_<_Tp> >& vec)
  269. { init(FIXED_TYPE + FIXED_SIZE + STD_VECTOR_MAT + traits::Type<_Tp>::value + ACCESS_RW, &vec); }
  270. template<typename _Tp> inline
  271. _InputOutputArray::_InputOutputArray(const Mat_<_Tp>& m)
  272. { init(FIXED_TYPE + FIXED_SIZE + MAT + traits::Type<_Tp>::value + ACCESS_RW, &m); }
  273. template<typename _Tp, int m, int n> inline
  274. _InputOutputArray::_InputOutputArray(const Matx<_Tp, m, n>& mtx)
  275. { init(FIXED_TYPE + FIXED_SIZE + MATX + traits::Type<_Tp>::value + ACCESS_RW, &mtx, Size(n, m)); }
  276. template<typename _Tp> inline
  277. _InputOutputArray::_InputOutputArray(const _Tp* vec, int n)
  278. { init(FIXED_TYPE + FIXED_SIZE + MATX + traits::Type<_Tp>::value + ACCESS_RW, vec, Size(n, 1)); }
  279. inline _InputOutputArray::_InputOutputArray(cuda::GpuMat& d_mat)
  280. { init(CUDA_GPU_MAT + ACCESS_RW, &d_mat); }
  281. inline _InputOutputArray::_InputOutputArray(ogl::Buffer& buf)
  282. { init(OPENGL_BUFFER + ACCESS_RW, &buf); }
  283. inline _InputOutputArray::_InputOutputArray(cuda::HostMem& cuda_mem)
  284. { init(CUDA_HOST_MEM + ACCESS_RW, &cuda_mem); }
  285. inline _InputOutputArray::_InputOutputArray(const Mat& m)
  286. { init(FIXED_TYPE + FIXED_SIZE + MAT + ACCESS_RW, &m); }
  287. inline _InputOutputArray::_InputOutputArray(const std::vector<Mat>& vec)
  288. { init(FIXED_SIZE + STD_VECTOR_MAT + ACCESS_RW, &vec); }
  289. inline _InputOutputArray::_InputOutputArray(const UMat& m)
  290. { init(FIXED_TYPE + FIXED_SIZE + UMAT + ACCESS_RW, &m); }
  291. inline _InputOutputArray::_InputOutputArray(const std::vector<UMat>& vec)
  292. { init(FIXED_SIZE + STD_VECTOR_UMAT + ACCESS_RW, &vec); }
  293. inline _InputOutputArray::_InputOutputArray(const cuda::GpuMat& d_mat)
  294. { init(FIXED_TYPE + FIXED_SIZE + CUDA_GPU_MAT + ACCESS_RW, &d_mat); }
  295. inline _InputOutputArray::_InputOutputArray(const std::vector<cuda::GpuMat>& d_mat)
  296. { init(FIXED_TYPE + FIXED_SIZE + STD_VECTOR_CUDA_GPU_MAT + ACCESS_RW, &d_mat);}
  297. template<> inline _InputOutputArray::_InputOutputArray(std::vector<cuda::GpuMat>& d_mat)
  298. { init(FIXED_TYPE + FIXED_SIZE + STD_VECTOR_CUDA_GPU_MAT + ACCESS_RW, &d_mat);}
  299. inline _InputOutputArray::_InputOutputArray(const ogl::Buffer& buf)
  300. { init(FIXED_TYPE + FIXED_SIZE + OPENGL_BUFFER + ACCESS_RW, &buf); }
  301. inline _InputOutputArray::_InputOutputArray(const cuda::HostMem& cuda_mem)
  302. { init(FIXED_TYPE + FIXED_SIZE + CUDA_HOST_MEM + ACCESS_RW, &cuda_mem); }
  303. CV__DEBUG_NS_END
  304. //////////////////////////////////////////// Mat //////////////////////////////////////////
  305. inline
  306. Mat::Mat()
  307. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), data(0), datastart(0), dataend(0),
  308. datalimit(0), allocator(0), u(0), size(&rows), step(0)
  309. {}
  310. inline
  311. Mat::Mat(int _rows, int _cols, int _type)
  312. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), data(0), datastart(0), dataend(0),
  313. datalimit(0), allocator(0), u(0), size(&rows), step(0)
  314. {
  315. create(_rows, _cols, _type);
  316. }
  317. inline
  318. Mat::Mat(int _rows, int _cols, int _type, const Scalar& _s)
  319. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), data(0), datastart(0), dataend(0),
  320. datalimit(0), allocator(0), u(0), size(&rows), step(0)
  321. {
  322. create(_rows, _cols, _type);
  323. *this = _s;
  324. }
  325. inline
  326. Mat::Mat(Size _sz, int _type)
  327. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), data(0), datastart(0), dataend(0),
  328. datalimit(0), allocator(0), u(0), size(&rows), step(0)
  329. {
  330. create( _sz.height, _sz.width, _type );
  331. }
  332. inline
  333. Mat::Mat(Size _sz, int _type, const Scalar& _s)
  334. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), data(0), datastart(0), dataend(0),
  335. datalimit(0), allocator(0), u(0), size(&rows), step(0)
  336. {
  337. create(_sz.height, _sz.width, _type);
  338. *this = _s;
  339. }
  340. inline
  341. Mat::Mat(int _dims, const int* _sz, int _type)
  342. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), data(0), datastart(0), dataend(0),
  343. datalimit(0), allocator(0), u(0), size(&rows), step(0)
  344. {
  345. create(_dims, _sz, _type);
  346. }
  347. inline
  348. Mat::Mat(int _dims, const int* _sz, int _type, const Scalar& _s)
  349. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), data(0), datastart(0), dataend(0),
  350. datalimit(0), allocator(0), u(0), size(&rows), step(0)
  351. {
  352. create(_dims, _sz, _type);
  353. *this = _s;
  354. }
  355. inline
  356. Mat::Mat(const std::vector<int>& _sz, int _type)
  357. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), data(0), datastart(0), dataend(0),
  358. datalimit(0), allocator(0), u(0), size(&rows), step(0)
  359. {
  360. create(_sz, _type);
  361. }
  362. inline
  363. Mat::Mat(const std::vector<int>& _sz, int _type, const Scalar& _s)
  364. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), data(0), datastart(0), dataend(0),
  365. datalimit(0), allocator(0), u(0), size(&rows), step(0)
  366. {
  367. create(_sz, _type);
  368. *this = _s;
  369. }
  370. inline
  371. Mat::Mat(const Mat& m)
  372. : flags(m.flags), dims(m.dims), rows(m.rows), cols(m.cols), data(m.data),
  373. datastart(m.datastart), dataend(m.dataend), datalimit(m.datalimit), allocator(m.allocator),
  374. u(m.u), size(&rows), step(0)
  375. {
  376. if( u )
  377. CV_XADD(&u->refcount, 1);
  378. if( m.dims <= 2 )
  379. {
  380. step[0] = m.step[0]; step[1] = m.step[1];
  381. }
  382. else
  383. {
  384. dims = 0;
  385. copySize(m);
  386. }
  387. }
  388. inline
  389. Mat::Mat(int _rows, int _cols, int _type, void* _data, size_t _step)
  390. : flags(MAGIC_VAL + (_type & TYPE_MASK)), dims(2), rows(_rows), cols(_cols),
  391. data((uchar*)_data), datastart((uchar*)_data), dataend(0), datalimit(0),
  392. allocator(0), u(0), size(&rows)
  393. {
  394. CV_Assert(total() == 0 || data != NULL);
  395. size_t esz = CV_ELEM_SIZE(_type), esz1 = CV_ELEM_SIZE1(_type);
  396. size_t minstep = cols * esz;
  397. if( _step == AUTO_STEP )
  398. {
  399. _step = minstep;
  400. flags |= CONTINUOUS_FLAG;
  401. }
  402. else
  403. {
  404. if( rows == 1 ) _step = minstep;
  405. CV_DbgAssert( _step >= minstep );
  406. if (_step % esz1 != 0)
  407. {
  408. CV_Error(Error::BadStep, "Step must be a multiple of esz1");
  409. }
  410. flags |= _step == minstep ? CONTINUOUS_FLAG : 0;
  411. }
  412. step[0] = _step;
  413. step[1] = esz;
  414. datalimit = datastart + _step * rows;
  415. dataend = datalimit - _step + minstep;
  416. }
  417. inline
  418. Mat::Mat(Size _sz, int _type, void* _data, size_t _step)
  419. : flags(MAGIC_VAL + (_type & TYPE_MASK)), dims(2), rows(_sz.height), cols(_sz.width),
  420. data((uchar*)_data), datastart((uchar*)_data), dataend(0), datalimit(0),
  421. allocator(0), u(0), size(&rows)
  422. {
  423. CV_Assert(total() == 0 || data != NULL);
  424. size_t esz = CV_ELEM_SIZE(_type), esz1 = CV_ELEM_SIZE1(_type);
  425. size_t minstep = cols*esz;
  426. if( _step == AUTO_STEP )
  427. {
  428. _step = minstep;
  429. flags |= CONTINUOUS_FLAG;
  430. }
  431. else
  432. {
  433. if( rows == 1 ) _step = minstep;
  434. CV_DbgAssert( _step >= minstep );
  435. if (_step % esz1 != 0)
  436. {
  437. CV_Error(Error::BadStep, "Step must be a multiple of esz1");
  438. }
  439. flags |= _step == minstep ? CONTINUOUS_FLAG : 0;
  440. }
  441. step[0] = _step;
  442. step[1] = esz;
  443. datalimit = datastart + _step*rows;
  444. dataend = datalimit - _step + minstep;
  445. }
  446. template<typename _Tp> inline
  447. Mat::Mat(const std::vector<_Tp>& vec, bool copyData)
  448. : flags(MAGIC_VAL | traits::Type<_Tp>::value | CV_MAT_CONT_FLAG), dims(2), rows((int)vec.size()),
  449. cols(1), data(0), datastart(0), dataend(0), datalimit(0), allocator(0), u(0), size(&rows), step(0)
  450. {
  451. if(vec.empty())
  452. return;
  453. if( !copyData )
  454. {
  455. step[0] = step[1] = sizeof(_Tp);
  456. datastart = data = (uchar*)&vec[0];
  457. datalimit = dataend = datastart + rows * step[0];
  458. }
  459. else
  460. Mat((int)vec.size(), 1, traits::Type<_Tp>::value, (uchar*)&vec[0]).copyTo(*this);
  461. }
  462. #ifdef CV_CXX11
  463. template<typename _Tp, typename> inline
  464. Mat::Mat(const std::initializer_list<_Tp> list)
  465. : flags(MAGIC_VAL | traits::Type<_Tp>::value | CV_MAT_CONT_FLAG), dims(2), rows((int)list.size()),
  466. cols(1), data(0), datastart(0), dataend(0), datalimit(0), allocator(0), u(0), size(&rows), step(0)
  467. {
  468. if(list.size() == 0)
  469. return;
  470. Mat((int)list.size(), 1, traits::Type<_Tp>::value, (uchar*)list.begin()).copyTo(*this);
  471. }
  472. #endif
  473. #ifdef CV_CXX_STD_ARRAY
  474. template<typename _Tp, std::size_t _Nm> inline
  475. Mat::Mat(const std::array<_Tp, _Nm>& arr, bool copyData)
  476. : flags(MAGIC_VAL | traits::Type<_Tp>::value | CV_MAT_CONT_FLAG), dims(2), rows((int)arr.size()),
  477. cols(1), data(0), datastart(0), dataend(0), datalimit(0), allocator(0), u(0), size(&rows), step(0)
  478. {
  479. if(arr.empty())
  480. return;
  481. if( !copyData )
  482. {
  483. step[0] = step[1] = sizeof(_Tp);
  484. datastart = data = (uchar*)arr.data();
  485. datalimit = dataend = datastart + rows * step[0];
  486. }
  487. else
  488. Mat((int)arr.size(), 1, traits::Type<_Tp>::value, (uchar*)arr.data()).copyTo(*this);
  489. }
  490. #endif
  491. template<typename _Tp, int n> inline
  492. Mat::Mat(const Vec<_Tp, n>& vec, bool copyData)
  493. : flags(MAGIC_VAL | traits::Type<_Tp>::value | CV_MAT_CONT_FLAG), dims(2), rows(n), cols(1), data(0),
  494. datastart(0), dataend(0), datalimit(0), allocator(0), u(0), size(&rows), step(0)
  495. {
  496. if( !copyData )
  497. {
  498. step[0] = step[1] = sizeof(_Tp);
  499. datastart = data = (uchar*)vec.val;
  500. datalimit = dataend = datastart + rows * step[0];
  501. }
  502. else
  503. Mat(n, 1, traits::Type<_Tp>::value, (void*)vec.val).copyTo(*this);
  504. }
  505. template<typename _Tp, int m, int n> inline
  506. Mat::Mat(const Matx<_Tp,m,n>& M, bool copyData)
  507. : flags(MAGIC_VAL | traits::Type<_Tp>::value | CV_MAT_CONT_FLAG), dims(2), rows(m), cols(n), data(0),
  508. datastart(0), dataend(0), datalimit(0), allocator(0), u(0), size(&rows), step(0)
  509. {
  510. if( !copyData )
  511. {
  512. step[0] = cols * sizeof(_Tp);
  513. step[1] = sizeof(_Tp);
  514. datastart = data = (uchar*)M.val;
  515. datalimit = dataend = datastart + rows * step[0];
  516. }
  517. else
  518. Mat(m, n, traits::Type<_Tp>::value, (uchar*)M.val).copyTo(*this);
  519. }
  520. template<typename _Tp> inline
  521. Mat::Mat(const Point_<_Tp>& pt, bool copyData)
  522. : flags(MAGIC_VAL | traits::Type<_Tp>::value | CV_MAT_CONT_FLAG), dims(2), rows(2), cols(1), data(0),
  523. datastart(0), dataend(0), datalimit(0), allocator(0), u(0), size(&rows), step(0)
  524. {
  525. if( !copyData )
  526. {
  527. step[0] = step[1] = sizeof(_Tp);
  528. datastart = data = (uchar*)&pt.x;
  529. datalimit = dataend = datastart + rows * step[0];
  530. }
  531. else
  532. {
  533. create(2, 1, traits::Type<_Tp>::value);
  534. ((_Tp*)data)[0] = pt.x;
  535. ((_Tp*)data)[1] = pt.y;
  536. }
  537. }
  538. template<typename _Tp> inline
  539. Mat::Mat(const Point3_<_Tp>& pt, bool copyData)
  540. : flags(MAGIC_VAL | traits::Type<_Tp>::value | CV_MAT_CONT_FLAG), dims(2), rows(3), cols(1), data(0),
  541. datastart(0), dataend(0), datalimit(0), allocator(0), u(0), size(&rows), step(0)
  542. {
  543. if( !copyData )
  544. {
  545. step[0] = step[1] = sizeof(_Tp);
  546. datastart = data = (uchar*)&pt.x;
  547. datalimit = dataend = datastart + rows * step[0];
  548. }
  549. else
  550. {
  551. create(3, 1, traits::Type<_Tp>::value);
  552. ((_Tp*)data)[0] = pt.x;
  553. ((_Tp*)data)[1] = pt.y;
  554. ((_Tp*)data)[2] = pt.z;
  555. }
  556. }
  557. template<typename _Tp> inline
  558. Mat::Mat(const MatCommaInitializer_<_Tp>& commaInitializer)
  559. : flags(MAGIC_VAL | traits::Type<_Tp>::value | CV_MAT_CONT_FLAG), dims(0), rows(0), cols(0), data(0),
  560. datastart(0), dataend(0), allocator(0), u(0), size(&rows)
  561. {
  562. *this = commaInitializer.operator Mat_<_Tp>();
  563. }
  564. inline
  565. Mat::~Mat()
  566. {
  567. release();
  568. if( step.p != step.buf )
  569. fastFree(step.p);
  570. }
  571. inline
  572. Mat& Mat::operator = (const Mat& m)
  573. {
  574. if( this != &m )
  575. {
  576. if( m.u )
  577. CV_XADD(&m.u->refcount, 1);
  578. release();
  579. flags = m.flags;
  580. if( dims <= 2 && m.dims <= 2 )
  581. {
  582. dims = m.dims;
  583. rows = m.rows;
  584. cols = m.cols;
  585. step[0] = m.step[0];
  586. step[1] = m.step[1];
  587. }
  588. else
  589. copySize(m);
  590. data = m.data;
  591. datastart = m.datastart;
  592. dataend = m.dataend;
  593. datalimit = m.datalimit;
  594. allocator = m.allocator;
  595. u = m.u;
  596. }
  597. return *this;
  598. }
  599. inline
  600. Mat Mat::row(int y) const
  601. {
  602. return Mat(*this, Range(y, y + 1), Range::all());
  603. }
  604. inline
  605. Mat Mat::col(int x) const
  606. {
  607. return Mat(*this, Range::all(), Range(x, x + 1));
  608. }
  609. inline
  610. Mat Mat::rowRange(int startrow, int endrow) const
  611. {
  612. return Mat(*this, Range(startrow, endrow), Range::all());
  613. }
  614. inline
  615. Mat Mat::rowRange(const Range& r) const
  616. {
  617. return Mat(*this, r, Range::all());
  618. }
  619. inline
  620. Mat Mat::colRange(int startcol, int endcol) const
  621. {
  622. return Mat(*this, Range::all(), Range(startcol, endcol));
  623. }
  624. inline
  625. Mat Mat::colRange(const Range& r) const
  626. {
  627. return Mat(*this, Range::all(), r);
  628. }
  629. inline
  630. Mat Mat::clone() const
  631. {
  632. Mat m;
  633. copyTo(m);
  634. return m;
  635. }
  636. inline
  637. void Mat::assignTo( Mat& m, int _type ) const
  638. {
  639. if( _type < 0 )
  640. m = *this;
  641. else
  642. convertTo(m, _type);
  643. }
  644. inline
  645. void Mat::create(int _rows, int _cols, int _type)
  646. {
  647. _type &= TYPE_MASK;
  648. if( dims <= 2 && rows == _rows && cols == _cols && type() == _type && data )
  649. return;
  650. int sz[] = {_rows, _cols};
  651. create(2, sz, _type);
  652. }
  653. inline
  654. void Mat::create(Size _sz, int _type)
  655. {
  656. create(_sz.height, _sz.width, _type);
  657. }
  658. inline
  659. void Mat::addref()
  660. {
  661. if( u )
  662. CV_XADD(&u->refcount, 1);
  663. }
  664. inline
  665. void Mat::release()
  666. {
  667. if( u && CV_XADD(&u->refcount, -1) == 1 )
  668. deallocate();
  669. u = NULL;
  670. datastart = dataend = datalimit = data = 0;
  671. for(int i = 0; i < dims; i++)
  672. size.p[i] = 0;
  673. #ifdef _DEBUG
  674. flags = MAGIC_VAL;
  675. dims = rows = cols = 0;
  676. if(step.p != step.buf)
  677. {
  678. fastFree(step.p);
  679. step.p = step.buf;
  680. size.p = &rows;
  681. }
  682. #endif
  683. }
  684. inline
  685. Mat Mat::operator()( Range _rowRange, Range _colRange ) const
  686. {
  687. return Mat(*this, _rowRange, _colRange);
  688. }
  689. inline
  690. Mat Mat::operator()( const Rect& roi ) const
  691. {
  692. return Mat(*this, roi);
  693. }
  694. inline
  695. Mat Mat::operator()(const Range* ranges) const
  696. {
  697. return Mat(*this, ranges);
  698. }
  699. inline
  700. Mat Mat::operator()(const std::vector<Range>& ranges) const
  701. {
  702. return Mat(*this, ranges);
  703. }
  704. inline
  705. bool Mat::isContinuous() const
  706. {
  707. return (flags & CONTINUOUS_FLAG) != 0;
  708. }
  709. inline
  710. bool Mat::isSubmatrix() const
  711. {
  712. return (flags & SUBMATRIX_FLAG) != 0;
  713. }
  714. inline
  715. size_t Mat::elemSize() const
  716. {
  717. return dims > 0 ? step.p[dims - 1] : 0;
  718. }
  719. inline
  720. size_t Mat::elemSize1() const
  721. {
  722. return CV_ELEM_SIZE1(flags);
  723. }
  724. inline
  725. int Mat::type() const
  726. {
  727. return CV_MAT_TYPE(flags);
  728. }
  729. inline
  730. int Mat::depth() const
  731. {
  732. return CV_MAT_DEPTH(flags);
  733. }
  734. inline
  735. int Mat::channels() const
  736. {
  737. return CV_MAT_CN(flags);
  738. }
  739. inline
  740. size_t Mat::step1(int i) const
  741. {
  742. return step.p[i] / elemSize1();
  743. }
  744. inline
  745. bool Mat::empty() const
  746. {
  747. return data == 0 || total() == 0 || dims == 0;
  748. }
  749. inline
  750. size_t Mat::total() const
  751. {
  752. if( dims <= 2 )
  753. return (size_t)rows * cols;
  754. size_t p = 1;
  755. for( int i = 0; i < dims; i++ )
  756. p *= size[i];
  757. return p;
  758. }
  759. inline
  760. size_t Mat::total(int startDim, int endDim) const
  761. {
  762. CV_Assert( 0 <= startDim && startDim <= endDim);
  763. size_t p = 1;
  764. int endDim_ = endDim <= dims ? endDim : dims;
  765. for( int i = startDim; i < endDim_; i++ )
  766. p *= size[i];
  767. return p;
  768. }
  769. inline
  770. uchar* Mat::ptr(int y)
  771. {
  772. CV_DbgAssert( y == 0 || (data && dims >= 1 && (unsigned)y < (unsigned)size.p[0]) );
  773. return data + step.p[0] * y;
  774. }
  775. inline
  776. const uchar* Mat::ptr(int y) const
  777. {
  778. CV_DbgAssert( y == 0 || (data && dims >= 1 && (unsigned)y < (unsigned)size.p[0]) );
  779. return data + step.p[0] * y;
  780. }
  781. template<typename _Tp> inline
  782. _Tp* Mat::ptr(int y)
  783. {
  784. CV_DbgAssert( y == 0 || (data && dims >= 1 && (unsigned)y < (unsigned)size.p[0]) );
  785. return (_Tp*)(data + step.p[0] * y);
  786. }
  787. template<typename _Tp> inline
  788. const _Tp* Mat::ptr(int y) const
  789. {
  790. CV_DbgAssert( y == 0 || (data && dims >= 1 && data && (unsigned)y < (unsigned)size.p[0]) );
  791. return (const _Tp*)(data + step.p[0] * y);
  792. }
  793. inline
  794. uchar* Mat::ptr(int i0, int i1)
  795. {
  796. CV_DbgAssert(dims >= 2);
  797. CV_DbgAssert(data);
  798. CV_DbgAssert((unsigned)i0 < (unsigned)size.p[0]);
  799. CV_DbgAssert((unsigned)i1 < (unsigned)size.p[1]);
  800. return data + i0 * step.p[0] + i1 * step.p[1];
  801. }
  802. inline
  803. const uchar* Mat::ptr(int i0, int i1) const
  804. {
  805. CV_DbgAssert(dims >= 2);
  806. CV_DbgAssert(data);
  807. CV_DbgAssert((unsigned)i0 < (unsigned)size.p[0]);
  808. CV_DbgAssert((unsigned)i1 < (unsigned)size.p[1]);
  809. return data + i0 * step.p[0] + i1 * step.p[1];
  810. }
  811. template<typename _Tp> inline
  812. _Tp* Mat::ptr(int i0, int i1)
  813. {
  814. CV_DbgAssert(dims >= 2);
  815. CV_DbgAssert(data);
  816. CV_DbgAssert((unsigned)i0 < (unsigned)size.p[0]);
  817. CV_DbgAssert((unsigned)i1 < (unsigned)size.p[1]);
  818. return (_Tp*)(data + i0 * step.p[0] + i1 * step.p[1]);
  819. }
  820. template<typename _Tp> inline
  821. const _Tp* Mat::ptr(int i0, int i1) const
  822. {
  823. CV_DbgAssert(dims >= 2);
  824. CV_DbgAssert(data);
  825. CV_DbgAssert((unsigned)i0 < (unsigned)size.p[0]);
  826. CV_DbgAssert((unsigned)i1 < (unsigned)size.p[1]);
  827. return (const _Tp*)(data + i0 * step.p[0] + i1 * step.p[1]);
  828. }
  829. inline
  830. uchar* Mat::ptr(int i0, int i1, int i2)
  831. {
  832. CV_DbgAssert(dims >= 3);
  833. CV_DbgAssert(data);
  834. CV_DbgAssert((unsigned)i0 < (unsigned)size.p[0]);
  835. CV_DbgAssert((unsigned)i1 < (unsigned)size.p[1]);
  836. CV_DbgAssert((unsigned)i2 < (unsigned)size.p[2]);
  837. return data + i0 * step.p[0] + i1 * step.p[1] + i2 * step.p[2];
  838. }
  839. inline
  840. const uchar* Mat::ptr(int i0, int i1, int i2) const
  841. {
  842. CV_DbgAssert(dims >= 3);
  843. CV_DbgAssert(data);
  844. CV_DbgAssert((unsigned)i0 < (unsigned)size.p[0]);
  845. CV_DbgAssert((unsigned)i1 < (unsigned)size.p[1]);
  846. CV_DbgAssert((unsigned)i2 < (unsigned)size.p[2]);
  847. return data + i0 * step.p[0] + i1 * step.p[1] + i2 * step.p[2];
  848. }
  849. template<typename _Tp> inline
  850. _Tp* Mat::ptr(int i0, int i1, int i2)
  851. {
  852. CV_DbgAssert(dims >= 3);
  853. CV_DbgAssert(data);
  854. CV_DbgAssert((unsigned)i0 < (unsigned)size.p[0]);
  855. CV_DbgAssert((unsigned)i1 < (unsigned)size.p[1]);
  856. CV_DbgAssert((unsigned)i2 < (unsigned)size.p[2]);
  857. return (_Tp*)(data + i0 * step.p[0] + i1 * step.p[1] + i2 * step.p[2]);
  858. }
  859. template<typename _Tp> inline
  860. const _Tp* Mat::ptr(int i0, int i1, int i2) const
  861. {
  862. CV_DbgAssert(dims >= 3);
  863. CV_DbgAssert(data);
  864. CV_DbgAssert((unsigned)i0 < (unsigned)size.p[0]);
  865. CV_DbgAssert((unsigned)i1 < (unsigned)size.p[1]);
  866. CV_DbgAssert((unsigned)i2 < (unsigned)size.p[2]);
  867. return (const _Tp*)(data + i0 * step.p[0] + i1 * step.p[1] + i2 * step.p[2]);
  868. }
  869. inline
  870. uchar* Mat::ptr(const int* idx)
  871. {
  872. int i, d = dims;
  873. uchar* p = data;
  874. CV_DbgAssert( d >= 1 && p );
  875. for( i = 0; i < d; i++ )
  876. {
  877. CV_DbgAssert( (unsigned)idx[i] < (unsigned)size.p[i] );
  878. p += idx[i] * step.p[i];
  879. }
  880. return p;
  881. }
  882. inline
  883. const uchar* Mat::ptr(const int* idx) const
  884. {
  885. int i, d = dims;
  886. uchar* p = data;
  887. CV_DbgAssert( d >= 1 && p );
  888. for( i = 0; i < d; i++ )
  889. {
  890. CV_DbgAssert( (unsigned)idx[i] < (unsigned)size.p[i] );
  891. p += idx[i] * step.p[i];
  892. }
  893. return p;
  894. }
  895. template<typename _Tp> inline
  896. _Tp* Mat::ptr(const int* idx)
  897. {
  898. int i, d = dims;
  899. uchar* p = data;
  900. CV_DbgAssert( d >= 1 && p );
  901. for( i = 0; i < d; i++ )
  902. {
  903. CV_DbgAssert( (unsigned)idx[i] < (unsigned)size.p[i] );
  904. p += idx[i] * step.p[i];
  905. }
  906. return (_Tp*)p;
  907. }
  908. template<typename _Tp> inline
  909. const _Tp* Mat::ptr(const int* idx) const
  910. {
  911. int i, d = dims;
  912. uchar* p = data;
  913. CV_DbgAssert( d >= 1 && p );
  914. for( i = 0; i < d; i++ )
  915. {
  916. CV_DbgAssert( (unsigned)idx[i] < (unsigned)size.p[i] );
  917. p += idx[i] * step.p[i];
  918. }
  919. return (const _Tp*)p;
  920. }
  921. template<typename _Tp> inline
  922. _Tp& Mat::at(int i0, int i1)
  923. {
  924. CV_DbgAssert(dims <= 2);
  925. CV_DbgAssert(data);
  926. CV_DbgAssert((unsigned)i0 < (unsigned)size.p[0]);
  927. CV_DbgAssert((unsigned)(i1 * DataType<_Tp>::channels) < (unsigned)(size.p[1] * channels()));
  928. CV_DbgAssert(CV_ELEM_SIZE1(traits::Depth<_Tp>::value) == elemSize1());
  929. return ((_Tp*)(data + step.p[0] * i0))[i1];
  930. }
  931. template<typename _Tp> inline
  932. const _Tp& Mat::at(int i0, int i1) const
  933. {
  934. CV_DbgAssert(dims <= 2);
  935. CV_DbgAssert(data);
  936. CV_DbgAssert((unsigned)i0 < (unsigned)size.p[0]);
  937. CV_DbgAssert((unsigned)(i1 * DataType<_Tp>::channels) < (unsigned)(size.p[1] * channels()));
  938. CV_DbgAssert(CV_ELEM_SIZE1(traits::Depth<_Tp>::value) == elemSize1());
  939. return ((const _Tp*)(data + step.p[0] * i0))[i1];
  940. }
  941. template<typename _Tp> inline
  942. _Tp& Mat::at(Point pt)
  943. {
  944. CV_DbgAssert(dims <= 2);
  945. CV_DbgAssert(data);
  946. CV_DbgAssert((unsigned)pt.y < (unsigned)size.p[0]);
  947. CV_DbgAssert((unsigned)(pt.x * DataType<_Tp>::channels) < (unsigned)(size.p[1] * channels()));
  948. CV_DbgAssert(CV_ELEM_SIZE1(traits::Depth<_Tp>::value) == elemSize1());
  949. return ((_Tp*)(data + step.p[0] * pt.y))[pt.x];
  950. }
  951. template<typename _Tp> inline
  952. const _Tp& Mat::at(Point pt) const
  953. {
  954. CV_DbgAssert(dims <= 2);
  955. CV_DbgAssert(data);
  956. CV_DbgAssert((unsigned)pt.y < (unsigned)size.p[0]);
  957. CV_DbgAssert((unsigned)(pt.x * DataType<_Tp>::channels) < (unsigned)(size.p[1] * channels()));
  958. CV_DbgAssert(CV_ELEM_SIZE1(traits::Depth<_Tp>::value) == elemSize1());
  959. return ((const _Tp*)(data + step.p[0] * pt.y))[pt.x];
  960. }
  961. template<typename _Tp> inline
  962. _Tp& Mat::at(int i0)
  963. {
  964. CV_DbgAssert(dims <= 2);
  965. CV_DbgAssert(data);
  966. CV_DbgAssert((unsigned)i0 < (unsigned)(size.p[0] * size.p[1]));
  967. CV_DbgAssert(elemSize() == sizeof(_Tp));
  968. if( isContinuous() || size.p[0] == 1 )
  969. return ((_Tp*)data)[i0];
  970. if( size.p[1] == 1 )
  971. return *(_Tp*)(data + step.p[0] * i0);
  972. int i = i0 / cols, j = i0 - i * cols;
  973. return ((_Tp*)(data + step.p[0] * i))[j];
  974. }
  975. template<typename _Tp> inline
  976. const _Tp& Mat::at(int i0) const
  977. {
  978. CV_DbgAssert(dims <= 2);
  979. CV_DbgAssert(data);
  980. CV_DbgAssert((unsigned)i0 < (unsigned)(size.p[0] * size.p[1]));
  981. CV_DbgAssert(elemSize() == sizeof(_Tp));
  982. if( isContinuous() || size.p[0] == 1 )
  983. return ((const _Tp*)data)[i0];
  984. if( size.p[1] == 1 )
  985. return *(const _Tp*)(data + step.p[0] * i0);
  986. int i = i0 / cols, j = i0 - i * cols;
  987. return ((const _Tp*)(data + step.p[0] * i))[j];
  988. }
  989. template<typename _Tp> inline
  990. _Tp& Mat::at(int i0, int i1, int i2)
  991. {
  992. CV_DbgAssert( elemSize() == sizeof(_Tp) );
  993. return *(_Tp*)ptr(i0, i1, i2);
  994. }
  995. template<typename _Tp> inline
  996. const _Tp& Mat::at(int i0, int i1, int i2) const
  997. {
  998. CV_DbgAssert( elemSize() == sizeof(_Tp) );
  999. return *(const _Tp*)ptr(i0, i1, i2);
  1000. }
  1001. template<typename _Tp> inline
  1002. _Tp& Mat::at(const int* idx)
  1003. {
  1004. CV_DbgAssert( elemSize() == sizeof(_Tp) );
  1005. return *(_Tp*)ptr(idx);
  1006. }
  1007. template<typename _Tp> inline
  1008. const _Tp& Mat::at(const int* idx) const
  1009. {
  1010. CV_DbgAssert( elemSize() == sizeof(_Tp) );
  1011. return *(const _Tp*)ptr(idx);
  1012. }
  1013. template<typename _Tp, int n> inline
  1014. _Tp& Mat::at(const Vec<int, n>& idx)
  1015. {
  1016. CV_DbgAssert( elemSize() == sizeof(_Tp) );
  1017. return *(_Tp*)ptr(idx.val);
  1018. }
  1019. template<typename _Tp, int n> inline
  1020. const _Tp& Mat::at(const Vec<int, n>& idx) const
  1021. {
  1022. CV_DbgAssert( elemSize() == sizeof(_Tp) );
  1023. return *(const _Tp*)ptr(idx.val);
  1024. }
  1025. template<typename _Tp> inline
  1026. MatConstIterator_<_Tp> Mat::begin() const
  1027. {
  1028. CV_DbgAssert( elemSize() == sizeof(_Tp) );
  1029. return MatConstIterator_<_Tp>((const Mat_<_Tp>*)this);
  1030. }
  1031. template<typename _Tp> inline
  1032. MatConstIterator_<_Tp> Mat::end() const
  1033. {
  1034. CV_DbgAssert( elemSize() == sizeof(_Tp) );
  1035. MatConstIterator_<_Tp> it((const Mat_<_Tp>*)this);
  1036. it += total();
  1037. return it;
  1038. }
  1039. template<typename _Tp> inline
  1040. MatIterator_<_Tp> Mat::begin()
  1041. {
  1042. CV_DbgAssert( elemSize() == sizeof(_Tp) );
  1043. return MatIterator_<_Tp>((Mat_<_Tp>*)this);
  1044. }
  1045. template<typename _Tp> inline
  1046. MatIterator_<_Tp> Mat::end()
  1047. {
  1048. CV_DbgAssert( elemSize() == sizeof(_Tp) );
  1049. MatIterator_<_Tp> it((Mat_<_Tp>*)this);
  1050. it += total();
  1051. return it;
  1052. }
  1053. template<typename _Tp, typename Functor> inline
  1054. void Mat::forEach(const Functor& operation) {
  1055. this->forEach_impl<_Tp>(operation);
  1056. }
  1057. template<typename _Tp, typename Functor> inline
  1058. void Mat::forEach(const Functor& operation) const {
  1059. // call as not const
  1060. (const_cast<Mat*>(this))->forEach<_Tp>(operation);
  1061. }
  1062. template<typename _Tp> inline
  1063. Mat::operator std::vector<_Tp>() const
  1064. {
  1065. std::vector<_Tp> v;
  1066. copyTo(v);
  1067. return v;
  1068. }
  1069. #ifdef CV_CXX_STD_ARRAY
  1070. template<typename _Tp, std::size_t _Nm> inline
  1071. Mat::operator std::array<_Tp, _Nm>() const
  1072. {
  1073. std::array<_Tp, _Nm> v;
  1074. copyTo(v);
  1075. return v;
  1076. }
  1077. #endif
  1078. template<typename _Tp, int n> inline
  1079. Mat::operator Vec<_Tp, n>() const
  1080. {
  1081. CV_Assert( data && dims <= 2 && (rows == 1 || cols == 1) &&
  1082. rows + cols - 1 == n && channels() == 1 );
  1083. if( isContinuous() && type() == traits::Type<_Tp>::value )
  1084. return Vec<_Tp, n>((_Tp*)data);
  1085. Vec<_Tp, n> v;
  1086. Mat tmp(rows, cols, traits::Type<_Tp>::value, v.val);
  1087. convertTo(tmp, tmp.type());
  1088. return v;
  1089. }
  1090. template<typename _Tp, int m, int n> inline
  1091. Mat::operator Matx<_Tp, m, n>() const
  1092. {
  1093. CV_Assert( data && dims <= 2 && rows == m && cols == n && channels() == 1 );
  1094. if( isContinuous() && type() == traits::Type<_Tp>::value )
  1095. return Matx<_Tp, m, n>((_Tp*)data);
  1096. Matx<_Tp, m, n> mtx;
  1097. Mat tmp(rows, cols, traits::Type<_Tp>::value, mtx.val);
  1098. convertTo(tmp, tmp.type());
  1099. return mtx;
  1100. }
  1101. template<typename _Tp> inline
  1102. void Mat::push_back(const _Tp& elem)
  1103. {
  1104. if( !data )
  1105. {
  1106. *this = Mat(1, 1, traits::Type<_Tp>::value, (void*)&elem).clone();
  1107. return;
  1108. }
  1109. CV_Assert(traits::Type<_Tp>::value == type() && cols == 1
  1110. /* && dims == 2 (cols == 1 implies dims == 2) */);
  1111. const uchar* tmp = dataend + step[0];
  1112. if( !isSubmatrix() && isContinuous() && tmp <= datalimit )
  1113. {
  1114. *(_Tp*)(data + (size.p[0]++) * step.p[0]) = elem;
  1115. dataend = tmp;
  1116. }
  1117. else
  1118. push_back_(&elem);
  1119. }
  1120. template<typename _Tp> inline
  1121. void Mat::push_back(const Mat_<_Tp>& m)
  1122. {
  1123. push_back((const Mat&)m);
  1124. }
  1125. template<> inline
  1126. void Mat::push_back(const MatExpr& expr)
  1127. {
  1128. push_back(static_cast<Mat>(expr));
  1129. }
  1130. template<typename _Tp> inline
  1131. void Mat::push_back(const std::vector<_Tp>& v)
  1132. {
  1133. push_back(Mat(v));
  1134. }
  1135. #ifdef CV_CXX_MOVE_SEMANTICS
  1136. inline
  1137. Mat::Mat(Mat&& m)
  1138. : flags(m.flags), dims(m.dims), rows(m.rows), cols(m.cols), data(m.data),
  1139. datastart(m.datastart), dataend(m.dataend), datalimit(m.datalimit), allocator(m.allocator),
  1140. u(m.u), size(&rows)
  1141. {
  1142. if (m.dims <= 2) // move new step/size info
  1143. {
  1144. step[0] = m.step[0];
  1145. step[1] = m.step[1];
  1146. }
  1147. else
  1148. {
  1149. CV_DbgAssert(m.step.p != m.step.buf);
  1150. step.p = m.step.p;
  1151. size.p = m.size.p;
  1152. m.step.p = m.step.buf;
  1153. m.size.p = &m.rows;
  1154. }
  1155. m.flags = MAGIC_VAL; m.dims = m.rows = m.cols = 0;
  1156. m.data = NULL; m.datastart = NULL; m.dataend = NULL; m.datalimit = NULL;
  1157. m.allocator = NULL;
  1158. m.u = NULL;
  1159. }
  1160. inline
  1161. Mat& Mat::operator = (Mat&& m)
  1162. {
  1163. if (this == &m)
  1164. return *this;
  1165. release();
  1166. flags = m.flags; dims = m.dims; rows = m.rows; cols = m.cols; data = m.data;
  1167. datastart = m.datastart; dataend = m.dataend; datalimit = m.datalimit; allocator = m.allocator;
  1168. u = m.u;
  1169. if (step.p != step.buf) // release self step/size
  1170. {
  1171. fastFree(step.p);
  1172. step.p = step.buf;
  1173. size.p = &rows;
  1174. }
  1175. if (m.dims <= 2) // move new step/size info
  1176. {
  1177. step[0] = m.step[0];
  1178. step[1] = m.step[1];
  1179. }
  1180. else
  1181. {
  1182. CV_DbgAssert(m.step.p != m.step.buf);
  1183. step.p = m.step.p;
  1184. size.p = m.size.p;
  1185. m.step.p = m.step.buf;
  1186. m.size.p = &m.rows;
  1187. }
  1188. m.flags = MAGIC_VAL; m.dims = m.rows = m.cols = 0;
  1189. m.data = NULL; m.datastart = NULL; m.dataend = NULL; m.datalimit = NULL;
  1190. m.allocator = NULL;
  1191. m.u = NULL;
  1192. return *this;
  1193. }
  1194. #endif
  1195. ///////////////////////////// MatSize ////////////////////////////
  1196. inline
  1197. MatSize::MatSize(int* _p)
  1198. : p(_p) {}
  1199. inline
  1200. Size MatSize::operator()() const
  1201. {
  1202. CV_DbgAssert(p[-1] <= 2);
  1203. return Size(p[1], p[0]);
  1204. }
  1205. inline
  1206. const int& MatSize::operator[](int i) const
  1207. {
  1208. return p[i];
  1209. }
  1210. inline
  1211. int& MatSize::operator[](int i)
  1212. {
  1213. return p[i];
  1214. }
  1215. inline
  1216. MatSize::operator const int*() const
  1217. {
  1218. return p;
  1219. }
  1220. inline
  1221. bool MatSize::operator == (const MatSize& sz) const
  1222. {
  1223. int d = p[-1];
  1224. int dsz = sz.p[-1];
  1225. if( d != dsz )
  1226. return false;
  1227. if( d == 2 )
  1228. return p[0] == sz.p[0] && p[1] == sz.p[1];
  1229. for( int i = 0; i < d; i++ )
  1230. if( p[i] != sz.p[i] )
  1231. return false;
  1232. return true;
  1233. }
  1234. inline
  1235. bool MatSize::operator != (const MatSize& sz) const
  1236. {
  1237. return !(*this == sz);
  1238. }
  1239. ///////////////////////////// MatStep ////////////////////////////
  1240. inline
  1241. MatStep::MatStep()
  1242. {
  1243. p = buf; p[0] = p[1] = 0;
  1244. }
  1245. inline
  1246. MatStep::MatStep(size_t s)
  1247. {
  1248. p = buf; p[0] = s; p[1] = 0;
  1249. }
  1250. inline
  1251. const size_t& MatStep::operator[](int i) const
  1252. {
  1253. return p[i];
  1254. }
  1255. inline
  1256. size_t& MatStep::operator[](int i)
  1257. {
  1258. return p[i];
  1259. }
  1260. inline MatStep::operator size_t() const
  1261. {
  1262. CV_DbgAssert( p == buf );
  1263. return buf[0];
  1264. }
  1265. inline MatStep& MatStep::operator = (size_t s)
  1266. {
  1267. CV_DbgAssert( p == buf );
  1268. buf[0] = s;
  1269. return *this;
  1270. }
  1271. ////////////////////////////// Mat_<_Tp> ////////////////////////////
  1272. template<typename _Tp> inline
  1273. Mat_<_Tp>::Mat_()
  1274. : Mat()
  1275. {
  1276. flags = (flags & ~CV_MAT_TYPE_MASK) | traits::Type<_Tp>::value;
  1277. }
  1278. template<typename _Tp> inline
  1279. Mat_<_Tp>::Mat_(int _rows, int _cols)
  1280. : Mat(_rows, _cols, traits::Type<_Tp>::value)
  1281. {
  1282. }
  1283. template<typename _Tp> inline
  1284. Mat_<_Tp>::Mat_(int _rows, int _cols, const _Tp& value)
  1285. : Mat(_rows, _cols, traits::Type<_Tp>::value)
  1286. {
  1287. *this = value;
  1288. }
  1289. template<typename _Tp> inline
  1290. Mat_<_Tp>::Mat_(Size _sz)
  1291. : Mat(_sz.height, _sz.width, traits::Type<_Tp>::value)
  1292. {}
  1293. template<typename _Tp> inline
  1294. Mat_<_Tp>::Mat_(Size _sz, const _Tp& value)
  1295. : Mat(_sz.height, _sz.width, traits::Type<_Tp>::value)
  1296. {
  1297. *this = value;
  1298. }
  1299. template<typename _Tp> inline
  1300. Mat_<_Tp>::Mat_(int _dims, const int* _sz)
  1301. : Mat(_dims, _sz, traits::Type<_Tp>::value)
  1302. {}
  1303. template<typename _Tp> inline
  1304. Mat_<_Tp>::Mat_(int _dims, const int* _sz, const _Tp& _s)
  1305. : Mat(_dims, _sz, traits::Type<_Tp>::value, Scalar(_s))
  1306. {}
  1307. template<typename _Tp> inline
  1308. Mat_<_Tp>::Mat_(int _dims, const int* _sz, _Tp* _data, const size_t* _steps)
  1309. : Mat(_dims, _sz, traits::Type<_Tp>::value, _data, _steps)
  1310. {}
  1311. template<typename _Tp> inline
  1312. Mat_<_Tp>::Mat_(const Mat_<_Tp>& m, const Range* ranges)
  1313. : Mat(m, ranges)
  1314. {}
  1315. template<typename _Tp> inline
  1316. Mat_<_Tp>::Mat_(const Mat_<_Tp>& m, const std::vector<Range>& ranges)
  1317. : Mat(m, ranges)
  1318. {}
  1319. template<typename _Tp> inline
  1320. Mat_<_Tp>::Mat_(const Mat& m)
  1321. : Mat()
  1322. {
  1323. flags = (flags & ~CV_MAT_TYPE_MASK) | traits::Type<_Tp>::value;
  1324. *this = m;
  1325. }
  1326. template<typename _Tp> inline
  1327. Mat_<_Tp>::Mat_(const Mat_& m)
  1328. : Mat(m)
  1329. {}
  1330. template<typename _Tp> inline
  1331. Mat_<_Tp>::Mat_(int _rows, int _cols, _Tp* _data, size_t steps)
  1332. : Mat(_rows, _cols, traits::Type<_Tp>::value, _data, steps)
  1333. {}
  1334. template<typename _Tp> inline
  1335. Mat_<_Tp>::Mat_(const Mat_& m, const Range& _rowRange, const Range& _colRange)
  1336. : Mat(m, _rowRange, _colRange)
  1337. {}
  1338. template<typename _Tp> inline
  1339. Mat_<_Tp>::Mat_(const Mat_& m, const Rect& roi)
  1340. : Mat(m, roi)
  1341. {}
  1342. template<typename _Tp> template<int n> inline
  1343. Mat_<_Tp>::Mat_(const Vec<typename DataType<_Tp>::channel_type, n>& vec, bool copyData)
  1344. : Mat(n / DataType<_Tp>::channels, 1, traits::Type<_Tp>::value, (void*)&vec)
  1345. {
  1346. CV_Assert(n%DataType<_Tp>::channels == 0);
  1347. if( copyData )
  1348. *this = clone();
  1349. }
  1350. template<typename _Tp> template<int m, int n> inline
  1351. Mat_<_Tp>::Mat_(const Matx<typename DataType<_Tp>::channel_type, m, n>& M, bool copyData)
  1352. : Mat(m, n / DataType<_Tp>::channels, traits::Type<_Tp>::value, (void*)&M)
  1353. {
  1354. CV_Assert(n % DataType<_Tp>::channels == 0);
  1355. if( copyData )
  1356. *this = clone();
  1357. }
  1358. template<typename _Tp> inline
  1359. Mat_<_Tp>::Mat_(const Point_<typename DataType<_Tp>::channel_type>& pt, bool copyData)
  1360. : Mat(2 / DataType<_Tp>::channels, 1, traits::Type<_Tp>::value, (void*)&pt)
  1361. {
  1362. CV_Assert(2 % DataType<_Tp>::channels == 0);
  1363. if( copyData )
  1364. *this = clone();
  1365. }
  1366. template<typename _Tp> inline
  1367. Mat_<_Tp>::Mat_(const Point3_<typename DataType<_Tp>::channel_type>& pt, bool copyData)
  1368. : Mat(3 / DataType<_Tp>::channels, 1, traits::Type<_Tp>::value, (void*)&pt)
  1369. {
  1370. CV_Assert(3 % DataType<_Tp>::channels == 0);
  1371. if( copyData )
  1372. *this = clone();
  1373. }
  1374. template<typename _Tp> inline
  1375. Mat_<_Tp>::Mat_(const MatCommaInitializer_<_Tp>& commaInitializer)
  1376. : Mat(commaInitializer)
  1377. {}
  1378. template<typename _Tp> inline
  1379. Mat_<_Tp>::Mat_(const std::vector<_Tp>& vec, bool copyData)
  1380. : Mat(vec, copyData)
  1381. {}
  1382. #ifdef CV_CXX11
  1383. template<typename _Tp> inline
  1384. Mat_<_Tp>::Mat_(std::initializer_list<_Tp> list)
  1385. : Mat(list)
  1386. {}
  1387. #endif
  1388. #ifdef CV_CXX_STD_ARRAY
  1389. template<typename _Tp> template<std::size_t _Nm> inline
  1390. Mat_<_Tp>::Mat_(const std::array<_Tp, _Nm>& arr, bool copyData)
  1391. : Mat(arr, copyData)
  1392. {}
  1393. #endif
  1394. template<typename _Tp> inline
  1395. Mat_<_Tp>& Mat_<_Tp>::operator = (const Mat& m)
  1396. {
  1397. if( traits::Type<_Tp>::value == m.type() )
  1398. {
  1399. Mat::operator = (m);
  1400. return *this;
  1401. }
  1402. if( traits::Depth<_Tp>::value == m.depth() )
  1403. {
  1404. return (*this = m.reshape(DataType<_Tp>::channels, m.dims, 0));
  1405. }
  1406. CV_DbgAssert(DataType<_Tp>::channels == m.channels());
  1407. m.convertTo(*this, type());
  1408. return *this;
  1409. }
  1410. template<typename _Tp> inline
  1411. Mat_<_Tp>& Mat_<_Tp>::operator = (const Mat_& m)
  1412. {
  1413. Mat::operator=(m);
  1414. return *this;
  1415. }
  1416. template<typename _Tp> inline
  1417. Mat_<_Tp>& Mat_<_Tp>::operator = (const _Tp& s)
  1418. {
  1419. typedef typename DataType<_Tp>::vec_type VT;
  1420. Mat::operator=(Scalar((const VT&)s));
  1421. return *this;
  1422. }
  1423. template<typename _Tp> inline
  1424. void Mat_<_Tp>::create(int _rows, int _cols)
  1425. {
  1426. Mat::create(_rows, _cols, traits::Type<_Tp>::value);
  1427. }
  1428. template<typename _Tp> inline
  1429. void Mat_<_Tp>::create(Size _sz)
  1430. {
  1431. Mat::create(_sz, traits::Type<_Tp>::value);
  1432. }
  1433. template<typename _Tp> inline
  1434. void Mat_<_Tp>::create(int _dims, const int* _sz)
  1435. {
  1436. Mat::create(_dims, _sz, traits::Type<_Tp>::value);
  1437. }
  1438. template<typename _Tp> inline
  1439. void Mat_<_Tp>::release()
  1440. {
  1441. Mat::release();
  1442. #ifdef _DEBUG
  1443. flags = (flags & ~CV_MAT_TYPE_MASK) | traits::Type<_Tp>::value;
  1444. #endif
  1445. }
  1446. template<typename _Tp> inline
  1447. Mat_<_Tp> Mat_<_Tp>::cross(const Mat_& m) const
  1448. {
  1449. return Mat_<_Tp>(Mat::cross(m));
  1450. }
  1451. template<typename _Tp> template<typename T2> inline
  1452. Mat_<_Tp>::operator Mat_<T2>() const
  1453. {
  1454. return Mat_<T2>(*this);
  1455. }
  1456. template<typename _Tp> inline
  1457. Mat_<_Tp> Mat_<_Tp>::row(int y) const
  1458. {
  1459. return Mat_(*this, Range(y, y+1), Range::all());
  1460. }
  1461. template<typename _Tp> inline
  1462. Mat_<_Tp> Mat_<_Tp>::col(int x) const
  1463. {
  1464. return Mat_(*this, Range::all(), Range(x, x+1));
  1465. }
  1466. template<typename _Tp> inline
  1467. Mat_<_Tp> Mat_<_Tp>::diag(int d) const
  1468. {
  1469. return Mat_(Mat::diag(d));
  1470. }
  1471. template<typename _Tp> inline
  1472. Mat_<_Tp> Mat_<_Tp>::clone() const
  1473. {
  1474. return Mat_(Mat::clone());
  1475. }
  1476. template<typename _Tp> inline
  1477. size_t Mat_<_Tp>::elemSize() const
  1478. {
  1479. CV_DbgAssert( Mat::elemSize() == sizeof(_Tp) );
  1480. return sizeof(_Tp);
  1481. }
  1482. template<typename _Tp> inline
  1483. size_t Mat_<_Tp>::elemSize1() const
  1484. {
  1485. CV_DbgAssert( Mat::elemSize1() == sizeof(_Tp) / DataType<_Tp>::channels );
  1486. return sizeof(_Tp) / DataType<_Tp>::channels;
  1487. }
  1488. template<typename _Tp> inline
  1489. int Mat_<_Tp>::type() const
  1490. {
  1491. CV_DbgAssert( Mat::type() == traits::Type<_Tp>::value );
  1492. return traits::Type<_Tp>::value;
  1493. }
  1494. template<typename _Tp> inline
  1495. int Mat_<_Tp>::depth() const
  1496. {
  1497. CV_DbgAssert( Mat::depth() == traits::Depth<_Tp>::value );
  1498. return traits::Depth<_Tp>::value;
  1499. }
  1500. template<typename _Tp> inline
  1501. int Mat_<_Tp>::channels() const
  1502. {
  1503. CV_DbgAssert( Mat::channels() == DataType<_Tp>::channels );
  1504. return DataType<_Tp>::channels;
  1505. }
  1506. template<typename _Tp> inline
  1507. size_t Mat_<_Tp>::stepT(int i) const
  1508. {
  1509. return step.p[i] / elemSize();
  1510. }
  1511. template<typename _Tp> inline
  1512. size_t Mat_<_Tp>::step1(int i) const
  1513. {
  1514. return step.p[i] / elemSize1();
  1515. }
  1516. template<typename _Tp> inline
  1517. Mat_<_Tp>& Mat_<_Tp>::adjustROI( int dtop, int dbottom, int dleft, int dright )
  1518. {
  1519. return (Mat_<_Tp>&)(Mat::adjustROI(dtop, dbottom, dleft, dright));
  1520. }
  1521. template<typename _Tp> inline
  1522. Mat_<_Tp> Mat_<_Tp>::operator()( const Range& _rowRange, const Range& _colRange ) const
  1523. {
  1524. return Mat_<_Tp>(*this, _rowRange, _colRange);
  1525. }
  1526. template<typename _Tp> inline
  1527. Mat_<_Tp> Mat_<_Tp>::operator()( const Rect& roi ) const
  1528. {
  1529. return Mat_<_Tp>(*this, roi);
  1530. }
  1531. template<typename _Tp> inline
  1532. Mat_<_Tp> Mat_<_Tp>::operator()( const Range* ranges ) const
  1533. {
  1534. return Mat_<_Tp>(*this, ranges);
  1535. }
  1536. template<typename _Tp> inline
  1537. Mat_<_Tp> Mat_<_Tp>::operator()(const std::vector<Range>& ranges) const
  1538. {
  1539. return Mat_<_Tp>(*this, ranges);
  1540. }
  1541. template<typename _Tp> inline
  1542. _Tp* Mat_<_Tp>::operator [](int y)
  1543. {
  1544. CV_DbgAssert( 0 <= y && y < size.p[0] );
  1545. return (_Tp*)(data + y*step.p[0]);
  1546. }
  1547. template<typename _Tp> inline
  1548. const _Tp* Mat_<_Tp>::operator [](int y) const
  1549. {
  1550. CV_DbgAssert( 0 <= y && y < size.p[0] );
  1551. return (const _Tp*)(data + y*step.p[0]);
  1552. }
  1553. template<typename _Tp> inline
  1554. _Tp& Mat_<_Tp>::operator ()(int i0, int i1)
  1555. {
  1556. CV_DbgAssert(dims <= 2);
  1557. CV_DbgAssert(data);
  1558. CV_DbgAssert((unsigned)i0 < (unsigned)size.p[0]);
  1559. CV_DbgAssert((unsigned)i1 < (unsigned)size.p[1]);
  1560. CV_DbgAssert(type() == traits::Type<_Tp>::value);
  1561. return ((_Tp*)(data + step.p[0] * i0))[i1];
  1562. }
  1563. template<typename _Tp> inline
  1564. const _Tp& Mat_<_Tp>::operator ()(int i0, int i1) const
  1565. {
  1566. CV_DbgAssert(dims <= 2);
  1567. CV_DbgAssert(data);
  1568. CV_DbgAssert((unsigned)i0 < (unsigned)size.p[0]);
  1569. CV_DbgAssert((unsigned)i1 < (unsigned)size.p[1]);
  1570. CV_DbgAssert(type() == traits::Type<_Tp>::value);
  1571. return ((const _Tp*)(data + step.p[0] * i0))[i1];
  1572. }
  1573. template<typename _Tp> inline
  1574. _Tp& Mat_<_Tp>::operator ()(Point pt)
  1575. {
  1576. CV_DbgAssert(dims <= 2);
  1577. CV_DbgAssert(data);
  1578. CV_DbgAssert((unsigned)pt.y < (unsigned)size.p[0]);
  1579. CV_DbgAssert((unsigned)pt.x < (unsigned)size.p[1]);
  1580. CV_DbgAssert(type() == traits::Type<_Tp>::value);
  1581. return ((_Tp*)(data + step.p[0] * pt.y))[pt.x];
  1582. }
  1583. template<typename _Tp> inline
  1584. const _Tp& Mat_<_Tp>::operator ()(Point pt) const
  1585. {
  1586. CV_DbgAssert(dims <= 2);
  1587. CV_DbgAssert(data);
  1588. CV_DbgAssert((unsigned)pt.y < (unsigned)size.p[0]);
  1589. CV_DbgAssert((unsigned)pt.x < (unsigned)size.p[1]);
  1590. CV_DbgAssert(type() == traits::Type<_Tp>::value);
  1591. return ((const _Tp*)(data + step.p[0] * pt.y))[pt.x];
  1592. }
  1593. template<typename _Tp> inline
  1594. _Tp& Mat_<_Tp>::operator ()(const int* idx)
  1595. {
  1596. return Mat::at<_Tp>(idx);
  1597. }
  1598. template<typename _Tp> inline
  1599. const _Tp& Mat_<_Tp>::operator ()(const int* idx) const
  1600. {
  1601. return Mat::at<_Tp>(idx);
  1602. }
  1603. template<typename _Tp> template<int n> inline
  1604. _Tp& Mat_<_Tp>::operator ()(const Vec<int, n>& idx)
  1605. {
  1606. return Mat::at<_Tp>(idx);
  1607. }
  1608. template<typename _Tp> template<int n> inline
  1609. const _Tp& Mat_<_Tp>::operator ()(const Vec<int, n>& idx) const
  1610. {
  1611. return Mat::at<_Tp>(idx);
  1612. }
  1613. template<typename _Tp> inline
  1614. _Tp& Mat_<_Tp>::operator ()(int i0)
  1615. {
  1616. return this->at<_Tp>(i0);
  1617. }
  1618. template<typename _Tp> inline
  1619. const _Tp& Mat_<_Tp>::operator ()(int i0) const
  1620. {
  1621. return this->at<_Tp>(i0);
  1622. }
  1623. template<typename _Tp> inline
  1624. _Tp& Mat_<_Tp>::operator ()(int i0, int i1, int i2)
  1625. {
  1626. return this->at<_Tp>(i0, i1, i2);
  1627. }
  1628. template<typename _Tp> inline
  1629. const _Tp& Mat_<_Tp>::operator ()(int i0, int i1, int i2) const
  1630. {
  1631. return this->at<_Tp>(i0, i1, i2);
  1632. }
  1633. template<typename _Tp> inline
  1634. Mat_<_Tp>::operator std::vector<_Tp>() const
  1635. {
  1636. std::vector<_Tp> v;
  1637. copyTo(v);
  1638. return v;
  1639. }
  1640. #ifdef CV_CXX_STD_ARRAY
  1641. template<typename _Tp> template<std::size_t _Nm> inline
  1642. Mat_<_Tp>::operator std::array<_Tp, _Nm>() const
  1643. {
  1644. std::array<_Tp, _Nm> a;
  1645. copyTo(a);
  1646. return a;
  1647. }
  1648. #endif
  1649. template<typename _Tp> template<int n> inline
  1650. Mat_<_Tp>::operator Vec<typename DataType<_Tp>::channel_type, n>() const
  1651. {
  1652. CV_Assert(n % DataType<_Tp>::channels == 0);
  1653. #if defined _MSC_VER
  1654. const Mat* pMat = (const Mat*)this; // workaround for MSVS <= 2012 compiler bugs (but GCC 4.6 dislikes this workaround)
  1655. return pMat->operator Vec<typename DataType<_Tp>::channel_type, n>();
  1656. #else
  1657. return this->Mat::operator Vec<typename DataType<_Tp>::channel_type, n>();
  1658. #endif
  1659. }
  1660. template<typename _Tp> template<int m, int n> inline
  1661. Mat_<_Tp>::operator Matx<typename DataType<_Tp>::channel_type, m, n>() const
  1662. {
  1663. CV_Assert(n % DataType<_Tp>::channels == 0);
  1664. #if defined _MSC_VER
  1665. const Mat* pMat = (const Mat*)this; // workaround for MSVS <= 2012 compiler bugs (but GCC 4.6 dislikes this workaround)
  1666. Matx<typename DataType<_Tp>::channel_type, m, n> res = pMat->operator Matx<typename DataType<_Tp>::channel_type, m, n>();
  1667. return res;
  1668. #else
  1669. Matx<typename DataType<_Tp>::channel_type, m, n> res = this->Mat::operator Matx<typename DataType<_Tp>::channel_type, m, n>();
  1670. return res;
  1671. #endif
  1672. }
  1673. template<typename _Tp> inline
  1674. MatConstIterator_<_Tp> Mat_<_Tp>::begin() const
  1675. {
  1676. return Mat::begin<_Tp>();
  1677. }
  1678. template<typename _Tp> inline
  1679. MatConstIterator_<_Tp> Mat_<_Tp>::end() const
  1680. {
  1681. return Mat::end<_Tp>();
  1682. }
  1683. template<typename _Tp> inline
  1684. MatIterator_<_Tp> Mat_<_Tp>::begin()
  1685. {
  1686. return Mat::begin<_Tp>();
  1687. }
  1688. template<typename _Tp> inline
  1689. MatIterator_<_Tp> Mat_<_Tp>::end()
  1690. {
  1691. return Mat::end<_Tp>();
  1692. }
  1693. template<typename _Tp> template<typename Functor> inline
  1694. void Mat_<_Tp>::forEach(const Functor& operation) {
  1695. Mat::forEach<_Tp, Functor>(operation);
  1696. }
  1697. template<typename _Tp> template<typename Functor> inline
  1698. void Mat_<_Tp>::forEach(const Functor& operation) const {
  1699. Mat::forEach<_Tp, Functor>(operation);
  1700. }
  1701. #ifdef CV_CXX_MOVE_SEMANTICS
  1702. template<typename _Tp> inline
  1703. Mat_<_Tp>::Mat_(Mat_&& m)
  1704. : Mat(m)
  1705. {
  1706. }
  1707. template<typename _Tp> inline
  1708. Mat_<_Tp>& Mat_<_Tp>::operator = (Mat_&& m)
  1709. {
  1710. Mat::operator = (std::move(m));
  1711. return *this;
  1712. }
  1713. template<typename _Tp> inline
  1714. Mat_<_Tp>::Mat_(Mat&& m)
  1715. : Mat()
  1716. {
  1717. flags = (flags & ~CV_MAT_TYPE_MASK) | traits::Type<_Tp>::value;
  1718. *this = m;
  1719. }
  1720. template<typename _Tp> inline
  1721. Mat_<_Tp>& Mat_<_Tp>::operator = (Mat&& m)
  1722. {
  1723. if( traits::Type<_Tp>::value == m.type() )
  1724. {
  1725. Mat::operator = ((Mat&&)m);
  1726. return *this;
  1727. }
  1728. if( traits::Depth<_Tp>::value == m.depth() )
  1729. {
  1730. Mat::operator = ((Mat&&)m.reshape(DataType<_Tp>::channels, m.dims, 0));
  1731. return *this;
  1732. }
  1733. CV_DbgAssert(DataType<_Tp>::channels == m.channels());
  1734. m.convertTo(*this, type());
  1735. return *this;
  1736. }
  1737. template<typename _Tp> inline
  1738. Mat_<_Tp>::Mat_(MatExpr&& e)
  1739. : Mat()
  1740. {
  1741. flags = (flags & ~CV_MAT_TYPE_MASK) | traits::Type<_Tp>::value;
  1742. *this = Mat(e);
  1743. }
  1744. #endif
  1745. ///////////////////////////// SparseMat /////////////////////////////
  1746. inline
  1747. SparseMat::SparseMat()
  1748. : flags(MAGIC_VAL), hdr(0)
  1749. {}
  1750. inline
  1751. SparseMat::SparseMat(int _dims, const int* _sizes, int _type)
  1752. : flags(MAGIC_VAL), hdr(0)
  1753. {
  1754. create(_dims, _sizes, _type);
  1755. }
  1756. inline
  1757. SparseMat::SparseMat(const SparseMat& m)
  1758. : flags(m.flags), hdr(m.hdr)
  1759. {
  1760. addref();
  1761. }
  1762. inline
  1763. SparseMat::~SparseMat()
  1764. {
  1765. release();
  1766. }
  1767. inline
  1768. SparseMat& SparseMat::operator = (const SparseMat& m)
  1769. {
  1770. if( this != &m )
  1771. {
  1772. if( m.hdr )
  1773. CV_XADD(&m.hdr->refcount, 1);
  1774. release();
  1775. flags = m.flags;
  1776. hdr = m.hdr;
  1777. }
  1778. return *this;
  1779. }
  1780. inline
  1781. SparseMat& SparseMat::operator = (const Mat& m)
  1782. {
  1783. return (*this = SparseMat(m));
  1784. }
  1785. inline
  1786. SparseMat SparseMat::clone() const
  1787. {
  1788. SparseMat temp;
  1789. this->copyTo(temp);
  1790. return temp;
  1791. }
  1792. inline
  1793. void SparseMat::assignTo( SparseMat& m, int _type ) const
  1794. {
  1795. if( _type < 0 )
  1796. m = *this;
  1797. else
  1798. convertTo(m, _type);
  1799. }
  1800. inline
  1801. void SparseMat::addref()
  1802. {
  1803. if( hdr )
  1804. CV_XADD(&hdr->refcount, 1);
  1805. }
  1806. inline
  1807. void SparseMat::release()
  1808. {
  1809. if( hdr && CV_XADD(&hdr->refcount, -1) == 1 )
  1810. delete hdr;
  1811. hdr = 0;
  1812. }
  1813. inline
  1814. size_t SparseMat::elemSize() const
  1815. {
  1816. return CV_ELEM_SIZE(flags);
  1817. }
  1818. inline
  1819. size_t SparseMat::elemSize1() const
  1820. {
  1821. return CV_ELEM_SIZE1(flags);
  1822. }
  1823. inline
  1824. int SparseMat::type() const
  1825. {
  1826. return CV_MAT_TYPE(flags);
  1827. }
  1828. inline
  1829. int SparseMat::depth() const
  1830. {
  1831. return CV_MAT_DEPTH(flags);
  1832. }
  1833. inline
  1834. int SparseMat::channels() const
  1835. {
  1836. return CV_MAT_CN(flags);
  1837. }
  1838. inline
  1839. const int* SparseMat::size() const
  1840. {
  1841. return hdr ? hdr->size : 0;
  1842. }
  1843. inline
  1844. int SparseMat::size(int i) const
  1845. {
  1846. if( hdr )
  1847. {
  1848. CV_DbgAssert((unsigned)i < (unsigned)hdr->dims);
  1849. return hdr->size[i];
  1850. }
  1851. return 0;
  1852. }
  1853. inline
  1854. int SparseMat::dims() const
  1855. {
  1856. return hdr ? hdr->dims : 0;
  1857. }
  1858. inline
  1859. size_t SparseMat::nzcount() const
  1860. {
  1861. return hdr ? hdr->nodeCount : 0;
  1862. }
  1863. inline
  1864. size_t SparseMat::hash(int i0) const
  1865. {
  1866. return (size_t)i0;
  1867. }
  1868. inline
  1869. size_t SparseMat::hash(int i0, int i1) const
  1870. {
  1871. return (size_t)(unsigned)i0 * HASH_SCALE + (unsigned)i1;
  1872. }
  1873. inline
  1874. size_t SparseMat::hash(int i0, int i1, int i2) const
  1875. {
  1876. return ((size_t)(unsigned)i0 * HASH_SCALE + (unsigned)i1) * HASH_SCALE + (unsigned)i2;
  1877. }
  1878. inline
  1879. size_t SparseMat::hash(const int* idx) const
  1880. {
  1881. size_t h = (unsigned)idx[0];
  1882. if( !hdr )
  1883. return 0;
  1884. int d = hdr->dims;
  1885. for(int i = 1; i < d; i++ )
  1886. h = h * HASH_SCALE + (unsigned)idx[i];
  1887. return h;
  1888. }
  1889. template<typename _Tp> inline
  1890. _Tp& SparseMat::ref(int i0, size_t* hashval)
  1891. {
  1892. return *(_Tp*)((SparseMat*)this)->ptr(i0, true, hashval);
  1893. }
  1894. template<typename _Tp> inline
  1895. _Tp& SparseMat::ref(int i0, int i1, size_t* hashval)
  1896. {
  1897. return *(_Tp*)((SparseMat*)this)->ptr(i0, i1, true, hashval);
  1898. }
  1899. template<typename _Tp> inline
  1900. _Tp& SparseMat::ref(int i0, int i1, int i2, size_t* hashval)
  1901. {
  1902. return *(_Tp*)((SparseMat*)this)->ptr(i0, i1, i2, true, hashval);
  1903. }
  1904. template<typename _Tp> inline
  1905. _Tp& SparseMat::ref(const int* idx, size_t* hashval)
  1906. {
  1907. return *(_Tp*)((SparseMat*)this)->ptr(idx, true, hashval);
  1908. }
  1909. template<typename _Tp> inline
  1910. _Tp SparseMat::value(int i0, size_t* hashval) const
  1911. {
  1912. const _Tp* p = (const _Tp*)((SparseMat*)this)->ptr(i0, false, hashval);
  1913. return p ? *p : _Tp();
  1914. }
  1915. template<typename _Tp> inline
  1916. _Tp SparseMat::value(int i0, int i1, size_t* hashval) const
  1917. {
  1918. const _Tp* p = (const _Tp*)((SparseMat*)this)->ptr(i0, i1, false, hashval);
  1919. return p ? *p : _Tp();
  1920. }
  1921. template<typename _Tp> inline
  1922. _Tp SparseMat::value(int i0, int i1, int i2, size_t* hashval) const
  1923. {
  1924. const _Tp* p = (const _Tp*)((SparseMat*)this)->ptr(i0, i1, i2, false, hashval);
  1925. return p ? *p : _Tp();
  1926. }
  1927. template<typename _Tp> inline
  1928. _Tp SparseMat::value(const int* idx, size_t* hashval) const
  1929. {
  1930. const _Tp* p = (const _Tp*)((SparseMat*)this)->ptr(idx, false, hashval);
  1931. return p ? *p : _Tp();
  1932. }
  1933. template<typename _Tp> inline
  1934. const _Tp* SparseMat::find(int i0, size_t* hashval) const
  1935. {
  1936. return (const _Tp*)((SparseMat*)this)->ptr(i0, false, hashval);
  1937. }
  1938. template<typename _Tp> inline
  1939. const _Tp* SparseMat::find(int i0, int i1, size_t* hashval) const
  1940. {
  1941. return (const _Tp*)((SparseMat*)this)->ptr(i0, i1, false, hashval);
  1942. }
  1943. template<typename _Tp> inline
  1944. const _Tp* SparseMat::find(int i0, int i1, int i2, size_t* hashval) const
  1945. {
  1946. return (const _Tp*)((SparseMat*)this)->ptr(i0, i1, i2, false, hashval);
  1947. }
  1948. template<typename _Tp> inline
  1949. const _Tp* SparseMat::find(const int* idx, size_t* hashval) const
  1950. {
  1951. return (const _Tp*)((SparseMat*)this)->ptr(idx, false, hashval);
  1952. }
  1953. template<typename _Tp> inline
  1954. _Tp& SparseMat::value(Node* n)
  1955. {
  1956. return *(_Tp*)((uchar*)n + hdr->valueOffset);
  1957. }
  1958. template<typename _Tp> inline
  1959. const _Tp& SparseMat::value(const Node* n) const
  1960. {
  1961. return *(const _Tp*)((const uchar*)n + hdr->valueOffset);
  1962. }
  1963. inline
  1964. SparseMat::Node* SparseMat::node(size_t nidx)
  1965. {
  1966. return (Node*)(void*)&hdr->pool[nidx];
  1967. }
  1968. inline
  1969. const SparseMat::Node* SparseMat::node(size_t nidx) const
  1970. {
  1971. return (const Node*)(const void*)&hdr->pool[nidx];
  1972. }
  1973. inline
  1974. SparseMatIterator SparseMat::begin()
  1975. {
  1976. return SparseMatIterator(this);
  1977. }
  1978. inline
  1979. SparseMatConstIterator SparseMat::begin() const
  1980. {
  1981. return SparseMatConstIterator(this);
  1982. }
  1983. inline
  1984. SparseMatIterator SparseMat::end()
  1985. {
  1986. SparseMatIterator it(this);
  1987. it.seekEnd();
  1988. return it;
  1989. }
  1990. inline
  1991. SparseMatConstIterator SparseMat::end() const
  1992. {
  1993. SparseMatConstIterator it(this);
  1994. it.seekEnd();
  1995. return it;
  1996. }
  1997. template<typename _Tp> inline
  1998. SparseMatIterator_<_Tp> SparseMat::begin()
  1999. {
  2000. return SparseMatIterator_<_Tp>(this);
  2001. }
  2002. template<typename _Tp> inline
  2003. SparseMatConstIterator_<_Tp> SparseMat::begin() const
  2004. {
  2005. return SparseMatConstIterator_<_Tp>(this);
  2006. }
  2007. template<typename _Tp> inline
  2008. SparseMatIterator_<_Tp> SparseMat::end()
  2009. {
  2010. SparseMatIterator_<_Tp> it(this);
  2011. it.seekEnd();
  2012. return it;
  2013. }
  2014. template<typename _Tp> inline
  2015. SparseMatConstIterator_<_Tp> SparseMat::end() const
  2016. {
  2017. SparseMatConstIterator_<_Tp> it(this);
  2018. it.seekEnd();
  2019. return it;
  2020. }
  2021. ///////////////////////////// SparseMat_ ////////////////////////////
  2022. template<typename _Tp> inline
  2023. SparseMat_<_Tp>::SparseMat_()
  2024. {
  2025. flags = MAGIC_VAL | traits::Type<_Tp>::value;
  2026. }
  2027. template<typename _Tp> inline
  2028. SparseMat_<_Tp>::SparseMat_(int _dims, const int* _sizes)
  2029. : SparseMat(_dims, _sizes, traits::Type<_Tp>::value)
  2030. {}
  2031. template<typename _Tp> inline
  2032. SparseMat_<_Tp>::SparseMat_(const SparseMat& m)
  2033. {
  2034. if( m.type() == traits::Type<_Tp>::value )
  2035. *this = (const SparseMat_<_Tp>&)m;
  2036. else
  2037. m.convertTo(*this, traits::Type<_Tp>::value);
  2038. }
  2039. template<typename _Tp> inline
  2040. SparseMat_<_Tp>::SparseMat_(const SparseMat_<_Tp>& m)
  2041. {
  2042. this->flags = m.flags;
  2043. this->hdr = m.hdr;
  2044. if( this->hdr )
  2045. CV_XADD(&this->hdr->refcount, 1);
  2046. }
  2047. template<typename _Tp> inline
  2048. SparseMat_<_Tp>::SparseMat_(const Mat& m)
  2049. {
  2050. SparseMat sm(m);
  2051. *this = sm;
  2052. }
  2053. template<typename _Tp> inline
  2054. SparseMat_<_Tp>& SparseMat_<_Tp>::operator = (const SparseMat_<_Tp>& m)
  2055. {
  2056. if( this != &m )
  2057. {
  2058. if( m.hdr ) CV_XADD(&m.hdr->refcount, 1);
  2059. release();
  2060. flags = m.flags;
  2061. hdr = m.hdr;
  2062. }
  2063. return *this;
  2064. }
  2065. template<typename _Tp> inline
  2066. SparseMat_<_Tp>& SparseMat_<_Tp>::operator = (const SparseMat& m)
  2067. {
  2068. if( m.type() == traits::Type<_Tp>::value )
  2069. return (*this = (const SparseMat_<_Tp>&)m);
  2070. m.convertTo(*this, traits::Type<_Tp>::value);
  2071. return *this;
  2072. }
  2073. template<typename _Tp> inline
  2074. SparseMat_<_Tp>& SparseMat_<_Tp>::operator = (const Mat& m)
  2075. {
  2076. return (*this = SparseMat(m));
  2077. }
  2078. template<typename _Tp> inline
  2079. SparseMat_<_Tp> SparseMat_<_Tp>::clone() const
  2080. {
  2081. SparseMat_<_Tp> m;
  2082. this->copyTo(m);
  2083. return m;
  2084. }
  2085. template<typename _Tp> inline
  2086. void SparseMat_<_Tp>::create(int _dims, const int* _sizes)
  2087. {
  2088. SparseMat::create(_dims, _sizes, traits::Type<_Tp>::value);
  2089. }
  2090. template<typename _Tp> inline
  2091. int SparseMat_<_Tp>::type() const
  2092. {
  2093. return traits::Type<_Tp>::value;
  2094. }
  2095. template<typename _Tp> inline
  2096. int SparseMat_<_Tp>::depth() const
  2097. {
  2098. return traits::Depth<_Tp>::value;
  2099. }
  2100. template<typename _Tp> inline
  2101. int SparseMat_<_Tp>::channels() const
  2102. {
  2103. return DataType<_Tp>::channels;
  2104. }
  2105. template<typename _Tp> inline
  2106. _Tp& SparseMat_<_Tp>::ref(int i0, size_t* hashval)
  2107. {
  2108. return SparseMat::ref<_Tp>(i0, hashval);
  2109. }
  2110. template<typename _Tp> inline
  2111. _Tp SparseMat_<_Tp>::operator()(int i0, size_t* hashval) const
  2112. {
  2113. return SparseMat::value<_Tp>(i0, hashval);
  2114. }
  2115. template<typename _Tp> inline
  2116. _Tp& SparseMat_<_Tp>::ref(int i0, int i1, size_t* hashval)
  2117. {
  2118. return SparseMat::ref<_Tp>(i0, i1, hashval);
  2119. }
  2120. template<typename _Tp> inline
  2121. _Tp SparseMat_<_Tp>::operator()(int i0, int i1, size_t* hashval) const
  2122. {
  2123. return SparseMat::value<_Tp>(i0, i1, hashval);
  2124. }
  2125. template<typename _Tp> inline
  2126. _Tp& SparseMat_<_Tp>::ref(int i0, int i1, int i2, size_t* hashval)
  2127. {
  2128. return SparseMat::ref<_Tp>(i0, i1, i2, hashval);
  2129. }
  2130. template<typename _Tp> inline
  2131. _Tp SparseMat_<_Tp>::operator()(int i0, int i1, int i2, size_t* hashval) const
  2132. {
  2133. return SparseMat::value<_Tp>(i0, i1, i2, hashval);
  2134. }
  2135. template<typename _Tp> inline
  2136. _Tp& SparseMat_<_Tp>::ref(const int* idx, size_t* hashval)
  2137. {
  2138. return SparseMat::ref<_Tp>(idx, hashval);
  2139. }
  2140. template<typename _Tp> inline
  2141. _Tp SparseMat_<_Tp>::operator()(const int* idx, size_t* hashval) const
  2142. {
  2143. return SparseMat::value<_Tp>(idx, hashval);
  2144. }
  2145. template<typename _Tp> inline
  2146. SparseMatIterator_<_Tp> SparseMat_<_Tp>::begin()
  2147. {
  2148. return SparseMatIterator_<_Tp>(this);
  2149. }
  2150. template<typename _Tp> inline
  2151. SparseMatConstIterator_<_Tp> SparseMat_<_Tp>::begin() const
  2152. {
  2153. return SparseMatConstIterator_<_Tp>(this);
  2154. }
  2155. template<typename _Tp> inline
  2156. SparseMatIterator_<_Tp> SparseMat_<_Tp>::end()
  2157. {
  2158. SparseMatIterator_<_Tp> it(this);
  2159. it.seekEnd();
  2160. return it;
  2161. }
  2162. template<typename _Tp> inline
  2163. SparseMatConstIterator_<_Tp> SparseMat_<_Tp>::end() const
  2164. {
  2165. SparseMatConstIterator_<_Tp> it(this);
  2166. it.seekEnd();
  2167. return it;
  2168. }
  2169. ////////////////////////// MatConstIterator /////////////////////////
  2170. inline
  2171. MatConstIterator::MatConstIterator()
  2172. : m(0), elemSize(0), ptr(0), sliceStart(0), sliceEnd(0)
  2173. {}
  2174. inline
  2175. MatConstIterator::MatConstIterator(const Mat* _m)
  2176. : m(_m), elemSize(_m->elemSize()), ptr(0), sliceStart(0), sliceEnd(0)
  2177. {
  2178. if( m && m->isContinuous() )
  2179. {
  2180. sliceStart = m->ptr();
  2181. sliceEnd = sliceStart + m->total()*elemSize;
  2182. }
  2183. seek((const int*)0);
  2184. }
  2185. inline
  2186. MatConstIterator::MatConstIterator(const Mat* _m, int _row, int _col)
  2187. : m(_m), elemSize(_m->elemSize()), ptr(0), sliceStart(0), sliceEnd(0)
  2188. {
  2189. CV_Assert(m && m->dims <= 2);
  2190. if( m->isContinuous() )
  2191. {
  2192. sliceStart = m->ptr();
  2193. sliceEnd = sliceStart + m->total()*elemSize;
  2194. }
  2195. int idx[] = {_row, _col};
  2196. seek(idx);
  2197. }
  2198. inline
  2199. MatConstIterator::MatConstIterator(const Mat* _m, Point _pt)
  2200. : m(_m), elemSize(_m->elemSize()), ptr(0), sliceStart(0), sliceEnd(0)
  2201. {
  2202. CV_Assert(m && m->dims <= 2);
  2203. if( m->isContinuous() )
  2204. {
  2205. sliceStart = m->ptr();
  2206. sliceEnd = sliceStart + m->total()*elemSize;
  2207. }
  2208. int idx[] = {_pt.y, _pt.x};
  2209. seek(idx);
  2210. }
  2211. inline
  2212. MatConstIterator::MatConstIterator(const MatConstIterator& it)
  2213. : m(it.m), elemSize(it.elemSize), ptr(it.ptr), sliceStart(it.sliceStart), sliceEnd(it.sliceEnd)
  2214. {}
  2215. inline
  2216. MatConstIterator& MatConstIterator::operator = (const MatConstIterator& it )
  2217. {
  2218. m = it.m; elemSize = it.elemSize; ptr = it.ptr;
  2219. sliceStart = it.sliceStart; sliceEnd = it.sliceEnd;
  2220. return *this;
  2221. }
  2222. inline
  2223. const uchar* MatConstIterator::operator *() const
  2224. {
  2225. return ptr;
  2226. }
  2227. inline MatConstIterator& MatConstIterator::operator += (ptrdiff_t ofs)
  2228. {
  2229. if( !m || ofs == 0 )
  2230. return *this;
  2231. ptrdiff_t ofsb = ofs*elemSize;
  2232. ptr += ofsb;
  2233. if( ptr < sliceStart || sliceEnd <= ptr )
  2234. {
  2235. ptr -= ofsb;
  2236. seek(ofs, true);
  2237. }
  2238. return *this;
  2239. }
  2240. inline
  2241. MatConstIterator& MatConstIterator::operator -= (ptrdiff_t ofs)
  2242. {
  2243. return (*this += -ofs);
  2244. }
  2245. inline
  2246. MatConstIterator& MatConstIterator::operator --()
  2247. {
  2248. if( m && (ptr -= elemSize) < sliceStart )
  2249. {
  2250. ptr += elemSize;
  2251. seek(-1, true);
  2252. }
  2253. return *this;
  2254. }
  2255. inline
  2256. MatConstIterator MatConstIterator::operator --(int)
  2257. {
  2258. MatConstIterator b = *this;
  2259. *this += -1;
  2260. return b;
  2261. }
  2262. inline
  2263. MatConstIterator& MatConstIterator::operator ++()
  2264. {
  2265. if( m && (ptr += elemSize) >= sliceEnd )
  2266. {
  2267. ptr -= elemSize;
  2268. seek(1, true);
  2269. }
  2270. return *this;
  2271. }
  2272. inline MatConstIterator MatConstIterator::operator ++(int)
  2273. {
  2274. MatConstIterator b = *this;
  2275. *this += 1;
  2276. return b;
  2277. }
  2278. static inline
  2279. bool operator == (const MatConstIterator& a, const MatConstIterator& b)
  2280. {
  2281. return a.m == b.m && a.ptr == b.ptr;
  2282. }
  2283. static inline
  2284. bool operator != (const MatConstIterator& a, const MatConstIterator& b)
  2285. {
  2286. return !(a == b);
  2287. }
  2288. static inline
  2289. bool operator < (const MatConstIterator& a, const MatConstIterator& b)
  2290. {
  2291. return a.ptr < b.ptr;
  2292. }
  2293. static inline
  2294. bool operator > (const MatConstIterator& a, const MatConstIterator& b)
  2295. {
  2296. return a.ptr > b.ptr;
  2297. }
  2298. static inline
  2299. bool operator <= (const MatConstIterator& a, const MatConstIterator& b)
  2300. {
  2301. return a.ptr <= b.ptr;
  2302. }
  2303. static inline
  2304. bool operator >= (const MatConstIterator& a, const MatConstIterator& b)
  2305. {
  2306. return a.ptr >= b.ptr;
  2307. }
  2308. static inline
  2309. ptrdiff_t operator - (const MatConstIterator& b, const MatConstIterator& a)
  2310. {
  2311. if( a.m != b.m )
  2312. return ((size_t)(-1) >> 1);
  2313. if( a.sliceEnd == b.sliceEnd )
  2314. return (b.ptr - a.ptr)/static_cast<ptrdiff_t>(b.elemSize);
  2315. return b.lpos() - a.lpos();
  2316. }
  2317. static inline
  2318. MatConstIterator operator + (const MatConstIterator& a, ptrdiff_t ofs)
  2319. {
  2320. MatConstIterator b = a;
  2321. return b += ofs;
  2322. }
  2323. static inline
  2324. MatConstIterator operator + (ptrdiff_t ofs, const MatConstIterator& a)
  2325. {
  2326. MatConstIterator b = a;
  2327. return b += ofs;
  2328. }
  2329. static inline
  2330. MatConstIterator operator - (const MatConstIterator& a, ptrdiff_t ofs)
  2331. {
  2332. MatConstIterator b = a;
  2333. return b += -ofs;
  2334. }
  2335. inline
  2336. const uchar* MatConstIterator::operator [](ptrdiff_t i) const
  2337. {
  2338. return *(*this + i);
  2339. }
  2340. ///////////////////////// MatConstIterator_ /////////////////////////
  2341. template<typename _Tp> inline
  2342. MatConstIterator_<_Tp>::MatConstIterator_()
  2343. {}
  2344. template<typename _Tp> inline
  2345. MatConstIterator_<_Tp>::MatConstIterator_(const Mat_<_Tp>* _m)
  2346. : MatConstIterator(_m)
  2347. {}
  2348. template<typename _Tp> inline
  2349. MatConstIterator_<_Tp>::MatConstIterator_(const Mat_<_Tp>* _m, int _row, int _col)
  2350. : MatConstIterator(_m, _row, _col)
  2351. {}
  2352. template<typename _Tp> inline
  2353. MatConstIterator_<_Tp>::MatConstIterator_(const Mat_<_Tp>* _m, Point _pt)
  2354. : MatConstIterator(_m, _pt)
  2355. {}
  2356. template<typename _Tp> inline
  2357. MatConstIterator_<_Tp>::MatConstIterator_(const MatConstIterator_& it)
  2358. : MatConstIterator(it)
  2359. {}
  2360. template<typename _Tp> inline
  2361. MatConstIterator_<_Tp>& MatConstIterator_<_Tp>::operator = (const MatConstIterator_& it )
  2362. {
  2363. MatConstIterator::operator = (it);
  2364. return *this;
  2365. }
  2366. template<typename _Tp> inline
  2367. const _Tp& MatConstIterator_<_Tp>::operator *() const
  2368. {
  2369. return *(_Tp*)(this->ptr);
  2370. }
  2371. template<typename _Tp> inline
  2372. MatConstIterator_<_Tp>& MatConstIterator_<_Tp>::operator += (ptrdiff_t ofs)
  2373. {
  2374. MatConstIterator::operator += (ofs);
  2375. return *this;
  2376. }
  2377. template<typename _Tp> inline
  2378. MatConstIterator_<_Tp>& MatConstIterator_<_Tp>::operator -= (ptrdiff_t ofs)
  2379. {
  2380. return (*this += -ofs);
  2381. }
  2382. template<typename _Tp> inline
  2383. MatConstIterator_<_Tp>& MatConstIterator_<_Tp>::operator --()
  2384. {
  2385. MatConstIterator::operator --();
  2386. return *this;
  2387. }
  2388. template<typename _Tp> inline
  2389. MatConstIterator_<_Tp> MatConstIterator_<_Tp>::operator --(int)
  2390. {
  2391. MatConstIterator_ b = *this;
  2392. MatConstIterator::operator --();
  2393. return b;
  2394. }
  2395. template<typename _Tp> inline
  2396. MatConstIterator_<_Tp>& MatConstIterator_<_Tp>::operator ++()
  2397. {
  2398. MatConstIterator::operator ++();
  2399. return *this;
  2400. }
  2401. template<typename _Tp> inline
  2402. MatConstIterator_<_Tp> MatConstIterator_<_Tp>::operator ++(int)
  2403. {
  2404. MatConstIterator_ b = *this;
  2405. MatConstIterator::operator ++();
  2406. return b;
  2407. }
  2408. template<typename _Tp> inline
  2409. Point MatConstIterator_<_Tp>::pos() const
  2410. {
  2411. if( !m )
  2412. return Point();
  2413. CV_DbgAssert( m->dims <= 2 );
  2414. if( m->isContinuous() )
  2415. {
  2416. ptrdiff_t ofs = (const _Tp*)ptr - (const _Tp*)m->data;
  2417. int y = (int)(ofs / m->cols);
  2418. int x = (int)(ofs - (ptrdiff_t)y * m->cols);
  2419. return Point(x, y);
  2420. }
  2421. else
  2422. {
  2423. ptrdiff_t ofs = (uchar*)ptr - m->data;
  2424. int y = (int)(ofs / m->step);
  2425. int x = (int)((ofs - y * m->step)/sizeof(_Tp));
  2426. return Point(x, y);
  2427. }
  2428. }
  2429. template<typename _Tp> static inline
  2430. bool operator == (const MatConstIterator_<_Tp>& a, const MatConstIterator_<_Tp>& b)
  2431. {
  2432. return a.m == b.m && a.ptr == b.ptr;
  2433. }
  2434. template<typename _Tp> static inline
  2435. bool operator != (const MatConstIterator_<_Tp>& a, const MatConstIterator_<_Tp>& b)
  2436. {
  2437. return a.m != b.m || a.ptr != b.ptr;
  2438. }
  2439. template<typename _Tp> static inline
  2440. MatConstIterator_<_Tp> operator + (const MatConstIterator_<_Tp>& a, ptrdiff_t ofs)
  2441. {
  2442. MatConstIterator t = (const MatConstIterator&)a + ofs;
  2443. return (MatConstIterator_<_Tp>&)t;
  2444. }
  2445. template<typename _Tp> static inline
  2446. MatConstIterator_<_Tp> operator + (ptrdiff_t ofs, const MatConstIterator_<_Tp>& a)
  2447. {
  2448. MatConstIterator t = (const MatConstIterator&)a + ofs;
  2449. return (MatConstIterator_<_Tp>&)t;
  2450. }
  2451. template<typename _Tp> static inline
  2452. MatConstIterator_<_Tp> operator - (const MatConstIterator_<_Tp>& a, ptrdiff_t ofs)
  2453. {
  2454. MatConstIterator t = (const MatConstIterator&)a - ofs;
  2455. return (MatConstIterator_<_Tp>&)t;
  2456. }
  2457. template<typename _Tp> inline
  2458. const _Tp& MatConstIterator_<_Tp>::operator [](ptrdiff_t i) const
  2459. {
  2460. return *(_Tp*)MatConstIterator::operator [](i);
  2461. }
  2462. //////////////////////////// MatIterator_ ///////////////////////////
  2463. template<typename _Tp> inline
  2464. MatIterator_<_Tp>::MatIterator_()
  2465. : MatConstIterator_<_Tp>()
  2466. {}
  2467. template<typename _Tp> inline
  2468. MatIterator_<_Tp>::MatIterator_(Mat_<_Tp>* _m)
  2469. : MatConstIterator_<_Tp>(_m)
  2470. {}
  2471. template<typename _Tp> inline
  2472. MatIterator_<_Tp>::MatIterator_(Mat_<_Tp>* _m, int _row, int _col)
  2473. : MatConstIterator_<_Tp>(_m, _row, _col)
  2474. {}
  2475. template<typename _Tp> inline
  2476. MatIterator_<_Tp>::MatIterator_(Mat_<_Tp>* _m, Point _pt)
  2477. : MatConstIterator_<_Tp>(_m, _pt)
  2478. {}
  2479. template<typename _Tp> inline
  2480. MatIterator_<_Tp>::MatIterator_(Mat_<_Tp>* _m, const int* _idx)
  2481. : MatConstIterator_<_Tp>(_m, _idx)
  2482. {}
  2483. template<typename _Tp> inline
  2484. MatIterator_<_Tp>::MatIterator_(const MatIterator_& it)
  2485. : MatConstIterator_<_Tp>(it)
  2486. {}
  2487. template<typename _Tp> inline
  2488. MatIterator_<_Tp>& MatIterator_<_Tp>::operator = (const MatIterator_<_Tp>& it )
  2489. {
  2490. MatConstIterator::operator = (it);
  2491. return *this;
  2492. }
  2493. template<typename _Tp> inline
  2494. _Tp& MatIterator_<_Tp>::operator *() const
  2495. {
  2496. return *(_Tp*)(this->ptr);
  2497. }
  2498. template<typename _Tp> inline
  2499. MatIterator_<_Tp>& MatIterator_<_Tp>::operator += (ptrdiff_t ofs)
  2500. {
  2501. MatConstIterator::operator += (ofs);
  2502. return *this;
  2503. }
  2504. template<typename _Tp> inline
  2505. MatIterator_<_Tp>& MatIterator_<_Tp>::operator -= (ptrdiff_t ofs)
  2506. {
  2507. MatConstIterator::operator += (-ofs);
  2508. return *this;
  2509. }
  2510. template<typename _Tp> inline
  2511. MatIterator_<_Tp>& MatIterator_<_Tp>::operator --()
  2512. {
  2513. MatConstIterator::operator --();
  2514. return *this;
  2515. }
  2516. template<typename _Tp> inline
  2517. MatIterator_<_Tp> MatIterator_<_Tp>::operator --(int)
  2518. {
  2519. MatIterator_ b = *this;
  2520. MatConstIterator::operator --();
  2521. return b;
  2522. }
  2523. template<typename _Tp> inline
  2524. MatIterator_<_Tp>& MatIterator_<_Tp>::operator ++()
  2525. {
  2526. MatConstIterator::operator ++();
  2527. return *this;
  2528. }
  2529. template<typename _Tp> inline
  2530. MatIterator_<_Tp> MatIterator_<_Tp>::operator ++(int)
  2531. {
  2532. MatIterator_ b = *this;
  2533. MatConstIterator::operator ++();
  2534. return b;
  2535. }
  2536. template<typename _Tp> inline
  2537. _Tp& MatIterator_<_Tp>::operator [](ptrdiff_t i) const
  2538. {
  2539. return *(*this + i);
  2540. }
  2541. template<typename _Tp> static inline
  2542. bool operator == (const MatIterator_<_Tp>& a, const MatIterator_<_Tp>& b)
  2543. {
  2544. return a.m == b.m && a.ptr == b.ptr;
  2545. }
  2546. template<typename _Tp> static inline
  2547. bool operator != (const MatIterator_<_Tp>& a, const MatIterator_<_Tp>& b)
  2548. {
  2549. return a.m != b.m || a.ptr != b.ptr;
  2550. }
  2551. template<typename _Tp> static inline
  2552. MatIterator_<_Tp> operator + (const MatIterator_<_Tp>& a, ptrdiff_t ofs)
  2553. {
  2554. MatConstIterator t = (const MatConstIterator&)a + ofs;
  2555. return (MatIterator_<_Tp>&)t;
  2556. }
  2557. template<typename _Tp> static inline
  2558. MatIterator_<_Tp> operator + (ptrdiff_t ofs, const MatIterator_<_Tp>& a)
  2559. {
  2560. MatConstIterator t = (const MatConstIterator&)a + ofs;
  2561. return (MatIterator_<_Tp>&)t;
  2562. }
  2563. template<typename _Tp> static inline
  2564. MatIterator_<_Tp> operator - (const MatIterator_<_Tp>& a, ptrdiff_t ofs)
  2565. {
  2566. MatConstIterator t = (const MatConstIterator&)a - ofs;
  2567. return (MatIterator_<_Tp>&)t;
  2568. }
  2569. /////////////////////// SparseMatConstIterator //////////////////////
  2570. inline
  2571. SparseMatConstIterator::SparseMatConstIterator()
  2572. : m(0), hashidx(0), ptr(0)
  2573. {}
  2574. inline
  2575. SparseMatConstIterator::SparseMatConstIterator(const SparseMatConstIterator& it)
  2576. : m(it.m), hashidx(it.hashidx), ptr(it.ptr)
  2577. {}
  2578. inline SparseMatConstIterator& SparseMatConstIterator::operator = (const SparseMatConstIterator& it)
  2579. {
  2580. if( this != &it )
  2581. {
  2582. m = it.m;
  2583. hashidx = it.hashidx;
  2584. ptr = it.ptr;
  2585. }
  2586. return *this;
  2587. }
  2588. template<typename _Tp> inline
  2589. const _Tp& SparseMatConstIterator::value() const
  2590. {
  2591. return *(const _Tp*)ptr;
  2592. }
  2593. inline
  2594. const SparseMat::Node* SparseMatConstIterator::node() const
  2595. {
  2596. return (ptr && m && m->hdr) ? (const SparseMat::Node*)(const void*)(ptr - m->hdr->valueOffset) : 0;
  2597. }
  2598. inline
  2599. SparseMatConstIterator SparseMatConstIterator::operator ++(int)
  2600. {
  2601. SparseMatConstIterator it = *this;
  2602. ++*this;
  2603. return it;
  2604. }
  2605. inline
  2606. void SparseMatConstIterator::seekEnd()
  2607. {
  2608. if( m && m->hdr )
  2609. {
  2610. hashidx = m->hdr->hashtab.size();
  2611. ptr = 0;
  2612. }
  2613. }
  2614. static inline
  2615. bool operator == (const SparseMatConstIterator& it1, const SparseMatConstIterator& it2)
  2616. {
  2617. return it1.m == it2.m && it1.ptr == it2.ptr;
  2618. }
  2619. static inline
  2620. bool operator != (const SparseMatConstIterator& it1, const SparseMatConstIterator& it2)
  2621. {
  2622. return !(it1 == it2);
  2623. }
  2624. ///////////////////////// SparseMatIterator /////////////////////////
  2625. inline
  2626. SparseMatIterator::SparseMatIterator()
  2627. {}
  2628. inline
  2629. SparseMatIterator::SparseMatIterator(SparseMat* _m)
  2630. : SparseMatConstIterator(_m)
  2631. {}
  2632. inline
  2633. SparseMatIterator::SparseMatIterator(const SparseMatIterator& it)
  2634. : SparseMatConstIterator(it)
  2635. {}
  2636. inline
  2637. SparseMatIterator& SparseMatIterator::operator = (const SparseMatIterator& it)
  2638. {
  2639. (SparseMatConstIterator&)*this = it;
  2640. return *this;
  2641. }
  2642. template<typename _Tp> inline
  2643. _Tp& SparseMatIterator::value() const
  2644. {
  2645. return *(_Tp*)ptr;
  2646. }
  2647. inline
  2648. SparseMat::Node* SparseMatIterator::node() const
  2649. {
  2650. return (SparseMat::Node*)SparseMatConstIterator::node();
  2651. }
  2652. inline
  2653. SparseMatIterator& SparseMatIterator::operator ++()
  2654. {
  2655. SparseMatConstIterator::operator ++();
  2656. return *this;
  2657. }
  2658. inline
  2659. SparseMatIterator SparseMatIterator::operator ++(int)
  2660. {
  2661. SparseMatIterator it = *this;
  2662. ++*this;
  2663. return it;
  2664. }
  2665. ////////////////////// SparseMatConstIterator_ //////////////////////
  2666. template<typename _Tp> inline
  2667. SparseMatConstIterator_<_Tp>::SparseMatConstIterator_()
  2668. {}
  2669. template<typename _Tp> inline
  2670. SparseMatConstIterator_<_Tp>::SparseMatConstIterator_(const SparseMat_<_Tp>* _m)
  2671. : SparseMatConstIterator(_m)
  2672. {}
  2673. template<typename _Tp> inline
  2674. SparseMatConstIterator_<_Tp>::SparseMatConstIterator_(const SparseMat* _m)
  2675. : SparseMatConstIterator(_m)
  2676. {
  2677. CV_Assert( _m->type() == traits::Type<_Tp>::value );
  2678. }
  2679. template<typename _Tp> inline
  2680. SparseMatConstIterator_<_Tp>::SparseMatConstIterator_(const SparseMatConstIterator_<_Tp>& it)
  2681. : SparseMatConstIterator(it)
  2682. {}
  2683. template<typename _Tp> inline
  2684. SparseMatConstIterator_<_Tp>& SparseMatConstIterator_<_Tp>::operator = (const SparseMatConstIterator_<_Tp>& it)
  2685. {
  2686. return reinterpret_cast<SparseMatConstIterator_<_Tp>&>
  2687. (*reinterpret_cast<SparseMatConstIterator*>(this) =
  2688. reinterpret_cast<const SparseMatConstIterator&>(it));
  2689. }
  2690. template<typename _Tp> inline
  2691. const _Tp& SparseMatConstIterator_<_Tp>::operator *() const
  2692. {
  2693. return *(const _Tp*)this->ptr;
  2694. }
  2695. template<typename _Tp> inline
  2696. SparseMatConstIterator_<_Tp>& SparseMatConstIterator_<_Tp>::operator ++()
  2697. {
  2698. SparseMatConstIterator::operator ++();
  2699. return *this;
  2700. }
  2701. template<typename _Tp> inline
  2702. SparseMatConstIterator_<_Tp> SparseMatConstIterator_<_Tp>::operator ++(int)
  2703. {
  2704. SparseMatConstIterator_<_Tp> it = *this;
  2705. SparseMatConstIterator::operator ++();
  2706. return it;
  2707. }
  2708. ///////////////////////// SparseMatIterator_ ////////////////////////
  2709. template<typename _Tp> inline
  2710. SparseMatIterator_<_Tp>::SparseMatIterator_()
  2711. {}
  2712. template<typename _Tp> inline
  2713. SparseMatIterator_<_Tp>::SparseMatIterator_(SparseMat_<_Tp>* _m)
  2714. : SparseMatConstIterator_<_Tp>(_m)
  2715. {}
  2716. template<typename _Tp> inline
  2717. SparseMatIterator_<_Tp>::SparseMatIterator_(SparseMat* _m)
  2718. : SparseMatConstIterator_<_Tp>(_m)
  2719. {}
  2720. template<typename _Tp> inline
  2721. SparseMatIterator_<_Tp>::SparseMatIterator_(const SparseMatIterator_<_Tp>& it)
  2722. : SparseMatConstIterator_<_Tp>(it)
  2723. {}
  2724. template<typename _Tp> inline
  2725. SparseMatIterator_<_Tp>& SparseMatIterator_<_Tp>::operator = (const SparseMatIterator_<_Tp>& it)
  2726. {
  2727. return reinterpret_cast<SparseMatIterator_<_Tp>&>
  2728. (*reinterpret_cast<SparseMatConstIterator*>(this) =
  2729. reinterpret_cast<const SparseMatConstIterator&>(it));
  2730. }
  2731. template<typename _Tp> inline
  2732. _Tp& SparseMatIterator_<_Tp>::operator *() const
  2733. {
  2734. return *(_Tp*)this->ptr;
  2735. }
  2736. template<typename _Tp> inline
  2737. SparseMatIterator_<_Tp>& SparseMatIterator_<_Tp>::operator ++()
  2738. {
  2739. SparseMatConstIterator::operator ++();
  2740. return *this;
  2741. }
  2742. template<typename _Tp> inline
  2743. SparseMatIterator_<_Tp> SparseMatIterator_<_Tp>::operator ++(int)
  2744. {
  2745. SparseMatIterator_<_Tp> it = *this;
  2746. SparseMatConstIterator::operator ++();
  2747. return it;
  2748. }
  2749. //////////////////////// MatCommaInitializer_ ///////////////////////
  2750. template<typename _Tp> inline
  2751. MatCommaInitializer_<_Tp>::MatCommaInitializer_(Mat_<_Tp>* _m)
  2752. : it(_m)
  2753. {}
  2754. template<typename _Tp> template<typename T2> inline
  2755. MatCommaInitializer_<_Tp>& MatCommaInitializer_<_Tp>::operator , (T2 v)
  2756. {
  2757. CV_DbgAssert( this->it < ((const Mat_<_Tp>*)this->it.m)->end() );
  2758. *this->it = _Tp(v);
  2759. ++this->it;
  2760. return *this;
  2761. }
  2762. template<typename _Tp> inline
  2763. MatCommaInitializer_<_Tp>::operator Mat_<_Tp>() const
  2764. {
  2765. CV_DbgAssert( this->it == ((const Mat_<_Tp>*)this->it.m)->end() );
  2766. return Mat_<_Tp>(*this->it.m);
  2767. }
  2768. template<typename _Tp, typename T2> static inline
  2769. MatCommaInitializer_<_Tp> operator << (const Mat_<_Tp>& m, T2 val)
  2770. {
  2771. MatCommaInitializer_<_Tp> commaInitializer((Mat_<_Tp>*)&m);
  2772. return (commaInitializer, val);
  2773. }
  2774. ///////////////////////// Matrix Expressions ////////////////////////
  2775. inline
  2776. Mat& Mat::operator = (const MatExpr& e)
  2777. {
  2778. e.op->assign(e, *this);
  2779. return *this;
  2780. }
  2781. template<typename _Tp> inline
  2782. Mat_<_Tp>::Mat_(const MatExpr& e)
  2783. {
  2784. e.op->assign(e, *this, traits::Type<_Tp>::value);
  2785. }
  2786. template<typename _Tp> inline
  2787. Mat_<_Tp>& Mat_<_Tp>::operator = (const MatExpr& e)
  2788. {
  2789. e.op->assign(e, *this, traits::Type<_Tp>::value);
  2790. return *this;
  2791. }
  2792. template<typename _Tp> inline
  2793. MatExpr Mat_<_Tp>::zeros(int rows, int cols)
  2794. {
  2795. return Mat::zeros(rows, cols, traits::Type<_Tp>::value);
  2796. }
  2797. template<typename _Tp> inline
  2798. MatExpr Mat_<_Tp>::zeros(Size sz)
  2799. {
  2800. return Mat::zeros(sz, traits::Type<_Tp>::value);
  2801. }
  2802. template<typename _Tp> inline
  2803. MatExpr Mat_<_Tp>::ones(int rows, int cols)
  2804. {
  2805. return Mat::ones(rows, cols, traits::Type<_Tp>::value);
  2806. }
  2807. template<typename _Tp> inline
  2808. MatExpr Mat_<_Tp>::ones(Size sz)
  2809. {
  2810. return Mat::ones(sz, traits::Type<_Tp>::value);
  2811. }
  2812. template<typename _Tp> inline
  2813. MatExpr Mat_<_Tp>::eye(int rows, int cols)
  2814. {
  2815. return Mat::eye(rows, cols, traits::Type<_Tp>::value);
  2816. }
  2817. template<typename _Tp> inline
  2818. MatExpr Mat_<_Tp>::eye(Size sz)
  2819. {
  2820. return Mat::eye(sz, traits::Type<_Tp>::value);
  2821. }
  2822. inline
  2823. MatExpr::MatExpr()
  2824. : op(0), flags(0), a(Mat()), b(Mat()), c(Mat()), alpha(0), beta(0), s()
  2825. {}
  2826. inline
  2827. MatExpr::MatExpr(const MatOp* _op, int _flags, const Mat& _a, const Mat& _b,
  2828. const Mat& _c, double _alpha, double _beta, const Scalar& _s)
  2829. : op(_op), flags(_flags), a(_a), b(_b), c(_c), alpha(_alpha), beta(_beta), s(_s)
  2830. {}
  2831. inline
  2832. MatExpr::operator Mat() const
  2833. {
  2834. Mat m;
  2835. op->assign(*this, m);
  2836. return m;
  2837. }
  2838. template<typename _Tp> inline
  2839. MatExpr::operator Mat_<_Tp>() const
  2840. {
  2841. Mat_<_Tp> m;
  2842. op->assign(*this, m, traits::Type<_Tp>::value);
  2843. return m;
  2844. }
  2845. template<typename _Tp> static inline
  2846. MatExpr min(const Mat_<_Tp>& a, const Mat_<_Tp>& b)
  2847. {
  2848. return cv::min((const Mat&)a, (const Mat&)b);
  2849. }
  2850. template<typename _Tp> static inline
  2851. MatExpr min(const Mat_<_Tp>& a, double s)
  2852. {
  2853. return cv::min((const Mat&)a, s);
  2854. }
  2855. template<typename _Tp> static inline
  2856. MatExpr min(double s, const Mat_<_Tp>& a)
  2857. {
  2858. return cv::min((const Mat&)a, s);
  2859. }
  2860. template<typename _Tp> static inline
  2861. MatExpr max(const Mat_<_Tp>& a, const Mat_<_Tp>& b)
  2862. {
  2863. return cv::max((const Mat&)a, (const Mat&)b);
  2864. }
  2865. template<typename _Tp> static inline
  2866. MatExpr max(const Mat_<_Tp>& a, double s)
  2867. {
  2868. return cv::max((const Mat&)a, s);
  2869. }
  2870. template<typename _Tp> static inline
  2871. MatExpr max(double s, const Mat_<_Tp>& a)
  2872. {
  2873. return cv::max((const Mat&)a, s);
  2874. }
  2875. template<typename _Tp> static inline
  2876. MatExpr abs(const Mat_<_Tp>& m)
  2877. {
  2878. return cv::abs((const Mat&)m);
  2879. }
  2880. static inline
  2881. Mat& operator += (Mat& a, const MatExpr& b)
  2882. {
  2883. b.op->augAssignAdd(b, a);
  2884. return a;
  2885. }
  2886. static inline
  2887. const Mat& operator += (const Mat& a, const MatExpr& b)
  2888. {
  2889. b.op->augAssignAdd(b, (Mat&)a);
  2890. return a;
  2891. }
  2892. template<typename _Tp> static inline
  2893. Mat_<_Tp>& operator += (Mat_<_Tp>& a, const MatExpr& b)
  2894. {
  2895. b.op->augAssignAdd(b, a);
  2896. return a;
  2897. }
  2898. template<typename _Tp> static inline
  2899. const Mat_<_Tp>& operator += (const Mat_<_Tp>& a, const MatExpr& b)
  2900. {
  2901. b.op->augAssignAdd(b, (Mat&)a);
  2902. return a;
  2903. }
  2904. static inline
  2905. Mat& operator -= (Mat& a, const MatExpr& b)
  2906. {
  2907. b.op->augAssignSubtract(b, a);
  2908. return a;
  2909. }
  2910. static inline
  2911. const Mat& operator -= (const Mat& a, const MatExpr& b)
  2912. {
  2913. b.op->augAssignSubtract(b, (Mat&)a);
  2914. return a;
  2915. }
  2916. template<typename _Tp> static inline
  2917. Mat_<_Tp>& operator -= (Mat_<_Tp>& a, const MatExpr& b)
  2918. {
  2919. b.op->augAssignSubtract(b, a);
  2920. return a;
  2921. }
  2922. template<typename _Tp> static inline
  2923. const Mat_<_Tp>& operator -= (const Mat_<_Tp>& a, const MatExpr& b)
  2924. {
  2925. b.op->augAssignSubtract(b, (Mat&)a);
  2926. return a;
  2927. }
  2928. static inline
  2929. Mat& operator *= (Mat& a, const MatExpr& b)
  2930. {
  2931. b.op->augAssignMultiply(b, a);
  2932. return a;
  2933. }
  2934. static inline
  2935. const Mat& operator *= (const Mat& a, const MatExpr& b)
  2936. {
  2937. b.op->augAssignMultiply(b, (Mat&)a);
  2938. return a;
  2939. }
  2940. template<typename _Tp> static inline
  2941. Mat_<_Tp>& operator *= (Mat_<_Tp>& a, const MatExpr& b)
  2942. {
  2943. b.op->augAssignMultiply(b, a);
  2944. return a;
  2945. }
  2946. template<typename _Tp> static inline
  2947. const Mat_<_Tp>& operator *= (const Mat_<_Tp>& a, const MatExpr& b)
  2948. {
  2949. b.op->augAssignMultiply(b, (Mat&)a);
  2950. return a;
  2951. }
  2952. static inline
  2953. Mat& operator /= (Mat& a, const MatExpr& b)
  2954. {
  2955. b.op->augAssignDivide(b, a);
  2956. return a;
  2957. }
  2958. static inline
  2959. const Mat& operator /= (const Mat& a, const MatExpr& b)
  2960. {
  2961. b.op->augAssignDivide(b, (Mat&)a);
  2962. return a;
  2963. }
  2964. template<typename _Tp> static inline
  2965. Mat_<_Tp>& operator /= (Mat_<_Tp>& a, const MatExpr& b)
  2966. {
  2967. b.op->augAssignDivide(b, a);
  2968. return a;
  2969. }
  2970. template<typename _Tp> static inline
  2971. const Mat_<_Tp>& operator /= (const Mat_<_Tp>& a, const MatExpr& b)
  2972. {
  2973. b.op->augAssignDivide(b, (Mat&)a);
  2974. return a;
  2975. }
  2976. //////////////////////////////// UMat ////////////////////////////////
  2977. inline
  2978. UMat::UMat(UMatUsageFlags _usageFlags)
  2979. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), allocator(0), usageFlags(_usageFlags), u(0), offset(0), size(&rows)
  2980. {}
  2981. inline
  2982. UMat::UMat(int _rows, int _cols, int _type, UMatUsageFlags _usageFlags)
  2983. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), allocator(0), usageFlags(_usageFlags), u(0), offset(0), size(&rows)
  2984. {
  2985. create(_rows, _cols, _type);
  2986. }
  2987. inline
  2988. UMat::UMat(int _rows, int _cols, int _type, const Scalar& _s, UMatUsageFlags _usageFlags)
  2989. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), allocator(0), usageFlags(_usageFlags), u(0), offset(0), size(&rows)
  2990. {
  2991. create(_rows, _cols, _type);
  2992. *this = _s;
  2993. }
  2994. inline
  2995. UMat::UMat(Size _sz, int _type, UMatUsageFlags _usageFlags)
  2996. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), allocator(0), usageFlags(_usageFlags), u(0), offset(0), size(&rows)
  2997. {
  2998. create( _sz.height, _sz.width, _type );
  2999. }
  3000. inline
  3001. UMat::UMat(Size _sz, int _type, const Scalar& _s, UMatUsageFlags _usageFlags)
  3002. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), allocator(0), usageFlags(_usageFlags), u(0), offset(0), size(&rows)
  3003. {
  3004. create(_sz.height, _sz.width, _type);
  3005. *this = _s;
  3006. }
  3007. inline
  3008. UMat::UMat(int _dims, const int* _sz, int _type, UMatUsageFlags _usageFlags)
  3009. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), allocator(0), usageFlags(_usageFlags), u(0), offset(0), size(&rows)
  3010. {
  3011. create(_dims, _sz, _type);
  3012. }
  3013. inline
  3014. UMat::UMat(int _dims, const int* _sz, int _type, const Scalar& _s, UMatUsageFlags _usageFlags)
  3015. : flags(MAGIC_VAL), dims(0), rows(0), cols(0), allocator(0), usageFlags(_usageFlags), u(0), offset(0), size(&rows)
  3016. {
  3017. create(_dims, _sz, _type);
  3018. *this = _s;
  3019. }
  3020. inline
  3021. UMat::UMat(const UMat& m)
  3022. : flags(m.flags), dims(m.dims), rows(m.rows), cols(m.cols), allocator(m.allocator),
  3023. usageFlags(m.usageFlags), u(m.u), offset(m.offset), size(&rows)
  3024. {
  3025. addref();
  3026. if( m.dims <= 2 )
  3027. {
  3028. step[0] = m.step[0]; step[1] = m.step[1];
  3029. }
  3030. else
  3031. {
  3032. dims = 0;
  3033. copySize(m);
  3034. }
  3035. }
  3036. template<typename _Tp> inline
  3037. UMat::UMat(const std::vector<_Tp>& vec, bool copyData)
  3038. : flags(MAGIC_VAL | traits::Type<_Tp>::value | CV_MAT_CONT_FLAG), dims(2), rows((int)vec.size()),
  3039. cols(1), allocator(0), usageFlags(USAGE_DEFAULT), u(0), offset(0), size(&rows)
  3040. {
  3041. if(vec.empty())
  3042. return;
  3043. if( !copyData )
  3044. {
  3045. // !!!TODO!!!
  3046. CV_Error(Error::StsNotImplemented, "");
  3047. }
  3048. else
  3049. Mat((int)vec.size(), 1, traits::Type<_Tp>::value, (uchar*)&vec[0]).copyTo(*this);
  3050. }
  3051. inline
  3052. UMat& UMat::operator = (const UMat& m)
  3053. {
  3054. if( this != &m )
  3055. {
  3056. const_cast<UMat&>(m).addref();
  3057. release();
  3058. flags = m.flags;
  3059. if( dims <= 2 && m.dims <= 2 )
  3060. {
  3061. dims = m.dims;
  3062. rows = m.rows;
  3063. cols = m.cols;
  3064. step[0] = m.step[0];
  3065. step[1] = m.step[1];
  3066. }
  3067. else
  3068. copySize(m);
  3069. allocator = m.allocator;
  3070. if (usageFlags == USAGE_DEFAULT)
  3071. usageFlags = m.usageFlags;
  3072. u = m.u;
  3073. offset = m.offset;
  3074. }
  3075. return *this;
  3076. }
  3077. inline
  3078. UMat UMat::row(int y) const
  3079. {
  3080. return UMat(*this, Range(y, y + 1), Range::all());
  3081. }
  3082. inline
  3083. UMat UMat::col(int x) const
  3084. {
  3085. return UMat(*this, Range::all(), Range(x, x + 1));
  3086. }
  3087. inline
  3088. UMat UMat::rowRange(int startrow, int endrow) const
  3089. {
  3090. return UMat(*this, Range(startrow, endrow), Range::all());
  3091. }
  3092. inline
  3093. UMat UMat::rowRange(const Range& r) const
  3094. {
  3095. return UMat(*this, r, Range::all());
  3096. }
  3097. inline
  3098. UMat UMat::colRange(int startcol, int endcol) const
  3099. {
  3100. return UMat(*this, Range::all(), Range(startcol, endcol));
  3101. }
  3102. inline
  3103. UMat UMat::colRange(const Range& r) const
  3104. {
  3105. return UMat(*this, Range::all(), r);
  3106. }
  3107. inline
  3108. UMat UMat::clone() const
  3109. {
  3110. UMat m;
  3111. copyTo(m);
  3112. return m;
  3113. }
  3114. inline
  3115. void UMat::assignTo( UMat& m, int _type ) const
  3116. {
  3117. if( _type < 0 )
  3118. m = *this;
  3119. else
  3120. convertTo(m, _type);
  3121. }
  3122. inline
  3123. void UMat::create(int _rows, int _cols, int _type, UMatUsageFlags _usageFlags)
  3124. {
  3125. _type &= TYPE_MASK;
  3126. if( dims <= 2 && rows == _rows && cols == _cols && type() == _type && u )
  3127. return;
  3128. int sz[] = {_rows, _cols};
  3129. create(2, sz, _type, _usageFlags);
  3130. }
  3131. inline
  3132. void UMat::create(Size _sz, int _type, UMatUsageFlags _usageFlags)
  3133. {
  3134. create(_sz.height, _sz.width, _type, _usageFlags);
  3135. }
  3136. inline
  3137. void UMat::addref()
  3138. {
  3139. if( u )
  3140. CV_XADD(&(u->urefcount), 1);
  3141. }
  3142. inline void UMat::release()
  3143. {
  3144. if( u && CV_XADD(&(u->urefcount), -1) == 1 )
  3145. deallocate();
  3146. for(int i = 0; i < dims; i++)
  3147. size.p[i] = 0;
  3148. u = 0;
  3149. }
  3150. inline
  3151. UMat UMat::operator()( Range _rowRange, Range _colRange ) const
  3152. {
  3153. return UMat(*this, _rowRange, _colRange);
  3154. }
  3155. inline
  3156. UMat UMat::operator()( const Rect& roi ) const
  3157. {
  3158. return UMat(*this, roi);
  3159. }
  3160. inline
  3161. UMat UMat::operator()(const Range* ranges) const
  3162. {
  3163. return UMat(*this, ranges);
  3164. }
  3165. inline
  3166. UMat UMat::operator()(const std::vector<Range>& ranges) const
  3167. {
  3168. return UMat(*this, ranges);
  3169. }
  3170. inline
  3171. bool UMat::isContinuous() const
  3172. {
  3173. return (flags & CONTINUOUS_FLAG) != 0;
  3174. }
  3175. inline
  3176. bool UMat::isSubmatrix() const
  3177. {
  3178. return (flags & SUBMATRIX_FLAG) != 0;
  3179. }
  3180. inline
  3181. size_t UMat::elemSize() const
  3182. {
  3183. return dims > 0 ? step.p[dims - 1] : 0;
  3184. }
  3185. inline
  3186. size_t UMat::elemSize1() const
  3187. {
  3188. return CV_ELEM_SIZE1(flags);
  3189. }
  3190. inline
  3191. int UMat::type() const
  3192. {
  3193. return CV_MAT_TYPE(flags);
  3194. }
  3195. inline
  3196. int UMat::depth() const
  3197. {
  3198. return CV_MAT_DEPTH(flags);
  3199. }
  3200. inline
  3201. int UMat::channels() const
  3202. {
  3203. return CV_MAT_CN(flags);
  3204. }
  3205. inline
  3206. size_t UMat::step1(int i) const
  3207. {
  3208. return step.p[i] / elemSize1();
  3209. }
  3210. inline
  3211. bool UMat::empty() const
  3212. {
  3213. return u == 0 || total() == 0 || dims == 0;
  3214. }
  3215. inline
  3216. size_t UMat::total() const
  3217. {
  3218. if( dims <= 2 )
  3219. return (size_t)rows * cols;
  3220. size_t p = 1;
  3221. for( int i = 0; i < dims; i++ )
  3222. p *= size[i];
  3223. return p;
  3224. }
  3225. #ifdef CV_CXX_MOVE_SEMANTICS
  3226. inline
  3227. UMat::UMat(UMat&& m)
  3228. : flags(m.flags), dims(m.dims), rows(m.rows), cols(m.cols), allocator(m.allocator),
  3229. usageFlags(m.usageFlags), u(m.u), offset(m.offset), size(&rows)
  3230. {
  3231. if (m.dims <= 2) // move new step/size info
  3232. {
  3233. step[0] = m.step[0];
  3234. step[1] = m.step[1];
  3235. }
  3236. else
  3237. {
  3238. CV_DbgAssert(m.step.p != m.step.buf);
  3239. step.p = m.step.p;
  3240. size.p = m.size.p;
  3241. m.step.p = m.step.buf;
  3242. m.size.p = &m.rows;
  3243. }
  3244. m.flags = MAGIC_VAL; m.dims = m.rows = m.cols = 0;
  3245. m.allocator = NULL;
  3246. m.u = NULL;
  3247. m.offset = 0;
  3248. }
  3249. inline
  3250. UMat& UMat::operator = (UMat&& m)
  3251. {
  3252. if (this == &m)
  3253. return *this;
  3254. release();
  3255. flags = m.flags; dims = m.dims; rows = m.rows; cols = m.cols;
  3256. allocator = m.allocator; usageFlags = m.usageFlags;
  3257. u = m.u;
  3258. offset = m.offset;
  3259. if (step.p != step.buf) // release self step/size
  3260. {
  3261. fastFree(step.p);
  3262. step.p = step.buf;
  3263. size.p = &rows;
  3264. }
  3265. if (m.dims <= 2) // move new step/size info
  3266. {
  3267. step[0] = m.step[0];
  3268. step[1] = m.step[1];
  3269. }
  3270. else
  3271. {
  3272. CV_DbgAssert(m.step.p != m.step.buf);
  3273. step.p = m.step.p;
  3274. size.p = m.size.p;
  3275. m.step.p = m.step.buf;
  3276. m.size.p = &m.rows;
  3277. }
  3278. m.flags = MAGIC_VAL; m.dims = m.rows = m.cols = 0;
  3279. m.allocator = NULL;
  3280. m.u = NULL;
  3281. m.offset = 0;
  3282. return *this;
  3283. }
  3284. #endif
  3285. inline bool UMatData::hostCopyObsolete() const { return (flags & HOST_COPY_OBSOLETE) != 0; }
  3286. inline bool UMatData::deviceCopyObsolete() const { return (flags & DEVICE_COPY_OBSOLETE) != 0; }
  3287. inline bool UMatData::deviceMemMapped() const { return (flags & DEVICE_MEM_MAPPED) != 0; }
  3288. inline bool UMatData::copyOnMap() const { return (flags & COPY_ON_MAP) != 0; }
  3289. inline bool UMatData::tempUMat() const { return (flags & TEMP_UMAT) != 0; }
  3290. inline bool UMatData::tempCopiedUMat() const { return (flags & TEMP_COPIED_UMAT) == TEMP_COPIED_UMAT; }
  3291. inline void UMatData::markDeviceMemMapped(bool flag)
  3292. {
  3293. if(flag)
  3294. flags |= DEVICE_MEM_MAPPED;
  3295. else
  3296. flags &= ~DEVICE_MEM_MAPPED;
  3297. }
  3298. inline void UMatData::markHostCopyObsolete(bool flag)
  3299. {
  3300. if(flag)
  3301. flags |= HOST_COPY_OBSOLETE;
  3302. else
  3303. flags &= ~HOST_COPY_OBSOLETE;
  3304. }
  3305. inline void UMatData::markDeviceCopyObsolete(bool flag)
  3306. {
  3307. if(flag)
  3308. flags |= DEVICE_COPY_OBSOLETE;
  3309. else
  3310. flags &= ~DEVICE_COPY_OBSOLETE;
  3311. }
  3312. inline UMatDataAutoLock::UMatDataAutoLock(UMatData* _u) : u(_u) { u->lock(); }
  3313. inline UMatDataAutoLock::~UMatDataAutoLock() { u->unlock(); }
  3314. //! @endcond
  3315. } //cv
  3316. #ifdef _MSC_VER
  3317. #pragma warning( pop )
  3318. #endif
  3319. #endif