Copyright cleanup

Added shaped sample to scripts


git-svn-id: https://svn.wxwidgets.org/svn/wx/wxWidgets/trunk@19863 c3d73ce0-8a6f-49c7-b76d-6d57e0e08775
This commit is contained in:
Julian Smart
2003-03-29 13:53:55 +00:00
parent f0f7bd8a4f
commit 4a9dba0e56
29 changed files with 69 additions and 84 deletions

View File

@@ -196,12 +196,12 @@ wxExpr::wxExpr(wxList *the_list)
wxExpr *listExpr = new wxExpr(wxExprList);
wxNode *node = the_list->First();
wxNode *node = the_list->GetFirst();
while (node)
{
wxExpr *expr = (wxExpr *)node->Data();
wxExpr *expr = (wxExpr *)node->GetData();
listExpr->Append(expr);
node = node->Next();
node = node->GetNext();
}
Append(listExpr);
@@ -605,13 +605,13 @@ void wxExpr::AddAttributeValueStringList(const wxString& attribute, wxList *stri
// First make a list of wxExpr strings
wxExpr *listExpr = new wxExpr(wxExprList);
wxNode *node = string_list->First();
wxNode *node = string_list->GetFirst();
while (node)
{
wxChar *string = (wxChar*)node->GetData();
wxExpr *expr = new wxExpr(wxExprString, wxString(string));
listExpr->Append(expr);
node = node->Next();
node = node->GetNext();
}
// Now make an (=, Att, Value) triple
@@ -907,7 +907,7 @@ wxExprDatabase::~wxExprDatabase(void)
void wxExprDatabase::BeginFind(void) // Initialise a search
{
position = First();
position = GetFirst();
}
wxExpr *wxExprDatabase::FindClause(long id) // Find a term based on an integer id attribute
@@ -916,7 +916,7 @@ wxExpr *wxExprDatabase::FindClause(long id) // Find a term based on an integer
wxExpr *found = NULL;
while (position && !found)
{
wxExpr *term = (wxExpr *)position->Data();
wxExpr *term = (wxExpr *)position->GetData();
if (term->Type() == wxExprList)
{
@@ -924,7 +924,7 @@ wxExpr *wxExprDatabase::FindClause(long id) // Find a term based on an integer
if (value->Type() == wxExprInteger && value->IntegerValue() == id)
found = term;
}
position = position->Next();
position = position->GetNext();
}
return found;
}
@@ -935,7 +935,7 @@ wxExpr *wxExprDatabase::FindClause(const wxString& word, const wxString& val)
wxExpr *found = NULL;
while (position && !found)
{
wxExpr *term = (wxExpr *)position->Data();
wxExpr *term = (wxExpr *)position->GetData();
if (term->Type() == wxExprList)
{
@@ -944,7 +944,7 @@ wxExpr *wxExprDatabase::FindClause(const wxString& word, const wxString& val)
(value->Type() == wxExprString && value->StringValue() == val))
found = term;
}
position = position->Next();
position = position->GetNext();
}
return found;
}
@@ -954,7 +954,7 @@ wxExpr *wxExprDatabase::FindClause(const wxString& word, long val)
wxExpr *found = NULL;
while (position && !found)
{
wxExpr *term = (wxExpr *)position->Data();
wxExpr *term = (wxExpr *)position->GetData();
if (term->Type() == wxExprList)
{
@@ -962,7 +962,7 @@ wxExpr *wxExprDatabase::FindClause(const wxString& word, long val)
if ((value->Type() == wxExprInteger) && (value->IntegerValue() == val))
found = term;
}
position = position->Next();
position = position->GetNext();
}
return found;
}
@@ -972,7 +972,7 @@ wxExpr *wxExprDatabase::FindClause(const wxString& word, double val)
wxExpr *found = NULL;
while (position && !found)
{
wxExpr *term = (wxExpr *)position->Data();
wxExpr *term = (wxExpr *)position->GetData();
if (term->Type() == wxExprList)
{
@@ -980,7 +980,7 @@ wxExpr *wxExprDatabase::FindClause(const wxString& word, double val)
if ((value->Type() == wxExprReal) && (value->RealValue() == val))
found = term;
}
position = position->Next();
position = position->GetNext();
}
return found;
}
@@ -990,14 +990,14 @@ wxExpr *wxExprDatabase::FindClauseByFunctor(const wxString& functor)
wxExpr *found = NULL;
while (position && !found)
{
wxExpr *term = (wxExpr *)position->Data();
wxExpr *term = (wxExpr *)position->GetData();
if (term->Type() == wxExprList)
{
if (term->Functor() == functor)
found = term;
}
position = position->Next();
position = position->GetNext();
}
return found;
}
@@ -1048,13 +1048,13 @@ wxExpr *wxExprDatabase::HashFind(const wxString& functor, const wxString& value)
void wxExprDatabase::ClearDatabase(void)
{
noErrors = 0;
wxNode *node = First();
wxNode *node = GetFirst();
while (node)
{
wxExpr *expr = (wxExpr *)node->Data();
wxExpr *expr = (wxExpr *)node->GetData();
delete expr;
delete node;
node = First();
node = GetFirst();
}
if (hash_table)
@@ -1110,12 +1110,12 @@ bool wxExprDatabase::Write(const wxString& fileName)
bool wxExprDatabase::Write(FILE *stream)
{
noErrors = 0;
wxNode *node = First();
wxNode *node = GetFirst();
while (node)
{
wxExpr *expr = (wxExpr *)node->Data();
wxExpr *expr = (wxExpr *)node->GetData();
expr->WriteClause(stream);
node = node->Next();
node = node->GetNext();
}
return (noErrors == 0);
}

View File

@@ -3,7 +3,7 @@
# Author: David Webster
# Created: 1999
# Updated:
# Copyright: c) 1993, AIAI, University of Edinburgh
# Copyright:
#
# "%W% %G%"
#

View File

@@ -3,7 +3,7 @@
# Author: Julian Smart, Robert Roebling, Vadim Zeitlin, Ron Lee
# Created: 1993
# Updated: 2001
# Copyright:(c) 1993, AIAI, University of Edinburgh,
# Copyright:,
# Copyright:(c) 1999, Vadim Zeitlin
# Copyright:(c) 1999, Robert Roebling
# Copyright:(c) 2001, Ron Lee

View File

@@ -3,7 +3,7 @@
# Author: Julian Smart
# Created: 1993
# Updated:
# Copyright: (c) 1993, AIAI, University of Edinburgh
# Copyright:
#
# "%W% %G%"
#

View File

@@ -3,7 +3,7 @@
# Author: Julian Smart
# Created: 1993
# Updated:
# Copyright: (c) 1993, AIAI, University of Edinburgh
# Copyright:
#
# "%W% %G%"
#

View File

@@ -3,7 +3,7 @@
# Author: Julian Smart
# Created: 1993
# Updated:
# Copyright: (c) 1993, AIAI, University of Edinburgh
# Copyright:
#
# "%W% %G%"
#

View File

@@ -2186,10 +2186,10 @@ wxDCCacheEntry::~wxDCCacheEntry()
wxDCCacheEntry* wxDC::FindBitmapInCache(WXHDC dc, int w, int h)
{
int depth = ::GetDeviceCaps((HDC) dc, PLANES) * ::GetDeviceCaps((HDC) dc, BITSPIXEL);
wxNode* node = sm_bitmapCache.First();
wxNode* node = sm_bitmapCache.GetFirst();
while (node)
{
wxDCCacheEntry* entry = (wxDCCacheEntry*) node->Data();
wxDCCacheEntry* entry = (wxDCCacheEntry*) node->GetData();
if (entry->m_depth == depth)
{
@@ -2207,7 +2207,7 @@ wxDCCacheEntry* wxDC::FindBitmapInCache(WXHDC dc, int w, int h)
return entry;
}
node = node->Next();
node = node->GetNext();
}
WXHBITMAP hBitmap = (WXHBITMAP) ::CreateCompatibleBitmap((HDC) dc, w, h);
if ( !hBitmap)
@@ -2222,10 +2222,10 @@ wxDCCacheEntry* wxDC::FindBitmapInCache(WXHDC dc, int w, int h)
wxDCCacheEntry* wxDC::FindDCInCache(wxDCCacheEntry* notThis, WXHDC dc)
{
int depth = ::GetDeviceCaps((HDC) dc, PLANES) * ::GetDeviceCaps((HDC) dc, BITSPIXEL);
wxNode* node = sm_dcCache.First();
wxNode* node = sm_dcCache.GetFirst();
while (node)
{
wxDCCacheEntry* entry = (wxDCCacheEntry*) node->Data();
wxDCCacheEntry* entry = (wxDCCacheEntry*) node->GetData();
// Don't return the same one as we already have
if (!notThis || (notThis != entry))
@@ -2236,7 +2236,7 @@ wxDCCacheEntry* wxDC::FindDCInCache(wxDCCacheEntry* notThis, WXHDC dc)
}
}
node = node->Next();
node = node->GetNext();
}
WXHDC hDC = (WXHDC) ::CreateCompatibleDC((HDC) dc);
if ( !hDC)

View File

@@ -8,7 +8,7 @@
# Author: Julian Smart
# Created: 1993
# Updated:
# Copyright:(c) 1993, AIAI, University of Edinburgh
# Copyright:
#
# "%W% %G%"
#

View File

@@ -6,7 +6,7 @@
# Author: Julian Smart, Robert Roebling, Vadim Zeitlin
# Created: 1993
# Updated: 1999
# Copyright:(c) 1993, AIAI, University of Edinburgh,
# Copyright:,
# Copyright:(c) 1999, Vadim Zeitlin
# Copyright:(c) 1999, Robert Roebling
#

View File

@@ -3,7 +3,7 @@
# Author: David Webster
# Created: 1999
# Updated:
# Copyright: c) 1993, AIAI, University of Edinburgh
# Copyright:
#
# "%W% %G%"
#

View File

@@ -3,7 +3,7 @@
# Author: Julian Smart
# Created: 1993
# Updated:
# Copyright: (c) 1993, AIAI, University of Edinburgh
# Copyright:
#
# "%W% %G%"
#

View File

@@ -3,7 +3,7 @@
# Author: David Webster
# Created: 1999
# Updated:
# Copyright: c) 1993, AIAI, University of Edinburgh
# Copyright:
#
# "%W% %G%"
#