summaryrefslogtreecommitdiff
path: root/rsc/inc
diff options
context:
space:
mode:
authorNoel Grandin <noelgrandin@gmail.com>2015-09-23 10:17:52 +0200
committerNoel Grandin <noelgrandin@gmail.com>2015-09-23 13:07:45 +0000
commit00a6992b97a806b183e368d412508801dc632f8b (patch)
tree0bda0dd3dd9ba0f47e2bd37685df866af67d08f7 /rsc/inc
parent146fe08382999faf77d268a24ba3ef3bfea18a7e (diff)
convert Link<> to typed
Change-Id: I80bd798ea5d36fa94d6b3348be713dbe2cbeab14 Reviewed-on: https://gerrit.libreoffice.org/18803 Reviewed-by: Noel Grandin <noelgrandin@gmail.com> Tested-by: Noel Grandin <noelgrandin@gmail.com>
Diffstat (limited to 'rsc/inc')
-rw-r--r--rsc/inc/rscclobj.hxx8
-rw-r--r--rsc/inc/rsctree.hxx2
2 files changed, 5 insertions, 5 deletions
diff --git a/rsc/inc/rscclobj.hxx b/rsc/inc/rscclobj.hxx
index 5eaedb6da2b5..2509e579d671 100644
--- a/rsc/inc/rscclobj.hxx
+++ b/rsc/inc/rscclobj.hxx
@@ -38,8 +38,8 @@ public:
ObjNode( const RscId & rId, CLASS_DATA pData, sal_uLong lKey );
ObjNode * DelObjNode( RscTop * pClass, sal_uLong lFileKey );
sal_uInt32 GetId() const SAL_OVERRIDE;
- RscId GetRscId(){ return aRscId; }
- sal_uLong GetFileKey(){ return lFileKey; };
+ RscId GetRscId() const { return aRscId; }
+ sal_uLong GetFileKey() const { return lFileKey; };
ObjNode* Search( const RscId &rName ) const //< search the index in the b-tree
{
return static_cast<ObjNode *>(IdNode::Search( rName ));
@@ -49,7 +49,7 @@ public:
{
return IdNode::Insert( static_cast<IdNode *>(pTN) );
}
- CLASS_DATA GetRscObj() //< get the Object from this Node
+ CLASS_DATA GetRscObj() const//< get the Object from this Node
{
return pRscObj;
@@ -79,7 +79,7 @@ public:
// insert new node in b-tree pObjBiTree
ObjNode * GetObjNode( const RscId &rRscId );
- ObjNode * GetObjNode()
+ ObjNode * GetObjNode() const
{
// hole pObjBiTree
return pObjBiTree;
diff --git a/rsc/inc/rsctree.hxx b/rsc/inc/rsctree.hxx
index f2f6ac29d6ee..209c4225d80c 100644
--- a/rsc/inc/rsctree.hxx
+++ b/rsc/inc/rsctree.hxx
@@ -43,7 +43,7 @@ protected:
NameNode* ChangeBTreeDLList();
public:
- void EnumNodes( Link<> aLink ) const;
+ void EnumNodes( Link<const NameNode&,void> aLink ) const;
NameNode* Left() const { return pLeft; }
NameNode* Right() const{ return pRight; }
NameNode* Search( const NameNode * pName ) const;