summaryrefslogtreecommitdiff
path: root/db/pipeline/document_source.h
blob: 8d5f0f70847a3d18d5157e13ccd72bb4134fd8ce (plain)
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
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
/**
 * Copyright (c) 2011 10gen Inc.
 *
 * This program is free software: you can redistribute it and/or  modify
 * it under the terms of the GNU Affero General Public License, version 3,
 * as published by the Free Software Foundation.
 *
 * This program 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 Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

#pragma once

#include "pch.h"

#include <boost/unordered_map.hpp>
#include "util/intrusive_counter.h"
#include "client/parallel.h"
#include "db/jsobj.h"
#include "db/pipeline/document.h"
#include "db/pipeline/expression.h"
#include "db/pipeline/value.h"
#include "util/string_writer.h"

namespace mongo {
    class Accumulator;
    class Cursor;
    class Document;
    class Expression;
    class ExpressionContext;
    class ExpressionFieldPath;
    class ExpressionObject;
    class Matcher;

    class DocumentSource :
        public IntrusiveCounterUnsigned,
	public StringWriter {
    public:
	virtual ~DocumentSource();

	// virtuals from StringWriter
	/*
	  Write out a string representation of this pipeline operator.

	  @param ss string stream to write the string representation to
	 */
	virtual void writeString(stringstream &ss) const;


        /*
	  Is the source at EOF?

	  @returns true if the source has no more Documents to return.
        */
        virtual bool eof() = 0;

        /*
	  Advance the state of the DocumentSource so that it will return the
	  next Document.

	  @returns whether there is another document to fetch, i.e., whether or
	    not getCurrent() will succeed.
        */
        virtual bool advance() = 0;

        /*
          Advance the source, and return the next Expression.

	  @returns the current Document
          TODO throws an exception if there are no more expressions to return.
        */
        virtual intrusive_ptr<Document> getCurrent() = 0;

	/*
	  Set the underlying source this source should use to get Documents
	  from.

	  It is an error to set the source more than once.  This is to
	  prevent changing sources once the original source has been started;
	  this could break the state maintained by the DocumentSource.

	  @param pSource the underlying source to use
	 */
	virtual void setSource(const intrusive_ptr<DocumentSource> &pSource);

	/*
	  Attempt to coalesce this DocumentSource with its successor in the
	  document processing pipeline.  If successful, the successor
	  DocumentSource should be removed from the pipeline and discarded.

	  If successful, this operation can be applied repeatedly, in an
	  attempt to coalesce several sources together.

	  The default implementation is to do nothing, and return false.

	  @param pNextSource the next source in the document processing chain.
	  @returns whether or not the attempt to coalesce was successful or not;
	    if the attempt was not successful, nothing has been changed
	 */
	virtual bool coalesce(const intrusive_ptr<DocumentSource> &pNextSource);

	/*
	  Optimize the pipeline operation, if possible.  This is a local
	  optimization that only looks within this DocumentSource.  For best
	  results, first coalesce compatible sources using coalesce().

	  This is intended for any operations that include expressions, and
	  provides a hook for those to optimize those operations.

	  The default implementation is to do nothing.
	 */
	virtual void optimize();

        /*
	  Add the DocumentSource to the array builder.

	  The default implementation calls sourceToBson() in order to
	  convert the inner part of the object which will be added to the
	  array being built here.

	  @param pBuilder the array builder to add the operation to.
         */
	virtual void addToBsonArray(BSONArrayBuilder *pBuilder) const;
	
    protected:
	/*
	  Create an object that represents the document source.  The object
	  will have a single field whose name is the source's name.  This
	  will be used by the default implementation of addToBsonArray()
	  to add this object to a pipeline being represented in BSON.

	  @param pBuilder a blank object builder to write to
	 */
	virtual void sourceToBson(BSONObjBuilder *pBuilder) const = 0;

	/*
	  Most DocumentSources have an underlying source they get their data
	  from.  This is a convenience for them.

	  The default implementation of setSource() sets this; if you don't
	  need a source, override that to assert().  The default is to
	  assert() if this has already been set.
	*/
	intrusive_ptr<DocumentSource> pSource;
    };


    class DocumentSourceBsonArray :
        public DocumentSource {
    public:
        // virtuals from DocumentSource
        virtual ~DocumentSourceBsonArray();
        virtual bool eof();
        virtual bool advance();
        virtual intrusive_ptr<Document> getCurrent();
	virtual void setSource(const intrusive_ptr<DocumentSource> &pSource);

	/*
	  Create a document source based on a BSON array.

	  This is usually put at the beginning of a chain of document sources
	  in order to fetch data from the database.

	  CAUTION:  the BSON is not read until the source is used.  Any
	  elements that appear after these documents must not be read until
	  this source is exhausted.

	  @param pBsonElement the BSON array to treat as a document source
	  @returns the newly created document source
	*/
	static intrusive_ptr<DocumentSourceBsonArray> create(
	    BSONElement *pBsonElement);

    protected:
	// virtuals from DocumentSource
	virtual void sourceToBson(BSONObjBuilder *pBuilder) const;

    private:
        DocumentSourceBsonArray(BSONElement *pBsonElement);

	BSONObj embeddedObject;
	BSONObjIterator arrayIterator;
	BSONElement currentElement;
	bool haveCurrent;
    };

    
    class DocumentSourceCommandFutures :
	public DocumentSource {
    public:
	// virtuals from DocumentSource
	virtual ~DocumentSourceCommandFutures();
        virtual bool eof();
        virtual bool advance();
        virtual intrusive_ptr<Document> getCurrent();
	virtual void setSource(const intrusive_ptr<DocumentSource> &pSource);

	/* convenient shorthand for a commonly used type */
	typedef list<shared_ptr<Future::CommandResult> > FuturesList;

	/*
	  Create a DocumentSource that wraps a list of Command::Futures.

	  @param errmsg place to write error messages to; must exist for the
	    lifetime of the created DocumentSourceCommandFutures
	  @param pList the list of futures
	 */
	static intrusive_ptr<DocumentSourceCommandFutures> create(
	    string &errmsg, FuturesList *pList);

    protected:
	// virtuals from DocumentSource
	virtual void sourceToBson(BSONObjBuilder *pBuilder) const;

    private:
	DocumentSourceCommandFutures(string &errmsg, FuturesList *pList);

	/*
	  Advance to the next document, setting pCurrent appropriately.

	  Adjusts pCurrent, pBsonSource, and iterator, as needed.  On exit,
	  pCurrent is the Document to return, or NULL.  If NULL, this
	  indicates there is nothing more to return.
	 */
	void getNextDocument();

	bool newSource; // set to true for the first item of a new source
	intrusive_ptr<DocumentSourceBsonArray> pBsonSource;
	intrusive_ptr<Document> pCurrent;
	FuturesList::iterator iterator;
	FuturesList::iterator listEnd;
	string &errmsg;
    };


    class DocumentSourceCursor :
        public DocumentSource {
    public:
        // virtuals from DocumentSource
        virtual ~DocumentSourceCursor();
        virtual bool eof();
        virtual bool advance();
        virtual intrusive_ptr<Document> getCurrent();
	virtual void setSource(const intrusive_ptr<DocumentSource> &pSource);

	/*
	  Create a document source based on a cursor.

	  This is usually put at the beginning of a chain of document sources
	  in order to fetch data from the database.

	  @param pCursor the cursor to use to fetch data
	*/
	static intrusive_ptr<DocumentSourceCursor> create(
	    const shared_ptr<Cursor> &pCursor);

    protected:
	// virtuals from DocumentSource
	virtual void sourceToBson(BSONObjBuilder *pBuilder) const;

    private:
        DocumentSourceCursor(const shared_ptr<Cursor> &pTheCursor);

	void findNext();
        shared_ptr<Cursor> pCursor;
	intrusive_ptr<Document> pCurrent;
    };


    /*
      This contains all the basic mechanics for filtering a stream of
      Documents, except for the actual predicate evaluation itself.  This was
      factored out so we could create DocumentSources that use both Matcher
      style predicates as well as full Expressions.
     */
    class DocumentSourceFilterBase :
        public DocumentSource {
    public:
        // virtuals from DocumentSource
        virtual ~DocumentSourceFilterBase();
        virtual bool eof();
        virtual bool advance();
        virtual intrusive_ptr<Document> getCurrent();

	/*
	  Create a BSONObj suitable for Matcher construction.

	  This is used after filter analysis has moved as many filters to
	  as early a point as possible in the document processing pipeline.
	  See db/Matcher.h and the associated wiki documentation for the
	  format.  This conversion is used to move back to the low-level
	  find() Cursor mechanism.

	  @param pBuilder the builder to write to
	 */
	virtual void toMatcherBson(BSONObjBuilder *pBuilder) const = 0;

    protected:
        DocumentSourceFilterBase();

	/*
	  Test the given document against the predicate and report if it
	  should be accepted or not.

	  @param pDocument the document to test
	  @returns true if the document matches the filter, false otherwise
	 */
	virtual bool accept(const intrusive_ptr<Document> &pDocument) const = 0;

    private:

        void findNext();

        bool unstarted;
        bool hasNext;
        intrusive_ptr<Document> pCurrent;
    };


    class DocumentSourceFilter :
        public DocumentSourceFilterBase {
    public:
        // virtuals from DocumentSource
        virtual ~DocumentSourceFilter();
	virtual bool coalesce(const intrusive_ptr<DocumentSource> &pNextSource);
	virtual void optimize();

	/*
	  Create a filter.

          @param pBsonElement the raw BSON specification for the filter
          @returns the filter
	 */
	static intrusive_ptr<DocumentSource> createFromBson(
	    BSONElement *pBsonElement,
	    const intrusive_ptr<ExpressionContext> &pCtx);

        /*
          Create a filter.

          @param pFilter the expression to use to filter
          @returns the filter
         */
        static intrusive_ptr<DocumentSourceFilter> create(
            const intrusive_ptr<Expression> &pFilter);

	/*
	  Create a BSONObj suitable for Matcher construction.

	  This is used after filter analysis has moved as many filters to
	  as early a point as possible in the document processing pipeline.
	  See db/Matcher.h and the associated wiki documentation for the
	  format.  This conversion is used to move back to the low-level
	  find() Cursor mechanism.

	  @param pBuilder the builder to write to
	 */
	void toMatcherBson(BSONObjBuilder *pBuilder) const;

	static const char filterName[];

    protected:
	// virtuals from DocumentSource
	virtual void sourceToBson(BSONObjBuilder *pBuilder) const;

	// virtuals from DocumentSourceFilterBase
	virtual bool accept(const intrusive_ptr<Document> &pDocument) const;

    private:
        DocumentSourceFilter(const intrusive_ptr<Expression> &pFilter);

        intrusive_ptr<Expression> pFilter;
    };


    class DocumentSourceGroup :
        public DocumentSource {
    public:
        // virtuals from DocumentSource
        virtual ~DocumentSourceGroup();
        virtual bool eof();
        virtual bool advance();
        virtual intrusive_ptr<Document> getCurrent();

        /*
          Create a new grouping DocumentSource.
	  
	  @param pCtx the expression context
	  @returns the DocumentSource
         */
        static intrusive_ptr<DocumentSourceGroup> create(
	    const intrusive_ptr<ExpressionContext> &pCtx);

        /*
          Set the Id Expression.

          Documents that pass through the grouping Document are grouped
          according to this key.  This will generate the id_ field in the
          result documents.

          @param pExpression the group key
         */
        void setIdExpression(const intrusive_ptr<Expression> &pExpression);

        /*
          Add an accumulator.

          Accumulators become fields in the Documents that result from
          grouping.  Each unique group document must have it's own
          accumulator; the accumulator factory is used to create that.

          @param fieldName the name the accumulator result will have in the
                result documents
          @param pAccumulatorFactory used to create the accumulator for the
                group field
         */
        void addAccumulator(string fieldName,
			    intrusive_ptr<Accumulator> (*pAccumulatorFactory)(
			    const intrusive_ptr<ExpressionContext> &),
                            const intrusive_ptr<Expression> &pExpression);

	/*
	  Create a grouping DocumentSource from BSON.

	  This is a convenience method that uses the above, and operates on
	  a BSONElement that has been deteremined to be an Object with an
	  element named $group.

	  @param pBsonElement the BSONELement that defines the group
	  @param pCtx the expression context
	  @returns the grouping DocumentSource
	 */
        static intrusive_ptr<DocumentSource> createFromBson(
	    BSONElement *pBsonElement,
	    const intrusive_ptr<ExpressionContext> &pCtx);


	/*
	  Create a unifying group that can be used to combine group results
	  from shards.

	  @returns the grouping DocumentSource
	*/
	intrusive_ptr<DocumentSource> createMerger();

	static const char groupName[];

    protected:
	// virtuals from DocumentSource
	virtual void sourceToBson(BSONObjBuilder *pBuilder) const;

    private:
        DocumentSourceGroup(const intrusive_ptr<ExpressionContext> &pCtx);

	/*
	  Before returning anything, this source must fetch everything from
	  the underlying source and group it.  populate() is used to do that
	  on the first call to any method on this source.  The populated
	  boolean indicates that this has been done.
	 */
        void populate();
        bool populated;

        intrusive_ptr<Expression> pIdExpression;

	typedef boost::unordered_map<intrusive_ptr<const Value>,
	    vector<intrusive_ptr<Accumulator> >, Value::Hash> GroupsType;
        GroupsType groups;

        /*
          The field names for the result documents and the accumulator
          factories for the result documents.  The Expressions are the
          common expressions used by each instance of each accumulator
          in order to find the right-hand side of what gets added to the
          accumulator.  Note that each of those is the same for each group,
          so we can share them across all groups by adding them to the
          accumulators after we use the factories to make a new set of
          accumulators for each new group.

          These three vectors parallel each other.
        */
        vector<string> vFieldName;
        vector<intrusive_ptr<Accumulator> (*)(
	    const intrusive_ptr<ExpressionContext> &)> vpAccumulatorFactory;
        vector<intrusive_ptr<Expression> > vpExpression;


        intrusive_ptr<Document> makeDocument(
	    const GroupsType::iterator &rIter);

        GroupsType::iterator groupsIterator;
        intrusive_ptr<Document> pCurrent;

	intrusive_ptr<ExpressionContext> pCtx;
    };


    class DocumentSourceMatch :
        public DocumentSourceFilterBase {
    public:
        // virtuals from DocumentSource
        virtual ~DocumentSourceMatch();

	/*
	  Create a filter.

          @param pBsonElement the raw BSON specification for the filter
          @returns the filter
	 */
	static intrusive_ptr<DocumentSource> createFromBson(
	    BSONElement *pBsonElement,
	    const intrusive_ptr<ExpressionContext> &pCtx);

	/*
	  Create a BSONObj suitable for Matcher construction.

	  This is used after filter analysis has moved as many filters to
	  as early a point as possible in the document processing pipeline.
	  See db/Matcher.h and the associated wiki documentation for the
	  format.  This conversion is used to move back to the low-level
	  find() Cursor mechanism.

	  @param pBuilder the builder to write to
	 */
	void toMatcherBson(BSONObjBuilder *pBuilder) const;

	static const char matchName[];

    protected:
	// virtuals from DocumentSource
	virtual void sourceToBson(BSONObjBuilder *pBuilder) const;

	// virtuals from DocumentSourceFilterBase
	virtual bool accept(const intrusive_ptr<Document> &pDocument) const;

    private:
        DocumentSourceMatch(const BSONObj &query);

	Matcher matcher;
    };


    class DocumentSourceOut :
        public DocumentSource {
    public:
        // virtuals from DocumentSource
        virtual ~DocumentSourceOut();
        virtual bool eof();
        virtual bool advance();
        virtual intrusive_ptr<Document> getCurrent();

	/*
	  Create a document source for output and pass-through.

	  This can be put anywhere in a pipeline and will store content as
	  well as pass it on.

	  @returns the newly created document source
	*/
	static intrusive_ptr<DocumentSourceOut> createFromBson(
	    BSONElement *pBsonElement);

	static const char outName[];

    protected:
	// virtuals from DocumentSource
	virtual void sourceToBson(BSONObjBuilder *pBuilder) const;

    private:
        DocumentSourceOut(BSONElement *pBsonElement);
    };

    
    class DocumentSourceProject :
        public DocumentSource,
        public boost::enable_shared_from_this<DocumentSourceProject> {
    public:
        // virtuals from DocumentSource
        virtual ~DocumentSourceProject();
        virtual bool eof();
        virtual bool advance();
        virtual intrusive_ptr<Document> getCurrent();
	virtual void optimize();

        /*
          Create a new DocumentSource that can implement projection.

	  @returns the projection DocumentSource
        */
        static intrusive_ptr<DocumentSourceProject> create();

	/*
	  Include a field path in a projection.

	  @param fieldPath the path of the field to include
	*/
	void includePath(const string &fieldPath);

	/*
	  Exclude a field path from the projection.

	  @param fieldPath the path of the field to exclude
	 */
	void excludePath(const string &fieldPath);

        /*
          Add an output Expression in the projection.

          BSON document fields are ordered, so the new field will be
          appended to the existing set.

          @param fieldName the name of the field as it will appear
          @param pExpression the expression used to compute the field
        */
        void addField(const string &fieldName,
		      const intrusive_ptr<Expression> &pExpression);

	/*
	  Create a new projection DocumentSource from BSON.

	  This is a convenience for directly handling BSON, and relies on the
	  above methods.

	  @param pBsonElement the BSONElement with an object named $project
	  @returns the created projection
	 */
        static intrusive_ptr<DocumentSource> createFromBson(
            BSONElement *pBsonElement,
	    const intrusive_ptr<ExpressionContext> &pCtx);

	static const char projectName[];

    protected:
	// virtuals from DocumentSource
	virtual void sourceToBson(BSONObjBuilder *pBuilder) const;

    private:
        DocumentSourceProject();

        // configuration state
	bool excludeId;
	intrusive_ptr<ExpressionObject> pEO;
    };


    class DocumentSourceSort :
        public DocumentSource {
    public:
        // virtuals from DocumentSource
        virtual ~DocumentSourceSort();
        virtual bool eof();
        virtual bool advance();
        virtual intrusive_ptr<Document> getCurrent();
	/*
	  TODO
	  Adjacent sorts should reduce to the last sort.
	virtual bool coalesce(const intrusive_ptr<DocumentSource> &pNextSource);
	*/

        /*
          Create a new sorting DocumentSource.
	  
	  @param pCtx the expression context
	  @returns the DocumentSource
         */
        static intrusive_ptr<DocumentSourceSort> create(
	    const intrusive_ptr<ExpressionContext> &pCtx);

	/*
	  Add sort key field.

	  Adds a sort key field to the key being built up.  A concatenated
	  key is built up by calling this repeatedly.

	  @param fieldPath the field path to the key component
	  @param ascending if true, use the key for an ascending sort,
	    otherwise, use it for descending
	*/
	void addKey(const string &fieldPath, bool ascending);

	/*
	  Write out an object whose contents are the sort key.

	  @param pBuilder initialized object builder.
	  @param fieldPrefix specify whether or not to include the field prefix
	 */
	void sortKeyToBson(BSONObjBuilder *pBuilder, bool usePrefix) const;

	/*
	  Create a sorting DocumentSource from BSON.

	  This is a convenience method that uses the above, and operates on
	  a BSONElement that has been deteremined to be an Object with an
	  element named $group.

	  @param pBsonElement the BSONELement that defines the group
	  @param pCtx the expression context
	  @returns the grouping DocumentSource
	 */
        static intrusive_ptr<DocumentSource> createFromBson(
	    BSONElement *pBsonElement,
	    const intrusive_ptr<ExpressionContext> &pCtx);


	static const char sortName[];

    protected:
	// virtuals from DocumentSource
	virtual void sourceToBson(BSONObjBuilder *pBuilder) const;

    private:
        DocumentSourceSort(const intrusive_ptr<ExpressionContext> &pCtx);

	/*
	  Before returning anything, this source must fetch everything from
	  the underlying source and group it.  populate() is used to do that
	  on the first call to any method on this source.  The populated
	  boolean indicates that this has been done.
	 */
        void populate();
        bool populated;
        long long count;

	/* these two parallel each other */
	vector<intrusive_ptr<ExpressionFieldPath> > vSortKey;
	vector<bool> vAscending;

	class Carrier {
	public:
	    /*
	      We need access to the key for compares, so we have to carry
	      this around.
	    */
	    DocumentSourceSort *pSort;

	    intrusive_ptr<Document> pDocument;

	    Carrier(DocumentSourceSort *pSort,
		    const intrusive_ptr<Document> &pDocument);

	    static bool lessThan(const Carrier &rL, const Carrier &rR);
	};

	/*
	  Compare two documents according to the specified sort key.

	  @param rL reference to the left document
	  @param rR reference to the right document
	  @returns a number less than, equal to, or greater than zero,
	    indicating pL < pR, pL == pR, or pL > pR, respectively
	 */
	int compare(const intrusive_ptr<Document> &pL,
		    const intrusive_ptr<Document> &pR);

	typedef list<Carrier> ListType;
	ListType documents;

        ListType::iterator listIterator;
        intrusive_ptr<Document> pCurrent;

	intrusive_ptr<ExpressionContext> pCtx;
    };


    class DocumentSourceLimit :
        public DocumentSource {
    public:
        // virtuals from DocumentSource
        virtual ~DocumentSourceLimit();
        virtual bool eof();
        virtual bool advance();
        virtual intrusive_ptr<Document> getCurrent();

        /*
          Create a new limiting DocumentSource.

	  @param pCtx the expression context
	  @returns the DocumentSource
         */
        static intrusive_ptr<DocumentSourceLimit> create(
	    const intrusive_ptr<ExpressionContext> &pCtx);

	/*
	  Create a limiting DocumentSource from BSON.

	  This is a convenience method that uses the above, and operates on
	  a BSONElement that has been deteremined to be an Object with an
	  element named $limit.

	  @param pBsonElement the BSONELement that defines the limit
	  @param pCtx the expression context
	  @returns the grouping DocumentSource
	 */
        static intrusive_ptr<DocumentSource> createFromBson(
	    BSONElement *pBsonElement,
	    const intrusive_ptr<ExpressionContext> &pCtx);


	static const char limitName[];

    protected:
	// virtuals from DocumentSource
	virtual void sourceToBson(BSONObjBuilder *pBuilder) const;

    private:
        DocumentSourceLimit(const intrusive_ptr<ExpressionContext> &pCtx);

        long long limit;
        long long count;
        intrusive_ptr<Document> pCurrent;

	intrusive_ptr<ExpressionContext> pCtx;
    };

    class DocumentSourceSkip :
        public DocumentSource {
    public:
        // virtuals from DocumentSource
        virtual ~DocumentSourceSkip();
        virtual bool eof();
        virtual bool advance();
        virtual intrusive_ptr<Document> getCurrent();

        /*
          Create a new skipping DocumentSource.

	  @param pCtx the expression context
	  @returns the DocumentSource
         */
        static intrusive_ptr<DocumentSourceSkip> create(
	    const intrusive_ptr<ExpressionContext> &pCtx);

	/*
	  Create a skipping DocumentSource from BSON.

	  This is a convenience method that uses the above, and operates on
	  a BSONElement that has been deteremined to be an Object with an
	  element named $skip.

	  @param pBsonElement the BSONELement that defines the skip
	  @param pCtx the expression context
	  @returns the grouping DocumentSource
	 */
        static intrusive_ptr<DocumentSource> createFromBson(
	    BSONElement *pBsonElement,
	    const intrusive_ptr<ExpressionContext> &pCtx);


	static const char skipName[];

    protected:
	// virtuals from DocumentSource
	virtual void sourceToBson(BSONObjBuilder *pBuilder) const;

    private:
        DocumentSourceSkip(const intrusive_ptr<ExpressionContext> &pCtx);

        /*
          Skips initial documents.
         */
        void skipper();

        long long skip;
        long long count;
        intrusive_ptr<Document> pCurrent;

	intrusive_ptr<ExpressionContext> pCtx;
    };


    class DocumentSourceUnwind :
        public DocumentSource,
        public boost::enable_shared_from_this<DocumentSourceUnwind> {
    public:
        // virtuals from DocumentSource
        virtual ~DocumentSourceUnwind();
        virtual bool eof();
        virtual bool advance();
        virtual intrusive_ptr<Document> getCurrent();

        /*
          Create a new DocumentSource that can implement unwind.

	  @returns the projection DocumentSource
        */
        static intrusive_ptr<DocumentSourceUnwind> create();

        /*
	  Specify the field to unwind.  There must be exactly one before
	  the pipeline begins execution.

	  @param rFieldPath - path to the field to unwind
        */
	void unwindField(const FieldPath &rFieldPath);

	/*
	  Create a new projection DocumentSource from BSON.

	  This is a convenience for directly handling BSON, and relies on the
	  above methods.

	  @param pBsonElement the BSONElement with an object named $project
	  @returns the created projection
	 */
        static intrusive_ptr<DocumentSource> createFromBson(
            BSONElement *pBsonElement,
	    const intrusive_ptr<ExpressionContext> &pCtx);

	static const char unwindName[];

    protected:
	// virtuals from DocumentSource
	virtual void sourceToBson(BSONObjBuilder *pBuilder) const;

    private:
        DocumentSourceUnwind();

        // configuration state
	FieldPath unwindPath;

	vector<int> fieldIndex; /* for the current document, the indices
				   leading down to the field being unwound */

        // iteration state
        intrusive_ptr<Document> pNoUnwindDocument;
                                              // document to return, pre-unwind
        intrusive_ptr<const Value> pUnwindArray; // field being unwound
        intrusive_ptr<ValueIterator> pUnwinder; // iterator used for unwinding
        intrusive_ptr<const Value> pUnwindValue; // current value

	/*
	  Clear all the state related to unwinding an array.
	 */
	void resetArray();

	/*
	  Clone the current document being unwound.

	  This is a partial deep clone.  Because we're going to replace the
	  value at the end, we have to replace everything along the path
	  leading to that in order to not share that change with any other
	  clones (or the original) that we've made.

	  This expects pUnwindValue to have been set by a prior call to
	  advance().  However, pUnwindValue may also be NULL, in which case
	  the field will be removed -- this is the action for an empty
	  array.

	  @returns a partial deep clone of pNoUnwindDocument
	 */
	intrusive_ptr<Document> clonePath() const;

    };

}


/* ======================= INLINED IMPLEMENTATIONS ========================== */

namespace mongo {

    inline void DocumentSourceGroup::setIdExpression(
        const intrusive_ptr<Expression> &pExpression) {
        pIdExpression = pExpression;
    }

    inline void DocumentSourceUnwind::resetArray() {
	pNoUnwindDocument.reset();
	pUnwindArray.reset();
	pUnwinder.reset();
	pUnwindValue.reset();
    }

    inline DocumentSourceSort::Carrier::Carrier(
	DocumentSourceSort *pTheSort,
	const intrusive_ptr<Document> &pTheDocument):
	pSort(pTheSort),
	pDocument(pTheDocument) {
    }
}