1/*
2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;

--- 620 unchanged lines hidden (view full) ---

629 assert(latency > 0);
630
631 assert(m_mandatory_q_ptr != NULL);
632 m_mandatory_q_ptr->enqueue(msg, clockEdge(), cyclesToTicks(latency));
633}
634
635template <class KEY, class VALUE>
636std::ostream &
637operator<<(ostream &out, const std::unordered_map<KEY, VALUE> &map)
638{
639 auto i = map.begin();
640 auto end = map.end();
641
642 out << "[";
643 for (; i != end; ++i)
644 out << " " << i->first << "=" << i->second;
645 out << " ]";
646
647 return out;
648}

--- 107 unchanged lines hidden ---