GIT_REPOSITORIES/LPP/Users/mperrinel/SciQLop-fork Commit - r641:81ae254ee5ba

Replaces current iterator of ArrayData by the previous iterator created

Alexandre Leroux -

r641:81ae254ee5ba

parent child

Context file:

r641:81ae254ee5ba

Collapse all files

core/include/Data/ArrayData.h +53 -76

             #ifndef SCIQLOP_ARRAYDATA_H
             #define SCIQLOP_ARRAYDATA_H
+            #include "Data/ArrayDataIterator.h"
             #include <Common/SortUtils.h>
             #include <QReadLocker>
             #include <QReadWriteLock>
             #include <QVector>
             #include <memory>
             template <int Dim>
             class ArrayData;
             using DataContainer = QVector<QVector<double> >;
             namespace arraydata_detail {
             /// Struct used to sort ArrayData
             template <int Dim>
             struct Sort {
                 static std::shared_ptr<ArrayData<Dim> > sort(const DataContainer &data,
                                                              const std::vector<int> &sortPermutation)
                 {
                     auto nbComponents = data.size();
                     auto sortedData = DataContainer(nbComponents);
                     for (auto i = 0; i < nbComponents; ++i) {
                         sortedData[i] = SortUtils::sort(data.at(i), sortPermutation);
                     }
                     return std::make_shared<ArrayData<Dim> >(std::move(sortedData));
                 }
             };
             /// Specialization for uni-dimensional ArrayData
             template <>
             struct Sort<1> {
                 static std::shared_ptr<ArrayData<1> > sort(const DataContainer &data,
                                                            const std::vector<int> &sortPermutation)
                 {
                     return std::make_shared<ArrayData<1> >(SortUtils::sort(data.at(0), sortPermutation));
                 }
             };
-            } // namespace arraydata_detail
-            /**
-             * @brief The ArrayData class represents a dataset for a data series.
-             * A dataset can be unidimensional or two-dimensional. This property is determined by the Dim
-             * template-parameter. In a case of a two-dimensional dataset, each dataset component has the same
-             * number of values
-             * @tparam Dim the dimension of the ArrayData (one or two)
-             * @sa IDataSeries
-             */
             template <int Dim>
