Attachment #2704 for bug #2589

View | Details | Raw Unified | Return to bug 2589
Collapse All | Expand All




*/ 


#include <algorithm>
#include <list>
#include <vector>
#include <ns3/log.h>

  static const int TbsIndex[32] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 9, 10, 11, 12, 13, 14, 15, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, -1, -1, -1};
#endif
  
  static const std::array<uint16_t, 188> cbSizeTable = {   // as K column of table 5.1.3-3 of TS 36,212
    
    40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 136, 144, 152,
    160, 168, 176, 184, 192, 200, 208, 216, 224, 232, 240, 248, 256, 264,

      B1 = B + C * L;
    }
  // first segmentation: K+ = minimum K in table such that C * K >= B1
  /*
   * Note that comparison function does not satisfy even the "weak"
   * requirements for comparison function stated in Section 25.4
   * of C++11 standard.  However, the only requirement for binary
   * search function (lower_bound is one of them) is that
   * cbSizeTable is partitioned with respect to e * C < B1,
   * and this condition is satisfied.
   */
  auto KPlusIter = std::lower_bound (begin (cbSizeTable), end (cbSizeTable), B1,
    [C] (const uint16_t &a, const uint16_t &b)
    {
      return a * C < b;
      if (B1 > cbSizeTable[mid]*C)
        {
          if (B1 < cbSizeTable[mid+1]*C)
            {
              break;
            }
          else
            {
              min = mid + 1;
            }
        }
      else
        {
          if (B1 > cbSizeTable[mid-1]*C)
            {
              break;
            }
          else
            {
              max = mid - 1;
            }
        }
  } while ((cbSizeTable[mid]*C != B1) && (min < max));
  // adjust binary search to the largest integer value of K containing B1
  if (B1 > cbSizeTable[mid]*C)
    {
      mid ++;
    }
  );
  uint16_t KplusId = std::distance (begin (cbSizeTable), KPlusIter);
  Kplus = *KPlusIter;

#ifdef NS3_BUILD_PROFILE_DEBUG
  {

Return to bug 2589