Searched refs:pathCount (Results 1 - 8 of 8) sorted by relevance

/haiku/src/libs/icon/
H A DIcon.cpp67 int32 pathCount = other.fPaths.CountItems(); local
68 for (int32 i = 0; i < pathCount; i++) {
98 pathCount = pathSourceShape->Paths()->CountItems();
99 for (int32 j = 0; j < pathCount; j++) {
/haiku/src/kits/storage/
H A DPathFinder.cpp126 size_t pathCount; local
128 &pathArray, &pathCount);
135 for (size_t i = 0; i < pathCount; i++) {
/haiku/src/apps/icon-o-matic/shape/commands/
H A DFreezeTransformationCommand.cpp135 int32 pathCount = shape->Paths()->CountItems(); local
136 for (int32 i = 0; i < pathCount; i++) {
/haiku/src/bin/
H A Ddiff_zip.cpp312 int pathCount = argc - argi - 1; local
315 Node** rootNodes = new Node*[pathCount];
317 for (int i = 0; i < pathCount; i++) {
352 for (int i = 0; i < pathCount; i++) {
/haiku/src/apps/icon-o-matic/import_export/flat_icon/
H A DFlatIconExporter.cpp402 uint8 pathCount = min_c(255, paths->CountItems());
403 if (!buffer.Write(pathCount))
406 for (uint32 i = 0; i < pathCount; i++) {
533 uint8 pathCount = min_c(255, shape->Paths()->CountItems());
538 || !buffer.Write(pathCount))
542 for (uint32 i = 0; i < pathCount; i++) {
/haiku/src/libs/icon/flat_icon/
H A DFlatIconImporter.cpp395 uint8 pathCount; local
396 if (!buffer.Read(pathCount))
399 for (int32 i = 0; i < pathCount; i++) {
542 uint8 pathCount; local
543 if (!buffer.Read(styleIndex) || !buffer.Read(pathCount))
566 for (uint32 i = 0; i < pathCount; i++) {
/haiku/src/apps/icon-o-matic/import_export/svg/
H A DDocumentBuilder.cpp332 int32 pathCount = shape->Paths()->CountItems(); local
333 for (int32 i = 0; i < pathCount; i++) {
/haiku/src/tests/kits/storage/
H A DPathTest.cpp1179 int32 pathCount = sizeof(paths) / sizeof(const char*); local
1180 for (int32 i = 0; i < pathCount; i++) {
1181 for (int32 k = 0; k < pathCount; k++) {
1202 for (int32 i = 0; i < pathCount; i++) {
1203 for (int32 k = 0; k < pathCount; k++) {
1343 int32 pathCount = sizeof(paths) / sizeof(const char*); local
1344 for (int32 i = 0; i < pathCount; i++) {

Completed in 58 milliseconds