Changeset 1956 for XIOS/dev/dev_ym/XIOS_COUPLING/src/node/domain.hpp
- Timestamp:
- 10/08/20 13:10:29 (4 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
XIOS/dev/dev_ym/XIOS_COUPLING/src/node/domain.hpp
r1943 r1956 87 87 void checkAttributesOnClient(); 88 88 void checkAttributesOnClientAfterTransformation(); 89 void checkEligibilityForCompressedOutput(void);90 89 91 90 void sendCheckedAttributes(); … … 112 111 bool isEmpty(void) const; 113 112 bool isDistributed(void) const; 114 bool isCompressible(void) const; 115 113 114 public : 115 /*! 116 \brief return if the domain can be written or not in a compressed way. 117 ie if there are some masked or indexed point on the domain. Valid only on server side. 118 \return true if domain can be writtedn in a compressed way 119 */ 120 bool isCompressible(void) { if (!isCompressibleComputed_) computeIsCompressible() ; return isCompressible_ ;} 121 private : 122 bool isCompressible_ ; /** specify if the domain can be written in a compressed way */ 123 bool isCompressibleComputed_=false ; /** Indicate if compressability has been computed*/ 124 void computeIsCompressible() ; 125 126 public : 116 127 std::vector<int> getNbGlob(); 117 128 bool isEqual(CDomain* domain); … … 296 307 std::map<int, std::vector<int> > connectedServerRank_; 297 308 298 //! True if and only if the data defined on the domain can be outputted in a compressed way299 bool isCompressible_;300 309 bool isRedistributed_; 301 310 TransMapTypes transformationMap_; … … 332 341 public: 333 342 void computeRemoteElement(CContextClient* client, EDistributionType) ; 334 void distributeToServer(CContextClient* client, std::map<int, CArray<size_t,1>>& globalIndex, const string& domainId="") ; 343 void distributeToServer(CContextClient* client, std::map<int, CArray<size_t,1>>& globalIndex, CScattererConnector* &scattererConnector, 344 const string& domainId="") ; 335 345 336 346 static void recvDomainDistribution(CEventServer& event) ;
Note: See TracChangeset
for help on using the changeset viewer.