X-Git-Url: http://git.freeside.biz/gitweb/?p=freeside.git;a=blobdiff_plain;f=rt%2Flib%2FRT%2FQueues.pm;h=d6e5c76742acef8516b7a27d340adda3b63c7cc2;hp=ab58d8d6d19b742f4d4f5c062f448a584953ff63;hb=919e930aa9279b3c5cd12b593889cd6de79d67bf;hpb=c0567c688084e89fcd11bf82348b6c418f1254ac

diff --git a/rt/lib/RT/Queues.pm b/rt/lib/RT/Queues.pm
index ab58d8d6d..d6e5c7674 100755
--- a/rt/lib/RT/Queues.pm
+++ b/rt/lib/RT/Queues.pm
@@ -1,4 +1,50 @@
-#$Header: /home/cvs/cvsroot/freeside/rt/lib/RT/Queues.pm,v 1.1 2002-08-12 06:17:07 ivan Exp $
+# BEGIN BPS TAGGED BLOCK {{{
+#
+# COPYRIGHT:
+#
+# This software is Copyright (c) 1996-2015 Best Practical Solutions, LLC
+#                                          <sales@bestpractical.com>
+#
+# (Except where explicitly superseded by other copyright notices)
+#
+#
+# LICENSE:
+#
+# This work is made available to you under the terms of Version 2 of
+# the GNU General Public License. A copy of that license should have
+# been provided with this software, but in any event can be snarfed
+# from www.gnu.org.
+#
+# This work 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
+# along with this program; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
+# 02110-1301 or visit their web page on the internet at
+# http://www.gnu.org/licenses/old-licenses/gpl-2.0.html.
+#
+#
+# CONTRIBUTION SUBMISSION POLICY:
+#
+# (The following paragraph is not intended to limit the rights granted
+# to you to modify and distribute this software under the terms of
+# the GNU General Public License and is only of importance to you if
+# you choose to contribute your changes and enhancements to the
+# community by submitting them to Best Practical Solutions, LLC.)
+#
+# By intentionally submitting any modifications, corrections or
+# derivatives to this work, or any other work intended for use with
+# Request Tracker, to Best Practical Solutions, LLC, you confirm that
+# you are the copyright holder for those contributions and you grant
+# Best Practical Solutions,  LLC a nonexclusive, worldwide, irrevocable,
+# royalty-free, perpetual, license to use, copy, create derivative
+# works based on those contributions, and sublicense and distribute
+# those contributions and any derivatives thereof.
+#
+# END BPS TAGGED BLOCK }}}
 
 =head1 NAME
 
@@ -14,25 +60,26 @@
 =head1 METHODS
 
 
-=begin testing
-
-ok (require RT::TestHarness);
-ok (require RT::Queues);
-
-=end testing
 
 =cut
 
+
 package RT::Queues;
-use RT::EasySearch;
-@ISA= qw(RT::EasySearch);
 
+use strict;
+use warnings;
+
+
+use RT::Queue;
+
+use base 'RT::SearchBuilder';
+
+sub Table { 'Queues'}
 
 # {{{ sub _Init
 sub _Init { 
   my $self = shift;
-  $self->{'table'} = "Queues";
-  $self->{'primary_key'} = "id";
+  $self->{'with_disabled_column'} = 1;
 
   # By default, order by name
   $self->OrderBy( ALIAS => 'main',
@@ -41,83 +88,44 @@ sub _Init {
 
   return ($self->SUPER::_Init(@_));
 }
-# }}}
 
-# {{{ sub _DoSearch 
+sub Limit  {
+  my $self = shift;
+  my %args = ( ENTRYAGGREGATOR => 'AND',
+	       @_);
+  $self->SUPER::Limit(%args);
+}
 
-=head2 _DoSearch
 
-  A subclass of DBIx::SearchBuilder::_DoSearch that makes sure that _Disabled rows never get seen unless
-we're explicitly trying to see them.
+=head2 AddRecord
+
+Adds a record object to this collection if this user can see.
+This is used for filtering objects for both Next and ItemsArrayRef.
 
 =cut
 
-sub _DoSearch {
+sub AddRecord {
     my $self = shift;
-    
-    #unless we really want to find disabled rows, make sure we\'re only finding enabled ones.
-    unless($self->{'find_disabled_rows'}) {
-	$self->LimitToEnabled();
-    }
-    
-    return($self->SUPER::_DoSearch(@_));
-    
-}
-
-# }}}
-  
+    my $Queue = shift;
+    return unless $Queue->CurrentUserHasRight('SeeQueue');
 
-# {{{ sub Limit 
-sub Limit  {
-  my $self = shift;
-  my %args = ( ENTRYAGGREGATOR => 'AND',
-	       @_);
-  $self->SUPER::Limit(%args);
+    push @{$self->{'items'}}, $Queue;
+    $self->{'rows'}++;
 }
-# }}}
 
-# {{{ sub NewItem 
-sub NewItem  {
-  my $self = shift;
-  my $item;
 
-  use RT::Queue;
-  $item = new RT::Queue($self->CurrentUser);
-  return($item);
-}
-# }}}
 
-# {{{ sub Next 
 
-=head2 Next
+=head2 NewItem
 
-Returns the next queue that this user can see.
+Returns an empty new RT::Queue item
 
 =cut
-  
-sub Next {
+
+sub NewItem {
     my $self = shift;
-    
-    
-    my $Queue = $self->SUPER::Next();
-    if ((defined($Queue)) and (ref($Queue))) {
-
-	if ($Queue->CurrentUserHasRight('SeeQueue')) {
-	    return($Queue);
-	}
-	
-	#If the user doesn't have the right to show this queue
-	else {	
-	    return($self->Next());
-	}
-    }
-    #if there never was any queue
-    else {
-	return(undef);
-    }	
-    
+    return(RT::Queue->new($self->CurrentUser));
 }
-# }}}
+RT::Base->_ImportOverlays();
 
 1;
-