-            class ArrayData {
+            class IteratorValue : public ArrayDataIteratorValue::Impl {
-            public:
-                class IteratorValue {
             public:
                 explicit IteratorValue(const DataContainer &container, bool begin) : m_Its{}
                 {
                     for (auto i = 0; i < container.size(); ++i) {
                         m_Its.push_back(begin ? container.at(i).cbegin() : container.at(i).cend());
                     }
                 }
-                    double at(int index) const { return *m_Its.at(index); }
+                IteratorValue(const IteratorValue &other) = default;
-                    double first() const { return *m_Its.front(); }
-                    /// @return the min value among all components
+                std::unique_ptr<ArrayDataIteratorValue::Impl> clone() const override
-                    double min() const
                 {
-                        auto end = m_Its.cend();
+                    return std::make_unique<IteratorValue<Dim> >(*this);
-                        auto it = std::min_element(m_Its.cbegin(), end, [](const auto &it1, const auto &it2) {
-                            return SortUtils::minCompareWithNaN(*it1, *it2);
-                        });
-                        return it != end ? **it : std::numeric_limits<double>::quiet_NaN();
                 }
-                    /// @return the max value among all components
+                bool equals(const ArrayDataIteratorValue::Impl &other) const override try {
-                    double max() const
+                    const auto &otherImpl = dynamic_cast<const IteratorValue &>(other);
+                    return m_Its == otherImpl.m_Its;
-                        auto end = m_Its.cend();
-                        auto it = std::max_element(m_Its.cbegin(), end, [](const auto &it1, const auto &it2) {
+                catch (const std::bad_cast &) {
-                            return SortUtils::maxCompareWithNaN(*it1, *it2);
+                    return false;
-                        });
-                        return it != end ? **it : std::numeric_limits<double>::quiet_NaN();
                 }
-                    void next()
+                void next() override
                 {
                     for (auto &it : m_Its) {
                         ++it;
                     }
                 }
-                    void prev()
+                void prev() override
                 {
                     for (auto &it : m_Its) {
                         --it;
                     }
                 }
-                    bool operator==(const IteratorValue &other) const { return m_Its == other.m_Its; }
+                double at(int componentIndex) const override { return *m_Its.at(componentIndex); }
+                double first() const override { return *m_Its.front(); }
-                private:
+                double min() const override
-                    std::vector<DataContainer::value_type::const_iterator> m_Its;
-                };
-                class Iterator {
-                public:
-                    using iterator_category = std::forward_iterator_tag;
-                    using value_type = const IteratorValue;
-                    using difference_type = std::ptrdiff_t;
-                    using pointer = value_type *;
-                    using reference = value_type &;
-                    Iterator(const DataContainer &container, bool begin) : m_CurrentValue{container, begin} {}
-                    virtual ~Iterator() noexcept = default;
-                    Iterator(const Iterator &) = default;
-                    Iterator(Iterator &&) = default;
-                    Iterator &operator=(const Iterator &) = default;
-                    Iterator &operator=(Iterator &&) = default;
-                    Iterator &operator++()
                 {
-                        m_CurrentValue.next();
+                    auto end = m_Its.cend();
-                        return *this;
+                    auto it = std::min_element(m_Its.cbegin(), end, [](const auto &it1, const auto &it2) {
+                        return SortUtils::minCompareWithNaN(*it1, *it2);
+                    });
-                    Iterator &operator--()
+                    return it != end ? **it : std::numeric_limits<double>::quiet_NaN();
-                        m_CurrentValue.prev();
-                        return *this;
                 }
+                double max() const override
-                    pointer operator->() const { return &m_CurrentValue; }
-                    reference operator*() const { return m_CurrentValue; }
-                    bool operator==(const Iterator &other) const
                 {
-                        return m_CurrentValue == other.m_CurrentValue;
+                    auto end = m_Its.cend();
+                    auto it = std::max_element(m_Its.cbegin(), end, [](const auto &it1, const auto &it2) {
+                        return SortUtils::maxCompareWithNaN(*it1, *it2);
+                    });
+                    return it != end ? **it : std::numeric_limits<double>::quiet_NaN();
                 }
-                    bool operator!=(const Iterator &other) const { return !(*this == other); }
             private:
-                    IteratorValue m_CurrentValue;
+                std::vector<DataContainer::value_type::const_iterator> m_Its;
             };
+            } // namespace arraydata_detail
+            /**
+             * @brief The ArrayData class represents a dataset for a data series.
+             *
+             * A dataset can be unidimensional or two-dimensional. This property is determined by the Dim
+             * template-parameter. In a case of a two-dimensional dataset, each dataset component has the same
+             * number of values
+             *
+             * @tparam Dim the dimension of the ArrayData (one or two)
+             * @sa IDataSeries
+             */
+            template <int Dim>
+            class ArrayData {
+            public:
                 // ///// //
                 // Ctors //
                 // ///// //
                 /**
                  * Ctor for a unidimensional ArrayData
                  * @param data the data the ArrayData will hold
                  */
                 template <int D = Dim, typename = std::enable_if_t<D == 1> >
                 explicit ArrayData(QVector<double> data) : m_Data{1, QVector<double>{}}
                 {
                     m_Data[0] = std::move(data);
                 }
                 /**
                  * Ctor for a two-dimensional ArrayData. The number of components (number of vectors) must be
                  * greater than 2 and each component must have the same number of values
                  * @param data the data the ArrayData will hold
                  * @throws std::invalid_argument if the number of components is less than 2
                  * @remarks if the number of values is not the same for each component, no value is set
                  */
                 template <int D = Dim, typename = std::enable_if_t<D == 2> >
                 explicit ArrayData(DataContainer data)
                 {
                     auto nbComponents = data.size();
                     if (nbComponents < 2) {
                         throw std::invalid_argument{
                             QString{"A multidimensional ArrayData must have at least 2 components (found: %1"}
                                 .arg(data.size())
                                 .toStdString()};
                     }
                     auto nbValues = data.front().size();
                     if (std::all_of(data.cbegin(), data.cend(), [nbValues](const auto &component) {
                             return component.size() == nbValues;
                         })) {
                         m_Data = std::move(data);
                     }
                     else {
                         m_Data = DataContainer{nbComponents, QVector<double>{}};
                     }
                 }
                 /// Copy ctor
                 explicit ArrayData(const ArrayData &other)
                 {
                     QReadLocker otherLocker{&other.m_Lock};
                     m_Data = other.m_Data;
                 }
                 // /////////////// //
                 // General methods //
                 // /////////////// //
                 /**
                  * Merges into the array data an other array data. The two array datas must have the same number
                  * of components so the merge can be done
                  * @param other the array data to merge with
                  * @param prepend if true, the other array data is inserted at the beginning, otherwise it is
                  * inserted at the end
                  */
                 void add(const ArrayData<Dim> &other, bool prepend = false)
                 {
                     QWriteLocker locker{&m_Lock};
                     QReadLocker otherLocker{&other.m_Lock};
                     auto nbComponents = m_Data.size();
                     if (nbComponents != other.m_Data.size()) {
                         return;
                     }
                     for (auto componentIndex = 0; componentIndex < nbComponents; ++componentIndex) {
                         if (prepend) {
                             const auto &otherData = other.data(componentIndex);
                             const auto otherDataSize = otherData.size();
                             auto &data = m_Data[componentIndex];
                             data.insert(data.begin(), otherDataSize, 0.);
                             for (auto i = 0; i < otherDataSize; ++i) {
                                 data.replace(i, otherData.at(i));
                             }
                         }
                         else {
                             m_Data[componentIndex] += other.data(componentIndex);
                         }
                     }
                 }
                 void clear()
                 {
                     QWriteLocker locker{&m_Lock};
                     auto nbComponents = m_Data.size();
                     for (auto i = 0; i < nbComponents; ++i) {
                         m_Data[i].clear();
                     }
                 }
                 int componentCount() const noexcept { return m_Data.size(); }
                 /**
                  * @return the data of a component
                  * @param componentIndex the index of the component to retrieve the data
                  * @return the component's data, empty vector if the index is invalid
                  */
                 QVector<double> data(int componentIndex) const noexcept
                 {
                     QReadLocker locker{&m_Lock};
                     return (componentIndex >= 0 && componentIndex < m_Data.size()) ? m_Data.at(componentIndex)
                                                                                    : QVector<double>{};
                 }
                 /// @return the size (i.e. number of values) of a single component
                 /// @remarks in a case of a two-dimensional ArrayData, each component has the same size
                 int size() const
                 {
                     QReadLocker locker{&m_Lock};
                     return m_Data[0].size();
                 }
                 std::shared_ptr<ArrayData<Dim> > sort(const std::vector<int> &sortPermutation)
                 {
                     QReadLocker locker{&m_Lock};
                     return arraydata_detail::Sort<Dim>::sort(m_Data, sortPermutation);
                 }
                 // ///////// //
                 // Iterators //
                 // ///////// //
-                Iterator cbegin() const { return Iterator{m_Data, true}; }
+                ArrayDataIterator cbegin() const
-                Iterator cend() const { return Iterator{m_Data, false}; }
+                    return ArrayDataIterator{ArrayDataIteratorValue{
+                        std::make_unique<arraydata_detail::IteratorValue<Dim> >(m_Data, true)}};
+                }
+                ArrayDataIterator cend() const
+                {
+                    return ArrayDataIterator{ArrayDataIteratorValue{
+                        std::make_unique<arraydata_detail::IteratorValue<Dim> >(m_Data, false)}};
+                }
                 // ///////////// //
                 // 1-dim methods //
                 // ///////////// //
                 /**
                  * @return the data at a specified index
                  * @remarks index must be a valid position
                  * @remarks this method is only available for a unidimensional ArrayData
                  */
                 template <int D = Dim, typename = std::enable_if_t<D == 1> >
                 double at(int index) const noexcept
                 {
                     QReadLocker locker{&m_Lock};
                     return m_Data[0].at(index);
                 }
                 /**
                  * @return the data as a vector, as a const reference
                  * @remarks this method is only available for a unidimensional ArrayData
                  */
                 template <int D = Dim, typename = std::enable_if_t<D == 1> >
                 const QVector<double> &cdata() const noexcept
                 {
                     QReadLocker locker{&m_Lock};
                     return m_Data.at(0);
                 }
                 /**
                  * @return the data as a vector
                  * @remarks this method is only available for a unidimensional ArrayData
                  */
                 template <int D = Dim, typename = std::enable_if_t<D == 1> >
                 QVector<double> data() const noexcept
                 {
                     QReadLocker locker{&m_Lock};
                     return m_Data[0];
                 }
                 // ///////////// //
                 // 2-dim methods //
                 // ///////////// //
                 /**
                  * @return the data
                  * @remarks this method is only available for a two-dimensional ArrayData
                  */
                 template <int D = Dim, typename = std::enable_if_t<D == 2> >
                 DataContainer data() const noexcept
                 {
                     QReadLocker locker{&m_Lock};
                     return m_Data;
                 }
             private:
                 DataContainer m_Data;
                 mutable QReadWriteLock m_Lock;
             };
             #endif // SCIQLOP_ARRAYDATA_H

core/include/Data/DataSeries.h +2 -2

             #ifndef SCIQLOP_DATASERIES_H
             #define SCIQLOP_DATASERIES_H
             #include "CoreGlobal.h"
             #include <Common/SortUtils.h>
             #include <Data/ArrayData.h>
             #include <Data/IDataSeries.h>
             #include <QLoggingCategory>
             #include <QReadLocker>
             #include <QReadWriteLock>
             #include <memory>
             // We don't use the Qt macro since the log is used in the header file, which causes multiple log
             // definitions with inheritance. Inline method is used instead
             inline const QLoggingCategory &LOG_DataSeries()
             {
                 static const QLoggingCategory category{"DataSeries"};
                 return category;
             }
             template <int Dim>
             class DataSeries;
             namespace dataseries_detail {
             template <int Dim>
             class IteratorValue : public DataSeriesIteratorValue::Impl {
             public:
                 explicit IteratorValue(const DataSeries<Dim> &dataSeries, bool begin)
                         : m_XIt(begin ? dataSeries.xAxisData()->cbegin() : dataSeries.xAxisData()->cend()),
                           m_ValuesIt(begin ? dataSeries.valuesData()->cbegin()
                                            : dataSeries.valuesData()->cend())
                 {
                 }
                 IteratorValue(const IteratorValue &other) = default;
                 std::unique_ptr<DataSeriesIteratorValue::Impl> clone() const override
                 {
                     return std::make_unique<IteratorValue<Dim> >(*this);
                 }
                 bool equals(const DataSeriesIteratorValue::Impl &other) const override try {
                     const auto &otherImpl = dynamic_cast<const IteratorValue &>(other);
                     return std::tie(m_XIt, m_ValuesIt) == std::tie(otherImpl.m_XIt, otherImpl.m_ValuesIt);
                 }
                 catch (const std::bad_cast &) {
                     return false;
                 }
                 void next() override
                 {
                     ++m_XIt;
                     ++m_ValuesIt;
                 }
                 void prev() override
                 {
                     --m_XIt;
                     --m_ValuesIt;
                 }
                 double x() const override { return m_XIt->at(0); }
                 double value() const override { return m_ValuesIt->at(0); }
                 double value(int componentIndex) const override { return m_ValuesIt->at(componentIndex); }
                 double minValue() const override { return m_ValuesIt->min(); }
                 double maxValue() const override { return m_ValuesIt->max(); }
             private:
-                ArrayData<1>::Iterator m_XIt;
+                ArrayDataIterator m_XIt;
-                typename ArrayData<Dim>::Iterator m_ValuesIt;
+                ArrayDataIterator m_ValuesIt;
             };
             } // namespace dataseries_detail
             /**
              * @brief The DataSeries class is the base (abstract) implementation of IDataSeries.
              *
              * It proposes to set a dimension for the values data.
              *
              * A DataSeries is always sorted on its x-axis data.
              *
              * @tparam Dim The dimension of the values data
              *
              */
             template <int Dim>
             class SCIQLOP_CORE_EXPORT DataSeries : public IDataSeries {
             public:
                 /// @sa IDataSeries::xAxisData()
                 std::shared_ptr<ArrayData<1> > xAxisData() override { return m_XAxisData; }
                 const std::shared_ptr<ArrayData<1> > xAxisData() const { return m_XAxisData; }
                 /// @sa IDataSeries::xAxisUnit()
                 Unit xAxisUnit() const override { return m_XAxisUnit; }
                 /// @return the values dataset
                 std::shared_ptr<ArrayData<Dim> > valuesData() { return m_ValuesData; }
                 const std::shared_ptr<ArrayData<Dim> > valuesData() const { return m_ValuesData; }
                 /// @sa IDataSeries::valuesUnit()
                 Unit valuesUnit() const override { return m_ValuesUnit; }
                 SqpRange range() const override
                 {
                     if (!m_XAxisData->cdata().isEmpty()) {
                         return SqpRange{m_XAxisData->cdata().first(), m_XAxisData->cdata().last()};
                     }
                     return SqpRange{};
                 }
                 void clear()
                 {
                     m_XAxisData->clear();
                     m_ValuesData->clear();
                 }
                 /// Merges into the data series an other data series
                 /// @remarks the data series to merge with is cleared after the operation
                 void merge(IDataSeries *dataSeries) override
                 {
                     dataSeries->lockWrite();
                     lockWrite();
                     if (auto other = dynamic_cast<DataSeries<Dim> *>(dataSeries)) {
                         const auto &otherXAxisData = other->xAxisData()->cdata();
                         const auto &xAxisData = m_XAxisData->cdata();
                         // As data series are sorted, we can improve performances of merge, by call the sort
                         // method only if the two data series overlap.
                         if (!otherXAxisData.empty()) {
                             auto firstValue = otherXAxisData.front();
                             auto lastValue = otherXAxisData.back();
                             auto xAxisDataBegin = xAxisData.cbegin();
                             auto xAxisDataEnd = xAxisData.cend();
                             bool prepend;
                             bool sortNeeded;
                             if (std::lower_bound(xAxisDataBegin, xAxisDataEnd, firstValue) == xAxisDataEnd) {
                                 // Other data series if after data series
                                 prepend = false;
                                 sortNeeded = false;
                             }
                             else if (std::upper_bound(xAxisDataBegin, xAxisDataEnd, lastValue)
                                      == xAxisDataBegin) {
                                 // Other data series if before data series
                                 prepend = true;
                                 sortNeeded = false;
                             }
                             else {
                                 // The two data series overlap
                                 prepend = false;
                                 sortNeeded = true;
                             }
                             // Makes the merge
                             m_XAxisData->add(*other->xAxisData(), prepend);
                             m_ValuesData->add(*other->valuesData(), prepend);
                             if (sortNeeded) {
                                 sort();
                             }
                         }
                         // Clears the other data series
                         other->clear();
                     }
                     else {
                         qCWarning(LOG_DataSeries())
                             << QObject::tr("Detection of a type of IDataSeries we cannot merge with !");
                     }
                     unlock();
                     dataSeries->unlock();
                 }
                 // ///////// //
                 // Iterators //
                 // ///////// //
                 DataSeriesIterator cbegin() const override
                 {
                     return DataSeriesIterator{DataSeriesIteratorValue{
                         std::make_unique<dataseries_detail::IteratorValue<Dim> >(*this, true)}};
                 }
                 DataSeriesIterator cend() const override
                 {
                     return DataSeriesIterator{DataSeriesIteratorValue{
                         std::make_unique<dataseries_detail::IteratorValue<Dim> >(*this, false)}};
                 }
                 /// @sa IDataSeries::minXAxisData()
                 DataSeriesIterator minXAxisData(double minXAxisData) const override
                 {
                     return std::lower_bound(
                         cbegin(), cend(), minXAxisData,
                         [](const auto &itValue, const auto &value) { return itValue.x() < value; });
                 }
                 /// @sa IDataSeries::maxXAxisData()
                 DataSeriesIterator maxXAxisData(double maxXAxisData) const override
                 {
                     // Gets the first element that greater than max value
                     auto it = std::upper_bound(
                         cbegin(), cend(), maxXAxisData,
                         [](const auto &value, const auto &itValue) { return value < itValue.x(); });
                     return it == cbegin() ? cend() : --it;
                 }
                 std::pair<DataSeriesIterator, DataSeriesIterator> xAxisRange(double minXAxisData,
                                                                              double maxXAxisData) const override
                 {
                     if (minXAxisData > maxXAxisData) {
                         std::swap(minXAxisData, maxXAxisData);
                     }
                     auto begin = cbegin();
                     auto end = cend();
                     auto lowerIt = std::lower_bound(
                         begin, end, minXAxisData,
                         [](const auto &itValue, const auto &value) { return itValue.x() < value; });
                     auto upperIt = std::upper_bound(
                         begin, end, maxXAxisData,
                         [](const auto &value, const auto &itValue) { return value < itValue.x(); });
                     return std::make_pair(lowerIt, upperIt);
                 }
                 std::pair<DataSeriesIterator, DataSeriesIterator>
                 valuesBounds(double minXAxisData, double maxXAxisData) const override
                 {
                     // Places iterators to the correct x-axis range
                     auto xAxisRangeIts = xAxisRange(minXAxisData, maxXAxisData);
                     // Returns end iterators if the range is empty
                     if (xAxisRangeIts.first == xAxisRangeIts.second) {
                         return std::make_pair(cend(), cend());
                     }
                     // Gets the iterator on the min of all values data
                     auto minIt = std::min_element(
                         xAxisRangeIts.first, xAxisRangeIts.second, [](const auto &it1, const auto &it2) {
                             return SortUtils::minCompareWithNaN(it1.minValue(), it2.minValue());
                         });
                     // Gets the iterator on the max of all values data
                     auto maxIt = std::max_element(
                         xAxisRangeIts.first, xAxisRangeIts.second, [](const auto &it1, const auto &it2) {
                             return SortUtils::maxCompareWithNaN(it1.maxValue(), it2.maxValue());
                         });
                     return std::make_pair(minIt, maxIt);
                 }
                 // /////// //
                 // Mutexes //
                 // /////// //
                 virtual void lockRead() { m_Lock.lockForRead(); }
                 virtual void lockWrite() { m_Lock.lockForWrite(); }
                 virtual void unlock() { m_Lock.unlock(); }
             protected:
                 /// Protected ctor (DataSeries is abstract). The vectors must have the same size, otherwise a
                 /// DataSeries with no values will be created.
                 /// @remarks data series is automatically sorted on its x-axis data
                 explicit DataSeries(std::shared_ptr<ArrayData<1> > xAxisData, const Unit &xAxisUnit,
                                     std::shared_ptr<ArrayData<Dim> > valuesData, const Unit &valuesUnit)
                         : m_XAxisData{xAxisData},
                           m_XAxisUnit{xAxisUnit},
                           m_ValuesData{valuesData},
                           m_ValuesUnit{valuesUnit}
                 {
                     if (m_XAxisData->size() != m_ValuesData->size()) {
                         clear();
                     }
                     // Sorts data if it's not the case
                     const auto &xAxisCData = m_XAxisData->cdata();
                     if (!std::is_sorted(xAxisCData.cbegin(), xAxisCData.cend())) {
                         sort();
                     }
                 }
                 /// Copy ctor
                 explicit DataSeries(const DataSeries<Dim> &other)
                         : m_XAxisData{std::make_shared<ArrayData<1> >(*other.m_XAxisData)},
                           m_XAxisUnit{other.m_XAxisUnit},
                           m_ValuesData{std::make_shared<ArrayData<Dim> >(*other.m_ValuesData)},
                           m_ValuesUnit{other.m_ValuesUnit}
                 {
                     // Since a series is ordered from its construction and is always ordered, it is not
                     // necessary to call the sort method here ('other' is sorted)
                 }
                 /// Assignment operator
                 template <int D>
                 DataSeries &operator=(DataSeries<D> other)
                 {
                     std::swap(m_XAxisData, other.m_XAxisData);
                     std::swap(m_XAxisUnit, other.m_XAxisUnit);
                     std::swap(m_ValuesData, other.m_ValuesData);
                     std::swap(m_ValuesUnit, other.m_ValuesUnit);
                     return *this;
                 }
             private:
                 /**
                  * Sorts data series on its x-axis data
                  */
                 void sort() noexcept
                 {
                     auto permutation = SortUtils::sortPermutation(*m_XAxisData, std::less<double>());
                     m_XAxisData = m_XAxisData->sort(permutation);
                     m_ValuesData = m_ValuesData->sort(permutation);
                 }
                 std::shared_ptr<ArrayData<1> > m_XAxisData;
                 Unit m_XAxisUnit;
                 std::shared_ptr<ArrayData<Dim> > m_ValuesData;
                 Unit m_ValuesUnit;
                 QReadWriteLock m_Lock;
             };
             #endif // SCIQLOP_DATASERIES_H

General Comments 0

Write
Preview

You need to be logged in to leave comments. Login now

No TODOs yet

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
g 0-9	Goto bookmarked items from 0-9
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository access permissions settings
t s	Toggle sidebar on some pages