Introduction

I made this class because I was in need of an efficient way to access interpolated colour values stored inside a colour gradient, for updating sky colours (but I'm sure you could find this colour gradient implementation useful for anything else). I found a gradient class in SkyX, but I decided to write my own implementation. It handles default values for the gradient bounds (black for position 0 of the gradient, white for position 1) which are use to interpolate values if no bounds (no value for position 0 nor 1) were provided. It also possible to disable the standard bounds, the colour of the lowest value will then fill the gradient positions from 0, and the upper gradient colour will fill the positions to the end. You can have a look to the test cases at the end of this page to see how those parameters impact the gradient data.
It only uses std and Ogre, so it should be portable (although it was only tested in a Windows environment).

Version note:
Developed for Ogre 1.8, should work with 1.7 too.

#ifndef __COLOUR_GRADIENT_H__
#define __COLOUR_GRADIENT_H__

#include <Ogre.h>
#include <map>

/*!
@brief Colour gradient (linear interpolation).
@details This gradient class support "autofilling" of bounds values, ie, if no colour frame with index 0.0 is provided, it use a default black colour for this position of the gradient.
In the same way, if no colour frame is provided for 1.0 value, a default white colour is used for this position of the gradient.
Autobounds default colours (black/white) can be changed or using the appropriate constructor.
Disabling autobounds is also possible (no fading to autocolour), check the default constructor optionnal parameter.
@remark idea comes from SkyX, but totally rewritten in order to be more efficient.
*/
class ColourGradient
{
public:
protected:
private:
  const bool fillBounds;                                   //!< Should we fill bound of the gradient with default colours?
  typedef std::map<float, Ogre::ColourValue> ColourFrames; //!< ColourFrames data type
  ColourFrames colourFrames;                               //!< Colour frame map
  const Ogre::ColourValue minBoundDefaultColour;           //!< The default colour for min bound
  const Ogre::ColourValue maxBoundDefaultColour;           //!< The default colour for max bound
public:
  typedef ColourFrames::value_type ColourFrame;            //!< A single colour frame, first element of the pair is the position in the gradient, second element is the colour to insert in the gradient.

public:
  /*!
  Constructor. Gradient values range is [0.0, 1.0].
  @param fillBoundsWithDefault If true, and no colour frame with index 0.0 was provided, provide a default black colour for this position of the gradient. In the same way, if no colour frame is provided for 1.0 value, a default white colour is provided for this position of the gradient.
  */
  ColourGradient(bool fillBoundsWithDefault=true);

  /*!
  Constructor, bound filling is automatically activated when using this constructor. Gradient values range is [0.0, 1.0]
  @param overridedMinDefaultColour The default "black" colour used by automatic bound filling will be replaced by the provided colour
  @param overridedMaxDefaultColour
  */
  ColourGradient(const Ogre::ColourValue& overridedMinDefaultColour, const Ogre::ColourValue& overridedMaxDefaultColour);

  /*!
  Destructor 
  */
  ~ColourGradient();

  /*!
  @Add colour frame. Gradient values range is [0.0, 1.0]
  @param CFrame Colour frame
  */
  inline void AddColourFrame(const ColourFrame& colourFrame)
  {
    AddColourFrame(colourFrame.first, colourFrame.second);
  }

  /*!
  Add colour frame. Gradient values range is [0.0, 1.0]
  @param colour Coulour of this frame
  @param gradientPosition Position of this frame in the gradient (overwrite if value exists).
  */
  inline void AddColourFrame(const float& gradientPosition, const Ogre::ColourValue& colour)
  {
    assert((gradientPosition >= 0.0f)&&(gradientPosition<=1.0f));
    if(colourFrames.find(gradientPosition) == colourFrames.end())
      colourFrames.insert(ColourFrames::value_type(gradientPosition, colour));
    else
      colourFrames[gradientPosition] = colour;
  }

  /*!
  Clear colour gradient
  */
  inline void Clear()
  {
    colourFrames.clear();
  }

  /*!
  Get colour value
  @param p Gradient values range is [0.0, 1.0]
  @return Colour at the given gradient position
  */
  const Ogre::ColourValue GetColour(float gradientPosition) const;
protected:
private:
  /*!
  Interpolate the given colour frames.
  */
  Ogre::ColourValue Interpolate(const ColourFrame& minColourFrame, const ColourFrame& maxColourFrame, const float& mediumRangeValue) const;
};

Source

#include "ColourGradient.h"

ColourGradient::ColourGradient(bool fillBoundsWithDefault) : fillBounds(fillBoundsWithDefault),
                                                             minBoundDefaultColour(Ogre::ColourValue::Black),
                                                             maxBoundDefaultColour(Ogre::ColourValue::White)
{
}

ColourGradient::ColourGradient(const Ogre::ColourValue& overridedMinDefaultColour, const Ogre::ColourValue& overridedMaxDefaultColour) : fillBounds(true),
                                                                                                                                         minBoundDefaultColour(overridedMinDefaultColour),
                                                                                                                                         maxBoundDefaultColour(overridedMaxDefaultColour)
{
}

ColourGradient::~ColourGradient()
{
}

const Ogre::ColourValue ColourGradient::GetColour(float gradientPosition) const
{
  // Check parameter
  if(gradientPosition < 0.0f)
    gradientPosition = 0.0f;
  if(gradientPosition > 1.0f)
    gradientPosition = 1.0f;

  // No colours in the gradient!
  if (colourFrames.empty())
  {
    if(!fillBounds)
      return Ogre::ColourValue::Black;
    else
      return Interpolate(ColourFrame(0.0f, minBoundDefaultColour), ColourFrame(1.0f, maxBoundDefaultColour), gradientPosition);
  }

  // If the requested colour is exactly on a colour frame position
  ColourFrames::const_iterator iSearchedColourFrame = colourFrames.find(gradientPosition);
  if(iSearchedColourFrame != colourFrames.end())
    return iSearchedColourFrame->second;

  // Only one colour
  if (colourFrames.size() == 1)
  {
    if(!fillBounds)
    {
      // No bound filling, return the unique colour.
      return colourFrames.begin()->second;
    }
    else
    {
      if(gradientPosition < colourFrames.begin()->first)
      {
        // Interpolate between default colour frame (0.0, Ogre::ColourValue::Black) and unique colour that is in the gradient.
        return Interpolate(ColourFrame(0.0f, minBoundDefaultColour), *colourFrames.begin(), gradientPosition);
      }
      else
      {
        // Interpolate between the unique colour that is in the gradient and default colour frame (1.0, Ogre::ColourValue::White).
        return Interpolate(*colourFrames.begin(), ColourFrame(1.0f, maxBoundDefaultColour), gradientPosition);
      }
    }
  }

  // Min colour value
  ColourFrames::const_iterator iMinBound = colourFrames.lower_bound(gradientPosition);
  if(iMinBound != colourFrames.begin())
    iMinBound--;

  // Max value
  ColourFrames::const_iterator iMaxBound = colourFrames.upper_bound(gradientPosition);

  // Handle the case where the requested value is below the smaller value in the gradient
  if(gradientPosition < iMinBound->first)
  {
    if(!fillBounds)
    {
      // No bound filling, return the colour which is just above the searched value.
      return iMinBound->second;
    }
    else
    {
      // Interpolate between default colour frame (0.0, Ogre::ColourValue::Black) and the colour just above the searched value.
      return Interpolate(ColourFrame(0.0f, minBoundDefaultColour), *iMinBound, gradientPosition);
    }
  }

  // Handle the case where the requested value is above the greater value in the gradient
  if(iMaxBound == colourFrames.end())
  {
    iMaxBound--;
    if(!fillBounds)
    {
      // No bound filling, return the colour which is just below the searched value.
      return iMaxBound->second;
    }
    else
    {
      // Interpolate between the colour just below the searched value and the default colour frame (1.0, Ogre::ColourValue::White).
      return Interpolate(*iMaxBound, ColourFrame(1.0f, maxBoundDefaultColour), gradientPosition);
    }
  }

  // Normal case
  return Interpolate(*iMinBound, *iMaxBound, gradientPosition);
}

Ogre::ColourValue ColourGradient::Interpolate(const ColourFrame& minColourFrame, const ColourFrame& maxColourFrame, const float& mediumRangeValue) const
{
  float range = maxColourFrame.first - minColourFrame.first;
  float rangePoint = (mediumRangeValue - minColourFrame.first) / range;
  return ((minColourFrame.second * (1.0f - rangePoint)) + (maxColourFrame.second * rangePoint));
}

Test cases

// Test filling bounds (white/red/green/blue/black)
  Ogre::ColourValue resultColour;
  ColourGradient myTest;
  myTest.AddColourFrame(0.3, Ogre::ColourValue::Red);
  myTest.AddColourFrame(0.5, Ogre::ColourValue::Green);
  myTest.AddColourFrame(0.7, Ogre::ColourValue::Blue);
  resultColour = myTest.GetColour(0.0);   // (0.0, 0.0, 0.0, 1.0)
  resultColour = myTest.GetColour(0.15);  // (0.5, 0.0, 0.0, 1.0)
  resultColour = myTest.GetColour(0.3);   // (1.0, 0.0, 0.0, 1.0)
  resultColour = myTest.GetColour(0.4);   // (0.5, 0.5, 0.0, 1.0)
  resultColour = myTest.GetColour(0.5);   // (0.0, 1.0, 0.0, 1.0)
  resultColour = myTest.GetColour(0.6);   // (0.0, 0.5, 0.5, 1.0)
  resultColour = myTest.GetColour(0.7);   // (0.0, 0.0, 1.0, 1.0)
  resultColour = myTest.GetColour(0.85);  // (0.5, 0.5, 1.0, 1.0)
  resultColour = myTest.GetColour(1.0);   // (1.0, 1.0, 1.0, 1.0)

  // Test no filling bounds (red/green/blue)
  ColourGradient myTest2(false);
  myTest2.AddColourFrame(0.3, Ogre::ColourValue::Red);
  myTest2.AddColourFrame(0.5, Ogre::ColourValue::Green);
  myTest2.AddColourFrame(0.7, Ogre::ColourValue::Blue);
  resultColour = myTest2.GetColour(0.0);  // (1.0, 0.0, 0.0, 1.0)
  resultColour = myTest2.GetColour(0.15); // (1.0, 0.0, 0.0, 1.0)
  resultColour = myTest2.GetColour(0.3);  // (1.0, 0.0, 0.0, 1.0)
  resultColour = myTest2.GetColour(0.4);  // (0.5, 0.5, 0.0, 1.0)
  resultColour = myTest2.GetColour(0.5);  // (0.0, 1.0, 0.0, 1.0)
  resultColour = myTest2.GetColour(0.6);  // (0.0, 0.5, 0.5, 1.0)
  resultColour = myTest2.GetColour(0.7);  // (0.0, 0.0, 1.0, 1.0)
  resultColour = myTest2.GetColour(0.85); // (0.0, 0.0, 1.0, 1.0)
  resultColour = myTest2.GetColour(1.0);  // (0.0, 0.0, 1.0, 1.0)

  // Test filling bounds 2 (red/green/blue)
  ColourGradient myTest3;
  myTest3.AddColourFrame(0.0, Ogre::ColourValue::Red);
  myTest3.AddColourFrame(0.5, Ogre::ColourValue::Green);
  myTest3.AddColourFrame(1.0, Ogre::ColourValue::Blue);
  resultColour = myTest3.GetColour(0.0);  // (1.0, 0.0, 0.0, 1.0)
  resultColour = myTest3.GetColour(0.25); // (0.5, 0.5, 0.0, 1.0)
  resultColour = myTest3.GetColour(0.5);  // (0.0, 1.0, 0.0, 1.0)
  resultColour = myTest3.GetColour(0.75); // (0.0, 0.5, 0.5, 1.0)
  resultColour = myTest3.GetColour(1.0);  // (0.0, 0.0, 1.0, 1.0)

  // Test no filling bounds 2 (red/green/blue)
  ColourGradient myTest4(false);
  myTest4.AddColourFrame(0.0, Ogre::ColourValue::Red);
  myTest4.AddColourFrame(0.5, Ogre::ColourValue::Green);
  myTest4.AddColourFrame(1.0, Ogre::ColourValue::Blue);
  resultColour = myTest4.GetColour(0.0);  // (1.0, 0.0, 0.0, 1.0)
  resultColour = myTest4.GetColour(0.25); // (0.5, 0.5, 0.0, 1.0)
  resultColour = myTest4.GetColour(0.5);  // (0.0, 1.0, 0.0, 1.0)
  resultColour = myTest4.GetColour(0.75); // (0.0, 0.5, 0.5, 1.0)
  resultColour = myTest4.GetColour(1.0);  // (0.0, 0.0, 1.0, 1.0)

  // Test filling bounds 3 (black/red/white)
  ColourGradient myTest5;
  myTest5.AddColourFrame(0.5, Ogre::ColourValue::Red);
  resultColour = myTest5.GetColour(0.0);  // (0.0, 0.0, 0.0, 1.0)
  resultColour = myTest5.GetColour(0.25); // (0.5, 0.0, 0.0, 1.0)
  resultColour = myTest5.GetColour(0.5);  // (1.0, 0.0, 0.0, 1.0)
  resultColour = myTest5.GetColour(0.75); // (1.0, 0.5, 0.5, 1.0)
  resultColour = myTest5.GetColour(1.0);  // (1.0, 1.0, 1.0, 1.0)

  // Test no filling bounds 3 (all red)
  ColourGradient myTest6(false);
  myTest6.AddColourFrame(0.5, Ogre::ColourValue::Red);
  resultColour = myTest6.GetColour(0.0);  // (1.0, 0.0, 0.0, 1.0)
  resultColour = myTest6.GetColour(0.25); // (1.0, 0.0, 0.0, 1.0)
  resultColour = myTest6.GetColour(0.5);  // (1.0, 0.0, 0.0, 1.0)
  resultColour = myTest6.GetColour(0.75); // (1.0, 0.0, 0.0, 1.0)
  resultColour = myTest6.GetColour(1.0);  // (1.0, 0.0, 0.0, 1.0)

  // Test filling bounds 4 (white/black)
  ColourGradient myTest7;
  resultColour = myTest7.GetColour(0.0);  // (0.0, 0.0, 0.0, 1.0)
  resultColour = myTest7.GetColour(0.5);  // (0.5, 0.5, 0.5, 1.0)
  resultColour = myTest7.GetColour(1.0);  // (1.0, 1.0, 1.0, 1.0)

  // Test no filling bounds 4 (no valid value, all black)
  ColourGradient myTest8(false);
  resultColour = myTest8.GetColour(0.0);  // (0.0, 0.0, 0.0, 1.0)
  resultColour = myTest8.GetColour(0.5);  // (0.0, 0.0, 0.0, 1.0)
  resultColour = myTest8.GetColour(1.0);  // (0.0, 0.0, 0.0, 1.0)

  // Test filling bounds 5 (red/green)
  ColourGradient myTest9(Ogre::ColourValue::Red, Ogre::ColourValue::Green);
  resultColour = myTest9.GetColour(0.0);  // (1.0, 0.0, 0.0, 1.0)
  resultColour = myTest9.GetColour(0.5);  // (0.5, 0.5, 0.0, 1.0)
  resultColour = myTest9.GetColour(1.0);  // (0.0, 1.0, 0.0, 1.0)
<HR>
Creative Commons Copyright -- Some rights reserved.


THE WORK (AS DEFINED BELOW) IS PROVIDED UNDER THE TERMS OF THIS CREATIVE COMMONS PUBLIC LICENSE ("CCPL" OR "LICENSE"). THE WORK IS PROTECTED BY COPYRIGHT AND/OR OTHER APPLICABLE LAW. ANY USE OF THE WORK OTHER THAN AS AUTHORIZED UNDER THIS LICENSE OR COPYRIGHT LAW IS PROHIBITED.

BY EXERCISING ANY RIGHTS TO THE WORK PROVIDED HERE, YOU ACCEPT AND AGREE TO BE BOUND BY THE TERMS OF THIS LICENSE. THE LICENSOR GRANTS YOU THE RIGHTS CONTAINED HERE IN CONSIDERATION OF YOUR ACCEPTANCE OF SUCH TERMS AND CONDITIONS.

1. Definitions

  • "Collective Work" means a work, such as a periodical issue, anthology or encyclopedia, in which the Work in its entirety in unmodified form, along with a number of other contributions, constituting separate and independent works in themselves, are assembled into a collective whole. A work that constitutes a Collective Work will not be considered a Derivative Work (as defined below) for the purposes of this License.
  • "Derivative Work" means a work based upon the Work or upon the Work and other pre-existing works, such as a translation, musical arrangement, dramatization, fictionalization, motion picture version, sound recording, art reproduction, abridgment, condensation, or any other form in which the Work may be recast, transformed, or adapted, except that a work that constitutes a Collective Work will not be considered a Derivative Work for the purpose of this License. For the avoidance of doubt, where the Work is a musical composition or sound recording, the synchronization of the Work in timed-relation with a moving image ("synching") will be considered a Derivative Work for the purpose of this License.
  • "Licensor" means the individual or entity that offers the Work under the terms of this License.
  • "Original Author" means the individual or entity who created the Work.
  • "Work" means the copyrightable work of authorship offered under the terms of this License.
  • "You" means an individual or entity exercising rights under this License who has not previously violated the terms of this License with respect to the Work, or who has received express permission from the Licensor to exercise rights under this License despite a previous violation.
  • "License Elements" means the following high-level license attributes as selected by Licensor and indicated in the title of this License: Attribution, ShareAlike.

2. Fair Use Rights

Nothing in this license is intended to reduce, limit, or restrict any rights arising from fair use, first sale or other limitations on the exclusive rights of the copyright owner under copyright law or other applicable laws.

3. License Grant

Subject to the terms and conditions of this License, Licensor hereby grants You a worldwide, royalty-free, non-exclusive, perpetual (for the duration of the applicable copyright) license to exercise the rights in the Work as stated below:

  • to reproduce the Work, to incorporate the Work into one or more Collective Works, and to reproduce the Work as incorporated in the Collective Works;
  • to create and reproduce Derivative Works;
  • to distribute copies or phonorecords of, display publicly, perform publicly, and perform publicly by means of a digital audio transmission the Work including as incorporated in Collective Works;
  • to distribute copies or phonorecords of, display publicly, perform publicly, and perform publicly by means of a digital audio transmission Derivative Works.
  • For the avoidance of doubt, where the work is a musical composition:
    • Performance Royalties Under Blanket Licenses. Licensor waives the exclusive right to collect, whether individually or via a performance rights society (e.g. ASCAP, BMI, SESAC), royalties for the public performance or public digital performance (e.g. webcast) of the Work.
    • Mechanical Rights and Statutory Royalties. Licensor waives the exclusive right to collect, whether individually or via a music rights society or designated agent (e.g. Harry Fox Agency), royalties for any phonorecord You create from the Work ("cover version") and distribute, subject to the compulsory license created by 17 USC Section 115 of the US Copyright Act (or the equivalent in other jurisdictions).
    • Webcasting Rights and Statutory Royalties. For the avoidance of doubt, where the Work is a sound recording, Licensor waives the exclusive right to collect, whether individually or via a performance-rights society (e.g. SoundExchange), royalties for the public digital performance (e.g. webcast) of the Work, subject to the compulsory license created by 17 USC Section 114 of the US Copyright Act (or the equivalent in other jurisdictions).


The above rights may be exercised in all media and formats whether now known or hereafter devised. The above rights include the right to make such modifications as are technically necessary to exercise the rights in other media and formats. All rights not expressly granted by Licensor are hereby reserved.

4. Restrictions

The license granted in Section 3 above is expressly made subject to and limited by the following restrictions:

  • You may distribute, publicly display, publicly perform, or publicly digitally perform the Work only under the terms of this License, and You must include a copy of, or the Uniform Resource Identifier for, this License with every copy or phonorecord of the Work You distribute, publicly display, publicly perform, or publicly digitally perform. You may not offer or impose any terms on the Work that alter or restrict the terms of this License or the recipients' exercise of the rights granted hereunder. You may not sublicense the Work. You must keep intact all notices that refer to this License and to the disclaimer of warranties. You may not distribute, publicly display, publicly perform, or publicly digitally perform the Work with any technological measures that control access or use of the Work in a manner inconsistent with the terms of this License Agreement. The above applies to the Work as incorporated in a Collective Work, but this does not require the Collective Work apart from the Work itself to be made subject to the terms of this License. If You create a Collective Work, upon notice from any Licensor You must, to the extent practicable, remove from the Collective Work any credit as required by clause 4(c), as requested. If You create a Derivative Work, upon notice from any Licensor You must, to the extent practicable, remove from the Derivative Work any credit as required by clause 4(c), as requested.
  • You may distribute, publicly display, publicly perform, or publicly digitally perform a Derivative Work only under the terms of this License, a later version of this License with the same License Elements as this License, or a Creative Commons iCommons license that contains the same License Elements as this License (e.g. Attribution-ShareAlike 2.5 Japan). You must include a copy of, or the Uniform Resource Identifier for, this License or other license specified in the previous sentence with every copy or phonorecord of each Derivative Work You distribute, publicly display, publicly perform, or publicly digitally perform. You may not offer or impose any terms on the Derivative Works that alter or restrict the terms of this License or the recipients' exercise of the rights granted hereunder, and You must keep intact all notices that refer to this License and to the disclaimer of warranties. You may not distribute, publicly display, publicly perform, or publicly digitally perform the Derivative Work with any technological measures that control access or use of the Work in a manner inconsistent with the terms of this License Agreement. The above applies to the Derivative Work as incorporated in a Collective Work, but this does not require the Collective Work apart from the Derivative Work itself to be made subject to the terms of this License.
  • If you distribute, publicly display, publicly perform, or publicly digitally perform the Work or any Derivative Works or Collective Works, You must keep intact all copyright notices for the Work and provide, reasonable to the medium or means You are utilizing: (i) the name of the Original Author (or pseudonym, if applicable) if supplied, and/or (ii) if the Original Author and/or Licensor designate another party or parties (e.g. a sponsor institute, publishing entity, journal) for attribution in Licensor's copyright notice, terms of service or by other reasonable means, the name of such party or parties; the title of the Work if supplied; to the extent reasonably practicable, the Uniform Resource Identifier, if any, that Licensor specifies to be associated with the Work, unless such URI does not refer to the copyright notice or licensing information for the Work; and in the case of a Derivative Work, a credit identifying the use of the Work in the Derivative Work (e.g., "French translation of the Work by Original Author," or "Screenplay based on original Work by Original Author"). Such credit may be implemented in any reasonable manner; provided, however, that in the case of a Derivative Work or Collective Work, at a minimum such credit will appear where any other comparable authorship credit appears and in a manner at least as prominent as such other comparable authorship credit.

5. Representations, Warranties and Disclaimer

UNLESS OTHERWISE AGREED TO BY THE PARTIES IN WRITING, LICENSOR OFFERS THE WORK AS-IS AND MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE MATERIALS, EXPRESS, IMPLIED, STATUTORY OR OTHERWISE, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF TITLE, MERCHANTIBILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, ACCURACY, OR THE PRESENCE OF ABSENCE OF ERRORS, WHETHER OR NOT DISCOVERABLE. SOME JURISDICTIONS DO NOT ALLOW THE EXCLUSION OF IMPLIED WARRANTIES, SO SUCH EXCLUSION MAY NOT APPLY TO YOU.

6. Limitation on Liability.

EXCEPT TO THE EXTENT REQUIRED BY APPLICABLE LAW, IN NO EVENT WILL LICENSOR BE LIABLE TO YOU ON ANY LEGAL THEORY FOR ANY SPECIAL, INCIDENTAL, CONSEQUENTIAL, PUNITIVE OR EXEMPLARY DAMAGES ARISING OUT OF THIS LICENSE OR THE USE OF THE WORK, EVEN IF LICENSOR HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.

7. Termination

  • This License and the rights granted hereunder will terminate automatically upon any breach by You of the terms of this License. Individuals or entities who have received Derivative Works or Collective Works from You under this License, however, will not have their licenses terminated provided such individuals or entities remain in full compliance with those licenses. Sections 1, 2, 5, 6, 7, and 8 will survive any termination of this License.
  • Subject to the above terms and conditions, the license granted here is perpetual (for the duration of the applicable copyright in the Work). Notwithstanding the above, Licensor reserves the right to release the Work under different license terms or to stop distributing the Work at any time; provided, however that any such election will not serve to withdraw this License (or any other license that has been, or is required to be, granted under the terms of this License), and this License will continue in full force and effect unless terminated as stated above.

8. Miscellaneous

  • Each time You distribute or publicly digitally perform the Work or a Collective Work, the Licensor offers to the recipient a license to the Work on the same terms and conditions as the license granted to You under this License.
  • Each time You distribute or publicly digitally perform a Derivative Work, Licensor offers to the recipient a license to the original Work on the same terms and conditions as the license granted to You under this License.
  • If any provision of this License is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this License, and without further action by the parties to this agreement, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable.
  • No term or provision of this License shall be deemed waived and no breach consented to unless such waiver or consent shall be in writing and signed by the party to be charged with such waiver or consent.
  • This License constitutes the entire agreement between the parties with respect to the Work licensed here. There are no understandings, agreements or representations with respect to the Work not specified here. Licensor shall not be bound by any additional provisions that may appear in any communication from You. This License may not be modified without the mutual written agreement of the Licensor and You.