lnav/src/bookmarks.hh

210 lines
6.1 KiB
C++
Raw Normal View History

2009-09-14 01:07:32 +00:00
/**
2013-05-03 06:02:03 +00:00
* Copyright (c) 2007-2012, Timothy Stack
*
* All rights reserved.
2013-05-28 04:35:00 +00:00
*
2013-05-03 06:02:03 +00:00
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
2013-05-28 04:35:00 +00:00
*
2013-05-03 06:02:03 +00:00
* * Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* * Neither the name of Timothy Stack nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
2013-05-28 04:35:00 +00:00
*
2013-05-03 06:02:03 +00:00
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ''AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
2022-03-16 22:38:08 +00:00
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2013-05-03 06:02:03 +00:00
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
2009-09-14 01:07:32 +00:00
* @file bookmarks.hh
*/
#ifndef bookmarks_hh
#define bookmarks_hh
2009-09-14 01:07:32 +00:00
2022-03-16 22:38:08 +00:00
#include <algorithm>
2009-09-14 01:07:32 +00:00
#include <map>
2022-04-12 23:07:13 +00:00
#include <unordered_set>
#include <string>
2009-09-14 01:07:32 +00:00
#include <vector>
2019-05-08 12:30:59 +00:00
#include "base/lnav_log.hh"
2009-09-14 01:07:32 +00:00
struct bookmark_metadata {
2022-04-12 23:07:13 +00:00
static std::unordered_set<std::string> KNOWN_TAGS;
std::string bm_name;
std::string bm_comment;
std::vector<std::string> bm_tags;
2022-04-12 23:07:13 +00:00
void add_tag(const std::string& tag);
2022-04-12 23:07:13 +00:00
bool remove_tag(const std::string& tag);
2022-04-12 23:07:13 +00:00
bool empty() const;
2022-04-12 23:07:13 +00:00
void clear();
};
2009-09-14 01:07:32 +00:00
/**
* Extension of the STL vector that is used to store bookmarks for
* files being viewed, where a bookmark is just a particular line in
* the file(s). The value-added over the standard vector are some
* methods for doing content-wise iteration. In other words, given a
* value that may or may not be in the vector, find the next or
* previous value that is in the vector.
*
* @param LineType The type used to store line numbers. (e.g.
* vis_line_t or content_line_t)
*
2009-09-14 01:07:32 +00:00
* @note The vector is expected to be sorted.
*/
template<typename LineType>
2013-05-28 04:35:00 +00:00
class bookmark_vector : public std::vector<LineType> {
2022-04-12 23:07:13 +00:00
using base_vector = std::vector<LineType>;
2009-09-14 01:07:32 +00:00
public:
2022-04-12 23:07:13 +00:00
using size_type = typename base_vector::size_type;
using iterator = typename base_vector::iterator;
using const_iterator = typename base_vector::const_iterator;
2009-09-14 01:07:32 +00:00
/**
* Insert a bookmark into this vector, but only if it is not already in the
* vector.
*
* @param vl The line to bookmark.
*/
iterator insert_once(LineType vl)
2009-09-14 01:07:32 +00:00
{
2022-04-12 23:07:13 +00:00
iterator retval;
2009-09-14 01:07:32 +00:00
require(vl >= 0);
2009-09-14 01:07:32 +00:00
2022-04-12 23:07:13 +00:00
auto lb = std::lower_bound(this->begin(), this->end(), vl);
2013-05-28 04:35:00 +00:00
if (lb == this->end() || *lb != vl) {
this->insert(lb, vl);
retval = this->end();
2022-03-16 22:38:08 +00:00
} else {
2013-05-28 04:35:00 +00:00
retval = lb;
}
2009-09-14 01:07:32 +00:00
2013-05-28 04:35:00 +00:00
return retval;
}
2009-09-14 01:07:32 +00:00
2022-03-16 22:38:08 +00:00
std::pair<iterator, iterator> equal_range(LineType start, LineType stop)
{
auto lb = std::lower_bound(this->begin(), this->end(), start);
if (stop == LineType(-1)) {
return std::make_pair(lb, this->end());
}
2022-04-12 23:07:13 +00:00
auto up = std::upper_bound(this->begin(), this->end(), stop);
return std::make_pair(lb, up);
}
2009-09-14 01:07:32 +00:00
/**
* @param start The value to start the search for the next bookmark.
* @return The next bookmark value in the vector or -1 if there are
* no more remaining bookmarks. If the 'start' value is a bookmark,
* the next bookmark is returned. If the 'start' value is not a
* bookmark, the next highest value in the vector is returned.
*/
nonstd::optional<LineType> next(LineType start) const;
2009-09-14 01:07:32 +00:00
/**
* @param start The value to start the search for the previous
* bookmark.
* @return The previous bookmark value in the vector or -1 if there
* are no more prior bookmarks.
* @see next
*/
nonstd::optional<LineType> prev(LineType start) const;
2009-09-14 01:07:32 +00:00
};
/**
* Dummy type whose instances are used to distinguish between
* bookmarks maintained by different source modules.
*/
2015-03-29 21:50:34 +00:00
class bookmark_type_t {
public:
2022-04-12 23:07:13 +00:00
using type_iterator = std::vector<bookmark_type_t*>::iterator;
2015-03-29 21:50:34 +00:00
static type_iterator type_begin() { return get_all_types().begin(); }
2015-03-29 21:50:34 +00:00
static type_iterator type_end() { return get_all_types().end(); }
2015-03-29 21:50:34 +00:00
static nonstd::optional<bookmark_type_t*> find_type(
const std::string& name);
2015-03-29 21:50:34 +00:00
static std::vector<bookmark_type_t*>& get_all_types();
2022-03-16 22:38:08 +00:00
explicit bookmark_type_t(std::string name) : bt_name(std::move(name))
{
get_all_types().push_back(this);
2022-04-12 23:07:13 +00:00
}
2015-03-29 21:50:34 +00:00
const std::string& get_name() const { return this->bt_name; }
2015-03-29 21:50:34 +00:00
private:
const std::string bt_name;
};
2009-09-14 01:07:32 +00:00
template<typename LineType>
nonstd::optional<LineType>
2022-03-16 22:38:08 +00:00
bookmark_vector<LineType>::next(LineType start) const
{
nonstd::optional<LineType> retval;
require(start >= -1);
2022-04-12 23:07:13 +00:00
auto ub = std::upper_bound(this->cbegin(), this->cend(), start);
if (ub != this->cend()) {
retval = *ub;
}
ensure(!retval || start < retval.value());
return retval;
}
template<typename LineType>
nonstd::optional<LineType>
2022-03-16 22:38:08 +00:00
bookmark_vector<LineType>::prev(LineType start) const
{
nonstd::optional<LineType> retval;
require(start >= 0);
2022-04-12 23:07:13 +00:00
auto lb = std::lower_bound(this->cbegin(), this->cend(), start);
if (lb != this->cbegin()) {
2022-03-16 22:38:08 +00:00
lb -= 1;
retval = *lb;
}
ensure(!retval || retval.value() < start);
return retval;
}
2009-09-14 01:07:32 +00:00
/**
* Map of bookmark types to bookmark vectors.
*/
template<typename LineType>
struct bookmarks {
2022-04-12 23:07:13 +00:00
using type = std::map<const bookmark_type_t*, bookmark_vector<LineType>>;
};
2009-09-14 01:07:32 +00:00
#endif