Public Member Functions |
| | sc_unsigned (int nb=sc_length_param().len()) |
| | sc_unsigned (const sc_unsigned &v) |
| | sc_unsigned (const sc_signed &v) |
| template<class T > |
| | sc_unsigned (const sc_generic_base< T > &v) |
| | sc_unsigned (const sc_bv_base &v) |
| | sc_unsigned (const sc_lv_base &v) |
| | sc_unsigned (const sc_int_subref_r &v) |
| | sc_unsigned (const sc_uint_subref_r &v) |
| | sc_unsigned (const sc_signed_subref_r &v) |
| | sc_unsigned (const sc_unsigned_subref_r &v) |
| const sc_unsigned & | operator= (const sc_unsigned &v) |
| const sc_unsigned & | operator= (const sc_unsigned_subref_r &a) |
| template<class T > |
| const sc_unsigned & | operator= (const sc_generic_base< T > &a) |
| const sc_unsigned & | operator= (const sc_signed &v) |
| const sc_unsigned & | operator= (const sc_signed_subref_r &a) |
| const sc_unsigned & | operator= (const char *v) |
| const sc_unsigned & | operator= (int64 v) |
| const sc_unsigned & | operator= (uint64 v) |
| const sc_unsigned & | operator= (long v) |
| const sc_unsigned & | operator= (unsigned long v) |
| const sc_unsigned & | operator= (int v) |
| const sc_unsigned & | operator= (unsigned int v) |
| const sc_unsigned & | operator= (double v) |
| const sc_unsigned & | operator= (const sc_int_base &v) |
| const sc_unsigned & | operator= (const sc_uint_base &v) |
| const sc_unsigned & | operator= (const sc_bv_base &) |
| const sc_unsigned & | operator= (const sc_lv_base &) |
| virtual | ~sc_unsigned () |
| sc_digit * | get_raw () const |
| virtual int | concat_length (bool *xz_present_p) const |
| virtual bool | concat_get_ctrl (sc_digit *dst_p, int low_i) const |
| virtual bool | concat_get_data (sc_digit *dst_p, int low_i) const |
| virtual uint64 | concat_get_uint64 () const |
| virtual void | concat_set (int64 src, int low_i) |
| virtual void | concat_set (const sc_signed &src, int low_i) |
| virtual void | concat_set (const sc_unsigned &src, int low_i) |
| virtual void | concat_set (uint64 src, int low_i) |
| sc_unsigned & | operator++ () |
| const sc_unsigned | operator++ (int) |
| sc_unsigned & | operator-- () |
| const sc_unsigned | operator-- (int) |
| void | check_index (int i) const |
| void | invalid_index (int i) const |
| sc_unsigned_bitref & | operator[] (int i) |
| const sc_unsigned_bitref_r & | operator[] (int i) const |
| sc_unsigned_bitref & | bit (int i) |
| const sc_unsigned_bitref_r & | bit (int i) const |
| void | check_range (int l, int r) const |
| void | invalid_range (int l, int r) const |
| sc_unsigned_subref & | range (int i, int j) |
| const sc_unsigned_subref_r & | range (int i, int j) const |
| sc_unsigned_subref & | operator() (int i, int j) |
| const sc_unsigned_subref_r & | operator() (int i, int j) const |
| int | to_int () const |
| unsigned int | to_uint () const |
| long | to_long () const |
| unsigned long | to_ulong () const |
| int64 | to_int64 () const |
| uint64 | to_uint64 () const |
| double | to_double () const |
| const std::string | to_string (sc_numrep numrep=SC_DEC) const |
| const std::string | to_string (sc_numrep numrep, bool w_prefix) const |
| void | print (::std::ostream &os=::std::cout) const |
| void | scan (::std::istream &is=::std::cin) |
| void | dump (::std::ostream &os=::std::cout) const |
| int | length () const |
| bool | iszero () const |
| bool | sign () const |
| bool | and_reduce () const |
| bool | nand_reduce () const |
| bool | or_reduce () const |
| bool | nor_reduce () const |
| bool | xor_reduce () const |
| bool | xnor_reduce () const |
| bool | test (int i) const |
| void | set (int i) |
| void | clear (int i) |
| void | set (int i, bool v) |
| void | invert (int i) |
| void | reverse () |
| void | get_packed_rep (sc_digit *buf) const |
| void | set_packed_rep (sc_digit *buf) |
| const sc_unsigned & | operator+= (const sc_signed &v) |
| const sc_unsigned & | operator+= (const sc_unsigned &v) |
| const sc_unsigned & | operator+= (int64 v) |
| const sc_unsigned & | operator+= (uint64 v) |
| const sc_unsigned & | operator+= (long v) |
| const sc_unsigned & | operator+= (unsigned long v) |
| const sc_unsigned & | operator+= (int v) |
| const sc_unsigned & | operator+= (unsigned int v) |
| const sc_unsigned & | operator+= (const sc_int_base &v) |
| const sc_unsigned & | operator+= (const sc_uint_base &v) |
| const sc_unsigned & | operator-= (const sc_signed &v) |
| const sc_unsigned & | operator-= (const sc_unsigned &v) |
| const sc_unsigned & | operator-= (int64 v) |
| const sc_unsigned & | operator-= (uint64 v) |
| const sc_unsigned & | operator-= (long v) |
| const sc_unsigned & | operator-= (unsigned long v) |
| const sc_unsigned & | operator-= (int v) |
| const sc_unsigned & | operator-= (unsigned int v) |
| const sc_unsigned & | operator-= (const sc_int_base &v) |
| const sc_unsigned & | operator-= (const sc_uint_base &v) |
| const sc_unsigned & | operator*= (const sc_signed &v) |
| const sc_unsigned & | operator*= (const sc_unsigned &v) |
| const sc_unsigned & | operator*= (int64 v) |
| const sc_unsigned & | operator*= (uint64 v) |
| const sc_unsigned & | operator*= (long v) |
| const sc_unsigned & | operator*= (unsigned long v) |
| const sc_unsigned & | operator*= (int v) |
| const sc_unsigned & | operator*= (unsigned int v) |
| const sc_unsigned & | operator*= (const sc_int_base &v) |
| const sc_unsigned & | operator*= (const sc_uint_base &v) |
| const sc_unsigned & | operator/= (const sc_signed &v) |
| const sc_unsigned & | operator/= (const sc_unsigned &v) |
| const sc_unsigned & | operator/= (int64 v) |
| const sc_unsigned & | operator/= (uint64 v) |
| const sc_unsigned & | operator/= (long v) |
| const sc_unsigned & | operator/= (unsigned long v) |
| const sc_unsigned & | operator/= (int v) |
| const sc_unsigned & | operator/= (unsigned int v) |
| const sc_unsigned & | operator/= (const sc_int_base &v) |
| const sc_unsigned & | operator/= (const sc_uint_base &v) |
| const sc_unsigned & | operator%= (const sc_signed &v) |
| const sc_unsigned & | operator%= (const sc_unsigned &v) |
| const sc_unsigned & | operator%= (int64 v) |
| const sc_unsigned & | operator%= (uint64 v) |
| const sc_unsigned & | operator%= (long v) |
| const sc_unsigned & | operator%= (unsigned long v) |
| const sc_unsigned & | operator%= (int v) |
| const sc_unsigned & | operator%= (unsigned int v) |
| const sc_unsigned & | operator%= (const sc_int_base &v) |
| const sc_unsigned & | operator%= (const sc_uint_base &v) |
| const sc_unsigned & | operator&= (const sc_signed &v) |
| const sc_unsigned & | operator&= (const sc_unsigned &v) |
| const sc_unsigned & | operator&= (int64 v) |
| const sc_unsigned & | operator&= (uint64 v) |
| const sc_unsigned & | operator&= (long v) |
| const sc_unsigned & | operator&= (unsigned long v) |
| const sc_unsigned & | operator&= (int v) |
| const sc_unsigned & | operator&= (unsigned int v) |
| const sc_unsigned & | operator&= (const sc_int_base &v) |
| const sc_unsigned & | operator&= (const sc_uint_base &v) |
| const sc_unsigned & | operator|= (const sc_signed &v) |
| const sc_unsigned & | operator|= (const sc_unsigned &v) |
| const sc_unsigned & | operator|= (int64 v) |
| const sc_unsigned & | operator|= (uint64 v) |
| const sc_unsigned & | operator|= (long v) |
| const sc_unsigned & | operator|= (unsigned long v) |
| const sc_unsigned & | operator|= (int v) |
| const sc_unsigned & | operator|= (unsigned int v) |
| const sc_unsigned & | operator|= (const sc_int_base &v) |
| const sc_unsigned & | operator|= (const sc_uint_base &v) |
| const sc_unsigned & | operator^= (const sc_signed &v) |
| const sc_unsigned & | operator^= (const sc_unsigned &v) |
| const sc_unsigned & | operator^= (int64 v) |
| const sc_unsigned & | operator^= (uint64 v) |
| const sc_unsigned & | operator^= (long v) |
| const sc_unsigned & | operator^= (unsigned long v) |
| const sc_unsigned & | operator^= (int v) |
| const sc_unsigned & | operator^= (unsigned int v) |
| const sc_unsigned & | operator^= (const sc_int_base &v) |
| const sc_unsigned & | operator^= (const sc_uint_base &v) |
| const sc_unsigned & | operator<<= (const sc_signed &v) |
| const sc_unsigned & | operator<<= (const sc_unsigned &v) |
| const sc_unsigned & | operator<<= (int64 v) |
| const sc_unsigned & | operator<<= (uint64 v) |
| const sc_unsigned & | operator<<= (long v) |
| const sc_unsigned & | operator<<= (unsigned long v) |
| const sc_unsigned & | operator<<= (int v) |
| const sc_unsigned & | operator<<= (unsigned int v) |
| const sc_unsigned & | operator<<= (const sc_int_base &v) |
| const sc_unsigned & | operator<<= (const sc_uint_base &v) |
| const sc_unsigned & | operator>>= (const sc_signed &v) |
| const sc_unsigned & | operator>>= (const sc_unsigned &v) |
| const sc_unsigned & | operator>>= (int64 v) |
| const sc_unsigned & | operator>>= (uint64 v) |
| const sc_unsigned & | operator>>= (long v) |
| const sc_unsigned & | operator>>= (unsigned long v) |
| const sc_unsigned & | operator>>= (int v) |
| const sc_unsigned & | operator>>= (unsigned int v) |
| const sc_unsigned & | operator>>= (const sc_int_base &v) |
| const sc_unsigned & | operator>>= (const sc_uint_base &v) |
Static Public Attributes |
static sc_core::sc_vpool
< sc_unsigned > | m_pool |
Friends |
| class | sc_concatref |
| class | sc_unsigned_bitref_r |
| class | sc_unsigned_bitref |
| class | sc_unsigned_subref_r |
| class | sc_unsigned_subref |
| class | sc_signed |
| class | sc_signed_subref |
| class | sc_signed_subref_r |
| SC_API sc_signed | operator+ (const sc_unsigned &u, const sc_signed &v) |
| SC_API sc_signed | operator+ (const sc_signed &u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator+ (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API sc_signed | operator+ (const sc_unsigned &u, int64 v) |
| SC_API sc_unsigned | operator+ (const sc_unsigned &u, uint64 v) |
| SC_API sc_signed | operator+ (const sc_unsigned &u, long v) |
| SC_API sc_unsigned | operator+ (const sc_unsigned &u, unsigned long v) |
| SC_API sc_signed | operator+ (const sc_unsigned &u, int v) |
| sc_unsigned | operator+ (const sc_unsigned &u, unsigned int v) |
| SC_API sc_signed | operator+ (int64 u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator+ (uint64 u, const sc_unsigned &v) |
| SC_API sc_signed | operator+ (long u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator+ (unsigned long u, const sc_unsigned &v) |
| SC_API sc_signed | operator+ (int u, const sc_unsigned &v) |
| sc_unsigned | operator+ (unsigned int u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator+ (const sc_unsigned &u, const sc_uint_base &v) |
| SC_API sc_signed | operator+ (const sc_unsigned &u, const sc_int_base &v) |
| SC_API sc_unsigned | operator+ (const sc_uint_base &u, const sc_unsigned &v) |
| SC_API sc_signed | operator+ (const sc_int_base &u, const sc_unsigned &v) |
| SC_API sc_signed | operator- (const sc_unsigned &u, const sc_signed &v) |
| SC_API sc_signed | operator- (const sc_signed &u, const sc_unsigned &v) |
| SC_API sc_signed | operator- (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API sc_signed | operator- (const sc_unsigned &u, int64 v) |
| SC_API sc_signed | operator- (const sc_unsigned &u, uint64 v) |
| SC_API sc_signed | operator- (const sc_unsigned &u, long v) |
| SC_API sc_signed | operator- (const sc_unsigned &u, unsigned long v) |
| SC_API sc_signed | operator- (const sc_unsigned &u, int v) |
| SC_API sc_signed | operator- (const sc_unsigned &u, unsigned int v) |
| SC_API sc_signed | operator- (int64 u, const sc_unsigned &v) |
| SC_API sc_signed | operator- (uint64 u, const sc_unsigned &v) |
| SC_API sc_signed | operator- (long u, const sc_unsigned &v) |
| SC_API sc_signed | operator- (unsigned long u, const sc_unsigned &v) |
| SC_API sc_signed | operator- (int u, const sc_unsigned &v) |
| SC_API sc_signed | operator- (unsigned int u, const sc_unsigned &v) |
| SC_API sc_signed | operator- (const sc_unsigned &u, const sc_uint_base &v) |
| SC_API sc_signed | operator- (const sc_unsigned &u, const sc_int_base &v) |
| SC_API sc_signed | operator- (const sc_uint_base &u, const sc_unsigned &v) |
| SC_API sc_signed | operator- (const sc_int_base &u, const sc_unsigned &v) |
| SC_API sc_signed | operator* (const sc_unsigned &u, const sc_signed &v) |
| SC_API sc_signed | operator* (const sc_signed &u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator* (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API sc_signed | operator* (const sc_unsigned &u, int64 v) |
| SC_API sc_unsigned | operator* (const sc_unsigned &u, uint64 v) |
| SC_API sc_signed | operator* (const sc_unsigned &u, long v) |
| SC_API sc_unsigned | operator* (const sc_unsigned &u, unsigned long v) |
| SC_API sc_signed | operator* (const sc_unsigned &u, int v) |
| sc_unsigned | operator* (const sc_unsigned &u, unsigned int v) |
| SC_API sc_signed | operator* (int64 u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator* (uint64 u, const sc_unsigned &v) |
| SC_API sc_signed | operator* (long u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator* (unsigned long u, const sc_unsigned &v) |
| SC_API sc_signed | operator* (int u, const sc_unsigned &v) |
| sc_unsigned | operator* (unsigned int u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator* (const sc_unsigned &u, const sc_uint_base &v) |
| SC_API sc_signed | operator* (const sc_unsigned &u, const sc_int_base &v) |
| SC_API sc_unsigned | operator* (const sc_uint_base &u, const sc_unsigned &v) |
| SC_API sc_signed | operator* (const sc_int_base &u, const sc_unsigned &v) |
| SC_API sc_signed | operator/ (const sc_unsigned &u, const sc_signed &v) |
| SC_API sc_signed | operator/ (const sc_signed &u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator/ (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API sc_signed | operator/ (const sc_unsigned &u, int64 v) |
| SC_API sc_unsigned | operator/ (const sc_unsigned &u, uint64 v) |
| SC_API sc_signed | operator/ (const sc_unsigned &u, long v) |
| SC_API sc_unsigned | operator/ (const sc_unsigned &u, unsigned long v) |
| SC_API sc_signed | operator/ (const sc_unsigned &u, int v) |
| sc_unsigned | operator/ (const sc_unsigned &u, unsigned int v) |
| SC_API sc_signed | operator/ (int64 u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator/ (uint64 u, const sc_unsigned &v) |
| SC_API sc_signed | operator/ (long u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator/ (unsigned long u, const sc_unsigned &v) |
| SC_API sc_signed | operator/ (int u, const sc_unsigned &v) |
| sc_unsigned | operator/ (unsigned int u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator/ (const sc_unsigned &u, const sc_uint_base &v) |
| SC_API sc_signed | operator/ (const sc_unsigned &u, const sc_int_base &v) |
| SC_API sc_unsigned | operator/ (const sc_uint_base &u, const sc_unsigned &v) |
| SC_API sc_signed | operator/ (const sc_int_base &u, const sc_unsigned &v) |
| SC_API sc_signed | operator% (const sc_unsigned &u, const sc_signed &v) |
| SC_API sc_signed | operator% (const sc_signed &u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator% (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API sc_signed | operator% (const sc_unsigned &u, int64 v) |
| SC_API sc_unsigned | operator% (const sc_unsigned &u, uint64 v) |
| SC_API sc_signed | operator% (const sc_unsigned &u, long v) |
| SC_API sc_unsigned | operator% (const sc_unsigned &u, unsigned long v) |
| SC_API sc_signed | operator% (const sc_unsigned &u, int v) |
| sc_unsigned | operator% (const sc_unsigned &u, unsigned int v) |
| SC_API sc_signed | operator% (int64 u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator% (uint64 u, const sc_unsigned &v) |
| SC_API sc_signed | operator% (long u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator% (unsigned long u, const sc_unsigned &v) |
| SC_API sc_signed | operator% (int u, const sc_unsigned &v) |
| sc_unsigned | operator% (unsigned int u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator% (const sc_unsigned &u, const sc_uint_base &v) |
| SC_API sc_signed | operator% (const sc_unsigned &u, const sc_int_base &v) |
| SC_API sc_unsigned | operator% (const sc_uint_base &u, const sc_unsigned &v) |
| SC_API sc_signed | operator% (const sc_int_base &u, const sc_unsigned &v) |
| SC_API sc_signed | operator& (const sc_unsigned &u, const sc_signed &v) |
| SC_API sc_signed | operator& (const sc_signed &u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator& (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API sc_signed | operator& (const sc_unsigned &u, int64 v) |
| SC_API sc_unsigned | operator& (const sc_unsigned &u, uint64 v) |
| SC_API sc_signed | operator& (const sc_unsigned &u, long v) |
| SC_API sc_unsigned | operator& (const sc_unsigned &u, unsigned long v) |
| SC_API sc_signed | operator& (const sc_unsigned &u, int v) |
| sc_unsigned | operator& (const sc_unsigned &u, unsigned int v) |
| SC_API sc_signed | operator& (int64 u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator& (uint64 u, const sc_unsigned &v) |
| SC_API sc_signed | operator& (long u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator& (unsigned long u, const sc_unsigned &v) |
| SC_API sc_signed | operator& (int u, const sc_unsigned &v) |
| sc_unsigned | operator& (unsigned int u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator& (const sc_unsigned &u, const sc_uint_base &v) |
| SC_API sc_signed | operator& (const sc_unsigned &u, const sc_int_base &v) |
| SC_API sc_unsigned | operator& (const sc_uint_base &u, const sc_unsigned &v) |
| SC_API sc_signed | operator& (const sc_int_base &u, const sc_unsigned &v) |
| SC_API sc_signed | operator| (const sc_unsigned &u, const sc_signed &v) |
| SC_API sc_signed | operator| (const sc_signed &u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator| (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API sc_signed | operator| (const sc_unsigned &u, int64 v) |
| SC_API sc_unsigned | operator| (const sc_unsigned &u, uint64 v) |
| SC_API sc_signed | operator| (const sc_unsigned &u, long v) |
| SC_API sc_unsigned | operator| (const sc_unsigned &u, unsigned long v) |
| SC_API sc_signed | operator| (const sc_unsigned &u, int v) |
| sc_unsigned | operator| (const sc_unsigned &u, unsigned int v) |
| SC_API sc_signed | operator| (int64 u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator| (uint64 u, const sc_unsigned &v) |
| SC_API sc_signed | operator| (long u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator| (unsigned long u, const sc_unsigned &v) |
| SC_API sc_signed | operator| (int u, const sc_unsigned &v) |
| sc_unsigned | operator| (unsigned int u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator| (const sc_unsigned &u, const sc_uint_base &v) |
| SC_API sc_signed | operator| (const sc_unsigned &u, const sc_int_base &v) |
| SC_API sc_unsigned | operator| (const sc_uint_base &u, const sc_unsigned &v) |
| SC_API sc_signed | operator| (const sc_int_base &u, const sc_unsigned &v) |
| SC_API sc_signed | operator^ (const sc_unsigned &u, const sc_signed &v) |
| SC_API sc_signed | operator^ (const sc_signed &u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator^ (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API sc_signed | operator^ (const sc_unsigned &u, int64 v) |
| SC_API sc_unsigned | operator^ (const sc_unsigned &u, uint64 v) |
| SC_API sc_signed | operator^ (const sc_unsigned &u, long v) |
| SC_API sc_unsigned | operator^ (const sc_unsigned &u, unsigned long v) |
| SC_API sc_signed | operator^ (const sc_unsigned &u, int v) |
| sc_unsigned | operator^ (const sc_unsigned &u, unsigned int v) |
| SC_API sc_signed | operator^ (int64 u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator^ (uint64 u, const sc_unsigned &v) |
| SC_API sc_signed | operator^ (long u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator^ (unsigned long u, const sc_unsigned &v) |
| SC_API sc_signed | operator^ (int u, const sc_unsigned &v) |
| sc_unsigned | operator^ (unsigned int u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator^ (const sc_unsigned &u, const sc_uint_base &v) |
| SC_API sc_signed | operator^ (const sc_unsigned &u, const sc_int_base &v) |
| SC_API sc_unsigned | operator^ (const sc_uint_base &u, const sc_unsigned &v) |
| SC_API sc_signed | operator^ (const sc_int_base &u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator<< (const sc_unsigned &u, const sc_signed &v) |
| SC_API sc_signed | operator<< (const sc_signed &u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator<< (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator<< (const sc_unsigned &u, int64 v) |
| SC_API sc_unsigned | operator<< (const sc_unsigned &u, uint64 v) |
| SC_API sc_unsigned | operator<< (const sc_unsigned &u, long v) |
| SC_API sc_unsigned | operator<< (const sc_unsigned &u, unsigned long v) |
| sc_unsigned | operator<< (const sc_unsigned &u, int v) |
| sc_unsigned | operator<< (const sc_unsigned &u, unsigned int v) |
| SC_API sc_unsigned | operator<< (const sc_unsigned &u, const sc_uint_base &v) |
| SC_API sc_unsigned | operator<< (const sc_unsigned &u, const sc_int_base &v) |
| SC_API sc_unsigned | operator>> (const sc_unsigned &u, const sc_signed &v) |
| SC_API sc_signed | operator>> (const sc_signed &u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator>> (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator>> (const sc_unsigned &u, int64 v) |
| SC_API sc_unsigned | operator>> (const sc_unsigned &u, uint64 v) |
| SC_API sc_unsigned | operator>> (const sc_unsigned &u, long v) |
| SC_API sc_unsigned | operator>> (const sc_unsigned &u, unsigned long v) |
| sc_unsigned | operator>> (const sc_unsigned &u, int v) |
| sc_unsigned | operator>> (const sc_unsigned &u, unsigned int v) |
| SC_API sc_unsigned | operator>> (const sc_unsigned &, const sc_uint_base &) |
| SC_API sc_unsigned | operator>> (const sc_unsigned &, const sc_int_base &) |
| SC_API sc_unsigned | operator+ (const sc_unsigned &u) |
| SC_API sc_signed | operator- (const sc_unsigned &u) |
| SC_API bool | operator== (const sc_unsigned &u, const sc_signed &v) |
| SC_API bool | operator== (const sc_signed &u, const sc_unsigned &v) |
| SC_API bool | operator== (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API bool | operator== (const sc_unsigned &u, int64 v) |
| SC_API bool | operator== (const sc_unsigned &u, uint64 v) |
| SC_API bool | operator== (const sc_unsigned &u, long v) |
| SC_API bool | operator== (const sc_unsigned &u, unsigned long v) |
| bool | operator== (const sc_unsigned &u, int v) |
| bool | operator== (const sc_unsigned &u, unsigned int v) |
| SC_API bool | operator== (int64 u, const sc_unsigned &v) |
| SC_API bool | operator== (uint64 u, const sc_unsigned &v) |
| SC_API bool | operator== (long u, const sc_unsigned &v) |
| SC_API bool | operator== (unsigned long u, const sc_unsigned &v) |
| bool | operator== (int u, const sc_unsigned &v) |
| bool | operator== (unsigned int u, const sc_unsigned &v) |
| SC_API bool | operator== (const sc_unsigned &u, const sc_uint_base &v) |
| SC_API bool | operator== (const sc_unsigned &u, const sc_int_base &v) |
| SC_API bool | operator== (const sc_uint_base &u, const sc_unsigned &v) |
| SC_API bool | operator== (const sc_int_base &u, const sc_unsigned &v) |
| SC_API bool | operator!= (const sc_unsigned &u, const sc_signed &v) |
| SC_API bool | operator!= (const sc_signed &u, const sc_unsigned &v) |
| SC_API bool | operator!= (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API bool | operator!= (const sc_unsigned &u, int64 v) |
| SC_API bool | operator!= (const sc_unsigned &u, uint64 v) |
| SC_API bool | operator!= (const sc_unsigned &u, long v) |
| SC_API bool | operator!= (const sc_unsigned &u, unsigned long v) |
| bool | operator!= (const sc_unsigned &u, int v) |
| bool | operator!= (const sc_unsigned &u, unsigned int v) |
| SC_API bool | operator!= (int64 u, const sc_unsigned &v) |
| SC_API bool | operator!= (uint64 u, const sc_unsigned &v) |
| SC_API bool | operator!= (long u, const sc_unsigned &v) |
| SC_API bool | operator!= (unsigned long u, const sc_unsigned &v) |
| bool | operator!= (int u, const sc_unsigned &v) |
| bool | operator!= (unsigned int u, const sc_unsigned &v) |
| SC_API bool | operator!= (const sc_unsigned &u, const sc_uint_base &v) |
| SC_API bool | operator!= (const sc_unsigned &u, const sc_int_base &v) |
| SC_API bool | operator!= (const sc_uint_base &u, const sc_unsigned &v) |
| SC_API bool | operator!= (const sc_int_base &u, const sc_unsigned &v) |
| SC_API bool | operator< (const sc_unsigned &u, const sc_signed &v) |
| SC_API bool | operator< (const sc_signed &u, const sc_unsigned &v) |
| SC_API bool | operator< (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API bool | operator< (const sc_unsigned &u, int64 v) |
| SC_API bool | operator< (const sc_unsigned &u, uint64 v) |
| SC_API bool | operator< (const sc_unsigned &u, long v) |
| SC_API bool | operator< (const sc_unsigned &u, unsigned long v) |
| bool | operator< (const sc_unsigned &u, int v) |
| bool | operator< (const sc_unsigned &u, unsigned int v) |
| SC_API bool | operator< (int64 u, const sc_unsigned &v) |
| SC_API bool | operator< (uint64 u, const sc_unsigned &v) |
| SC_API bool | operator< (long u, const sc_unsigned &v) |
| SC_API bool | operator< (unsigned long u, const sc_unsigned &v) |
| bool | operator< (int u, const sc_unsigned &v) |
| bool | operator< (unsigned int u, const sc_unsigned &v) |
| SC_API bool | operator< (const sc_unsigned &u, const sc_uint_base &v) |
| SC_API bool | operator< (const sc_unsigned &u, const sc_int_base &v) |
| SC_API bool | operator< (const sc_uint_base &u, const sc_unsigned &v) |
| SC_API bool | operator< (const sc_int_base &u, const sc_unsigned &v) |
| SC_API bool | operator<= (const sc_unsigned &u, const sc_signed &v) |
| SC_API bool | operator<= (const sc_signed &u, const sc_unsigned &v) |
| SC_API bool | operator<= (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API bool | operator<= (const sc_unsigned &u, int64 v) |
| SC_API bool | operator<= (const sc_unsigned &u, uint64 v) |
| SC_API bool | operator<= (const sc_unsigned &u, long v) |
| SC_API bool | operator<= (const sc_unsigned &u, unsigned long v) |
| bool | operator<= (const sc_unsigned &u, int v) |
| bool | operator<= (const sc_unsigned &u, unsigned int v) |
| SC_API bool | operator<= (int64 u, const sc_unsigned &v) |
| SC_API bool | operator<= (uint64 u, const sc_unsigned &v) |
| SC_API bool | operator<= (long u, const sc_unsigned &v) |
| SC_API bool | operator<= (unsigned long u, const sc_unsigned &v) |
| bool | operator<= (int u, const sc_unsigned &v) |
| bool | operator<= (unsigned int u, const sc_unsigned &v) |
| SC_API bool | operator<= (const sc_unsigned &u, const sc_uint_base &v) |
| SC_API bool | operator<= (const sc_unsigned &u, const sc_int_base &v) |
| SC_API bool | operator<= (const sc_uint_base &u, const sc_unsigned &v) |
| SC_API bool | operator<= (const sc_int_base &u, const sc_unsigned &v) |
| SC_API bool | operator> (const sc_unsigned &u, const sc_signed &v) |
| SC_API bool | operator> (const sc_signed &u, const sc_unsigned &v) |
| SC_API bool | operator> (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API bool | operator> (const sc_unsigned &u, int64 v) |
| SC_API bool | operator> (const sc_unsigned &u, uint64 v) |
| SC_API bool | operator> (const sc_unsigned &u, long v) |
| SC_API bool | operator> (const sc_unsigned &u, unsigned long v) |
| bool | operator> (const sc_unsigned &u, int v) |
| bool | operator> (const sc_unsigned &u, unsigned int v) |
| SC_API bool | operator> (int64 u, const sc_unsigned &v) |
| SC_API bool | operator> (uint64 u, const sc_unsigned &v) |
| SC_API bool | operator> (long u, const sc_unsigned &v) |
| SC_API bool | operator> (unsigned long u, const sc_unsigned &v) |
| bool | operator> (int u, const sc_unsigned &v) |
| bool | operator> (unsigned int u, const sc_unsigned &v) |
| SC_API bool | operator> (const sc_unsigned &u, const sc_uint_base &v) |
| SC_API bool | operator> (const sc_unsigned &u, const sc_int_base &v) |
| SC_API bool | operator> (const sc_uint_base &u, const sc_unsigned &v) |
| SC_API bool | operator> (const sc_int_base &u, const sc_unsigned &v) |
| SC_API bool | operator>= (const sc_unsigned &u, const sc_signed &v) |
| SC_API bool | operator>= (const sc_signed &u, const sc_unsigned &v) |
| SC_API bool | operator>= (const sc_unsigned &u, const sc_unsigned &v) |
| SC_API bool | operator>= (const sc_unsigned &u, int64 v) |
| SC_API bool | operator>= (const sc_unsigned &u, uint64 v) |
| SC_API bool | operator>= (const sc_unsigned &u, long v) |
| SC_API bool | operator>= (const sc_unsigned &u, unsigned long v) |
| bool | operator>= (const sc_unsigned &u, int v) |
| bool | operator>= (const sc_unsigned &u, unsigned int v) |
| SC_API bool | operator>= (int64 u, const sc_unsigned &v) |
| SC_API bool | operator>= (uint64 u, const sc_unsigned &v) |
| SC_API bool | operator>= (long u, const sc_unsigned &v) |
| SC_API bool | operator>= (unsigned long u, const sc_unsigned &v) |
| bool | operator>= (int u, const sc_unsigned &v) |
| bool | operator>= (unsigned int u, const sc_unsigned &v) |
| SC_API bool | operator>= (const sc_unsigned &u, const sc_uint_base &v) |
| SC_API bool | operator>= (const sc_unsigned &u, const sc_int_base &v) |
| SC_API bool | operator>= (const sc_uint_base &u, const sc_unsigned &v) |
| SC_API bool | operator>= (const sc_int_base &u, const sc_unsigned &v) |
| SC_API sc_unsigned | operator~ (const sc_unsigned &u) |
| int | compare_unsigned (small_type us, int unb, int und, const sc_digit *ud, small_type vs, int vnb, int vnd, const sc_digit *vd, small_type if_u_signed, small_type if_v_signed) |
| sc_unsigned | add_unsigned_friend (small_type us, int unb, int und, const sc_digit *ud, small_type vs, int vnb, int vnd, const sc_digit *vd) |
| sc_unsigned | sub_unsigned_friend (small_type us, int unb, int und, const sc_digit *ud, small_type vs, int vnb, int vnd, const sc_digit *vd) |
| sc_unsigned | mul_unsigned_friend (small_type s, int unb, int und, const sc_digit *ud, int vnb, int vnd, const sc_digit *vd) |
| sc_unsigned | div_unsigned_friend (small_type s, int unb, int und, const sc_digit *ud, int vnb, int vnd, const sc_digit *vd) |
| sc_unsigned | mod_unsigned_friend (small_type us, int unb, int und, const sc_digit *ud, int vnb, int vnd, const sc_digit *vd) |
| sc_unsigned | and_unsigned_friend (small_type us, int unb, int und, const sc_digit *ud, small_type vs, int vnb, int vnd, const sc_digit *vd) |
| sc_unsigned | or_unsigned_friend (small_type us, int unb, int und, const sc_digit *ud, small_type vs, int vnb, int vnd, const sc_digit *vd) |
| sc_unsigned | xor_unsigned_friend (small_type us, int unb, int und, const sc_digit *ud, small_type vs, int vnb, int vnd, const sc_digit *vd) |


This piece of the series is aptly placed after our interviews with creative people. It’s a good reminder that everyone can be creative, not just the “elect.” Creative work isn’t because of a gene or some aptitude for doing interesting things. It comes out of hard, hard work. Writing a song was an interesting lens, because most musicians have hours and hours of music behind their hit songs. Creativity needs to be practiced.
Similar to what I wrote yesterday, it takes practice to develop creative work. “Hitting the nail on the head” is much more than a lucky swing – the idea has been identified, refined, expanded, and communicated effectively. My work day to day may not be creative in and of itself, but it can serve as a foundation for times when creativity is key. We need to consider our experiences and our task at hand and blend the two into something both meaningful and effective.
Some stale suggestions
Abstractions just aren’t there.
So, where to start?
Creative spark shouldn’t be exclusive
Is it inside of me?

Where’s my muse?
Where’s my muse?
Inspect my past,
I remember that trip we took
The tan lines etched into our skin.
Old memories,
Watching old turn new again,
recollection running wild in our minds
The only thing left to do is…
Go back and check the basic
components used to be creative
Remix, arrange, imagine
Now put the idea into action
It’s time for people to see
Creative work is not a myst’ry
It’s not a myst’ry.
It’s in you as well as me.
Go back and check the basic
components used to be creative
Remix, arrange, imagine
Now put the idea into action
It’s time for people to see
Creative work is not a myst’ry
Original: The District Sleeps Alone Tonight by The Postal Service
As a point of explanation for each stanza, you can venture onward:
_Scratched out lines
Some stale suggestions
Abstractions just aren’t there.
So, where to start?
Creative spark shouldn’t be exclusive
Is it inside of me?_
The first part of the article discusses the historical perspectives on creativity. “Creativity has often been thought of as an elusive and mystical force – emerging from bursts of insight available only to certain fortunate individuals.” The next line explores the Greco-Roman myth of the muse and her role in inspiration. Even today, there is a view that creativity is exclusive to the elect. I thought this first stanza to be appropriate to set the background for the story; the song is more than a carrier of facts from an article. I wanted it to be whole representation of the piece.
_Inspect my past,
I remember that trip we took
The tan lines etched into our skin.
Old memories,
Watching old turn new again,
recollection running wild in our minds_
A key component to creativity is our past experiences – both as “variations on a theme” and people with wide experiences “have richer concepts to build on, and hence the potential to see more knobs or possibilities than those with narrower foundations.” This is not limited to content experiences – personal experiences can help us see content or instruction in new lights. It may be fodder for new examples and explanations, or it could be inspiration for a lesson design. The point is that experiences are holistic and can influence our creativity across disciplines.
_The only thing left to do is…

Go back and check the basic
components used to be creative
Remix, arrange, imagine
Now put the idea into action
It’s time for people to see
Creative work is not a myst’ry
The Heinrickson article talks about “twisting the knobs” as one of the keys to creativity, but that comes from both an understanding of what creativity is (a remix/reimagining of information) as it ties into combinatorial thinking. “…it is clear that combinatorial thinking cannot be forced or predicted, it must develop organically, determined and constrained by the unique resources that the individual brings to the creative process.” We are bringing in our ability to remix, rearrange, and image situations within the scope of our experiences.
_It’s not a myst’ry.

It’s in you as well as me.
Creativity isn’t a magical process, it’s something that we all know how to do, but we have to focus on the basic components and apply it through our lens to begin to hone the skill. History and culture help perpetuate the general feeling that someone can or can’t be creative because of their genetic luck.
Written on November 3rd , 2014 by Brian Bennett Categorized in: Creative
Leave a comment


Pearl barley risotto broth recipe
by Angela HartnettThis hearty, warming broth is essentially a risotto made with pearl barley instead of normal rice. It's packed with vegetables and makes a great healthy dinner.
Prep time: 10 minutes | Cooking time: 30 minutes
SERVES
Four to six
INGREDIENTS
- Olive oil, for cooking
- Knob of butter
- 1 carrot, diced
- 1 celery, diced
- 2 small onions, diced
- 1 parsnip or turnip, diced
- 1 thyme sprig
- 1 bay leaf
- 150g pearl barley
- 75ml white wine
- 650ml chicken stock
- 50g chopped parsley
METHOD
- Heat the oil and butter in a pan then add the diced vegetables, sautéing them until they have softened. Add the thyme and bay leaf.
- Stir in the pearl barley and add the wine, cooking it until it disappears, deglazing the pan.
- Add the chicken stock and cook for 20 minutes until the pearl barley and vegetables are cooked. The barley should be soft to the bite.
- Serve with the chopped parsley and a dash of olive oil.


Welcome to the Official Website of the 2019 BEST Symposium on Education
Known as the Venice of Portugal, Aveiro is surrounded by salt-flats, beaches and lagoons and dominated by the Central Canal running through town, the Ria de Aveiro. Once a big sea port, Aveiro lies in a region of valleys cut by mountains and fertile lagoon plains. Due to it’s proximity to the sea Aveiro also contains beautiful beaches and is home of the tallest Lighthouse in Portugal.
The city of Aveiro is crossed by canals, which give it quite an individual character, and of all the boats seen in the area, the moliceiro is the most elegant, being perfectly lined, painted with bright colours and with often ingenious and humorous decorations.
For those who love sweets, Aveiro has a well known pastry called ovos moles, made from egg yolks and sugar.
Aveiro also has a rich culture and throughout the city, there are various museums, cathedrals and other monuments representing the beautiful history of the city and even Portugal.
Main Organiser
Marketing Responsible
Fundraising Responsible
IT Responsible
Participants Responsible
Social Responsible
Social Responsible
Cultural Responsible
Cultural Responsible
Logistic Responsible
Logistic Responsible


TARİH
| # | OPERASYON | DURUM | HARCANAN SÜRE | MALİYET |
|---|---|---|---|---|
| 1 | Elite admin | SALE | April 18, 2017 | $24 |
| 2 | Real Homes WP Theme | EXTENDED | April 19, 2017 | $1250 |
| 5 | Helping Hands WP Theme | member | April 22, 2017 | $24 |
| 2 | Ample Admin | EXTENDED | April 19, 2017 | $1250 |
| 3 | Medical Pro WP Theme | TAX | April 20, 2017 | -$24 |
| 4 | Hosting press html | SALE | April 21, 2017 | $24 |
| 2 | Real Homes WP Theme | EXTENDED | April 19, 2017 | $1250 |
| 5 | Helping Hands WP Theme | member | April 22, 2017 | $24 |
| 6 | Digital Agency PSD | SALE | April 23, 2017 | -$14 |
| 7 | Helping Hands WP Theme | member | April 22, 2017 | $64 |
TARİH
| # | OPERASYON | DURUM | HARCANAN SÜRE | MALİYET |
|---|---|---|---|---|
| 1 | Elite admin | SALE | April 18, 2017 | $24 |
| 2 | Real Homes WP Theme | EXTENDED | April 19, 2017 | $1250 |
| 5 | Helping Hands WP Theme | member | April 22, 2017 | $24 |
| 2 | Ample Admin | EXTENDED | April 19, 2017 | $1250 |
| 3 | Medical Pro WP Theme | TAX | April 20, 2017 | -$24 |
| 4 | Hosting press html | SALE | April 21, 2017 | $24 |
| 2 | Real Homes WP Theme | EXTENDED | April 19, 2017 | $1250 |
| 5 | Helping Hands WP Theme | member | April 22, 2017 | $24 |
| 6 | Digital Agency PSD | SALE | April 23, 2017 | -$14 |
| 7 | Helping Hands WP Theme | member | April 22, 2017 | $64 |
TARİH
| # | OPERASYON | DURUM | HARCANAN SÜRE | MALİYET |
|---|---|---|---|---|
| 1 | Elite admin | SALE | April 18, 2017 | $24 |
| 2 | Real Homes WP Theme | EXTENDED | April 19, 2017 | $1250 |
| 5 | Helping Hands WP Theme | member | April 22, 2017 | $24 |
| 2 | Ample Admin | EXTENDED | April 19, 2017 | $1250 |
| 3 | Medical Pro WP Theme | TAX | April 20, 2017 | -$24 |
| 4 | Hosting press html | SALE | April 21, 2017 | $24 |
| 2 | Real Homes WP Theme | EXTENDED | April 19, 2017 | $1250 |
| 5 | Helping Hands WP Theme | member | April 22, 2017 | $24 |
| 6 | Digital Agency PSD | SALE | April 23, 2017 | -$14 |
| 7 | Helping Hands WP Theme | member | April 22, 2017 | $64 |


Ingredients: Pepperoni, Pizza Sauce, Mozzarella.
Ingredients: Mozzarella,Green Olives, Tomatoes, Minced Meat, Pizza Sauce
BBQ Sauce, Pizza Sauce, Mozzarella, Capsicum, Chicken Strips
Pine-Apple, Pizza-Sauce,Pepproni
Ingredients: Buffalo Strips, Mozzarella, Pizza Sauce
Ingredients: Veggies, Pizza Sauce,
ONE OF OUR BEST SELLING CRUST TYPES INCLUDES THE GLUTEN FREE CRUST
ONE OF OUR BEST SELLING CRUST TYPES INCLUDING THE STUFFED CRUST
ONE OF OUR BEST SELLING CRUST TYPES INCLUDES THE THIN CRUST
I just ordered , with a crust type of and a topping of and .And will be delivered to:


|
JB.Toolkit
A collection of useful classes, extensions and tools written in C# to aid in a wide variety of development. With components for ASP Net MVC, Winform and Console applications. Integrations for Google, AD and SQL and pre-written implementations / helpers for a variety of tasks... Just Because.
|
Uses OpenXML to perform a Word Mail Merge. More...
Static Public Member Functions | |
| static void | MergeDocumentAndSave (string templatePath, string outputPath, Dictionary< string, string > fieldAndValues, bool saveAsPDF) |
| Performs a mail merges given a dictionary of merge fields and their merge values and save to file More... | |
| static byte[] | MergeDocumentToByteArray (string templatePath, Dictionary< string, string > fieldAndValues, bool saveAsPDF) |
| Performs a mail merges given a dictionary of merge fields and their merge values and returns a byte array More... | |
| static string | MergeDocumentAsBase64String (string templatePath, Dictionary< string, string > fieldAndValues, bool saveAsPDF) |
| Performs a mail merges given a dictionary of merge fields and their merge values and returns a base64 string (for blobs) More... | |
| static MemoryStream | MergeDocumentToMemoryStream (string templatePath, Dictionary< string, string > fieldAndValues, bool saveAsPDF) |
| Performs a mail merges given a dictionary of merge fields and their merge values and returns a Memory Stream More... | |
| static string | FindAndReplace (string templatePath, Dictionary< string, string > values, string saveAsPath=null, string tempFolderRoot=null) |
| Basically performs a mail merge by replacing text defined by a dictionary of keys (in the format «key») with the replacing text in the value of the dictionary. This method's default is to produce a temporary file and output the name of the file that has been created unless the 'SaveAsPath' parameter has been specified More... | |
Uses OpenXML to perform a Word Mail Merge.
It's quick, but no always very reliable. Perhaps this class needs some modifications... Also, OpenXML doesn't have the facility to convert to PDF, so we have to use the M-Files API to do this for us. It's usually quick, but can be slow if M-Files is busy.
|
static |
Basically performs a mail merge by replacing text defined by a dictionary of keys (in the format «key») with the replacing text in the value of the dictionary. This method's default is to produce a temporary file and output the name of the file that has been created unless the 'SaveAsPath' parameter has been specified
| templatePath | Template document path |
| values | Dictionary of values to replace |
| saveAsPath | Optional output path |
|
static |
Performs a mail merges given a dictionary of merge fields and their merge values and save to file
| templatePath | Path to mail merge template |
| outputPath | Where to save the file to |
| fieldAndValues | A Dictionary of Merge Fields and values |
| saveAsPDF | Whether to save as PDF or docx |
|
static |
Performs a mail merges given a dictionary of merge fields and their merge values and returns a base64 string (for blobs)
| templatePath | Path to mail merge template |
| fieldAndValues | A Dictionary of Merge Fields and values |
| saveAsPDF | Whether to save as PDF or docx |
|
static |
Performs a mail merges given a dictionary of merge fields and their merge values and returns a byte array
| templatePath | Path to mail merge template |
| fieldAndValues | A Dictionary of Merge Fields and values |
| saveAsPDF | Whether to save as PDF or docx |
|
static |
Performs a mail merges given a dictionary of merge fields and their merge values and returns a Memory Stream
| templatePath | Path to mail merge template |
| fieldAndValues | A Dictionary of Merge Fields and values |
| saveAsPDF | Whether to save as PDF or docx |


Vodacom Tanzania's first-half core earnings rise on M-Pesa, data revenue
DAR ES SALAAM (Reuters) - Vodacom Tanzania’s core earnings rose 9.3% in the six months to the end of September, driven by increased revenue from its financial and data provision services, it said on Friday.
Tanzania’s biggest telecoms operator, which is partly owned by South Africa’s Vodacom, said revenue from its M-Pesa financial services operations grew 15.9%, while its data business posted 17.4% revenue growth.
Earnings before interest, taxation, depreciation and amortisation, known as core earnings, were 147 billion shillings ($63.91 million).
The company added 760,000 new customers during the period, said Chief Executive Hisham Hendi, adding that he expected further growth momentum from the financial services business.
M-Pesa expanded to Tanzania from neighboring Kenya, where it was launched by Safaricom, part of the Vodacom group, in 2007.
It now contributes just over a third of Vodacom Tanzania’s total revenue, the firm said.
Hendi said the company was rushing to comply with a government order to register all mobile phone subscribers using their biometric features to curb cyber-crime by the end of this year.
“There are concerns (about) the wider impact of the envisaged deadline if customers have to be switched off to ensure compliance,” he said.


Welcome to Paradise
In February 2017, I went to O'ahu, Hawaii to visit some friends and see the sights. My friends really spoiled me and they showed me all around the island, even though I was only there for 5 days. I definitely should have stayed longer. Fortunately I am going back early next year.
We went to Waikiki one afternoon. Of course the sunsets are beautiful, the malasadas are delicious and the karaoke scene is wild. But most of it is very crowded and touristy which is not my thing. It was worth visiting to hang out in the park and check out the city views.
We then went to Kane'ohe Bay on the Northeast side of the island. We hung out on the boat and stood on the sandbar all day drinking beer. It was pretty sweet.


Rasberry Pi
The Raspberry Pi is a series of small single-board computers developed in the United Kingdom by the Raspberry Pi Foundation to promote the teaching of basic computer science in schools and in developing countries.
The Raspberry Pi is a series of small single-board computers developed in the United Kingdom by the Raspberry Pi Foundation to promote the teaching of basic computer science in schools and in developing countries.
BeagleBone Black is a low-cost, community-supported development platform for developers and hobbyists. Boot Linux in under 10 seconds and get started on development in less than 5 minutes with just a single USB cable.
Arduino is an open-source electronics platform based on easy-to-use hardware and software. Arduino boards are able to read inputs - light on a sensor, a finger on a button, or a Twitter message - and turn it into an output - activating a motor, turning on an LED, publishing something online.
I decided to rename C52EVB to be 8051SBC. Since the cpu can be any 8051 compatible chips with 40-pin DIP package. The old day chips, say 8031, 8751, 8032 or the new chips,89C51, 89C52, 89C51RD2 can be used without any problem. Some may think that your old chips were useless, now you can use it for many projects.The monitor program of new 8051SBC was placed at external 32kB EPROM. With this space, you can customize your own monitor code or even add the application program and have the DIP switch to boot it when power up. The 32kB SRAM still be mapped as external code and data memory. We can test the programin RAM, when it firmed then put it in the space in EPROM. The memory and i/o decoder is now using GAL (Generic Array Logic).


The ngShow
directive shows or hides the given HTML element based on the expression provided to
the ngShow
attribute.
The element is shown or hidden by removing or adding the .ng-hide
CSS class onto the element.
The .ng-hide
CSS class is predefined in AngularJS and sets the display style to none (using an
!important
flag). For CSP mode please add angular-csp.css
to your HTML file (see
ngCsp).

When the ngShow
expression evaluates to a falsy value then the .ng-hide
CSS class is added
to the class attribute on the element causing it to become hidden. When truthy, the .ng-hide
CSS class is removed from the element causing the element not to appear hidden.
!important
used?You may be wondering why !important
is used for the .ng-hide
CSS class. This is because the
.ng-hide
selector can be easily overridden by heavier selectors. For example, something as
simple as changing the display style on a HTML list item would make hidden elements appear
visible. This also becomes a bigger issue when dealing with CSS frameworks.
By using !important
, the show and hide behavior will work as expected despite any clash between
CSS selector specificity (when !important
isn't used with any conflicting styles). If a
developer chooses to override the styling to change how to hide an element then it is just a
matter of using !important
in their own CSS code.
.ng-hide
By default, the .ng-hide
class will style the element with display: none !important
. If you
wish to change the hide behavior with ngShow
/ngHide
, you can simply overwrite the styles for
the .ng-hide
CSS class. Note that the selector that needs to be used is actually
.ng-hide:not(.ng-hide-animate)
to cope with extra animation classes that can be added.
.ng-hide:not(.ng-hide-animate) {
/* These are just alternative ways of hiding an element */
display: block!important;
position: absolute;
top: -9999px;
left: -9999px;
}
By default you don't need to override anything in CSS and the animations will work around the display style.
When using ngShow
and / or ngHide
to toggle between elements, it can
happen that both the element to show and the element to hide are visible for a very short time.
This usually happens when the ngAnimate module is included, but no actual animations
are defined for ngShow
/ ngHide
. Internet Explorer is affected more often than
other browsers.
There are several way to mitigate this problem:
ngIf
or ngSwitch
instead of ngShow
/ ngHide
.ng-hide.ng-hide-animate
to set {display: none}
or similar on the affected elements.ng-class="{'ng-hide': expression}
instead of instead of ngShow
/ ngHide
.<ng-show
ng-show="expression">
...
</ng-show>
<ANY
ng-show="expression">
...
</ANY>
| Param | Type | Details |
|---|---|---|
| ngShow | expression |
If the expression is truthy/falsy then the element is shown/hidden respectively. |
| Animation | Occurs |
|---|---|
addClass .ng-hide |
After the ngShow expression evaluates to a non truthy value and just before the contents are set to hidden. |
removeClass .ng-hide |
After the ngShow expression evaluates to a truthy value and just before contents are set to visible. |
Animations in ngShow
/ngHide
work with the show and hide events that are triggered when the
directive expression is true and false. This system works like the animation system present with
ngClass
except that you must also include the !important
flag to override the display
property so that the elements are not actually hidden during the animation.
/* A working example can be found at the bottom of this page. */
.my-element.ng-hide-add, .my-element.ng-hide-remove {
transition: all 0.5s linear;
}
.my-element.ng-hide-add { ... }
.my-element.ng-hide-add.ng-hide-add-active { ... }
.my-element.ng-hide-remove { ... }
.my-element.ng-hide-remove.ng-hide-remove-active { ... }
Keep in mind that, as of AngularJS version 1.3, there is no need to change the display property to block during animation states - ngAnimate will automatically handle the style toggling for you.
Click here to learn more about the steps involved in the animation.A simple example, animating the element's opacity:
Show: <input type="checkbox" ng-model="checked" aria-label="Toggle ngShow">

I show up when your checkbox is checked.

.animate-show-hide.ng-hide {
opacity: 0;
}
.animate-show-hide.ng-hide-add,
.animate-show-hide.ng-hide-remove {
transition: all linear 0.5s;
}
.check-element {
border: 1px solid black;
opacity: 1;
padding: 10px;
}
it('should check ngShow', function() {
var checkbox = element(by.model('checked'));
var checkElem = element(by.css('.check-element'));
expect(checkElem.isDisplayed()).toBe(false);
checkbox.click();
expect(checkElem.isDisplayed()).toBe(true);
});
A more complex example, featuring different show/hide animations:
Show: <input type="checkbox" ng-model="checked" aria-label="Toggle ngShow">

I show up when your checkbox is checked.

body {
overflow: hidden;
perspective: 1000px;
}
.funky-show-hide.ng-hide-add {
transform: rotateZ(0);
transform-origin: right;
transition: all 0.5s ease-in-out;
}
.funky-show-hide.ng-hide-add.ng-hide-add-active {
transform: rotateZ(-135deg);
}
.funky-show-hide.ng-hide-remove {
transform: rotateY(90deg);
transform-origin: left;
transition: all 0.5s ease;
}
.funky-show-hide.ng-hide-remove.ng-hide-remove-active {
transform: rotateY(0);
}
.check-element {
border: 1px solid black;
opacity: 1;
padding: 10px;
}
it('should check ngShow', function() {
var checkbox = element(by.model('checked'));
var checkElem = element(by.css('.check-element'));
expect(checkElem.isDisplayed()).toBe(false);
checkbox.click();
expect(checkElem.isDisplayed()).toBe(true);
});


On mobile, only the sorted column is displayed and clicking on it displays a dropdown with all the sortable columns.
Header displaying several columns for tablet or desktop
Header displaying only the active one on mobile mode
Header starting with a checkbox column
HeaderCell
to display.
HeaderCell
when sorting changes
Code for the desktop example above:
{{codeDesktop}}
Code for the mobile example above:
{{codeMobile}}
Code for the table starting with a checkbox column
{{codeCheckboxColumn}}


Suicide Rates Fall After Same-Sex Marriage Legalised In Sweden And Denmark
by Julia BanimThe legalisation of same sex marriage led to significantly reduced suicide rates amongst LGBTQ+ individuals in Sweden and Denmark, according to a study.
Advertisements
Suicide rates among those in same sex relationships dropped notably during two time periods, 2003 to 2016 and 1989 to 2002; partially attributed to the reduced stigmatisation of sexual minorities within these countries.
However, despite this progress, researchers still reported a ‘worryingly high’ number of suicide death amongst LGBTQ+ individuals, who were found to be as twice as likely to die by suicide than their heterosexual counterparts.
Advertisements
Both Sweden and Denmark are regarded to be progressive nations in terms of promoting LGBTQ+ rights with Denmark becoming the first country on earth to permit same-sex civil unions in 1989. Sweden followed in 1995.
Sweden became one of the first countries to legalise gay marriage in 2009, with Denmark following closely behind in 2012.
The study, published in the Journal of Epidemiology and Health, was conducted by the Danish Research Institute for Suicide Prevention and researchers from Stockholm University, who used data from national population registers.
Researchers compared data from 1989 to 2002 and 2003 to 2016, and looked at suicides of those in same-sex couples at the time when civil partnerships were allowed, as well as when same-sex marriage was legalised.
Advertisements
Deaths by suicide among those in same-sex partnerships fell by 46% during both time periods, compared to 28% amongst heterosexual couples.
These figures have been partly attributed to better understanding of mental health issues, however researchers also believe same-sex marriage – and the subsequent reduced stigma – has made for a substantial contribution.
According to the study:
Advertisements
With the passage of time, legalisation of same-sex marriage and the expansion of rights and protections to same-sex couples, those minorities have become much more accepted in the Nordic countries and elsewhere.
This might have decreased the stigmatisation, psychological stress and level of distress experienced by sexual minority people, thereby reducing their suicide risk.
Annette Erlangsen, from the Danish Research Institute for Suicide Prevention, told Reuters:
Being married is protective against suicide.
[…] Legalizing same-sex marriage and other supportive legislative measures – they might actually reduce stigma around sexual minorities.
Sadly, despite this notable decrease, same-sex married people still died by suicide at over twice the rate of those in heterosexual couples during both time periods.
Going forward, researchers have emphasised the ‘critical need for better understanding of suicide risk and protective factors in sexual minority populations’.
These findings reportedly support existing research from other countries that indicate a higher incidence of suicide attempts among those from the LGBTQ+ community.
If you’ve been affected by any of these issues, and want to speak to someone in confidence contact the LGBT Foundation on 0345 3 30 30 30, 9am until 9pm Monday to Friday, and 10am until 6pm Saturday, Or email<EMAIL_ADDRESS>If you’ve been affected by any of these issues, and want to speak to someone in confidence, please don’t suffer alone. Call Samaritans for free on their anonymous 24-hour phone line on 116 123.
Jules studied English Literature with Creative Writing at Lancaster University before earning her masters in International Relations at Leiden University in The Netherlands (Hoi!). She then trained as a journalist through News Associates in Manchester. Jules has previously worked as a mental health blogger, copywriter and freelancer for various publications.


|
Elektra
0.9.4
|
Notification feature. More...
Files | |
| file | kdbnotification.h |
| Elektra-Notification structures and declarations for application developers. | |
| file | kdbnotificationinternal.h |
| Elektra-Notification structures and declarations for developing notification and transport plugins. | |
Typedefs | |
| typedef void(* | ElektraNotificationConversionErrorCallback) (Key *key, void *context) |
| Callback function called when string to number conversion failed. More... | |
| typedef void(* | ElektraNotificationChangeCallback) (Key *key, void *context) |
| Callback function for key changes. More... | |
Functions | |
| int | elektraNotificationOpen (KDB *kdb) |
| Initialize the notification system for the given KDB instance. More... | |
| int | elektraNotificationClose (KDB *kdb) |
| Stop the notification system for the given KDB instance. More... | |
| int | elektraNotificationRegisterCallback (KDB *kdb, Key *key, ElektraNotificationChangeCallback callback, void *context) |
| Subscribe for updates via callback when a given key value is changed. More... | |
| int | elektraNotificationRegisterCallbackSameOrBelow (KDB *kdb, Key *key, ElektraNotificationChangeCallback callback, void *context) |
| Subscribe for updates via callback when a given key or a key below changed. More... | |
| int | elektraNotificationRegisterInt (KDB *kdb, Key *key, int *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterUnsignedInt (KDB *kdb, Key *key, unsigned int *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterLong (KDB *kdb, Key *key, long *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterUnsignedLong (KDB *kdb, Key *key, unsigned long *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterLongLong (KDB *kdb, Key *key, long long *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterUnsignedLongLong (KDB *kdb, Key *key, unsigned long long *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterFloat (KDB *kdb, Key *key, float *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterDouble (KDB *kdb, Key *key, double *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterKdbBoolean (KDB *kdb, Key *key, kdb_boolean_t *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterKdbChar (KDB *kdb, Key *key, kdb_char_t *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterKdbOctet (KDB *kdb, Key *key, kdb_octet_t *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterKdbShort (KDB *kdb, Key *key, kdb_short_t *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterKdbUnsignedShort (KDB *kdb, Key *key, kdb_unsigned_short_t *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterKdbLong (KDB *kdb, Key *key, kdb_long_t *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterKdbUnsignedLong (KDB *kdb, Key *key, kdb_unsigned_long_t *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterKdbLongLong (KDB *kdb, Key *key, kdb_long_long_t *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterKdbUnsignedLongLong (KDB *kdb, Key *key, kdb_unsigned_long_long_t *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterKdbFloat (KDB *kdb, Key *key, kdb_float_t *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
| int | elektraNotificationRegisterKdbDouble (KDB *kdb, Key *key, kdb_double_t *variable) |
| Subscribe for automatic updates to a given variable when the given key value is changed. More... | |
Notification feature.
For an introduction to notifications please see the Notification Tutorial.
Examples:
elektraNotificationOpen() loads and mounts the internalnotification plugin globally at run-time. The key database is not altered permanently. elektraNotificationClose() reverts the mounting.
The internalnotification plugin is mounted at its defined positions (see its plugin docs).
kdb global-mount
the list plugin is mounted at all positions. This plugin allows to mount multiple plugins at a position. If this plugin is present at a position the internalnotification plugin is added to the list plugin's configuration at run-time.Notification transport plugins (or simply transport plugins) export "openNotification" (ElektraNotificationOpenNotification()) and optionally "closeNotification" (ElektraNotificationCloseNotification()) functions as part of their contract.
The function "openNotification" is called during elektraNotificationOpen(). At this point an I/O binding is set and it is save to use it. If no binding is set despite the plugin requires it, it should log a message and perform no additional operations. This ensures that the plugin can be used in applications that do not use I/O bindings or notification features.
ElektraNotificationOpenNotification() receives a callback and additional data. When a key change notification is received (or a change is detected by other means) this callback shall be called with the changed Key and the additional data.
| typedef void(* ElektraNotificationChangeCallback) (Key *key, void *context) |
Callback function for key changes.
| key | changed key |
| context | user supplied callback context |
| typedef void(* ElektraNotificationConversionErrorCallback) (Key *key, void *context) |
Callback function called when string to number conversion failed.
| key | key with invalid value |
| context | user supplied callback context |
| int elektraNotificationClose | ( | KDB * | kdb | ) |
Stop the notification system for the given KDB instance.
May only be called after elektraNotificationOpen() was called for given KDB instance.
| kdb | KDB instance |
| 1 | on success |
| 0 | on error |
| int elektraNotificationOpen | ( | KDB * | kdb | ) |
Initialize the notification system for the given KDB instance.
Asynchronous receiving of notifications requires an I/O binding. Use elektraIoSetBinding() before calling this function.
May only be called once for a KDB instance. Subsequent calls return 0.
| kdb | KDB instance |
| 1 | on success |
| 0 | on error |
| int elektraNotificationRegisterCallback | ( | KDB * | kdb, |
| Key * | key, | ||
| ElektraNotificationChangeCallback | callback, | ||
| void * | context | ||
| ) |
Subscribe for updates via callback when a given key value is changed.
| handle | plugin handle |
| key | key to watch for changes |
| callback | callback function |
| context | user supplied context passed to callback function |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterCallbackSameOrBelow | ( | KDB * | kdb, |
| Key * | key, | ||
| ElektraNotificationChangeCallback | callback, | ||
| void * | context | ||
| ) |
Subscribe for updates via callback when a given key or a key below changed.
| handle | plugin handle |
| key | key to watch for changes |
| callback | callback function |
| context | user supplied context passed to callback function |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterDouble | ( | KDB * | kdb, |
| Key * | key, | ||
| double * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterFloat | ( | KDB * | kdb, |
| Key * | key, | ||
| float * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterInt | ( | KDB * | kdb, |
| Key * | key, | ||
| int * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failureSubscribe for automatic updates to a given variable when the given key value is changed. On kdbGet iff the key is present and its content is valid, the registered variable is updated. |
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterKdbBoolean | ( | KDB * | kdb, |
| Key * | key, | ||
| kdb_boolean_t * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterKdbChar | ( | KDB * | kdb, |
| Key * | key, | ||
| kdb_char_t * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterKdbDouble | ( | KDB * | kdb, |
| Key * | key, | ||
| kdb_double_t * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterKdbFloat | ( | KDB * | kdb, |
| Key * | key, | ||
| kdb_float_t * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterKdbLong | ( | KDB * | kdb, |
| Key * | key, | ||
| kdb_long_t * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterKdbLongLong | ( | KDB * | kdb, |
| Key * | key, | ||
| kdb_long_long_t * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterKdbOctet | ( | KDB * | kdb, |
| Key * | key, | ||
| kdb_octet_t * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterKdbShort | ( | KDB * | kdb, |
| Key * | key, | ||
| kdb_short_t * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterKdbUnsignedLong | ( | KDB * | kdb, |
| Key * | key, | ||
| kdb_unsigned_long_t * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterKdbUnsignedLongLong | ( | KDB * | kdb, |
| Key * | key, | ||
| kdb_unsigned_long_long_t * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterKdbUnsignedShort | ( | KDB * | kdb, |
| Key * | key, | ||
| kdb_unsigned_short_t * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterLong | ( | KDB * | kdb, |
| Key * | key, | ||
| long * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterLongLong | ( | KDB * | kdb, |
| Key * | key, | ||
| long long * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterUnsignedInt | ( | KDB * | kdb, |
| Key * | key, | ||
| unsigned int * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterUnsignedLong | ( | KDB * | kdb, |
| Key * | key, | ||
| unsigned long * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |
| int elektraNotificationRegisterUnsignedLongLong | ( | KDB * | kdb, |
| Key * | key, | ||
| unsigned long long * | variable | ||
| ) |
Subscribe for automatic updates to a given variable when the given key value is changed.
On kdbGet iff the key is present and its content is valid, the registered variable is updated.
| handle | plugin handle |
| key | key to watch for changes |
| variable | variable |
| 1 | on success |
| 0 | on failure |


In a poem she scribbled on the back of a letter to a friend in 1855, the Pre-Raphaelite Muse Lizzie Siddall wrote:
The voices of a thousand birds / That clang above my head, / Shall bring me to a sadder dream / When this sad dream is dead.
A freakish loon by the name of Wilf Birdclang—methinks he changed his name by deed poll—has spent the last fifteen years identifying and cataloguing the thousand different types of bird that make a clanging sound. It would not surprise me if you raised your eyebrows at that sentence, an inner voice exclaiming “what fresh nonsense is this?” You are probably of the conviction that few, if any, birds go “clang”, and certainly not a thousand different types. You might also be thinking to yourself that Lizzie Siddall did not suggest that her clangers were anything but a thousand birds all of the same type. Granted, she does not specify, but I think sheer common sense indicates that she had just one type of bird in mind. What that bird may have been she does not say, thus allowing the likes of Wilf Birdclang to step in with his ludicrous list.
The point about his fifteen years' work is that it is all bluster and assertion, without a trace of evidence or argument. For example, the first bird on Wilf's list is the starling. He writes:
1. The starling. Starlings make loud, even deafening, clanging noises.
Any ornithologist of repute will tell you that this is complete drivel.  I have come across any number of starlings in my time, and not one of them has clanged, ever, deafeningly or otherwise.
Wilf Birdclang has now set to work on a list of a thousand sad dreams. Let us hope it proves more rigorous than his birdy twaddle.


This small port lies about 30nm south east of Cienfuegos on the southern coast of Cuba.
Casilda is the commercial/fishing port for the town of Trinidad (see photo courtesy of SY Calliope).
The port is off limits for cruisers, however the marina here offers reasonable berthing for yachts with a draft of less than 1.7m (5.5 ft), and it is a convenient place to stop in order to visit Trinidad.
Position 21° 44'09"W, 79° 58'23"W (entrance to the bay)
There is no longer a dockmaster or Guarda Frontera on-site at Marina Trinidad. The closest Guarda Frontera station is at Casilda. Yachts are not permitted to go there, but must wait at the marina for the officials from Casilda to visit when they have time.
Consequently, be prepared to wait several hours both on arrival and departure for an official to turn up.
Last updated April 2016.
The approach channel into the harbour is shallow (1.7m) as well as winding. See comment at bottom of page with tips on entering. It is worth the effort however as it is a beautiful place and a possible choice if wanting to leave your boat for a while and travel ovlerland in Cuba.
There are 2 floating docks in the marina [the western one is newer and has better electricity and water connections]. The lagoon is well protected in all wind directions.
Try to call the marina once you are in Cuba to make a booking, or just arrive and anchor until you get a dock space.
For the latest berthing and anchoring charges see comment at bottom of page.
Last updated October 2016.


Cross-platform profiling .NET code with BenchmarkDotNet
EventPipeProfiler
is a new cross-platform profiler that I’ve implemented in the BenchmarkDotNet library. It allows profile .NET code on every platform - Windows, Linux, macOS. Collected data are exported to trace files (.speedscope.json
and .nettrace
) which can be analyzed using SpeedScope, PerfView, and Visual Studio Profiler. This new profiler will be available from 0.12.1 version.
Demo
This profiler can be used in a really simple way. All that needs to be done is mark a benchmarked class with the [EventPipeProfiler(...)]
attribute.
using System.Threading;
using BenchmarkDotNet.Attributes;
using BenchmarkDotNet.Diagnosers;
namespace BenchmarkDotNet.Samples
{
[EventPipeProfiler(EventPipeProfile.CpuSampling)] // <-- Enables new profiler
public class IntroEventPipeProfiler
{
[Benchmark]
public void Sleep() => Thread.Sleep(2000);
}
}
The above benchmark generates the output:
[...]
// * Summary *
[...]
| Method | Mean | Error | StdDev |
|------- |--------:|---------:|---------:|
| Sleep | 2.001 s | 0.0059 s | 0.0003 s |
// * Legends *
[...]
// * Diagnostic Output - EventPipeProfiler *
Exported 1 trace file(s). Example:
C:\work\BenchmarkDotNet\samples\BenchmarkDotNet.Samples\BenchmarkDotNet.Artifacts\BenchmarkDotNet.Samples.IntroEventPipeProfiler.Sleep-20200403-234150.speedscope.json
// ***** BenchmarkRunner: End *****
And the exported .speedscope.json
file can be opened in SpeedScope.
The story
EtwProfiler
profiler is very popular but works only on Windows. .NET Core 3.0 shipped a new cool diagnostics features and tools, so it became possible to create a new cross-platform profiler.
On the Dotnetos Conference 2019, Adam Sitnik showed the new dotnet trace
tool on his .NET Performance Investigation presentation. During a break, I asked Adam why not use it in BenchmarkDotNet? My first idea was to use dotnet trace
command directly in the profiler, but it was not possible because of an issue. The second option was using Microsoft.Diagnostics.NETCore.Client
nuget package which allows everyone to create a profiler in no time. There was only one problem, this package was published in the preview version and I could not able to use it in BenchmarkDotNet. Luckily Sung Yoon Whang came with help and released a final version right away.
All implementation details can be seen in my PR dotnet/BenchmarkDotNet#1321.
Configuration
EventPipeProfiler
can be configured in three different way:
Attribute - As you can see above you can use the
[EventPipeProfiler(...)]
attribute. This attribute takes the following profiles:CpuSampling
- Useful for tracking CPU usage and general .NET runtime information. This is the default option.GcVerbose
- Tracks GC collections and samples object allocations.GcCollect
- Tracks GC collections only at very low overhead.Jit
- Logging when Just in time (JIT) compilation occurs. Logging of the internal workings of the Just In Time compiler. This is fairly verbose. It details decisions about interesting optimization (like inlining and tail call)
Console line parameter - The parameter
-p EP
or--profiler EP
can be used to enable this profiler from the console line.Custom config - The most advanced and powerful way is to use a custom configuration.
The first thing which should be done is the configuration class. The EventPipeProfiler
constructor can take the profile and/or a list of providers.
private class CustomConfig : ManualConfig
{
public CustomConfig()
{
AddJob(Job.ShortRun.WithRuntime(CoreRuntime.Core30));
var providers = new[] // <-- custom list of providers
{
new EventPipeProvider(ClrTraceEventParser.ProviderName, EventLevel.Verbose,
(long) (ClrTraceEventParser.Keywords.Exception
| ClrTraceEventParser.Keywords.GC
| ClrTraceEventParser.Keywords.Jit
| ClrTraceEventParser.Keywords.JitTracing // for the inlining events
| ClrTraceEventParser.Keywords.Loader
| ClrTraceEventParser.Keywords.NGen)),
new EventPipeProvider("System.Buffers.ArrayPoolEventSource", EventLevel.Informational, long.MaxValue),
};
AddDiagnoser(new EventPipeProfiler(providers: providers)); //<-- Adds new profiler
}
}
Then this configuration can be used in the benchmark class.
namespace BenchmarkDotNet.Samples
{
[Config(typeof(CustomConfig))]
public class IntroEventPipeProfilerAdvanced
{
private class CustomConfig : ManualConfig {} // <-- Configuration class
[Benchmark]
public void RentAndReturn_Shared()
{
var pool = ArrayPool<byte>.Shared;
byte[] array = pool.Rent(10000);
pool.Return(array);
}
}
}
As I mentioned before, both EventPipeProfiler
and dotnet trace
use the Microsoft.Diagnostics.NETCore.Client
package internally. So before you start using the custom configuration of this profiler, it is worth reading the documentation here and here.
Analyzing trace files using PerfView
This topic is completely described on Adam Sitnik’s blog, here, so I’m not going to duplicate that information here.
Thanks
I would like to thank:
- Adam Sitnik - for the review and the farther improvement in this profiler, I mean dotnet/BenchmarkDotNet#1381
- Sung Yoon Whang - for great work in Microsoft.Diagnostics.NETCore.Client nuget package, especially for quick release the final version of this package.
- Dotnetos Conference - without which I could not have started work at all.


|
SpinTimer
3.0.0
|
#include <UptimeInfo.h>
Public Member Functions | |
| virtual unsigned long | tMillis ()=0 |
| virtual | ~UptimeInfoAdapter () |
Protected Member Functions | |
| UptimeInfoAdapter () | |
Adapter Interface, will call-out the platform specific up-time info time in milliseconds.
|
inlineprotected |
|
inlinevirtual |
|
pure virtual |
Up-time query call-out. To be implemented according to platform specific circumstances.
Implemented in RaspbianUptimeAdapter, Mock_UptimeInfo, DefaultUptimeInfoAdapter, and STM32UptimeInfoAdapter.


After going viral, Cardi stayed relevant because of her infectious personality and bops.
Where to get clothes like Cardi's: Fashion Nova Angel Brinks NastyGal


{% extends "base.html" %} {% block announcement %}
Msgfuse entered pre-alpha! We are currently working on more features and making the page much more intuitive so we would appreciate any feedback at<EMAIL_ADDRESS>You can also follow our progress and learn more on github.
{% endblock %} {% block content %} {% endblock %} {% block context %}{{linkText}}{{hashCode|urlize}}
{{linkAdmin}}{{hashCodeAdmin|urlize}}
{% endblock %} {% block scripts %} {% endblock %}


Uploading files for: {{study_title}} ({{study_info['study_alias']}})
Currently we can process (
{{extensions.replace(',',', ')}}):
- Note that '.zip' files can not be processed.
- Note that '.fasta' and '.fna' files require '.qual' files for submission.
- Note that '.txt.' files must be tab separated and require the extension .txt.
Per our Terms of Condition for use, you certify that the files you are uploading do not contain:
- protected health information within the meaning of 45 Code of Federal Regulations part 160 and part 164, subparts A and E; see checklist
- whole genome sequencing data for any human subject; HMP human sequence removal protocol
- any data that is copyrighted, protected by trade secret, or otherwise subject to third party proprietary rights, including privacy and publicity rights, unless you are the owner of such rights or have permission from the rightful owner(s) to transfer the data and grant it to Qiita, on behalf of the Regents of the University of California, all of the license rights granted in our Terms.


WITNESS LIST
Insurance Committee
May 2, 2017 - 8:00 AM
For:
Leo, Januari (Legacy Community Health)
Against:
Dudensing, Jamie (Texas Association of Health Plans)
Registering, but not testifying:
For:
Batts, Alfreda (Self)
OFurey, Brad (Self; Equality Texas)
Smith, Chuck (Equality Texas)
Against:
Martin, Amanda (Texas Association of Business)
Spilman, Annie (Natinal Federation of Independent Business/Texas)
On:
Brewer, Pat (Texas Department of Insurance)
Zalkovsky, Emily (The Health and Human Services Commission)
For:
Bearden, Chase (Coalition of Texans with Disabilities)
Hansch, Greg (Self; NATIONAL ALLIANCE on Mental Illness (NAMI) TX)
Maserang, Tracy (Self)
Nyquist, Brian (Self; National Infusion Center Association)
Secrest, Les (Self; Tma)
Stolow, Joshua (Self)
Against:
Dudensing, Jamie (Texas Association of Health Plans)
Harrold, Michael (Express Scripts)
Stoddard, Abigail (Prime therapeutics)
Registering, but not testifying:
For:
Alvarez, Alex (Self)
Amini, Aryanna (Self)
Annis, Joseph (Self)
Austin, Sara (Self)
Berger, Mochelle (Texas Medical Assn)
Bornstein, Sue (Self)
Bose, Ashley (Self)
Childs, Tilden (Self)
Daumas, Lilette (Self)
1
WITNESS LIST
For:
Duerr, James (Self)
Fite MD, Diana (Self)
Floyd, Gary (Self)
Francis, Will (National Association of Social Workers - Texas Chapter)
Frei, Elisabeth (Self)
Gonzales, David (Alliance of Independent Pharmacies of Texas)
Gross, Robert (Self)
Hall Duerr, Pamela (Self)
Heal, John (Pharmacy Buying Association d/b/a Texas TrueCare Pharmicies)
Hinkle, Dan (Texas Academy of Family Physicians)
Humphreys, James (Self)
Jackson, Robert Evan (Self)
Jacobson, Leah (Self)
Jimenez-Belinoski, Anita (Self)
Kenton, Alexander (Self)
Khetan, Roger (Self; Dcms)
King, Alisha (Self; TMA)
Kowalski, Thomas (THBI)
Laroche, Sebastien (Methodist Healthcare Ministries of South Texas, Inc.)
Loose, Patty (Self)
Mansilla, Laura (Tma)
Massingill, G sealy (Self)
Mathis, Samuel (Self)
Miranda, Hector (Self; TMA)
Moy, Cllifford (Self)
Noel, Richard (Self)
Norton, Stacy (Self)
Nwachokor, Daniel (Self)
Ofarrell, Beth (Self)
Parcells, Carolyn (Self)
Parcells, Carolyn (Self)
Pearse, Lee Ann (TMA)
Read, Don (Self)
Reynolds, David (Texas Osteopathic Medical Association)
Riggs, Kayla (Self)
Rogers, Robert (Self)
Sallman, Mary Alice (Self)
Sanchez, Ninza (Self)
Settle, Halsey (Self)
Stewart, Clayton (Texas medical association)
Switzer, Gyl (Mental health america of texas)
Syed, Fatima (Self)
Travis, Clayton (Texas Pediatric Society)
Triggs, Stephanie (Self; Texas Medical Association)
Tsai-Weinberg, Chuwey (Self)
2
WITNESS LIST
For:
Wilking-Johnson, Juliana (Self)
Williford, Jordan (Epilepsy Foundation)
Woomer, Eric (Texas Dermatological Society)
Against:
Ellmer, Mindy (Pharmaceutical care management association)
Horne, Allen (CVS Health)
Martin, Amanda (Texas Association of Business)
Wilson, Wendy (Prime Therapeutics)
On:
Brewer, Pat (Texas Department of Insurance)
Registering, but not testifying:
Against:
Dudensing, Jamie (Texas Association of Health Plans)
Martin, Amanda (Texas Association of Business)
Spilman, Annie (Natinal Federation of Independent Business/Texas)
On:
Brewer, Pat (Texas Department of Insurance)
Zalkovsky, Emily (The Health and Human Services Commission)
For:
Peterson, Richard (Self)
Seger, Michael (Self)
Registering, but not testifying:
For:
Burnip, Debbie (Self)
Capelo, Jaime (Texas Ambulatory Surgery Center Society)
Kowalski, Thomas (THBI)
Ponder, Richard (Johnson & Johnson)
Rumley, Kristen (Self)
Secrest, Leslie (Self; Texas Medical Association)
Seitel, Noah (Self)
Shank, Brian (Novo Nordisk)
Sluder, Jill (Self; Texas ASC Society)
Travis, Clayton (Texas Pediatric Society)
Against:
Dudensing, Jamie (Texas Association of Health Plans)
Martin, Amanda (Texas Association of Business)
Spilman, Annie (Natinal Federation of Independent Business/Texas)
3
WITNESS LIST
On:
Brewer, Pat (Texas Department of Insurance)
For:
Johnson-Patagoc, Kate (Self; Texas Association for Behavior Analysis)
Registering, but not testifying:
For:
Bresette, Patrick (Children's Defense Fund - Texas)
Dunkelberg, Anne (Center for Public Policy Priorities)
Francis, Will (National Association of Social Workers - Texas Chapter)
Hoffman, Courtney (Self; TxABA PPG)
Laroche, Sebastien (Methodist Healthcare Ministries of South Texas, Inc.)
Litzinger, Linda (Self)
Sanders, Jolene (Self; Easterseals)
Stewart, Clayton (Texas medical association)
Switzer, Gyl (Mental health america of texas)
Against:
Dudensing, Jamie (Texas Association of Health Plans)
Martin, Amanda (Texas Association of Business)
Spilman, Annie (Natinal Federation of Independent Business/Texas)
On:
Brewer, Pat (Texas Department of Insurance)
Rodgers, Lindsay (The Health and Human Services Commission)
4


--- layout: default title: AndyMOTE User Guide ---
MQTT allows AndyMOTE to publish it's current activity state to other systems (for example Home Assistant). Andymote requires that the AndyMOTE Server has a MQTT Broker such as Mosquitto installed.
With the AndyMOTE Server properly configured, AndyMOTE will publish the current activity state to the the AndyMOTE Server MQTT Broker. For example if AndyMOTE has an Activity called Watch BluRay and this is activated; AndyMOTE will publish status of andymote = Watch BluRay to the MQTT Broker. If no activities are running then the published status will be set to Off.
This application note describes the use of MQTT to switch on a Raspberry Pi when AndyMOTE publishes it's current activity as andymote = Watch Kodi to the MQTT Broker.
The Circuit Diagram shows the hardware setup for this application. The AndyMOTE Server provides power to a Relay Module via a Micro USB to DIP Adapter and controls the operation of Relay 1 (on the Relay Module) through pin 36 (GPIO 16). Relay 2 is unused.
The Relay 1, normally open (NO) contacts, are connected to Pins 5 & 6 of the Kodi Device (eg RaspberryPi 4). Pins 5 & 6 of a Raspberry Pi, when connected together, cause the device to switch on.
Circuit Diagram
create the file /lib/systemd/system/mqttRelay.service with content as shown below:
To enable the service:


Jtalk is an implementation of the Smalltalk language that runs on top of the JavaScript runtime. It is designed to make client-side development faster and easier.
Jtalk is written in itself, including the parser and compiler. Jtalk compiles into efficient JavaScript, mapping one-to-one with the equivalent JavaScript. There is no interpretation at runtime.
Try a right now!


What is neural Network
Artificial intelligence is a wide concept used to describe the process of mimicking human intelligence by machine. A lot of research is going on and tons of papers are being published, however, this task is very complex and still, a lot of work is required to be done.
Deep Learning is a subcategory of AI where we use a neural net on the large dataset to give the machine some intelligence. a neural network works the same way a human neuron works. It is a function plus non-linearity. It takes data as input and produce some output and pass this output to a nonlinearity function. Currently, it is widely used in NLP and Image processing (Convolutional neural Network.)
Let’s understand how a neural network works. Consider an example that you have been given data and you have to predict whether the given instance is a bird or not. Data have the following column (we call it features).
| id | leg | tail | feather | horn | bird |
|---|---|---|---|---|---|
| 1 | 1 | 1 | 1 | 0 | 1 |
| 2 | 1 | 0 | 0 | 1 | 0 |
| 3 | 1 | 0 | 0 | 1 | 0 |
| 4 | 1 | 1 | 1 | 0 | 1 |
| 5 | 1 | 1 | 0 | 1 | 0 |
From the data, we can see that the horn and feature are very important features to decide whether the given row is a bird or not. In other words, we can say that the feature importance of feather and horn is very high( Feather and horn are co-related but for now we will not into that). We can also say that some features are not that important. So an important feature will have heavyweight and less important features will have lesser weight. The below picture shows how wight is assigned to feature (ranging from 0-1).
Now we have an activation function that adds non-linearity to the model. It decides which feature will pass and which will stop during training. There are multiple activation functions like sigmoid(used in binary classification), softmax, relu, leaky-relu, tanh, etc..
This setup is called neurons and in one model there can be multiple layers of neurons. The first layer is called the input layer and the last layer is called an output layer. While training we pass data through these layers and weight parameters learned by our network.
Now the question is how this weight is learned?
While training, weight is initialized randomly (or using some initialization also like HE). While training we pass the data from the input neuron and some output is generated as the output layer. This is called a forward pass. This output is compared with the actual value and loss is calculated. Now we propagate this loss backward and calculate partial derivative (gradient ) wrt all the wight parameters so that we can minimize this loss. This is called a backward pass. We have multiple gradient-based optimizers that are used to minimize the loss by adjusting the weight values.
Enough talk lets code. We will use Keras to create a simple ANN on most data.
First import all the required packages
from keras.datasets import mnist
import matplotlib.pyplot as plt
from keras.models import Sequential
from keras.layers import Dense
from keras.layers import Dropout
from keras.utils import np_utils
import numpy as np
Load the mnist data
(X_train, y_train), (X_test, y_test) = mnist.load_data()
X_train[0].shape
(28, 28)
Here we can see that images are of 28X28=784 pixels. let’s plot some images.
plt.subplot(221)
plt.imshow(X_train[0], cmap=plt.get_cmap('gray'))
plt.subplot(222)
plt.imshow(X_train[1], cmap=plt.get_cmap('gray'))
plt.subplot(223)
plt.imshow(X_train[2], cmap=plt.get_cmap('gray'))
plt.subplot(224)
plt.imshow(X_train[3], cmap=plt.get_cmap('gray'))
plt.show()
num_pixels = X_train.shape[1] * X_train.shape[2]
X_train = X_train.reshape(X_train.shape[0], num_pixels).astype('float32')
X_test = X_test.reshape(X_test.shape[0], num_pixels).astype('float32')
X_train.shape
(60000, 784)
There are 60000 samples in the train set. Now we will normalize the image. It is good practice to normalize the data between 0-1. Also, there is a total of 10 classes, so we will create a one-hot encoding of the label using to_categorical
.
X_train = X_train / 255
X_test = X_test / 255
y_train = np_utils.to_categorical(y_train)
y_test = np_utils.to_categorical(y_test)
num_classes = y_test.shape[1]
y_train.shape
(60000, 10)
Now create a model. In Keras model can be created in different ways. Here I am using the Sequential model to create the NN. On the image we should use CNN however for demo purposes, I am not using CNN. Instead, I am directly using a dense layer. Here I am using only two layers. In the Sequential model, the output of one layer is automatically passed to the input of the next layer. In our model, the output is multiclass, we are using softmax
activation in the last layer. Softmax gives the probability among all the classes. In other words, it squeezes the output in the probability range of 0-1.
def get_model():
model = Sequential()
model.add(Dense(num_pixels, input_dim=num_pixels, kernel_initializer='normal', activation='relu'))
model.add(Dense(num_classes, kernel_initializer='normal', activation='softmax'))
#Compile model
model.compile(loss='categorical_crossentropy', optimizer='adam', metrics=['accuracy'])
return model
model = get_model()
model.fit(X_train, y_train, validation_data=(X_test, y_test), epochs=10, batch_size=200, verbose=2)
scores = model.evaluate(X_test, y_test, verbose=0)
Epoch 1/10
300/300 - 3s - loss: 0.2720 - accuracy: 0.9233 - val_loss: 0.1387 - val_accuracy: 0.9570
Epoch 2/10
300/300 - 3s - loss: 0.1086 - accuracy: 0.9686 - val_loss: 0.0973 - val_accuracy: 0.9715
Epoch 3/10
300/300 - 3s - loss: 0.0704 - accuracy: 0.9795 - val_loss: 0.0800 - val_accuracy: 0.9749
Epoch 4/10
300/300 - 2s - loss: 0.0495 - accuracy: 0.9855 - val_loss: 0.0729 - val_accuracy: 0.9765
Epoch 5/10
300/300 - 3s - loss: 0.0365 - accuracy: 0.9895 - val_loss: 0.0774 - val_accuracy: 0.9760
Epoch 6/10
300/300 - 2s - loss: 0.0264 - accuracy: 0.9926 - val_loss: 0.0623 - val_accuracy: 0.9802
Epoch 7/10
300/300 - 3s - loss: 0.0190 - accuracy: 0.9952 - val_loss: 0.0623 - val_accuracy: 0.9798
Epoch 8/10
300/300 - 2s - loss: 0.0143 - accuracy: 0.9965 - val_loss: 0.0617 - val_accuracy: 0.9800
Epoch 9/10
300/300 - 3s - loss: 0.0106 - accuracy: 0.9978 - val_loss: 0.0636 - val_accuracy: 0.9811
Epoch 10/10
300/300 - 2s - loss: 0.0077 - accuracy: 0.9987 - val_loss: 0.0597 - val_accuracy: 0.9816
loss,acc = model.evaluate(X_test, y_test, verbose=0)
print(loss,acc)
0.05973554775118828 0.9815999865531921
As we can see, our simple model can give an accuracy of ~98%. Nowadays, there are complex CNN models, using which you can achieve accuracy of ~99.8%.


Sophisticated SVG Filter Effects applied to type
Note: filter effects applied to HTML elements currently are only reliably supported in Firefox and Blink browsers.
- Outlined and filled with pattern
-
SVG only
Applied to HTML
- Extruded and filled with pattern
-
SVG only
Applied to HTML
- Extruded and illuminated
-
SVG only
Applied to HTML
- Used, grungy look with the help of fractal filters
-
SVG only
Applied to HTML
- feTurbulence to achieve a spilled water effect
-
SVG
Applied to HTML
- Some "pop-arty" color effects
-
SVG
Applied to HTML
- Sketchy style
-
SVG
Applied to HTML
- Basic Techniques
-
-


--- layout: archive title: Zulip Chat Archive permalink: /stream/144837-PR-reviews/topic/.232106.20bump.20lean.html ---
Should we merge this PR?
Looks good to me. On the queue.
Last updated: Apr 24 2020 at 19:02 UTC


Campaign Definition
Target Groups
Campaign Details
Incentives
Targets
Please define campaign goals
Target Group
Population
Responses required
Estimated Cost
TG 1
1.2 million
800
$6400
TG 1
1.2 million
800
$6400
TG 1
1.2 million
800
$6400
Total
1.2 million
800
$6400