recommender_mock.cpp

Go to the documentation of this file.

// Jubatus: Online machine learning framework for distributed environment
// Copyright (C) 2012 Preferred Networks and Nippon Telegraph and Telephone Corporation.
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License version 2.1 as published by the Free Software Foundation.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA

#include <string>
#include <utility>
#include <vector>
#include "recommender_mock.hpp"

using std::istream;
using std::ostream;
using std::pair;
using std::string;
using std::vector;

namespace jubatus {
namespace core {
namespace recommender {

typedef mixable_recommender_mock_storage::model_ptr model_ptr;

recommender_mock::recommender_mock()
    : mixable_storage_(new mixable_recommender_mock_storage(
        model_ptr(new recommender_mock_storage))) {
}

recommender_mock::~recommender_mock() {
}

void recommender_mock::set_similar_relation(
    const common::sfv_t& query,
    const vector<pair<string, float> >& ids) {
  mixable_storage_->get_model()->set_similar_items(query, ids);
}

void recommender_mock::set_similar_relation(
    const string& id,
    const vector<pair<string, float> >& ids) {
  common::sfv_t query;
  decode_row(id, query);
  set_similar_relation(query, ids);
}

void recommender_mock::set_neighbor_relation(
    const common::sfv_t& query,
    const vector<pair<string, float> >& ids) {
  mixable_storage_->get_model()->set_neighbor_items(query, ids);
}

void recommender_mock::set_neighbor_relation(
    const string& id,
    const vector<pair<string, float> >& ids) {
  common::sfv_t query;
  decode_row(id, query);
  set_neighbor_relation(query, ids);
}

void recommender_mock::similar_row(
    const common::sfv_t& query,
    vector<pair<string, float> >& ids,
    size_t ret_num) const {
  mixable_storage_->get_model()->similar_items_similarity(query, ids, ret_num);
}

void recommender_mock::neighbor_row(
    const common::sfv_t& query,
    vector<pair<string, float> >& ids,
    size_t ret_num) const {
  mixable_storage_->get_model()->neighbor_items_distance(query, ids, ret_num);
}

void recommender_mock::clear() {
  mixable_storage_->get_model()->clear();
  orig_.clear();
}

void recommender_mock::clear_row(const string& id) {
  common::sfv_t sfv;
  decode_row(id, sfv);
  mixable_storage_->get_model()->remove(sfv);

  orig_.remove_row(id);
}

void recommender_mock::update_row(const string& id, const sfv_diff_t& diff) {
  common::sfv_t old_sfv;
  orig_.get_row(id, old_sfv);

  orig_.set_row(id, diff);
  common::sfv_t new_sfv;
  orig_.get_row(id, new_sfv);

  mixable_storage_->get_model()->update(old_sfv, new_sfv);
}

void recommender_mock::get_all_row_ids(vector<string>& ids) const {
  orig_.get_all_row_ids(ids);
}

string recommender_mock::type() const {
  return "recommender_mock";
}

void recommender_mock::pack(framework::packer& packer) const {
  orig_.pack(packer);
  mixable_storage_->get_model()->pack(packer);
}

void recommender_mock::unpack(msgpack::object o) {
  std::vector<msgpack::object> mems;
  o.convert(&mems);
  if (mems.size() != 2) {
    throw msgpack::type_error();
  }
  orig_.unpack(mems[0]);
  mixable_storage_->get_model()->unpack(mems[1]);
}

framework::mixable* recommender_mock::get_mixable() const {
  return mixable_storage_.get();
}

}  // namespace recommender
}  // namespace core
}  // namespace jubatus