$cache[$key] = empty($arr) ? NULL : $arr; return $cache[$key]; } // 门户 获取需要在频道显示的栏目主题数据 function portal_channel_thread($fid) { global $forumlist; if (empty($fid)) return NULL; $orderby = array('tid' => 1); $page = 1; // 遍历所有在频道显示内容的栏目 $category_forumlist = channel_category($fid); $arrlist = array(); $forum_tids = array(); $tidlist = array(); if ($category_forumlist) { foreach ($category_forumlist as &$_forum) { // 频道显示数据 $arrlist['list'][$_forum['fid']] = array( 'fid' => $_forum['fid'], 'name' => $_forum['name'], 'rank' => $_forum['rank'], 'type' => $_forum['type'], 'url' => $_forum['url'], 'channel_new' => $_forum['channel_new'], ); $forum_thread = thread_tid__find(array('fid' => $_forum['fid']), $orderby, $page, $_forum['channel_new'], 'tid', array('tid')); // 最新信息按栏目分组 foreach ($forum_thread as $key => $_thread) { $forum_tids[$key] = $_thread; } unset($forum_thread); } $tidlist += $forum_tids; } unset($category_forumlist); // 获取属性对应的tid集合 list($flaglist, $flagtids) = flag_thread_by_fid($fid); empty($flagtids) || $tidlist += $flagtids; unset($flagtids); // 频道置顶 $stickylist = sticky_list_thread($fid); empty($stickylist) || $tidlist += $stickylist; // 在这之前合并所有二维数组 tid值为键/array('tid值' => tid值) $tidarr = arrlist_values($tidlist, 'tid'); // 在这之前使用$tidarr = array_merge($tidarr, $arr)前合并所有一维数组 tid/array(1,2,3) if (empty($tidarr)) { $arrlist['list'] = isset($arrlist['list']) ? array_multisort_key($arrlist['list'], 'rank', FALSE, 'fid') : array(); return $arrlist; } $tidarr = array_unique($tidarr); $pagesize = count($tidarr); // 遍历获取的所有tid主题 $threadlist = well_thread_find_asc($tidarr, $pagesize); // 遍历时为升序,翻转为降序 $threadlist = array_reverse($threadlist); foreach ($threadlist as &$_thread) { // 各栏目最新内容 isset($forum_tids[$_thread['tid']]) AND $arrlist['list'][$_thread['fid']]['news'][$_thread['tid']] = $_thread; // 全站置顶内容 isset($stickylist[$_thread['tid']]) AND $arrlist['sticky'][$_thread['tid']] = $_thread; // 首页属性主题 if (!empty($flaglist)) { foreach ($flaglist as $key => $val) { if (isset($val['tids']) && in_array($_thread['tid'], $val['tids'])) { $arrlist['flaglist'][$key][array_search($_thread['tid'], $val['tids'])] = $_thread; ksort($arrlist['flaglist'][$key]); $arrlist['flag'][$_thread['tid']] = $_thread; } } } } unset($threadlist); if (isset($arrlist['sticky'])) { $i = 0; foreach ($arrlist['sticky'] as &$val) { ++$i; $val['i'] = $i; } } if (isset($arrlist['flag'])) { $i = 0; foreach ($arrlist['flag'] as &$val) { ++$i; $val['i'] = $i; } } if (isset($arrlist['flaglist'])) { foreach ($arrlist['flaglist'] as &$val) { $i = 0; foreach ($val as &$v) { ++$i; $v['i'] = $i; } } } isset($arrlist['list']) AND $arrlist['list'] = array_multisort_key($arrlist['list'], 'rank', FALSE, 'fid'); return $arrlist; } ?>c++ - QSharedDataPointer for private data: how to write a good copy operator where a copy may be deleted - Stack Overflow
最新消息:雨落星辰是一个专注网站SEO优化、网站SEO诊断、搜索引擎研究、网络营销推广、网站策划运营及站长类的自媒体原创博客

c++ - QSharedDataPointer for private data: how to write a good copy operator where a copy may be deleted - Stack Overflow

programmeradmin1浏览0评论

I had to implement a copy operator for a class which contains a QSharedDataPointer to the private data. Which is working, but only as long as I do not delete one of the copies. Other than expected it seems that the reference counter is not increased by copying the pointer.


main.cpp:

#include <QtDebug>

#include "Nix.h"

int main( int , char **  )
{
  Nix *nix1 = new Nix(1, "Hello, I'm one");
  Nix *nix2 = new Nix();

  nix2 = nix1;

  nix2->add(2, "Hello, I'm two");

  Nix *nix3 = new Nix(*nix2);
  nix3->add(3, "Hello, I'm three");

  qWarning() << "nix1: " << nix2->display(1) << nix1->display(2) << nix1->display(3);
  qWarning() << "nix2: " << nix2->display(1) << nix2->display(2) << nix1->display(3);

  delete nix2; // if nix1 is deleted, accessing nix2 will produce a segment violation

  qWarning() << "nix3: " << nix3->display(1) << nix3->display(2) << nix3->display(3);

  // segmentation fault:
  qWarning() << "nix1: " << nix1->display(1) << nix1->display(2) << nix1->display(3);

  return 0;
}

