874: Requisition Group

Test Case #:874	Test Case Name: Requisition Group
System: OpenLMIS	Subsystem:blue
Test case designed by: Paulina Borowa	Design Date: 07.10.2016
Short description: Verify that: the Requisition Group Code is required, length 50 characters, the requisition group name is required, length 50 characters, the supervisory node is required requisition group code cannot be duplicated, it is unique ~~and sequentially made RequisitionGroup1 = rg1 and will continue rg2, rg3~~ description is optional and a string, length 250 characters, requisition group name is a string supervisory node matches a defined supervisory node any number of facilities can be assigned a requisition group code Each requisition group can be assigned a program and schedule (see UI for example) Requisition groups can have multiple programs assigned to it

Pre – conditions:

Demo data

Step	Action	Expected system response	Comment
1	Create Requisition Group In Url: http://10.222.17.205/referencedata/api/requisitionGroups?access_token=3d7831d4-87ec-41ba-96a5-ea91c09a97be Method: Post Example Body: { "id": "00000000-0000-0000-0000-000000000000", "code": "Requisition Group Code1", "name": "Requisition Group Name", "supervisoryNode": { "id": "00000000-0000-0000-0000-000000000001" }, "memberFacilities": [{"id": "00000000-0000-0000-0000-000000000001"}, {"id": "00000000-0000-0000-0000-000000000002"}, {"id":"00000000-0000-0000-0000-000000000003"}], "requisitionGroupProgramSchedules": [{"id": "6674c6b1-42ec-40ab-9eff-bb48677a9625"}, {"id": "ab33925f-3762-4f8c-ac31-bd9a5e961dda"}, {"id": "8a3af2d4-3b88-46dd-83df-493507128c70"}] }	Status 201 created
2	Check validation for: the Requisition Group Code is required, length 50 characters, the requisition group name is required, length 50 characters description is optional and a string, length 250 characters, requisition group name is a string
3	Check if: the supervisory node is required supervisory node matches a defined supervisory node
4	Check if: requisition group code cannot be duplicated, it is unique
5
6
7
8