hunk.code_window: title: Configuring OTA Updates
   ---
   Expo provides various settings to configure how your app receives over-the-air (OTA) JavaScript updates. OTA updates allow you to publish a new version of your app JavaScript and assets without building a new version of your standalone app and re-submitting to app stores ([read more about the limitations](../../workflow/publishing/)).
   To perform an over-the-air update of your app, you simply run `expo publish`. If you're using release channels, specify one with `--release-channel <channel-name>` option. Please note that if you wish to update the SDK version which your app is using, you need to rebuild your app with `expo build:*` command and upload the binary file to the appropriate app store ([see the docs here](../../distribution/building-standalone-apps)).
   OTA updates are controlled by the [`updates` settings in app.json](../../workflow/configuration/#updates), which handle the initial app load, and the [Updates SDK module](../../sdk/updates/), which allows you to fetch updates asynchronously from your JS.
   ## Automatic Updates
  
hunk.labels: keep keep keep keep keep replace keep keep keep keep
hunk.after_edit: To perform an over-the-air update of your app, you simply run `expo publish`. If you're using release channels, specify one with `--release-channel <channel-name>` option. **Please note**- if you wish to update the SDK version of your app, or make [any of the these changes](../../workflow/publishing/#some-native-configuration-cant-be-updated-by), you'll need to rebuild your app with `expo build:*` command and upload the binary file to the appropriate app store ([see the docs here](../../distribution/building-standalone-apps)).
  
hunk.file_path: docs/pages/versions/v33.0.0/guides/configuring-ota-updates.md
hunk.type: replace
file: //  (C) Copyright John Maddock 2007.
  //  Use, modification and distribution are subject to the
  //  Boost Software License, Version 1.0. (See accompanying file
  //  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
  //
  //  This file is machine generated, do not edit by hand
  
  // Unrolled polynomial evaluation using second order Horners rule
  #ifndef BOOST_MATH_TOOLS_POLY_EVAL_17_HPP
  #define BOOST_MATH_TOOLS_POLY_EVAL_17_HPP
  
  namespace boost{ namespace math{ namespace tools{ namespace detail{
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T*, const V&, const mpl::int_<0>*) BOOST_MATH_NOEXCEPT(V)
  {
     return static_cast<V>(0);
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V)
  {
     return static_cast<V>(a[0]);
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT(V)
  {
     return static_cast<V>(a[1] * x + a[0]);
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT(V)
  {
     return static_cast<V>((a[2] * x + a[1]) * x + a[0]);
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT(V)
  {
     return static_cast<V>(((a[3] * x + a[2]) * x + a[1]) * x + a[0]);
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT(V)
  {
     V x2 = x * x;
     V t[2];
     t[0] = static_cast<V>(a[4] * x2 + a[2]);
     t[1] = static_cast<V>(a[3] * x2 + a[1]);
     t[0] *= x2;
     t[0] += static_cast<V>(a[0]);
     t[1] *= x;
     return t[0] + t[1];
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<6>*) BOOST_MATH_NOEXCEPT(V)
  {
     V x2 = x * x;
     V t[2];
     t[0] = a[5] * x2 + a[3];
     t[1] = a[4] * x2 + a[2];
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[1]);
     t[1] += static_cast<V>(a[0]);
     t[0] *= x;
     return t[0] + t[1];
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<7>*) BOOST_MATH_NOEXCEPT(V)
  {
     V x2 = x * x;
     V t[2];
     t[0] = static_cast<V>(a[6] * x2 + a[4]);
     t[1] = static_cast<V>(a[5] * x2 + a[3]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[2]);
     t[1] += static_cast<V>(a[1]);
     t[0] *= x2;
     t[0] += static_cast<V>(a[0]);
     t[1] *= x;
     return t[0] + t[1];
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<8>*) BOOST_MATH_NOEXCEPT(V)
  {
     V x2 = x * x;
     V t[2];
     t[0] = a[7] * x2 + a[5];
     t[1] = a[6] * x2 + a[4];
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[3]);
     t[1] += static_cast<V>(a[2]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[1]);
     t[1] += static_cast<V>(a[0]);
     t[0] *= x;
     return t[0] + t[1];
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<9>*) BOOST_MATH_NOEXCEPT(V)
  {
     V x2 = x * x;
     V t[2];
     t[0] = static_cast<V>(a[8] * x2 + a[6]);
     t[1] = static_cast<V>(a[7] * x2 + a[5]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[4]);
     t[1] += static_cast<V>(a[3]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[2]);
     t[1] += static_cast<V>(a[1]);
     t[0] *= x2;
     t[0] += static_cast<V>(a[0]);
     t[1] *= x;
     return t[0] + t[1];
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<10>*) BOOST_MATH_NOEXCEPT(V)
  {
     V x2 = x * x;
     V t[2];
     t[0] = a[9] * x2 + a[7];
     t[1] = a[8] * x2 + a[6];
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[5]);
     t[1] += static_cast<V>(a[4]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[3]);
     t[1] += static_cast<V>(a[2]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[1]);
     t[1] += static_cast<V>(a[0]);
     t[0] *= x;
     return t[0] + t[1];
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<11>*) BOOST_MATH_NOEXCEPT(V)
  {
     V x2 = x * x;
     V t[2];
     t[0] = static_cast<V>(a[10] * x2 + a[8]);
     t[1] = static_cast<V>(a[9] * x2 + a[7]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[6]);
     t[1] += static_cast<V>(a[5]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[4]);
     t[1] += static_cast<V>(a[3]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[2]);
     t[1] += static_cast<V>(a[1]);
     t[0] *= x2;
     t[0] += static_cast<V>(a[0]);
     t[1] *= x;
     return t[0] + t[1];
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<12>*) BOOST_MATH_NOEXCEPT(V)
  {
     V x2 = x * x;
     V t[2];
     t[0] = a[11] * x2 + a[9];
     t[1] = a[10] * x2 + a[8];
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[7]);
     t[1] += static_cast<V>(a[6]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[5]);
     t[1] += static_cast<V>(a[4]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[3]);
     t[1] += static_cast<V>(a[2]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[1]);
     t[1] += static_cast<V>(a[0]);
     t[0] *= x;
     return t[0] + t[1];
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<13>*) BOOST_MATH_NOEXCEPT(V)
  {
     V x2 = x * x;
     V t[2];
     t[0] = static_cast<V>(a[12] * x2 + a[10]);
     t[1] = static_cast<V>(a[11] * x2 + a[9]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[8]);
     t[1] += static_cast<V>(a[7]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[6]);
     t[1] += static_cast<V>(a[5]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[4]);
     t[1] += static_cast<V>(a[3]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[2]);
     t[1] += static_cast<V>(a[1]);
     t[0] *= x2;
     t[0] += static_cast<V>(a[0]);
     t[1] *= x;
     return t[0] + t[1];
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<14>*) BOOST_MATH_NOEXCEPT(V)
  {
     V x2 = x * x;
     V t[2];
     t[0] = a[13] * x2 + a[11];
     t[1] = a[12] * x2 + a[10];
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[9]);
     t[1] += static_cast<V>(a[8]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[7]);
     t[1] += static_cast<V>(a[6]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[5]);
     t[1] += static_cast<V>(a[4]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[3]);
     t[1] += static_cast<V>(a[2]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[1]);
     t[1] += static_cast<V>(a[0]);
     t[0] *= x;
     return t[0] + t[1];
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<15>*) BOOST_MATH_NOEXCEPT(V)
  {
     V x2 = x * x;
     V t[2];
     t[0] = static_cast<V>(a[14] * x2 + a[12]);
     t[1] = static_cast<V>(a[13] * x2 + a[11]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[10]);
     t[1] += static_cast<V>(a[9]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[8]);
     t[1] += static_cast<V>(a[7]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[6]);
     t[1] += static_cast<V>(a[5]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[4]);
     t[1] += static_cast<V>(a[3]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[2]);
     t[1] += static_cast<V>(a[1]);
     t[0] *= x2;
     t[0] += static_cast<V>(a[0]);
     t[1] *= x;
     return t[0] + t[1];
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<16>*) BOOST_MATH_NOEXCEPT(V)
  {
     V x2 = x * x;
     V t[2];
     t[0] = a[15] * x2 + a[13];
     t[1] = a[14] * x2 + a[12];
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[11]);
     t[1] += static_cast<V>(a[10]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[9]);
     t[1] += static_cast<V>(a[8]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[7]);
     t[1] += static_cast<V>(a[6]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[5]);
     t[1] += static_cast<V>(a[4]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[3]);
     t[1] += static_cast<V>(a[2]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[1]);
     t[1] += static_cast<V>(a[0]);
     t[0] *= x;
     return t[0] + t[1];
  }
  
  template <class T, class V>
  inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<17>*) BOOST_MATH_NOEXCEPT(V)
  {
     V x2 = x * x;
     V t[2];
     t[0] = static_cast<V>(a[16] * x2 + a[14]);
     t[1] = static_cast<V>(a[15] * x2 + a[13]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[12]);
     t[1] += static_cast<V>(a[11]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[10]);
     t[1] += static_cast<V>(a[9]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[8]);
     t[1] += static_cast<V>(a[7]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[6]);
     t[1] += static_cast<V>(a[5]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[4]);
     t[1] += static_cast<V>(a[3]);
     t[0] *= x2;
     t[1] *= x2;
     t[0] += static_cast<V>(a[2]);
     t[1] += static_cast<V>(a[1]);
     t[0] *= x2;
     t[0] += static_cast<V>(a[0]);
     t[1] *= x;
     return t[0] + t[1];
  }
  
  
  }}}} // namespaces
  
  #endif // include guard
  
  