Nix.h:

#include <QString>
#include <QSharedDataPointer>

class NixPrivate;

class Nix
{
public:
   Nix();
   Nix(int a, QString b);
   ~Nix();
   Nix(Nix const &other);
   Nix &operator=(const Nix &other);

  QString display(int x);
  void add(int a, QString b);

private:
  QSharedDataPointer<NixPrivate> d;
};

Nix.cpp

#include "Nix.h"

#include <QMap>
#include <QString>
#include <QSharedData>

class NixPrivate : public QSharedData
{

 public:
   QMap<int, QString> myMap;

};

Nix::Nix()
  : d(new NixPrivate())
{
}

Nix::Nix(int a, QString b)
  : Nix()
{
  d->myMap[a] = b;
}

Nix::~Nix()
{
}

Nix::Nix(Nix const &other)
  : Nix()
{
  d = other.d;
}

Nix &Nix::operator=(const Nix &other)
{
  d = other.d;

  return *this;
}

QString Nix::display(int x)
{
  if (d->myMap.contains(x))
    {
      return d->myMap.value(x);
    }
  else
    {
      return "not found";
    }
}

void Nix::add(int a, QString b)
{
  d->myMap[a] = b;
}

it seems, that the move assignment operator is called: QSharedDataPointer<T> &QSharedDataPointer::operator=(QSharedDataPointer<T> &&other)

If the documentation is right, I would need the other one: QSharedDataPointer<T> &QSharedDataPointer::operator=(const QSharedDataPointer<T> &o)

I've tried to use a cast statement, but with no success.

I had to implement a copy operator for a class which contains a QSharedDataPointer to the private data. Which is working, but only as long as I do not delete one of the copies. Other than expected it seems that the reference counter is not increased by copying the pointer.


main.cpp:

#include <QtDebug>

#include "Nix.h"

int main( int , char **  )
{
  Nix *nix1 = new Nix(1, "Hello, I'm one");
  Nix *nix2 = new Nix();

  nix2 = nix1;

  nix2->add(2, "Hello, I'm two");

  Nix *nix3 = new Nix(*nix2);
  nix3->add(3, "Hello, I'm three");

  qWarning() << "nix1: " << nix2->display(1) << nix1->display(2) << nix1->display(3);
  qWarning() << "nix2: " << nix2->display(1) << nix2->display(2) << nix1->display(3);

  delete nix2; // if nix1 is deleted, accessing nix2 will produce a segment violation

  qWarning() << "nix3: " << nix3->display(1) << nix3->display(2) << nix3->display(3);

  // segmentation fault:
  qWarning() << "nix1: " << nix1->display(1) << nix1->display(2) << nix1->display(3);

  return 0;
}

Nix.h:

#include <QString>
#include <QSharedDataPointer>

class NixPrivate;

class Nix
{
public:
   Nix();
   Nix(int a, QString b);
   ~Nix();
   Nix(Nix const &other);
   Nix &operator=(const Nix &other);

  QString display(int x);
  void add(int a, QString b);

private:
  QSharedDataPointer<NixPrivate> d;
};

Nix.cpp

#include "Nix.h"

#include <QMap>
#include <QString>
#include <QSharedData>

class NixPrivate : public QSharedData
{

 public:
   QMap<int, QString> myMap;

};

Nix::Nix()
  : d(new NixPrivate())
{
}

Nix::Nix(int a, QString b)
  : Nix()
{
  d->myMap[a] = b;
}

Nix::~Nix()
{
}

Nix::Nix(Nix const &other)
  : Nix()
{
  d = other.d;
}

Nix &Nix::operator=(const Nix &other)
{
  d = other.d;

  return *this;
}

QString Nix::display(int x)
{
  if (d->myMap.contains(x))
    {
      return d->myMap.value(x);
    }
  else
    {
      return "not found";
    }
}

void Nix::add(int a, QString b)
{
  d->myMap[a] = b;
}

it seems, that the move assignment operator is called: QSharedDataPointer<T> &QSharedDataPointer::operator=(QSharedDataPointer<T> &&other)

If the documentation is right, I would need the other one: QSharedDataPointer<T> &QSharedDataPointer::operator=(const QSharedDataPointer<T> &o)

I've tried to use a cast statement, but with no success.

Share Improve this question edited Feb 7 at 7:11 Jodeli asked Feb 6 at 13:55 JodeliJodeli 113 bronze badges 0
Add a comment  | 

1 Answer 1

Reset to default 1

This is just replacing a pointer with another pointer. nix1 = nix2

That was a total thinking failure. What I actually wanted to test was something like that:

{
     Nix nix4(4, "Hello, I'm four");

     *nix1 = nix4;
}
qWarning() << "nix1: " << nix1->display(4);

And that works.

solved, actually with help from SGaist (qt.forum)

与本文相关的文章

发布评论

评论列表(0)

  1. 暂无评论