1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
|
/**
* @file lllocationhistory.cpp
* @brief Typed locations history
*
* $LicenseInfo:firstyear=2009&license=viewergpl$
*
* Copyright (c) 2009, Linden Research, Inc.
*
* Second Life Viewer Source Code
* The source code in this file ("Source Code") is provided by Linden Lab
* to you under the terms of the GNU General Public License, version 2.0
* ("GPL"), unless you have obtained a separate licensing agreement
* ("Other License"), formally executed by you and Linden Lab. Terms of
* the GPL can be found in doc/GPL-license.txt in this distribution, or
* online at http://secondlifegrid.net/programs/open_source/licensing/gplv2
*
* There are special exceptions to the terms and conditions of the GPL as
* it is applied to this Source Code. View the full text of the exception
* in the file doc/FLOSS-exception.txt in this software distribution, or
* online at
* http://secondlifegrid.net/programs/open_source/licensing/flossexception
*
* By copying, modifying or distributing this software, you acknowledge
* that you have read and understood your obligations described above,
* and agree to abide by those obligations.
*
* ALL LINDEN LAB SOURCE CODE IS PROVIDED "AS IS." LINDEN LAB MAKES NO
* WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,
* COMPLETENESS OR PERFORMANCE.
* $/LicenseInfo$
*/
#include "llviewerprecompiledheaders.h"
#include "lllocationhistory.h"
#include <iomanip> // for std::setw()
LLLocationHistory::LLLocationHistory() :
mFilename("typed_locations.txt"),
mLoadedCallback(NULL)
{
}
void LLLocationHistory::addItem(std::string item)
{
mItems.push_back(item);
// If the vector size exceeds the maximum, purge the oldest items.
if (mItems.size() > MAX_ITEMS)
mItems.erase(mItems.begin(), mItems.end()-MAX_ITEMS);
}
bool LLLocationHistory::getMatchingItems(std::string substring, location_list_t& result) const
{
// *TODO: an STL algorithm would look nicer
result.clear();
std::string needle = substring;
LLStringUtil::toLower(needle);
for (location_list_t::const_iterator it = mItems.begin(); it != mItems.end(); ++it)
{
std::string haystack = *it;
LLStringUtil::toLower(haystack);
if (haystack.find(needle) != std::string::npos)
result.push_back(*it);
}
return result.size();
}
void LLLocationHistory::dump() const
{
llinfos << "Location history dump:" << llendl;
int i = 0;
for (location_list_t::const_iterator it = mItems.begin(); it != mItems.end(); ++it, ++i)
{
llinfos << "#" << std::setw(2) << std::setfill('0') << i << ": " << *it << llendl;
}
}
void LLLocationHistory::save() const
{
// build filename for each user
std::string resolved_filename = gDirUtilp->getExpandedFilename(LL_PATH_PER_SL_ACCOUNT, mFilename);
// open a file for writing
llofstream file (resolved_filename);
if (!file.is_open())
{
llwarns << "can't open location history file \"" << mFilename << "\" for writing" << llendl;
return;
}
for (location_list_t::const_iterator it = mItems.begin(); it != mItems.end(); ++it)
file << (*it) << std::endl;
file.close();
}
void LLLocationHistory::load()
{
llinfos << "Loading location history." << llendl;
// build filename for each user
std::string resolved_filename = gDirUtilp->getExpandedFilename(LL_PATH_PER_SL_ACCOUNT, mFilename);
llifstream file(resolved_filename);
if (!file.is_open())
{
llwarns << "can't load location history from file \"" << mFilename << "\"" << llendl;
return;
}
// remove current entries before we load over them
mItems.clear();
// add each line in the file to the list
std::string line;
while (std::getline(file, line))
addItem(line);
file.close();
if (mLoadedCallback)
mLoadedCallback();
}
|
