Skip to content
Projeler
Gruplar
Parçacıklar
Yardım
Yükleniyor...
Oturum aç / Kaydol
Gezinmeyi değiştir
C
core
Proje
Proje
Ayrıntılar
Etkinlik
Cycle Analytics
Depo (repository)
Depo (repository)
Dosyalar
Kayıtlar (commit)
Dallar (branch)
Etiketler
Katkıda bulunanlar
Grafik
Karşılaştır
Grafikler
Konular (issue)
0
Konular (issue)
0
Liste
Pano
Etiketler
Kilometre Taşları
Birleştirme (merge) Talepleri
0
Birleştirme (merge) Talepleri
0
CI / CD
CI / CD
İş akışları (pipeline)
İşler
Zamanlamalar
Grafikler
Paketler
Paketler
Wiki
Wiki
Parçacıklar
Parçacıklar
Üyeler
Üyeler
Collapse sidebar
Close sidebar
Etkinlik
Grafik
Grafikler
Yeni bir konu (issue) oluştur
İşler
Kayıtlar (commit)
Konu (issue) Panoları
Kenar çubuğunu aç
LibreOffice
core
Commits
89dc5f0f
Kaydet (Commit)
89dc5f0f
authored
Nis 11, 2003
tarafından
Vladimir Glazounov
Dosyalara gözat
Seçenekler
Dosyalara Gözat
İndir
Eposta Yamaları
Sade Fark
INTEGRATION: CWS vcl07 (1.2.2); FILE ADDED
2003/04/08 14:28:51 obr 1.2.2.1: re-added accessibility workbench
üst
16e0e180
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
112 additions
and
0 deletions
+112
-0
NodeMap.java
toolkit/test/accessibility/NodeMap.java
+112
-0
No files found.
toolkit/test/accessibility/NodeMap.java
0 → 100644
Dosyayı görüntüle @
89dc5f0f
import
drafts.com.sun.star.accessibility.XAccessibleContext
;
import
java.util.HashMap
;
abstract
class
NodeMapCallback
{
public
abstract
void
Apply
(
AccTreeNode
aNode
);
}
/** This map translates from XAccessible objects to our internal
representations.
*/
class
NodeMap
{
public
NodeMap
()
{
maXAccessibleToNode
=
new
HashMap
();
}
/** Clear the whole map.
*/
public
void
Clear
()
{
maXAccessibleToNode
.
clear
();
}
/** @return
whether the new node was different from a previous one
repspectively was the first one set.
*/
public
boolean
InsertNode
(
XAccessibleContext
xContext
,
AccessibleTreeNode
aNode
)
{
AccessibleTreeNode
aPreviousNode
=
(
AccessibleTreeNode
)
maXAccessibleToNode
.
put
(
xContext
,
aNode
);
return
aPreviousNode
!=
aNode
;
}
protected
void
RemoveNode
(
AccessibleTreeNode
aNode
)
{
try
{
if
((
aNode
!=
null
)
&&
(
aNode
instanceof
AccTreeNode
))
{
maXAccessibleToNode
.
remove
(((
AccTreeNode
)
aNode
).
getContext
());
}
}
catch
(
Exception
e
)
{
System
.
out
.
println
(
"caught exception while removing node "
+
aNode
+
" : "
+
e
);
e
.
printStackTrace
();
}
}
public
void
ForEach
(
NodeMapCallback
aFunctor
)
{
Object
[]
aNodes
=
maXAccessibleToNode
.
values
().
toArray
();
for
(
int
i
=
0
;
i
<
aNodes
.
length
;
i
++)
{
if
(
aNodes
[
i
]
!=
null
&&
(
aNodes
[
i
]
instanceof
AccTreeNode
))
{
try
{
aFunctor
.
Apply
((
AccTreeNode
)
aNodes
[
i
]);
}
catch
(
Exception
e
)
{
System
.
out
.
println
(
"caught exception applying functor to "
+
i
+
"th node "
+
aNodes
[
i
]
+
" : "
+
e
);
e
.
printStackTrace
();
}
}
}
}
AccessibleTreeNode
GetNode
(
XAccessibleContext
xContext
)
{
return
(
AccessibleTreeNode
)
maXAccessibleToNode
.
get
(
xContext
);
}
AccessibleTreeNode
GetNode
(
Object
aObject
)
{
if
(
aObject
instanceof
XAccessibleContext
)
return
GetNode
((
XAccessibleContext
)
aObject
);
else
return
null
;
}
XAccessibleContext
GetAccessible
(
AccessibleTreeNode
aNode
)
{
if
((
aNode
!=
null
)
&&
(
aNode
instanceof
AccTreeNode
))
return
((
AccTreeNode
)
aNode
).
getContext
();
else
return
null
;
}
boolean
IsMember
(
XAccessibleContext
xContext
)
{
return
maXAccessibleToNode
.
containsKey
(
xContext
);
}
boolean
ValueIsMember
(
AccessibleTreeNode
aNode
)
{
return
maXAccessibleToNode
.
containsValue
(
aNode
);
}
private
HashMap
maXAccessibleToNode
;
}
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment