Changeset 3832


Ignore:
Timestamp:
Aug 6, 2019, 6:32:58 AM (3 years ago)
Author:
Peter
Message:

merge release 0.16.1 intro trunk

Location:
trunk
Files:
5 edited

Legend:

Unmodified
Added
Removed
  • trunk

  • trunk/NEWS

    r3823 r3832  
    1212
    1313yat 0.16.x series from http://dev.thep.lu.se/yat/svn/branches/0.16-stable
     14
     15version 0.16.1 (released 6 August 2019)
     16  - Fixed a bug that PriorityQueue could only store unique elements (see #927)
     17
     18  A complete list of closed tickets can be found here [[br]]
     19  http://dev.thep.lu.se/yat/query?status=closed&milestone=yat+0.16.1
    1420
    1521version 0.16 (released 16 July 2019)
  • trunk/m4/version.m4

    r3796 r3832  
    8989# yat-0.15.1 12:1:0
    9090# yat-0.16   13:0:0
     91# yat-0.16.1 13:1:0
    9192#
    9293# *Accidently, the libtool number was not updated for yat 0.5
  • trunk/test/priority_queue.cc

    r3403 r3832  
    22
    33/*
    4   Copyright (C) 2015 Peter Johansson
     4  Copyright (C) 2015, 2019 Peter Johansson
    55
    66  This file is part of the yat library, http://dev.thep.lu.se/yat
     
    9595  PriorityQueue<std::string, MyComp> queue2(comp);
    9696  queue2.push("hello");
     97  if (queue2.size() != 1) {
     98    suite.add(false);
     99    suite.err() << "incorrect size: " << queue2.size() << "; expected 1\n";
     100  }
     101  queue2.push("hello");
     102  if (queue2.size() != 2) {
     103    suite.add(false);
     104    suite.err() << "incorrect size: " << queue2.size() << "; expected 2\n";
     105  }
    97106
    98107  return suite.return_value();
  • trunk/yat/utility/PriorityQueue.h

    r3792 r3832  
    44// $Id$
    55//
    6 // Copyright (C) 2015, 2016, 2017, 2018 Peter Johansson
     6// Copyright (C) 2015, 2016, 2017, 2018, 2019 Peter Johansson
    77//
    88// This program is free software; you can redistribute it and/or modify
     
    5656    : public detail::BasicQueue<PriorityQueue<T, Compare>
    5757                                , T
    58                                 , std::set<T, Compare> >
     58                                , std::multiset<T, Compare> >
    5959  {
    6060    friend class detail::BasicQueue<PriorityQueue<T, Compare>
    61                                     ,T,std::set<T,Compare> >;
     61                                    ,T,std::multiset<T,Compare> >;
    6262    typedef detail::BasicQueue<PriorityQueue<T, Compare>
    6363                               , T
    64                                , std::set<T,Compare> > Base;
     64                               , std::multiset<T,Compare> > Base;
    6565  public:
    6666    /**
     
    7373    */
    7474    explicit PriorityQueue(const Compare& comp)
    75       : Base(std::set<T, Compare>(comp)) {}
     75      : Base(std::multiset<T, Compare>(comp)) {}
    7676
    7777    /**
     
    9898      // has been popped and the element is lost. Instead we choose to
    9999      // return via passed reference.
    100       typename std::set<T, Compare>::iterator it = this->q_.end();
     100      typename std::multiset<T, Compare>::iterator it = this->q_.end();
    101101      YAT_ASSERT(this->q_.size());
    102102      --it;
Note: See TracChangeset for help on using the changeset viewer.