/usr/lib/spark/current/spark-ada-strings-unbounded.adb is in spark 2012.0.deb-11+b2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 | -------------------------------------------------------------------------------
-- (C) Altran Praxis Limited
-------------------------------------------------------------------------------
--
-- The SPARK toolset is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
-- Software Foundation; either version 3, or (at your option) any later
-- version. The SPARK toolset is distributed in the hope that it will be
-- useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
-- Public License for more details. You should have received a copy of the GNU
-- General Public License distributed with the SPARK toolset; see file
-- COPYING3. If not, go to http://www.gnu.org/licenses for a complete copy of
-- the license.
--
--=============================================================================
with SPARK.Ada.Strings.Not_SPARK;
with SPARK.Ada.Strings.Maps.Not_SPARK;
package body SPARK.Ada.Strings.Unbounded is
--# hide SPARK.Ada.Strings.Unbounded;
pragma Warnings ("Y"); -- Turn off warnings for Ada 2005 features
function Get_Length (Source : Unbounded_String) return Natural is
begin
return Standard.Ada.Strings.Unbounded.Length
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source));
end Get_Length;
function Get_Null_Unbounded_String return Unbounded_String is
begin
return Null_Unbounded_String;
end Get_Null_Unbounded_String;
function Get_Element
(Source : Unbounded_String;
Index : Positive) return Character is
begin
return Standard.Ada.Strings.Unbounded.Element
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Index => Index);
end Get_Element;
function String_To_Unbounded_String
(Source : String) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded.To_Unbounded_String
(Source => Source));
end String_To_Unbounded_String;
function Length_To_Unbounded_String
(Length : Natural) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded."*" (Left => Length,
Right => ' '));
end Length_To_Unbounded_String;
-- Set_Unbounded_String is only defined in Ada 2005
procedure Set_Unbounded_String
(Target : out Unbounded_String;
Source : in String) is
begin
Standard.Ada.Strings.Unbounded.Set_Unbounded_String
(Target => Standard.Ada.Strings.Unbounded.Unbounded_String (Target),
Source => Source);
end Set_Unbounded_String;
procedure Append_Unbounded_String
(Source : in out Unbounded_String;
New_Item : in Unbounded_String) is
begin
Standard.Ada.Strings.Unbounded.Append
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
New_Item => Standard.Ada.Strings.Unbounded.Unbounded_String
(New_Item));
end Append_Unbounded_String;
procedure Append_String
(Source : in out Unbounded_String;
New_Item : in String) is
begin
Standard.Ada.Strings.Unbounded.Append
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
New_Item => New_Item);
end Append_String;
procedure Append_Char
(Source : in out Unbounded_String;
New_Item : in Character) is
begin
Standard.Ada.Strings.Unbounded.Append
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
New_Item => New_Item);
end Append_Char;
function Concat_Unbounded_String_Unbounded_String
(Left : Unbounded_String;
Right : Unbounded_String) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded."&"
(Left => Standard.Ada.Strings.Unbounded.Unbounded_String (Left),
Right => Standard.Ada.Strings.Unbounded.Unbounded_String (Right)));
end Concat_Unbounded_String_Unbounded_String;
function Concat_Unbounded_String_String
(Left : Unbounded_String;
Right : String) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded."&"
(Left => Standard.Ada.Strings.Unbounded.Unbounded_String (Left),
Right => Right));
end Concat_Unbounded_String_String;
function Concat_String_Unbounded_String
(Left : String;
Right : Unbounded_String) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded."&"
(Left => Left,
Right => Standard.Ada.Strings.Unbounded.Unbounded_String (Right)));
end Concat_String_Unbounded_String;
function Concat_Unbounded_String_Char
(Left : Unbounded_String;
Right : Character) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded."&"
(Left => Standard.Ada.Strings.Unbounded.Unbounded_String (Left),
Right => Right));
end Concat_Unbounded_String_Char;
function Concat_Char_Unbounded_String
(Left : Character;
Right : Unbounded_String) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded."&"
(Left => Left,
Right => Standard.Ada.Strings.Unbounded.Unbounded_String (Right)));
end Concat_Char_Unbounded_String;
procedure Replace_Element
(Source : in out Unbounded_String;
Index : in Positive;
By : in Character) is
begin
Standard.Ada.Strings.Unbounded.Replace_Element
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Index => Index,
By => By);
end Replace_Element;
-- Unbounded_Slice is only available in Ada 2005
function Function_Unbounded_Slice
(Source : Unbounded_String;
Low : Positive;
High : Natural) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded.Unbounded_Slice
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Low => Low,
High => High));
end Function_Unbounded_Slice;
procedure Procedure_Unbounded_Slice
(Source : in Unbounded_String;
Target : out Unbounded_String;
Low : in Positive;
High : in Natural) is
begin
Standard.Ada.Strings.Unbounded.Unbounded_Slice
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Target => Standard.Ada.Strings.Unbounded.Unbounded_String (Target),
Low => Low,
High => High);
end Procedure_Unbounded_Slice;
function Equal_Unbounded_String_Unbounded_String
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean is
begin
return Standard.Ada.Strings.Unbounded."="
(Left => Standard.Ada.Strings.Unbounded.Unbounded_String (Left),
Right => Standard.Ada.Strings.Unbounded.Unbounded_String (Right));
end Equal_Unbounded_String_Unbounded_String;
function Equal_Unbounded_String_String
(Left : Unbounded_String;
Right : String) return Boolean is
begin
return Standard.Ada.Strings.Unbounded."="
(Left => Standard.Ada.Strings.Unbounded.Unbounded_String (Left),
Right => Right);
end Equal_Unbounded_String_String;
function Equal_String_Unbounded_String
(Left : String;
Right : Unbounded_String) return Boolean is
begin
return Standard.Ada.Strings.Unbounded."="
(Left => Left,
Right => Standard.Ada.Strings.Unbounded.Unbounded_String (Right));
end Equal_String_Unbounded_String;
function Less_Unbounded_String_Unbounded_String
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean is
begin
return Standard.Ada.Strings.Unbounded."<"
(Left => Standard.Ada.Strings.Unbounded.Unbounded_String (Left),
Right => Standard.Ada.Strings.Unbounded.Unbounded_String (Right));
end Less_Unbounded_String_Unbounded_String;
function Less_Unbounded_String_String
(Left : Unbounded_String;
Right : String) return Boolean is
begin
return Standard.Ada.Strings.Unbounded."<"
(Left => Standard.Ada.Strings.Unbounded.Unbounded_String (Left),
Right => Right);
end Less_Unbounded_String_String;
function Less_String_Unbounded_String
(Left : String;
Right : Unbounded_String) return Boolean is
begin
return Standard.Ada.Strings.Unbounded."<"
(Left => Left,
Right => Standard.Ada.Strings.Unbounded.Unbounded_String (Right));
end Less_String_Unbounded_String;
function Less_Equal_Unbounded_String_Unbounded_String
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean is
begin
return Standard.Ada.Strings.Unbounded."<="
(Left => Standard.Ada.Strings.Unbounded.Unbounded_String (Left),
Right => Standard.Ada.Strings.Unbounded.Unbounded_String (Right));
end Less_Equal_Unbounded_String_Unbounded_String;
function Less_Equal_Unbounded_String_String
(Left : Unbounded_String;
Right : String) return Boolean is
begin
return Standard.Ada.Strings.Unbounded."<="
(Left => Standard.Ada.Strings.Unbounded.Unbounded_String (Left),
Right => Right);
end Less_Equal_Unbounded_String_String;
function Less_Equal_String_Unbounded_String
(Left : String;
Right : Unbounded_String) return Boolean is
begin
return Standard.Ada.Strings.Unbounded."<="
(Left => Left,
Right => Standard.Ada.Strings.Unbounded.Unbounded_String (Right));
end Less_Equal_String_Unbounded_String;
function Greater_Unbounded_String_Unbounded_String
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean is
begin
return Standard.Ada.Strings.Unbounded.">"
(Left => Standard.Ada.Strings.Unbounded.Unbounded_String (Left),
Right => Standard.Ada.Strings.Unbounded.Unbounded_String (Right));
end Greater_Unbounded_String_Unbounded_String;
function Greater_Unbounded_String_String
(Left : Unbounded_String;
Right : String) return Boolean is
begin
return Standard.Ada.Strings.Unbounded.">"
(Left => Standard.Ada.Strings.Unbounded.Unbounded_String (Left),
Right => Right);
end Greater_Unbounded_String_String;
function Greater_String_Unbounded_String
(Left : String;
Right : Unbounded_String) return Boolean is
begin
return Standard.Ada.Strings.Unbounded.">"
(Left => Left,
Right => Standard.Ada.Strings.Unbounded.Unbounded_String (Right));
end Greater_String_Unbounded_String;
function Greater_Equal_Unbounded_String_Unbounded_String
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean is
begin
return Standard.Ada.Strings.Unbounded.">="
(Left => Standard.Ada.Strings.Unbounded.Unbounded_String (Left),
Right => Standard.Ada.Strings.Unbounded.Unbounded_String (Right));
end Greater_Equal_Unbounded_String_Unbounded_String;
function Greater_Equal_Unbounded_String_String
(Left : Unbounded_String;
Right : String) return Boolean is
begin
return Standard.Ada.Strings.Unbounded.">="
(Left => Standard.Ada.Strings.Unbounded.Unbounded_String (Left),
Right => Right);
end Greater_Equal_Unbounded_String_String;
function Greater_Equal_String_Unbounded_String
(Left : String;
Right : Unbounded_String) return Boolean is
begin
return Standard.Ada.Strings.Unbounded.">="
(Left => Left,
Right => Standard.Ada.Strings.Unbounded.Unbounded_String (Right));
end Greater_Equal_String_Unbounded_String;
function Index_Pattern
(Source : Unbounded_String;
Pattern : String;
Going : Strings.Direction;
Mapping : Maps.Character_Mapping) return Natural is
begin
return Standard.Ada.Strings.Unbounded.Index
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Pattern => Pattern,
Going => SPARK.Ada.Strings.Not_SPARK.To_Direction (From => Going),
Mapping => SPARK.Ada.Strings.Maps.Not_SPARK.To_Character_Mapping
(From => Mapping));
end Index_Pattern;
function Index_Set
(Source : Unbounded_String;
Arg_Set : Maps.Character_Set;
Test : Strings.Membership;
Going : Strings.Direction) return Natural is
begin
return Standard.Ada.Strings.Unbounded.Index
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Set => SPARK.Ada.Strings.Maps.Not_SPARK.To_Character_Set
(From => Arg_Set),
Test => SPARK.Ada.Strings.Not_SPARK.To_Membership (From => Test),
Going => SPARK.Ada.Strings.Not_SPARK.To_Direction (From => Going));
end Index_Set;
-- Index is only defined in Ada 2005
function Index_Pattern_From
(Source : Unbounded_String;
Pattern : String;
Arg_From : Positive;
Going : Strings.Direction;
Mapping : Maps.Character_Mapping) return Natural is
begin
return Standard.Ada.Strings.Unbounded.Index
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Pattern => Pattern,
From => Arg_From,
Going => SPARK.Ada.Strings.Not_SPARK.To_Direction (From => Going),
Mapping => SPARK.Ada.Strings.Maps.Not_SPARK.To_Character_Mapping
(From => Mapping));
end Index_Pattern_From;
function Index_Set_From
(Source : Unbounded_String;
Arg_Set : Maps.Character_Set;
Arg_From : Positive;
Test : Strings.Membership;
Going : Strings.Direction) return Natural is
begin
return Standard.Ada.Strings.Unbounded.Index
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Set => SPARK.Ada.Strings.Maps.Not_SPARK.To_Character_Set
(From => Arg_Set),
From => Arg_From,
Test => SPARK.Ada.Strings.Not_SPARK.To_Membership (From => Test),
Going => SPARK.Ada.Strings.Not_SPARK.To_Direction (From => Going));
end Index_Set_From;
-- Index_Non_Blank is only defined in Ada 2005
function Index_Non_Blank
(Source : Unbounded_String;
Going : Strings.Direction) return Natural is
begin
return Standard.Ada.Strings.Unbounded.Index_Non_Blank
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Going => SPARK.Ada.Strings.Not_SPARK.To_Direction (From => Going));
end Index_Non_Blank;
function Index_Non_Blank_From
(Source : Unbounded_String;
Arg_From : Positive;
Going : Strings.Direction) return Natural is
begin
return Standard.Ada.Strings.Unbounded.Index_Non_Blank
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
From => Arg_From,
Going => SPARK.Ada.Strings.Not_SPARK.To_Direction (From => Going));
end Index_Non_Blank_From;
function Count_Pattern
(Source : Unbounded_String;
Pattern : String;
Mapping : Maps.Character_Mapping) return Natural is
begin
return Standard.Ada.Strings.Unbounded.Count
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Pattern => Pattern,
Mapping => SPARK.Ada.Strings.Maps.Not_SPARK.To_Character_Mapping
(From => Mapping));
end Count_Pattern;
function Count_Set
(Source : Unbounded_String;
Arg_Set : Maps.Character_Set) return Natural is
begin
return Standard.Ada.Strings.Unbounded.Count
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Set => SPARK.Ada.Strings.Maps.Not_SPARK.To_Character_Set
(From => Arg_Set));
end Count_Set;
procedure Find_Token
(Source : in Unbounded_String;
Arg_Set : in Maps.Character_Set;
Test : in Strings.Membership;
Arg_First : out Positive;
Arg_Last : out Natural) is
begin
Standard.Ada.Strings.Unbounded.Find_Token
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Set => SPARK.Ada.Strings.Maps.Not_SPARK.To_Character_Set
(From => Arg_Set),
Test => SPARK.Ada.Strings.Not_SPARK.To_Membership (From => Test),
First => Arg_First,
Last => Arg_Last);
end Find_Token;
function Function_Translate
(Source : Unbounded_String;
Mapping : Maps.Character_Mapping) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded.Translate
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String
(Source),
Mapping => SPARK.Ada.Strings.Maps.Not_SPARK.To_Character_Mapping
(From => Mapping)));
end Function_Translate;
procedure Procedure_Translate
(Source : in out Unbounded_String;
Mapping : in Maps.Character_Mapping) is
begin
Standard.Ada.Strings.Unbounded.Translate
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Mapping => SPARK.Ada.Strings.Maps.Not_SPARK.To_Character_Mapping
(From => Mapping));
end Procedure_Translate;
function Function_Replace_Slice
(Source : Unbounded_String;
Low : Positive;
High : Natural;
By : String) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded.Replace_Slice
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Low => Low,
High => High,
By => By));
end Function_Replace_Slice;
procedure Procedure_Replace_Slice
(Source : in out Unbounded_String;
Low : in Positive;
High : in Natural;
By : in String) is
begin
Standard.Ada.Strings.Unbounded.Replace_Slice
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Low => Low,
High => High,
By => By);
end Procedure_Replace_Slice;
function Function_Insert
(Source : Unbounded_String;
Before : Positive;
New_Item : String) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded.Insert
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String
(Source),
Before => Before,
New_Item => New_Item));
end Function_Insert;
procedure Procedure_Insert
(Source : in out Unbounded_String;
Before : in Positive;
New_Item : in String) is
begin
Standard.Ada.Strings.Unbounded.Insert
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Before => Before,
New_Item => New_Item);
end Procedure_Insert;
function Function_Overwrite
(Source : Unbounded_String;
Position : Positive;
New_Item : String) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded.Overwrite
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String
(Source),
Position => Position,
New_Item => New_Item));
end Function_Overwrite;
procedure Procedure_Overwrite
(Source : in out Unbounded_String;
Position : in Positive;
New_Item : in String) is
begin
Standard.Ada.Strings.Unbounded.Overwrite
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Position => Position,
New_Item => New_Item);
end Procedure_Overwrite;
function Function_Delete
(Source : Unbounded_String;
Arg_From : Positive;
Through : Natural) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded.Delete
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String
(Source),
From => Arg_From,
Through => Through));
end Function_Delete;
procedure Procedure_Delete
(Source : in out Unbounded_String;
Arg_From : in Positive;
Through : in Natural) is
begin
Standard.Ada.Strings.Unbounded.Delete
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
From => Arg_From,
Through => Through);
end Procedure_Delete;
function Function_Trim_Side
(Source : Unbounded_String;
Side : Trim_End) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded.Trim
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Side => SPARK.Ada.Strings.Not_SPARK.To_Trim_End (From => Side)));
end Function_Trim_Side;
procedure Procedure_Trim_Side
(Source : in out Unbounded_String;
Side : in Trim_End) is
begin
Standard.Ada.Strings.Unbounded.Trim
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Side => SPARK.Ada.Strings.Not_SPARK.To_Trim_End (From => Side));
end Procedure_Trim_Side;
function Function_Trim_Character_Set
(Source : Unbounded_String;
Left : Maps.Character_Set;
Right : Maps.Character_Set) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded.Trim
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Left => SPARK.Ada.Strings.Maps.Not_SPARK.To_Character_Set
(From => Left),
Right => SPARK.Ada.Strings.Maps.Not_SPARK.To_Character_Set
(From => Right)));
end Function_Trim_Character_Set;
procedure Procedure_Trim_Character_Set
(Source : in out Unbounded_String;
Left : in Maps.Character_Set;
Right : in Maps.Character_Set) is
begin
Standard.Ada.Strings.Unbounded.Trim
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Left => SPARK.Ada.Strings.Maps.Not_SPARK.To_Character_Set
(From => Left),
Right => SPARK.Ada.Strings.Maps.Not_SPARK.To_Character_Set
(From => Right));
end Procedure_Trim_Character_Set;
function Function_Head
(Source : Unbounded_String;
Count : Natural;
Pad : Character) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded.Head
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Count => Count,
Pad => Pad));
end Function_Head;
procedure Procedure_Head
(Source : in out Unbounded_String;
Count : in Natural;
Pad : in Character) is
begin
Standard.Ada.Strings.Unbounded.Head
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Count => Count,
Pad => Pad);
end Procedure_Head;
function Function_Tail
(Source : Unbounded_String;
Count : Natural;
Pad : Character) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded.Tail
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Count => Count,
Pad => Pad));
end Function_Tail;
procedure Procedure_Tail
(Source : in out Unbounded_String;
Count : in Natural;
Pad : in Character) is
begin
Standard.Ada.Strings.Unbounded.Tail
(Source => Standard.Ada.Strings.Unbounded.Unbounded_String (Source),
Count => Count,
Pad => Pad);
end Procedure_Tail;
function Times_Char
(Left : Natural;
Right : Character) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded."*" (Left => Left,
Right => Right));
end Times_Char;
function Times_String
(Left : Natural;
Right : String) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded."*" (Left => Left,
Right => Right));
end Times_String;
function Times_Unbounded_String
(Left : Natural;
Right : Unbounded_String) return Unbounded_String is
begin
return Unbounded_String
(Standard.Ada.Strings.Unbounded."*"
(Left => Left,
Right => Standard.Ada.Strings.Unbounded.Unbounded_String (Right)));
end Times_Unbounded_String;
end SPARK.Ada.Strings.Unbounded;
|