buff << abs(this->plus2) << " card";
                    if (abs(this->plus2) > 1)
                        buff << "s";

                        buff << " drawn";

                        buff << "drawn: ";

                        buff << " left";

                        buff << "left: ";
                    buff << abs(this->plus2);

        const std::vector<card_type> drawn_cards = get_drawn_cards(item);
        if ( !drawn_cards.empty() )
        {
            description += "Drawn card(s): ";
            for ( unsigned int i = 0; i < drawn_cards.size(); ++i )
            {
                if ( i != 0 )
                    description += ", ";
                description += card_name(drawn_cards[i]);
            }
            description += "$";
        }

            description += "$";

            description += "$Seen cards: ";

            description += "Seen card(s): ";

            description += "$";

        description += "$";

const std::vector<card_type> get_drawn_cards(const item_def& deck);

// card), deck.props["card_flags"] holds the flags for each card,
// deck.props["num_marked"] is the number of marked cards left in the
// deck, and deck.props["non_brownie_draws"] is the number of
// non-marked draws you have to make from that deck before earning
// brownie points from it again.

// card), deck.props["drawn_cards"] holds the list of drawn cards
// (with index 0 being the first drawn), deck.props["card_flags"]
// holds the flags for each card, deck.props["num_marked"] is the
// number of marked cards left in the deck, and
// deck.props["non_brownie_draws"] is the number of non-marked draws
// you have to make from that deck before earning brownie points from
// it again.

        idx = (int) cards.size() - 1;

        idx = static_cast<int>(cards.size()) - 1;

}
static void remember_drawn_card(item_def& deck, card_type card)
{
    ASSERT( is_deck(deck) );
    CrawlHashTable &props = deck.props;
    CrawlVector &drawn = props["drawn_cards"].get_vector();
    drawn.push_back( static_cast<char>(card) );

const std::vector<card_type> get_drawn_cards(const item_def& deck)
{
    std::vector<card_type> result;
    if ( is_deck(deck) )
    {
        const CrawlHashTable &props = deck.props;
        const CrawlVector &drawn = props["drawn_cards"].get_vector();
        for ( unsigned int i = 0; i < drawn.size(); ++i )
        {
            const char tmp = drawn[i];
            result.push_back(static_cast<card_type>(tmp));
        }
    }
    return result;
}

    for ( int i = 0; i < num_to_draw; ++i )
        remember_drawn_card(deck, draws[i]);

// In general, if the next cards in a deck are known, they will
// be stored in plus2 (the next card) and special (up to 4 cards
// after that, bitpacked.)
// Hidden assumption: no more than 126 cards, otherwise the 5th
// card could clobber the sign bit in special.

    remember_drawn_card(deck, card);

    props["cards_drawn"].new_vector(SV_BYTE);