pub fn shard_key(&self, include_workchain: bool) -> SliceData {
        let mut cell = BuilderData::new();
        if include_workchain {
            cell.append_i32(self.workchain_id).unwrap();
        }
        if self.shard_prefix_with_tag() != SHARD_FULL {
            let prefix_len = self.prefix_len();
            let prefix = self.shard_prefix_with_tag() >> (64 - prefix_len);
            cell.append_bits(prefix as usize, prefix_len as usize).unwrap();
        }
        cell.into_cell().unwrap().into()
    }
/// Get bitstring-key for BinTree operation for Shard
Get bitstring-key for BinTree operation for Shard
Get bitstring - key for BinTree operation for Shard
pub fn shard_key(&self, include_workchain: bool) -> SliceData {
        let mut cell = BuilderData::new();
        if include_workchain {
            cell.append_i32(self.workchain_id).unwrap();
        }
        if self.shard_prefix_with_tag() != SHARD_FULL {
            let prefix_len = self.prefix_len();
            let prefix = self.shard_prefix_with_tag() >> (64 - prefix_len);
            cell.append_bits(prefix as usize, prefix_len as usize).unwrap();
        }
        cell.into_cell().unwrap().into()
    }
pub fn shard_key ( & self , include_workchain : bool ) -> SliceData { let mut cell = BuilderData :: new ( ) ; if include_workchain { cell . append_i32 ( self . workchain_id ) . unwrap ( ) ; } if self . shard_prefix_with_tag ( ) != SHARD_FULL { let prefix_len = self . prefix_len ( ) ; let prefix = self . shard_prefix_with_tag ( ) >> ( 64 - prefix_len ) ; cell . append_bits ( prefix as usize , prefix_len as usize ) . unwrap ( ) ; } cell . into_cell ( ) . unwrap ( ) . into ( ) }
Get bitstring-key for BinTree operation for Shard
Get bitstring - key for BinTree operation for Shard
&self
include_workchain
bool
&self
include_workchain
bool